John Heidemann / Papers / Matching Data Dissemination Algorithms to Application Requirements

Matching Data Dissemination Algorithms to Application Requirements
John Heidemann, Fabio Silva and Deborah Estrin
USC/Information Sciences Institute

Citation

John Heidemann, Fabio Silva and Deborah Estrin. Matching Data Dissemination Algorithms to Application Requirements. Proceedings of the First ACM SenSys Conference (Los Angeles, California, USA, Nov. 2003), 218–229. [DOI] [PDF] [alt PDF]

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: pull and one-phase push 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.

Bibtex Citation

@inproceedings{Heidemann03b,
  author = {Heidemann, John and Silva, Fabio and Estrin, Deborah},
  title = {Matching Data Dissemination Algorithms to Application Requirements},
  booktitle = {Proceedings of the First ACM {SenSys} Conference },
  pages = {218--229},
  year = {2003},
  sortdate = {2003-04-01},
  project = {ant, scadds},
  jsubject = {sensornet_data_dissemination},
  month = nov,
  publisher = {ACM},
  address = {Los Angeles, California, USA},
  jlocation = {johnh: pafile},
  keywords = {diffusion variants, diffusion algorithms,
                           experiment and simulation},
  doi = {http://dx.doi.org/10.1145/958491.958517},
  url = {https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann03b.html},
  pdfurl = {https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann03b.pdf},
  myorganization = {USC/Information Sciences Institute},
  copyrightholder = {ACM},
  copyrightterms = {
  Permission to make digital or hard copies of all or part 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 copies bear this notice and the full citation on the first
  page. To copy otherwise, to republish, to post on servers or to
  redistribute to lists, requires prior specific permission and/or a
  fee.
  }
}

Copyright

Permission to make digital or hard copies of all or part 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 copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
Copyright © by John Heidemann