论文部分内容阅读
针对无线传感器网络虚拟骨干时延和功耗的约束问题,提出(α,β)-约束的连通支配集算法.根据(α,β)-约束定义了时延约束的连通支配树问题(CDTT),并给出构建同时符合时延约束和有限总功率消耗的连通支配树(CDT)算法.算法分为2个阶段执行:首先在单位圆图上构建网络的极大独立集,然后在无向图上基于不同权值的最小生成树和最短路径树,构造满足(α,β)-约束要求的支撑树.理论分析和仿真结果表明提出的算法能够正确地解决CDTT问题,并能够构建平衡功率消耗和传输时延要求的无线传感器网络虚拟骨干.
In order to solve the constraint of virtual backbone delay and power consumption in wireless sensor network, a (α, β) - constraint connected dominating set algorithm is proposed. According to the constraint of (α, β) , And gives the construction of connected dominance tree (CDT) algorithm which meets both the delay constraint and the limited total power consumption.The algorithm is divided into two phases: firstly, construct the maximal independent set of the network on the unit circle graph, According to the minimum spanning tree and the shortest path tree based on different weights, a support tree satisfying the (α, β) -constraint requirements is constructed on the graph.Theoretical analysis and simulation results show that the proposed algorithm can correctly solve the CDTT problem and can build a balanced power Wireless sensor network virtual backbone that consumes and transmits latency requirements.