The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2013 vol.12)
pp: 424-433
Xin Ming Zhang , Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
En Bo Wang , Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
Jing Jing Xia , Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
Dan Keun Sung , Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Daejeon, South Korea
Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. 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. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines 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.
probability, mobile ad hoc networks, routing performance, neighbor coverage based probabilistic rebroadcast, routing overhead, mobile ad hoc networks, MANET, frequent link breakage, route discovery, data dissemination mechanism, mobile node blindly rebroadcast, route request packet, coverage based probabilistic rebroadcast protocol, rebroadcast order, connectivity factor, node density adaptation, coverage ratio, reasonable rebroadcast probability, probabilistic mechanism, Delay, Routing protocols, Broadcasting, Routing, Mobile computing, Probabilistic logic, routing overhead, Mobile ad hoc networks, neighbor coverage, network connectivity, probabilistic rebroadcast
Xin Ming Zhang, En Bo Wang, Jing Jing Xia, Dan Keun Sung, "A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol.12, no. 3, pp. 424-433, March 2013, doi:10.1109/TMC.2011.277
[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] 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] B. Williams and T. Camp, "Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks," Proc. ACM MobiHoc, pp. 194-205, 2002.
[8] 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.
[9] 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.
[10] Z. Haas, J.Y. Halpern, and L. Li, "Gossip-Based Ad Hoc Routing," Proc. IEEE INFOCOM, vol. 21, pp. 1707-1716, 2002.
[11] W. Peng and X. Lu, "On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks," Proc. ACM MobiHoc, pp. 129-130, 2000.
[12] 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.
[13] 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.
[14] 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.
[15] 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.
[16] 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.
[17] 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.
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool