An Analysis of The Mechanism for Reducing Routing Overhead in Mobile Ad Hoc Network Using Probabilistic Rebroadcast Technique

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2015 by IJETT Journal
Volume-19 Number-5
Year of Publication : 2015
Authors : Mr. Prasad R. Patil , Prof. R.S.Nipanikar
  10.14445/22315381/IJETT-V19P248

MLA 

Mr. Prasad R. Patil , Prof. R.S.Nipanikar "An Analysis of The Mechanism for Reducing Routing Overhead in Mobile Ad Hoc Network Using Probabilistic Rebroadcast Technique", International Journal of Engineering Trends and Technology (IJETT), V19(5), 275-278 Jan 2015. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract

Mobile ad hoc network (MANETs) consist of nodes which are continuously moving, this causes continuous link breakage due to which there is frequent path failure occurs and route discoveries is required. The fundamental technique for route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request (RREQ) packet unless it has route to the destination. This mechanism incur retransmission which causes overhead and decrease the packet deliverance ratio and increase the end delay, which cannot be avoided. In this paper we proposed reducing routing overhead in mobile ad hoc network using probabilistic rebroadcast mechanism. In this we have introduced rebroadcast delay to determine the neighbour coverage knowledge which will be useful in finding accurate additional coverage ratio and rebroadcast order. To provide node density adaptation we have also defined connectivity factor. By addition of the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify decrease in the routing overhead by decreasing the number of retransmission and improvement in routing performance.

References

[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 Discovery 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] B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 194- 205, 2002.
[7] J. Kim, Q. Zhang, and D.P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbor Confirmation in Mobile Ad Hoc Networks,” Proc. IEEE GlobeCom, 2004.
[8] J.D. Abdulai, M. Ould-Khaoua, and L.M. Mackenzie, “Improving Probabilistic Route D
iscovery in Mobile Ad Hoc Networks,” Proc. IEEE Conf. Local Computer Networks, pp. 739-746, 2007. [9] Z. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, vol. 21, pp. 1707-1716, 2002.
[10] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 129-130, 2000.
[11] J.D.Abdulai, M. Ould-Khaoua, L.M. Mackenzie, and A. Mohammed, “Neighbour Coverage: A Dynamic Probabilistic Route Discovery for Mobile Ad Hoc Networks,” Proc. Int’l Symp. Performance Evaluation of Computer and Telecomm.Systems (SPECTS ’08), pp. 165-172, 2008.
[12] J. Chen, Y.Z. Lee, H. Zhou, M. Gerla, and Y. Shu, “Robust Ad Hoc Routing for Lossy Wireless Environment,” Proc. IEEE Conf. Military Comm. (MILCOM ’06), pp. 1-7, 2006.
[13] A. Keshavarz-Haddady, V. Ribeirox, and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. IEEE Comm. Soc. Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks (SECON ’07), pp. 253-262, 2007.
[14] F. Stann, J. Heidemann, R. Shroff, and M.Z. Murtaza, “RBP: Robust Broadcast Propagation in Wireless Networks,” Proc. Int’l Conf. Embedded Networked Sensor Systems (SenSys ’06), pp. 85-98, 2006.
[15] 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,200

Keywords
AODV, DSR, RREQ, broadcast Routing overhead, MANET, probabilistic rebroadcast.