ACM Home Page
Please provide us with feedback. Feedback
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Full text PdfPdf (319 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: 193 - 204  
Year of Publication: 2003
ISBN:1-58113-707-9
Authors
Hyung Seok Kim  Seoul National University, Seoul, Republic of Korea
Tarek F. Abdelzaher  University of Virginia, Charlottesville, VA
Wook Hyun Kwon  Seoul National University, Seoul, Republic of Korea
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): 13,   Downloads (12 Months): 175,   Citation Count: 25
Additional Information:

abstract   references   cited by   index terms   review   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.958515
What is a DOI?

ABSTRACT

Data dissemination from sources to sinks is one of the main functions in sensor networks. In this paper, we propose SEAD, a Scalable Energy-efficient Asynchronous Dissemination protocol, to minimize energy consumption in both building the dissemination tree and disseminating data to mobile sinks. SEAD considers the distance and the packet traffic rate among nodes to create near-optimal dissemination trees. The sinks can move without reporting their location to the tree while receiving data updates successfully. Our evaluation results illustrate that SEAD consumes less energy on building and maintaining a dissemination tree to multiple mobile sinks compared to other approaches such as directed diffusion, TTDD, and mobile ad hoc multicast.


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
 
3
B. Bonfils and P. Bonnet. Adaptive and decentralized operator placement for in-network query processing. In Proceedings of Information Processing in Sensor Networks 2003, April 2003.
 
4
N. Bulusu, J. Heidemann, and D. Estrin. Gps-less low cost outdoor localization for very small devices. IEEE Personal Communications, Special Issue on Smart Spaces and Environments, 7(5):28--34, October 2000.
 
5
K. Chen and K. Nahrstedt. Effective location-guided tree construction algorithms for small group multicast in manet. In Proceedings of IEEE INFOCOM 2002, pages 1180--1189, June 2002.
 
6
K.-S. Chen, N.-F. Huang, and B. Li. Ctms: a novel constrained tree migration scheme for multicast services in generic wireless systems. IEEE Journal on Selected Areas in Communications, 19(10):1998--2014, October 2001.
 
7
i. Crossbow Technology. MICA2 Wireless Measurement System Datasheet, URL http://www.xbow.com/Products/Wireless_Sensor_ Networks.htm. Crossbow Technology, inc., 2003.
 
8
Q. Fang, F. Zhao, and L. Guibas. Counting targets: Building and managing aggregates in wireless sensor networks. In Palo Alto Research Center Technical Report, pages 10298--10299, June 2002.
9
 
10
C. Gui and P. Mohapatra. Efficient overlay multicast for mobile ad hoc networks. In IEEE Wireless Communications and Networking Conference (WCNC) 2003, 2003.
11
12
13
 
14
15
16
 
17
S. Kim, S. H. Son, J. A. Stankovic, S. Li, and Y. Choi. Safe: A data dissemination protocol for periodic updates in sensor networks. In Workshop on Data Distribution for Real-Time Systems (DDRTS), May 2003.
 
18
 
19
20
 
21
 
22
23
 
24
H. Takahashi and A. Matsuyama. An approximate solution for the steiner problem in graphs. In Mathematica Japanica, pages 573--577, 1980.
25
 
26
Y. Yu, R. Govindan, and D. Estrin. Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. In University of California at Los Angeles Computer Science Department, Tech. Rep. UCLACSD-TR-01-0023, May 2001.

CITED BY  25


REVIEW

"Alexandru Petrescu : Reviewer"

An interesting and novel algorithm called SEAD for the construction and maintenance of a minimum spanning Steiner tree, weighted by energy consumption (d-trees), is presented in this paper. Its main goal is to minimize communication energy between  more...

Collaborative Colleagues:
Hyung Seok Kim: colleagues
Tarek F. Abdelzaher: colleagues
Wook Hyun Kwon: colleagues