A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks

Cheng, Xiuzhen; Huang, Xiao; Li, Deying; Wu, Weili; Du, Dajun

doi:10.1002/net.10097

Cited by 289 publications

(125 citation statements)

References 15 publications

Supporting

Mentioning

125

Contrasting

Order By: Relevance

“…In such graphs, nodes are unit circles, where any two nodes are said to be adjacent, if and only if, they reside within the unit distance. As data transmission is a major energy consumer in WSNs, most current algorithms address the Minimum sized CDS (MCDS) to reduce global communication distances and transmission rates [12].…”

Section: Related Workmentioning

confidence: 99%

Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks

Chinnasamy¹,

Alphonse²,

Janakiraman³

2017

IJISA

View full text Add to dashboard Cite

Abstract-Energy-efficient routing is an extremely critical issue in unattended, tiny and battery equipped Wireless Sensor Networks (WSNs). Clustering the network is a promising approach for energy aware routing in WSN, as it has a hierarchical structure. The Connected Dominating Set (CDS) is an appropriate and prominent approach for cluster formation. This paper proposes an Energy-efficient Self-load Balanced Clustering algorithm (SLBC) for routing in WSN. SLBC has two phases: The first phase clusters the network by constructing greedy connected dominating set and the nodes are evenly distributed among them, using the defined parent fitness cost. The second phase performs data manipulations and new on-demand re-clustering. The efficiency of the proposed algorithm is analysed through simulation study. The obtained results show that SLBC outperforms than the recent algorithms like GSTEB and DGA-EBCDS in terms of network lifetime, CDS size, load dissemination, and efficient energy utilization of the network.

show abstract

Section: Related Workmentioning

confidence: 99%

Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks

Chinnasamy¹,

Alphonse²,

Janakiraman³

2017

IJISA

View full text Add to dashboard Cite

show abstract

“…Computing a minimum connected dominating set (MCDS) is an NP-Hard problem in general graphs [11] and in unitdisk graphs [11]. A PTAS for MCDS in unit-disk graphs has been found in [6].…”

Section: Dominating Set and Independent Setmentioning

confidence: 99%

Localized Flooding Backbone Construction for Location Privacy in Sensor Networks

Xiang

Cheng

Xing

et al. 2007

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Com

Self Cite

View full text Add to dashboard Cite

show abstract

“…MCDS has an O(log ∆) approximation ratio in regular graphs, where ∆ is the maximum number of neighbors of a node. Recently, Cheng et al [10] proposed a polynomial time approximation scheme (PTAS) for the minimum CDS in unit disk graphs. Given a network of size n and a small parameter s, Cheng et al designed a (1 + 1/s)-approximation with running time n O((s log s) 2 ) .…”

Section: Dominating Set and Its Extensionsmentioning

confidence: 99%

Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

Cardei

Dai

et al. 2006

IEEE Trans. Parallel Distrib. Syst.

100

View full text Add to dashboard Cite

We propose a notion of extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks whereby transmitting independent copies of a packet generates diversity and combats the effects of fading. We first show the NPcompleteness of the minimum extended dominating set problem. Then, several heuristic algorithms, global and local, for constructing a small extended dominating set are proposed. These are non-trivial extensions of the existing algorithms for the regular dominating set problem. The application of the extended dominating set in efficient broadcasting is also discussed. The performance analysis includes an analytical study in terms of approximation ratio and a simulation study of the average size of the extended dominating set derived from the proposed algorithms.

show abstract

A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks

Cited by 289 publications

References 15 publications

Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks

Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks

Localized Flooding Backbone Construction for Location Privacy in Sensor Networks

Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

Contact Info

Product

Resources

About