Publication Links
IJACSA
Special Issues
Publication Links
IJACSA
Special Issues
Intelligent Systems Conference 2018
Computing Conference 2018
Future of Information and Communication Conference (FICC) 2018
Future Technologies Conference (FTC) 2018
Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2013.040318
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 4 Issue 3, 2013.
Abstract: On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C). Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.
Muneer Bani Yassein, Yaser M. Khamayseh, Amera Al-Ameri and Wail E. Mardini, “Routing Discovery Algorithm Using Parallel Chase Packet ” International Journal of Advanced Computer Science and Applications(IJACSA), 4(3), 2013. http://dx.doi.org/10.14569/IJACSA.2013.040318