Convex hull based trajectory design for mobile sink in wireless sensor networks
by Kumar Nitesh; Prasanta K. Jana
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 30, No. 1, 2019

Abstract: Data collection through mobile sink (MS) is an efficient solution to solve hotspot or sinkhole problem which is usually caused by data collection using a static sink. In this paper, we propose an algorithm for designing a delay bound path for MS which is based on convex hull and therefore we refer it a concentric convex hull (CCH) algorithm. For a given set of sensor nodes, the CCH generates a set of convex hull as the potential paths and selects one of them as the final path for MS fulfilling certain optimising criteria. Unlike other existing techniques, the proposed technique does not use travelling sales person (TSP) tour. This, in turn, reduces the hop count and restricts the time complexity of the proposed technique to O(n2) for n sensor nodes. We simulate the proposed algorithm, compare and analyse the results with some of the existing algorithms over diverse network performance metrics.

Online publication date: Wed, 19-Dec-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