Next century challenges: Scalable coordination in sensor networks (1999)
Cached
Download Links
- [www.cs.jhu.edu]
- [www.cs.colorado.edu]
- [www.cs.colorado.edu]
- [www.isi.edu]
- [www.isi.edu]
- [www.isi.edu]
- [research.cens.ucla.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 742 - 42 self |
BibTeX
@INPROCEEDINGS{Estrin99nextcentury,
author = {Deborah Estrin and Ramesh Govindan and John Heidemann},
title = {Next century challenges: Scalable coordination in sensor networks},
booktitle = {},
year = {1999},
pages = {263--270}
}
Years of Citing Articles
OpenURL
Abstract
Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban envi-ronments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environ-ments present unique challenges in the design of unattended autonomous sensor networks. These challenges lead us to hypothesize that sensor network coordination applications may need to be structured differently from traditional net-work applications. In particular, we believe that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor net-work coordination. In this paper, we describe localized al-gorithms, and then discuss directed diffusion, a simple com-munication model for describing localized algorithms. 1







