Wasin Meesena;Chanikarn Nikunram;Stephen John Turner;Sucha Supittayapornpong
{"title":"Minimizing Age of Processed Information Over Unreliable Wireless Network Channels","authors":"Wasin Meesena;Chanikarn Nikunram;Stephen John Turner;Sucha Supittayapornpong","doi":"10.1109/TMC.2024.3520913","DOIUrl":null,"url":null,"abstract":"The freshness of real-time status processing of time-sensitive information is crucial for many applications, including flight control, image processing, and autonomous vehicles. In this paper, unprocessed information is sent from sensors to a base station over a shared, unreliable wireless network. The base station has a set of dedicated non-preemptive processors with constant processing times to process information from each sensor. The age of processed information is the time elapsed since the generation of the packet that the processor most recently processed. Our objective is to minimize the expected weighted sum of this age over an infinite time horizon. Here, the challenge is the coupling between a scheduling problem under unreliable communications and the processing times. We first break the coupling by tracking the age of information during processing and derive a lower performance bound of the objective. We then design a stationary randomized policy and a Max-Weight policy for two queueing disciplines: no queues and single-packet queues to achieve our objective. We prove that these policies achieve performance within a factor of two from the optimal. In addition, we prove queues are useful to the stationary randomized policies in highly unreliable or large network settings. Our analytical results are further validated by numerical experiments.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 5","pages":"3567-3578"},"PeriodicalIF":7.7000,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10811871/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
The freshness of real-time status processing of time-sensitive information is crucial for many applications, including flight control, image processing, and autonomous vehicles. In this paper, unprocessed information is sent from sensors to a base station over a shared, unreliable wireless network. The base station has a set of dedicated non-preemptive processors with constant processing times to process information from each sensor. The age of processed information is the time elapsed since the generation of the packet that the processor most recently processed. Our objective is to minimize the expected weighted sum of this age over an infinite time horizon. Here, the challenge is the coupling between a scheduling problem under unreliable communications and the processing times. We first break the coupling by tracking the age of information during processing and derive a lower performance bound of the objective. We then design a stationary randomized policy and a Max-Weight policy for two queueing disciplines: no queues and single-packet queues to achieve our objective. We prove that these policies achieve performance within a factor of two from the optimal. In addition, we prove queues are useful to the stationary randomized policies in highly unreliable or large network settings. Our analytical results are further validated by numerical experiments.
期刊介绍:
IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.