On greedy construction of connected dominating sets in wireless networks: Research Articles

  • Authors:

  • Yingshu Li;My T. Thai;Feng Wang;Chih-Wei Yi;Peng-Jun Wan;Ding-Zhu Du

  • Affiliations:

  • Department of Computer Science, Georgia State University, 34 Peachtree Street, Suite 1413, Atlanta, GA 30303, U.S.A.;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, U.S.A.;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, U.S.A.;Department of Computer and Information Science, National Chiao-Tung University, Hsin-Chu, Taiwan;Department of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, U.S.A.;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, U.S.A.

  • Venue:
  • Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In this paper, we propose a new greedy algorithm, called S-MIS, with the help of Steiner tree that can construct a CDS within a factor of 4.8 + ln5 from the optimal solution. We also introduce the distributed version of this algorithm. We prove that the proposed algorithm is better than the current best performance ratio which is 6.8. A simulation is conducted to compare S-MIS with its variation which is rS-MIS. The simulation shows that the sizes of the CDSs generated by S-MIS and rS-MIS are almost the same. Copyright © 2005 John Wiley & Sons, Ltd.