无线传感器网络中双层受限中继节点放置算法研究

Research on the placement algorithm of two-tiered constrained relay nodes in wireless sensor networks

针对在三维空间中,对于中继节点(RN)的位置受限并且是双层拓扑的情况,提出了一种基于混合整数线性规划的中继节点放置算法,该算法首先考虑三维空间中继节点放置的物理层模型,然后基于混合整数线性规划(MIPS)给出最优能效的分簇,使得每个传感器节点与相应簇头之间的传输距离最小.仿真结果表明:与只考虑最小化簇内距离的中继节点放置算法相比,本算法在降低重传率和延长网络生命周期方面都有较大的改善.

In three-dimensional space,when the location of relay nodes is limited and it is a two-layer topology,a relay location algorithm based on mixed integer linear programming(MILP)is proposed.The algorithm first considers the physical layer model placed by relay nodes in three-dimensional space.Then,the optimal energy efficient clustering is given based on mixed integer linear programming.So that the transmission distance between each sensor node and its corresponding cluster head is the minimized.The simulation results show that compared with the traditional relay node algorithm that only considers the minimum intra cluster distance,the algorithm has a great improvement in reducing the retransmission rate and prolonging the life cycle of the network.