By Topic

CDS-HG: A New Distributed MCDS Approximation Algorithm for Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rong Xie ; Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou ; Deyu Qi ; Yongjun Li ; Wang, J.Z.

The connected dominating set (CDS) has been widely used for efficient routing in wireless sensor networks. Although finding the minimum connected dominating set (MCDS) in an arbitrary graph is a NP-hard problem, many algorithms have been proposed to construct an approximation of the MCDS for efficient routing in wireless sensor networks. To address the weaknesses of these existing algorithms, we propose a new distributed MCDS approximation algorithm, CDS-HG, to construct the CDS for wireless sensor networks. This algorithm models a wireless sensor network as a hierarchical graph and uses a competition-based strategy to select nodes at a certain hierarchical level to route messages for nodes in the next level of the hierarchical graph. Formal analysis and simulation studies show that our CDS-HG algorithm generates smaller CDS sizes while requiring less communication overhead compared with the existing distributed MCDS approximation algorithms.

Published in:

Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Date of Conference:

21-25 Sept. 2007