A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network
Age of information (AoI) captures the freshness of information and has been used broadly as an important performance metric in big data analytics in the Internet of Things (IoT). We consider a general scenario where a meaningful piece of information consists of multiple packets and the information i...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9355162/ |
| _version_ | 1798002037552578560 |
|---|---|
| author | Mianlong Chen Kui Wu Linqi Song |
| author_facet | Mianlong Chen Kui Wu Linqi Song |
| author_sort | Mianlong Chen |
| collection | DOAJ |
| description | Age of information (AoI) captures the freshness of information and has been used broadly as an important performance metric in big data analytics in the Internet of Things (IoT). We consider a general scenario where a meaningful piece of information consists of multiple packets and the information is not complete until all related packets have been correctly received. Minimizing AoI in this general scenario is challenging in both scheduling algorithm design and theoretical analysis, because we need to track the history of received packets before a complete piece of information can be updated. We first analyse the necessary condition for optimal scheduling, based on which we present an optimal scheduling method. The optimal solution, however, has high time complexity. To address the problem, we investigate the problem with a special type of learning, i.e., learning in restless multi-armed bandits (RMAB), and propose a Whittle index-based scheduling method. We also propose a new transmission strategy based on erasure codes to improve the performance of scheduling policies in lossy networks. Performance evaluation results demonstrate that our solution outperforms other baseline policies such as greedy policy and naïve Whittle index policy in both lossless and lossy networks. |
| first_indexed | 2024-04-11T11:45:50Z |
| format | Article |
| id | doaj.art-bf345f5b54e74a26840db67def0ac619 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-11T11:45:50Z |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-bf345f5b54e74a26840db67def0ac6192022-12-22T04:25:35ZengIEEEIEEE Access2169-35362021-01-019314673148010.1109/ACCESS.2021.30599669355162A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT NetworkMianlong Chen0https://orcid.org/0000-0002-3047-451XKui Wu1https://orcid.org/0000-0002-2069-0032Linqi Song2https://orcid.org/0000-0003-2756-4984Department of Computer Science, University of Victoria, Victoria, BC, CanadaDepartment of Computer Science, University of Victoria, Victoria, BC, CanadaDepartment of Computer Science, City University of Hong Kong, Hong KongAge of information (AoI) captures the freshness of information and has been used broadly as an important performance metric in big data analytics in the Internet of Things (IoT). We consider a general scenario where a meaningful piece of information consists of multiple packets and the information is not complete until all related packets have been correctly received. Minimizing AoI in this general scenario is challenging in both scheduling algorithm design and theoretical analysis, because we need to track the history of received packets before a complete piece of information can be updated. We first analyse the necessary condition for optimal scheduling, based on which we present an optimal scheduling method. The optimal solution, however, has high time complexity. To address the problem, we investigate the problem with a special type of learning, i.e., learning in restless multi-armed bandits (RMAB), and propose a Whittle index-based scheduling method. We also propose a new transmission strategy based on erasure codes to improve the performance of scheduling policies in lossy networks. Performance evaluation results demonstrate that our solution outperforms other baseline policies such as greedy policy and naïve Whittle index policy in both lossless and lossy networks.https://ieeexplore.ieee.org/document/9355162/Age of information (AoI)multi-packet informationrestless multi-armed bandit |
| spellingShingle | Mianlong Chen Kui Wu Linqi Song A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network IEEE Access Age of information (AoI) multi-packet information restless multi-armed bandit |
| title | A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network |
| title_full | A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network |
| title_fullStr | A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network |
| title_full_unstemmed | A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network |
| title_short | A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network |
| title_sort | whittle index approach to minimizing age of multi packet information in iot network |
| topic | Age of information (AoI) multi-packet information restless multi-armed bandit |
| url | https://ieeexplore.ieee.org/document/9355162/ |
| work_keys_str_mv | AT mianlongchen awhittleindexapproachtominimizingageofmultipacketinformationiniotnetwork AT kuiwu awhittleindexapproachtominimizingageofmultipacketinformationiniotnetwork AT linqisong awhittleindexapproachtominimizingageofmultipacketinformationiniotnetwork AT mianlongchen whittleindexapproachtominimizingageofmultipacketinformationiniotnetwork AT kuiwu whittleindexapproachtominimizingageofmultipacketinformationiniotnetwork AT linqisong whittleindexapproachtominimizingageofmultipacketinformationiniotnetwork |