天牛须搜索的锚节点布设优化算法

Optimization Algorithm of Anchor Node Layout Based on Beetle Antennae Search

锚节点的布设方案决定了无线传感器网络的定位极限.针对现有布设算法存在计算开销大和优化策略具有局限性等问题,提出了基于天牛须搜索的锚节点布设优化算法.采用向量化的克拉美罗下界作为布设优化策略,通过功效系数法优化布设策略,并采用天牛须搜索算法实现布设的快速、精确收敛.仿真结果表明:与传统区域定位误差均界评价指标相比,所提算法使得99.74%的区域内定位性能极限提升了约38.79%;在25锚节点布设场景下,与遗传算法相比,布设后区域内定位性能极限大致相同,但搜索时间降低了约64.2%.

The anchor node layout scheme determines the performance of localization in the wireless sensor network.In order to solve the problems of high computational cost and limited optimization strategy of existing layout algorithms,an anchor node layout optimization algorithm based on the beetle antennae search was proposed.The algorithm adopts Cramér-Rao lower bound vector as the optimization strategy,and the efficiency coefficient method to optimize the layout strategy and then the algorithm uses beetle antennae search algorithm to achieve rapid deployment of anchor node.The simulations show that the proposed algorithm reduces the low bound of localization performance by 38.79%in 99.74%of the regions,and in the 25-anchor node layout scenario,compared with the genetic algorithm,the low bound of localization performance is almost same,but the search time is reduced by about 64.2%.