A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks
Akshaye Dhawan,Michelle Tanco,Nicholas A. Scoville +2 more
- 01 Jan 2014
pp 181-187
TL;DR: This paper presents a distributed greedy algorithm for constructing a CDS that is up to 30% smaller in size than K2 that operates in two phases, first constructing a dominating set and then connecting the nodes in this set.
read more
Abstract: A Connected Dominating Set (CDS) of the graph representing a Wireless Sensor Network can be used as a virtual backbone for routing in the network. Since sensor nodes are constrained by limited on-board batteries, it is desirable to have a small CDS for the network. However, constructing a minimum size CDS has been shown to be a NP-hard problem. In this paper we present a distributed greedy algorithm for constructing a CDS that we call Greedy Connect. Our algorithm operates in two phases, first constructing a dominating set and then connecting the nodes in this set. We evaluate our algorithm using simulations and compare it to the two-hop K2 algorithm in the literature. Depending on the network topology, our algorithm generally constructs a CDS that is up to 30% smaller in size than K2.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Figure 3: Coloring after Phase 2. 
Figure 1: Example network (with sensing radius shown) and resulting graph. 
Figure 2: Coloring after two rounds of Phase 1. 
Table 1: Fields for a given sensor node v 
Table 2: Node color assignments for Phase 1. 
Figure 4: a. Average size of the CDS as the range is varied, b. Size of the CDS for different networks with range=15
Citations
A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
Stefan Funke,Alexander Kesselmann,Ulrich Meyer,Michael Segal +3 more
- 01 Jan 2005
TL;DR: This paper presents a very simple distributed algorithm for computing a small CDS, improving upon the previous best known approximation factor of 8 and implying improved approximation factors for many existing algorithm.
159
On Relay Selection Approaches in Bluetooth Mesh Networks
Emil A. J. Hansen,Martin Hedegaard Nielsen,Daniel E. Serup,Robin Jess Williams,Tatiana Kozlova Madsen,Rasmus Abildgren +5 more
- 01 Nov 2018
TL;DR: To improve packet delivery ratio, this work considers three different relay selection mechanisms and develops their extensions that are capable to operate in a distributed fashion and is evaluated via extensive simulations.
25
A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks
Ozkan Arapoglu,Orhan Dagdeviren +1 more
TL;DR: This paper proposes a fault-tolerant distributed algorithm for a minimal capacitated CDS (CapCDS) construction in WSNs, and is believed to be the first distributed self-stabilizing CapCDS algorithm.
9
Randomized algorithms for approximating a Connected Dominating Set in Wireless Sensor Networks
Akshaye Dhawan,Michelle Tanco,Aaron Yeiser +2 more
- 01 Dec 2015
TL;DR: Three randomized algorithms for constructing a minimal CDS are presented that are generally equivalent in size to those constructed by K2 while being asymptotically better in time and message complexity.
Decentralized Provisioning Algorithm For BLE Mesh Network
Maxym Zhuravinskyi,Denys Maletskyi,Igor Kravets,Oleg Kapshii,O. Ya. Farenyuk +4 more
- 19 Oct 2023
TL;DR: This study proposes a decentralized provisioning algorithm for BLE mesh networks using Multi-Agent Reinforcement Learning, outperforming traditional centralized methods by up to 10.5% in Packet Delivery Ratio for large networks with moderate packet generation rates.
1
References
A survey on sensor networks
TL;DR: The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections.
Sensor networks: evolution, opportunities, and challenges
Chee-Yee Chong,Sanjeev Kumar +1 more
- 11 Aug 2003
TL;DR: The history of research in sensor networks over the past three decades is traced, including two important programs of the Defense Advanced Research Projects Agency (DARPA) spanning this period: the Distributed Sensor Networks (DSN) and the Sensor Information Technology (SensIT) programs.
Investigating the energy consumption of a wireless network interface in an ad hoc networking environment
Laura Marie Feeney,Martin Nilsson +1 more
- 22 Apr 2001
TL;DR: A series of experiments are described which obtained detailed measurements of the energy consumption of an IEEE 802.11 wireless network interface operating in an ad hoc networking environment, and some implications for protocol design and evaluation in ad hoc networks are discussed.
•Journal Article
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks.
Honghai Zhang,Jennifer C. Hou +1 more
TL;DR: A decentralized density control algorithm, Optimal Geographical Density Control (OGDC), is devised for density control in large scale sensor networks and can maintain coverage as well as connectivity, regardless of the relationship between the radio range and the sensing range.
Unit disk graphs
Brent N. Clark,Brent N. Clark,Charles J. Colbourn,Charles J. Colbourn,David S. Johnson,David S. Johnson +5 more
TL;DR: It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs.
1.6K