Construction of Tree Network with Limited Delivery Latency in Homogeneous Wireless Sensor Networks
Construction of Tree Network with Limited Delivery Latency in Homogeneous Wireless Sensor Networks
复制标题
DOI：
10.1007/s11277-014-1748-5
复制
发表时间：
2014-04
影响因子：
2.2
通讯作者：
Shengdong Xie;Yuxiang Wang
中科院分区：
文献类型：
--
作者：
Shengdong Xie;Yuxiang Wang
本文提出了一种近似算法ADCMCST（algorithm with the minimum number of child nodes when the depth is restricted），用于同构无线传感器网络的树型网络构建，以减少和均衡节点的负载，从而延长网络的生存时间。当监控节点获得邻居图后，ADCMCST试图找到一个子节点数最少的树形拓扑，然后将该拓扑广播到每个节点，最终构建一个树形网络。仿真结果表明，ADCMCST能大大减少拓扑形成时间，并取得良好的近似效果;当压缩率小于70%时，ADCMCST的网络生存期将大于能量驱动树构造。
In this paper we propose an approximation algorithm, which is called ADCMCST (algorithm with the minimum number of child nodes when the depth is restricted), to construct a tree network for homogeneous wireless sensor network, so as to reduce and balance the payload of each node, and consequently prolong the network lifetime. When the monitoring node obtains the neighbor graph, ADCMCST tries to find a tree topology with a minimum number of child nodes, and then broadcast the topology to every node, and finally a tree network is constructed. Simulation results show that ADCMCST could greatly reduce the topology formation time, and achieve good approximation results; when the compression ratio is less than 70 %, the network lifetime of ADCMCST will be larger than that of energy driven tree construction.