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

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS...

Full description

Saved in:
Bibliographic Details
Published in:International journal of communication systems Vol. 18; no. 8; pp. 743 - 762
Main Authors: Gao, Bo, Yang, Yuhang, Ma, Huiye
Format: Journal Article
Language:English
Published: Chichester, UK John Wiley & Sons, Ltd 01.10.2005
Subjects:
ad hoc networks
Algorithms
Approximation
Complexity
Computer simulation
connected dominating set
Construction
distributed approximation algorithm
Mathematical analysis
maximal independent set
Messages
Networks
ISSN:1074-5351, 1099-1131
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a 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 neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.
Bibliography:istex:A8D49DAE6ED80513DD8C2A2920C3BFBDC28A28EE
ark:/67375/WNG-5M1L4450-1
ArticleID:DAC726
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.726