International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 5, No. 8, 8 Jun. 2013
Cover page and Table of Contents: PDF (size: 504KB)
Performance Analysis of Route Discovery by Cross Layer Routing Protocol- RDCLRP
Full Text (PDF, 504KB), PP.46-54
Views: 0 Downloads: 0
Author(s)
Index Terms
MANET, AODV, Cross layer design, route repair, HELLO, ANH, FUZZY
Abstract
Wired and wireless network is based on the TCP / IP architecture but it is not sufficient to cope with the dynamics of the MANET. Cross layer design can be an alternative architecture for MANET. Frequent route break is one of the major problems of mobile adhoc network (MANET). Path breaks due to less available battery power and mobility of nodes. Most of the battery power is consumed in flooding of control packets. A key challenge in the design of efficient routing protocol is to reduce link breakage and flooding of control packets. Route breakage can be reduced if the possibility of route breakage is predicted and a handoff is done without drop of data packets. If route breakage is reduced, the more battery power will be available with nodes. In turn it reduces the possibility of route breakage and the possibility of flooding. This is a cumulative effect. So a novel preemptive route repair algorithm is proposed named as RDCLRP- Route discovery by cross layer routing protocol to reduce frequency of control packet flooding and route breakage. Three variants of RDCLRP and their results are illustrated. In this paper, the impact of the number of nodes on performance of RDCLRP are investigated and analyzed. The results show 55.6% reduction in link breakage, 14.7% improvement in residual battery power and an average of 6.7% increase in throughput compared to basic AODV.
Cite This Paper
Mehajabeen Fatima, Roopam Gupta, T.K.Bandhopadhyay, "Performance Analysis of Route Discovery by Cross Layer Routing Protocol- RDCLRP", International Journal of Computer Network and Information Security(IJCNIS), vol.5, no.8, pp.46-54, 2013. DOI:10.5815/ijcnis.2013.08.06
Reference
[1]Marco Fotino and Floriano De. Energy Issues and Energy aware Routing in Wireless Ad-hoc Networks. Rango, s.l. : International Journal of Communication System, Mobile Ad-Hoc Networks: Protocol Design, 2010, pp. 281-296.
[2]Amir Esmailpour, Nidal Nasser and Jehad Al Efficient routing for wireless mesh networks using a backup path, s.l. : International Journal of Communication System, May 2012.
[3]Brian Russel, Michael L. Littman and Wade Trappe, Integrating machine learning in ad hoc routing: A wireless adaptive routing protocol, 2011.
[4]Wen-Hsin Yang, You Chiun Wang, Yu-Chee Tseng and Bao-Shuh P. Lin, Energy-Efficient Network Selection with Mobility Pattern Awareness in an Integrated WiMAX and WiFi Network.. s.l. : International journal of communication system, 2000.
[5]Dzmitry Kliazovich, Simone Redana, Fabrizio Granelli.Cross-layer error recovery in wireless access networks: The ARQ proxy approach s.l. : International Journal of Communication System , 2011.
[6]Vineet Srivastava, Mehul Motani, Cross-Layer Design: A Survey and the Road Ahead. s.l. : IEEE Communications Magazine , December 2005.
[7]Liang Qin and Thomas Kunz, Survey on Mobile Ad Hoc Network Routing Protocols and Cross-Layer Design. S.I. :, Carleton University, Systems and Computer Engineering, Technical Report SCE-04-14, August 2004
[8]Vikas kawadia, p. R. Kumar, A cautionary perspective on cross-layer design.. s.l. : IEEE Wireless Communications, February 2005.
[9]Brent Ishibashi, Raouf Boutaba., Topology and mobility considerations in mobile ad hoc networks, journal of Ad Hoc Networks, 200,5 762–776.
[10]V. T. Raisinghani and Iyer. Sridhar ECLAIR: AnEfficient Cross Layer Architecture for Wireless Protocol Stacks. ,. s.l. : WWC, 2004.
[11]Marco Conti, Gaia Maselli, Giovanni Turi, SylviaGiordano, Cross layering in mobile Ad Hoc Network Design. s.l. : IEEE Computer Society, February 2004, pp. 48-51.
[12]Xiaoxin Wu, Gang Ding, and Wenwu Zhu, Load-Based Route Discovery Through Searching Range Adaptation for MANET Throughput, IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 4, MAY 2009, 2055.
[13]Chi Pan Chan, Soung Chang Liew, and An Chan, Many-to-One Throughput Capacity of IEEE 802.11 Multihop Wireless Networks 514 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 8, NO. 4, APRIL 2009
[14]Luca Mottola, Gianpaolo Cugola, and Gian Pietro Picco, A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks, pp: 946-960, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 7, NO. 8, AUGUST 2008.
[15]Han-Chieh Chao and Ching-Yang Huang, Micro-Mobility Mechanism for Smooth Handoffs in an Integrated Ad-Hoc and Cellular IPv6 Network Under High-Speed Movement, , IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 52, NO. 6, NOVEMBER 2003.
[16]Song Guo, Oliver Yang and Yantai Shu, Improving Source Routing Reliability in Mobile Ad Hoc Networks 362 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 16, NO. 4, APRIL 2005
[17]Subir Halder, Amrita Ghosal, , Sipra Das Bit, 'A pre-determined node deployment strategy to prolong network lifetime in wireless sensor network, journal of Computer Communications, Eisevier, 34, pp:1294–1306, 2011
[18]Ian D. Chakeres, Elizabeth M. Belding-Royer,The Utility of HELLO Messages for determining Link Connectivity,. International Symposium on Wireless Personal Multimedia Communications - WPMC , vol. 2, pp. 504-508 vol.2, 2002.
[19]Charles E Perkins and Elizabeth M Royer Adhoc On Demand Distance Vector Routing,
[20]C. Perkins, E. Belding-Royer and S. Das, Ad hoc On-Demand Distance Vector (AODV) Routing, Request for Comments: 3561, July 2003.
[21]Mehajabeen Fatima, Roopam Gupta, T.K. Bandhopadhyay RDCLRP-Route Discovery by Cross Layer Routing Protocol for Performance Improvement, Kanyakumari, India : International Conference on Network and Computer Science, April 2011, Vols. V5-306.
[22]Mehajabeen Fatima, Roopam Gupta, and T.K. Bandhopadhyay Route Discovery by Cross Layer Approach for MANET , s.l. : International Journal of Computer Applications, January 2012, Vols. Volume 37– No.7, pp. 0975 – 8887.