Abstract
We investigate the use of dominating-set neighbor elimination as an integral part of the distribution of route requests using the Ad hoc On-demand Distance Vector (AODV) protocol as an example of on-demand routing protocols. We use detailed simulations to show that simply applying dominant pruning (DP) to the distribution of route requests in AODV results in pruning too many route requests in the presence of mobility and cross-traffic. Accordingly, we introduce several heuristics to compensate the effects of DP and show that the resulting AODV with Dominating Set heuristics (AODV-DS) has comparable or better delivery ratio, network load, and packet latency than the conventional AODV. AODV-DS exhibits over 70% savings on RREQ traffic than conventional AODV, and in some situations, AODV-DS may have a lower control overhead using Hello packets than conventional AODV without Hellos.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol. 353. Kluwer Academic Publishers, Dordrecht (1996)
Johnson, D.B., Maltz, D.A., Hu, Y.-C.: The dynamic source routing protocol for mobile ad hoc networks (DSR), IETF Internet draft, draft-ietf-manet-dsr-09.txt (2003)
Johnson, D.B., Maltz, D.A., Hu, Y.-C., Jetcheva, J.G.: The dynamic source routing protocol for mobile ad hoc networks (DSR), IETF Internet draft, draft-ietf-manet-dsr-07.txt (2002)
Perkins, C.E., Royer, E.M.: Ad hoc on-demand distance vector routing. In: Proc. WMCSA 1999 (1999)
Clausen, T., Jacquet, P.: RFC 3626: Optimized link state routing protocol OLSR (2003)
Clausen, T., Jacquet, P., Laouiti, A., Minet, P., Muhlethaler, P., Qayyum, A., Viennot, L.
Amis, A., Prakash, R., Vuong, T., Huynh, D.: MaxMin D-cluster formation in wireless ad hoc networks. In: IEEE INFOCOM (2000)
Das, B., Bharghavan, V.: Routing in ad hoc networks using minimum connected dominating sets. In: Proc. ICC 1997, vol. 1 (1997)
Das, B., Sivakumar, R., Bhargavan, V.: Routing in ad hoc networks using a spine. In: Proc. ICCCN (1997)
Laouti, A., Muhlethaler, P., Najid, A., Plakoo, E.: Simulation results for the OLSR routing protocol for wireless network, Technical Report 4414, INRIA (2002)
Ogier, R.G., Templin, F.L., Bellur, B., Lewis, M.G.: Topology broadcast based on reverse-path forwarding (TBRPF), IETF Internet draft, draft-ietf-manet-tbrpf-05.txt (2001)
Bajaj, L., Takai, M., Ahuja, R., Tang, K., Bagrodia, R., Gerla, M.: GloMoSim: A scalable network simulation environment, Technical Report 990027, UCLA Computer Science Department (1999)
Perkins, C.E., Belding-Royer, E.M., Das, S.: Ad hoc on demand distance vector (AODV) routing, IETF Internet draft, draft-ietf-manet-aodv-11.txt (2002b)
Perkins, C.E., Royer, E.M., Das, S.R., Marina, M.K.: Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE Personal Communications 8(1) (2001b)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mote, S., Wategaonkar, S., Khot, S., Wategaonkar, S.R. (2010). AODV-DS with Dominant Pruning in Mobile Ad Hoc Networks. In: Meghanathan, N., Boumerdassi, S., Chaki, N., Nagamalai, D. (eds) Recent Trends in Networks and Communications. WeST VLSI NeCoM ASUC WiMoN 2010 2010 2010 2010 2010. Communications in Computer and Information Science, vol 90. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14493-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-14493-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14492-9
Online ISBN: 978-3-642-14493-6
eBook Packages: Computer ScienceComputer Science (R0)