Abstract

Age of Information (AoI) is a new metric for measuring the freshness of sensory data in wireless sensor networks. The Battery-Free Wireless Sensor Network (BF-WSN) is proposed to break through the lifetime limitation of battery-powered wireless sensor networks. However, the emerging BF-WSN also brings challenges to the minimization of AoI, on account of its energy characteristics. In this paper, we investigate the AoI minimization data collection scheduling problem for BF-WSNs. The off-the-shelf works for the AoI minimization data collection scheduling problem either focus on simple networks with no more than three nodes or assume that battery-free sensor nodes have specific energy harvesting process, such as Bernoulli process and Poisson process. Different from these works, we first consider the AoI minimization data collection scheduling for one-hop BF-WSNs with multiple battery-free sensor nodes transmitting their sensory data to the sink node, where the energy harvesting processes of battery-free sensor nodes are non-specific. We propose the optimal offline algorithm and the online algorithm for the problem, respectively. The optimality of the offline algorithm and the competitive ratio of the online algorithm are theoretical proved and analyzed. Numerical results are provided to verify the performances of the proposed algorithms.

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