Sizes of minimum connected dominating sets of a class of wireless sensor networks

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

6 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages332-336
Publication statusPublished - 2008
Externally publishedYes

Publication series

Name
ISSN (Print)0536-1486

Conference

TitleIEEE International Conference on Communications, ICC 2008
PlaceChina
CityBeijing
Period19 - 23 May 2008

Abstract

We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowing other nodes to remain in sleep mode in order to conserve energy. We derive the expected value and the distribution of N for single dimensional dense networks. ©2008 IEEE.

Citation Format(s)

Sizes of minimum connected dominating sets of a class of wireless sensor networks. / Li, Ji; Foh, Chuan Heng; Andrew, Lachlan L. H. et al.
IEEE International Conference on Communications. 2008. p. 332-336 4533105.

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review