Trade-off scheme for fault tolerant connected dominating sets on size and diameter

Authors:
Ning Zhang;Incheol Shin;Feng Zou;Weili Wu;My Tra Thai
Affiliations:
University of Florida, Gainesville, FL, USA;University of Florida, Gainesville, FL, USA;University of Texas - Dallas, Richardson, TX, USA;University of Texas - Dallas, Richardson, TX, USA;University of Florida, Gainesville, FL, USA
Venue:
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Year:
2008

Citing 11
Cited 2

An optimal distributed depth-first-search algorithm

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Introduction to Algorithms

Introduction to Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Generating Quality Dominating Sets for Sensor Network

ICCIMA '05 Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison

IEEE Transactions on Parallel and Distributed Systems
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay

IEEE Transactions on Mobile Computing
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

IEEE Transactions on Mobile Computing
On approximation algorithms of k-connected m-dominating sets in disk graphs

Theoretical Computer Science
Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks

WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
On the construction of 2-connected virtual backbone in wireless networks

IEEE Transactions on Wireless Communications

A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
On construction of quality fault-tolerant virtual backbone in wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Current research has focused on minimizing the size and diameter or improving the fault tolerance of CDS. However, to our best knowledge, no existing research has considered these three important factors together in a single model. In this paper, we introduce the fault tolerant model studying a joint optimization problem in which the objective is to minimize the CDS size as well as the network latency. This model also addresses the tradeoffs between the objective functions. We next propose one approximation algorithm and two distributed algorithms with constant ratios for the model. Simulation results show that our algorithms can gain good tradeoffs between the three factors, which coincide with theoretical analysis. Moreover, our algorithms could obtain a better performance than previous work.