Referenced Items are not available for this document.
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.
Published in:
Networked Sensing Systems, 2007. INSS '07. Fourth International Conference on
Date of Conference: 6-8 June 2007
- Page(s):
- 61 - 64
- Print ISBN:
- 1-4244-1231-5
- INSPEC Accession Number:
- 9608724
- Conference Location :
- Braunschweig
- Digital Object Identifier :
- 10.1109/INSS.2007.4297389
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
