Getting Mobile Beacon Node Path in WSN Based on Ant Colony Algorithm

Because of restricted resources, wireless sensor networks need to consider synthetically the price of networks, and costs of communication and computing and so on. Aiming at the localization problem for mobile beacon node in wireless sensor network, this paper uses the ant colony algorithmpsilas characteristics which is self-organized, adaptive, dynamic optimization, integrating the hop number into the pheromone and supporting multiple paths, and proposed a kind of method for getting the mobile beacon node optimal path based on ant colony algorithm. Furthermore, various factors are analyzed for getting optimal path. Experimental results show that the proposed method is efficient.