Abstract
Two critical issues of designing scalable routing algorithm in ad hoc networks are that it should be robust to frequent path disruptions caused by node mobility and limit routing overhead. This paper argues grouping nodes with the motion direction of source to limit the range of RREQ broadcast. This kind of grouping also ensures that nodes, belonging to the same group, are more likely to establish longtime existent paths as they have similar motions. During route discovery, only the nodes which are in same group with source are allowed to rebroadcast RREQ. So the destination can select a most stable route to reply. The performance is evaluated through computer simulation with NS2. Simulation results indicate the proposed routing algorithm can limit routing overhead and enhance route stability effectively.
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
Chen, L., Lee, C.W.: Neighbor Stability Routing in Ad Hoc Networks. In: IEEE Wireless Communications and Networking Conference 2005, vol. 4, pp. 1964–1969. IEEE Press, New York (2005)
Yang, P., Huang, B.: QoS Routing Protocol based on Link Stability with Dynamic Delay Prediction in Ad Hoc Networks. In: IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application, pp. 515–518. IEEE Press, New York (2008)
Wang, N.C., Huang, Y.F., Chen, J.C.: A Stable Weight-based On-demand Routing Protocol for Mobile Ad Hoc Networks. Information Sciences 177(24), 5522–5537 (2007)
Taleb, T., Sakhaee, E., Jamalipour, A.: A Stable Routing Protocol to Support ITS Services in VANET Networks. IEEE Trans. Vehicular Technology 56(6), 3337–3347 (2007)
Wang, N.C., Chang, S.W.: A Reliable On-demand Routing Protocol for Mobile Ad Hoc Networks with Mobility Prediction. Computer Communications 29(1), 123–135 (2005)
Rappaport, T.S.: Wireless Communications: Principles and Practice. Prentice-Hall, Upper Saddle River (1995)
Johnson, D.B., Maltz, D.A., Broch, J.: DSR: The Dynamic Source Routing Protocol for Multi-hop Wireless Ad hoc Networks. Ad hoc Networking. Addison Wesley (2001)
Perkins, C., Belding-Royer, E., Das, S.: Ad Hoc On-Demand Distance Vector (AODV) Routing. IETF RFC 3561, http://www.ietf.org/rfc/rfc3561.txt
Sakhaee, E., Leibnitz, K., Wakamiya, N.: Self-Adaptive and Mobility-Aware Path Selection in Mobile Ad-Hoc Networks. In: 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems, vol. (41). ACM Press, New York (2008)
Tseng, Y.C., Ni, S.Y., Chen, Y.S.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. Wireless Networks 8, 153–167 (2002)
Zhang, Q., Agrawal, D.P.: Dynamic Probabilistic Broadcasting in Ad Hoc Networks. Journal of Parallel and Distributed Computing 65(2), 220–233 (2005)
Bani-Yassein, M., Ould-Khaoua, M., Mackenzie, L.M.: Improving the Performance of Probabilistic Flooding in Ad Hoc Networks. In: International Workshop on Wireless Ad-hoc Networks (2005)
Wu, J., Dai, F.: Broadcasting in Ad Hoc Networks based on Self-pruning. In: 22nd International Conference on Computer Communications, pp. 2240–2250. IEEE Press, New York (2003)
Peng, W., Lu, X.: AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks. Journal of Computer Science and Technology 16(2), 114–125 (2001)
Sakhaee, E., Taleb, T., Jamalipour, A.: A Novel Scheme to Reduce Control Overhead and Increase Link Duration in Highly Mobile Ad Hoc Networks. In: IEEE Wireless Communications and Networking Conference 2007, pp. 3972–3977. IEEE Press, New York (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, X., Wang, C., Zhao, S., Wang, X. (2013). Group-Based Overhead Limiting for Stability Routing in Ad Hoc Networks. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38715-9_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-38715-9_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38714-2
Online ISBN: 978-3-642-38715-9
eBook Packages: Computer ScienceComputer Science (R0)