Li, Ji and Foh, Chuan Heng and Andrew, Lachlan L. H. and Zukerman, Moshe (2008) Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks. In: 2008 IEEE International Conference on Communications. IEEE International Conference on Communications . IEEE , pp. 332-336. ISBN 978-1-4244-2074-2 http://resolver.caltech.edu/CaltechAUTHORS:20100708-105104076
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
- Published Version
See Usage Policy. 154Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20100708-105104076
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.
| Item Type: | Book Section | ||||
|---|---|---|---|---|---|
| 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. | ||||
| Funders: |
| ||||
| Record Number: | CaltechAUTHORS:20100708-105104076 | ||||
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:20100708-105104076 | ||||
| Related URLs: | |||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||
| ID Code: | 18949 | ||||
| Collection: | CaltechAUTHORS | ||||
| Deposited By: | Tony Diaz | ||||
| Deposited On: | 08 Jul 2010 21:01 | ||||
| Last Modified: | 26 Dec 2012 12:12 |
Repository Staff Only: item control page
