.png){kind=icon}
返回
Fast Aggregation Scheduling in Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2015.2405060.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Data aggregation is a key, yet time-consuming functionality introduced to conserve energy in wireless sensor networks (WSNs). In this paper, to minimize time latency, we focus on aggregation scheduling problem and propose an efficient distributed algorithm that generates a collision-free schedule with the least number of time slots. In contrast to others, our approach named FAST mainly contributes to both tree construction, where the former studies employ Connected 2-hop Dominating Sets, and aggregation scheduling that was previously addressed through the Competitor Sets computation. We prove that the latency of FAST under the protocol interference model is upper-bounded by 12R + Delta - 2, where R is the network radius and. is the maximum node degree in the communication graph of the original network. Both the theoretical analysis and simulation results show that FAST outperforms the state-of-the-art aggregation scheduling algorithms.
Keyword:
Wireless sensor networks
data aggregation
minimum latency scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks一种时延有效的多跳无线传感器网络数据融合算法
OAAI
OAAI分享收藏
查看更多内容