Next Century Challenges: Scalable Coordination in Sensor Networks

Deborah Estrin, Ramesh Govindan, John Heidemann, and Satish Kumar
USC/Information Sciences Institute

Abstract

Network sensors--those that coordinate amongst themselves to achieve a larger sensing task--will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments 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 network applications. In particular, we believe that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor network coordination. In this paper, we describe localized algorithms, and then discuss directed diffusion, a simple communication model for describing localized algorithms.

Availability

This paper is available in several formats: abstract web page with pointers and cites, gzip'ed postscript, PDF, paper copies can be obtained by mail to the authors. Copyright terms for this paper appear below.

Reference

Estrin99e

Deborah Estrin, Ramesh Govindan, John Heidemann, and Satish Kumar. Next Century Challenges: Scalable Coordination in Sensor Networks. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, pp. 263-270. Seattle, Washington, USA, ACM. August, 1999. <http://www.isi.edu/~johnh/PAPERS/Estrin99e.html>.

@inproceedings{Estrin99e,
	author = "Deborah Estrin and Ramesh Govindan and John Heidemann and Satish Kumar",
	title = "Next Century Challenges: Scalable Coordination in Sensor Networks",
	booktitle = "Proceedings of the {ACM/IEEE} International Conference on Mobile Computing and Networking",
	year = "1999",
	publisher = "{ACM}",
	address = "Seattle, Washington, USA",
	month = "August",
	pages = "263--270",
	keywords = "xxx",
	copyrightholder = "
	Permission to make digital or
	hard copies of part or all of this work for personal or
	classroom use is granted without fee provided that copies
	are not made or distributed for profit or commercial
	advantage and that new copies bear this notice and the full
	citation on the first page. Copyrights for components of this
	work owned by others than ACM must be honored. Abstracting with
	credit  is permitted.
 
	To copy otherwise, to republish, to post on servers or to
	redistribute to lists, requires prior specific permission
	and/or a fee. Request Permissions from
	Publications Dept, ACM Inc.,
	Fax +1 (212) 869--0481, or
	permissions@acm.org.
",
	url = "http://www.isi.edu/~johnh/PAPERS/Estrin99e.html",
	psurl = "http://www.isi.edu/~johnh/PAPERS/Estrin99e.ps.gz",
	pdfurl = "http://www.isi.edu/~johnh/PAPERS/Estrin99e.pdf",
	xorganization = "USC/Information Sciences Institute",
}

Copyright

This paper is copyright © 1999 by Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted.

To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request Permissions from Publications Dept, ACM Inc., Fax +1 (212) 869-0481, or permissions@acm.org. . Permission to make digital or hard copies of part or all of this work for personal use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Abstracting with credit is permitted.

To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission of the authors.