Optimizing Random Access for Information Freshness in Spatially Distributed Wireless Networks
We analyze Age of Information (AoI) in wireless networks where nodes use a spatially adaptive random access scheme to send status updates to a central base station. We show that the set of achievable AoI in this setting is convex, and design policies to minimize weighted sum, min-max, and proportion...
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2023
|
Online Access: | https://hdl.handle.net/1721.1/147292 |
_version_ | 1811080311921967104 |
---|---|
author | Jones, Nicholas |
author2 | Modiano, Eytan |
author_facet | Modiano, Eytan Jones, Nicholas |
author_sort | Jones, Nicholas |
collection | MIT |
description | We analyze Age of Information (AoI) in wireless networks where nodes use a spatially adaptive random access scheme to send status updates to a central base station. We show that the set of achievable AoI in this setting is convex, and design policies to minimize weighted sum, min-max, and proportionally fair AoI by setting transmission probabilities as a function of node locations. We show that under the capture model, when the spatial topology of the network is considered, AoI can be significantly improved, and we obtain tight performance bounds on weighted sum and min-max AoI. Finally, we design a policy where each node sets its transmission probability based only on its own distance from the base station, when it does not know the positions of other nodes, and show that it converges to the optimal proportionally fair policy as the size of the network goes to infinity. |
first_indexed | 2024-09-23T11:29:07Z |
format | Thesis |
id | mit-1721.1/147292 |
institution | Massachusetts Institute of Technology |
last_indexed | 2024-09-23T11:29:07Z |
publishDate | 2023 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/1472922023-01-20T03:39:00Z Optimizing Random Access for Information Freshness in Spatially Distributed Wireless Networks Jones, Nicholas Modiano, Eytan Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science We analyze Age of Information (AoI) in wireless networks where nodes use a spatially adaptive random access scheme to send status updates to a central base station. We show that the set of achievable AoI in this setting is convex, and design policies to minimize weighted sum, min-max, and proportionally fair AoI by setting transmission probabilities as a function of node locations. We show that under the capture model, when the spatial topology of the network is considered, AoI can be significantly improved, and we obtain tight performance bounds on weighted sum and min-max AoI. Finally, we design a policy where each node sets its transmission probability based only on its own distance from the base station, when it does not know the positions of other nodes, and show that it converges to the optimal proportionally fair policy as the size of the network goes to infinity. S.M. 2023-01-19T18:43:25Z 2023-01-19T18:43:25Z 2022-09 2022-10-19T18:57:34.907Z Thesis https://hdl.handle.net/1721.1/147292 0000-0003-4607-5406 In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/ application/pdf Massachusetts Institute of Technology |
spellingShingle | Jones, Nicholas Optimizing Random Access for Information Freshness in Spatially Distributed Wireless Networks |
title | Optimizing Random Access for Information
Freshness in Spatially Distributed Wireless Networks |
title_full | Optimizing Random Access for Information
Freshness in Spatially Distributed Wireless Networks |
title_fullStr | Optimizing Random Access for Information
Freshness in Spatially Distributed Wireless Networks |
title_full_unstemmed | Optimizing Random Access for Information
Freshness in Spatially Distributed Wireless Networks |
title_short | Optimizing Random Access for Information
Freshness in Spatially Distributed Wireless Networks |
title_sort | optimizing random access for information freshness in spatially distributed wireless networks |
url | https://hdl.handle.net/1721.1/147292 |
work_keys_str_mv | AT jonesnicholas optimizingrandomaccessforinformationfreshnessinspatiallydistributedwirelessnetworks |