Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
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...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2020
|
| Online Access: | https://hdl.handle.net/1721.1/126308 |
| _version_ | 1826217080888754176 |
|---|---|
| author | Kadota, Igor Sinha, Abhishek Uysal-Biyikoglu, Elif Singh, Rahul Modiano, Eytan H |
| author2 | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
| author_facet | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Kadota, Igor Sinha, Abhishek Uysal-Biyikoglu, Elif Singh, Rahul Modiano, Eytan H |
| author_sort | Kadota, Igor |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T16:57:42Z |
| format | Article |
| id | mit-1721.1/126308 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T16:57:42Z |
| publishDate | 2020 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1263082022-09-29T22:42:57Z Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks Kadota, Igor Sinha, Abhishek Uysal-Biyikoglu, Elif Singh, Rahul Modiano, Eytan H Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Massachusetts Institute of Technology. Department of Aeronautics and Astronautics 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. National Science Foundation (U.S.) (Grant AST-1547331) National Science Foundation (U.S.) (Grant CNS-1713725) National Science Foundation (U.S.) (Grant CNS-1701964) United States. Army Research Office (Grant W911NF-17-1-0508) 2020-07-22T14:47:33Z 2020-07-22T14:47:33Z 2018-12 2019-10-30T15:53:02Z Article http://purl.org/eprint/type/JournalArticle 1063-6692 https://hdl.handle.net/1721.1/126308 Kadota, Igor et al. “Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks.” IEEE/ACM Transactions on Networking, vol. 26, no. 6, 2018, pp. 2637 - 2650 © 2018 The Author(s) en 10.1109/TNET.2018.2873606 IEEE/ACM Transactions on Networking Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Kadota, Igor Sinha, Abhishek Uysal-Biyikoglu, Elif Singh, Rahul Modiano, Eytan H Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks |
| title | Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks |
| title_full | Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks |
| title_fullStr | Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks |
| title_full_unstemmed | Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks |
| title_short | Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks |
| title_sort | scheduling policies for minimizing age of information in broadcast wireless networks |
| url | https://hdl.handle.net/1721.1/126308 |
| work_keys_str_mv | AT kadotaigor schedulingpoliciesforminimizingageofinformationinbroadcastwirelessnetworks AT sinhaabhishek schedulingpoliciesforminimizingageofinformationinbroadcastwirelessnetworks AT uysalbiyikogluelif schedulingpoliciesforminimizingageofinformationinbroadcastwirelessnetworks AT singhrahul schedulingpoliciesforminimizingageofinformationinbroadcastwirelessnetworks AT modianoeytanh schedulingpoliciesforminimizingageofinformationinbroadcastwirelessnetworks |