Title: Data gathering maximisation for wireless sensor networks with a mobile sink

Authors: Zongyuan Han; Tianyun Shi; Xiaojun Lv; Xinchun Jia; Zhongying Wang; Dong Zhou

Addresses: Institute of Computing Technologies, China Academy of Railway Sciences, Beijing 100081, China ' Institute of Computing Technologies, China Academy of Railway Sciences, Beijing 100081, China ' Institute of Computing Technologies, China Academy of Railway Sciences, Beijing 100081, China ' School of Mathematical Sciences, Shanxi University, Taiyuan 030006, China ' Institute of Computing Technologies, China Academy of Railway Sciences, Beijing 100081, China ' Institute of Computing Technologies, China Academy of Railway Sciences, Beijing 100081, China

Abstract: Recent studies have demonstrated that the significant benefit can be achieved by using mobile sinks for data gathering in wireless sensor networks (WSNs). However, most of them employed a typical scheme that the mobile collector pauses at the anchor points on its moving tour for a period time to collect the data from nearby sensors. In this paper, the data gathering process is divided into two stages named parking communication (PC) and moving communication (MC). We focus on maximising the total amount of data gathering by the mobile sink, and formulate the problem as two different optimisation models under several constraints for these two different communication stages. Accordingly, dual decomposition and simplex methods are dexterously exploited to derive the optimal communication time and flow rates allocation schemes. Computational results demonstrate the efficiency of the proposed algorithms.

Keywords: wireless sensor network; WSN; mobile data gathering; dual decomposition; nonlinear programming.

DOI: 10.1504/IJAHUC.2019.103263

International Journal of Ad Hoc and Ubiquitous Computing, 2019 Vol.32 No.4, pp.224 - 235

Available online: 21 Oct 2019 *

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