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 algorithm’s 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.

[1]  Mihail L. Sichitiu,et al.  Localization of wireless sensor networks with a mobile beacon , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[2]  Wei Guo,et al.  Comparison of distributed localization algorithms for sensor network with a mobile beacon , 2004, IEEE International Conference on Networking, Sensing and Control, 2004.

[3]  R.K. Patro.  Localization in wireless sensor network with mobile beacons , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[4]  Anil Kumar Katti,et al.  Analysis of mobile beacon aided in-range localization scheme in ad hoc wireless sensor networks , 2006, IWCMC '06.

[5]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[6]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[7]  S.L. Ho,et al.  A modified ant colony optimization algorithm modeled on tabu-search methods , 2006, IEEE Transactions on Magnetics.

[8]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).