AoI and Throughput Tradeoffs in Routing-aware Multi-hop Wireless Networks
Jiadong Lou, Xu Yuan, Sastry Kompella, Nian-Feng Tzeng
Abstract
The Age-of-Information (AoI) is a newly introduced metric for capturing information updating timeliness, as opposed to the network throughput, which is a conventional performance metric to measure the network transmission speed and robustness as a whole. While considerable work has addressed either optimal AoI or throughput individually, the inherent relationships between the two performance metrics are yet to be explored, especially in multi-hop networks. In this paper, we explore their relationships in multi-hop networks for the very first time, particularly focusing on the impacts of flexible routes on the two metrics. By developing a rigorous mathematical model with interference, channel allocation, link scheduling, and routing path selection taken into consideration, we build the interrelation between AoI and throughput in multi-hop networks. A multi-criteria optimization problem is formulated with the goal of simultaneously minimizing AoI and maximizing network throughput. To solve this problem, we resort to a novel approach by transforming the multi-criteria problem into a single objective one so as to find the weakly Pareto-optimal points iteratively, thereby allowing us to screen all Pareto-optimal points for the solution. A new algorithm based on the piece-wise linearization technique is then developed to closely linearize the non-linear terms in the single objective problem via their linear approximation segments to make it solvable. We formally prove that our algorithms can find all Pareto-optimal points in a finite number of iterations. From simulation results, we identify the tradeoff points of the optimal AoI and throughput, demonstrating that one performance metric improves at the expense of degrading the other, with the routing path found as one of the key factors in determining such a tradeoff.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 59e1fc53-d893-4fce-8041-0bf72c231261Cited by top-tier papers1
Ask how each one uses itRelated papers
- An Analytical Approach for Minimizing the Age of Information in a Practical CSMA NetworkSuyang Wang, Oluwaseun T. Ajayi, Yu ChengINFOCOM 2024 · 8 citations
- On the Minimum Achievable Age of Information for General Service-Time DistributionsJaya Prakash Champati, Ramana Reddy Avula, Tobias J. Oechtering, James GrossINFOCOM 2020 · 16 citations
- Minimizing Age of Information for Underwater Optical Wireless Sensor NetworksYu Tian, Lei Wang, Chi Lin, Yang Chi et al.INFOCOM 2023 · 7 citations
- Work or Sleep: Freshness-Aware Energy Scheduling for Wireless Powered Communication Networks with Interference ConsiderationLing Lin, Lei Ju, Chun Jason Xue, Mingliang Zhou et al.DAC 2023 · 1 citation
- Ao2I: Minimizing Age of Outdated Information to Improve Freshness in Data CollectionQingyu Liu, Chengzhang Li, Y. Thomas Hou, Wenjing Lou et al.INFOCOM 2022 · 32 citations
