Abstract
This study considers a wireless network where an access point (AP) broadcasts timely updates to numerous mobile users. The timeliness of information owned by a user is characterized by the age of information. Frequently broadcasting the timely updates at constant maximum power can minimize the age of information for all users, but wastes valuable communication resources (i.e., time and energy). To address the age-energy trade-off, it is critical to develop an efficient scheduling algorithm that identifies broadcast times and allocates power. Moreover, unpredictable user movement would cause rapidly varying communication channels; in particular, those channels can be non-stationary. Our main contribution is to develop an online scheduling algorithm and a channel-agnostic scheduling algorithm for such a mobile network with a provable performance guarantee.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
