Proceedings ArticleDOI
Distributed Algorithm for Connected Dominating Set Construction in Sensor Networks
Najla Al-Nabhan,Mznah Al-Rodhaan,Abdullah Al-Dhelaan,Xiuzhen Cheng +3 more
- pp 4450-4455
Reads0
Chats0
TLDR
This paper proposes a new distributed algorithm for CDS construction in WSNs that represents an extension for the previously proposed centralized algorithm and is intended to construct a CDS with the smallest ratio when compared to its centralized version.Abstract:
Future Wireless Sensor Networks (WSNs) will be composed of a large number of densely deployed sensors. A key feature of such networks is that their nodes are untethered and unattended. Distributed techniques are expected in WSNs. Connected Dominating Sets (CDSs) have been widely used for virtual backbone construction in WSNs to control topology, facilitate routing, and extend network lifetime. This paper proposes a new distributed algorithm for CDS construction in WSNs. The algorithm represents an extension for our previously proposed centralized algorithm. The algorithm is intended to construct a CDS with the smallest ratio when compared to its centralized version. Simulation shows that our distributed approach has a maximum ratio of 1.53 to the centralized approach in term of CDS size, and it satisfies all of the geometrical properties of its canalized version. Based on this ratio, this distributed algorithm has an approximation factor of 7.65 to the optimal CDS. This approximation outperforms the existing distributed CDS construction algorithms.read more
Citations
More filters
Journal ArticleDOI
Cooperative Approaches to Construction and Maintenance of Networks’ Virtual Backbones for Extreme Wireless Sensor Applications
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.
Proceedings ArticleDOI
An energy balanced topology construction protocol for Wireless Sensor Networks
Soumya Saha,Lifford McLauchlan +1 more
TL;DR: A novel load balanced TC protocol for connectivity - EAST (Energy Aware Spanning Tree), which aims to place as many nodes into sleep mode while maintaining the communication backbone of active nodes as determined based on an energy metric.
Proceedings ArticleDOI
Distributed Construction of D-Hop Connected Dominating Sets for Wireless Sensor Networks
Konstantinos Skiadopoulos,Konstantinos Giannakis,Konstantinos Oikonomou,Ioannis Stavrakakis,Sonia Aissa +4 more
TL;DR: A distributed algorithm that relies on local information to construct an approximation of the Minimum d-CDS, which is shown to be close and sometimes smaller than that under the recently proposed distributed one, and close to the centralized one.
Proceedings ArticleDOI
A Highly Efficient Distributed Algorithm for Constructing CDS with Opportunistic Announcement in Wireless Sensor Networks
Shuangmao Yang,Wei Tang +1 more
TL;DR: It is shown that, to construct a CDS, a portion of nodes in the network don't have to generate announcement messages, and an opportunistic announcement scheme is presented to determine such nodes.
Journal ArticleDOI
Partly Centralized Partly Distributed Energy Efficient Sleep/Wake Scheduling in Wireless Sensor Networks for Applications Requiring Continuous Sensing
TL;DR: A wireless sensor network requires judicious utilization of its limited energy resources and the energy efficient algorithms have become a pre-requisite for healthy and prolonged function.
References
More filters
Journal ArticleDOI
Design of a distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks
Li Qing,Qingxin Zhu,Mingwen Wang +2 more
TL;DR: A new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC, is proposed and evaluated, which achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.
Proceedings ArticleDOI
Distributed construction of connected dominating set in wireless ad hoc networks
TL;DR: This work presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, which is thus message-optimal.
Proceedings ArticleDOI
Message-optimal connected dominating sets in mobile ad hoc networks
TL;DR: This paper proposes the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a emph constant approximation ratio, and emph linear time and emphlinear message complexity.
Proceedings ArticleDOI
New distributed algorithm for connected dominating set in wireless ad hoc networks
TL;DR: This work presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDs, which is thus message-optimal.
Book ChapterDOI
Connected Dominating Set in Sensor Networks and MANETs
TL;DR: This paper presents a meta-analysed version of the Butenko’s Algorithm, a version of which was previously described in detail in [Bouchut-Boyaval, M3AS (23) 2013].