Dynamic delay-constrained minimum-energy dissemination in wireless sensor networks
- 1 August 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 4 (3), 679-706
- https://doi.org/10.1145/1086519.1086530
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.Keywords
This publication has 4 references indexed in Scilit:
- AIDA: Adaptive Application Independent Data Aggregation in Wireless Sensor NetworksPublished by Defense Technical Information Center (DTIC) ,2005
- Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networksPublished by Association for Computing Machinery (ACM) ,2003
- Multicast over wireless networksCommunications of the ACM, 2002
- Data gathering algorithms in sensor networks using energy metricsIEEE Transactions on Parallel and Distributed Systems, 2002