Computer Science – Networking and Internet Architecture
Scientific paper
2012-03-13
Computer Science
Networking and Internet Architecture
25th IEEE CCECE, 2012, Montreal Canada
Scientific paper
In case of high dynamic topology, reactive routing protocols provide quick convergence by faster route discoveries and route maintenance. Frequent roadcasts reduce routing efficiency in terms of broadcast cost; Bk, and expected time cost; E[t]. These costs are optimized using different mechanisms. So, we select three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and DYnamic Manet On-demad (DYMO). We model expanding Ring Search (ERS); an optimization mechanism in the selected protocols to reduce Bk and E[t]. A novel contribution of this work is enhancement of default ERS in the protocols to optimize Bk and E[t]. Using NS-2, we evaluate and compare default-ERS used by these protocols; AODV-ERS1, DSR-ERS1 and DYMO-ERS1 with enhanced-ERS; AODVERS2, DSR-ERS2 and DYMO-ERS2. From modeling and analytical comparison, we deduce that by adjusting Time-To-Live (T TL) value of a network, efficient optimizations of Bk and E[t] can be achieved.
Bibi Abdelouahab
Bouk Safdar H.
Dridi Khaled
Javaid Nadeem
Khan Ashik Zinnat
No associations
LandOfFree
Modeling and Evaluating Enhancements in Expanding Ring Search Algorithm for Wireless Reactive Protocols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modeling and Evaluating Enhancements in Expanding Ring Search Algorithm for Wireless Reactive Protocols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modeling and Evaluating Enhancements in Expanding Ring Search Algorithm for Wireless Reactive Protocols will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-143763