Topology Control for Ad-Hoc Networks: A Comprehensive Review for Table Driven and On-Demand Routing Protocols


Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is that every terminal of an ad-hoc network is also functioning as a network router. In this paper we provide a comprehensive review about the principles and mechanisms of routing protocols used in ad-hoc networks. For comparison purposes, we discuss some relevant technical issues of two well-known routing strategies, namely On-Demand (Proactive routing) and Table-Driven (Reactive routing). In particular, focus our attention on two major and well-known routing protocols: AODV (Ad-hoc On-Demand Distance Vector Protocol) and OLSR (Optimized Link State Routing Protocol). Our study has no intention to suggest any definite solution for any ad-hoc network, because it is the case depending on dictated by the nature and varying factors of networks. Instead, we demonstrate our major perception and describe general models that may assist us while modeling a given network.

Share and Cite:

J. Stênico and L. Ling, "Topology Control for Ad-Hoc Networks: A Comprehensive Review for Table Driven and On-Demand Routing Protocols," Communications and Network, Vol. 5 No. 3, 2013, pp. 239-246. doi: 10.4236/cn.2013.53029.

Conflicts of Interest

The authors declare no conflicts of interest.


[2] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proceedings of the Conference on Communications Architectures, Protocols and Applications, Vol. 24, No. 4, 1994, pp. 234-244. doi:10.1145/190314.190336
[3] C. Maihofer, “A Survey of Geocast Routing Protocols,” IEEE Communications Surveys & Tutorials, Research & Technology (RIC/TC), Vol. 6, No. 2, 2004, pp. 32-42.
[4] S. Ratnasamy, “Capturing Complexity in Networked Systems Design: The Case for Improved Metrics,” 2006.
[5] M. S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Wireless Networks,” Wireless Networks, Vol. 1, No. 1, 1995, pp. 61-81. doi:10.1007/BF01196259
[6] E. M. Gafni and D. P. Bertsekas, “Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology,” IEEE Transactions on Communications, Vol. 29, No. 1, 1981, pp. 11-18. doi:10.1109/TCOM.1981.1094876
[7] E. M. Royer and C. K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Communications, Vol. 6, No. 2, 1999, pp 46-55. doi:10.1109/98.760423
[8] G. Jayakumar and G. Ganapathy, “Performance Comparison of Mobile Ad-hoc Network Routing Protocol,” International Journal of Computer Science and Network Security, Vol. 7 No. 11, 2007, pp. 77-84.
[9] J. Raju and J. J. Garcia-Luna-Aceves, “A Comparison of On-Demand and Table-Driven Routing for Ad-Hoc Wireless Networks,” IEEE International Conference on Communications, Vol. 3, New Orleans, 18-22 June 2000, pp. 1072-1706.
[10] A. Huhtonen, “Comparing AODV and OLSR Routing Protocols,” Heleniski University of Technology, Espoo, 2004.
[11] C. E. Perkins and E. M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proceeding of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, 25-26 February 1999, pp. 90-100. doi:10.1109/MCSA.1999.749281
[12] Y. C. Hu and D. B. Johnson, “Implicit Source Routes for On-Demand Ad Hoc Network Routing,” Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc 2001), Long Beach, May 2001, pp. 1-10.
[13] V. D. Park and M. S. Corson, “A Highty Adaptative Distributed Routing Algorithm for Mobile Wireless Network,” Proceeding of IEEE INFOCOM’97, 6th Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, April 1997, p. 1405.
[14] C. K. Toh, “A Novel Distributed Routing Protocol to Support Ad hoc Mobile Computing,” IEEE 15th Annual International Phoenix Conference on Computers and Communications, Phoenix, 27-29 March 1996, pp. 480-486.
[15] R. Dube, C. D. Rais, K. Y. Wang and S. K. Tripathi, “Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks,” IEEE Personal Communications, Vol. 4, No. 1, 1997, pp. 36-45. doi:10.1109/98.575990
[16] S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” Journal of Mobile Networks and Applications. Routing in Mobile Communications Networks, Vol. 1, No. 2, 1996, pp 183-197. doi:10.1007/BF01193336
[17] C. C. Chiang, H. K. Wu, W. Liu and M. Gerla, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” IEEE Singapore International Conference on Networks, October 1997, pp. 197-211.
[18] C. Perkins, E. B. Royer and S. Das, “Ad-Hoc On-Demand Distance Vector (AODV) Routing,” RFC 3561 IETF Network Working Group, 2003.
[19] J. Haerri, F. Filali and C. Bonnet, “Performance Comparison of AODV and OLSR in VANETs Urban Environments under Realistic Mobility Patterns,” The 5th IFIP Mediterranean Ad Hoc Networking Workshop, June 2006, pp. 14-17.
[20] S. Gowrishankar, T. G. Basavaraju, M. Singh and S. K. Sarkar, “Scenario Based Preformance Analysis of AODV and OLSR in Mobile and Ad-hoc Networks,” The 24th South East Asia Regional Computer Conference, November 2007, pp. 8.1-8.6.
[21] A. B. R. Kumer, L. C. Reddy and P. S. Hiremath, “Performance Comparison of Wireless Mobile Ad-Hoc Network Routing Protocol,” International Journal of Computer Science and Network Security, Vol. 8 No. 6, 2008, pp. 337-343.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.