Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network

Authors:
Feng Zou;Xianyue Li;Donghyun Kim;Weili Wu
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson 75080;School of Mathematics and Statistics, Lanzhou University, Lanzhou, P.R. China 730000;Department of Computer Science, University of Texas at Dallas, Richardson 75080;Department of Computer Science, University of Texas at Dallas, Richardson 75080
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 6
Cited 4

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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A greedy approximation for minimum connected dominating sets

Theoretical Computer Science
Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks

WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
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
Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

Computer Communications
Connected dominating set algorithms for wireless sensor networks

International Journal of Sensor Networks
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 (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Previous literature modeled the wireless network in a 2-dimensional plane and looked for the approximated Minimum CDS (MCDS) distributed or centralized to construct the virtual backbone of the wireless network. However, in some real situations, the wireless network should be modeled as a 3-dimensional space instead of 2-dimensional plane. We propose our approximation algorithm for MCDS construction in 3-dimensional wireless network in this paper. It achieves better upper bound (13 + ln 10)opt+ 1 than the only known result 22opt. This algorithm helps bringing the research for MCDS construction in 3-dimensional wireless network to a new stage.