Sizes of minimum connected dominating sets of a class of wireless sensor networks
conference contribution
posted on 2024-07-11, 20:25 authored by Jianxin Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe ZukermanWe 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.
History
Available versions
PDF (Published version)Publisher DOI
ISBN
9781424420742Journal title
IEEE International Conference on Communications (ICC 2008), Beijing, China, 19-23 May 2008Conference name
IEEE International Conference on Communications ICC 2008, Beijing, China, 19-23 May 2008Pagination
4 ppPublisher
IEEECopyright statement
Copyright © 2008 IEEE. The published version is reproduced in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Language
engUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC