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

Ji Li; Chuan Heng Foh; Lachlan L.H. Andrew; Moshe Zukerman

doi:10.1109/ICC.2008.69

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

Ji Li^*
, Chuan Heng Foh
, Lachlan L.H. Andrew
, Moshe Zukerman

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

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.

Original language	English
Title of host publication	ICC 2008 - IEEE International Conference on Communications, Proceedings
Pages	332-336
Number of pages	5
DOIs	https://doi.org/10.1109/ICC.2008.69
State	Published - 2008
Externally published	Yes
Event	IEEE International Conference on Communications, ICC 2008 - Beijing, China Duration: 19 May 2008 → 23 May 2008

Publication series

Name	IEEE International Conference on Communications
ISSN (Print)	0536-1486

Conference

Conference	IEEE International Conference on Communications, ICC 2008
Country/Territory	China
City	Beijing
Period	19/05/08 → 23/05/08

Access to Document

10.1109/ICC.2008.69

Cite this

@inproceedings{c44da5d943d64b4d936e428fa553417a,

title = "Sizes of minimum connected dominating sets of a class of wireless sensor networks",

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.",

author = "Ji Li and Foh, \{Chuan Heng\} and Andrew, \{Lachlan L.H.\} and Moshe Zukerman",

year = "2008",

doi = "10.1109/ICC.2008.69",

language = "英语",

isbn = "9781424420742",

series = "IEEE International Conference on Communications",

pages = "332--336",

booktitle = "ICC 2008 - IEEE International Conference on Communications, Proceedings",

note = "IEEE International Conference on Communications, ICC 2008 ; Conference date: 19-05-2008 Through 23-05-2008",

}

Li, J, Foh, CH, Andrew, LLH & Zukerman, M 2008, Sizes of minimum connected dominating sets of a class of wireless sensor networks. in ICC 2008 - IEEE International Conference on Communications, Proceedings., 4533105, IEEE International Conference on Communications, pp. 332-336, IEEE International Conference on Communications, ICC 2008, Beijing, China, 19/05/08. https://doi.org/10.1109/ICC.2008.69

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Li, Ji

AU - Foh, Chuan Heng

AU - Andrew, Lachlan L.H.

AU - Zukerman, Moshe

PY - 2008

Y1 - 2008

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

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

UR - https://www.scopus.com/pages/publications/51249094911

U2 - 10.1109/ICC.2008.69

DO - 10.1109/ICC.2008.69

M3 - 会议稿件

AN - SCOPUS:51249094911

SN - 9781424420742

T3 - IEEE International Conference on Communications

SP - 332

EP - 336

BT - ICC 2008 - IEEE International Conference on Communications, Proceedings

T2 - IEEE International Conference on Communications, ICC 2008

Y2 - 19 May 2008 through 23 May 2008

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this