Title: Convex hull based trajectory design for mobile sink in wireless sensor networks

Authors: Kumar Nitesh; Prasanta K. Jana

Addresses: Indian School of Mines, Department of Computer Science and Engineering, Dhanbad-826004, India ' Indian School of Mines, Department of Computer Science and Engineering, Dhanbad-826004, India

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.

Keywords: WSN; wireless sensor networks; convex hull; rendezvous points; mobile sink; delay bound path; computational geometry.

DOI: 10.1504/IJAHUC.2019.097092

International Journal of Ad Hoc and Ubiquitous Computing, 2019 Vol.30 No.1, pp.26 - 36

Received: 27 Aug 2016
Accepted: 11 Nov 2016
Published online: 19 Dec 2018 *

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