ACM Home Page
Please provide us with feedback. Feedback
Dynamic delay-constrained minimum-energy dissemination in wireless sensor networks
Full text PdfPdf (1.13 MB)
Source ACM Transactions on Embedded Computing Systems (TECS) archive
Volume 4 ,  Issue 3  (August 2005) table of contents
Pages: 679 - 706  
Year of Publication: 2005
ISSN:1539-9087
Authors
Hyung Seok Kim  Samsung Electronics Co.
Tarek F. Abdelzaher  University of Illinois at Urbana-Champaign
Wook Hyun Kwon  Seoul National University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 108,   Citation Count: 3
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/1086519.1086530
What is a DOI?

ABSTRACT

Disseminating data generated by sensors to users is one of useful functions of sensor networks. In probable real-time applications of sensor networks, multiple mobile users should receive data within their end-to-end delay constraint. In this paper, we propose a dynamic DElay-constrained minimum-Energy Dissemination (DEED) scheme. A dissemination tree (d-tree) is updated in a distributed way without regenerating the tree from scratch, such that energy consumption of the tree is minimized while satisfying end-to-end delay constraints. The d-tree is adjusted using delay estimation based on geometric distance. DEED increases the probability that packets arrive at users within an upper-bound end-to-end delay (UBED) and minimizes energy consumption in both building the d-tree and disseminating data to mobile sinks. Evaluation results show that DEED makes each node consume small energy resources and maintains fewer UBED misses when compared to Directed Diffusion and other baselines for sensor networks.


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
Bettahar, H. and Bouabdallah, A. 2002. New algorithms for delay constraint multicast routing. In Networks 2002, Joint Conference of IEEE ICWLHN and IEEE ICN 2002. Atlanta, Georgia.
3
 
4
Bonfils, B. and Bonnet, P. 2003. Adaptive and decentralized operator placement for in-network query processing. In Proceedings of Information Processing in Sensor Networks. Palo Alto, CA.
 
5
Bulusu, N., Heidemann, J., and Estrin, D. 2000. Gps-less low cost outdoor localization for very small devices. IEEE Personal Communications, Special Issue on Smart Spaces and Environments 7, 5 (Oct.), 28--34.
 
6
 
7
Chen, K. and Nahrstedt, K. 2002. Effective location-guided tree construction algorithms for small group multicast in manet. In Proceedings of IEEE INFOCOM 2002. New York. 1180--1189.
 
8
Elson, J. and Estrin, D. 2001. Time synchronization for wireless sensor networks. In Workshop on Parallel and Distributed Computing Issues in Wireless and Mobile Computing. San Francisco, California.
 
9
Elson, J. and Romer, K. 2002. Wireless sensor networks: A new regime for time synchronization. In Proceedings of the First Workshop on Hot Topics In Networks (HotNets-I). Princeton, New Jersey.
 
10
Gui, C. and Mohapatra, P. 2003. Efficient overlay multicast for mobile ad hoc networks. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC) 2003. New Orleans, Louisiana.
11
 
12
13
14
15
16
 
17
 
18
19
20
 
21
Ural, H. and Zhu, K. 2002. An efficient distributed qos-based multicast routing algorithm. In Proceedings of the IEEE IPCCC'02. Phoenix.
22
23
 
24
Youssef, M. A., Younis, M. F., and Arisha, K. A. 2002. A constrained shortest-path energy-aware routing algortihm for wireless sensor networks. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC). Orlando, Florida.
 
25


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