Impact of Variable Bit Rate and Packet Size on the Performance Evaluation of Neighbor Aware AODV and DSDV Routing Protocols for MANET's

Mobile Ad hoc Networks (MANET) have become an exciting and important technology in recent years because of the rapid proliferation of wireless nodes. They consist of wireless host that can move freely, rapidly changing, which are likely composed of relatively limited bandwidth and low powered wireless links. MANET is a wireless mobile network in which mobile nodes can transmit and receive without any fixed infrastructure and can be distributed for many applications such as soldiers relaying critical information, business associates sharing information during get together. Authentic and efficient routing is significant and vital in those benefits. A major dispute that lies in MANET communication is the limit less mobility and more frequent link failures. Conventional routing algorithms are therefore deficient for ad-hoc networks. In this paper we propose a modified approach based on the AODV [2] which affords more beneficial results when compared with the conventional AODV and DSDV protocols. Simulations are accomplished in ns-2 and various performance metrics like throughput, end to end delay, Packet loss and pdr [5,6,8] with variable bit rate, packet size and node density and pause time are computed.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Boubaker Daachi,et al.  Three scheduling-levels algorithm for IEEE 802.11 QoS efficiency improvement , 2008, MoMM.

[3]  Suhaidi Hassan,et al.  Loss Detection and Recovery Techniques for TCP in Mobile Ad Hoc Network , 2010, 2010 Second International Conference on Network Applications, Protocols and Services.

[4]  Antony Selvadoss Thanamani,et al.  Evaluation of Energy Efficient Reactive Routing Protocols in QoS Enabled Routing for MANETS , 2011 .

[5]  Dharma P. Agrawal,et al.  Dynamic probabilistic broadcasting in MANETs , 2005, J. Parallel Distributed Comput..

[6]  Gautam Barua,et al.  Performance comparison of two on-demand routing protocols for mobile ad hoc networks , 2002, 2002 IEEE International Conference on Personal Wireless Communications.

[7]  Chenxi Zhu,et al.  QoS routing for mobile ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[9]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[10]  J. J. Garcia-Luna-Aceves,et al.  Performance comparison of three routing protocols for ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[11]  Kenneth M. Hopkinson,et al.  Distributed Fault-Tolerant Quality of Wireless Networks , 2011, IEEE Transactions on Mobile Computing.

[12]  Xinming Zhang,et al.  A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks , 2013, IEEE Transactions on Mobile Computing.

[13]  Lahari.P,et al.  A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks , 2014 .