This paper studies the problem of minimizing the age of information (AoI) by optimally associating users to energy harvesting access points (EH-APs) and scheduling their packets that have stringent deadlines constraints. With a single EH-AP, this problem is already shown to be NP-hard. First, we consider the single EH-AP scenario and study the fairness between packets. We show the existence of fairness-AoI tradeoff. Further, we improve the previously proposed algorithms by reducing the average age of information. Finally, the general problem is considered. We reduce the problem to a knapsack problem and propose a dynamic programming approach to solve it. We present simulation results and show the efficiency of the proposed solutions compared to the optimal and the state-of-the-art ones.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Association and Scheduling in Energy Harvesting Networks: Age of Information and Fairness Trade-off


    Contributors:


    Publication date :

    2020-05-01


    Size :

    97059 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Buffer-Aware Scheduling for UAV Relay Networks with Energy Fairness

    Emami, Yousef / Li, Kai / Tovar, Eduardo | IEEE | 2020


    Scheduling Energy Harvesting Roadside Units in Vehicular Ad Hoc Networks

    Atoui, Wassim S. / Salahuddin, Mohammad A. / Ajib, Wessam et al. | IEEE | 2016