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

64 Citations (Scopus)

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 publicationProceedings - IEEE Military Communications Conference MILCOM
DOIs
StatePublished - 2007
EventMilitary Communications Conference, MILCOM 2007 - Orlando, FL, United States
Duration: Oct 29 2007Oct 31 2007

Other

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

Fingerprint

Wireless sensor networks
Digital differential analyzers
Approximation algorithms
Heuristic algorithms
Fault tolerance
Parallel algorithms

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • 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 Proceedings - IEEE Military Communications Conference MILCOM [4454774] https://doi.org/10.1109/MILCOM.2007.4454774

Constructing k-connected M-dominating sets in wireless sensor networks. / Wu, Yiwei; Wang, Feng; Thai, My T.; Li, Yingshu.

Proceedings - IEEE Military Communications Conference MILCOM. 2007. 4454774.

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

Wu, Y, Wang, F, Thai, MT & Li, Y 2007, Constructing k-connected M-dominating sets in wireless sensor networks. in Proceedings - IEEE Military Communications Conference MILCOM., 4454774, Military Communications Conference, MILCOM 2007, Orlando, FL, United States, 10/29/07. https://doi.org/10.1109/MILCOM.2007.4454774
Wu Y, Wang F, Thai MT, Li Y. Constructing k-connected M-dominating sets in wireless sensor networks. In Proceedings - IEEE Military Communications Conference MILCOM. 2007. 4454774 https://doi.org/10.1109/MILCOM.2007.4454774
Wu, Yiwei ; Wang, Feng ; Thai, My T. ; Li, Yingshu. / Constructing k-connected M-dominating sets in wireless sensor networks. Proceedings - IEEE Military Communications Conference MILCOM. 2007.
@inproceedings{3eb12fb439634bf686656db5c5b74bff,
title = "Constructing k-connected M-dominating sets in wireless sensor networks",
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.",
author = "Yiwei Wu and Feng Wang and Thai, {My T.} and Yingshu Li",
year = "2007",
doi = "10.1109/MILCOM.2007.4454774",
language = "English (US)",
isbn = "1424415136",
booktitle = "Proceedings - IEEE Military Communications Conference MILCOM",

}

TY - GEN

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

AU - Wu, Yiwei

AU - Wang, Feng

AU - Thai, My T.

AU - Li, Yingshu

PY - 2007

Y1 - 2007

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

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

UR - http://www.scopus.com/inward/record.url?scp=47949083311&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47949083311&partnerID=8YFLogxK

U2 - 10.1109/MILCOM.2007.4454774

DO - 10.1109/MILCOM.2007.4454774

M3 - Conference contribution

AN - SCOPUS:47949083311

SN - 1424415136

SN - 9781424415137

BT - Proceedings - IEEE Military Communications Conference MILCOM

ER -