IEEE Xplore - A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball

来源:百度文库 编辑:神马文学网 时间:2024/04/26 12:00:58

A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs

    5438999 abstract


Kim, Donghyun;  Zhang, Zhao;  Li, Xianyue;  Wang, Wei;  Wu, Weili;  Du, Ding-Zhu;  
University of Texas at Dallas, Richardson 

This paper appears in: Mobile Computing, IEEE Transactions on
Issue Date: Aug. 2010
Volume: 9 Issue:8
On page(s): 1108 - 1118
ISSN: 1536-1233
Digital Object Identifier: 10.1109/TMC.2010.55 
Date of Publication: 25 ä¸?æ?? 2010
Date of Current Version: 17 å?­æ?? 2010
Sponsored by: IEEE Computer Society 

Abstract

A Virtual Backbone (VB) of a wireless network is a subset of nodes such that only VB nodes are responsible for routing-related tasks. Since a smaller VB causes less overhead, size is the primary quality factor of VB. Frequently, Unit Disk Graphs (UDGs) are used to model 2D homogeneous wireless networks, and the problem of finding minimum VBs in the networks is abstracted as Minimum Connected Dominating Set (MCDS) problem in UDGs. In some applications, the altitude of nodes can be hugely different and UDG cannot abstract the networks accurately. Then, Unit Ball Graph (UBG) can replace UDG. In this paper, we study how to construct quality CDSs in UBGs in distributed environments. We first give an improved upper bound of the number of independent nodes in a UBG, and use this result to analyze the Performance Ratio (PR) of our new centralized algorithm C-CDS-UBG, which computes CDSs in UBGs. Next, we propose a distributed algorithm D-CDS-UBG originated from C-CDS-UBG and analyze its message and time complexities. Our theoretical analysis shows that the PR of D-CDS-UBG is 14.937, which is better than current best, 22. Our simulations also show that D-CDS-UBG outperforms the competitor, on average.