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

Author

Nesamony, Sudarsanan ; Vairamuthu, Madhan Karky ; Orlowska, Maria E.

Author_Institution

Univ. of Queensland, Brisbane

fYear

2007

fDate

6-8 June 2007

Firstpage

61

Lastpage

64

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 NP-hard, the problem is solved by reducing it to an instance of the well known travelling salesperson problem with neighbourhoods.

Keywords

computational complexity; telecommunication network routing; travelling salesman problems; wireless sensor networks; NP-hard problem; mobile sink calibration; optimal route; travelling salesperson problems; wireless sensor network; Australia; Calibration; Computer networks; Costs; Data communication; Mobile communication; Mobile computing; Shape; Traveling salesman problems; Wireless sensor networks; Minimum Distance Problems; Sensor Network; TSP with Neighbourhoods; Travelling Salesman Problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Networked Sensing Systems, 2007. INSS '07. Fourth International Conference on

Conference_Location

Braunschweig

Print_ISBN

1-4244-1231-5

Type

conf

DOI

10.1109/INSS.2007.4297389

Filename

4297389