Distributed virtual backbone construction in sensor networks with asymmetric links

Authors:
Yingchang Xiang;Kai Xing;Wei Cheng;E. K. Park;Shmuel Rotenstreich
Affiliations:
Department of Basic Courses, Rizhao Polytechnic, Rizhao, Shangdong 276826, China;Department of Computer Science, The George Washington University, Washington, DC 20052, U.S.A.;Department of Computer Science, The George Washington University, Washington, DC 20052, U.S.A.;Computer Science & Electrical Engineering, University of Missouri at Kansas City, Kansas City, MO 64110, U.S.A.;Department of Computer Science, The George Washington University, Washington, DC 20052, U.S.A.
Venue:
Wireless Communications & Mobile Computing
Year:
2011

Citing 0
Cited 2

A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications
Efficient self-organized backbone formation in mobile ad hoc networks (MANETs)

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

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.)