A relay node redeployment algorithm was proposed to find the optimal location of redeployment relay node when an existed relay node was overloaded considering the multi-dimensional localization and bandwidth constraint. The algorithm translated the redeployment problem into the optimal location planning in a multi-dimensional Euclidean space and then gave the suitable redeployment plan through searching the intersections of transmission areas heuristically. The correctness and completeness of the algorithm were proved. Furthermore, an optimization method was proposed to reduce the complexity of the algorithm to the linear function of the number of sensor nodes. The simulation results show that the algorithm can balance the loads of the overloaded relay nodes by joining in the candidate nodes and then prolong the network lifetime.%提出了一个支持多维定标的中继节点可扩展部署算法,当现有中继节点过载时能及时增加新的中继节点并定位新增中继点的最优位置.该算法把部署问题转化为多维欧氏空间下的优化选址问题,通过启发式搜索传输空间的相交区域来查找中继节点的合理部署,并证明了算法的正确性和完备性.在此基础上进一步提出优化方法,可以把算法的复杂度降为节点数量的线性函数.仿真实验结果表明,提出的部署算法能较大程度地平衡网络流量负载,从而降低数据传输过程的能量消耗,延长网络生命周期.
展开▼
