IMPROVING THE EFFICIENCY OF ROUTING WITH DBR AND CDS IN AD HOC NETWORKS
K.Kiruthika1, D.Jennifer2, K.Sangeetha3
Assistant Professors, Department of Computer Science and Engineering
9710929731 1, 98408172312, 96005687193
[email protected],1,[email protected],[email protected]
Panimalar Engineering College, Chennai- 600123, Tamilnadu, India
ABSTRACT:
In this paper we are going to investigate the capabilities of local transmit algorithms in
reducing the total number of transmissions that are required to achieve full release. In the active (dynamic)
approach, home algorithms determine the status of each node “on-the-fly” based on home topology information
and transmit state information. Using the active (dynamic) approach, it was recently shown that home broadcast
algorithms can achieve a stable approximation factor to the optimum solution when location information is
available, with help of location information can simplify the problem in static approach so we have to design a
local transmit algorithm(DBR-Dynamic Broadcast Routing) in which the status of each node is decided “onthe-fly” and prove that the algorithm can achieve both full delivery and a constant approximation to the
optimum solution.
Keywords: Mobile ad hoc networks, distributed algorithms, broadcasting, connected dominating set, constant
approximation, DBR.
INTRODUCTION:
WIRELESS AD HOC networks have emerged to support applications, in which it is required to have
wireless communications among a variety of devices without relying on any infrastructure or central
management. In ad hoc networks, wireless devices, simply called nodes, have limited transmission range.
Therefore, each node can directly communicate with only those within its transmission range (i.e., its
neighbors) and requires other nodes to act as routers in order to communicate with out-of -range destinations. A
set of nodes form a Dominating Set (DS) if every node in the network is either in the set or has a neighbor in
1
the set. A DS is called a Connected Dominating Set (CDS) if the sub graph induced by its nodes is connected.
Clearly, the forwarding nodes, together with the source node, form a CDS. On the other hand, any CDS can be
used for broadcasting a message (only nodes in the set are required to forward). Therefore, the problems of
finding the minimum number of required transmissions (or forwarding nodes) and finding a Minimum
Connected Dominating Set (MCDS) can be reduced to each other.
CONNECTED DOMINATING SET:
A connected dominating set of a graph G is a set D of vertices with two properties:
1. Any node in D can reach any other node in D by a path that stays entirely within D. That is, D induces a
connected subgraph of G.
2. Every vertex in G either belongs to D or is adjacent to a vertex in D. That is, D is a dominating set of G
EXISTING SYSTEM:-
One of the fundamental operations in wireless ad hoc networks is broadcasting, where a node
disseminates a message to all other nodes in the network. This can be achieved through flooding, in which
every node transmits the message after receiving it for the first time. However, flooding can impose a large
number of redundant transmissions. Result of this flooding concept is waste of constrained resources such as
bandwidth and power due to the redundant transmission. Normally, not every node is required to forward the
message in order to deliver it to all nodes in the network.
Example: In a wireless ad hoc network, wireless devices are called nodes, it have only limited transmission
range. Therefore, each node can directly communicate with only those within its transmission range (i.e., its
neighbors) and required other nodes to act as routers in order to communicate with out-of-range destination.
2
Fig 1. Data Flow in Existing System
EXISTING SYSTEM ALGORITHM: - “Neighbor-information based broadcast algorithms”.
Algorithm can be further classified as neighbor-designating and self-pruning algorithms. In neighbordesignating each forwarding node selects some of its local neighbors to forward the message. Only the selected
nodes are then required to forward the message in the next step. For example, a forwarding node u may select a
subset of its 1-hop neighbors such that any 2-hop neighbor of u is a neighbor of at least one of the selected
nodes. In self-pruning algorithms, On the other hand, each node decides by itself whether or not to forward a
message.
PROPOSED SYSTEM:
The proposed algorithm uses position information in order to design a strong self-pruning condition.
But in existing, we observed that position information can simplify the problem of reducing the total number
of broadcasting nodes. Moreover, having position information may not be practical in some applications. So
we design a hybrid (i.e., both neighbor-designating and self-pruning) broadcast algorithm and show that the
algorithm can achieve both full delivery and constant approximation only using connectivity information. A
set of nodes form a dominating set (DS) if every node in network is either in the set or has a neighbor in the
set. A DS is called aconnected dominating set (CDS). Here we are finding the minimum CDS.
3
Fig.2 Data Flow in Proposed System
In this, we are using two approaches called static and dynamic for what means to broadcast algorithm in
wireless network. Local broadcast algorithms determine the status of each node to transmit the data. It is
possible if even position information is not available.
PROPOSED SYSTEM ALGORITHM EXPLANATION:
Hybrid broadcast algorithm:
In proposed algorithm, each node has a list of its 2-hop neighbor (i.e., nodes that are at most 2 hops away). This
can be done in two rounds,
i) In first round each node broadcasts its id to its 1-hop neighbors (simply called neighbors) at the end of
the first round, and each node has a list of its neighbours.
ii) In the second round, each node transmits its id together with the list of its neighbours. There is no
chance for not delivering the data. Because each node having 2-hop neighbour information.
COMPARISON OF PROPOSED AND EXISTING SYSTEM:
Existing System
Proposed System
Every node must communicate with each other to In general, not every node is required to forward the date
forward the data in a network. Due to this we were because every node maintaining a list of its neighbours. So
4
getting redundant data.
we can easily identify the destination.
Local broadcast algorithm based on the static In this system, dynamic approach is used to achieve the
approach cannot find the connected dominating set.
good approximation factor.
Status of each node is determined by local
Determine the status of each node “on-the-fly” based on
broadcast algorithm based on local topology local topology information and broadcast state information.
information. Status means, determine either it is
forward node or non forward node.
After determine the status, we have to find the We are using dynamic approach, here position information
routing table this is somewhat difficult when the in determine only when the broadcast the id.
position information is not available.
We cannot reduce the number of transmission
When finding the connected dominating set means we can
to send the data in a network.
reduce the no of transmission.
Forwarding nodes are determined statically
Determined based on both local topology and broadcast
based on only local topology information.
state information.
Table 1. COMPARISON OF PROPOSED AND EXISTING SYSTEM
CONCLUSION:
In this paper we had investigated the capabilities of local broadcast algorithms in reducing the total
number of transmissions that are required to achieve full delivery. As proven, local broadcast algorithms based
on the static approach cannot guarantee a small sized CDS if the position information is not available. It was
shown that having relative position information can greatly simplify the problem of reducing the total number
5
of selected nodes using the static approach. In fact, we showed that a constant approximation factor is
achievable using position information.
Using the dynamic approach, it was recently shown that a constant approximation is possible using
(approximate) position information. In this paper, we showed that local broadcast algorithms based on the
dynamic approach do not require position information to guarantee a constant approximation factor. The results
presented in the paper can be extended to the case where nodes are distributed in three-dimensional space. Also,
the proposed algorithm based on the dynamic approach can be extended to the case where nodes have different
transmission ranges or when the network is modelled using the quasi unit disk
REFERENCES
1)
Y. Chen and J.L. Welch, “Location-Based Broadcasting for Dense Mobile Ad Hoc Networks,” Proc.
ACM Int’l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 63-70, 2005.
2)
M. Khabbazian and V.K. Bhargava, “Efficient Broadcasting in Mobile Ad Hoc Networks,” IEEE Trans.
Mobile Computing, vol. 8,no. 2, pp. 231-245, Feb. 2009.
3)
M. Khabbazian and V.K. Bhargava, “Localized Broadcasting with Guaranteed Delivery and Bounded
Transmission Redundancy,”IEEE Trans. Computers, vol. 57, no. 8, pp. 1072-1086, Aug. 2008.
4)
Keshavarz-Haddad, V. Ribeiro, and R. Riedi, “DRB and DCCB:Efficient and Robust Dynamic
Broadcast for Ad Hoc and Sensor Networks,” proc. IEEE Fourth Ann. Comm. Soc. Conf. Sensor, Mesh and
Ad Hoc Comm. and Networks (SECON ’07), pp. 253-262, 2007.
5) Ch. V. Raghavendran,G. Naga SatishP. Suresh Varma,I. R. Krishnam Raju “Enhancing the Performance of
Routing in Mobile Ad Hoc Networks using Connected Dominating Sets” pp22-28, February 2013
6)
H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, “Efficient Flooding Scheme Based on 1-Hop Information in
Mobile Ad Hoc Networks,”Proc. IEEE INFOCOM, 2006.
7)
J. Wu, W. Lou, and F. Dai, “Extended Multipoint Relays to Determine Connected Dominating Sets in
Manets,” IEEE Trans.Computers, vol. 55, no. 3, pp. 334-347, Mar. 2006.
6