Paper Info
Title
Distributed virtual backbone construction in sensor networks with asymmetric links
Abstract
In this paper, we study the problem of distributed virtual backbone construction in sensor networks, where the coverage area of nodes are disks with different radii. This problem is modeled by the construction of a minimum connected dominating set (MCDS) in geometric k-disk graphs. We derive the size relationship of any maximal independent set (MIS) and MCDS in geometric k-disk graphs, and apply it to analyze the performances of two distributed connected dominating set (CDS) algorithms we propose in this paper. These algorithms have bounded performance ratio and low communication overhead. To the best of our knowledge, the results reported in this paper represent the state-of-the-art. Copyright © 2009 John Wiley & Sons, Ltd. (This paper study was based on work supported by the National Science Foundation, while the author was working at the Foundation.)
Year
DOI
Venue
2011
10.1002/wcm.810
Wireless Communications and Mobile Computing
Keywords
Field
DocType
sensor networks with asymmetric transmission links,connected dominating set,geometrick‐disk graphs,maximal independent set
Graph,Dominating set,Computer science,Performance ratio,Theoretical computer science,Connected dominating set,Wireless sensor network,Maximal independent set,Distributed computing,Bounded function
Journal
Volume
Issue
ISSN
11
8
1530-8669
Citations 
PageRank 
References 
5
0.44
10
Authors
5
Name
Order
Citations
PageRank
Yingchang Xiang161.84
Xing Kai244228.13
Wei Cheng3811106.56
E. K. Park450.44
Shmuel Rotenstreich5468.62