A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs

Authors:
Dechang Chen;Xilong Mao;Xia Fei;Kai Xing;Fang Liu;Min Song
Affiliations:
Uniformed Services University of the Health Sciences, Bethesda, MD;School of Computer, National University of Defense Technology, Changsha, Hunan, P.R. China;Rizhao Geotechical Investigation and Surveying, Institute of Urban and Rural Construction, Rizhao, Shandong, P.R. China;Department of Computer Science, The George Washington University, Washington, DC;Department of Computer Science, The George Washington University, Washington, DC;Department of Electrical and Computer Engineering, Old Dominion University, Norfolk, VA
Venue:
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Year:
2006

Citing 10
Cited 2

Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms

Introduction to Algorithms
Propagation and Leader Election in a Multihop Broadcast Environment

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Issues in ad hoc wireless networks

Issues in ad hoc wireless networks
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

Journal of Global Optimization
Approximation Algorithms for Connected Dominating Sets

Algorithmica
CEDAR: a core-extraction distributed ad hoc routing algorithm

IEEE Journal on Selected Areas in Communications

Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks

DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Connected dominating set algorithms for wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose and analyze a localized convex-hull based algorithm to connect a maximal independent set. The cardinality of the resultant connected dominating set is at most 76 · opt +19, where opt is the size of a minimum connected dominating set. To our knowledge, this is a dramatic improvement compared to the best published results in the same context [1,6] . Our algorithm plays an important rule in efficiently constructing a virtual backbone for ad hoc and sensor networks.