A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph

Authors:
Xianyue Li;Xiaofeng Gao;Weili Wu
Affiliations:
School of Mathematics and Statistics, Lanzhou University, China;Department of Computer Science, University of Texas at Dallas, USA;Department of Computer Science, University of Texas at Dallas, USA
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 8
Cited 4

Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Middleware: Middleware Challenges and Approaches for Wireless Sensor Networks

IEEE Distributed Systems Online
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

Journal of Global Optimization
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
A simple improved distributed algorithm for minimum CDS in unit disk graphs

ACM Transactions on Sensor Networks (TOSN)

Constructing minimum interference connected dominating set for multi-channel multi-radio multi-hop wireless network

International Journal of Sensor Networks
Load-balanced CDS construction in wireless sensor networks via genetic algorithm

International Journal of Sensor Networks
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks

Theoretical Computer Science
On construction of quality fault-tolerant virtual backbone in wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Connected Dominating Set is widely used as virtual backbone in wireless Ad-hoc and sensor networks to improve the performance of transmission and routing protocols. Based on special characteristics of Ad-hoc and sensor networks, we usually use unit disk graphto represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are said to be adjacent if the distance between them is less than 1. Since every Maximal Independent Set (MIS) is a dominating set and it is easy to construct, we can firstly find a MIS and then connect it into a Connected Dominating Set (CDS). Therefore, the ratio to compare the size of a MIS with a minimum CDS becomes a theoretical upper bound for approximation algorithms to compute CDS. In our paper, with the help of Voronoi diagram and Euler's formula, we improved this upper bound, so that improved the approximations based on this relation.