Biomedical Engineering Reference
In-Depth Information
Solution Proposed
In this chapter, we propose to send the data packet from the last nodes it received
when nodes or links fails instead of sending back. As if this has been done as
suggested in this chapter will provide beneficial to AODV system like:
1. Network performance as well as throughput increases.
2. Less time consuming.
3. Traffic congestion will not occur.
4. Other nodes will not be going to wait for nodes that are sending.
5. We do not need to apply Security steps, procedure, and function again and
again on the same data packet and hence security increases.
6. As AODV is dynamic in nature therefore its topology changes quickly so it
helps to send the data quickly before changing its topology.
Algorithm Proposed
• In mobile ad-hoc network all nodes exchange periodic hello message to have
information
about
its
neighbors.
Nodes
also
update
its
neighbors
list
periodically.
• If any node (source node) in the network wise to communicate with other node
(Destination node) in the network, it look for required node in node list. If this is
not available then source node will generate RREQ. Format for route request
will be similar as in original AODV.
• When destination node or any node in the links have path up to destination
receives route request, it generate RREP toward source node. RREP packet
modifies routing table at each node. In our proposed algorithm, we used the
methodology proposed by Kim, i.e., R-AODV routing mechanism which
attempts multiple route replies. In mobile ad-hoc networks, the nodes move
autonomously due to which the topology of the network is highly dynamic. The
proposed R-AODV addresses the problem by attempting multiple route replies.
• When source node receives RREP, route for destination is available. Commu-
nication is possible from this node to required destination.
• During the communication liveliness of link is assured by periodic hello mes-
sage. If link break is detected by missing two consecutive hello messages,
proposed new algorithm is activated.
• In the case of link failure due to either node movement or power failure or any
other reason an error message is generated to source (RERR). In our proposed
algorithm the source now sends an another best route to last nodes in which data
received (or RERR comes from) since it is having multiple route to destination
(as Kim et al. R-AODV) under the Take another best route (TABR) packet.
Search WWH ::
Custom Search