Enhanced blocking expanding ring search in mobile ad hoc networks

Authors:
Ida M. Pu;Yuji Shen
Affiliations:
Goldsmiths, University of London, London, UK;University of Birmingham, Birmingham, UK
Venue:
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Year:
2009

Citing 7
Cited 3

The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
Search and replication in unstructured peer-to-peer networks

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scalability study of the ad hoc on-demand distance vector routing protocol

International Journal of Network Management
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Routing in ad hoc mobile networks: on-demand and hierarchical strategies

Routing in ad hoc mobile networks: on-demand and hierarchical strategies
On Optimal TTL Sequence-Based Route Discovery in MANETs

ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
On the optimization trade-offs of expanding ring search

IWDC'04 Proceedings of the 6th international conference on Distributed Computing

Stopping ongoing broadcasts in large MANETs

Proceedings of the 1st European Workshop on AppRoaches to MObiquiTous Resilience
Broadcast cancellation in search mechanisms

Proceedings of the 28th Annual ACM Symposium on Applied Computing
Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce BERS*, an enhanced Blocking Expanding Ring Search (BERS) protocol for route discovery in mobile ad hoc networks (MANETs). BERS is an energy efficient alternative that was developed recently based on the Expanding Ring Search (ERS). ERS is widely applied in reactive routing protocols such as DSR and AODV. BERS* is a faster and more energy-time efficient version of BERS. It reduces the route discovery latency of BERS by nearly half while maintainning a similar level of energy saving. Our results show that, among the three protocol schemes (BERS*, BERS and ERS), BERS* incurs the least search latency when the hop number of the route nodes is greater than 3, and has achieved the best performance in terms of energy-time efficiency when the hop number of the route nodes is greater than 7. We have also discovered the conditions that allow collective optimisation of BERS* and ERS.