Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks

Download

index.pdf

Date

2018-12-01

Author

Kadota, Igor
Sinha, Abhishek
Uysal, Elif
Singh, Rahul
Modiano, Eytan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

233
views

198
downloads

In this paper, we consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. We first show that in symmetric networks, a greedy policy, which transmits the packet for the client with the highest current age, is optimal. For general networks, we develop three low-complexity scheduling policies: a randomized policy, a Max-Weight policy and a Whittle's Index policy, and derive performance guarantees as a function of the network configuration. To the best of our knowledge, this is the first work to derive performance guarantees for scheduling policies that attempt to minimize AoI in wireless networks with unreliable channels. Numerical results show that both the Max-Weight and Whittle's Index policies outperform the other scheduling policies in every configuration simulated, and achieve near optimal performance.

Subject Keywords

Age of Information, Scheduling, Optimization, Quality of service, Wireless networks

URI

https://hdl.handle.net/11511/48938

Journal

IEEE-ACM TRANSACTIONS ON NETWORKING

DOI

https://doi.org/10.1109/tnet.2018.2873606

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Age-aware scheduling in communication networks Beytur, Hasan Burhan; Uysal, Elif; Department of Electrical and Electronics Engineering (2020-10-30) In next-generation communication networks, various types of data traffic with different requirements will coexist. This type of coexistence requires new techniques based on new metrics to distinguish the various types of data traffic based on their value. The emerging metric Age of Information (AoI) quantifying the timeliness of the communication flow is a promising metric to prepare future networks for new technologies such as the Internet of Things and Autonomous Driving. In this thesis, we studied s...
Admission control and buffer management of wireless communication systems with mobile stations and integrated voice and data services Gemikonakli, Eser; Ever, Enver; Mapp, Glenford; Gemikonakli, Orhan (2017-08-01) This study presents models for management of voice and data traffic and new algorithms, which use call admission control as well as buffer management to optimise the performance of single channel systems such as wireless local area networks in the presence of mobile stations. Unlike existing studies, the new approach queues incoming voice packets as well as data packets, and uses a new pre-emption algorithm in order to keep the response time of voice requests at certain levels while the blocking of data req...
Interference suppression capability of faster than symbol rate sampling and frequency domain oversampling Balevi, Eren; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2016) Detection of symbols in the presence of many interference sources is a difficult task in wireless channels. It is obligatory to reduce the interference for reliable communication. In this dissertation, minimum mean square error (MMSE) detection is investigated to suppress interference. Faster Than Symbol Rate (FTSR) sampling and Frequency Domain Oversampling (FDO) methods are proposed to enhance the interference suppression level of MMSE detection for both single user and multiuser communication. The aim of...
Minimizing the Age of Information in Broadcast Wireless Networks Kadota, Igor; Uysal, Elif; Singh, Rahul; Modiano, Eytan (2016-09-30) We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. To the best of our knowledge, this is the first work to provide a scheduli...
Path planning and localization for mobile anchor based wireless sensor networks Erdemir, Ecenaz; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2017) In wireless sensor networks, sensors with limited resources are distributed in a wide area. Localizing the sensors is an important problem. Anchor nodes with known positions are used for sensor localization. A simple and efficient way of generating anchor nodes is to use mobile anchors which have built-in GPS units. In this thesis, a single mobile anchor is used to traverse the region of interest to communicate with the sensor nodes and identify their positions. Therefore planning the best trajectory for th...

Citation Formats

I. Kadota, A. Sinha, E. Uysal, R. Singh, and E. Modiano, “Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks,” IEEE-ACM TRANSACTIONS ON NETWORKING, pp. 2637–2650, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48938.