Routing Discovery Algorithm Using Parallel Chase Packet

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.

Authors and Affiliations

Muneer Bani Yassein , Yaser M. Khamayseh , Amera Al-Ameri , Wail E. Mardini

Keywords

Related Articles

MCIP Client Application for SCADA in Iiot Environment

Modern automation systems architectures which include several subsystems for which an adequate burden sharing is required. These subsystems must work together to fulfil the tasks imposed by the common function, given by...

Value based PSO Test Case Prioritization Algorithm

Regression testing is performed to see if any changes introduced in software will not affect the rest of functional software parts. It is inefficient to re-execute all test cases every time the changes are made. In this...

Parallel Backpropagation Neural Network Training Techniques using Graphics Processing Unit

Training of artificial neural network using back-propagation is a computational expensive process in machine learning. Parallelization of neural networks using Graphics Pro-cessing Unit (GPU) can help to reduce the time...

Risk Diffusion Modeling and Vulnerability Quantification on Japanese Human Mobility Network from Complex Network Analysis Point of View

The human mobility networks are vital infrastructure in recent social systems. Many efforts have been made to keep the healthy human mobility flows to maintain sustainable development of recent well-connected society. Ho...

Vietnamese Speech Command Recognition using Recurrent Neural Networks

Voice control is an important function in many mobile devices, in a smart home, especially in providing people with disabilities a convenient way to communicate with the device. Despite many studies on this problem in th...

Download PDF file
  • EP ID EP140987
  • DOI 10.14569/IJACSA.2013.040318
  • Views 123
  • Downloads 0

How To Cite

Muneer Bani Yassein, Yaser M. Khamayseh, Amera Al-Ameri, Wail E. Mardini (2013). Routing Discovery Algorithm Using Parallel Chase Packet. International Journal of Advanced Computer Science & Applications, 4(3), 104-109. https://europub.co.uk/articles/-A-140987