On Optimal Route of a Calibrating Mobile Sink in a Wireless Sensor Network

In a wireless sensor network containing fixed positioned sensor nodes and a sink node that moves around the sensor field calibrating the sensors, the problem of computing the optimal route for the sink is evolved. In this paper, the determination of such a route is formulated and defined as problem belonging to the class of travelling salesperson problems. The complexity being NP-hard, the problem is solved by reducing it to an instance of the well known travelling salesperson problem with neighbourhoods.