ROUTING IN MANET WITH ROUTE HANDOFF

AND BALANCED LOAD

A PROJECT REPORT

Submitted by
M.SWETHA 2009503553
A.BEAUTILIN 2009503505
A.MAHESWARI 2009503521


in partial fulfillment for the award of the degree

of
BACHELOR OF ENGINEERING


IN

COMPUTER SCIENCE AND ENGINEERING


MADRAS INSTITUTE OF TECHNOLOGY



ANNA UNIVERSITY : CHENNAI 600 044

NOVEMBER 2012







APPENDIX 2



ANNA UNIVERSITY : CHENNAI 600 025



BONAFIDE CERTIFICATE



Certified that this project report ROUTING IN MANET WITH ROUTE
HANDOFF AND BALANCED LOAD.
is the bonafide work of M.SWETHA 2009503553
A.BEAUTILIN 2009503505
A.MAHESWARI 2009503521
who carried out the project work under my supervision.

SIGNATURE SIGNATURE


HEAD OF THE DEPARTMENT SUPERVISOR

ASSISTANT PROFESSOR

COMPUTER SCIENCE AND ENGINEERING COMPUTER SCIENCE AND
ENGINEERING
MIT CAMPUS MIT CAMPUS
ANNA UNIVERSITY ANNA UNIVERSITY
CHROMPET-44. CHROMPET-44.







ABSTRACT:


Wireless mobile ad hoc networks (MANETs) are self configuring,
dynamic network in which nodes are free to move. Quality of Service (QoS)
routing in such network is usually limited by network breakage and more
packets are dropped due to congestion. Due to the dynamic nature of the
network topology and imprecise network state information, a lot of problems
remain before more efficient solutions are found for QoS routing in MANET.
One of the problems is that the established path for a connection request may
not be stable. The second effect is dynamic change of load traffic due to node
movement. Therefore, admission control and congestion control have to be
considered to avoid congestion in ad hoc networks. Thus to cater these
problems, CALB-AOMDV protocol is proposed which provides link stability
among mobile nodes in the network by considering the type of real time
application. Stability of link is given by using a preemptive handoff strategy and
to balance overload on the channel that is chosen as optimal. Load balancing is
done by distributing the traffic among multiple paths dynamically based on
measurement of path statistics to better use the network resources so that the
congestion and end-to-end delay are minimized.








CHAPTER 1

INTRODUCTION


Wireless mobile ad hoc networks (MANETs) are selfconfiguring,
dynamic networks in which nodes are free to move. A major performance
constraint comes from path loss and multipath fading. Many MANET routing
protocols exploit multihop paths to route packets. The probability of successful
packet transmission on a path is dependent on the reliability of the wireless
channel on each hop. Rapid node movements also affect link stability,
introducing a large Doppler spread, resulting in rapid channel variations.
Since the topology of MANET is time-varying, unstable radio links
among nodes may easily happen due to difficult to predicting the coverage
pattern and mobility models, etc. Many of the routing protocols rely on the
multi-hop routing paths for packet transmission. Node movements also affect
the link stability. Routing protocols can make use of prediction of channel state
information based on the prior knowledge of the channels. Several channel
adaptive schemes have been developed for MANETs to maintain the stability.
Channel adaptive schemes can be implemented in medium access control
MAC) protocols. A stability based routing protocols like associativity based
learning (ABR), signal stability based adaptive routing (SSA), and flow oriented
routing protocol (FORP) are designed to select the stable links, which can
improve the route lifetime and data throughputs.
Routing protocols can make use of prediction of channel state
information (CSI) based on a priori knowledge of channel characteristics, to
monitor instantaneous link conditions. With knowledge of channel behavior, the
best links can be chosen to build a new path, or switch from a failing connection
to one with more favorable channel conditions.Several channel adaptive
schemes that have been developed for MANETs to maintain connection
stability can be found in the literature.
A study on link stability prediction based on probabilistic models was
proposed , where the link stability (or availability) is denoted as the conditional
probability that a link remains connected after a specific time, given that it is
currently connected. Extended in [5], this link stability prediction scheme is
based on the random walk or random way point model and requires the
knowledge of some parameters of the mobility model. These parameters are of
prior knowledge or estimated using other techniques that usually require the
received signal strength (RSS) data or location data from a GPS device.
Each node in MANET has limited communication resources, such as
bandwidth, buffer space, battery power and etc. Resource constraints in
MANET require to properly distribute the traffic among the mobile hosts.
Otherwise, heavily loaded hosts may cause congestion and large delay; even it
may deplete energy quickly, which will lead to network partitions and failure of
application sessions. Thus load balancing is emerging as a key tool to better use
MANET resources and improve MANET performance. With load balancing,
MANET can minimize traffic congestion and load imbalance, as a result, end-
to-end packet delay can be minimized, mobile nodes lifetime can be
maximized, etc.










CHAPTER 2
LITERATURE SURVEY

2.1 NODE PREDICTION ADHOC ON DEMAND ROUTING
PROTOCOL
It focuses on the node prediction by using different approaches.
Predicting the node movement can be done by avoiding the frequent link
failures in Ad hoc environments. This approach allows to identifying the stable
paths, reusing of paths, and avoid the link failures. In this problem, the first
step, we find the node prediction by comparing the received the power level of
adjacent node with the threshold power. This means to predict the node (NP) as
a measure of path stability.
In the Second step we use the same information by different approach
which means calculating the node velocity. The performance of the NP-
AOMDV, throughput, End-To-End delay, Routing control overhead compares
with the well known Ad Hoc on Demand Multipath Distance Vector Routing.
Simulation results show the improved network performance of our proposed
approach (NP-AOMDV) over than existing multipath routing protocol
(AOMDV).
In NP-AOMDV we focus the deficiency in the way of predicting node
movements, we utilize the two different approaches.One is based on the
comparison of received power with the adjacent nodes and other is by
predicting the direction of the nodes based on the node velocity calculating the
prediction of nodes based on the prediction we choose the optimized path. If we
fail in node prediction, we allow the handover to one of the remaining selected
path.



2.2 LINK STABILITY PREDICTION BASED ROUTING ALGORITHM:


Firstly, depending on the received signal strength of nodes, a model to
predict the link stability is designed. Secondly, a link stability prediction-based
routing (LSPR) algorithm is proposed. The LSPR algorithm based on the link
stability prediction is proposed in sequence . In LSPR algorithm, the mean link
duration is used to decide the forwarding delay of RREQ packets, longer mean
link duration determines smaller forwarding delay. Furthermore a forwarding
rule used to reduce the number of RREQs forwarded by receding neighbor
nodes. The results of simulations confirm that LSPR algorithm is efficient in
strengthening route stability, decreasing routing overhead and improving
network performance .

2.3 LINK STABILITY BASED ON LINK CONNECTIVITY:

It predict the link stability based on the node's connectivity with other
nodes, using a probabilistic model. It first model the link connectivity between
two nodes, under the assumption that the link connectivity follows the Markov
chain model . It also consider the case of non-stationary movements (i.e. the
mobility pattern, e.g. speed of nodes, varies with time). Then we propose a
method to estimate the parameters of the link connectivity model. Afterwards,
the stability of the respective links is evaluated based on the estimated
parameters. The proposed scheme does not require prior information about the
mobility model of the network.




2.4 LINK STABILITY WITH DYNAMIC DELAY PREDICTION:

SDCR makes routing decisions according to link state and dynamic delay
detection. In the route discovery phase, SDCR finds paths with great link
stability factor. Thus, a feasible path that is more likely longer-lived is selected
for data transfer. In the route maintenance phase, SDCR effectively keeps
monitoring network topology changes by delay prediction and performs
rerouting before the paths become unavailable. With these route discovery and
maintenance mechanisms operating together, SDCR significantly improves
routing performance and guarantee QoS request.

2.5 LOAD BALANCING WITH AOMDV:
In the scheme each node checks its interface queue occupancy to
determine whether it responds to the received RREQ or not. The criterion for
the decision is a threshold value, which is calculated by each node when a
RREQ is received. It is a variable along with the queue occupancy of the nodes
around backward path. Therefore, the threshold is adjusted adaptively according
to the load status of the network this scheme can distribute the traffic evenly
among the nodes in an ad hoc network.

2.6 ADAPTIVE ADHOC ON DEMAND ROUTING PROTOCOL:
In A2OMDV, each source node prioritizes its routes obtained from the
route discovery procedure and transmits data through the route of the highest
priority at that time. The priority of a route is determined based on the RTT of
the route and it is periodically recalculated in order to find the optimal route in
the dynamic change of the network condition. We define the route of the highest
priority as primary route and the other routes as alternative routes. If the
performance of the selected route drops below a certain threshold,
the source node picks another route from the group of the candidate routes
considering their round trip time (RTT).
For the dynamic priority measurement, each source node has to maintain
RTT of its routes. The RTT values are initialized as the end-to-end delay
between RREQ and RREP at the route discovery procedure and updated
periodically. In the RTT measurement for a route, the source node sends a probe
packet to its destination through the route at every probing interval. Each
measured RTT is stored in the entry corresponding to the route of the routing
table.
Although many candidates for the probe packet are available, we consider
an ICMP packet is suitable. Since the source node can verify the availability of
its routes, the timeout field used in AOMDV is no longer needed in A2OMDV.
For the RTT measurement for the primary route, we apply a cross-layer
approach. If the active session between the source node and the destination uses
TCP, then the source node can obtain the estimated RTT from its TCP without
generating any probe packet. Hence, it reduces unnecessary control overheads
in A2OMDV.

2.7 MANET ADAPTIVE LOAD BALANCING:
It assumes that several disjoint paths between source and destination node
have been established using a multipath routing protocol. MALB locates at
source node and its objective is distribute the traffic among multiple disjoint
paths based on measurement of path statistics so that the congestion and load
imbalance are minimized. Source node periodically measures the path statistics
by packet probing techniques and then adaptively adjust traffic distribution
across multiple disjoint paths.


2.8 CONGESTION ADAPTIVE MULTIPATH ROUTING PROTOCOL:
The protocol considers available bandwidth,load and residual bateery
energy of nodes and distribute traffic through fail safemultiple paths.In this
approach when the average load of an existing link increases beyond a threshold
and available bandwidth and residual battery energy decreases below a
threshold , traffic is distributed over a multiple paths to reduce load on a
congested link.

2.9 WEIGHTED LOAD BALANCED ROUTING PROTOCOL:
WLBR selects a routing path by maximizing the weight among the
feasible paths. There are three parameters in WLBR that are used to calculate
the weight of the feasible path: the aggregate interface queue length, the route
energy, and the hop count. Route selection is based on the weight value of each
feasible path. In a feasible path, the higher the weight value, the higher is its
suitability for traffic distribution.
Route Energy (RE): The route energy is the sum of energy possessed by nodes
falling on a route. Higher the route energy, lesser is the probability of route
failure due to exhausted nodes.
Aggregate Interface Queue Length (AIQL): The sum of interface queue
lengths of all the intermediate nodes from the source node to the current node.

2.10 AOMDV-APLP(ACCESSIBILITY PREDICTION & LINK
PREDICTION):
2.10.1 Accessibility Prediction Algorithm
Following algorithm is used for accessibility prediction
a) If a node A receives a routing packet from another node B, node B is in As
neighborhood and is accessible to A.
b) If a node A receives a routing packet originated by a node B, node B is
accessible to node A and there exists a valid route from node A to node B.
c) If a node A receives a RERR from a node B, all the unreachable nodes
mentioned in this RERR are no more accessible to node A through node D.
Routing entries will never be deleted a new field Accessible is
added to each routing table entry depicts the predicted accessibility information.
Start = No information
Accessible = A valid route to node exists or would be possible
Inaccessible = A valid route to node would not be possible

2.10.2 LINK PREDICTION:
AOMDV with accessibility prediction routing protocol make use of pre-
computed routes determined during route discovery. These solutions, however,
suffer during high mobility because the alternate paths are not actively
maintained. Hence, precisely when needed, the routes are often broken. To
overcome this problem, link breakage prediction method is used. Prediction can
be done only for multiple paths that are formed during the route discovery
process. All the paths are maintained by means of periodic update packets
unicast along each path. These update packets are MAC frames which gives the
transmitted and received power from which distance can be measured ,this
distance can be used to predict whether the node is moving inward or outward
relative to the previous distance value that is it give the signal strength . At any
point of time, only the path with the strongest signal strength is used for data
transmission.





CHAPTER 3
PROPOSED SYSTEM

PROPOSAL:
In this paper, we introduce an enhanced, channel-aware version of the
AOMDV routing protocol. The key aspect of this enhancement, which is not
addressed in other work, is that we use specific, timely, channel quality
information allowing us to work with the ebb-and-flow of path availability.
This approach allows reuse of paths which become unavailable for a time,
rather than simply regarding them as useless, upon failure, and discarding them.
We utilize the channel average nonfading duration (ANFD) as a measure of
Link stability, combined with the traditional hop-count measure for path
selection. The protocol then uses the same information to predict signal fading
and incorporates path handover to avoid unnecessary overhead from a new path
discovery process. The average fading duration (AFD) is utilized to determine
when to bring a path back into play, allowing for the varying nature of path
usability instead of discarding at initial failure. This protocol provides a dual
attack for avoiding unnecessary route discoveries, predicting path failure
leading to handoff and then bringing paths back into play when they are again
available, rather than simply discarding them at the first sign of a fade. Further,
the same information is required to determine ANFD, AFD and predict path
failure, enhancing efficiency. The overall effect is a protocol with improved
routing decisions leading to a more robust network.