Article thumbnail

On optimal route of a calibrating mobile sink in a wireless sensor network

By Sudarsanan Nesamony, Madhan Karky Vairamuthu and Maria E. Orlowska

Abstract

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 NF-Hard, the problem is solved by reducing it to an instance of the well known Travelling Salesperson Problem with Neighbourhoods

Topics: Minimum distance problems, Sensor network, Travelling salesman problem, TSP with neighbourhoods, 1705 Computer Networks and Communications, 2207 Control and Systems Engineering
Publisher: 'Institute of Electrical and Electronics Engineers (IEEE)'
Year: 2007
DOI identifier: 10.1109/INSS.2007.4297389
OAI identifier: oai:espace.library.uq.edu.au:UQ:d4feff1
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://espace.library.uq.edu.... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles