Age-optimal mobile elements scheduling for recharging and data collection in green IoT

11Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Ensuring real-time reporting of fresh information and maintaining the sustainability of power supply is of great importance in time-critical green Internet of Things (IoT). In this paper, we investigate the mobile element scheduling problem in a network with multiple independent and rechargeable sensors, in which mobile elements are dispatched to collect data packets from the sensor nodes and to recharge them. The age of information (AoI) is used to measure the time elapsed of the most recently delivered packet since the generation of the packet. We propose an age-optimal mobile elements scheduling (AMES), which decides the trajectories of mobile elements based on a cooperative enforcement game and completes the time-slot allocation in each meeting point, to minimize the average AoI and maximize the energy efficiency. The cooperative enforcement game enables the mobile elements to make optimal visiting decisions and avoid the visiting conflicts, and the outcome of the game is pareto-optimal. Compared to the existing approaches, i.e., greedy algorithm (GA), greedy-neighborhood algorithm (GA-neighborhood), simulation results demonstrate that AMES can achieve a lower average AoI and a higher energy efficiency with a higher successful visiting ratio of the sensor node.

Cite

CITATION STYLE

APA

Ma, J., Shi, S., Gu, S., Zhang, N., & Gu, X. (2020). Age-optimal mobile elements scheduling for recharging and data collection in green IoT. IEEE Access, 8, 81765–81775. https://doi.org/10.1109/ACCESS.2020.2990931

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free