作者: Lu Dai , Bang Wang , Xianjun Deng , Laurence T. Yang
DOI: 10.1109/UIC-ATC.2017.8397492
关键词: Algorithm 、 Population 、 Triangulation (social science) 、 Node (networking) 、 Computer science 、 Bipartite graph 、 Wireless sensor network 、 Information coverage 、 Selection (genetic algorithm) 、 Relocation
摘要: This paper studies the mobile node relocation problem to maximize area confident information coverage while minimizing movement cost in a hybrid sensor network consisting of both stationary and nodes. For this multi-objective problem, we propose an improved immune algorithm by using effective initial population generation efficient attribute exchange during iteration. The is generated based on Denaunay triangulation for reducing holes nodes; new soft-coded destination selection applied bipartite graph perfect matching. simulation results show that proposed outperforms peer algorithms terms much higher ratio, lower comparable computation complexity.