ACM Home Page
Please provide us with feedback. Feedback
Matching data dissemination algorithms to application requirements
Full text PdfPdf (194 KB)
Source Conference On Embedded Networked Sensor Systems archive
Proceedings of the 1st international conference on Embedded networked sensor systems table of contents
Los Angeles, California, USA
SESSION: Dissemination table of contents
Pages: 218 - 229  
Year of Publication: 2003
ISBN:1-58113-707-9
Authors
John Heidemann  USC/Information Sciences Institute, Marina del Rey, CA
Fabio Silva  USC/Information Sciences Institute, Marina del Rey, CA
Deborah Estrin  USC/Information Sciences Institute and University of California, Los Angeles, CA
Sponsors
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 63,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/958491.958517
What is a DOI?

ABSTRACT

A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device resource constraints, and acceptable because devices are inexpensive and numerous enough that they can be dedicated to specific applications. Many data dissemination protocols have been proposed for multi-hop communication in sensor networks, each evaluated in some scenario. The premise of this paper is that, if protocols are designed to exploit application requirements, then no one protocol can be optimized for all applications.Instead, a family of protocols are needed, with guidance to match protocol to application. We show through field experiments with two tracking applications that choice of diffusion algorithm can affect application performance by 40--60%. These applications motivate the design of two new diffusion algorithms: push and one-phase pull diffusion. We describe these algorithms in comparison to previous algorithms, then systematically explore their performance as the number of sinks and sources, the traffic rate and node placement varies, and with and without geographic proximity in node placement and with and without geographically scoped communication. We characterize algorithm performance and highlight the effect of the choice of algorithm parameters. The end result of this work are guidelines to help application developers to match dissemination algorithms to application performance requirements.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Philippe Bonnet, Johannes Gehrke, and Praveen Seshadri. Querying the physical world. IEEE Personal Communications Magazine, 7(5):10--15, October 2000.
3
4
5
 
6
Maurice Chu, Horst Haussecker, and Feng Zhao. Scalable information-dirven sensor querying and routing for ad hoc hetereogeneous sensor networks. International Journal on High-Performance Computing Applications, 16(3), Fall 2002.
 
7
Dan Coffin, Dan Van Hook, Ramesh Govindan, John Heidemann, and Fabio Silva. Network routing application programmer's interface (API) and walk through 8.0. Technical Report 01-741, USCISI, March 2001.
8
 
9
10
 
11
J. Elson, S. Bien, N. Busek, V. Bychkovskiy, A. Cerpa, D. Ganesan, L. Girod, B. Greenstein, T. Schoellhammer, T. Stathopoulos, and D. Estrin. EmStar: An environment for developing wireless embedded systems software. Technical Report CENS-TR-9, University of California, Los Angeles, Center for Embedded Networked Computing, March 2003. (Also submitted to SOSP-19).
12
13
14
15
 
16
John Heidemann, Fabio Silva, Yan Yu, Deborah Estrin, and Padmaparma Haldar. Diffusion filters as a flexible architecture for event notification in wireless sensor networks. Technical Report ISI-TR-556, USCInformation Sciences Institute, April 2002.
17
18
 
19
 
20
Bhaskar Krishnamachari and John Heidemann. Application-specific modelling of information routing in sensor networks. under submission, April 2003.
 
21
 
22
Juan Liu, Jie Liu, James Reich, Patrick Cheung, and Feng Zhao. Distributed group management for track initiaition and maintenance in target localization applications. In Proceedings of the IEEE International Workshop on Information Processing in Sensor Networks, page to appear, Palo Alto, California, USA, April 2003. IEEE.
23
24
25
26
 
27
Kung Yao, Ralph E. Hudson, Chris W. Reed, Daching Chen, and Flavio Lorenzelli. Blind beamforming on a randomly distributed sensor array system. IEEE Journal of Selected Areas in Communication, 16(8):1555--1567, October 1998.
 
28
Wei Ye, John Heidemann, and Deborah Estrin. An energy-efficient MAC protocol for wireless sensor networks. In Proceedings of the IEEE Infocom, pages 1567--1576, New York, NY, USA, June 2002. USCInformation Sciences Institute, IEEE.
 
29
Wei Ye, John Heidemann, and Deborah Estrin. A flexible and reliable radio communication stack on motes. Technical Report ISI-TR-565, USCInformation Sciences Institute, September 2002.
 
30
Yan Yu, Ramesh Govindan, and Deborah Estrin. Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Technical Report TR-01-0023, University of California, Los Angeles, Computer Science Department, 2001.

CITED BY  23

Collaborative Colleagues:
John Heidemann: colleagues
Fabio Silva: colleagues
Deborah Estrin: colleagues