Yinyu Wu;Xuhui Zhang;Jinke Ren;Huijun Xing;Yanyan Shen;Shuguang Cui
{"title":"Latency-Aware Resource Allocation for Mobile Edge Generation and Computing via Deep Reinforcement Learning","authors":"Yinyu Wu;Xuhui Zhang;Jinke Ren;Huijun Xing;Yanyan Shen;Shuguang Cui","doi":"10.1109/LNET.2024.3486194","DOIUrl":"https://doi.org/10.1109/LNET.2024.3486194","url":null,"abstract":"Recently, the integration of mobile edge computing (MEC) and generative artificial intelligence (GAI) technology has given rise to a new area called mobile edge generation and computing (MEGC), which offers mobile users heterogeneous services such as task computing and content generation. In this letter, we investigate the joint communication, computation, and the AIGC resource allocation problem in an MEGC system. A latency minimization problem is first formulated to enhance the quality of service for mobile users. Due to the strong coupling of the optimization variables, we propose a new deep reinforcement learning-based algorithm to solve it efficiently, Numerical results demonstrate that the proposed algorithm can achieve lower latency than several baseline algorithms.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 4","pages":"237-241"},"PeriodicalIF":0.0,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yantao Li;Shijun Ling;Hongyu Huang;Feno H. Rabevohitra
{"title":"Progressive Growth-Based Momentum Contrast for Unsupervised Representative Learning in Classification Tasks","authors":"Yantao Li;Shijun Ling;Hongyu Huang;Feno H. Rabevohitra","doi":"10.1109/LNET.2024.3482295","DOIUrl":"https://doi.org/10.1109/LNET.2024.3482295","url":null,"abstract":"Contrastive unsupervised learning has made significant progress, but there is still potential for improvement by capturing finer details in input data. In this letter, we present PGMoCo, a Progressive Growth-based Momentum Contrast framework for unsupervised representative learning in classification tasks. PGMoCo begins by learning the overall distribution of samples at a coarse scale and progressively refines the representation by incorporating increasingly finer details. PGMoCo consists of data augmentation, progressive growth, an alternative multilayer perceptron (MLP) head, and a loss function. First, PGMoCo applies transformation-based data augmentation to the input samples. Then, it progressively learns features at multiple scales, uses an alternative MLP head to project latent representations into a contrastive loss space, and finally employs a specialized loss function to classify the samples. We evaluate PGMoCo on three datasets: CIFAR-10 and PolyU Palmprint (image classification) and H-MOG (person identification). PGMoCo achieves classification accuracies of 86.76% on CIFAR-10, 95.94% on PolyU Palmprint, and 80.10% on H-MOG, outperforming existing state-of-the-art methods.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"31-35"},"PeriodicalIF":0.0,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Viewport Prediction via Adaptive Edge Offloading","authors":"Ahmet Gunhan Aydin;Haris Vikalo","doi":"10.1109/LNET.2024.3480149","DOIUrl":"https://doi.org/10.1109/LNET.2024.3480149","url":null,"abstract":"The pursuit of enhanced interactive visual experiences has created growing interest in 360-degree video streaming. However, transmitting such content requires significant bandwidth compared to conventional planar video, motivating a search for effective bandwidth optimization strategies. A promising approach involves predicting viewport and prioritizing transmission of the regions of interest at higher quality. The existing methods for viewport prediction rely on sophisticated neural networks hosted on servers and face major bandwidth and latency challenges. This letter proposes a hierarchical approach to viewport prediction that leverages a small model on edge devices and offloads to the server only the most challenging tasks. The offloading algorithm relies on rate control to maximize the performance while meeting resource constraints, presenting a novel solution to bandwidth-efficient viewport prediction for 360-degree video streaming.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"21-25"},"PeriodicalIF":0.0,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decentralized Coded Caching With Distributed Storage Across Data and Parity Servers","authors":"Monolina Dutta;Anoop Thomas;Frank Y. Li","doi":"10.1109/LNET.2024.3479914","DOIUrl":"https://doi.org/10.1109/LNET.2024.3479914","url":null,"abstract":"Traditional single server based coded caching may face server saturation and service vulnerability problems. In this letter, we integrate decentralized coded caching with a multi-server architecture comprising both data and parity servers. For file distribution in this network, a method referred to as file stripping is adopted, and a novel file delivery scheme is proposed. Closed-form expressions for the total transmission rate achieved by this scheme are derived, considering all the operational servers along with the worst-case transmission rate amongst these servers. Additionally, a comparative analysis between the proposed scheme and the conventional decentralized coded caching scheme is presented. The simulation results demonstrate the viability of our proposed scheme.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"26-30"},"PeriodicalIF":0.0,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive Compression of Massive MIMO Channel State Information With Deep Learning","authors":"Faris B. Mismar;Aliye Özge Kaya","doi":"10.1109/LNET.2024.3475269","DOIUrl":"https://doi.org/10.1109/LNET.2024.3475269","url":null,"abstract":"This letter proposes the use of deep autoencoders to compress the channel information in a massive multiple input and multiple output (MIMO) system. Although autoencoders perform lossy compression, they still have adequate usefulness when applied to massive MIMO system channel state information (CSI) compression. To demonstrate their impact on the CSI, we measure the performance of the system under two different channel models for different compression ratios. We disclose a few practical considerations in using autoencoders for this propose. We show through simulation that the run-time complexity of this deep autoencoder is irrelative to the compression ratio and thus an adaptive compression rate is feasible with an optimal compression ratio depending on the channel model and the signal to noise ratio.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 4","pages":"267-271"},"PeriodicalIF":0.0,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rashika Raina;David E. Simmons;Nidhi Simmons;Michel Daoud Yacoub
{"title":"Optimal Classifier for an ML-Assisted Resource Allocation in Wireless Communications","authors":"Rashika Raina;David E. Simmons;Nidhi Simmons;Michel Daoud Yacoub","doi":"10.1109/LNET.2024.3474253","DOIUrl":"https://doi.org/10.1109/LNET.2024.3474253","url":null,"abstract":"This letter advances on the outage probability (OP) performance of a machine learning (ML)-assisted single-user multi-resource system. We focus on OP optimality and the trade-off between outage improvement and the mean number of resources scanned until a suitable resource is captured. We first present expressions for the OP of this system, complemented by an outage loss function (OLF) for its minimization. We then derive: (i) the necessary and sufficient properties of an optimal model (OpM) and (ii) expressions for the average number of resources scanned by both OpM and non-OpMs. Here, non-OpMs refer to those trained with the OLF and binary cross entropy (BCE) loss functions. We establish that optimal performance requires a channel that exhibits no time decorrelation properties. For very high decorrelation values, we find that models trained using the OLF and BCE perform similarly. For intermediate (practical) decorrelation values, OLF outperforms BCE, and both approach the OpM as decorrelation tends to zero. Our analysis further reveals that, to be able to capture a suitable resource, models trained with the OLF scan a slightly higher number of resources than the OpM and those trained with BCE. This increase in the mean number of scanned resources is offset by a significant enhancement in the OP as compared to BCE.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"158-162"},"PeriodicalIF":0.0,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10705105","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Weibiao Tian;Ye Li;Jinwei Zhao;Sheng Wu;Jianping Pan
{"title":"An eBPF-Based Trace-Driven Emulation Method for Satellite Networks","authors":"Weibiao Tian;Ye Li;Jinwei Zhao;Sheng Wu;Jianping Pan","doi":"10.1109/LNET.2024.3472034","DOIUrl":"https://doi.org/10.1109/LNET.2024.3472034","url":null,"abstract":"System-level performance evaluation over satellite networks often requires a simulated or emulated environment for reproducibility and low cost. However, the existing tools may not meet the needs for scenarios such as the low-earth orbit (LEO) satellite networks. To address the problem, this letter proposes and implements a trace-driven emulation method based on Linux’s eBPF technology. Building a Starlink traces collection system, we demonstrate that the method can effectively and efficiently emulate the connection conditions, and therefore provides a means for evaluating applications on local hosts.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 3","pages":"188-192"},"PeriodicalIF":0.0,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bayesian Optimization Framework for Channel Simulation-Based Base Station Placement and Transmission Power Design","authors":"Koya Sato;Katsuya Suto","doi":"10.1109/LNET.2024.3469175","DOIUrl":"https://doi.org/10.1109/LNET.2024.3469175","url":null,"abstract":"This letter proposes an adaptive experimental design framework for a channel-simulation-based base station (BS) design that supports the joint optimization of transmission power and placement. We consider a system in which multiple transmitters provide wireless services over a shared frequency band. Our objective is to maximize the average throughput within an area of interest. System operators can design the system configurations prior to deployment by iterating them through channel simulations and updating the parameters. However, accurate channel simulations are computationally expensive; therefore, it is preferable to configure the system using a limited number of simulation iterations. We develop a solver for the problem based on Bayesian optimization (BO), a black-box optimization method. The numerical results demonstrate that our proposed framework can achieve 18-22% higher throughput performance than conventional placement and power optimization strategies.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 4","pages":"217-221"},"PeriodicalIF":0.0,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10697138","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}