Performance evaluation of route cost for wireless sensor networks with a mobile sink

Nowadays the Wireless Sensor Network (WNS) technology has been developing remarkably, and it´s expected to be applied to many applications such as plant management, crime prevention, and disaster prevention, and medical treatment, traffic system, so on. In this article, we propose a Mobile Sink node control method for Wireless Sensor Networks. These Networks are composed from two types of sensor node, one is “fixed node” which is immovable and the other one is “mobile sink node” which is movable. The fixed nodes will form the clusters, and then the Mobile Sink node by using the Nearest Addition Method of TSP (Traveling Salesman Problem) which moves around the cluster center, decides the best rotation of the communication among the clusters, after, it decides the best fixed node to make the shortest distance of communication. The chosen best fixed nodes will transfer its data to the Mobile Sink node when it reached to them. Moreover the mobile Sink node is also capable to sense the possibility of communication of more than few clusters in between, from then it would identify the best path of collecting the data. This method has proved it efficiency by the result of simulation and experiment that we have conducted and it would evaluate the performance of route cost for a mobile sink node.