无线传感器网络中不考虑故障节点的聚合树重构
Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless Sensor Networks
摘要：
无线传感器网络（WSNs）的最新进展带来了许多新的应用前景。然而节点间的数据通信消耗了无线传感器网络总能量的很大一部分。因此，有效的数据聚合技术可以帮助大大降低功耗。为了减少传感器节点在{ \it aggregation tree}上的传输次数，从而最小化网络中的总功耗，数据聚合已经成为无线传感器网络中的一种基本方法。如果传感器节点在数据聚合期间发生故障，则聚合树断开连接。因此，无线传感器网络依赖于网络聚合的效率，但一个单一的故障节点可以严重影响的结果，通过贡献一个任意的部分聚合值。在本文中，我们提出了一种分布式算法，重建聚合树从初始聚合树排除故障的传感器节点。这是一个同步模型，在几轮中完成。我们提出的方案可以处理多个故障节点以及。
英文摘要：
Recent advances in wireless sensor networks (WSNs) have led to many new promissing applications. However data communication between nodes consumes a large portion of the total energy of WSNs. Consequently efficient data aggregation technique can help greatly to reduce power consumption. Data aggregation has emerged as a basic approach in WSNs in order to reduce the number of transmissions of sensor nodes over {\it aggregation tree} and hence minimizing the overall power consumption in the network. If a sensor node fails during data aggregation then the aggregation tree is disconnected. Hence the WSNs rely on in-network aggregation for efficiency but a single faulty node can severely influence the outcome by contributing an arbitrary partial aggregate value. In this paper we have presented a distributed algorithm that reconstruct the aggregation tree from the initial aggregation tree excluding the faulty sensor node. This is a synchronous model that is completed in several rounds. Our proposed scheme can handle multiple number of faulty nodes as well.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
