首页 > 最新文献

Journal of Computer Networks and Communications最新文献

英文 中文
Synergy Between 6G and AI: Open Future Horizons and Impending Security Risks 6G和人工智能的协同:打开未来的视野和迫在眉睫的安全风险
Q1 Computer Science Pub Date : 2023-06-07 DOI: 10.37256/cnc.1120232969
Elias Yaacoub
This paper explores the potential synergies between 6G and AI, arguing that their combination has the power to unlock new horizons by addressing future challenges in healthcare, transportation, virtual reality, education, resource management, robotics, public safety, and warfare. However, these opportunities also come with greater risks. Therefore, the paper provides an overview of the security risks and challenges associated with this convergence, as well as possible mitigation techniques.
本文探讨了6G和人工智能之间的潜在协同效应,认为它们的结合有能力通过应对医疗保健、交通、虚拟现实、教育、资源管理、机器人、公共安全和战争等未来挑战,开辟新的视野。然而,这些机遇也伴随着更大的风险。因此,本文概述了与这种融合相关的安全风险和挑战,以及可能的缓解技术。
{"title":"Synergy Between 6G and AI: Open Future Horizons and Impending Security Risks","authors":"Elias Yaacoub","doi":"10.37256/cnc.1120232969","DOIUrl":"https://doi.org/10.37256/cnc.1120232969","url":null,"abstract":"This paper explores the potential synergies between 6G and AI, arguing that their combination has the power to unlock new horizons by addressing future challenges in healthcare, transportation, virtual reality, education, resource management, robotics, public safety, and warfare. However, these opportunities also come with greater risks. Therefore, the paper provides an overview of the security risks and challenges associated with this convergence, as well as possible mitigation techniques.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135494058","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
Trust and Risk Assessment in IoT Networks 物联网网络中的信任与风险评估
IF 2 Q1 Computer Science Pub Date : 2023-05-30 DOI: 10.37256/cnc.1120232667
J. Hemmes, Steven Fulton, Judson C. Dressler, Stephen Kirkman
The Internet of Things (IoT) is a large-scale, heterogeneous ecosystem of connected devices encompassing a range of purposes and computing capabilities. As IoT systems grow ubiquitous, new approaches to security are needed. This work proposes a method of risk assessment for devices that combines the use of trust models based on dynamic behaviors with static capability profiles drawn from immutable device characteristics to determine the level of risk each device poses to network security. A risk-based approach allows security mechanisms and monitoring activities to be more efficiently allocated across IoT networks. Simultaneously, devices can be allowed a greater degree of functionality while ensuring system availability and security. This paper presents a methodology and architecture to integrate risk assessment into IoT networks. This allows additional tailoring of security control application and provides higher-level, more human-readable information for security analysts.
物联网(IoT)是一个由连接设备组成的大规模异构生态系统,包含一系列用途和计算能力。随着物联网系统变得无处不在,需要新的安全方法。这项工作提出了一种设备风险评估方法,该方法将基于动态行为的信任模型与从不可变设备特征中提取的静态能力概况相结合,以确定每个设备对网络安全构成的风险级别。基于风险的方法允许在物联网网络中更有效地分配安全机制和监控活动。同时,在确保系统可用性和安全性的同时,可以允许设备具有更大程度的功能。本文提出了一种将风险评估集成到物联网网络中的方法和架构。这允许对安全控制应用程序进行额外的裁剪,并为安全分析人员提供更高级别、更易于人类阅读的信息。
{"title":"Trust and Risk Assessment in IoT Networks","authors":"J. Hemmes, Steven Fulton, Judson C. Dressler, Stephen Kirkman","doi":"10.37256/cnc.1120232667","DOIUrl":"https://doi.org/10.37256/cnc.1120232667","url":null,"abstract":"The Internet of Things (IoT) is a large-scale, heterogeneous ecosystem of connected devices encompassing a range of purposes and computing capabilities. As IoT systems grow ubiquitous, new approaches to security are needed. This work proposes a method of risk assessment for devices that combines the use of trust models based on dynamic behaviors with static capability profiles drawn from immutable device characteristics to determine the level of risk each device poses to network security. A risk-based approach allows security mechanisms and monitoring activities to be more efficiently allocated across IoT networks. Simultaneously, devices can be allowed a greater degree of functionality while ensuring system availability and security. This paper presents a methodology and architecture to integrate risk assessment into IoT networks. This allows additional tailoring of security control application and provides higher-level, more human-readable information for security analysts.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75209628","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
An Approach to Obtaining Stable Parameter Estimates Using Experimentally Obtained Delay Values in a Cellular Mobile Network 一种利用实验获得的蜂窝移动网络延迟值获得稳定参数估计的方法
IF 2 Q1 Computer Science Pub Date : 2023-05-26 DOI: 10.37256/cnc.1120232829
Aleksandrs Kutins, Deniss Brodņevs
The ability to describe experimentally obtained delay values in a cell of a mobile cellular network allows not only describing the properties of cell delays using only a few parameters, but also to simulate delay values. Unfortunately, occasionally occurring temporary unstable operation of a cellular network, caused by various negative factors, leads to a noticeable increase in delays and, as a result, to a significant distortion of the obtained delay parameters estimates. For this reason, estimates of the delay parameters in a cell should be obtained from experimental data obtained at the time of stable operation of the network. Due to the large amount of experimentally obtained data, the process of checking experimentally obtained delay values for the presence of anomalies should be performed on the application of simple criteria. The aim of this paper is to show an approach to obtaining stable parameter estimates of delay in a cell of a mobile cellular network. The article describes the factors that affect delays stability, assesses the degree of their influence, and also highlights properties that can be used to recognize phenomena that adversely affect the value and stability of delays in order to exclude such experimentally obtained data from the evaluation.
在移动蜂窝网络的一个单元中描述实验获得的延迟值的能力不仅允许只用几个参数描述单元延迟的特性,而且还可以模拟延迟值。不幸的是,由于各种负面因素,蜂窝网络偶尔会出现暂时的不稳定运行,导致延迟明显增加,从而导致获得的延迟参数估计严重失真。因此,应该从网络稳定运行时获得的实验数据来估计单元中的延迟参数。由于实验获得的数据量很大,对于实验获得的是否存在异常的延迟值的检验过程,应采用简单的判据进行。本文的目的是展示一种获得移动蜂窝网络中蜂窝延迟的稳定参数估计的方法。本文描述了影响延迟稳定性的因素,评估了其影响程度,并强调了可用于识别对延迟价值和稳定性产生不利影响的现象的特性,以便从评估中排除此类实验获得的数据。
{"title":"An Approach to Obtaining Stable Parameter Estimates Using Experimentally Obtained Delay Values in a Cellular Mobile Network","authors":"Aleksandrs Kutins, Deniss Brodņevs","doi":"10.37256/cnc.1120232829","DOIUrl":"https://doi.org/10.37256/cnc.1120232829","url":null,"abstract":"The ability to describe experimentally obtained delay values in a cell of a mobile cellular network allows not only describing the properties of cell delays using only a few parameters, but also to simulate delay values. Unfortunately, occasionally occurring temporary unstable operation of a cellular network, caused by various negative factors, leads to a noticeable increase in delays and, as a result, to a significant distortion of the obtained delay parameters estimates. For this reason, estimates of the delay parameters in a cell should be obtained from experimental data obtained at the time of stable operation of the network. Due to the large amount of experimentally obtained data, the process of checking experimentally obtained delay values for the presence of anomalies should be performed on the application of simple criteria. The aim of this paper is to show an approach to obtaining stable parameter estimates of delay in a cell of a mobile cellular network. The article describes the factors that affect delays stability, assesses the degree of their influence, and also highlights properties that can be used to recognize phenomena that adversely affect the value and stability of delays in order to exclude such experimentally obtained data from the evaluation.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89950216","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
Survey: An Overview on Privacy Preserving Federated Learning in Health Data 调查:健康数据中隐私保护联邦学习的概述
IF 2 Q1 Computer Science Pub Date : 2023-03-27 DOI: 10.37256/cnc.1120231992
Manzur Elahi, Hui Cui, Mohammed Kaosar
Machine learning now confronts two significant obstacles: the first is data isolation in most organizations' silos, and the second is data privacy and security enforcement. The widespread application of Machine Learning techniques in patient care is currently hampered by limited dataset availability for algorithm training and validation due to the lack of standardised electronic medical records and strict legal and ethical requirements to protect patient privacy. To avoid compromising patient privacy while supporting scientific analysis on massive datasets to improve patient care, it is necessary to analyse and implement Machine Learning solutions that fulfil data security and consumption demands. In this survey paper, we meticulously explain the existing works of federated learning from many perspectives to give a thorough overview and promote future research in this area. Then, we determine the current challenges, attack vectors and potential prospects for federated learning research. We analysed the similarities, differences and advantages between federated learning and other machine learning techniques. We also discussed about system and statistical heterogeneity and related efficient algorithms.
机器学习现在面临着两个重大障碍:第一个是大多数组织的孤岛中的数据隔离,第二个是数据隐私和安全执行。由于缺乏标准化的电子病历和严格的法律和道德要求来保护患者隐私,机器学习技术在患者护理中的广泛应用目前受到用于算法训练和验证的数据集可用性有限的阻碍。为了在支持对海量数据集进行科学分析以改善患者护理的同时避免损害患者隐私,有必要分析和实施满足数据安全和消费需求的机器学习解决方案。在这篇调查论文中,我们从多个角度对联邦学习的现有工作进行了细致的解释,以给出一个全面的概述,并促进该领域的未来研究。然后,我们确定了当前联邦学习研究的挑战、攻击向量和潜在前景。我们分析了联邦学习与其他机器学习技术的异同和优势。我们还讨论了系统和统计异质性以及相关的高效算法。
{"title":"Survey: An Overview on Privacy Preserving Federated Learning in Health Data","authors":"Manzur Elahi, Hui Cui, Mohammed Kaosar","doi":"10.37256/cnc.1120231992","DOIUrl":"https://doi.org/10.37256/cnc.1120231992","url":null,"abstract":"Machine learning now confronts two significant obstacles: the first is data isolation in most organizations' silos, and the second is data privacy and security enforcement. The widespread application of Machine Learning techniques in patient care is currently hampered by limited dataset availability for algorithm training and validation due to the lack of standardised electronic medical records and strict legal and ethical requirements to protect patient privacy. To avoid compromising patient privacy while supporting scientific analysis on massive datasets to improve patient care, it is necessary to analyse and implement Machine Learning solutions that fulfil data security and consumption demands. In this survey paper, we meticulously explain the existing works of federated learning from many perspectives to give a thorough overview and promote future research in this area. Then, we determine the current challenges, attack vectors and potential prospects for federated learning research. We analysed the similarities, differences and advantages between federated learning and other machine learning techniques. We also discussed about system and statistical heterogeneity and related efficient algorithms.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77199392","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}
引用次数: 1
Impacts of Vehicle-to-Everything Enabled Applications: Literature Review of Existing Studies 车辆对一切应用的影响:现有研究的文献综述
IF 2 Q1 Computer Science Pub Date : 2023-03-10 DOI: 10.37256/cnc.1120232115
Jianhe Du, K. Ahn, Mohamed M. G. Farag, Hesham A Rakha
As communication technology is developing at a rapid pace, connected vehicles (CVs) can potentially enhance vehicle safety while reducing vehicle energy consumption and emissions via data sharing. Many researchers have attempted to quantify the impacts of such CV applications and vehicle-to-everything (V2X) communication, or the instant and accurate communication among vehicles, devices, pedestrians, infrastructure, network, cloud, and grid. Cellular V2X (C-V2X) has gained interest as an efficient method for this data sharing. In releases 14 and 15, C-V2X uses 4G LTE technology, and in release 16, it uses the latest 5G new radio (NR) technology. Among its benefits, C-V2X can function even with no network infrastructure coverage; in addition, C-V2X surpasses older technologies in terms of communication range, latency, and data rates. Highly efficient information interchange in a CV environment can provide timely data to enhance the transportation system's capacity, and it can support applications that improve vehicle safety and minimize negative impacts on the environment. Achieving the full benefits of CVs requires rigorous investigation into the effectiveness, strengths, and weaknesses of different CV applications. It also calls for deeper understanding of the communication protocols, results with different CV market penetration rates (MPRs), CV- and human-driven vehicle interactions, integration of multiple applications, and errors and latencies associated with data communication. This paper includes a review of existing literature on the safety, mobility, and environmental impacts of CV applications; gaps in current CV research; and recommended directions for future research. The results of this paper will help shape future research for CV applications to realize their full potential.
随着通信技术的快速发展,联网汽车(cv)可以通过数据共享来提高车辆安全性,同时降低车辆能耗和排放。许多研究人员试图量化此类自动驾驶汽车应用和车辆到一切(V2X)通信的影响,或车辆、设备、行人、基础设施、网络、云和网格之间的即时和准确通信。蜂窝V2X (C-V2X)作为一种有效的数据共享方法已引起人们的兴趣。在版本14和15中,C-V2X使用4G LTE技术,而在版本16中,它使用最新的5G新无线电(NR)技术。C-V2X的优势之一是,它可以在没有网络基础设施覆盖的情况下运行;此外,C-V2X在通信范围、延迟和数据速率方面都超越了旧技术。在自动驾驶环境中,高效的信息交换可以提供及时的数据,以增强交通系统的能力,并可以支持提高车辆安全性和最大限度地减少对环境的负面影响的应用。要充分发挥简历的优势,需要对不同简历应用程序的有效性、优缺点进行严格的调查。它还要求更深入地了解通信协议、不同自动驾驶汽车市场渗透率(MPRs)的结果、自动驾驶汽车和人类驱动的车辆交互、多种应用的集成以及与数据通信相关的错误和延迟。本文综述了现有的关于自动驾驶汽车应用的安全性、移动性和环境影响的文献;当前CV研究的空白;并对今后的研究方向提出了建议。本文的研究结果将有助于塑造未来CV应用的研究,以充分发挥其潜力。
{"title":"Impacts of Vehicle-to-Everything Enabled Applications: Literature Review of Existing Studies","authors":"Jianhe Du, K. Ahn, Mohamed M. G. Farag, Hesham A Rakha","doi":"10.37256/cnc.1120232115","DOIUrl":"https://doi.org/10.37256/cnc.1120232115","url":null,"abstract":"As communication technology is developing at a rapid pace, connected vehicles (CVs) can potentially enhance vehicle safety while reducing vehicle energy consumption and emissions via data sharing. Many researchers have attempted to quantify the impacts of such CV applications and vehicle-to-everything (V2X) communication, or the instant and accurate communication among vehicles, devices, pedestrians, infrastructure, network, cloud, and grid. Cellular V2X (C-V2X) has gained interest as an efficient method for this data sharing. In releases 14 and 15, C-V2X uses 4G LTE technology, and in release 16, it uses the latest 5G new radio (NR) technology. Among its benefits, C-V2X can function even with no network infrastructure coverage; in addition, C-V2X surpasses older technologies in terms of communication range, latency, and data rates. Highly efficient information interchange in a CV environment can provide timely data to enhance the transportation system's capacity, and it can support applications that improve vehicle safety and minimize negative impacts on the environment. Achieving the full benefits of CVs requires rigorous investigation into the effectiveness, strengths, and weaknesses of different CV applications. It also calls for deeper understanding of the communication protocols, results with different CV market penetration rates (MPRs), CV- and human-driven vehicle interactions, integration of multiple applications, and errors and latencies associated with data communication. This paper includes a review of existing literature on the safety, mobility, and environmental impacts of CV applications; gaps in current CV research; and recommended directions for future research. The results of this paper will help shape future research for CV applications to realize their full potential.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80098116","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}
引用次数: 1
Efficient Optimal and Suboptimal Joint Access Point Association and Radio Resource Allocation in WLANs 无线局域网中有效的最优和次优联合接入点关联与无线资源分配
IF 2 Q1 Computer Science Pub Date : 2023-01-18 DOI: 10.37256/cnc.1120231689
Zhiwei Mao
The centralized joint access point (AP) association and radio resource allocation problem in time-sharing based dense WLANs with heterogeneous station (STA) throughput demands and identical AP transmission power is considered in this paper. The problem is formulated as an NP-hard single non-zero programming (SNZP) optimization problem with three different throughput-based objective functions, including the maximal aggregate (MA) throughput, the max-min fair (MMF) throughput and the proportionally fair (PF) throughput. To solve the NP-hard SNZP problem, based on the optimal branch-and-bound (BnB) searching approach, two novel efficient algorithms, the optimal BnB and the suboptimal depth-first BnB (DF-BnB) algorithms, are proposed, which can be used as convenient performance benchmarks in the study of the problem considered. The complexity of the proposed algorithms is analyzed theoretically. Numerical results are presented to investigate and compare the performance and complexity of the proposed algorithms under the three different design criteria, which can help in choosing an appropriate cost function objective in practical system design.
研究了具有异构站吞吐量需求和相同AP发射功率的分时密集无线局域网中集中式联合接入点(AP)关联和无线资源分配问题。该问题是一个NP-hard单非零规划(SNZP)优化问题,具有三个不同的基于吞吐量的目标函数,包括最大聚合吞吐量(MA)、最大最小公平吞吐量(MMF)和比例公平吞吐量(PF)。为了解决NP-hard SNZP问题,在最优分支定界(BnB)搜索方法的基础上,提出了最优BnB和次最优深度优先BnB (DF-BnB)算法两种新的高效算法,这两种算法可以作为研究所考虑问题的方便性能基准。从理论上分析了所提算法的复杂性。通过数值结果比较了三种不同设计准则下所提出算法的性能和复杂度,有助于在实际系统设计中选择合适的成本函数目标。
{"title":"Efficient Optimal and Suboptimal Joint Access Point Association and Radio Resource Allocation in WLANs","authors":"Zhiwei Mao","doi":"10.37256/cnc.1120231689","DOIUrl":"https://doi.org/10.37256/cnc.1120231689","url":null,"abstract":"The centralized joint access point (AP) association and radio resource allocation problem in time-sharing based dense WLANs with heterogeneous station (STA) throughput demands and identical AP transmission power is considered in this paper. The problem is formulated as an NP-hard single non-zero programming (SNZP) optimization problem with three different throughput-based objective functions, including the maximal aggregate (MA) throughput, the max-min fair (MMF) throughput and the proportionally fair (PF) throughput. To solve the NP-hard SNZP problem, based on the optimal branch-and-bound (BnB) searching approach, two novel efficient algorithms, the optimal BnB and the suboptimal depth-first BnB (DF-BnB) algorithms, are proposed, which can be used as convenient performance benchmarks in the study of the problem considered. The complexity of the proposed algorithms is analyzed theoretically. Numerical results are presented to investigate and compare the performance and complexity of the proposed algorithms under the three different design criteria, which can help in choosing an appropriate cost function objective in practical system design.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74827696","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
High Altitude Platform Stations Aided Cloud-Computing Solution for Rural-Environment IoT Applications 面向农村环境物联网应用的高空台站辅助云计算解决方案
IF 2 Q1 Computer Science Pub Date : 2023-01-11 DOI: 10.37256/cnc.1120232107
Victor Monzon Baeza, Manuel Alvarez Marban
This work proposes a flexible and scalable Smart Rural (SR) system for gathering and processing IoT data from remote rural areas with no traditional communication coverage as a handicap. We offer an architecture structured in distinct segments using emerging technologies such as IoT, 5G, Cloud and High Altitude Platform Station (HAPS). This proposal is applied to the rural environment to cover thus all the needs of the system in the collection of IoT data from these remote rural areas, its coverage by space vehicles and its processing and storage through 5G terrestrial networks and cloud services. The proposal includes the deployment of IoT sensors and the development of Amazon Web Services (AWS). On the other hand, the part of the space segment considered by HAPS has been simulated for different space channels. This way offers a complete and automated SR system that allows access to these IoT data from remote rural areas through the Internet.
这项工作提出了一个灵活和可扩展的智能农村(SR)系统,用于收集和处理来自偏远农村地区的物联网数据,这些地区没有传统的通信覆盖作为障碍。我们使用物联网、5G、云和高空平台站(HAPS)等新兴技术,为不同的细分市场提供架构。该提案适用于农村环境,从而涵盖系统在从这些偏远农村地区收集物联网数据,通过太空飞行器覆盖以及通过5G地面网络和云服务处理和存储数据方面的所有需求。该提案包括部署物联网传感器和开发亚马逊网络服务(AWS)。另一方面,对HAPS考虑的部分空间段进行了不同空间通道的模拟。这种方式提供了一个完整和自动化的SR系统,允许通过互联网访问偏远农村地区的这些物联网数据。
{"title":"High Altitude Platform Stations Aided Cloud-Computing Solution for Rural-Environment IoT Applications","authors":"Victor Monzon Baeza, Manuel Alvarez Marban","doi":"10.37256/cnc.1120232107","DOIUrl":"https://doi.org/10.37256/cnc.1120232107","url":null,"abstract":"This work proposes a flexible and scalable Smart Rural (SR) system for gathering and processing IoT data from remote rural areas with no traditional communication coverage as a handicap. We offer an architecture structured in distinct segments using emerging technologies such as IoT, 5G, Cloud and High Altitude Platform Station (HAPS). This proposal is applied to the rural environment to cover thus all the needs of the system in the collection of IoT data from these remote rural areas, its coverage by space vehicles and its processing and storage through 5G terrestrial networks and cloud services. The proposal includes the deployment of IoT sensors and the development of Amazon Web Services (AWS). On the other hand, the part of the space segment considered by HAPS has been simulated for different space channels. This way offers a complete and automated SR system that allows access to these IoT data from remote rural areas through the Internet.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86999581","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}
引用次数: 5
Whittle Index Based Age-of-Information Aware Scheduling for Markovian Channels 基于Whittle索引的马尔可夫信道信息年龄感知调度
IF 2 Q1 Computer Science Pub Date : 2022-12-30 DOI: 10.37256/cnc.1120231701
Bejjipuram Sombabu, Bhishma Dedhia, Sharayu Moharir
The focus of this work is on minimizing the time average of the weighted sum of the Age-of-Information in a multi-sensor system in the setting where all sensors report their measurements to a central monitoring station using a shared communication channel. We consider multiple information settings including complete CSI/delayed CSI/no CSI and two stochastic channel evolution models, i.e., i.i.d. channels and Markovian channels. In all settings considered, we prove the indexability of the scheduling problem. In addition, we compute the Whittle Index in closed form for some of the settings. Indexability for Markovian channels for the objective of minimizing AoI is a key contribution of this work. Further, under i.i.d. channels, we propose a novel efficient implementation for the Whittle Index-based policy. We use simulations to show that Whittle Index-based scheduling policies either outperform or match the performance of the state-of-the-art policies for all the settings considered.
这项工作的重点是在多传感器系统中,在所有传感器使用共享通信信道向中央监测站报告其测量结果的情况下,最小化加权信息年龄和的时间平均值。我们考虑了多种信息设置,包括完全CSI/延迟CSI/无CSI和两种随机通道演化模型,即i.i.d.通道和马尔可夫通道。在所有考虑的情况下,我们证明了调度问题的可索引性。此外,我们以封闭形式计算了一些设置的惠特尔指数。为了最小化AoI的目标,马尔可夫通道的可索引性是这项工作的关键贡献。此外,在i.i.d渠道下,我们提出了一种新的基于Whittle指数的有效实施策略。我们使用模拟来显示,对于所有考虑的设置,基于Whittle索引的调度策略的性能优于或匹配最先进策略的性能。
{"title":"Whittle Index Based Age-of-Information Aware Scheduling for Markovian Channels","authors":"Bejjipuram Sombabu, Bhishma Dedhia, Sharayu Moharir","doi":"10.37256/cnc.1120231701","DOIUrl":"https://doi.org/10.37256/cnc.1120231701","url":null,"abstract":"The focus of this work is on minimizing the time average of the weighted sum of the Age-of-Information in a multi-sensor system in the setting where all sensors report their measurements to a central monitoring station using a shared communication channel. We consider multiple information settings including complete CSI/delayed CSI/no CSI and two stochastic channel evolution models, i.e., i.i.d. channels and Markovian channels. In all settings considered, we prove the indexability of the scheduling problem. In addition, we compute the Whittle Index in closed form for some of the settings. Indexability for Markovian channels for the objective of minimizing AoI is a key contribution of this work. Further, under i.i.d. channels, we propose a novel efficient implementation for the Whittle Index-based policy. We use simulations to show that Whittle Index-based scheduling policies either outperform or match the performance of the state-of-the-art policies for all the settings considered.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80406561","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}
引用次数: 2
Large Scale LEO Satellite Networks for the Future Internet: Challenges and Solutions to Addressing and Routing 面向未来互联网的大规模低轨道卫星网络:寻址和路由的挑战和解决方案
IF 2 Q1 Computer Science Pub Date : 2022-12-30 DOI: 10.37256/cnc.1120232105
Lin Han, Alvaro Retana, Cedric Westphal, Richard Li
This document analyses the problems and challenges of addressing and routing to Low Earth Orbit (LEO) satellites used for the future Internet. It focuses on the scenario where Inter-Satellite-Links (ISL) are used for massive LEO satellite constellation. Such LEO satellite network is the key to the Non-terrestrial Network (NTN) integration with 5G and beyond. The paper describes two categories of solutions. One is based on IPv6 and another is based on a new protocol, New IP. The two categories of solutions are a) using new types of addresses for LEO satellites and b) new concepts for routing with these addresses. The semantic addressing scheme leverages the characteristics of satellites with known orbit elements; and simplifies the satellite identification by using limited indexes. The routing method combines semantic addressing with source routing and generates a new semantic routing scheme. Compared with traditional methods, the new proposals dramatically reduce the workload in satellite, such as table size, Ternary Content-addressable memory (TCAM) lookups, and packet header size. Thus it is more suitable to networks in space where the harsh environment limits the hardware performance, power consumption, link bandwidth and system complexity.
本文分析了未来互联网使用的低地球轨道(LEO)卫星寻址和路由的问题和挑战。重点研究了大规模LEO卫星星座使用星间链路(ISL)的场景。这种低轨道卫星网络是与5G及以后的非地面网络(NTN)融合的关键。本文描述了两类解决方案。一种基于IPv6,另一种基于新协议new IP。这两类解决方案是:a)为低轨道卫星使用新型地址;b)使用这些地址进行路由的新概念。语义寻址方案利用轨道元素已知的卫星特性;利用有限指标简化了卫星识别。该路由方法将语义寻址与源路由相结合,生成了一种新的语义路由方案。与传统方法相比,新方案显著降低了卫星通信系统的工作负荷,如表大小、三元内容可寻址存储器(TCAM)查找和包头大小。因此,它更适合于恶劣环境限制硬件性能、功耗、链路带宽和系统复杂性的空间网络。
{"title":"Large Scale LEO Satellite Networks for the Future Internet: Challenges and Solutions to Addressing and Routing","authors":"Lin Han, Alvaro Retana, Cedric Westphal, Richard Li","doi":"10.37256/cnc.1120232105","DOIUrl":"https://doi.org/10.37256/cnc.1120232105","url":null,"abstract":"This document analyses the problems and challenges of addressing and routing to Low Earth Orbit (LEO) satellites used for the future Internet. It focuses on the scenario where Inter-Satellite-Links (ISL) are used for massive LEO satellite constellation. Such LEO satellite network is the key to the Non-terrestrial Network (NTN) integration with 5G and beyond. The paper describes two categories of solutions. One is based on IPv6 and another is based on a new protocol, New IP. The two categories of solutions are a) using new types of addresses for LEO satellites and b) new concepts for routing with these addresses. The semantic addressing scheme leverages the characteristics of satellites with known orbit elements; and simplifies the satellite identification by using limited indexes. The routing method combines semantic addressing with source routing and generates a new semantic routing scheme. Compared with traditional methods, the new proposals dramatically reduce the workload in satellite, such as table size, Ternary Content-addressable memory (TCAM) lookups, and packet header size. Thus it is more suitable to networks in space where the harsh environment limits the hardware performance, power consumption, link bandwidth and system complexity.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78685871","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 Service Updates: A Multi-arm Bandit Approach 调度服务更新:多臂强盗方法
IF 2 Q1 Computer Science Pub Date : 2022-11-30 DOI: 10.37256/cnc.1120231686
V. S. C. L. Narayana, Sucheta Ravikanti, Harsh Deshpande, Sharayu Moharir
Software as a Service (SaaS) instances often use edge resources to serve their customers. The version of the service hosted at the edge needs to be periodically updated to maximize the utility derived by the customers. We focus on scheduling updates in the setting where the utility derived from a version is an unknown decreasing function of the time elapsed since the version was created. We map the scheduling problem to a multi-arm bandit and propose an update policy. We characterize its performance and compare it with the fundamental limit on the performance of any online policy.
软件即服务(SaaS)实例经常使用边缘资源为其客户提供服务。需要定期更新托管在边缘的服务版本,以最大限度地提高客户获得的效用。我们将重点放在以下设置中的更新调度上:从版本派生的实用程序是自版本创建以来所经过时间的未知递减函数。我们将调度问题映射到一个多臂强盗,并提出了一个更新策略。我们对其性能进行了表征,并将其与任何在线策略性能的基本限制进行了比较。
{"title":"Scheduling Service Updates: A Multi-arm Bandit Approach","authors":"V. S. C. L. Narayana, Sucheta Ravikanti, Harsh Deshpande, Sharayu Moharir","doi":"10.37256/cnc.1120231686","DOIUrl":"https://doi.org/10.37256/cnc.1120231686","url":null,"abstract":"Software as a Service (SaaS) instances often use edge resources to serve their customers. The version of the service hosted at the edge needs to be periodically updated to maximize the utility derived by the customers. We focus on scheduling updates in the setting where the utility derived from a version is an unknown decreasing function of the time elapsed since the version was created. We map the scheduling problem to a multi-arm bandit and propose an update policy. We characterize its performance and compare it with the fundamental limit on the performance of any online policy.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75868877","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
期刊
Journal of Computer Networks and Communications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1