A3: A Topology Construction Algorithm for Wireless Sensor Networks
A3: A Topology Construction Algorithm for Wireless Sensor Networks
复制标题
DOI：
10.1109/glocom.2008.ecp.74
复制
发表时间：
2008-12
期刊：
影响因子：
--
通讯作者：
P. Wightman;M. Labrador
中科院分区：
文献类型：
--
作者：
P. Wightman;M. Labrador
拓扑控制是无线传感器网络节能和延长生命周期的重要策略。本文介绍了A3（一棵树）算法，一个简单的，分布式的，节能的拓扑结构构建机制，找到一个次优的连通支配集（CDS）关闭不必要的节点，同时保持网络连接，并提供完整的通信覆盖。A3利用加权的基于距离-能量的度量，其允许网络运营商权衡分支的长度（距离）与树的鲁棒性和耐久性（能量）。与其他知名的拓扑结构的建设机制的比较表明，该计划的优越性，在活跃节点的数量和能源效率。仿真实验表明，要实现完全的通信覆盖，A3只需要6%和41%的节点活跃在密集和稀疏的情况下，与8%和43%的EECDS和CDS-Rule-K算法，分别为5%和43%。更重要的是，所提出的协议提出了一个低的线性有界的最坏情况下的每节点的消息量，限制了开销和能源的使用相比，非线性增加的EECDS和CDS规则K算法。
Topology control is a well-known strategy to save energy and extend the lifetime of wireless sensor networks. This paper introduces the A3 (a tree) algorithm, a simple, distributed, and energy-efficient topology construction mechanism that finds a sub-optimal Connected Dominating Set (CDS) to turn unnecessary nodes off while keeping the network connected and providing complete communication coverage. A3 utilizes a weighted distance-energy-based metric that permits the network operator to trade off the lengths of the branches (distance) for the robustness and durability of the tree (energy). Comparisons with other well-known topology construction mechanisms show the superiority of the proposed scheme in terms of the number of active nodes and energy efficiency. Simulation experiments show that to achieve complete communication coverage, A3 needs only 6% and 41% of the nodes active in dense and sparse scenarios, versus 8% and 43% and 5% and 43% of the EECDS and CDS- Rule-K algorithms, respectively. More importantly, the proposed protocol presents a low linearly bounded worst-case amount of messages per node that limits the overhead and the energy usage compared to a non-linear increase of the EECDS and CDS-Rule- K algorithms.