Neighbor Coverage-Based Probabilistic Rebroadcast for Increasing Efficiency of Routing in MANETs

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2016 by IJETT Journal
Volume-36 Number-8
Year of Publication : 2016
Authors : Shivani Suresh Yadao, Prof.R.K.Krishna
  10.14445/22315381/IJETT-V36P271

MLA 

Shivani Suresh Yadao, Prof.R.K.Krishna"Neighbor Coverage-Based Probabilistic Rebroadcast for Increasing Efficiency of Routing in MANETs", International Journal of Engineering Trends and Technology (IJETT), V36(8),385-388 June 2016. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
For increasing efficiency in mobile ad-hoc networks (MANETs) containing high mobility of node, it is necessary to avoid frequent link breakages which lead to frequent path failures and route discoveries. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. In this paper, we propose a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. We also define a connectivity factor to provide the node density adaptation.

 References

[1] Bhadauria et al., “Performance Analysis of Ad hoc On- Demand Distance Vector Protocol for MANET” , International Journal of Advanced Research in Computer Science and Software Engineering , Volume 3, pp. 1-6, 2013.
[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: Modelling Framework and Implications on Proactive Routing,” Proc. IEEE Int’l Conf. Mobile Ad Hoc and Sensor Systems (MASS ’07), pp. 1- 9, 2007.
[5] J.D. Abdulai, M. Ould-Khaoua, and L.M. Mackenzie, “Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks,” Proc. IEEE Conf. Local Computer Networks, pp. 739- 746, 2007.
[6] Z. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, vol. 21, pp. 1707-1716, 2002.

Keywords
Mobile ad hoc networks, neighbor coverage, broadcast storm, probabilistic rebroadcast, routing overhead.