Matching Data Dissemination Algorithms to Application Requirements

@misc{citeulike:381360, 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...}, author = {Heidemann, J. and Silva, F. and Estrin, D. }, citeulike-article-id = {381360}, keywords = {aggregation, dissemination, filtering}, posted-at = {2005-11-05 05:21:50}, priority = {2}, title = {Matching Data Dissemination Algorithms to Application Requirements}, url = {http://citeseer.ist.psu.edu/heidemann03matching.html}, year = {2003} }

TY - GEN ID - citeulike:381360 L3 - citeulike-article-id:381360 TI - Matching Data Dissemination Algorithms to Application Requirements N2 - 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... KW - aggregation KW - dissemination KW - filtering AU - Heidemann, J AU - Silva, F AU - Estrin, D PY - 2003/// UR - http://citeseer.ist.psu.edu/heidemann03matching.html ER -