Title: Peripheral nodes and their effect in path planning in networks

Authors: Khaled Almi'ani; Anastasios Viglas; Young Choon Lee; Reza Abrishambaf

Addresses: Computer Science Department, Al-Hussein Bin Talal University, Maan 71111, Jordan ' LogicBlox and the University of Sydney, University of Sydney, Sydney NSW 2006, Australia ' Macquarie University, NSW 2109, Australia ' Department of Engineering Technology, Miami University, Hamilton, OH, 45011, USA

Abstract: We consider the problem of designing a path in a network that is as close as possible to most node locations in the network. In particular, we concern the case of designing mobile element tours in sensor networks, used to collect data from the network. The nodes that are not visited by the tour need to transmit their data using wireless multi-hop routing, which is expensive in terms of energy usage, and therefore limits the lifetime of the network. Nodes that happen to be placed in locations that are away from the central areas of the network can result in designing a tour that is skewed towards these 'out of the way' or peripheral nodes. In this work, we propose algorithmic solutions that aim to identify peripheral nodes in the network.We provide experimental evidence that the tour planning algorithms that consider peripheral nodes can significantly improve the solution.

Keywords: WSNs; wireless sensor networks; data-gathering; TSP; travelling salesman problem; path-planning.

DOI: 10.1504/IJAHUC.2018.089821

International Journal of Ad Hoc and Ubiquitous Computing, 2018 Vol.27 No.3, pp.157 - 170

Received: 15 Apr 2015
Accepted: 04 Nov 2015
Published online: 13 Feb 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article