发布求助
文献互助 智能选刊 最新文献

IEEE Networking Letters最新文献

筛选
英文 中文
From TVG Specification to Timed CPN Execution: A Mechanism-Based Model for Dynamic LEO Topologies 从TVG规范到定时CPN执行：动态LEO拓扑的基于机制的模型
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-04-08 DOI: 10.1109/LNET.2026.3682109
Jinze Li;Xinsheng Zhao
{"title":"From TVG Specification to Timed CPN Execution: A Mechanism-Based Model for Dynamic LEO Topologies","authors":"Jinze Li;Xinsheng Zhao","doi":"10.1109/LNET.2026.3682109","DOIUrl":"https://doi.org/10.1109/LNET.2026.3682109","url":null,"abstract":"Modeling the highly dynamic topology of Low Earth Orbit (LEO) mega-constellations requires models that link high-level mathematical specification with executable dynamics and admit formal verification. Time-varying graphs (TVGs) provide such a specification but lack unified execution semantics, and snapshot-based implementations suffer from sampling artifacts that can endanger routing reliability. This letter proposes a mechanism-based timed Colored Petri Net (CPN) execution model that extends the TVG specification with a verifiable “time–attribute–topology” state-transition pipeline while preserving connectivity semantics. By deriving P-invariants and analyzing the state space of a minimal kernel instantiation, we formally analyze the model and show that it satisfies structural consistency, boundedness, and deadlock-freedom. An Iridium-like case study shows that the event-driven CPN execution matches a 1-s fixed-step baseline, eliminates snapshot-induced visibility artifacts, and enables zero-preprocessing simulation as a verification-ready topology engine.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"249-252"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442831","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
A 5G-NR LDPC Decoder With Optimal-NMS Technique for Free-Space Optical Communication 基于最优nms技术的自由空间光通信5G-NR LDPC解码器
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-07-13 DOI: 10.1109/LNET.2026.3712775
Chandra Shekhar;A Arockia Bazil Raj;N. Rajesh Pillai
{"title":"A 5G-NR LDPC Decoder With Optimal-NMS Technique for Free-Space Optical Communication","authors":"Chandra Shekhar;A Arockia Bazil Raj;N. Rajesh Pillai","doi":"10.1109/LNET.2026.3712775","DOIUrl":"https://doi.org/10.1109/LNET.2026.3712775","url":null,"abstract":"In order to obtain the full potential of free-space optical (FSO) communication technology in 5G new-radio (5G-NR), incorporating an optimal forward error correction (FEC) technique becomes significant. A complexity reduced, accurate, & optimal normalized min-sum (ONMS) based LDPC decoder is proposed and its decoding capability is examined with clear, moderate, & strong FSO-channel conditions. Open-field <inline-formula> <tex-math>$5;km$ </tex-math></inline-formula> data-link FSO communication experiments are conducted and the targeted BER of <inline-formula> <tex-math>$10^{-7}$ </tex-math></inline-formula> is maintained even in strong outdoor FSO-channel just with SNR of <inline-formula> <tex-math>$10;dB$ </tex-math></inline-formula>. The proposed ONMS decoder technique, considered FSO-channel models, FSO communication test-bed and experimental results are detailed, analyzed and reported.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"320-324"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148836955","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
Traffic-Aware LEO Satellite Network Autonomous System Partitioning via Optimal Transport 基于最优传输的流量感知LEO卫星网络自治系统划分
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-07-02 DOI: 10.1109/LNET.2026.3709618
Liqi Yu;Wenxin Yang;Mubiao Yan;Luyao Wang;Jinhao Yang;Zhuochen Xie;Haiying Hu
{"title":"Traffic-Aware LEO Satellite Network Autonomous System Partitioning via Optimal Transport","authors":"Liqi Yu;Wenxin Yang;Mubiao Yan;Luyao Wang;Jinhao Yang;Zhuochen Xie;Haiying Hu","doi":"10.1109/LNET.2026.3709618","DOIUrl":"https://doi.org/10.1109/LNET.2026.3709618","url":null,"abstract":"Control-plane scalability is a bottleneck for large LEO constellations. Hierarchical autonomous system (AS) partitioning reduces routing complexity, but static boundaries fail to match spatially concentrated and time-varying traffic. We model AS partitioning as a capacity-constrained semi-discrete optimal transport problem. Kantorovich duality shows that the fixed-centroid subproblem admits a traffic-weighted Power Diagram solution, turning the assignment step into polynomial-time concave optimization. The proposed Traffic-Aware Satellite Partitioning (TASP) algorithm alternates this dual update with traffic-weighted centroid refinement. On GeoTraffic-24H, TASP reduces the load Gini coefficient from 0.519 to 0.093 and improves Jain’s index from 0.494 to 0.968. Under hourly re-partitioning, it also lowers partition variation, traffic reassignment, and route-update cost.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"306-310"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148837316","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
Scheduling Parallel Optical Switches in Datacenters 调度数据中心并行光交换机
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-02-02 DOI: 10.1109/LNET.2026.3660687
Kevin Liang;Litao Qiao;Isaac Keslassy;Bill Lin
{"title":"Scheduling Parallel Optical Switches in Datacenters","authors":"Kevin Liang;Litao Qiao;Isaac Keslassy;Bill Lin","doi":"10.1109/LNET.2026.3660687","DOIUrl":"https://doi.org/10.1109/LNET.2026.3660687","url":null,"abstract":"We consider the problem of scheduling a single traffic demand matrix <inline-formula> <tex-math>$D$ </tex-math></inline-formula> over <inline-formula> <tex-math>$s$ </tex-math></inline-formula> parallel optical circuit switches (OCSes) with reconfiguration delays. Our algorithm S<sc>pectra</small> relies on a three-step approach: D<sc>ecompose</small> <inline-formula> <tex-math>$D$ </tex-math></inline-formula> into a set of permutations, S<sc>chedule</small> these permutations across the switches, then E<sc>qualize</small> the loads on the switches. Our evaluation shows S<sc>pectra</small> vastly outperforms a baseline based on state-of-the-art algorithms, reaching schedule makespans that are shorter on average by a factor of <inline-formula> <tex-math>$2.4times $ </tex-math></inline-formula>.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"149-153"},"PeriodicalIF":0.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147665318","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
Enabling Multi-Application Multi-Objective Autoscaling With Quick Analytic Hierarchy Process 使用快速层次分析法实现多应用多目标自动缩放
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-01-23 DOI: 10.1109/LNET.2026.3657848
Ioannis Dimolitsas;Dimitrios Dechouniotis;Symeon Papavassiliou
{"title":"Enabling Multi-Application Multi-Objective Autoscaling With Quick Analytic Hierarchy Process","authors":"Ioannis Dimolitsas;Dimitrios Dechouniotis;Symeon Papavassiliou","doi":"10.1109/LNET.2026.3657848","DOIUrl":"https://doi.org/10.1109/LNET.2026.3657848","url":null,"abstract":"Dynamic autoscaling in Edge Clusters must reconcile conflicting resource demands from multiple co-hosted applications within short decision intervals, as conventional single-application controllers fail to consider such inter-application competition. The computational cost of classic optimization and decision-making methods increases rapidly with the number of alternative resource deployments, limiting their real-time applicability for short control loops typical in 5G/6G environments with rapid demand fluctuations. This letter introduces quick Analytic Hierarchy Process (qAHP), a modification of AHP formulation that preserves the ranking consistency of AHP while reducing the priority vector computation to linear time with respect to the number of alternatives. We formally prove this complexity reduction, achieving identical decision outcomes to classic AHP, and we validate it through proof-of-concept experiments showing that qAHP enables real-time autoscaling, mitigates over- and under-provisioning, and achieving up to two orders of magnitude lower execution time compared to classic AHP.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"154-158"},"PeriodicalIF":0.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147665467","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
From Automated to Autonomous: Hierarchical Agent-Native Network Architecture (HANA) 从自动化到自治：层次代理原生网络架构（HANA）
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-03-14 DOI: 10.1109/LNET.2026.3693226
Binghan Wu;Shoufeng Wang;Yunxin Liu;Ya-Qin Zhang;Joseph Sifakis;Ye Ouyang
{"title":"From Automated to Autonomous: Hierarchical Agent-Native Network Architecture (HANA)","authors":"Binghan Wu;Shoufeng Wang;Yunxin Liu;Ya-Qin Zhang;Joseph Sifakis;Ye Ouyang","doi":"10.1109/LNET.2026.3693226","DOIUrl":"https://doi.org/10.1109/LNET.2026.3693226","url":null,"abstract":"Realizing Level 4/5 Autonomous Networks (AN) demands a shift from static automation to agent-native intelligence. Current operations, reliant on rigid scripts, lack the cognitive agency to handle off-nominal conditions. To address this, this letter proposes a hierarchical multi-agent reference architecture enabling high-level autonomy. The framework features a Dual-Driven Orchestrator that coordinates specialized Executive Agents, supported by a shared Public Memory for unified domain knowledge. A key innovation is the integration of agent self-awareness, which empowers the system to harmonize deliberative strategic governance with reflexive fault recovery. We instantiate and validate this architecture within a 5G Core environment. Case studies demonstrate that the system sustains critical throughput under congestion and reduces Mean Time to Repair (MTTR) by 86%, confirming its efficacy in unifying strategic planning with operational resilience.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"287-290"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442185","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
Adaptive Link Selection and Handover in Orientation-Aware Hybrid Li-Fi/Wi-Fi Networks 方向感知混合Li-Fi/Wi-Fi网络中的自适应链路选择和切换
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-03-04 DOI: 10.1109/LNET.2026.3670370
Saswati Paramita;Abhinav Rawat;Vivek Ashok Bohara
{"title":"Adaptive Link Selection and Handover in Orientation-Aware Hybrid Li-Fi/Wi-Fi Networks","authors":"Saswati Paramita;Abhinav Rawat;Vivek Ashok Bohara","doi":"10.1109/LNET.2026.3670370","DOIUrl":"https://doi.org/10.1109/LNET.2026.3670370","url":null,"abstract":"Hybrid Li-Fi/Wi-Fi networks are increasingly adopted for high-capacity indoor connectivity to mitigate RF spectrum congestion. However, Li-Fi performance is highly sensitive to user mobility, device orientation, and blockage, which are often overlooked in hybrid designs. This letter proposes OAM-LiFiNet, an orientation-aware, multi-AP hybrid Li-Fi/Wi-Fi framework with selective, sensor-assisted orientation control and mobility-aware link selection. Device orientation is triggered only when it provides measurable SINR or throughput gains, avoiding unnecessary adjustments. By integrating Random Waypoint mobility, blockage awareness, and interference-aware SINR evaluation, the proposed framework improves throughput stability and handover efficiency. Simulation results show up to 84% throughput improvement with fewer orientation adjustments compared to baseline hybrid schemes.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"282-286"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442453","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
Quantifying the Impact of TLE Ageing on LEO IoT Link Reliability 量化TLE老化对LEO物联网链路可靠性的影响
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2025-12-30 DOI: 10.1109/LNET.2025.3649595
Daniel Commey;Kamel Abbad;Matilda Nkoom;Griffith S. Klogo;Lyes Khoukhi;Garth V. Crosby
{"title":"Quantifying the Impact of TLE Ageing on LEO IoT Link Reliability","authors":"Daniel Commey;Kamel Abbad;Matilda Nkoom;Griffith S. Klogo;Lyes Khoukhi;Garth V. Crosby","doi":"10.1109/LNET.2025.3649595","DOIUrl":"https://doi.org/10.1109/LNET.2025.3649595","url":null,"abstract":"Two-Line Element (TLE) sets are the ubiquitous ephemerides for propagating Low Earth Orbit (LEO) satellite trajectories. However, their predictive accuracy degrades rapidly over time, a phenomenon known as TLE ageing. For power-constrained Internet of Things (IoT) devices relying on precisely scheduled, brief communication links, this degradation leads to missed passes, severely compromising network reliability. This letter rigorously quantifies this critical effect on the Starlink constellation. By analyzing over 2.8 million pass events for 150 satellites observed from four geographically diverse ground stations, the study demonstrates that the missed-pass probability undergoes a critical transition, increasing from less than 1% to over 3% as TLE age increases from 6 to 12 hours. This establishes a critical operational requirement for TLE updates at intervals of 6 hours or less to maintain high-reliability services (e.g., >99%).","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"101-104"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148491843","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
rApp Observability: Causal Attribution of KPI Changes to rApp Actions in O-RAN Non-RT RIC rApp可观察性：O-RAN非rt RIC中KPI变化对rApp行为的因果归因
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2026-06-04 DOI: 10.1109/LNET.2026.3700191
Roberto Riggio
{"title":"rApp Observability: Causal Attribution of KPI Changes to rApp Actions in O-RAN Non-RT RIC","authors":"Roberto Riggio","doi":"10.1109/LNET.2026.3700191","DOIUrl":"https://doi.org/10.1109/LNET.2026.3700191","url":null,"abstract":"Concurrent rApps (third-party applications running atop the Non-RT RIC) introduce a fundamental observability gap: when a Key Performance Indicator (KPI) changes, operators cannot systematically determine which rApp action caused it. Existing O-RAN conflict mitigation operates proactively or reactively within the control loop but offers no post-hoc causal attribution. We propose an observability architecture for the Non-RT RIC that captures timestamped rApp actions across the R1, A1, and O1 interfaces, aligns them with KPI time series, and applies a causal attribution methodology combining changepoint detection, Granger causality, conditional intervention effect, and temporal precedence scoring. Evaluation with three concurrent rApps over a simulated multi-cell 5G setup, across three scenarios of increasing difficulty, shows that the combined method achieves high accuracy when actions are temporally or spatially separated and consistently places the causal rApp within the top-2 candidates under concurrent overlapping actions on shared cells.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"194-198"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148491473","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
Spatially Synchronized Sensing in Vehicle Platoons via Common Driving-Behavior-Dependent Noise 基于共同驾驶行为相关噪声的车辆队列空间同步感知
IF 3.3
IEEE Networking Letters Pub Date : 2026-01-01 Epub Date: 2025-12-26 DOI: 10.1109/LNET.2025.3648733
Yukio Ogawa;Akihiro Miura;Mianxiong Dong;Kaoru Ota
{"title":"Spatially Synchronized Sensing in Vehicle Platoons via Common Driving-Behavior-Dependent Noise","authors":"Yukio Ogawa;Akihiro Miura;Mianxiong Dong;Kaoru Ota","doi":"10.1109/LNET.2025.3648733","DOIUrl":"https://doi.org/10.1109/LNET.2025.3648733","url":null,"abstract":"This letter utilizes the mechanism of noise-induced synchronization to enable spatially synchronized data collection using non-interacting smartphones mounted on vehicles in a platoon. We demonstrate that ambient environmental factors, specifically ambient light and the magnetic field, fluctuate coherently with the common driving behavior of the vehicles. The spatial correlation of this noise achieved a median of up to 0.97. Using those observed noise signals, we then simulate cooperative sensing by two vehicles and show that this spatial synchronization technique reduces the median distance between the independently sensed locations by up to half of that obtained without synchronization.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"8 ","pages":"105-109"},"PeriodicalIF":3.3,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148492206","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书