DMCA
Maximizing the Functional Lifetime of Sensor Networks (2005)
Cached
Download Links
- [black.csl.uiuc.edu]
- [decision.csl.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM Syposium on Information Processing in Sensor Networks (IPSN |
| Citations: | 50 - 0 self |
BibTeX
@INPROCEEDINGS{Giridhar05maximizingthe,
author = {Arvind Giridhar},
title = {Maximizing the Functional Lifetime of Sensor Networks},
booktitle = {In ACM Syposium on Information Processing in Sensor Networks (IPSN},
year = {2005},
pages = {5--12}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract — The functional lifetime of a sensor network is defined as the maximum number of times a certain data collection function or task can be carried out without any node running out of energy. The specific task considered in this paper is that of communicating a specified quantity of information from each sensor to a collector node. The problem of finding the communication scheme which maximizes functional lifetime can be formulated as a linear program, under “fluid-like ” assumptions on information bits. This paper focuses on analytically solving the linear program for some simple regular network topologies. The two topologies considered are a regular linear array, and a regular two-dimensional network. In the linear case, an upper bound on functional lifetime is derived, as a function of the initial energies and quantities of data held by the sensors. Under some assumptions on the relative amounts of the energies and data, this upper bound is shown to be achievable, and the exact form of the optimal communication strategy is derived. For the regular planar network, upper and lower bounds on functional lifetime, differing only by a constant factor, are obtained. Finally, it is shown that the simple collection scheme of transmitting only to nearest neighbors, yields a nearly optimal lifetime in a scaling sense. I.
Keyphrases
functional lifetime sensor network linear program upper bound fluid-like assumption regular two-dimensional network communication scheme relative amount constant factor specific task maximum number information bit collector node optimal communication strategy regular linear array exact form scaling sense certain data collection function simple regular network topology initial energy simple collection scheme regular planar network linear case specified quantity optimal lifetime
