An improved immune algorithm for node relocation to maximize confident information coverage in a hybrid sensor network
Lu Dai, Bang Wang, Xianjun Deng, Laurence Tianruo Yang · 2017
This paper studies the mobile node relocation problem to maximize the area confident information coverage while minimizing the movement cost in a hybrid sensor network consisting of both stationary and mobile nodes. For this multi-objective problem, we propose an improved immune algorithm by using an effective initial population generation and an efficient population attribute exchange during generation iteration. The initial population is generated based on the Denaunay triangulation for reducing coverage holes by stationary nodes; and a new soft-coded destination selection is applied based on the bipartite graph perfect matching. The simulation results show that the proposed algorithm outperforms the peer immune algorithms in terms of much higher coverage ratio, lower relocation cost and comparable computation complexity.