Range-Based Data Gathering Algorithm With A Mobile Sink In Wireless Sensor Networks

Abstract

Wireless Sensor Networks (WSNs) have been emerged in many important aspects in the real world, such as industry, agriculture, and military applications. As the main challenge that WSNs facing is the energy consumption, it is necessary to investigate the suitability of using mobile sinks for data collection in these networks. In this paper, therefore, a new data gathering technique with mobile elements referred to as Intersection Point of Communication Ranges (IPCR) is proposed. The IPCR algorithm endeavours to compute the optimal trajectory of the mobile sink for which the data collection latency is reduced. Simulation results presented in this study showed that the IPCR algorithm has achieved the optimal Travel Sales-Man Problem algorithm. In addition, the IPCR algorithm outperformed the Connectivity Based Data Collection (CBDC) algorithm in terms of data gathering latency and network throughput.