Connected dominating set algorithms for wireless sensor networks
01 May 2013-International Journal of Sensor Networks (Inderscience Publishers)-Vol. 13, Iss: 1, pp 121-134
TL;DR: This paper provides a review on connected dominating set construction techniques for wireless sensor networks and proposes a new approach to manage and extend network lifetime.
Abstract: Wireless Sensor Networks WSNs are gaining more interest in a variety of applications. Of their different characteristics and challenges, network management and lifetime elongation are the most considered issues in WSN based systems. Connected Dominating Set CDS is known to be an efficient strategy to control network topology, reduce overhead, and extend network lifetime. Designing a CDS algorithm for WSNs is very challenging. This paper provides a review on connected dominating set construction techniques for wireless sensor networks.
Citations
More filters
TL;DR: These proposed algorithms are the first population-based algorithms to solve MWCDS problem on undirected graphs and compare the performance of the proposed algorithms with other greedy heuristics and brute force methods through extensive simulations.
19 citations
TL;DR: A new approximation algorithm with approximation ratio H(Δ)+3 in time O(n2) is proposed to approach the MCDS problem, to divide the sensors in CDS into core sensors and supporting sensors.
Abstract: Finding the minimum connected dominating set (MCDS) is a key problem in wireless sensor networks, which is crucial for efficient routing and broadcasting. However, the MCDS problem is NP-hard. In this paper, a new approximation algorithm with approximation ratio H(Δ)+3 in time O(n2) is proposed to approach the MCDS problem. The key idea is to divide the sensors in CDS into core sensors and supporting sensors. The core sensors dominate the supporting sensors in CDS, while the supporting sensors dominate other sensors that are not in CDS. To minimize the number of both the cores and the supporters, a three-phased algorithm is proposed. (1) Finding the base-core sensors by constructing independent set (denoted as S1), in which the sensors who have the largest $\frac {|N^{2}(v)|}{|N(v)|}$
(number of two-hop neighbors over the number of one-hop neighbors) will be selected greedily into S1; (2) Connecting all base-core sensors in S1 to form a connected subgraph, the sensors in the subgraph are called cores; (3) Adding the one-hop neighbors of the core sensors to the supporter set S2. This guarantees a small number of sensors can be added into CDS, which is a novel scheme for MCDS construction. Extensive simulation results are shown to validate the performance of our algorithm.
9 citations
TL;DR: An improved collaborative coverage algorithm for solving maximum independent set (IC-MIS) and a maximum leaf nodes Steiner tree construction algorithm (ML-ST), both of which can make the result closer to the optimal solution.
Abstract: To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice. Presently, many approximate algorithms have been proposed to construct MCDS, the best among which is adopting the two-stage idea, that is, to construct a maximum independent set (MIS) firstly and then realize the connectivity through the Steiner tree construction algorithm. For the first stage, this paper proposes an improved collaborative coverage algorithm for solving maximum independent set (IC-MIS), which expands the selection of the dominating point from two-hop neighbor to three-hop neighbor. The coverage efficiency has been improved under the condition of complete coverage. For the second stage, this paper respectively proposes an improved Kruskal–Steiner tree construction algorithm (IK–ST) and a maximum leaf nodes Steiner tree construction algorithm (ML-ST), both of which can make the result closer to the optimal solution. Finally, the simulation results show that the algorithm proposed in this paper is a great improvement over the previous algorithm in optimizing the scale of the connected dominating set (CDS).
8 citations
Cites background from "Connected dominating set algorithms..."
...The connected dominant set (CDS) becomes the best choice for an ad hoc sensor network as the virtual backbone network [8,9,10], which guarantees the operation of the network by constructing the minimum connected dominant set (MCDS)....
[...]
01 Jan 2006
TL;DR: This paper presents the enhance approach to the GMPR algorithm to further reduce the CDS size, and the effectiveness of this approach is confirmed through simulations.
Abstract: An efficient broadcast algorithm can significantly improve the resource utilization in an ad hoc network by decreasing the number of packet collisions and overall power consumption. However, the nature of ad hoc networks poses a challenging problem for creating an efficient broadcast algorithm. Recently a Gateway Multipoint Relays (GMPR) broadcast algorithm has been proposed, which integrates the Multipoint Relay (MPR) and the maximal independent set (MIS) concepts to construct a small size connected dominating set (CDS) in a network. In this paper, we present our enhance approach to the GMPR algorithm to further reduce the CDS size. The effectiveness of our approach is confirmed through simulations.
7 citations
TL;DR: The proposed approaches efficiently construct and maintain a small CDS for challenging environments and provide significant energy efficiency without introducing any performance degradation in terms of CDS size.
Abstract: Wireless sensing technology is becoming a new scientific instrument for environmental monitoring under extreme conditions. This class of applications requires reliable, energy-efficient, and self-organizing approaches. Connected dominating sets (CDSs) have been widely used for virtual backbone construction in unstructured wireless sensor networks to control topology, facilitate routing, and extend network lifetime. This paper proposes two distributed algorithms for CDS construction and maintenance in extreme wireless sensor networks. The proposed approaches efficiently construct and maintain a small CDS for challenging environments. Simulation shows that our proposed approaches provide significant energy efficiency without introducing any performance degradation in terms of CDS size.
7 citations
Cites background from "Connected dominating set algorithms..."
...A good distributed algorithm is one that has low message complexity and requires the least neighboring information to construct a CDS [2]....
[...]
...Therefore, energy-efficient and self-organizing protocols should be designed for the characteristics of SEE applications [2], [4], [5]....
[...]
...When a number (or a percentage) of backbone nodes dies, a self-healing technique is necessary to fix the constructed CDS [2], [3], [5]....
[...]
References
More filters
Book•
14 Nov 1995
TL;DR: In this article, the authors introduce the concept of graph coloring and propose a graph coloring algorithm based on the Eulers formula for k-chromatic graphs, which can be seen as a special case of the graph coloring problem.
Abstract: 1. Fundamental Concepts. Definitions and examples. Paths and proofs. Vertex degrees and counting. Degrees and algorithmic proof. 2. Trees and Distance. Basic properties. Spanning trees and enumeration. Optimization and trees. Eulerian graphs and digraphs. 3. Matchings and Factors. Matchings in bipartite graphs. Applications and algorithms. Matchings in general graphs. 4. Connectivity and Paths. Cuts and connectivity. k-connected graphs. Network flow problems. 5. Graph Coloring. Vertex colorings and upper bounds. Structure of k-chromatic graphs. Enumerative aspects. 6. Edges and Cycles. Line graphs and edge-coloring. Hamiltonian cycles. Complexity. 7. Planar Graphs. Embeddings and Eulers formula. Characterization of planar graphs. Parameters of planarity. 8. Additional Topics. Perfect graphs. Matroids. Ramsey theory. More extremal problems. Random graphs. Eigenvalues of graphs. Glossary of Terms. Glossary of Notation. References. Author Index. Subject Index.
7,126 citations
"Connected dominating set algorithms..." refers background in this paper
...The concept of the connected dominating set (CDS) comes from graph theory [3]....
[...]
01 Aug 1999
TL;DR: In this paper, the authors proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances.
Abstract: Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances. Our simulation results show that the proposed approach outperforms a classical algorithm. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.
1,198 citations
11 Jun 2001
TL;DR: The experimental results demonstrate that by using only a subset of sensor nodes at each moment, the system achieves a significant energy savings while fully preserving coverage.
Abstract: Wireless sensor networks have emerged recently as an effective way of monitoring remote or inhospitable physical environments. One of the major challenges in devising such networks lies in the constrained energy and computational resources available to sensor nodes. These constraints must be taken into account at all levels of the system hierarchy. The deployment of sensor nodes is the first step in establishing a sensor network. Since sensor networks contain a large number of sensor nodes, the nodes must be deployed in clusters, where the location of each particular node cannot be fully guaranteed a priori. Therefore, the number of nodes that must be deployed in order to completely cover the whole monitored area is often higher than if a deterministic procedure were used. In networks with stochastically placed nodes, activating only the necessary number of sensor nodes at any particular moment can save energy. We introduce a heuristic that selects mutually exclusive sets of sensor nodes, where the members of each of those sets together completely cover the monitored area. The intervals of activity are the same for all sets, and only one of the sets is active at any time. The experimental results demonstrate that by using only a subset of sensor nodes at each moment, we achieve a significant energy savings while fully preserving coverage.
1,074 citations
TL;DR: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex.
Abstract: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex i
1,026 citations
09 Jun 2002
TL;DR: This paper derives an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network and investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity.
Abstract: This paper investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity Both topology attributes depend on the spatial distribution of the nodes and their transmission range Using typical modeling assumptions :--- :a random uniform distribution of the nodes and a simple link model :--- :we derive an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes are needed to cover a certain area with a k--connected network We also investigate these questions by various simulations and thereby verify our analytical expressions Finally, the impact of mobility is discussedThe results of this paper are of practical value for researchers in this area, eg, if they set the parameters in a network--level simulation of a mobile ad hoc network or if they design a wireless sensor network
998 citations