Routing Discovery Algorithm Using Parallel Chase Packet
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 3
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
- EP ID EP140987
- DOI 10.14569/IJACSA.2013.040318
- Views 110
- Downloads 0
Effective Performance of Information Retrieval by using Domain Based Crawler
World Wide Web continuously introduces new capabilities and attracts many people[1]. It consists of more than 60 billion pages online. Due to this explosion in size, the information retrieval system or Search Engines are...
Hybrid Approaches to Image Coding: A Review
Now a days, the digital world is most focused on storage space and speed. With the growing demand for better bandwidth utilization, efficient image data compression techniques have emerged as an important factor for imag...
Task Allocation Model for Rescue Disabled Persons in Disaster Area with Help of Volunteers
In this paper, we present a task allocation model for search and rescue persons with disabilities in case of disaster. The multi agent-based simulation model is used to simulate the rescue process. Volunteers and d...
Intelligent Watermarking Scheme for image Authentication and Recovery
Recently, researchers have proposed semi-fragile watermarking techniques with the additional capability of image recovery. However, these approaches have certain limitations with respect to capacity, imperceptibility, an...
Urdu Text Classification using Majority Voting
Text classification is a tool to assign the predefined categories to the text documents using supervised machine learning algorithms. It has various practical applications like spam detection, sentiment detection, and de...