摘要:为了提高无线传感器网络（wireless sensor network，简称WSN）孤岛结盟方法对未知孤岛分布和中继带宽约束的适应性及效率，提出了基于搜索带宽感知的多机器人WSN孤岛结盟优化问题，并给出了求解该问题的近似算法.首先，在相关模型假设及符号定义的基础上，借鉴迭代局部搜索和流水作业调度思想，引入同步轮次流水迭代过程，建立该优化问题的公式化描述；然后，在连通重叠搜索算法基础上，结合层次分簇和网络流相关理论，设计基于搜索带宽感知的层次中继部署算法；最后，通过与现有方法进行对比实验的结果表明：提出的方法能够在满足未知孤岛分布和中继带宽约束的同时，有效地提高WSN孤岛结盟效率.



Abstract:In order to improve the adaptability and efficiency of federating method for disjoint segments in wireless sensor network (WSN) under the unknown distribution of disjoint segments and bandwidth-constrained relay, an optimization problem about multi-robot federating for disjoint segments in WSN based on search and bandwidth aware (MRF-SNSA) is proposed, and approximate solution algorithms for the optimization problem are given. Firstly, according to the related model assumptions and symbol definitions, the iterative process of synchronizing the step-flow rounding is introduced referring to the idea of the iterated local search and flow shop scheduling, and the formal definition for MRF-SNSA is established. After that, based on the overlapping-aware connectivity search algorithm, a hierarchical relay deployment algorithm with the search and bandwidth aware is designed using related theories of hierarchical clustering and network flow. Finally, through experiments and comparison with the existing method, the experimental results show that the proposed method can effectively improve the efficiency of federating disjoint segments in WSN while meeting the constraints for the unknown distribution of disjoint segments and the bandwidth-constrained relay.



PDF全文下载地址:

http://jos.org.cn/jos/article/pdf/5515