Constructing k-connected M-dominating sets in wireless sensor networks

Yiwei Wu, Feng Wang, My T. Thai, Yingshu Li

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

65 Scopus citations

Abstract

A k-Connected m-Dominating Set (kmCDS) working as a virtual backbone in a wireless sensor network is necessary for fault tolerance and routing flexibility. In order to construct a kmCDS with the minimum size, some approximation algorithms have been proposed in the literature. However, all of those algorithms only consider some special cases where k = 1.2 or k = m. In this paper, we propose one centralized heuristic algorithm CGA and one distributed algorithms, DDA which is deterministic, to construct a kmCDS for general k and TO. Simulation results are also presented to evaluate our algorithms and the results show that our algorithms have better performances than the exiting other algorithms.

Original languageEnglish (US)
Title of host publicationMilitary Communications Conference, MILCOM 2007
DOIs
StatePublished - Dec 1 2007
EventMilitary Communications Conference, MILCOM 2007 - Orlando, FL, United States
Duration: Oct 29 2007Oct 31 2007

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM

Other

OtherMilitary Communications Conference, MILCOM 2007
CountryUnited States
CityOrlando, FL
Period10/29/0710/31/07

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Wu, Y., Wang, F., Thai, M. T., & Li, Y. (2007). Constructing k-connected M-dominating sets in wireless sensor networks. In Military Communications Conference, MILCOM 2007 [4454774] (Proceedings - IEEE Military Communications Conference MILCOM). https://doi.org/10.1109/MILCOM.2007.4454774