Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks
Pages 68 - 87
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.
References
[1]
Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.-J., & Frieder, O. 2002. Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing MOBIHOC'02 pp. 157-164.
[2]
Bani-Yassein, M. M., Ould-Khaoua, M., Mackenzie, L. M., & Papanastasiou, S. 2006. Performance analysis of adjusted probabilistic broadcasting in mobile ad hoc networks. International Journal of Wireless Information Networks, 132, 127-140.
[3]
Clausen, T., & Jacquet, P. 2003/ Optimized link state routing protocol. Internet Draft, Internet Engineering Task Force. Retrieved from http://www.ietf.org/internet-drafts/draft-ietf-manet-olsr-11.txt
[4]
Haas, Z. J., Halpern, J. Y., & Li, L. 2002. Gossip-based ad hoc routing. In Proceedings of the IEEE INFOCOM, IEEE Computer Society, New York, NY.
[5]
Hanashi, A. M., Siddique, A., Awan, I., & Woodward, M. 2008. Dynamic probabilistic flooding performance evaluation of on-demand routing protocols in MANETs. In Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems Vol. 0, pp. 200-204.
[6]
Johnson, D. B. 1994. Routing in ad hoc networks of mobile hosts. In Proceedings of the Workshop on Mobile Computing Systems and Applications, IEEE Computer Society, Santa Cruz, CA pp. 158-163.
[7]
Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., & Sheu, J.-P. 2002. The broadcast storm problem in a mobile ad hoc network. Wireless Networks, 82, 153-167.
[8]
Peng, W., & Lu, X.-C. 2000. On the reduction of broadcast redundancy in mobile ad hoc networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking & Computing MOBIHOC, Boston, MA pp. 129-130.
[9]
Perkin, C. E., & Royer, E. M. 1999, February 25-26. Ad-hoc on-demand distance vector routing. In Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications WMCSA '99 pp. 90-100.
[10]
Rogers, P., & Abu-Ghazaleh, N. 2005, Robustness of network-wide broadcasts in MANETs. Proc. of the 2nd IEEE International Conference on Mobile Ad Hoc and Sensor Systems MASS 2005 Vol. 3, pp. 161-185.
[11]
Sasson, Y., Cavin, D., & Schiper, A. 2003. Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In Proceedings of the IEEE Wireless Communications & Networking Conference WCNC 2003 pp. 1124-1130.
[12]
Sun, B., Gui, C., Zhang, Q., Yan, B., & Liu, W. 2008. A multipath on-demand routing with path selection entropy for ad hoc networks. In Proceedings of the 9th International Conference for Young Computer Scientists, Nov. 2008 pp. 558-563.
[13]
Trung, H., W. Benjapolakul& P. Duc2007, Performance evaluation and comparison of different ad hoc routing protocols. Computer Communications, 3011,12, 2478-2496.
[14]
Tseng, Y.-C., Ni, S.-Y., & Shih, E.-Y. 2003. Adaptive approaches to relieving broadcast storm in a wireless multihop mobile ad hoc network. IEEE Transactions on Computers, 525.
[15]
Wikipedia. n.d. Set cover problem. Retrieved from http://en.wikipedia.org/wiki/Set_cover_problem
[16]
Williams, B., & Camp, T. 2002. Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing MOBIHOC 2002, New York, NY pp. 194-205.
[17]
Yassein, M. B., Al-Dubai, A., Khaoua, M. O., & Al-jarrah, O. M. 2009. New adaptive counter based broadcast using neighborhood information in MANETS. In Proceedings of the 2009 IEEE International Symposium on Parallel & Distributed Processing pp. 1-7.
[18]
Yassein, M. M. B., Ould-Khaoua, M., Mackenzie, L. M., Papanastasiou, S., & Jamal, A. 2006, Improving route discovery in on-demand routing protocols using local topology information in MANETs. In Proceedings of the ACM International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks, Terromolinos, Spain pp. 95-99.
[19]
Yassein, M. M. B., Ould-Khaoua, M., & Papanastasiou, S. 2005. Performance evaluation of flooding in MANETs in the presence of multi-broadcast traffic. In Proceedings of the 11th International Conference on Parallel and Distributed Systems ICPADS05 Vol. 2, pp. 505-509.
[20]
Yu, Y., Zhou, Y., & Du, S. 2009. Service discovery in mobile ad hoc networks using mobility-aware attenuated bloom filters. In Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering, July 2009 pp. 266-269.
[21]
Zeng, X., Bagrodia, R., & Gerla, M. 1998, May 26-29. GloMoSim: A library for parallel simulation of large-scale wireless networks. In Proceedings of the 1998 12th Workshop on Parallel and Distributed Simulations PADS'98, Banff, Canada pp. 154-161.
[22]
Zhang, Q., & Agrawal, D. P. 2005. Dynamic probabilistic broadcasting in MANETs. Journal of Parallel and Distributed Computing, 65, 220-233.
Recommendations
Probabilistic counter-based route discovery for mobile ad hoc networks
IWCMC '09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World WirelesslyConventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This ...
Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks
LCN '07: Proceedings of the 32nd IEEE Conference on Local Computer NetworksConventional on-demand route discovery methods in Mobile Ad hoc Networks (MANET) employ blind flooding, where a mobile node blindly rebroadcasts received Route Request (RREQ) packets until a route to a particular destination is established. This can ...
Probabilistic and Neighbour Knowledge Based Flooding Mechanism for AODV
ACCT '14: Proceedings of the 2014 Fourth International Conference on Advanced Computing & Communication TechnologiesMobile Adhoc Network (MANET) is consist of group of mobile nodes communicating in a multi-hop way with no fixed infrastructure. To search such a multi-hop route to another nodes, each MANET node widely use HELLO packet. Flooding is important and most ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
IGI Global
United States
Publication History
Published: 01 July 2013
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in