返回
Constructing Load-Balanced Data Aggregation Trees in Probabilistic Wireless Sensor Networks
DOI:10.1109/TPDS.2013.160.png)
摘要
En 中文
Data Gathering is a fundamental task in Wireless Sensor Networks (WSNs). Data gathering trees capable of performing aggregation operations are also referred to as Data Aggregation Trees (DATs). Currently, most of the existing works focus on constructing DATs according to different user requirements under the Deterministic Network Model (DNM). However, due to the existence of many probabilistic lossy links in WSNs, it is more practical to obtain a DAT under the realistic Probabilistic Network Model (PNM). Moreover, the load-balance factor is neglected when constructing DATs in current literatures. Therefore, in this paper, we focus on constructing a Load-Balanced Data Aggregation Tree (LBDAT) under the PNM. More specifically, three problems are investigated, namely, the Load-Balanced Maximal Independent Set (LBMIS) problem, the Connected Maximal Independent Set (CMIS) problem, and the LBDAT construction problem. LBMIS and CMIS are well-known NP-hard problems and LBDAT is an NP-complete problem. Consequently, approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented in the paper. Finally, our simulation results show that the proposed algorithms outperform the existing state-of-the-art approaches significantly.
Keyword:
Probabilistic wireless sensor networks
load-balance
data aggregation tree
maximal independent set
minimum-sized connected dominating set
linear programming
integer programming
random rounding
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Electrostatic Free Energy and Other Properties of States Having Nonequilibrium Polarization. I具有非平衡极化状态的静电自由能和其他性质。我
A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks一种时延有效的多跳无线传感器网络数据融合算法

