A Heuristic for Minimum Connected Dominating Set with Local Repair for Wireless Sensor Networks

Rai, Mritunjay; Verma, Shekhar; Tapaswi, Shashikala

doi:10.1109/icn.2009.63

Cited by 12 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first category aims to find the maximal independent set of disconnected nodes that can be connected by a steiner tree or minimum spanning tree [17]. The second category aims to evolve a CDS by growing a small trivial CDS [18,19]. A maximal independent set is a dominating set, where the nodes in the MIS are non-adjacent and no node can be added to this set to maintain the independence of the nodes.…”

Section: Related Workmentioning

confidence: 99%

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

et al. 2020

View full text Add to dashboard Cite

An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating set (MCDS), where the searching space for finding a route is restricted to nodes in this MCDS. Thus, finding MCDS in a WSN provides a flexible low-cost solution for the problem of event monitoring, particularly in places with limited or dangerous access to humans as is the case for most WSN deployments. In this paper, we proposed an adaptive scatter search (ASS-MCDS) algorithm that finds the near-optimal solution to this problem. The proposed method invokes a composite fitness function that aims to maximize the solution coverness and connectivity and minimize its cardinality. Moreover, the ASS-MCDS methods modified the scatter search framework through new local search and solution update procedures that maintain the search objectives. We tested the performance of our proposed algorithm using different benchmark-test-graph sets available in the literature. Experiments results show that our proposed algorithm gave good results in terms of solution quality.

show abstract

Section: Related Workmentioning

confidence: 99%

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The algorithm of Steiner tree and MIS are often applied to the MCDS problem's solution. Rai et al [8] found the DS (dominating set) first, and then used the Steiner tree to construct the routing path, and eventually removed the redundant nodes in CDS. In [11], the authors made use of the reduced neighbor set based on the node's residual energy to construct the backbone.…”

Section: Related Workmentioning

confidence: 99%

A weight based backbone construction algorithm for wireless sensor network

Tseng

Liu

2013

2013 19th Asia-Pacific Conference on Communications (APCC)

View full text Add to dashboard Cite

The CDS (connected dominating set) is usually used in wireless sensor networks to construct the virtual backbone. The MCDS (minimum connected dominating set) problem is often applied to this topic but it is NP-hard. In this paper, we propose a weight based CDS construction algorithm to reduce the size of CDS. The algorithm uses one-hop information to count the weight of a node and selects the appropriate dominators based on the value of its weight. The experimental results show that our proposed algorithm with better performance, depending on the size of CDS, is more energy-efficient with the construction, and use the lower number of transmission messages.

show abstract

“…The algorithm has the time complexity of O(D), where D is the diameter of the network. Some algorithms proposed by Rai et al [2], Misra et al [3] and Das et al [4], are all having splitted into two phases. An MIS is constructed in the first phase and the second phase finds the connectors to connect the MIS nodes.…”

Section: Introductionmentioning

confidence: 99%

Constructing Minimum Connected Dominating Sets with Constant Update Time in Wireless Ad-Hoc Sensor Networks

Ren

Lin³

et al. 2014

2014 IEEE 17th International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

A Connected Dominating Set (CDS) is a subset V of V for the graph G(V, E) and induces a connected subgraph, such that each node in V −V is at least adjacent to one node in V . CDSs have been proposed to formulate virtual backbones in wireless ad-hoc sensor networks to design routing protocols for alleviating the serious broadcast storms problem. It is not easy to construct the Minimum Connected Dominating Set (MCDS) due to the NP-hard nature of the problem. In this paper, we present an effective distributed algorithm to approach the MCDS. We first find an Maximal Independent Set (MIS) and then adds new nodes to the MIS to let subgraph induced by these nodes be connected. The dominators are selected into MIS based on effective degree. Default event is triggered to recalculate and update the node's effective degree after a predetermined amount of time. Many proposed algorithms suffers from high message complexity, thus, which confines the algorithms applied in large scale network. For our algorithm, we prove that it has a good performance in terms of message complexity with message complexity of O(Δ · n). We also analyse some other useful structural properties of CDS generated by our algorithm. Extensive simulations are also implemented to further evaluate the performance of the algorithm.

show abstract

A Heuristic for Minimum Connected Dominating Set with Local Repair for Wireless Sensor Networks

Cited by 12 publications

References 7 publications

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

A weight based backbone construction algorithm for wireless sensor network

Constructing Minimum Connected Dominating Sets with Constant Update Time in Wireless Ad-Hoc Sensor Networks

Contact Info

Product

Resources

About