%0 Journal Article
%A DENG Zhong-liang
%A HU En-wen
%A LIU Yan-xu
%T Optimization Algorithm of Anchor Node Layout Based on Beetle Antennae Search
%D 2019
%R 10.13190/j.jbupt.2019-135
%J Journal of Beijing University of Posts and Telecommunications
%P 58-63
%V 42
%N 6
%X 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%.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2019-135