A neighbor coverage based probabilistic rebroadcast for reducing routing overhead in mobile ad hoc networks
Download as DOC, PDF0 likes183 views
This document proposes a neighbor coverage-based probabilistic rebroadcast protocol to reduce routing overhead in mobile ad hoc networks. It calculates a rebroadcast delay based on common neighbors to determine the forwarding order. It also calculates a rebroadcast probability based on uncovered neighbors, connectivity, and node density. Simulation results show it generates less rebroadcast traffic than flooding and other optimized schemes.
A neighbor coverage based probabilistic rebroadcast for reducing routing overhead in mobile ad hoc networks
- 1. A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks ABSTRACT: 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
- 2. 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. EXISTING SYSTEM: Broadcasting is an effective mechanism for route discovery, but the routing overhead associated with the broadcasting can be quite large, especially in high dynamic networks. DISADVANTAGES OF EXISTING SYSTEM: The existing broadcasting protocol tested analytically and experimentally, and showed that the rebroadcast is very costly and consumes too much network resource. The broadcasting incurs large routing overhead and causes many problems such as redundant retransmissions, contentions, and collisions PROPOSED SYSTEM: The main contributions of this paper are as follows: 1. We propose a novel scheme to calculate the rebroadcast delay. The rebroadcast delay is to determine the forwarding order. The node which has
- 3. more common neighbors with the previous node has the lower delay. If this node rebroadcasts a packet, then more common neighbors will know this fact. Therefore, this rebroadcast delay enables the information that the nodes have transmitted the packet spread to more neighbors, which is the key to success for the proposed scheme. 2. We also propose a novel scheme to calculate the rebroadcast probability. The scheme considers the information about the uncovered neighbors (UCN), connectivity metric and local node density to calculate the rebroadcast probability. The rebroadcast probability is composed of two parts: a. additional coverage ratio, which is the ratio of the number of nodes that should be covered by a single broadcast to the total number of neighbors; and b. connectivity factor, which reflects the relationship of network connectivity and the number of neighbors of a given node ADVANTAGES OF PROPOSED SYSTEM: It reduces the routing overhead in MANETs. This neighbor coverage knowledge includes additional coverage ratio and connectivity factor.
- 4. It’s a new scheme to dynamically calculate the rebroadcast delay, which is used to determine the forwarding order and more effectively exploit the neighbor coverage knowledge. Simulation results show that the proposed protocol generates less rebroadcast traffic than the flooding and some other optimized scheme in literatures. SYSTEM ARCHITECTURE: ALGORITHM USED: Neighbor Coverage-based Probabilistic Rebroadcast
- 6. SYSTEM CONFIGURATION:- HARDWARE REQUIREMENTS:- Processor -Pentium –III Speed - 1.1 Ghz RAM - 256 MB(min) Hard Disk - 20 GB Floppy Drive - 1.44 MB Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse Monitor - SVGA SOFTWARE REQUIREMENTS:- Operating System : WINDOWS XP Front End : C#.NET
- 7. TOOL : VISUAL STUDIO 2008 Database : SQL SERVER 2005 REFERENCE: Xin Ming Zhang, Member, IEEE, En Bo Wang, Jing Jing Xia, and Dan Keun Sung, Senior Member, IEEE, “A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 3, MARCH 2013.