Reference Hub4
Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks

Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks

Sanaa A. Alwidian, Ismail M. Ababneh, Muneer O. Bani Yassein
Copyright: © 2013 |Volume: 5 |Issue: 3 |Pages: 20
ISSN: 1937-9412|EISSN: 1937-9404|EISBN13: 9781466633650|DOI: 10.4018/jmcmc.2013070105
Cite Article Cite Article

MLA

Alwidian, Sanaa A., et al. "Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks." IJMCMC vol.5, no.3 2013: pp.68-87. http://doi.org/10.4018/jmcmc.2013070105

APA

Alwidian, S. A., Ababneh, I. M., & Yassein, M. O. (2013). Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks. International Journal of Mobile Computing and Multimedia Communications (IJMCMC), 5(3), 68-87. http://doi.org/10.4018/jmcmc.2013070105

Chicago

Alwidian, Sanaa A., Ismail M. Ababneh, and Muneer O. Bani Yassein. "Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks," International Journal of Mobile Computing and Multimedia Communications (IJMCMC) 5, no.3: 68-87. http://doi.org/10.4018/jmcmc.2013070105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Network–wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that can achieve high delivery ratio, flooding consumes much of the communication bandwidth and causes serious packet redundancy, contention and collision. In this paper, the authors propose new broadcast schemes that reduce the overhead associated with flooding. In these schemes, a node selects a subset of its neighbors for forwarding the packet being broadcast to additional nodes. The selection process has for goal reducing the number of neighbors and maximizing the number of nodes that they can reach (i.e., forward the packet to). By applying this novel neighborhood-based broadcasting strategy, the authors have come up with routing protocols that have very low overhead. These protocols were implemented and simulated within the GloMoSim 2.03 network simulator. The simulation experiments show that our routing protocols can reduce the overhead for both low and high mobility substantially, as compared with the well-known and promising AODV routing protocol. In addition, they outperform AODV by increasing the delivery ratio and decreasing the end-to-end delays of data packets.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.