A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

Authors:
Bo Gao;Huiye Ma;Yuhang Yang
Affiliations:
Dept. of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China;Dept. of Computer Science and Engineering, Chinese University of Hong Kong;Dept. of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 3
Cited 0

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new distributed approximation algorithm that constructs a minimum connected dominating set (MCDS) for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm each node only requires the knowledge of its one-hop neighbors and there is only one shortest path connecting two dominators that are at most three hops away. Compared with other MCDS approximation algorithms, our algorithm shows better efficiency and performance than them.