A maximal independent set based giant component formation in random unit-disk graphs

Authors:
Pengfei Hu;Kai Xing;Liusheng Huang;Yang Wang;Dapeng Wang;Pei Li
Affiliations:
School of Computer Science and Technology, Univ. of Sci. and Tech. of China, Anhui, China and Suzhou Institute for Advanced Study, Univ. of Sci. and Tech. of China, Jiangsu, China;School of Computer Science and Technology, Univ. of Sci. and Tech. of China, Anhui, China and Suzhou Institute for Advanced Study, Univ. of Sci. and Tech. of China, Jiangsu, China;School of Computer Science and Technology, Univ. of Sci. and Tech. of China, Anhui, China and Suzhou Institute for Advanced Study, Univ. of Sci. and Tech. of China, Jiangsu, China;School of Computer Science and Technology, Univ. of Sci. and Tech. of China, Anhui, China and Suzhou Institute for Advanced Study, Univ. of Sci. and Tech. of China, Jiangsu, China;Alcatel-Lucent Shanghai Bell, Shanghai, China;College of Information Systems and Management, National Univ. of Defense Tech., Changsha, Hunan, China
Venue:
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Year:
2011

Citing 16
Cited 0

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
Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results

Proceedings of the 2001 ACM symposium on Applied computing
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
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
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
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles

Wireless Communications & Mobile Computing - Special Issue on 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
Energy-Efficient Area Monitoring for Sensor Networks

Computer
Interference-aware, fully-distributed virtual backbone construction and its application in multi-hop wireless networks

IEEE Transactions on Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a maximal independent set (MIS) based giant component formation strategy in random unit-disk graph. This research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with identical radii. The evaluation results show that the MIS-based giant component has the ability to connect most nodes in the MIS and serve as a backbone in the network. Besides, our algorithm is localized and may play an important rule in efficiently constructing a virtual backbone for ad hoc and sensor networks.