Abstract

In wireless sensor networks (WSNs), sensors are equipped with limited power batteries. Data collection from sensors is one of the fundamental tasks in WSNs. Maximizing the data collection with minimum energy consumption is one of the major challenging issues in WSNs. In this article, we consider data collection using a mobile sink, where the mobile sink efficiently collects data from nearby sensors while moving along a pre-specified path with constant speed. We refer this problem as a Maximizing Data Gathering with Minimum Energy Consumption (MDGMEC) problem. So far, existing works have heuristic algorithms for MDGMEC problem. Their solutions, being heuristic, could not ensure the optimality. In this article, we propose two efficient algorithms to improve the data gathering process. Our algorithms use network flow approach for efficient data forwarding. In the first proposed algorithm, the mobile sink can receive data from multiple nearby sensors simultaneously, while in the second, the mobile sink can receive data from only one nearby sensor at a time. The proposed algorithms run in polynomial time and are also scalable for large networks. We evaluate the proposed algorithms by implementing them in MATLAB. The obtained results show that our proposed schemes outperform other existing schemes in terms of collecting total data and energy efficiency.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call