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

IEEE Networking Letters最新文献

筛选
英文 中文
IEEE Communications Society IEEE通信学会
IEEE Networking Letters Pub Date : 2023-09-22 DOI: 10.1109/LNET.2023.3312874
{"title":"IEEE Communications Society","authors":"","doi":"10.1109/LNET.2023.3312874","DOIUrl":"https://doi.org/10.1109/LNET.2023.3312874","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 3","pages":"C3-C3"},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8253410/10261392/10261393.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49979555","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}
引用次数: 0
IEEE COMMUNICATIONS SOCIETY Ieee通信学会
IEEE Networking Letters Pub Date : 2023-09-22 DOI: 10.1109/LNET.2023.3312872
{"title":"IEEE COMMUNICATIONS SOCIETY","authors":"","doi":"10.1109/LNET.2023.3312872","DOIUrl":"https://doi.org/10.1109/LNET.2023.3312872","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 3","pages":"C2-C2"},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8253410/10261392/10261395.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49979546","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}
引用次数: 0
IEEE Networking Letters Author Guidelines IEEE网络通讯作者指南
IEEE Networking Letters Pub Date : 2023-09-22 DOI: 10.1109/LNET.2023.3312870
{"title":"IEEE Networking Letters Author Guidelines","authors":"","doi":"10.1109/LNET.2023.3312870","DOIUrl":"https://doi.org/10.1109/LNET.2023.3312870","url":null,"abstract":"","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 3","pages":"177-178"},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8253410/10261392/10261394.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49979554","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}
引用次数: 0
Guest Editorial Networking Enablers for 6G Use Cases 6G用例的网络推动者
IEEE Networking Letters Pub Date : 2023-09-22 DOI: 10.1109/LNET.2023.3307246
Paolo Monti;Burak Kantarci;Raouf Boutaba
{"title":"Guest Editorial Networking Enablers for 6G Use Cases","authors":"Paolo Monti;Burak Kantarci;Raouf Boutaba","doi":"10.1109/LNET.2023.3307246","DOIUrl":"https://doi.org/10.1109/LNET.2023.3307246","url":null,"abstract":"The Fifth Generation Communications (5G) has paved the way for various use cases including but not limited to networked robotics and autonomous systems, distributed and collaborative sensor/actuator technologies, personalized user experience and extended reality. 5G networking builds on three pillars to enable the accomplishment of these use cases: enhanced mobile broadband (eMBB), massive machine type communications (mMTC), and ultra reliable low latency communications (URLLC). While 5G has started to become a reality, the applications supported by these enablers require 100 microseconds at peak rate latency, 100 times faster speed and ten times higher penetration per square kilometer. Given these facts, a roadmap for the Sixth Generation Communications (6G) has been laid out aiming at Year 2030.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 3","pages":"146-148"},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8253410/10261392/10261397.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49979547","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}
引用次数: 0
AI-Assisted Improved Service Provisioning for Low-Latency XR Over 5G NR 人工智能辅助改进 5G NR 上低延迟 XR 的服务供应
IEEE Networking Letters Pub Date : 2023-09-15 DOI: 10.1109/LNET.2023.3316390
Moyukh Laha;Dibbendu Roy;Sourav Dutta;Goutam Das
{"title":"AI-Assisted Improved Service Provisioning for Low-Latency XR Over 5G NR","authors":"Moyukh Laha;Dibbendu Roy;Sourav Dutta;Goutam Das","doi":"10.1109/LNET.2023.3316390","DOIUrl":"10.1109/LNET.2023.3316390","url":null,"abstract":"Extended Reality (XR) is one of the most important 5G/6G media applications that will fundamentally transform human interactions. However, ensuring low latency, high data rate, and reliability to support XR services poses significant challenges. This letter presents a novel AI-assisted service provisioning scheme that leverages predicted frames for processing rather than relying solely on actual frames. This method virtually increases the network delay budget and consequently improves service provisioning, albeit at the expense of minor prediction errors. The proposed scheme is validated by extensive simulations demonstrating a multi-fold increase in supported XR users and also provides crucial network design insights.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"31-35"},"PeriodicalIF":0.0,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135495029","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
Optimal Control for Platooning in Vehicle-to-Infrastructure Communications Networks 车辆到基础设施通信网络中的优化排序控制
IEEE Networking Letters Pub Date : 2023-09-13 DOI: 10.1109/LNET.2023.3314736
Yun Lai;Yu Duan;Lifeng Wang
{"title":"Optimal Control for Platooning in Vehicle-to-Infrastructure Communications Networks","authors":"Yun Lai;Yu Duan;Lifeng Wang","doi":"10.1109/LNET.2023.3314736","DOIUrl":"10.1109/LNET.2023.3314736","url":null,"abstract":"Conventional vehicle-to-vehicle communication aided platooning system is distributed under various communication topologies and suffers from the severe interference, uncertain topologies, and heterogeneous communication delays, particularly in the urban areas with dense vehicles. Platooning design with the vehicle-to-infrastructure communication (V2I) enables the minimum number of communication links. Therefore, this letter proposes an optimal control scheme for minimizing the overall status errors under delay concern in the V2I based platooning system. By transforming the continuous-time plant into a discrete-time linear system, the considered system is confirmed to be controllable. Numerical results confirm that the proposed scheme is effective and achieves stability in the presence of different communication delay conditions.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"289-293"},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135402805","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
SLA Decomposition for Network Slicing: A Deep Neural Network Approach 网络切片的 SLA 分解：深度神经网络方法
IEEE Networking Letters Pub Date : 2023-08-30 DOI: 10.1109/LNET.2023.3310359
Cyril Shih-Huan Hsu;Danny De Vleeschauwer;Chrysa Papagianni
{"title":"SLA Decomposition for Network Slicing: A Deep Neural Network Approach","authors":"Cyril Shih-Huan Hsu;Danny De Vleeschauwer;Chrysa Papagianni","doi":"10.1109/LNET.2023.3310359","DOIUrl":"10.1109/LNET.2023.3310359","url":null,"abstract":"For a network slice that spans multiple technology and/or administrative domains, these domains must ensure that the slice’s End-to-End (E2E) Service Level Agreement (SLA) is met. Thus, the E2E SLA should be decomposed to partial SLAs, assigned to each of these domains. Assuming a two-level management architecture consisting of an E2E service orchestrator and local domain controllers, we consider that the former is only aware of historical data of the local controllers’ responses to previous slice requests, and captures this knowledge in a risk model per domain. In this letter, we propose the use of Neural Network (NN) based risk models, using such historical data, to decompose the E2E SLA. Specifically, we introduce models that incorporate monotonicity, applicable even in cases involving small datasets. An empirical study on a synthetic multi-domain dataset demonstrates the efficiency of our approach.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"294-298"},"PeriodicalIF":0.0,"publicationDate":"2023-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73257990","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
Optimal Generic L-Out-of-M Counting Rule for Neyman-Pearson Test in Cognitive Radio Networks 认知无线电网络中奈曼-皮尔逊测试的最优通用 L-Out-of-M 计数规则
IEEE Networking Letters Pub Date : 2023-08-28 DOI: 10.1109/LNET.2023.3309537
Narasimha Rao Banavathu
{"title":"Optimal Generic L-Out-of-M Counting Rule for Neyman-Pearson Test in Cognitive Radio Networks","authors":"Narasimha Rao Banavathu","doi":"10.1109/LNET.2023.3309537","DOIUrl":"10.1109/LNET.2023.3309537","url":null,"abstract":"This letter proposes a generic \u0000<inline-formula> <tex-math>${L}$ </tex-math></inline-formula>\u0000-out-of-\u0000<inline-formula> <tex-math>${M}$ </tex-math></inline-formula>\u0000 counting rule-based sensing, wherein the cognitive radios (CRs) with non-identical receiver operating characteristic (ROC) curves and the fusion node cooperatively identify the primary user’s state. We formulate a generalized Neyman-Pearson problem to jointly optimize the individual CRs’ operational points on the ROC curves and the generic \u0000<inline-formula> <tex-math>${L}$ </tex-math></inline-formula>\u0000-out-of-\u0000<inline-formula> <tex-math>${M}$ </tex-math></inline-formula>\u0000 counting rule for the CR system. Then, a fast-sensing problem is formulated to find the least number of CRs needed for practical sensing. We provide generalized solutions for any detector employed in the CR system. The proposed scheme shows superior detection performance compared to the traditional scheme.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"189-193"},"PeriodicalIF":0.0,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88012477","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
Analysis of Queues Fed by Lognormal Distributed Arrivals for IoT Network Traffic 物联网网络流量的对数正态分布到达队列分析
IEEE Networking Letters Pub Date : 2023-08-18 DOI: 10.1109/LNET.2023.3306419
Shachi Sharma;Prakash Datt Bhatt
{"title":"Analysis of Queues Fed by Lognormal Distributed Arrivals for IoT Network Traffic","authors":"Shachi Sharma;Prakash Datt Bhatt","doi":"10.1109/LNET.2023.3306419","DOIUrl":"10.1109/LNET.2023.3306419","url":null,"abstract":"Statistical analysis of IoT network traffic establishes the presence of lognormal distributed inter-arrivals. This letter presents analysis of LN/M/1 queueing model using approximate results of Laplace-Stieltjes transformation of lognormal distribution in terms of Lambert \u0000<inline-formula> <tex-math>${{mathcal { W}}}$ </tex-math></inline-formula>\u0000(.) function. The comparative performance evaluation of the LN/M/1 model with traditional M/M/1 model reveals that the quality of service metrics of LN/M/1 model mostly remain lower than M/M/1 implying that less number of buffers are required in IoT systems driven by such traffic. The asymptotic expressions for loss probability are derived using finite capacity LN/M/1/N model for different values of traffic intensity.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"260-264"},"PeriodicalIF":0.0,"publicationDate":"2023-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73760229","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 Hybrid Approach to Header Size and Forwarding Table Optimization in Segment Routing 分段路由中的报头大小和转发表优化混合方法
IEEE Networking Letters Pub Date : 2023-08-14 DOI: 10.1109/LNET.2023.3305247
Anushree Roy;Tania Sarkar;Pranav Kumar Singh;Ranjan Maity
{"title":"A Hybrid Approach to Header Size and Forwarding Table Optimization in Segment Routing","authors":"Anushree Roy;Tania Sarkar;Pranav Kumar Singh;Ranjan Maity","doi":"10.1109/LNET.2023.3305247","DOIUrl":"10.1109/LNET.2023.3305247","url":null,"abstract":"Segment Routing is a source routing paradigm that simplifies packet forwarding and management across networks. Two major challenges of segment routing are the limitation of header stack size and the size of the Forwarding Table specific to each node. It has been observed that there is a trade-off between these two factors. In this letter, we have addressed this trade-off and presented a mechanism to minimize the stack size as well as the forwarding table. Instead of individual Segment IDs used in traditional segment routing, unique Path IDs are considered. This reduces the size of the header stack to one irrespective of the number of segments in the path. To reduce the size of the forwarding table, a forwarding technique based on matrix operations is used. Our approach also works on the reliability issues in forwarding and guarantees 100% successful packet forwarding.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"275-278"},"PeriodicalIF":0.0,"publicationDate":"2023-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87707371","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学术文献互助群
群 号：481959085
Book学术官方微信