Contact at or 8097636691
Responsive Ads Here

Tuesday, 13 February 2018

Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks(2011)

Efficient Broadcasting with
Guaranteed Coverage in Mobile Ad 

Hoc Networks(2011)

   We study an efficient broadcast scheme in mobile ad hoc networks (MANETs). The objective is to determine a small set of forward nodes to ensure full coverage. We first study several methods that guarantee coverage when the local view of each node on its neighborhood information is updated in a timely manner. Then we consider a general case where nodes move even during the broadcast process, making it impractical to maintain up-to-date and consistent local views.
A formal framework is used to model inaccurate local views in MANETs, where full coverage is guaranteed if three sufficient conditions,Connectivity, link availability, and consistency, are met.
Three solutions are proposed to satisfy those conditions. First, we give a minimal transmission range that maintains the connectivity of the virtual network constructed from local views. Then, we use two transmission ranges, one for neighborhood information collection and the other for actual data transmission, to form a buffer zone that guarantees the availability of logical links in the physical network. Finally, we propose a mechanism called aggregated local view to ensure consistent local views. By these, we extend Wu and Dai’s coverage condition for broadcasting in a network with mobile nodes
Existing System
The existing methods in Broad casting follow the protocols which suffer from the following drawbacks:
ü  Probabilistic approach cannot guarantee full coverage
ü  Neighbor set information not accurate
ü  Static network broadcast schemes perform poorly in terms of delivery ratio when nodes are mobile.
ü  There are two sources that cause the failure of message delivery Collision.
ü  The messages from nodes w and x collide at node y, so node y does not receive any message.
ü  Mobile nodes, a former neighbor moves out of the transmission range of the current node
Due to these reasons the broad casting protocol in mobile network may not result in accurate result.
Proposed System
      The proposed system based on mobility management and, in particular, neighbor set management in a mobile environment. The broadcast protocols in MANETs based on self-pruning. The major task is of Mobility Management where, the capacity of MANETs is constrained by the mutual interference of concurrent transmissions between nodes. The mobility of nodes adds another dimension of complexity in the mutual interference.
Broadcast Protocols Based on Self-Pruning, which helps in a MANETS. This is modeled as an undirected graph G = (V, E) where V is a set of mobile nodes and E is a set of wireless links. A link exists between two nodes u and v if and only if their physical distance is less than a transmission range r. The proposed efficient broadcast protocol based on self-pruning. In a self-pruning protocol, each node determines its forwarding status based on its local k-hop information, where k = 2 or 3.
This proposed method maintains a mobility control method that addresses connectivity, link availability, and consistency issues.
Three sufficient conditions are given:
ü  the first one on the connectivity of the physical network to ensure connectivity of the virtual network,
ü  the second one on the bound of the range difference to ensure link availability, and the third one on the consistent local views to ensure correct decision made at each node
Hardware specifications:
Processor                       :           Pentium IV 2.4GHZ
RAM                                :           512 MB
Hard disk                                    :           40 GB
Software Specification
• Operating system     : Windows XP Professional
• Technology               : Microsoft Visual Studio .Net 2008
• Coding Language   : VB.Net
Modules and its Description:
This project contains 3 modules. They are:
  1. Node addition and Mobility Creation
  2. Single and Dual neighbor set routing
  3. Comparison routing
Module Description:
1.    Node addition and Mobility Creation
The simulated model creates the cellular region and According to the Node count the nodes are placed in the cellular region for proposed system study. The static neighbor set algorithm is invoked by selecting the source and destination.
2.      Single and Dual neighbor set routing
Each node determines its forwarding status based on its local single neighbor set information. Based on next single neighbor set information is forwarded to link the virtual network based on link availability. The directed graph is designed to model this network and nodes in the directed graph represents mobile node and vertex of graph represents the connectivity established between nodes. So to implement the algorithm in program point of view Directed graph concept is used.
Each node determines its forwarding status based on its local Dual neighbor set information. Based on next two different neighbor set information is forwarded to link the virtual network based on link availability. The same concept above mentioned is called with this input. Result is displayed in the adjacent frame.
3.     Comparison routing
The result of the above mentioned algorithm is compared in the following three properties
1. Link
2. Connectivity
3. Availability
The separate class is written that invokes the two methods and compares the properties. The efficiency ratio is displayed to the user. The efficiency of the delivery is found to be 99% in this simulated mobile adhoc network.

No comments:

Post a Comment