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...

Full description

Saved in:
Bibliographic Details
Main Authors: Nesamony, S., Vairamuthu, M.K., Orlowska, M.E.
Format: Conference Proceeding
Language:English
Subjects:
Australia
Calibration
Computer networks
Costs
Data communication
Minimum Distance Problems
Mobile communication
Mobile computing
Sensor Network
Shape
Traveling salesman problems
Travelling Salesman Problem
TSP with Neighbourhoods
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/INSS.2007.4297389