A Secured and Reliable Route Maintenance Mechanism for AODV Routing Protocol

(*) Corresponding author

Authors' affiliations

DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)


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 perfor-mance 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, throu-ghput, average end to end delay and routing overhead are better compared to the traditional A-ODV and other link failure recovery techniques
Copyright © 2014 Praise Worthy Prize - All rights reserved.


MANET; Routing; Link Failure; Signal Strength; Internal Attacks

Full Text:



H. Wang X. Chen S. Ren, Q. Li and X. Zhang. Design and analysis of sensing scheduling algorithms under partial coverage for object detection in sensor networks., IEEE Transactions on Parallel and Distributed Systems, vol. 1 n. 3, 2007 pp.334-350.

Akyildiz, I.F., Su, W., Sankarsubramaniam, Y., Cayirci, A Survey on Sensor Networks, IEEE Communication Magazine, vol.40 n. 8, August 2002,pp. 102 – 114.

Asfaq Hussain Farooqi,Farroq Aslam Khan , Intrusion detection Systems for Wireless Sensor Networks : A Survey, Springer Communications in Computer and Information Science, vol.56, 2009 pp. 234-241

Saurabh Ganeriwal, Laura K. Balzano, Mani B. Srivastava, Reputation-based Framework for High Integrity Sensor Networks, ACM Transactions on Sensor Networks, vol. 4 n 3 May 2008 pp. 1 – 37.

Prasan kumar sahoo,Jang- Ping Sheu, Kun Ying Hseih, Target tracking and boundary node selection algorithms of wireless sensor networks for internet services ,ELSEVIER Information Sciences,vol. 230, May 2013, pp. 21-38.

Hongju Cheng, Ronglie Guo, and Yuzhong Chen, Node,Selection Algorithms with Data Accuracy Guarantee in Service-Oriented Wireless Sensor Networks, International Journal of Distributed Sensor Networks,vol 2013,Article ID 527965,14 Pages.

Wanming chen, Meng M Q H,Shuai Li , Tao Mei, Energy efficient head node selection algorithm in wireless sensor networks, Procedings of IEEE International Conference on Robotics and Biomimetics, vol ,2007 , pp. 311 – 315.

M. Atakli, H. Hu, Y. Chen, W.-S. Ku and Z. Su, Malicious Node Detection in Wireless Sensor Networks Using Weighted Trust Evaluation, Proceedings of Spring Simulation Multi-Conference, Ottawa, vol. , April 2008, pp. 836-843.

M. Probst and S. K. Kasera, Statistical Trust Establishment in Wireless Sensor Networks, in Proceedings of IEEE International Conference on Parallel and Distributed Systems (ICPADS),vol. 2 December 2007 pp.1-8.

Zoe Abrams , Ashish Goel , Serge Plotkin, Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks, Proceedings of Third International Symposium on Information Processing in Sensor Networks, IPSN , vol , 2004, pp. 224-232.

Xin He, Hua Yang, Xiaolin Gui, The Maximum Coverage Set Calculated Algorithm for WSN Area Coverage ,Journal of Networks , vol. 5, JUNE 2010 , pp.650-657.

YAN, Binyu, Yongqi ZHANG, Minjian DONG, Jiliu ZHOU, and Wei LU, A Trust Model Based on Grid for Wireless Sensor Networks, Journal of Computational Information Systems ,vol 8, 2012 pp. 405-414.

M. Calle, Energy Consumption in Wireless Sensor Networks Using GSP, M.S. Thesis, Department of Information Science and Telecommunications, University of Pittsburgh, Pittsburgh, PA, USA, 2006.

M. calle and J. Kabara, Measuring energy consumption in wireless sensor networks using GSP, Proc. IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications Sept. 2006, pp. 1-5.

C.Y. Lin, W.C. Peng, Y.C. Tseng, Efficient in-network moving object tracking in wireless sensor networks, IEEE Transactions on Mobile Computing,vol 5, 2006 ,pp. 1044–1056.

M. Vahabi, M. H. F. Ghazvini, M. F. A. Rasid, R. S. A. R. Abdullah, Traffic Aware Data Collection MAC Protocol for Wireless Sensor Networks, (2008) International Review on Computers and Software (IRECOS), 3. (4), pp. 329-336.

Mazinani, S.M., Yaghmaee, M.H., Tashtarian, F., Honary, M.T., Chitizadeh, J., On global clustering algorithm: Layer-oriented approach for first/last node dying applications in wireless sensor networks, (2009) International Review on Computers and Software (IRECOS), 4 (2), pp. 229-240.


  • There are currently no refbacks.

Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize