IEEE Networking Letters最新文献_第6页

Optimized Resource Orchestration for CS-Enabled SHM in LoRa Networks LoRa网络中支持cs的SHM资源编排优化

IF 3.3

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-02-18 DOI: 10.1109/LNET.2026.3666045

Igor Bisio;Chiara Garibotto;Fabio Lavagetto;Andrea Sciarrone;Matteo Zerbino

引用次数: 0

HSB-D2DStream: A Hybrid Semantic–Bit Communication Framework for Multi-User Live Video Streaming Over D2D Networks hsb -D2D流：D2D网络上多用户实时视频流的混合语义位通信框架

IF 3.3

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-03-11 DOI: 10.1109/LNET.2026.3672779

Hui Chen;Xingyu Yuan;Chu-Fu Wang;He Li

{"title":"HSB-D2DStream: A Hybrid Semantic–Bit Communication Framework for Multi-User Live Video Streaming Over D2D Networks","authors":"Hui Chen;Xingyu Yuan;Chu-Fu Wang;He Li","doi":"10.1109/LNET.2026.3672779","DOIUrl":"https://doi.org/10.1109/LNET.2026.3672779","url":null,"abstract":"With the explosive growth of mobile video services and live streaming applications, future wireless networks face increasing pressure to deliver high-quality multimedia content under limited bandwidth and dynamic network conditions. Device-to-device (D2D) communication offers a promising solution by enabling direct content exchange among nearby users and alleviating backhaul congestion. However, existing D2D caching and streaming schemes often neglect the stringent delay, jitter, and throughput requirements inherent to video transmission, as well as the unique characteristics of semantic communication (SemCom), where meaning fidelity depends on knowledge matching between the transmitter and receiver. To address these challenges, this letter proposes HSB-D2DStream, a Hybrid Semantic–Bit D2D Streaming Algorithm for multi-user live video delivery in cache-enabled D2D networks. The base station (BS) selectively caches video chunks to a subset of users, which then disseminate content to others through optimized multi-hop D2D links. Each user dynamically selects between semantic and bit-level transmission modes based on its required video quality and background knowledge alignment. The proposed algorithm jointly optimizes user clustering, cache node selection, and D2D topology to maximize overall Quality of Service (QoS) while satisfying constraints on delay, jitter, and error rate.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"204-208"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148493151","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}

引用次数: 0

Execution-Time Valid Control for Dynamic LEO Satellite Networks 动态LEO卫星网络的执行时间有效控制

IF 3.3

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-03-19 DOI: 10.1109/LNET.2026.3694836

Mahmoud Sami;Mohammed Atiquzzaman

引用次数: 0

A Low-Latency Post-Quantum Group Authentication Framework for VANETs 一种用于vanet的低延迟后量子组认证框架

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-02-20 DOI: 10.1109/LNET.2026.3666683

Ashutosh Kumar;Manik Malhotra;A. Anjali;Amrendra Singh Yadav

{"title":"A Low-Latency Post-Quantum Group Authentication Framework for VANETs","authors":"Ashutosh Kumar;Manik Malhotra;A. Anjali;Amrendra Singh Yadav","doi":"10.1109/LNET.2026.3666683","DOIUrl":"https://doi.org/10.1109/LNET.2026.3666683","url":null,"abstract":"Vehicular Ad Hoc Networks (VANETs) require ultra-low-latency authentication in high-mobility scenarios, decentralized trust, and emerging post-quantum security threats. This letter proposes a lightweight blockchain-assisted group authentication framework that integrates post-quantum cryptography with decentralized trust management. The scheme leverages CRYSTALS-Kyber for secure group key distribution, CRYSTALS-Dilithium for message authentication, and zero-knowledge proofs to achieve conditional anonymity and unlinkability. A permissioned Hyperledger Besu blockchain logs encrypted group keys and dynamically updated roadside unit reputation scores, enabling scalable and accountable authentication without monetary transaction overhead. Formal security analysis under the Dolev–Yao adversary model demonstrates confidentiality, authentication, replay resistance, and unlinkability based on standard post-quantum assumptions. Performance evaluation using OMNeT++ and SUMO shows up to 52.7% reduction in communication overhead and a group key update latency of 1.2 ms in dense traffic scenarios, while maintaining high throughput and effective Sybil attack detection. These results highlight the practicality of the proposed framework for post-quantum secure VANET authentication.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"125-129"},"PeriodicalIF":0.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147665465","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}

引用次数: 0

FORCE: Federated Orthogonality-Aware Low-Rank Adaptation for Communication-Efficient Fine-Tuning FORCE：用于通信高效微调的联邦正交感知低秩自适应

IF 3.3

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-06-24 DOI: 10.1109/LNET.2026.3706755

Quan V. La;Junming Huang;Huy N. Le;Phuong Tran;Tung A. Nguyen;Phuong L. Vo;Bing B. Zhou;Nguyen H. Tran

{"title":"FORCE: Federated Orthogonality-Aware Low-Rank Adaptation for Communication-Efficient Fine-Tuning","authors":"Quan V. La;Junming Huang;Huy N. Le;Phuong Tran;Tung A. Nguyen;Phuong L. Vo;Bing B. Zhou;Nguyen H. Tran","doi":"10.1109/LNET.2026.3706755","DOIUrl":"https://doi.org/10.1109/LNET.2026.3706755","url":null,"abstract":"Federated fine-tuning of Large Language Models (LLMs) is fundamentally bottlenecked by the uplink communication capacity of edge networks. While Parameter-Efficient Fine-Tuning (PEFT) methods such as Low-Rank Adaptation (LoRA) reduce the payload by representing a dense <inline-formula> <tex-math>$dtimes k$ </tex-math></inline-formula> update with rank-<inline-formula> <tex-math>$r$ </tex-math></inline-formula> factors, they may suffer from subspace interference when aggregated across highly heterogeneous clients. In this letter, we propose <sc>FORCE</small>, a communication-efficient federated adaptation framework. Inspired by the philosophy of magnitude-direction decoupling, <sc>FORCE</small> introduces a local <italic>“project-and-compress”</i> geometric heuristic. Rather than transmitting dense orthogonal matrices, clients apply a lightweight 1-step gradient correction to align their low-rank updates toward an approximate orthonormal target before server aggregation, while preserving the <inline-formula> <tex-math>$mathcal {O}(r(d+k))$ </tex-math></inline-formula> low-rank communication budget. Empirical results demonstrate that <sc>FORCE</small> safely preserves model capacity in balanced networks and significantly mitigates performance degradation.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"325-328"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148837131","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}

引用次数: 0

CVaR-Constrained Lyapunov Scheduling for Downlink Finite-Blocklength URLLC 下行有限块长度URLLC的cvar约束Lyapunov调度

IF 3.3

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-07-08 DOI: 10.1109/LNET.2026.3711514

Vitawat Sittakul;Iacovos Ioannou;Prabagarane Nagaradjane;Wai Yie Leong;Trong-Minh Hoang;Vasos Vassiliou

{"title":"CVaR-Constrained Lyapunov Scheduling for Downlink Finite-Blocklength URLLC","authors":"Vitawat Sittakul;Iacovos Ioannou;Prabagarane Nagaradjane;Wai Yie Leong;Trong-Minh Hoang;Vasos Vassiliou","doi":"10.1109/LNET.2026.3711514","DOIUrl":"https://doi.org/10.1109/LNET.2026.3711514","url":null,"abstract":"Ultra-reliable low-latency communication (URLLC) requires short-packet transmission under stringent latency and reliability constraints, where rare delay excursions may dominate service failure. This letter investigates a risk-aware downlink scheduler for finite-blocklength (FBL) URLLC with random packet arrivals and block-error events. A Conditional Value-at-Risk (CVaR) constraint is embedded into Lyapunov drift-plus-penalty optimization by constructing a virtual tail-risk queue, which converts long-term tail-delay control into a queue-stability condition. The scheduler jointly determines transmit power and block length under per-slot power and channel-use constraints, and the resulting non-convex problem is handled via a convexified alternating procedure with a water-filling-like power update and projected block-length refinement. Simulations with 10 URLLC users show that the proposed policy reduces the average delay by about 23% and the empirical <inline-formula> <tex-math>$mathop {mathrm {CVaR}}nolimits _{0.99999}$ </tex-math></inline-formula> delay by 20–27% compared with a risk-neutral Lyapunov baseline, while maintaining bounded virtual backlog.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"334-338"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148837134","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}

引用次数: 0

Management and Optimization of xApp and Near-Real-Time RIC Deployment in the Edge xApp和边缘近实时RIC部署的管理和优化

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-02-12 DOI: 10.1109/LNET.2026.3664166

Juan Luis Herrera;Sofia Montebugnoli;Paolo Bellavista;Luca Foschini

引用次数: 0

End-to-End Achievable Rate Maximized Resource Allocation in IRS-Aided IAB Network: A Multi-Agents DRL Framework-Based Scheme irs辅助IAB网络中端到端可实现速率最大化的资源分配：一种基于多代理DRL框架的方案

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-03-02 DOI: 10.1109/LNET.2026.3669091

Zhongyu Ma;Zhirong Liu;Jing Li;Guangjie Han;Qun Guo

引用次数: 0

Audio Physical Dynamics Inspired Deepfake Detection for Voice Authentication Systems 音频物理动力学启发深度伪造检测语音认证系统

IF 3.3

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-08-20 DOI: 10.1109/LNET.2026.3725616

Alireza Mohammadi;Keshav Sood;Dhananjay Thiruvady;Asef Nazari

引用次数: 0

Performance Analysis of User Altitude Influence on the EMF Exposure From Earth Station to Satellite Communications 用户海拔对地面站对卫星通信电磁场暴露影响的性能分析

IF 3.3

IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-06-18 DOI: 10.1109/LNET.2026.3705053

Yujie Qin;Mustafa A. Kishk;Ahmed Elzanaty;Luca Chiaraviglio;Mohamed-Slim Alouini

{"title":"Performance Analysis of User Altitude Influence on the EMF Exposure From Earth Station to Satellite Communications","authors":"Yujie Qin;Mustafa A. Kishk;Ahmed Elzanaty;Luca Chiaraviglio;Mohamed-Slim Alouini","doi":"10.1109/LNET.2026.3705053","DOIUrl":"https://doi.org/10.1109/LNET.2026.3705053","url":null,"abstract":"Integrating satellites into current communication networks is expected to bridge the digital divide. However, when Earth stations (or ground stations) communicate with nearby satellites, they generate significant power, leading to potential electromagnetic field (EMF) exposure for nearby humans: humans may experience either mainlobe or sidelobe exposure from the feeder link of Earth stations, which depends on user altitudes and the satellite positions. To analyze the EMF exposure from feeder link of Earth stations to satellites, we utilize tools from stochastic geometry to model the locations of the Earth stations and satellites, and capture the impact of user altitude on the EMF exposure. Initially, we analyze the angle between the user and the mainlobe from the antenna array of Earth stations, which corresponds to the angle between satellites and users. Subsequently, we compute the mean exposure index (EI), a commonly used performance metric in EMF exposure analysis, as well as the percentiles of the EI. Our numerical results demonstrate that increasing user altitude generally reduces the mean EI due to weaker alignment with Earth-station mainlobes, while percentile analysis reveals that high-exposure events may still occur under dense satellite deployments.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"358-362"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148836905","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}

引用次数: 0