By Topic

Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless 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
$33 $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

5 Author(s)
Donghyun Kim ; University of Texas at Dallas, Richardson ; Yiwei Wu ; Yingshu Li ; Feng Zou
more authors

Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone incurs less maintenance overhead. Unfortunately, computing a minimum size CDS is NP-hard, and thus most researchers in this area concentrate on how to construct smaller CDSs. However, people neglected other important metrics of network, such as diameter and average hop distances between two communication parties. In this paper, we investigate the problem of constructing quality CDS in terms of size, diameter, and Average Backbone Path Length (ABPL). We present two centralized algorithms having constant performance ratios for its size and diameter of the constructed CDS. Especially, the size of CDS computed by the second algorithm is no more than 6.906 times of its optimal solution. Furthermore, we give its distributed version, which not only can be implemented in real situation easily but also considers energy to extend network lifetime. In our simulation, we show that in average the distributed algorithm not only generates a CDS with smaller diameter and ABPL than related work but also suppresses its size well. We also show that it is more energy efficient than others in prolonging network lifetime.

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:20 ,  Issue: 2 )