Bonfring International Journal of Research in Communication Engineering, Vol. 5, No.

1, February 2015

Analytical Framework for Path Reliability and

Load Balancing in Mobile Adhoc Networks
A.B. Suguna and B.S. Thabasukannan
Abstract--- In current existence, multi-path routing
protocols have attained more concentration in mobile ad hoc
networks as compared to further routing schemes due to their
abilities and efficiency in civilizing bandwidth of
communication, greater than ever deliverance steadfastness,
responding to jamming and grave traffic. More than a few
protocols have been urbanized to speak to multi path routing,
but it always has a problem that the discovered paths may be
not cent percent disjoint and distribution data is done in only
one course until it's broken; the finding of multiple paths also
generates more transparency on the network. H-PDVR tried to
solve previous multi path problems, distributing traffic among
multiple paths and will bring path reliability We employed a
simple test state of affairs to be convinced of projected model
competence
Keywords--- Dynamic Source Routing Load Balancing,
MANET, Path Reliability, Wireless Networking

I.

INTRODUCTION

ETWORKS without wires have become all the time more

well-liked in the computing industry. This is
predominantly factual within the precedent decade, which has
seen wireless networks being tailored to facilitate mobility.
There are at this time two variations of mobile wireless
networks. A mobile network without fixed topology, normally
known as an ad hoc network. There are two types of adhoc
networks, the first is recognized as the infrastructure network
The subsequent sort of mobile wireless network is the
(MANET) is a collection of mobile wireless nodes that
appearance a network in competition of any federal
supervision, while forwarding packets to apiece other in a
multi-hop manner. In Mobile Ad Hoc Networking, the
communication does not rely on any obtainable infrastructure
such as committed routers, transceiver base stations or even
cables. Mobile devices with wireless radio tackle are
hypothetical to communicate with each other, without the help
of any fixed strategy. In order to make that work, each node
needs to act as a router to relay packets to nodes out of direct
communication variety. Beneath these circumstances, routing
is much more multifaceted than in static networks. Routing is
A.B. Suguna, Research Scholar, Department of Computer Science,
Bharathiar University, Coimbatore. E-mail:Suguna.apa@gmail.com
B.S. Tabasukannan, Principal, Department of Computer Science, Pannai
College
of
Engineering,
Anna
University,
Sivagangai.
Email:thabasukannan@gmail.com
DOI: 10.9756/BIJRCE.7005

the the majority active research field in MANETs. The routing

protocols calculated for wired networks are not appropriate for
wireless networks owing to the node mobility issues in
wireless networks plentiful protocols have been residential for
ad hoc mobile networks. Such protocols must agreement with
the archetypal confines of these networks, which include high
power expenditure, low bandwidth, and high error rates.
Routing protocols for MANETs can be classified in several
ways one of the classifications is according to the number of
paths, uni-path routing protocols and multipath routing
protocols. In uni-path routing protocols: one route is used to
deliver data from source node to destination node while in
multipath routing protocols more than one route is used to
deliver the data. Because of the dynamic nature of the
network, ad hoc routing faces many unique problems not
present in wired networks. Due to node mobility, node
failures, and the dynamic characteristics of the radio channel,
links in a route may become temporarily unavailable and
making the route invalid. The overhead of finding substitute
routes may be high and extra delay in packet delivery may be
introduced. The multipath routing addresses this problem by
given that more than one route to a target node.
Multipath routing appears to be a gifted technique for
Adhoc routing protocols. Provided that multiple paths
purposely disjoint paths is advantageous in network
communications, where routes are kaput and the assembly is
still active. Also because of mobility and poor wireless link
worth, the starting place and in-between nodes can use these
routes as main and backup routes. On the other hand, traffics
can be scattered amongst multiple paths for maximizing
network duration and pleasing to the eye load balancing.
Modern researches have shown that the data flow between the
starting place and end MANET nodes could be speeded up if it
is competently rip on multiple paths stuck between them. The
source node will guess how tiring these paths are and fling
packets to these paths according to its estimation . Load
balancing is a methodology to allocate workload transversely
multiple paths, to achieve optimal source utilization, get the
most out of throughput, minimize rejoinder time, increase
network life time, and avoid overload. Using multiple paths
with load balancing, in its place of a single path, may increase
reliability through being without a job. The load balancing
service is frequently provided by dedicated software or
hardware, such as a multilayer switch or a Domain Name
System server. Load balancing techniques may have a variety
of special features as:
Asymmetric consignment: A ratio can be by hand assigned
to origin some paths to get a better divide up of the workload
than others.

ISSN 2277 - 5080 | 2015 Bonfring

Bonfring International Journal of Research in Communication Engineering, Vol. 5, No. 1, February 2015

Precedence commencement: the workload is disseminated

according to paths main concern as the size of free
bandwidth and number of hops.
We will introduce a new routing method that is an iterative
one through the address tree, based on a hierarchical form of
multi-path proactive distance-vector routing(H-PDVR) that
make benefits of load balancing and path reliability in
multipath routing.
This paper is organized as follows: a literature survey in
multipath routing and load balancing is presented in Section 2.
Section 3 introduces a methodology of our proposed model the
H-PDVR, while Section 4 represents an experimental results.
Finally, Section 5 outlines our conclusions
II. LITERATURE SURVEY
Mounting routing protocols for MANETs has been an
widespread research area throughout the earlier period . In
exacting, energy well-organized routing is the most chief
design criterion for MANETs while mobile nodes will be
powered by batteries with limited capacity. The power failure
of a mobile node not only affects the node itself but also its
ability to forward packets on behalf of others and as a result
the generally network natural life which is our most interest.
The on-demand routing is the the majority accepted come up
to in the MANET. In its place of periodically exchanging
route communication to persist a everlasting route table of the
full topology, the on-demand routing protocols put together
routes no more than when a node necessities to send the data
packets to a objective. The customary protocols of this type
are the Dynamic Source Routing and the Ad hoc On-demand
Distance Vector routing. However, these protocols do not
support multipath. Multiple paths can be useful in improving
the valuable bandwidth of communication pairs, responding to
clogging and rupture traffic, and increasing deliverance
reliability. The multipath on-demand routing protocols as the
Ad hoc On-demand Multipath Distance Vector , the Split
Multipath Routing , the Multipath Source Routing , the Ad
hoc On-demand Distance Vector Multipath Routing and the
Node Disjoint Multipath Routing . These protocols build
multiple routes based on demand. Also Routing On-demand
Acyclic Multipath presents an on-demand distance-vector
which is essentially a multipath version of DUAL , which uses
a notion called practicable distance to preserve routes and loop
freedom. In conclusion Energy Aware On-demand Multipath
Routing protocols as the Grid-Based Energy Aware Node-D
Disjoint Multipath Routing Algorithm considers energy aware
and node-disjoint multipath, it uses grid-head election
algorithm to select the grid-head which is responsible for
forwarding routing in sequence and transmitting data packets.
The Ant-based Energy Aware Disjoint Multipath Routing
Algorithm is based on swarm intelligence and more than ever
on the ant colony based meta heuristic. All the earlier multipath routing protocols achieved great consequences in multipath routing but they are still anguish from balancing data
through transfer in parallel routes. A multi-path routing
protocol with load balancing strategy was planned in .The
purpose here is to multiply the traffic regularly into multiple
paths which are to be had for each source-destination pair. The

algorithm distributes the load into multiple paths evenly, i.e.

the total number of congested packets on each route is equal.
In a heuristic equation was proposed to balance the traffic load
based on an intuitive assumption. The work of analyzed
theoretically the characterization of optimal routing, and gave
an example of a network with two paths. But their analysis did
not deem cross-traffic when solving the load-balancing
problem. While analyzes the effect on the distribution of input
traffic surrounded by multiple paths in Ad Hoc On Demand
Distance Vector Routing with Multi-Path, opening of all, by
giving the core of the AODVMP, and then deceitful and
realizing a load-balancing algorithm based on AODV-MP
made up of sovereign nodes, which source node distributes
packets rationally in the more than a few paths according to
the load state of the network. From the earlier we can see that
the past load balancing multi-path algorithms suffers from
many dilemmas as the restricted number of generated paths
and the non efficient load balancing procedure. In AODV-MP
load balancing the ceiling number of generated paths is three
paths. While in MRP-LP complementary the data load is
dispersed into multiple paths squarely non concerning the each
path state and load. In next section we will present our
wished-for load balancing parallel routing protocol
representing how it avoids and maintains other load balancing
multi-path problems as we specified in earlier sections.
III. METHODOLOGY
This routing process contains a distribute hash table and a
location-based addressing diagram for a scalable routing
service. Here each nodule provisions routes en route for sets of
nodes, and the cardinality of the sets depend on the overlay
distance among the starting place and the target addresses. It
adopts a hierarchical approach, which allows one to lessen the
routing state information stored by each node with respect to a
flat approach from O(n) to O(log(n)), where n is the number
of nodes in the network.
New-fangled routing method resorts to a multi-path policy:
the address gap organization is augmented by storing multiple
routes toward each set of nodes. through regards to the address
space overlay, the multi-path come up to improves the
tolerance of the tree display alongside mobility as well as
channel impairments while, with reference to the packet
forwarding, it improves the presentation by means of route
assortment.
A. Construction of the Projected Method
New routing method resorts to a network-layer architecture
in which each node has a permanent unique id, to identify the
node in the network, and a transient network address that
reflects the nodes topological location inside the network.
Nodes acquire network addresses by listening for the routing
update packets exchanged by neighbors.
In overlay network model is a tree-based structure offers
simple and manageable procedures for address allocation. It
contains low fault-tolerance as well as traffic congestion
vulnerability since there exists only one path between any pair
of nodes.

ISSN 2277 - 5080 | 2015 Bonfring

Bonfring International Journal of Research in Communication Engineering, Vol. 5, No. 1, February 2015

b.

Figure 1: New Routing Method Address Space Overlay

The address overlay embeds only a fractional acquaintance
on the subject of the substantial network topology, since only
a subset of the available communication associations is used
for the routing. For such reasons, we counsel to enlarge the
tree structure by storing in the routing tables multiple next
hops towards the identical sibling.
New routing method is an iterative one from beginning to
end the address tree, based on a hierarchical form of multipath proactive distance-vector routing. New routing method
routing tables have n sections, one for each sibling. The kth
section stores the accessible routes (the next hops) towards a
node belonging to the level-k sibling. The hierarchical
attribute of New routing method is based on the thought of
sibling and it allows nodes to lessen the routing position
information, and the routing update size. It assures that routes
toward far nodes remain valid despite local topology changes
occurred in the environs of these nodes. Since the routing
development is based on the network addresses, they have to
be resourcefully circulated crosswise the network.
B. Processes of Latest Method
In the design, the address allocation process allows nodes
to get hold of a applicable network address, even as the route
discovery process is responsible of both routing-table building
and updating. The services provided by these processes are
exploited by the packet forwarding process, which is in charge
of both choosing the best route and forwarding the packets
through. The address discovery procedure materials the
mapping between identifiers and network addresses, by
resorting to the packet forwarding services. To conclude, the
link quality inference process assesses the quality of the on
hand links, underside so the other processes.
a.

Address Grant Progression

New routing method exploits a stateful approach based on
multiple disjoint allocation tables. When a new node joins the
network, it listens for the hello packets exchanged by
neighbors to acquire a valid and available address. It
guarantees that nodes, which share the same address form a
connected sub-graph in the network topology is known as the
prefix constraint one. The detection of duplicate addresses
resorts to the subtree identifier concept: we define as subtree
id the lowest node id of all the nodes whose network addresses
belong to that subtree. The subtree ids allow New routing
method to detect the presence of the same address in two
disconnected parts of the network.

Association Superiority Inference Procedure

It allows the packet forwarding process to choose the
routes assuring the highest throughput and enables the address
allocation process to converge to a steady state. To estimate
the link quality, New routing method resorts to the hello
packets and to a moving average filtering. Each node locally
broadcasts the hellos with an average period T. As mentioned
before, the link quality is also used in the routing process to
compute the path cost by means of the expected transmission
count (ETX). This metric estimate the expected number of
packet transmissions required to successfully deliver a packet
to the ultimate destination.
c.

Trail Sighting Procedure

It maintains a dependable routing state from end to end
the network by updating the routing tables by way of the
information broadcasted by nodes with the hellos. A routing
table is finished up by L sections, where L is the network
address length and the kth section contains several routes. Each
entry contains four fields: the network address of the next hop,
the sibling id, the path cost and the route log. another way, a
routing update contains no more than L entries i.e one entry
for both sibling, and each entry contains the sibling id, the
path cost and the route log. If a node stores multiple routes on
the way to the same sibling, it will only record in the routing
update the information concerning the best route, according to
the path cost. All progression requires a loop appreciation
mechanism to avoid that the information stored in a route
update visits the same node more times.
d.

Packet Forwarding Procedure

Here the route is singled out by taking into account the
hierarchical feature of New routing method, by choosing, as
next hop, the neighbor which shares the longest address prefix
with the destination. If there are multiple neighbors sharing
the longest address prefix, the node will select the one with the
lowest route cost.
e.

Address Unearthing Procedure

This supplies the mapping between node identifiers and
network addresses resorting to a distributed hash table (DHT).
It exploits the hierarchical nature of New routing methodto
address the challenges related to the design of both the two
services provided by a DHT system, namely, association of
information to peers and query forwarding to responsible
peers. Since network addresses are assigned to nodes
according to the network topology, there is no assurance that
the peer location computed with the hash function is valid, i.e.
it has been assigned to a node. To overcome such a drawback,
we propose a distributed mechanism (indirect referencing),
characterized by low communication overhead and absence of
node coordination. Here the peer validation resorts only on the
topological information stored in the routing table, without the
need of explicit node coordination;

ISSN 2277 - 5080 | 2015 Bonfring

Bonfring International Journal of Research in Communication Engineering, Vol. 5, No. 1, February 2015

IV. EXPERIMENTAL RESULTS

In this section, we present a numerical performance
analysis of the proposed protocol by resorting to NS-2. At this
end, for the sake of performance comparison, we consider
three commonly adopted routing protocols, namely AODV,
DSR and DSDV. We ran a large set of experiments to explore
the impact of several workloads and environmental parameters
on the protocol performances by adopting the following three
metrics: Packet delivery ratio (PDR) means the ratio between
the number of data packets successfully received, hop count
means the number of hops a data packet took to reach its
destination and routing overhead means the ratio between the
number of generated data packets and the total number of
generated routing packets;

Packet Delivery Ratio

Each experiment ran ten times, and for each metric we

estimated both its average value and the standard deviation.
1
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0

AODV
DSDV
DSR
New Method

50

100

150

200

250

300

350

400

we account for both the delivery ratio and the hop count
performances, DSDV performs better than AODV since, by
delivering the same number of packets on shorter routes, it
uses more efficiently the network resources. The 4th figure
shown that the aggregate data throughput delivered on TCP
flows by both new routing method and AODV is unaffected
by the number of nodes, whereas both DSDV and DSR
performances decreases as the number of nodes grows.
Moreover, TCP favors shorter connections, that is, it exhibits
flow elasticity, as confirmed by the results in terms of hop
number (all the protocols deliver packet on routes shorter than
3 hops in a network with 384 nodes).
The results show the presence of a saturation effect for
both the scenarios, which assures that the overhead is bounded
in terms of memory space. Such a behavior is due to the
choice of adopting a threshold based on the link quality in
order to accept the routing updates from neighbors.
The figure 5 shows that DSR outperforms all the other
protocols in terms of routing overhead due to its aggressive
route caching policy. Again, DSDV and AODV perform
similarly in small networks but, when the number of nodes
grows, AODV performs worst due to its reactive nature. In
small networks, new routing method exhibits the highest
overhead, since its routing update packets have fixed size,
regardless of the node number. However, when the number of
nodes grows, its behavior becomes comparable with those of
the other proactive protocol, i.e. the DSDV.

Node Number

Figure 2: Packet Delivery Ratio vs Node No

Overhead

5
AODV
DSDV
DSR
New Method

3
1
-1

50

100

150
200
250
Node Number

AODV
DSDV
DSR
New Method
0

300

350

Figure 3: Hop Count vs Node No

In the 2nd figure, New routing method remains largely
unaffected as the number of nodes increases. On the other
hand, DSDV and AODV performances decrease rough
linearly with the number of nodes. Finally, DSR outperforms
all the remaining protocols only for small networks whereas,
as the number of nodes increases, its performances become the
worst and, with reference to largest networks, nearly an order
of magnitude separates them from those of new routing
method.
In the 3rd figure, new routing method has been designed to
prefer reliable paths, despite of the hop number. Moreover, its
hierarchical nature is a potential source of path length
inefficiency. However, its performances are comparable with
those of AODV and DSR, which experience a path stretch,
defined as the ratio between the discovered path length and the
shortest path length, of roughly two. DSDV is able to
discovery routes very close to the shortest ones. Moreover, if

50

100

150
200
250
Node Number

300

350

400

Figure 4: Routing Overhead vs Node No

400

0.95
Packet Delivery Ratio

Hop Count

1
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0

0.85
0.75
AODV
DSDV
DSR
New Method

0.65
0.55
0.45
0

3
4
Data Load (Mb/s)

Figure 5: Packet Delivery Ratio vs Data Load

The figure 6 shows that the proactive protocols are able to
scale well in terms of data load, whereas both DSR and
AODV performances are affected by this parameter. Among
all the protocols, new routing method outperforms for nearly
each data load. Moreover numerical results, not here reported,
show that new routing method outperforms all the other

ISSN 2277 - 5080 | 2015 Bonfring

Bonfring International Journal of Research in Communication Engineering, Vol. 5, No. 1, February 2015

protocols in terms of delivery ratios for rough every data load

when the number of nodes exceeds 64.
6

Hop Count

5.5
5
4.5

AODV
DSR

DSDV
New Method

3.5
0

3
4
Data Load (Mb/s)

Figure 6: Hop Count vs Data Load

1

toward such an approach by focusing our attention on the

problem of implementing a scalable network layer.
The new method is used to allow nodes to exploit
hierarchical routing, limiting so the overhead introduced in the
network and used to map the transient identifiers and node
identities. Performance comparisons with three existing
methods substantiate the effectiveness of the new proposed
method for large ad-hoc networks operating in presence of
channel hostility and moderate mobility. Since this new
method adopts a multi-path strategy and the performances of
these strategies are commonly evaluated by numerical
simulations, an analytical framework to evaluate the
performance gain achieved by multi-path routing has been
proposed. By resorting to numerical simulations based on a
widely adopted routing performance metric, packet delivery
ratio, hop count and overhead, the proposed framework has
been validated and the results show the effectiveness of new
method.

Overhead

0.9

REFERENCES

AODV
DSDV
DSR
New Method

0.8

[1]

0.7

[2]
0.6
0

3
4
Data Load

[3]
[4]

Figure7: Routing Overhead vs Data Load Take

In the figure 7, the path lengths of proactive protocols are
unaffected by the data load. DSDV routes have length closer
to shortest ones. In the right side figure the proactive routing
traffic does not depend on the data load, since the routing
overhead decreases linearly with the data load, whereas the
reactive routing traffic increases linearly with the data load.

[5]

[6]

[7]

V. CONCLUSION
In this paper, the espousal of a new hierarchical routing
method to accomplish a scalable network layer for ad hoc
networks has been projected. The foremost impression of
hierarchical routing is to continue, at any node, inclusive
routing in sequence about nodes which are close up to it and
partial information about nodes positioned further away.

[8]

It has been revealed that the overhead desirable by current

networking protocols for ad hoc networks increases so fast
with the numeral of nodes that it sooner or later consumes all
of the on hand bandwidth also in networks with levelheaded
size. One of the main reasons for such a lack of scalability is
that they have been proposed for wired networks and modified
to cope with ad hoc scenarios. More specifically, they are
based on the assumption that node identity equals routing
address that is, they exploit static addressing which of course
is not yet valid in ad hoc scenarios. Recently, some routing
protocols have exploited the idea of decoupling identification
from location, by resorting to distribute hash table services,
which are used to distribute the nodes location information
throughout the network. In this paper, we give a contribution

[10]

[9]

[11]

[12]

[13]

[14]

A. Boldyreva, Efficient threshold signatures, multisignatures and blind

signatures based on the Gap-Diffie-Hellman-group signature scheme,
Lecture Notes in Computer Science, vol. 2567, pp. 3146, 2008.
Leonard Kleinrock and Farouk Kamoun. Hierarchical routing for large
networks; performance evaluation and optimization. Computer
Networks, vol.1:155174, 2009.
X. Hong, K. Xu, and M. Gerla. Scalable routing protocols for mobile
ad hoc networks. IEEE Network, 16(4), pp 1121, July 2007.
Elizabeth Belding-Royer. Routing approaches in mobile ad hoc
networks. In Ad Hoc Networking, pp 275300. IEEE PressWiley, 2008.
J. Broch, D.A.Maltz, D.B. Johnson, Y. Hu, and J.A. Jetcheva. A
performance comparison of multi-hop wireless ad hoc network routing
protocols. In MobiCom 09: Proceedings of the 10thannual ACM/IEEE
international conference on Mobile computing and networking, pp 85
97, 2009.
S. R. Das, R. Castaneda, and J. Yan. Comparative performance
evaluation of routing protocols for mobile, ad hoc. In IC3N 09:
Proceedings of the International Conference on Computer
Communications and Networks, pp 153, 2009.
.Elizabeth M. Royer and Chai-Keong Toh. A review of current routing
protocols for ad hoc mobile wireless networks. IEEE Personal
Communications, 6:4655, 2009.
Charles Perkins and Pravin Bhagwat. Highly dynamic destination
sequenced distance-vector routing for mobile computers. In SIGCOMM
09: ACM Conference on Communications Architectures, Protocols and
Applications, pp 234244, 2009.
S.R. Das, E.M. Royer. Performance comparison of two on-demand
routing protocols for ad hoc networks. In INFOCOM 2009. Nineteenth
Annual Joint Conference of the IEEE Computer and Communications
Societies. Proceedings. IEEE, volume 1, pages 312, 2009.
Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie
Hu. High-throughput multicast routing metrics in wireless mesh
networks. Ad Hoc Network, 6(6):pp 878899, 2009.
P.P. Pham and S. Perreau. Performance analysis of reactive shortest
path and multipath routing mechanism with load balance. INFOCOM
2003: Twenty-Second Annual Joint Conference of the IEEE Computer
and Communications Societies, 1:pp 251259, 2008.
Tracy Camp, Jeff Boleng, and Vanessa Davies A survey of mobility
models for ad hoc network research Wireless Communications and
Mobile Computing, 2(5):pp 483502, 2009.
H. Pucha, S. M. Das, and Y. Hu Imposed route reuse in ad hoc network
routing protocols using structured peer-to-peer overlay routing IEEE
Transactions on Parallel and Distributed Systems, 17(12):14521467,
2009.
Maleki M., Dantu K., and Pedram M., . Poweraware Source Routing
Protocol for Mobile Ad Hoc Networks. Dept. of EE-Systems,
University of Southern California, Los Angeles, CA 90089. ,2002

ISSN 2277 - 5080 | 2015 Bonfring

Bonfring International Journal of Research in Communication Engineering, Vol. 5, No. 1, February 2015

[15] D.Lang,A comprehensive overview about selected Ad Hoc Networking

Routing Protocols. Department of Computer Science, Technische
University at Munchen, Germany,2003
[16] N.Cooper and B.Meghanathan, Impact of Mobility Models on MultiPath Routing In Mobile Ad Hoc Networks. International Journal of
Computer Networks & Communications (IJCNC), Vol. 2, No.1,2010.
[17] C.Hieu, D.Kim, C.Hong and Y.Bang, On-demand Multi-path
Balancing in Wireless Mesh Networks. International Conference on
Information Networking, ICOIN. Issue Date: 21-24,2009
[18] Wang L., Shu Y., Zhao Z., Zhang L. and Yang O., (2002). Load
Balancing of Multipath Source Routing in Ad hoc Networks, In
Proceedings of IEEE ICCC, Vol. 5, pp. 3197 - 3201.
[19] J.Broch, D.Johnson and D.Maltz Dynamic Source Routing Protocol
for Mobile Ad Hoc Networks, IETF Internet draft, 2004.
[20] E. Charles,E. Belding-Royer and I. Chakeres, Ad hoc On-Demand
Distance Vector Routing. IETF Internet draft, 2003.
[21] K.M.Mahesh and R.D.Samir, On-demand Multipath Distance Vector
Routing in Ad hoc Networks. In Proceedings of IEEE International
Conference on Network Protocols, 2001,pp.14-23.
[22] S. Lee and M. Gerla, Split Multipath Routing with Maximally Disjoint
Paths in Ad hoc Networks, In Proceedings of IEEE ICC, 2001. pp.
3201-320
[23] J.Raju and J.Garcia-Luna-Aceves, "A New Approach To On-Demand
Loop-Free Multipath Routing," Eight International Conference on
Computer Communications and Networks , Boston, MA,1999
[24] J.Garcia-Lunes-Aceves, "Loop-Free Routing Using Diffusing
Computations" Transactions on Networking, IEEE/ACM, vol. 1, pp.
130-141,1993
[25] W.Zhengyu, D.Xiangjun and C.Lin,. A Grid-Based Energy Aware
Node-Disjoint Multipath Routing Algorithm for MANETs,
in
Proceedings of International Conference on Natural Computation, Vol.
5, pp. 244-248,2007
[26] W.Zhengyu, S.Hantao, J.Shaofeng, and X.Xiaomei, Ant-based
Energy Aware Disjoint Multipath Routing Algorithm in MANETs, in
Proceedings of International Conference on Multimedia and .Ubiquitous
Engineering, pp. 674-679,2007
[27] P.Pham and S.Perrau, Multi-path protocol with loadbalancing policy in
mobile ad hoc network", Mobile and Wireless Communications
Network, 4th International Workshop,pp.48-52,2002
[28] L.Wang, L.F.Zhang, Y.T.Shu, M.Dong and W.W.O.Yang, Adaptive
Multipath Source Routing in Wireless Ad Hoc Networks,IEEE ICC98,
Helsinki, Finland ,2001
[29] D.Bertsekas and R.Gallager,Data Networks, Prentice Hall,1992.
[30] I.Xuechao, X.Chunxiu, W.Muqing, Z.Yan and W.Dapeng, Design
and Realization of a Novel Multipath Load-Balancing Routing Protocol
in Ad Hoc Network, in Proceedings of
IEEE WASE International
Conference on Information Engineering, pp. 247-250.5,2009
[31] Y. Zhenqiang, S. Krishnamurthy and S.Tripathi, A Framework for
Reliable Routing in Mobile Ad hoc Networks, in Proceedings of IEEE
INFOCOM,Vol. 1, pp. 270 -280,2003
[32] S.Tabasukannan,B.Suguna,Tree based routing method to reduce time
complexity of routing in MANET,International journal of innovative
Research in advanced Engineering,vol.1,issue .8,September 2014.
[33] S.Tabasukannan,B.Suguna,Hierarchical routing method for scalable
network layer in mobile Adhoc NetworksSSRG-International journal of
mobile computing&Application,vol.1,issue.1,no.1pp 6-12,sep 2014.

Thabasukannan received M.Tech degree in computer

science from Anna university,Madurai.He also received
Doctorate degree in computer Science from Madurai
kamaraj university,Madurai.Currently he is working as
principal in Pannai college of Engineering under Anna
university.Previously he was worked as the Head of the
department in Sourastra college under Madurai kamaraj
university.He is the member of FIE professional
body.He has published many national/international conference&journal
papers in the area of Adhoc &sensor networks.His current research interest
includes Adhoc&sensor networks,mobile communication,image processing
etc.

Suguna(Research Scholar, Bharathiar university,

Coimbatore). Received her engineering degree in
Electrical
and
Electronics
Engineering(EEE),at
Shanmuga college of engineering from Bharathidasan
University, Trichy in 1995,She received M.Sc degree of
information Technology from Alagappa University,
Karaikudi in 2006.She also received her M.phil degree
in computer science from Manonmanian Sundaranar
University, Thiruneleli in the year 2007.Currently she is
woking as an Assistant professor inArulmighu Palaniandavar college of
Arts&Culture,Palani.She has published 8 National conference and 2
International journal papers in the area of Adhoc networks.Her current
research interest is adhoc networks and network security.

ISSN 2277 - 5080 | 2015 Bonfring