In mobile ad hoc network (MANET), each device is continuously move independently in any direction, and will therefore change its links to other devices continuously. Due to high mobility of nodes in the mobile ad-hoc network there will be the frequent link breakage which gives the frequent path failure and route discovery. The overhead of route discovery cannot be ignored in the Mobile ad-hoc network. Basically Broadcasting is the fundamental mechanism in route discovery, in which the receiving node blindly rebroadcast the Route Request packet until it does not get the destination. Due to this rebroadcasting cause the overhead and decreases the packet delivery ration and increase the end to end delay. That means it’s occurred the broadcast Strom Problem. In this paper, we proposed reducing the routing overhead in the Mobile ad-hoc Network using DSDV, DSR, AODV & NCPR probabilistic rebroadcast mechanism. In which rebroadcast delay is determined by the neighbor coverage knowledge which will help in finding accurate additional coverage ratio and rebroadcast order. We also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, we can determine rebroadcast probability. This approach can show improvement in routing performance and diminish the routing overhead by decreasing the number of retransmission.

 

Published In : IJCSN Journal Volume 3, Issue 4

Date of Publication : August 2014

Pages : 229 - 233

Figures : 04

Tables : --

Publication Link : Review on Reducing Routing Overhead in Mobile Ad-hoc Network Using DSDV, DSR, AODV & NCPR

 

 

 

Rajeshree V. Ambulkar : Dept. of Comp. Science & Engg, Nuva College of Engineering. & Technology, Nagpur, R. T. M. Nagpur University Nagpur, Maharashtra, India

Milind Tote : Dept. of Comp. Science & Engg, Gurunanak College of Engineering, Nagpur, R. T. M. Nagpur University Nagpur, Maharashtra, India

 

 

 

 

 

 

 

Mobile ad hoc network

DSDV

DSR

AODV

NCRP

In this review paper we proposed to reduce the routing overhead in MANET by introducing probabilistic rebroadcast mechanism based on neighbor coverage knowledge which includes additional coverage ratio and connective factor. The paper focus on mechanism that will have good performance when the network is in high density or the traffic load is high. The proposed system will generate less rebroadcast traffic that used to occur in flooding. Because of less redundant rebroadcast, the proposed work will mitigate the network collision and contention; this will increase the packet delivery ratio and reduce the average end to end delay. Although the network is in high density or the traffic is heavily loaded, the proposed work will have good performance. In future this method can be used to check the suitability in VANETS and the same has to be implemented.

 

 

 

 

 

 

 

 

 

[1] C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc On- Demand Distance Vector (AODV) Routing, IETF RFC 3561, 2003.

[2] D. Johnson, Y. Hu, and D. Maltz, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) for IPv4, IETF RFC 4728, vol. 15, pp. 153-181, 2007.

[3] H. AlAamri, M. Abolhasan, and T. Wysocki, “On Optimising Route Discover y in Absence of Previous Route Information in MANETs,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1-5, 2009.

[4] X. Wu, H.R. Sadjadpour, and J.J. Garcia-Luna-Aceves, “Routing Overhead as a Function of Node Mobility: Modeling Framework and Implications on Proactive Routing,” Proc. IEEE Int’l Conf. Mobile Ad Hoc and Sensor Systems (MASS ’07), pp. 1- 9, 2007.

[5] S.Y. Ni, Y.C. Tseng, Y.S. Chen, and J.P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM/IEEE MobiCom, pp. 151-162, 1999.

[6] Ambarish R. Bhuyar et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (1) , 2014,390- 393,www.ijcsit.com

[7] Network Simulator - ns - 2. Available at http://www.isi.edu/nsnam/ns/.

[8] Wireless lan medium access control (mac) and physical layer (phy) specifications. ISO/IEC Std. 8802-11, ANSI/IEEE Std 802.11, 1999.

[9] Laurent Viennot Amir Qayyum and Anis Laouiti. Multipoint relaying:An efficient technique for flooding in mobile wireless networks.Technical report, Project HiPERCOM, INRIA Rocquencourt, 2000. INRIA research report RR-3898

[10] Thomas Heide Clausen* , Philippe Jacquet and Laurent Viennot Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks INRIA Rocquencourt, Projet Hipercom, Domaine de Voluceau, B.P.105, 78153 Le Chesnay cedex, France.

[11] Xin Ming Zhang, Member , IEEE , En Bo Wang, Jing Jing Xia, andDan Keun Sung, Senior Member , IEEE , “A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing RoutingOverhead in Mobile Ad Hoc Networks”.

[12] T. Arunkumar, “Neighbour Coverage Based Probabilistic Rebroadcast Reduction of Routing Overhead and Cross Talk Avoidance in MANETs “.

[13] D. Rex Alex Paul, M. Prem Kumar, “A Power Balancing Approach for Efficient Route Discovery by Selecting Link Stability Neighbors in Manet,” International Journal of Innovative Research in Computer and Communication Engineering, Vol.2, Special Issue 1, March 2014

[14] F. Xue and P.R. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks,” Wireless Networks, vol. 10, no. 2, pp. 169-181, 2004.