.png){kind=icon}
返回
Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2010.68.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose localized, self organizing, robust, and energy-efficient data aggregation tree approaches for sensor networks, which we call Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs). They are based on topologies, such as LMST and RNG, that can approximate minimum spanning tree and can be efficiently computed using only position or distance information of one-hop neighbors. The actual routing tree is constructed over these topologies. We also consider different parent selection strategies while constructing a routing tree. We compare each topology and parent selection strategy and conclude that the best among them is the shortest path strategy over LMST structure. Our solution also involves route maintenance procedures that will be executed when a sensor node fails or a new node is added to the network. The proposed solution is also adapted to consider the remaining power levels of nodes in order to increase the network lifetime. Our simulation results show that by using our power-aware localized approach, we can almost have the same performance of a centralized solution in terms of network lifetime, and close to 90 percent of an upper bound derived here.
Keyword:
Wireless networks
sensor networks
data gathering
minimum energy control
distributed algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
On the superparamagnetic-stable single domain transition for magnetite, and frequency dependence of susceptibility关于磁铁矿的超顺磁稳定单畴跃迁，以及磁化率的频率依赖性
OAAI
OAAI分享收藏Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks最大化无线传感器网络生命周期的最优路由和数据聚合
OAAI
OAAI分享收藏
查看更多内容