Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks

Hongwei Du, Qiang Ye, Weili Wu, Wonjun Lee, Deying Li, Dingzhu Du, Stephen Howard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

42 Citations (Scopus)

Abstract

In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size D is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.

Original languageEnglish
Title of host publication2011 Proceedings IEEE INFOCOM
Pages1737-1744
Number of pages8
DOIs
Publication statusPublished - 2011
EventIEEE INFOCOM 2011 - Shanghai, China
Duration: 2011 Apr 102011 Apr 15

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2011
CountryChina
CityShanghai
Period11/4/1011/4/15

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks'. Together they form a unique fingerprint.

Cite this