Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Wei Wang ; Dept. of Math., Xi'an Jiaotong Univ., Xi'an, China ; Donghyun Kim ; Min Kyung An ; Wei Gao
more authors

In this paper, we study the problem of computing quality fault-tolerant virtual backbone in homogeneous wireless network, which is defined as the k-connected m-dominating set problem in a unit disk graph. This problem is NP-hard, and thus many efforts have been made to find a constant factor approximation algorithm for it, but never succeeded so far with arbitrary k ≥ 3 and m ≥ 1 pair. We propose a new strategy for computing a smaller-size 3-connected m-dominating set in a unit disk graph with any m ≥ 1. We show the approximation ratio of our algorithm is constant and its running time is polynomial. We also conduct a simulation to examine the average performance of our algorithm. Our result implies that while there exists a constant factor approximation algorithm for the k-connected m-dominating set problem with arbitrary k ≤ 3 and m ≥ 1 pair, the k-connected m-dominating set problem is still open with k > 3.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:21 ,  Issue: 5 )