arrow
返回

A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks

delete2008-09-04
delete29
delete
OA
AI
S
Supriyo Chatterjea *
T
Tim Nieberg
N
Nirvana Meratnia
P
Paul Havinga
DOI:10.1145/1387663.1387666delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running queries injected into a WSN for analyzing at a later stage, rather than injecting snap-shot queries containing data-reducing operators (e.g., MIN, MAX, AVG) that aggregate data. Collection of raw data poses a challenge to WSNs as very large amounts of data need to be transported through the network. This not only leads to high levels of energy consumption and thus diminished network lifetime but also results in poor data quality as much of the data may be lost due to the limited bandwidth of present-day sensor nodes. We alleviate this problem by allowing certain nodes in the network to aggregate data by taking advantage of spatial and temporal correlations of various physical parameters and thus eliminating the transmission of redundant data. In this article we present a distributed scheduling algorithm that decides when a particular node should perform this novel type of aggregation. The scheduling algorithm autonomously reassigns schedules when changes in network topology, due to failing or newly added nodes, are detected. Such changes in topology are detected using cross-layer information from the underlying MAC layer. We first present the theoretical performance bounds of our algorithm. We then present simulation results, which indicate a reduction in message transmissions of up to 85% and an increase in network lifetime of up to 92% when compared to collecting raw data. Our algorithm is also capable of completely eliminating dropped messages caused by buffer overflow.
Keyword:
algorithms
performance
measurement
wireless sensor network
scheduling
in-network data aggregation
self-organizing
cross-layer optimization
spatio-temporal correlation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

ACM Transactions on Sensor Networks 封面图
ACM Transactions on Sensor Networks
IF:
4.7
论文数:
1.0K
被引数:
2.0K

机构

U
university of twente
学者数:
1.5W
论文数: 1.4W
被引数: 9
引用论文

引用论文

err分享
err收藏
Volume-based Interval Training Program for Elite Tennis Players
err2016-07-08
err0
errOAAI
errNatalie L. Myers; Aaron D. Sciascia; W. Ben Kibler; Tim L. Uhl
err分享
err收藏
Storage Futures Study: Economic Potential of Diurnal Storage in the U.S. Power Sector
err
IF0
err2021-05-01
err0
PREAI
errA. Frazier; Wesley Cole; Paul Denholm; Scott Machen; Nathaniel Gates; Nate Blair
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容