Published May 30, 2008
| Published
Book Section - Chapter
Open
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.
Additional Information
© 2008 IEEE. This work was supported by the Australian Research Council (ARC). The authors thank Iradj Oveysi for useful feedback and Taka Sakurai for discussions about algorithms for numerical inversion of Laplace transform.Attached Files
Published - Li2008p84122008_Ieee_International_Conference_On_Communications_Proceedings_Vols_1-13.pdf
Files
Li2008p84122008_Ieee_International_Conference_On_Communications_Proceedings_Vols_1-13.pdf
Files
(157.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:7252a64611aa6b0efc7e355a82e3772e
|
157.9 kB | Preview Download |
Additional details
- Eprint ID
- 18949
- Resolver ID
- CaltechAUTHORS:20100708-105104076
- Australian Research Council (ARC)
- Created
-
2010-07-08Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Series Name
- IEEE International Conference on Communications