IEEE Transactions on Mobile Computing最新文献_第10页

REM: Enabling Real-Time Neural-Enhanced Video Streaming on Mobile Devices Using Macroblock-Aware Lookup Table

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-11 DOI: 10.1109/TMC.2024.3496443

Baili Chai;Di Wu;Jinyu Chen;Mengyu Yang;Zelong Wang;Miao Hu

{"title":"REM: Enabling Real-Time Neural-Enhanced Video Streaming on Mobile Devices Using Macroblock-Aware Lookup Table","authors":"Baili Chai;Di Wu;Jinyu Chen;Mengyu Yang;Zelong Wang;Miao Hu","doi":"10.1109/TMC.2024.3496443","DOIUrl":"https://doi.org/10.1109/TMC.2024.3496443","url":null,"abstract":"The demand for mobile video streaming has seen a substantial surge in recent years. However, current platforms heavily depend on network capacity to ensure the delivery of high-quality video streams. The emergence of neural-enhanced video streaming presents a promising solution to address this challenge by leveraging client-side computation, thereby reducing bandwidth consumption. Nonetheless, deploying advanced super-resolution (SR) models on mobile devices is hindered by the computational demands of existing SR models. In this paper, we propose REM, a novel neural-enhanced mobile video streaming framework. REM utilizes a customized lookup table to facilitate real-time neural-enhanced video streaming on mobile devices. Initially, we conduct a series of measurements to identify abundant macroblock redundancies across frames in a video stream. Subsequently, we introduce a dynamic macroblock selection algorithm that prioritizes important macroblocks for neural enhancement. The SR-enhanced results are stored in the lookup table and efficiently reused to meet real-time requirements and minimize resource overhead. By considering macroblock-level characteristics of the video frames, the lookup table enables efficient and fast processing. Additionally, we design a lightweight macroblock-aware SR module to expedite inference. Finally, we perform extensive experiments on various mobile devices. The results demonstrate that REM enhances overall processing throughput by up to 10.2 times and reduces power consumption by up to 58.6% compared to state-of-the-art methods. Consequently, this leads to a 38.06% improvement in the quality of experience for mobile users.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"2085-2097"},"PeriodicalIF":7.7,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143360915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enabling Feedback-Free MIMO Transmission for FD-RAN: A Data-Driven Approach

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-11 DOI: 10.1109/TMC.2024.3495719

Jingbo Liu;Jiacheng Chen;Zongxi Liu;Haibo Zhou

{"title":"Enabling Feedback-Free MIMO Transmission for FD-RAN: A Data-Driven Approach","authors":"Jingbo Liu;Jiacheng Chen;Zongxi Liu;Haibo Zhou","doi":"10.1109/TMC.2024.3495719","DOIUrl":"https://doi.org/10.1109/TMC.2024.3495719","url":null,"abstract":"To enhance flexibility and facilitate resource cooperation, a novel fully-decoupled radio access network (FD-RAN) architecture is proposed for 6G. However, the decoupling of uplink (UL) and downlink (DL) in FD-RAN makes the existing feedback mechanism ineffective. To this end, we propose an end-to-end data-driven MIMO solution without the conventional channel feedback procedure. Data-driven MIMO can alleviate the drawbacks of feedback including overheads and delay, and can provide customized precoding design for different BSs based on their historical channel data. It essentially learns a mapping from geolocation to MIMO transmission parameters. We first present a codebook-based approach, which selects transmission parameters from the statistics of discrete channel state information (CSI) values and utilizes nearest neighbor interpolation for spatial inference. We further present a non-codebook-based approach, which 1) derives the optimal precoder from the singular value decomposition (SVD) of the channel; 2) utilizes variational autoencoder (VAE) to select the representative precoder from the latent Gaussian representations; and 3) exploits Gaussian process regression (GPR) to predict unknown precoders in the space domain. Extensive simulations are performed on a link-level 5G simulator using realistic ray-tracing channel data. The results demonstrate the effectiveness of data-driven MIMO, showcasing its potential for application in FD-RAN and 6G.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"2437-2454"},"PeriodicalIF":7.7,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143361321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Delay- and Resource-Aware Satellite UPF Service Optimization

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-08 DOI: 10.1109/TMC.2024.3494043

Chao Wang;Xiao Ma;Ruolin Xing;Sisi Li;Ao Zhou;Shangguang Wang

{"title":"Delay- and Resource-Aware Satellite UPF Service Optimization","authors":"Chao Wang;Xiao Ma;Ruolin Xing;Sisi Li;Ao Zhou;Shangguang Wang","doi":"10.1109/TMC.2024.3494043","DOIUrl":"https://doi.org/10.1109/TMC.2024.3494043","url":null,"abstract":"Executing 5G core network functions on satellites has become crucial to enhance satellite network management and service capabilities. The User Plane Function (UPF) is responsible for efficient data traffic forwarding and is envisioned as a key and pioneering core network function that will be deployed on satellites. However, managing and providing services with satellite UPFs face dual challenges. Limited satellite resources constrain the user scale that a satellite UPF can service, resulting in an unguaranteed service delay. Moreover, the extremely rapid mobility of satellites renders it difficult for satellite UPFs to provide seamless services. To address the above challenges, this paper presents the first-of-its-kind service optimization scheme for satellite UPFs in terms of switch control, state migration, and traffic routing. To provide guaranteed service delay, we provide a theoretical analysis based on the M/G/1 queue model, demonstrating the service delay-resource consumption trade-off. A satellite UPF switch control scheme is integrated into the service optimization process, which can decrease satellite UPF service delay while saving satellite resources by adjusting the switch control parameters. To provide seamless services, we propose a satellite UPF-oriented state-aware service migration and traffic routing (UPF service optimization) algorithm. A policy network-based reinforcement learning approach is employed to dynamically perceive the satellite network’s state as well as the satellite UPF switch state. Building upon the optimization of service delay through satellite UPF switch control, the processes of state-aware state migration and traffic routing are further employed to reduce delay, ensuring seamless service effectively. Experiments reveal that the proposed algorithm outperforms other benchmark algorithms under different metrics. The service delay is reduced by an average of 23.2% compared with other algorithms.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 4","pages":"2564-2579"},"PeriodicalIF":7.7,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143564149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mixed Numerology-Based Intelligent Resource Management in a Sliced 6G Space–Terrestrial Integrated Radio Access Network 分片 6G 天地一体化无线接入网中基于混合数字技术的智能资源管理

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-08 DOI: 10.1109/TMC.2024.3494842

Ning Hui;Qian Sun;Jie Zeng;Lin Tian;Yuanyuan Wang;Yiqing Zhou

{"title":"Mixed Numerology-Based Intelligent Resource Management in a Sliced 6G Space–Terrestrial Integrated Radio Access Network","authors":"Ning Hui;Qian Sun;Jie Zeng;Lin Tian;Yuanyuan Wang;Yiqing Zhou","doi":"10.1109/TMC.2024.3494842","DOIUrl":"https://doi.org/10.1109/TMC.2024.3494842","url":null,"abstract":"Although resource sharing and mixed numerology among slices are promising for improving wireless resource utilization, these techniques can compromise isolation performance and cause serious inter numerology interference (INI). Therefore, this paper studies wireless resource management in a mixed numerology-based sliced 6G space–terrestrial integrated radio access network (STI-RAN) with the aim of reducing INI and guaranteeing isolation performance while decreasing interference from Doppler frequency shifts caused by the high-speed movement of low-orbit satellites. First, an isolation performance indicator is defined to evaluate different isolation performances, and a universal spectral distance model is formulated to rewrite the INI power model. Next, the dynamic wireless resource management problem is formulated in a discrete form, yielding a scheme called Flex-<inline-formula><tex-math>$mu$</tex-math></inline-formula>, which is designed to reduce the INI and Doppler frequency shifts, guarantee isolation performance, and enhance the SINR. Finally, an intelligent multi-characteristic matrix coding-based social group optimization (MultiMatrix-SGO) algorithm is designed to solve the proposed NP-hard discrete optimization problem. Compared with existing schemes, the system utility is efficiently increased by up to 58.32%, the SINR can converge to 38.44 dB, and the isolation performance is guaranteed while the INI and Doppler frequency shifts are reduced.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"1338-1356"},"PeriodicalIF":7.7,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Design and Implementation of a Light-Weight Channel Vector Classifier Based on Support Vector Machine for Real-Time 5G Beam Index Detection

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-08 DOI: 10.1109/TMC.2024.3494757

Juyeop Kim;Soomin Kwon;Jiyoon Han;Taegyeom Lee;Ohyun Jo

{"title":"Design and Implementation of a Light-Weight Channel Vector Classifier Based on Support Vector Machine for Real-Time 5G Beam Index Detection","authors":"Juyeop Kim;Soomin Kwon;Jiyoon Han;Taegyeom Lee;Ohyun Jo","doi":"10.1109/TMC.2024.3494757","DOIUrl":"https://doi.org/10.1109/TMC.2024.3494757","url":null,"abstract":"Machine Learning (ML) is recently considered a key technology for bringing outstanding performance to wireless communications. Conventional research has highlighted the potential of Support Vector Machines (SVMs), which train their model based on optimization theory, to enhance the performance of wireless communications. However, there are practical issues that makes SVM difficult to apply to a wireless communication system. SVM generally entails a heavy training process with high computational complexity, and the model requires a significant amount of time for training. Also, the entire dataset needs to be trained at once, requiring a substantial amount of memory for data storage. To enable SVM in wireless communications, we propose Real-Time Channel Vector Classifier (RTCVC), which employs a light-weight SVM model capable of training and processing incoming data in real-time. A novel input data pre-processing technique is implemented to reduce the computational overhead associated with calculating non-linear functions. The rearranged formulation of the original problem also allows each SVM sub-model to be trained distributively over time based on incremental parameters. For performance evaluation, we implement the RTCVC inter-operating with 5G beam index detection, whose detection probability has been theoretically proven to be significantly enhanced by SVM. The software modules of the RTCVC are based on LibSVM, a well-known open-source library for implementing SVM sub-models. The experimental results confirm that RTCVC significantly reduces training time while maintaining suitable performance for 5G beam index detection.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 4","pages":"2660-2672"},"PeriodicalIF":7.7,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143564144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exploring Long-Term Commensalism: Throughput Maximization for Symbiotic Radio Networks

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-08 DOI: 10.1109/TMC.2024.3495015

Yuzhe Chen;Yanjun Li;Chung Shue Chen;Kaikai Chi

{"title":"Exploring Long-Term Commensalism: Throughput Maximization for Symbiotic Radio Networks","authors":"Yuzhe Chen;Yanjun Li;Chung Shue Chen;Kaikai Chi","doi":"10.1109/TMC.2024.3495015","DOIUrl":"https://doi.org/10.1109/TMC.2024.3495015","url":null,"abstract":"Symbiotic radio (SR), combining the advantages of cognitive radio and ambient backscatter communication (AmBC), stands as a promising solution for spectrum-and-energy-efficient wireless communications. In an SR network, backscatter devices (BDs) share the spectrum resources with the primary transmitter (PT) by utilizing the incident radio frequency (RF) signal from PT for uplink non-orthogonal multiple access (NOMA) transmission. The primary receiver (PR) decodes the signals of PT and BDs via the successive interference cancellation (SIC) technique. Our goal is to establish a long-term commensalistic relationship between PT and BDs. We address the problem of maximizing the long-term average sum rate of BDs while ensuring a minimum average rate for the PT by optimizing the power reflection coefficients of the BDs. We explicitly consider practical constraints such as the required power difference among signals for SIC decoding and the unknown future channel state information (CSI). We prove the NP-hardness of the offline version of the problem and subsequently employ the Lyapunov optimization technique to convert the original problem into a series of sub-problems in each individual time slot that can be solved in an online manner without relying on future CSI. We then utilize the successive convex optimization (SCO) technique to solve the non-convex sub-problems. Extensive simulations validate that our proposed Lyapunov-SCO algorithm achieves superior performance in terms of the average sum rate of BDs while ensuring PT’s required average rate. In addition, we provide discussions on extending the proposed solution to SR networks with multiple PT-PR pairs, high-mobility BDs, and enhancing fairness among BDs.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"2376-2393"},"PeriodicalIF":7.7,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143360908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Collaborative Error Detection and Correction Scheme for Safety Message in V2X

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-08 DOI: 10.1109/TMC.2024.3494713

Hui Qian;Hongmei Chai;Ammar Hawbani;Yuanguo Bi;Na Lin;Liang Zhao

{"title":"A Collaborative Error Detection and Correction Scheme for Safety Message in V2X","authors":"Hui Qian;Hongmei Chai;Ammar Hawbani;Yuanguo Bi;Na Lin;Liang Zhao","doi":"10.1109/TMC.2024.3494713","DOIUrl":"https://doi.org/10.1109/TMC.2024.3494713","url":null,"abstract":"Vehicle-to-Everything (V2X) technology plays a pivotal role in enabling real-time traffic coordination and safety, warning, and decision support. Within V2X, the Basic Safety Message (BSM) serves as the core to transmit critical vehicle status, location, and intention information to provide a foundation for ensuring reliable traffic safety and coordination mechanisms. Data accuracy stands as a key to the effectiveness and reliability of the V2X system, in which the transmission of error data can potentially result in severe traffic accidents. During vehicular operation, sensors may generate error data owing to looseness or external conditions. However, immediate sensor replacement is often impractical or infeasible. Therefore, this paper introduces a collaborative scheme involving vehicles, Road Side Units (RSUs), and Data Center (DC) to jointly enhance the accuracy of vehicle-transmitted BSMs. Our scheme involves analyzing statistical features of vehicle driving information to detect error BSMs. Subsequently, these detected errors are corrected by leveraging historical data from the vehicle and its relative relationship with surrounding vehicles. In addition, we propose a time optimization method to reduce the average processing time of each data by RSUs. The extensive experimental results demonstrate that the proposed scheme can accurately detect error BSMs and effectively correct error BSMs. The entire scheme also meets the requisite computational latency requirements.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 4","pages":"2594-2611"},"PeriodicalIF":7.7,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143564148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient Missing Key Tag Identification in Large-Scale RFID Systems: An Iterative Verification and Selection Method

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-07 DOI: 10.1109/TMC.2024.3493597

Jiangjin Yin;Xin Xie;Hangyu Mao;Song Guo

{"title":"Efficient Missing Key Tag Identification in Large-Scale RFID Systems: An Iterative Verification and Selection Method","authors":"Jiangjin Yin;Xin Xie;Hangyu Mao;Song Guo","doi":"10.1109/TMC.2024.3493597","DOIUrl":"https://doi.org/10.1109/TMC.2024.3493597","url":null,"abstract":"Radio frequency identification (RFID) system has been extensively employed to track missing items by affixing them with RFID tags. Many practical applications require to efficiently identify missing events for a specific subset of system tags (called key tags) due to their elevated importance. Existing methods primarily aim to identify all tags, which makes it challenging to specifically identify key tags because of interference from other non-key tags (called ordinary tags). In light of this, several key tag identification methods follow a two-step scheme that filters ordinary tags first and then identifies key tags. Nevertheless, this wastes too much time on tag filtering, resulting in low time efficiency. This paper presents a novel missing key tag identification protocol with two creative designs to gain high efficiency. First, we develop a novel verification technique that can rapidly determine the presence or absence of key tags amid the scenarios with both key tags and ordinary ones. By combining the ON-OFF Keying modulation, we could verify multiple key tags in a single slot, thereby reducing the total slots required. Second, we design a new selection technique that efficiently selects the unverified key tags for further verification, while filtering out the verified key tags and irrelevant ordinary tags to avoid redundant data transmission. Additionally, we present an enhancement protocol that leverages a preselection technique to avoid collecting useless tag responses, further boosting efficiency. We carry out rigorous theoretical analysis to optimize the performance of the proposed protocols. Both simulations and practical experiments demonstrate that our method is markedly superior to state-of-the-art solutions.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"2253-2269"},"PeriodicalIF":7.7,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143360985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Joint Order Dispatching and Vehicle Repositioning for Dynamic Ridesharing

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-07 DOI: 10.1109/TMC.2024.3493974

Zhidan Liu;Guofeng Ouyang;Bolin Zhang;Bo Du;Chao Chen;Kaishun Wu

{"title":"Joint Order Dispatching and Vehicle Repositioning for Dynamic Ridesharing","authors":"Zhidan Liu;Guofeng Ouyang;Bolin Zhang;Bo Du;Chao Chen;Kaishun Wu","doi":"10.1109/TMC.2024.3493974","DOIUrl":"https://doi.org/10.1109/TMC.2024.3493974","url":null,"abstract":"Dynamic ridesharing has gained significant attention in recent years. However, existing ridesharing studies often focus on optimizing order dispatching and vehicle repositioning separately, leading to short-sighted decisions and underutilization of the ridesharing potential. In this paper, we propose a novel joint optimization framework called <inline-formula><tex-math>$mathtt {JODR}$</tex-math></inline-formula>. By coordinating order dispatching and vehicle repositioning, <inline-formula><tex-math>$mathtt {JODR}$</tex-math></inline-formula> enhances ridesharing efficiency while ensuring high-quality service. The core idea of <inline-formula><tex-math>$mathtt {JODR}$</tex-math></inline-formula> is to dispatch ride orders with high demand in specific mobility directions to vehicles with sufficient available capacity, effectively balancing future supply and demand in those directions. To achieve this, we introduce a novel mobility value function that can predict the long-term mobility value of matching an order with its travel direction. By considering orders’ directional mobility values, service quality assessments, and available vehicle capacities, <inline-formula><tex-math>$mathtt {JODR}$</tex-math></inline-formula> formulates the order dispatching as a minimum-cost maximum-flow problem to derive the optimal order-vehicle assignments. Furthermore, the value function helps the intelligent repositioning of idle vehicles. Extensive experiments conducted on a large real-world dataset demonstrate the superiority of <inline-formula><tex-math>$mathtt {JODR}$</tex-math></inline-formula> over state-of-the-art methods across various performance metrics. These experimental results validate the effectiveness of <inline-formula><tex-math>$mathtt {JODR}$</tex-math></inline-formula> in improving the ridesharing efficiency and experience.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 4","pages":"2628-2643"},"PeriodicalIF":7.7,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Adaptive Sampling for Age of Information in Non-Stationary Network Traffic

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2024-11-07 DOI: 10.1109/TMC.2024.3493592

Yifan Gu;Zhi Quan

{"title":"Adaptive Sampling for Age of Information in Non-Stationary Network Traffic","authors":"Yifan Gu;Zhi Quan","doi":"10.1109/TMC.2024.3493592","DOIUrl":"https://doi.org/10.1109/TMC.2024.3493592","url":null,"abstract":"Real-time status updates play an important role in low-latency cyber-physical systems, in which the real network traffic statistics (i.e., transmission delay and/or error rate) are often unknown and non-stationary. In such cases, short-time age-of-information (ST-AoI) is more crucial than long-term average AoI, because instantaneous high ST-AoI could lead to system failures even if the long-term average AoI is low. In this paper, we propose an adaptive sampling control (ASC) scheme to ensure a low ST-AoI outage probability, defined as the probability of the average AoI in each control cycle, i.e., over a limited number of packets, exceeding a given threshold. This ASC scheme does not rely on an explicit statistical model for the non-stationary traffic behaviors. It establishes a dynamic linearization data model with a pseudo-partial derivative (PPD) parameter to capture the unknown and non-stationary traffic statistics. By estimating the PPD parameter in each control cycle, ASC can determine the sampling rates to ensure an extremely low ST-AoI outage probability. Both numerical simulation and real-world experiment show that the proposed ASC scheme significantly outperforms existing methods, reducing the ST-AoI outage probability almost by half.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"2110-2123"},"PeriodicalIF":7.7,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143360919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0