An Effective Distributed Approximation Algorithm for Constructing Minimum Connected Dominating Set in Wireless Ad Hoc Networks

Authors:
Bo Gao;Yuhang Yang;Huiye Ma
Affiliations:
Shanghai Jiao Tong University;Shanghai Jiao Tong University;Chinese University of Hong Kong
Venue:
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Year:
2004

Citing 0
Cited 3

Adjusted probabilistic route discovery in mobile ad hoc networks

Computers and Electrical Engineering
A Serial MIS Based CDS Constructing Algorithm for Wireless Networks

GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Towards optimal broadcast in wireless networks

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile 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.