Open Access Open Access  Restricted Access Subscription Access

Modified Reactive Routing Protocol with Shortest path Algorithm for MANETs

K. Thamizhmaran

Abstract


Mobile Ad-hoc Networks (MANET) are one of the most popular study topics in recent years due to the world's natural problems.  Every day, MANET encounters numerous significant issues in society; in this regard, link failure, packet loss, energy consumption, and retransmission are the most prevalent concerns.  My goal in this article is to reduce packet loss while using the least amount of energy possible as a first step in my research.   Using two distinct shortest route algorithms (SPA), Bellman Ford and Dijkstra's algorithms, this technical research study examined the On-demand Routing Protocol (AODV) technique with multiple topologies and three sets of nodes.  This work's major objective is to use five steps to increase remaining energy and decrease packet dropping. All active nodes are flooded with route requests (i), all node IDs from our network group are tested (ii), the minimal weighted route is found (iv), the utilization energy of finding the route is calculated (v), and communication begins from source to destination.  Use Network Simulator 2, one of the most widely used and user-friendly programs, to analyze a variety of characteristics, including packet delivery ratio, routing overhead, end-to-end delay, and throughput (NS2).  Ultimately, it's evident that SPA employs protocols that are superior to conventional routing protocols in every way.


Full Text:

PDF

References


Jie Gao and Li Zhang (2004) “Load balanced short path routing in wireless networks”, IEEE.

Alvin C. Valera, et al (2005) “Improving protocol robustness in ad-hoc networks through cooperative packet caching and shortest multipath routing”, IEEE, Vol. 4, No. 5, pp. 443-457.

Anand Patwardhan and Iorga, (2005) “Secure routing and Intrusion Detection in Ad-hoc networks”, in Proc. 3rd Int. Conf. Pervasive Computer Communication, pp.191–199.

C. Demetrescu and G. F. Italiano (2006) “Experimental analysis of dynamic all pairs shortest path algorithms”, ACM, Vol. 2, No. 4, pp. 578–601.

S. Taoka, et al (2007) “Performance comparison of algorithms for the dynamic shortest path problem”, IEICE, Vol. 90, No. 4, pp. 847–856.

Jack Tsai and Tim Moors (2007) “A review of multipath routing protocols from wireless ad-hoc to mesh networks” IEEE, Vol. 12, No. 3, pp. 367-372.

Fuhao zhang, et al (2007) “Improve on dijkstra shortest path algorithm for huge data”, IEEE, Vol. 7, No. 2, pp. 313-316.

Yanfang Deng and Hengqing Tong (2010) “Dynamic shortest path algorithm in stochastic traffic networks using PSO based on fluid neural network”, JILSA, Vol. 3, pp. 11-16.

Parul Tomar, and Suri, (2010) “A Comparative Study for Secure Routing in MANET”, IJCA, Vol.4, No.5, pp. 298-307.

Aishwarya Sagar and Meenu Chawla, (2010) “Detection of Packet Dropping Attack Using Improved Acknowledgement Based Scheme in MANET”, IJCSI, Vol.7, No. 4, pp.


Refbacks

  • There are currently no refbacks.