Peripheral nodes and their effect in path planning in networks
by Khaled Almi'ani; Anastasios Viglas; Young Choon Lee; Reza Abrishambaf
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 27, No. 3, 2018

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.

Online publication date: Tue, 13-Feb-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com