Authors : N. Fami- Tefreshi and M. Davoudi- Monfared
Abstract: Wireless Sensor Networks (WSN) are networks usually comprised of a large number of nodes with sensing and routing capabilities. Routing is usually implemented for the transport of the sensed data to sinks. Most of the considered scenarios in previous works deal with sensor nodes that do no move and are un-replaceable. This study explores the idea of exploiting the mobility of data collection points (sinks) for the purpose of increasing the lifetime of a wireless sensor network. The proposed method is based on ant colony optimization algorithm. Mobile sink routing problem is NP-hard and it will take a long time to solve a problem if the wireless sensor network is huge. Ant colony optimization algorithm is a metaheuristic which has been widely used in optimization problems. Experimental results proved that not only maximum wireless sensor network life time reached but also execution time is declined.
N. Fami- Tefreshi and M. Davoudi- Monfared, 2016. Ant Colony Based Mobile Sink Routing Algorithm for Wireless Sensor Network. Asian Journal of Information Technology, 15: 2981-2987.