Age-Optimal Mobile Elements Scheduling for Recharging and Data Collection in Green IoT

• Published in: IEEE access Vol. 8; pp. 81765 - 81775
• Main Authors: Ma, Jianxin, Shi, Shuo, Gu, Shushi, Zhang, Ning, Gu, Xuemai
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Age; age of information; Data collection; Energy efficiency; Game theory; Games; Greedy algorithms; green IoT; Information age; Internet of Things; Mobile element scheduling; Packets (communication); Recharging; Scheduling; Sensors; Slot allocation; Time measurement; Trajectory; Wireless sensor networks
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2020.2990931

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.