A Survey of Coverage-Based Broadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks

International Journal of Computer Trends and Technology (IJCTT)          
© 2014 by IJCTT Journal
Volume-11 Number-2
Year of Publication : 2014
Authors : V.V.V. Pradeep Sastry , Dr S.Arvind
DOI :  10.14445/22312803/IJCTT-V11P111


V.V.V. Pradeep Sastry , Dr S.Arvind."A Survey of Coverage-Based Broadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks". International Journal of Computer Trends and Technology (IJCTT) V11(2):52-57, May 2014. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
The MANET is a special type of wireless mobile network in which mobile hosts can communicate without any aid of established infrastructure and can be deployed for many applications such as battlefield, disaster relief and rescue, etc. Broadcasting is to transmit a message from a source to all the other nodes in the network. A neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, the rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. And also define as connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. The advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. Mobile ad hoc networks (MANETs) are multi hop wireless networks with mobile nodes that can move freely. Due to a dynamic topology and limited resources, developing a dynamic routing protocol that can efficiently find a routing path with low control overhead is crucial to MANETs. This propose a novel route discovery mechanism based on the estimated distance to reduce the control overhead of routing protocols in MANETs.

1. C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561, 2003.
2. J. Kim, Q. Zhang, and D.P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbour Confirmation in Mobile Ad Hoc Networks,” Proc. IEEE GlobeCom, 2004.
3. 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.
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. 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.
6. A. Mohammed, M. Ould-Khaoua, L.M. Mackenzie, C. Perkins, and J.D. Abdulai, “Probabilistic Counter-Based Route Discovery for Mobile Ad Hoc Networks,” Proc. Int’l Conf. Wireless Comm. And Mobile Computing: Connecting the World Wirelessly (IWCMC ’09), pp. 1335-1339, 2009.
7. X.M. Zhang, E.B. Wang, J.J. Xia, and D.K. Sung, “An Estimated Distance Based Routing Protocol for Mobile Ad Hoc Networks,” IEEE Trans. Vehicular Technology, vol. 60, no. 7, pp. 3473-3484, Sept.2011.