ICTACT Journal on Communication Technology

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Model of Retransmission Mechanism in Wireless Ad Hoc Networks


Affiliations
1 Department of Electronics and Communication Engineering, Mount Zion College of Engineering and Technology, India
     

   Subscribe/Renew Journal


In mobile Adhoc Networks (MANETs), due to high mobility of nodes there exist 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 project, a neighbor coverage based probabilistic rebroadcast protocol is used for reducing routing overhead in MANETs. In order to exploit the neighbor coverage knowledge, a novel rebroadcast delay is used to determine the rebroadcast order, and obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. And also a connectivity factor is defined to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. In proposed system to reduce the routing overhead in mobile adhoc networks’ adaptive hybrid routing protocol is used. By implementing this methodology, we can increase the group packet delivery ratio and also reduce the latency of the nodes in adhoc network nodes.

Keywords

Mobile Adhoc Network, Network Connectivity, Routing Overhead.
Subscription Login to verify subscription
User
Notifications
Font Size

  • J.D. Abdulai, M. Ould-Khaoua, and L.M. Mackenzie, “Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks”, Proceedings of IEEE Conference on Local Computer Networks, pp. 739-746, 2007.

  • H. AlAamri, M. Abolhasan and T. Wysocki, “On Optimizing Route Discovery in Absence of Previous Route Information in MANETs”, Proceedings of IEEE Conference on Vehicular Technology, pp. 1-5, 2009.

  • J. Chen, Y. Z. Lee, H. Zhou, M. Gerla and Y. Shu, “Robust AdHoc Routing for Lossy Wireless Environment”, Proceedings of IEEE Conference on Military Communications, pp.1-7, 2006.

  • Z.J. Haas, J.Y. Halpern and L. Li, “Gossip-based Ad hoc Routing”, IEEE/ACM Transactions on Networking, Vol. 14, No. 3, pp. 479-491, 2006.

  • B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks”, Proceedings of 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 194-205, 2002.

  • A. Keshavarz-Haddady, V. Ribeirox and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks”, Proceedings of 4th IEEE Annual Conference on Sensor, Mesh and Ad Hoc Communications and Networks, pp. 253-262, 2007.


Abstract Views: 345

PDF Views: 0




  • A Model of Retransmission Mechanism in Wireless Ad Hoc Networks

Abstract Views: 345  |  PDF Views: 0

Authors

T. Santhi
Department of Electronics and Communication Engineering, Mount Zion College of Engineering and Technology, India

Abstract


In mobile Adhoc Networks (MANETs), due to high mobility of nodes there exist 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 project, a neighbor coverage based probabilistic rebroadcast protocol is used for reducing routing overhead in MANETs. In order to exploit the neighbor coverage knowledge, a novel rebroadcast delay is used to determine the rebroadcast order, and obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. And also a connectivity factor is defined to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. In proposed system to reduce the routing overhead in mobile adhoc networks’ adaptive hybrid routing protocol is used. By implementing this methodology, we can increase the group packet delivery ratio and also reduce the latency of the nodes in adhoc network nodes.

Keywords


Mobile Adhoc Network, Network Connectivity, Routing Overhead.

References