A Secured and Reliable Route Maintenance Mechanism for AODV Routing Protocol
(*) Corresponding author
Link failure between the nodes takes place due to reasons like channel interference and dynamic obstacles in mobile Ad Hoc networks, that give rise to severe performance degradation. In traditional AODV, the link failure is overcome by re-routing from the source node which is considered to be a time consuming process that increases the overhead of the nodes. Also, in case of multiple link failures, there are chances for loss of data packets. The performance of the network during link failure has to be maintained dynamically in circumstances such as long data transfer such as a stream of voice data which is an underlying challenge. Another challenging problem is to feasibly detect and defend possible attacks during data transmission. In order to overcome these performance related issues, we developed the Secured Local Link Failure Recovery Algorithm (SLLFR) for Adhoc networks that establishes recovery from link failures spontaneously at the point of link breakage. In such cases, a reliable link failure recovery is the main criteria that will determine the performance of the network in terms of quality of service (QoS). The SLLFR is deployed in each node collects RREP in the RREP Buffer Table (RBT) stack in the highest order of signal strength, which gets triggered during link failures. Once a link failure is detected, the intermediate node searches for an alternate path around the faulty area by choosing the first RREP that is stacked in the RBT and establishes a new route to the intended destination for sending the data packets without any time delay. The simulation results show that the performance parameters like packet delivery ratio, throughput, average end to end delay and routing overhead are better compared to the traditional AODV and other link failure recovery techniques.
Copyright © 2021 Praise Worthy Prize - All rights reserved.
Corson and Macker. "Mobile Ad Hoc Networking (MANET) Routing Protocol Performance Issues and Evaluation". IETF RFC 2501, 1999.
Charles Perkins and Elizabeth Royer."Ad hoc On-Demand Distance Vector Routing". Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, pp. 90-100. 1999.
Perkins, Belding-Royer, and Chakeres."Ad Hoc On Demand Distance Vector (AODV) Routing". IETF Internet draft. 2003.
Sunil Taneja and Ashwani Kush," A Survey of Routing Protocols in Mobile Ad Hoc Networks". International Journal of Innovation Management and Technology, Vol. 1, No. 3, ISSN: 2010-0248. 2010.
Marina, M.K. and Das, S.R. (2006), Ad hoc on-demand multipath distance vector routing. Wirel. Commun. Mob. Comput., 6: 969-988.
Tsirigos and Haas. "Multipath routing in the presence of frequent topological changes". IEEE Communications Magazine, 0163-6804.2001
Cigdem, Sengul and Robin Kravets."Bypass routing: An on-demand local recovery protocol" Ad hoc networks. 380-397.2006
Su, Lee and Gerla".Mobility prediction and routing in ad hoc wireless networks". International Journal of Network Management, Wiley & Sons, 2000.
Ramadoss,Yakub and Annaji "A primitive link state spanning tree source routing protocol for mobile ad hoc networks". J.Comput.Sci.,10:85-90,2004.
Das, Perkins, and Royer. "Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks". Proceedings of INFOCOM, pp. 3-12.2000.
Thomas Babbitt,Christopher Morrell, and Boleslaw Szymanski."Self-Selecting Reliable Path Routing in Diverse Wireless Sensor Network Environments". Proceedings of IEEE International Symposium on Computers and Communication.2009.
Y.-C. Hu, A. Perrig, and D. B. Johnson, "Ariadne: A secure on-demand routing protocol for ad hoc networks," in Proc. 8th ACM Int. Conf. Mobile Comput. Netw. Sep. 2002, pp. 12-23. Y.-C. Hu, A. Perrig, and D. B. Johnson, "Packet Leashes: A defense against wormhole attacks in Wire less networks," in Proc. INFOCOM, Hong Kong, , pp. 1976-1986. Apr. 2003
P.R. Jasmine Jeni, A.Vimala Juliet and A.Messiah Bose," An enhanced route failure recovery model for mobile ad hoc networks", Journal of Computer Science 10 (9): 1561- 1568, 2014 ISSN: 1549-3636,April 2014.
- There are currently no refbacks.
Please send any question about this web site to email@example.com
Copyright © 2005-2023 Praise Worthy Prize