Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks

Authors:
Alireza Vahdatpour;Foad Dabiri;Maryam Moazeni;Majid Sarrafzadeh
Affiliations:
Computer Science Department, University of California Los Angeles,;Computer Science Department, University of California Los Angeles,;Computer Science Department, University of California Los Angeles,;Computer Science Department, University of California Los Angeles,
Venue:
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Year:
2008

Citing 14
Cited 2

Unit disk graphs

Discrete Mathematics - Topics on domination
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Routing in Ad Hoc Networks Using a Spine

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks

LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
On the node-scheduling approach to topology control in ad hoc networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Virtual backbone based on MCDS for topology control in wireless ad hoc networks

PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
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)
Minimizing broadcast latency in ad hoc wireless networks

ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Approximation Algorithms for Connected Dominating Sets

Algorithmica

Heuristic algorithms for constructing connected dominating sets with minimum size and bounded diameter in wireless networks

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Connected dominating setis widely used in wireless ad-hoc and sensor networks as a routing and topology control backbone to improve the performance and increase the lifetime of the network. Most of the distributed algorithms for approximating connected dominating set are based on constructing maximal independent set. The performance of such algorithms highly depends on the relation between the size of the maximum independent set (mis(G)) and the size of the minimum connected dominating set (cds(G)) in the graph G. In this paper, after observing the properties of such subgraphs, we decrease the previous ratio of 3.453 to 3.0 by showing that mis(G) ≤ 3·mcds(G) + 3. Additionally, we prove that this bound is tight and cannot be improved. Finally, we present practical analysis of constructing connected dominating set based on maximal independent set in wireless networks. It is shown that the theoretical bound for unit disk graphis still practically applicable for general wireless networks.