AN ENHANCED ROUTE FAILURE RECOVERY MODEL FOR MOBILE AD HOC NETWORKS
作者： PR Jasmine Jeni , A Vimala Julie , A Messiah Bose
DOI: 10.3844/JCSSP.2014.1561.1568
关键词:
摘要: In Mobile Ad Hoc Networks (MANET), change in topology of the network occurs due to mobility factor nodes leading extension size network. The happens entry into As changes, link failure between takes place several reasons like channel interference and dynamic obstacles etc that give rise severe performance degradation. traditional AODV, is overcome by re-routing from source node which a time consuming process increases overhead nodes. Also case multiple failures, there are chances for loss data packet. Maintaining dynamically during failure, specifically long transfer such as stream voice data, challenging problem. order related issues, we developed Local Link Failure Recovery algorithm (LLFR) hoc networks establishes recovery failures spontaneously at point breakage. cases, reliable main criteria will determine terms Quality Service (QoS). LLFR deployed each collects RREP Buffer Table (RBT) stack highest signal strength, gets triggered failures. Once detected, intermediate searches an alternate path around faulty area choosing first stacked RBT new route intended destination sending packets without any delay. simulation results show parameters packet delivery ratio, throughput, average end delay routing better compared AODV other techniques.
core.ac.uk
thescipub.com参考文章(11)
J. Macker, S. Corson, Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations Request For Comments. ,vol. 2501, pp. 1- 12 ,(1999)
William Su, Sung-Ju Lee, Mario Gerla, Mobility prediction and routing in ad hoc wireless networks International Journal of Network Management. ,vol. 11, pp. 3- 30 ,(2001) , 10.1002/NEM.386
Cigdem Sengul, Robin Kravets, Bypass routing: An on-demand local recovery protocol for ad hoc networks ad hoc networks. ,vol. 4, pp. 380- 397 ,(2006) , 10.1016/J.ADHOC.2004.10.004
Mahesh K. Marina, Samir R. Das, Ad hoc on-demand multipath distance vector routing Wireless Communications and Mobile Computing. ,vol. 6, pp. 969- 988 ,(2006) , 10.1002/WCM.432
Poonkuzhali Ramadoss, Sanavullah Mohamed Yakub, Sabari Annaji, A PREEMPTIVE LINK STATE SPANNING TREE SOURCE ROUTING PROTOCOL FOR MOBILE ADHOC NETWORKS Journal of Computer Science. ,vol. 10, pp. 85- 90 ,(2014) , 10.3844/JCSSP.2014.85.90
Thomas Babbitt, Christopher Morrell, Boleslaw Szymanski, Self-Selecting Reliable Path Routing in diverse Wireless Sensor Network environments 2009 IEEE Symposium on Computers and Communications. pp. 1- 7 ,(2009) , 10.1109/ISCC.2009.5202268
Charles E Perkins, Elizabeth M Royer, Ad-hoc on-demand distance vector routing workshop on mobile computing systems and applications. pp. 90- 100 ,(1999) , 10.1109/MCSA.1999.749281
E. Belding-Royer, S. Das, C. Perkins, Ad hoc On-Demand Distance Vector (AODV) Routing IETF-Request-for-Comments, rfc3561.txt. ,vol. 3561, pp. 1- 37 ,(2003)
A. Tsirigos, Z.J. Haas, Multipath routing in the presence of frequent topological changes IEEE Communications Magazine. ,vol. 39, pp. 132- 138 ,(2001) , 10.1109/35.965371
Charles E Perkins, Elizabeth M Royer, Samir R Das, Mahesh K Marina, Performance comparison of two on-demand routing protocols for ad hoc networks Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064). ,vol. 1, pp. 3- 12 ,(2000) , 10.1109/INFCOM.2000.832168