Overhead impact on ad hoc mobile networks
Keywords:Mobile Ad hoc Network Overhead, Mobile Routing Protocols, Ad Hoc Network Reliability, AODV, overhead impact
Overhead quantifies how much routing and control information is necessary for the application data to reach the destination node. This is very important in Ad Hoc networks because the mobility of nodes makes routing paths change constantly, therefore, the exchange of control and routing information increases. In this work the overhead for AODV, BCHP and DSVD mobile routing protocols is analyzed. Protocol reliability is used like a metric based on overhead behavior. The results show that the overhead can be between 30% to 60% with respect to the total throughput. BCHP is the most effective protocol because with similar expected overhead it has a better level of application information delivered.
Boppana, R. V. and Mathur, A. (2005). Analysis of the dynamic source routing protocol for ad hoc networks. In Workshop on Next Generation Wireless Networks, page 1.
Clausen, T., & Jacquet, P. (2003). Optimized link state routing protocol (OLSR) (No. RFC 3626).
Jiang, M. (1999). Cluster based routing protocol (cbrp). draft-ietf-manet-cbrp-spec-01. txt.
La, R. J. and Seo, E. (2011). Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing. IEEE TRANSACTIONS ON MOBILE COMPUTING, 10(3):434–448.
Narayana, M. V., Narsimha, G., and Sarma, S. S. V. N. (2016). Genetic – zhls routing protocol for fault tolerance and load balancing. Journal of Theoretical and Applied Information Technology, 83(1):72–80.
Paul, S. (2016). Introduction to MANET and Clustering in MANET. Anchor Academic Publishing.
Perkins, C. E. and Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. In Proceedings of the Conference on Communications Architectures, Protocols and Applications, SIGCOMM ’94, pages 234–244, New York, NY, USA. ACM.
Perkins, C. E. and Royer, E. M. (1997). Ad-hoc on-demand distance vector routing. In PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS, pages 90–100.
Singh, G., Saini, D., Rishi, R., and Rohil, H. (2016). Role of link expiration time to make reliable link between the nodes in manets: A review. International Journal of Applied Engineering Research, 11(7):5321–5.
Timo, R. and Hanlen, L. (2006). MANETs: Routing Overhead and Reliability.
Torres, R., Mengual, L., Marban, O., Eibe, S., Menasalvas, E., and Maza, B. (2012). A management ad hoc networks model for rescue and emergency scenarios. Expert Systems with Applications, 39(10):9554 – 9563.
Tran, Q. M. and Dadej, A. (2014). Proactive routing overhead in Mobile Ad-hoc Networks. Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014, WoWMoM 2014.
Tran, Q. M., Dadej, A., and Pham, T. L. (2015). Reactive routing overhead in mobile ad-hoc networks. Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, H, pages 1591–1596.
Zhang, X. M., Wang, E. B., Xia, J. J., and Sung, D. K. (2013). A neighbor coverage-based probabilistic rebroadcast for reducing routing overhead in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 12(3):424–433.
How to Cite
This work is licensed under a Creative Commons 3.0 BY EC License.