Programming Models for Sensor Networks: A Survey

Ryo Sugihara and Rajesh Gupta
January 23, 2007

Sensor networks have been used in various types of applications and still have a huge potential. As an application logic becomes more complex, growing number of people realize that programming sensor networks is difficult. Part of the difficulty comes from their distributed nature, but the large fraction is from other harsh situations they face such as unreliable communication, faulty nodes, and extremely constrained resources. Researchers have proposed different programming models to alleviate the difficulty, sharing an ultimate goal of making programming easy while making full use of given resources. In this paper, we first explore the requirements for programming models for sensor networks. Then we present a taxonomy of the programming models, classified according to the level of abstractions they provide. We evaluate each work in terms of the requirements and discuss the strategies how the programming models strive to satisfy these requirements. Further, we discuss some possible future directions of research in this area.

How to view this document

The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego,

[ Search ]

This server operates at UCSD Computer Science and Engineering.
Send email to