In urban environments, efficiently decrypting CP-ABE in VANETs is a significant challenge due to the dynamic and resource-constrained nature of these networks. VANETs are critical for ITS that improve traffic management, safety, and infotainment through V2V and V2I communication. However, managing computational resources for CP-ABE decryption remains difficult. To address this, we propose a hybrid RL-DE algorithm. The RL agent dynamically adjusts the DE parameters using real-time vehicular data, employing Q-learning and policy gradient methods to learn optimal policies. This integration improves task distribution and decryption efficiency. The DE algorithm, enhanced with RL-adjusted parameters, performs mutation, crossover, and fitness evaluation, ensuring continuous adaptation and optimization. Experiments in a simulated urban VANET environment show that our algorithm significantly reduces decryption time, improves resource utilization, and enhances overall efficiency compared to traditional methods, providing a robust solution for dynamic urban settings.
{"title":"Optimizing CP-ABE Decryption in Urban VANETs: A Hybrid Reinforcement Learning and Differential Evolution Approach","authors":"Muhsen Alkhalidy;Mohammad Bany Taha;Rasel Chowdhury;Chamseddine Talhi;Hakima Ould-Slimane;Azzam Mourad","doi":"10.1109/OJCOMS.2024.3479069","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3479069","url":null,"abstract":"In urban environments, efficiently decrypting CP-ABE in VANETs is a significant challenge due to the dynamic and resource-constrained nature of these networks. VANETs are critical for ITS that improve traffic management, safety, and infotainment through V2V and V2I communication. However, managing computational resources for CP-ABE decryption remains difficult. To address this, we propose a hybrid RL-DE algorithm. The RL agent dynamically adjusts the DE parameters using real-time vehicular data, employing Q-learning and policy gradient methods to learn optimal policies. This integration improves task distribution and decryption efficiency. The DE algorithm, enhanced with RL-adjusted parameters, performs mutation, crossover, and fitness evaluation, ensuring continuous adaptation and optimization. Experiments in a simulated urban VANET environment show that our algorithm significantly reduces decryption time, improves resource utilization, and enhances overall efficiency compared to traditional methods, providing a robust solution for dynamic urban settings.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10714404","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518135","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}
Pub Date : 2024-10-10DOI: 10.1109/OJCOMS.2024.3477725
Thomas Stüber;Lukas Osswald;Michael Menth
Time-Sensitive Networking (TSN) extends Ethernet bridging with features for deterministic transmission. Periodic streams may be scheduled such that their frames hardly interfere in bridges. Additionally, the Time-Aware Shaper (TAS) can keep egress ports free from other traffic when scheduled traffic arrives. TAS scheduling determines transmission starts of scheduled streams at end stations and configures the TAS in bridges. Most TAS scheduling algorithms disregard jitter and synchronization errors at end stations and bridges, race conditions from simultaneously arriving frames with same egress ports, and hardware-based configuration limits of the TAS. We call the resulting schedules tight schedules (TS). However, all these challenges apply to real hardware bridges. Therefore, we present an algorithm using event times with uncertainty to compute efficient robust schedules (ERS) that respect these constraints. We also propose a repair for existing scheduling approaches and call their output naïve robust schedules (NRS). We evaluate and compare their bandwidth usage and stream admission with those of TS. ERS are more efficient than NRS, and the performance gap between ERS and TS quantifies the price for robust schedules. Moreover, the presented algorithm for ERS computes significantly faster than four well-known methods for TS, and it can solve larger problem instances.
时间敏感网络（TSN）通过确定性传输功能扩展了以太网桥接功能。可对周期性数据流进行调度，使其帧几乎不会干扰网桥。此外，时间感知整形器（TAS）还能在预定流量到达时保持出口端口无其他流量。TAS 调度可确定终端站的计划流传输起始点，并在网桥中配置 TAS。大多数 TAS 调度算法都会忽略终端站和网桥的抖动和同步错误、同一出口端口同时到达的帧所产生的竞赛条件以及 TAS 基于硬件的配置限制。我们将由此产生的调度称为紧密调度（TS）。然而，所有这些挑战都适用于真实的硬件网桥。因此，我们提出了一种算法，利用具有不确定性的事件时间来计算尊重这些约束条件的高效稳健调度（ERS）。我们还提出了一种修复现有调度方法的方法，并将其输出称为天真鲁棒调度（NRS）。我们评估并比较了它们与 TS 的带宽使用和流接纳情况。ERS 比 NRS 更有效，ERS 和 TS 之间的性能差距量化了稳健调度的价格。此外，所介绍的 ERS 算法的计算速度明显快于四种著名的 TS 方法，而且可以解决更大的问题实例。
{"title":"Efficient Robust Schedules (ERS) for Time-Aware Shaping in Time-Sensitive Networking","authors":"Thomas Stüber;Lukas Osswald;Michael Menth","doi":"10.1109/OJCOMS.2024.3477725","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3477725","url":null,"abstract":"Time-Sensitive Networking (TSN) extends Ethernet bridging with features for deterministic transmission. Periodic streams may be scheduled such that their frames hardly interfere in bridges. Additionally, the Time-Aware Shaper (TAS) can keep egress ports free from other traffic when scheduled traffic arrives. TAS scheduling determines transmission starts of scheduled streams at end stations and configures the TAS in bridges. Most TAS scheduling algorithms disregard jitter and synchronization errors at end stations and bridges, race conditions from simultaneously arriving frames with same egress ports, and hardware-based configuration limits of the TAS. We call the resulting schedules tight schedules (TS). However, all these challenges apply to real hardware bridges. Therefore, we present an algorithm using event times with uncertainty to compute efficient robust schedules (ERS) that respect these constraints. We also propose a repair for existing scheduling approaches and call their output naïve robust schedules (NRS). We evaluate and compare their bandwidth usage and stream admission with those of TS. ERS are more efficient than NRS, and the performance gap between ERS and TS quantifies the price for robust schedules. Moreover, the presented algorithm for ERS computes significantly faster than four well-known methods for TS, and it can solve larger problem instances.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10713245","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517968","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}
Pub Date : 2024-10-10DOI: 10.1109/OJCOMS.2024.3477930
Ziyi Zhou;Oluwakayode Onireti;Xinyi Lin;Lei Zhang;Muhammad Ali Imran
Blockchain has shown significant potential as a key enabler in privacy and security in the forthcoming 6G wireless network, due to its distributed and decentralized characteristics. Practical Byzantine fault tolerance (PBFT) emerges as a prominent technology for deployment in wireless networks due to its attributes of low latency, high throughput, and minimal computational requirements. However, the high complexity of communication is the bottleneck of PBFT for achieving high scalability. To tackle this problem, this paper proposes a novel framework of PBFT, where the inter-node communication during the normal case operation is completed through base stations. The uplink and downlink communication between the base station and nodes are modelled based on the signal-to-interference-plus-noise ratio (SINR) threshold. A novel ‘timeout’ mechanism is incorporated to reduce the communication complexity. The performance is evaluated by metrics including consensus success probability, communication complexity, view change delay, view change occurrence probability, consensus delay, consensus throughput and energy consumption. The numerical results show that the proposed scheme achieves higher consensus success probability and throughput, lower communication complexity and consensus delay compared to the conventional PBFT. The results of view change delay and view change occurrence probability and the optimal configuration provide analytical guidance for the deployment of wireless PBFT networks.
{"title":"Implementing Practical Byzantine Fault Tolerance Over Cellular Networks","authors":"Ziyi Zhou;Oluwakayode Onireti;Xinyi Lin;Lei Zhang;Muhammad Ali Imran","doi":"10.1109/OJCOMS.2024.3477930","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3477930","url":null,"abstract":"Blockchain has shown significant potential as a key enabler in privacy and security in the forthcoming 6G wireless network, due to its distributed and decentralized characteristics. Practical Byzantine fault tolerance (PBFT) emerges as a prominent technology for deployment in wireless networks due to its attributes of low latency, high throughput, and minimal computational requirements. However, the high complexity of communication is the bottleneck of PBFT for achieving high scalability. To tackle this problem, this paper proposes a novel framework of PBFT, where the inter-node communication during the normal case operation is completed through base stations. The uplink and downlink communication between the base station and nodes are modelled based on the signal-to-interference-plus-noise ratio (SINR) threshold. A novel ‘timeout’ mechanism is incorporated to reduce the communication complexity. The performance is evaluated by metrics including consensus success probability, communication complexity, view change delay, view change occurrence probability, consensus delay, consensus throughput and energy consumption. The numerical results show that the proposed scheme achieves higher consensus success probability and throughput, lower communication complexity and consensus delay compared to the conventional PBFT. The results of view change delay and view change occurrence probability and the optimal configuration provide analytical guidance for the deployment of wireless PBFT networks.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10713236","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518030","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}
Pub Date : 2024-10-09DOI: 10.1109/OJCOMS.2024.3476454
Litao Yan;Xiaohu Ge
The relationship between energy dissipation and information has been extensively studied in the emerging field of stochastic thermodynamics, where entropy production plays a core role in measuring the energy loss of irreversible processes. To analyze and optimize the energy efficiency of wireless communication systems from a fundamental and unified perspective, an entropy production model of a binary wireless communication systems is proposed in this paper for the first time. The proposed model serves as a minimal yet comprehensive model incorporating two key nonequilibrium processes in a wireless communication system: wireless information transmission and information processing. The entropy production of wireless information transmission is derived using tools from stochastic thermodynamics, and it is found that there is a specified transmission rate that minimizes the entropy production. For the information processing, the influence of error rate and parallel number of information processing on entropy production is analyzed, and a serial or parallel processing selection criterion is proposed to minimizes the entropy production. To minimize the total entropy production of wireless communication systems, we propose an optimal channel number algorithm and an optimal time allocation scheme. Simulation results show that the entropy production of the wireless communication system using the optimal time allocation scheme can be reduced by up to 20.2% compared to the traditional approach where the time allocated for wireless information transmission and information processing is equal. The proposed model and optimization method provide a novel perspective on analyzing and enhancing energy efficiency in wireless communication systems.
{"title":"Entropy Production-Based Energy Efficiency Optimization for Wireless Communication Systems","authors":"Litao Yan;Xiaohu Ge","doi":"10.1109/OJCOMS.2024.3476454","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3476454","url":null,"abstract":"The relationship between energy dissipation and information has been extensively studied in the emerging field of stochastic thermodynamics, where entropy production plays a core role in measuring the energy loss of irreversible processes. To analyze and optimize the energy efficiency of wireless communication systems from a fundamental and unified perspective, an entropy production model of a binary wireless communication systems is proposed in this paper for the first time. The proposed model serves as a minimal yet comprehensive model incorporating two key nonequilibrium processes in a wireless communication system: wireless information transmission and information processing. The entropy production of wireless information transmission is derived using tools from stochastic thermodynamics, and it is found that there is a specified transmission rate that minimizes the entropy production. For the information processing, the influence of error rate and parallel number of information processing on entropy production is analyzed, and a serial or parallel processing selection criterion is proposed to minimizes the entropy production. To minimize the total entropy production of wireless communication systems, we propose an optimal channel number algorithm and an optimal time allocation scheme. Simulation results show that the entropy production of the wireless communication system using the optimal time allocation scheme can be reduced by up to 20.2% compared to the traditional approach where the time allocated for wireless information transmission and information processing is equal. The proposed model and optimization method provide a novel perspective on analyzing and enhancing energy efficiency in wireless communication systems.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10711877","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517784","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}
Pub Date : 2024-10-07DOI: 10.1109/OJCOMS.2024.3474772
Tien Hoa Nguyen;Kieu Ha Phung
This paper proposes the performance of a novel ambient-backscatter communication (AmBC)-assisted mobility vehicle system with partial non-orthogonal multiple access (NOMA) systems, where a jointly composite signal of NOMA and orthogonal multiple access (OMA) transmission is investigated to enhance the performance of the vehicle with high mobility and weak channel conditions in light of imperfect channel state information (CSI) and imperfect successive interference cancellation (SIC). Following that, we first derive exact closed-form expressions for the outage probability (OP) and ergodic capacity (EC) of vehicles and then conduct an asymptotic analysis in case of high signal-to-noise (SNR), gaining value information related to diversity order, modulation and coding gains, and ergodic slope. Through these mathematical frameworks, we clarify trade-offs in channel estimation procedure and vehicle performance, the advantages of partial NOMA in speeding up transmission rate operation area of weak vehicles compared to conventional NOMA, and the impact of imperfect SIC on the system outage performance. Monte-Carlo simulation examples validate the theoretical frameworks, along with several performance comparisons of the proposed partial NOMA and conventional NOMA. Moreover, it also shows that increasing the exploited portion bandwidth coefficient for individually serving vehicles with a weak channel condition enhances the operating target significantly without an outage event. Furthermore, exploiting partial NOMA for vehicles with a weak channel condition can save the transmit SNR of over 5 dB compared to using conventional NOMA while ensuring the performance of the rest vehicle.
{"title":"AmBC-Assisted Mobility Vehicle System With Partial NOMA Transmission","authors":"Tien Hoa Nguyen;Kieu Ha Phung","doi":"10.1109/OJCOMS.2024.3474772","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3474772","url":null,"abstract":"This paper proposes the performance of a novel ambient-backscatter communication (AmBC)-assisted mobility vehicle system with partial non-orthogonal multiple access (NOMA) systems, where a jointly composite signal of NOMA and orthogonal multiple access (OMA) transmission is investigated to enhance the performance of the vehicle with high mobility and weak channel conditions in light of imperfect channel state information (CSI) and imperfect successive interference cancellation (SIC). Following that, we first derive exact closed-form expressions for the outage probability (OP) and ergodic capacity (EC) of vehicles and then conduct an asymptotic analysis in case of high signal-to-noise (SNR), gaining value information related to diversity order, modulation and coding gains, and ergodic slope. Through these mathematical frameworks, we clarify trade-offs in channel estimation procedure and vehicle performance, the advantages of partial NOMA in speeding up transmission rate operation area of weak vehicles compared to conventional NOMA, and the impact of imperfect SIC on the system outage performance. Monte-Carlo simulation examples validate the theoretical frameworks, along with several performance comparisons of the proposed partial NOMA and conventional NOMA. Moreover, it also shows that increasing the exploited portion bandwidth coefficient for individually serving vehicles with a weak channel condition enhances the operating target significantly without an outage event. Furthermore, exploiting partial NOMA for vehicles with a weak channel condition can save the transmit SNR of over 5 dB compared to using conventional NOMA while ensuring the performance of the rest vehicle.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10706110","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142555071","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}
The ubiquitous availability of wireless networks and devices provides a unique opportunity to leverage the corresponding communication signals to enable wireless sensing applications. In this article, we develop a new framework for environment sensing by opportunistic use of the mmWave communication signals. The proposed framework is based on a mixture of the conventional and Neural Network (NN) signal processing techniques for simultaneous counting and localization of multiple targets in the environment in a bi-static setting. In this framework, multi-modal delay, Doppler, angular features are first derived from the Channel State Information (CSI) estimated at the receiver, and then a transformer-based NN architecture exploiting attention mechanisms, called CSIformer, is designed to extract the most effective features for sensing. We also develop a novel post-processing technique based on Kullback-Leibler (KL) minimization to transfer knowledge between the counting and localization tasks, thereby simplifying the NN architecture. Our numerical results show accurate counting and localization capabilities that significantly outperform the existing works based on pure conventional signal processing techniques, as well as NN-based approaches. The simulation codes are available at: https://github.com/University-of-Surrey-Mahdi/Attention-on-the-Preambles-Sensing-with-mmWave-CSI .
无处不在的无线网络和设备为利用相应的通信信号实现无线传感应用提供了独特的机会。在这篇文章中，我们开发了一种新的框架，通过伺机利用毫米波通信信号来实现环境传感。所提出的框架基于传统信号处理技术和神经网络（NN）信号处理技术的混合，用于在双静态环境中同时对环境中的多个目标进行计数和定位。在该框架中，首先从接收器估算的信道状态信息（CSI）中提取多模态延迟、多普勒和角度特征，然后设计一个利用注意力机制的基于变压器的神经网络架构（称为 CSIformer），以提取最有效的感测特征。我们还开发了一种基于 Kullback-Leibler (KL) 最小化的新型后处理技术，在计数和定位任务之间传递知识，从而简化了 NN 架构。我们的数值结果表明，精确的计数和定位能力明显优于基于纯传统信号处理技术的现有作品以及基于 NN 的方法。仿真代码请访问：https://github.com/University-of-Surrey-Mahdi/Attention-on-the-Preambles-Sensing-with-mmWave-CSI。
{"title":"Attention on the Preambles: Sensing With mmWave CSI","authors":"Tatsuya Kikuzuki;Mahdi Boloursaz Mashhadi;Yi Ma;Rahim Tafazolli","doi":"10.1109/OJCOMS.2024.3475989","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3475989","url":null,"abstract":"The ubiquitous availability of wireless networks and devices provides a unique opportunity to leverage the corresponding communication signals to enable wireless sensing applications. In this article, we develop a new framework for environment sensing by opportunistic use of the mmWave communication signals. The proposed framework is based on a mixture of the conventional and Neural Network (NN) signal processing techniques for simultaneous counting and localization of multiple targets in the environment in a bi-static setting. In this framework, multi-modal delay, Doppler, angular features are first derived from the Channel State Information (CSI) estimated at the receiver, and then a transformer-based NN architecture exploiting attention mechanisms, called CSIformer, is designed to extract the most effective features for sensing. We also develop a novel post-processing technique based on Kullback-Leibler (KL) minimization to transfer knowledge between the counting and localization tasks, thereby simplifying the NN architecture. Our numerical results show accurate counting and localization capabilities that significantly outperform the existing works based on pure conventional signal processing techniques, as well as NN-based approaches. The simulation codes are available at: \u0000<uri>https://github.com/University-of-Surrey-Mahdi/Attention-on-the-Preambles-Sensing-with-mmWave-CSI</uri>\u0000.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10706812","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142447211","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}
Pub Date : 2024-10-04DOI: 10.1109/OJCOMS.2024.3474571
Selen Gecgel Cetin;Ángeles Vazquez-Castro;Gunes Karabulut Kurt
The Moon and its surrounding cislunar space have numerous unknowns, uncertainties, or partially charted phenomena that need to be investigated to determine the extent to which they affect cislunar communication. These include temperature fluctuations, spacecraft distance and velocity dynamics, surface roughness, and the diversity of propagation mechanisms. To develop robust and dynamically operative Cislunar space networks (CSNs), we need to analyze the communication system by incorporating inclusive models that account for the wide range of possible propagation environments and noise characteristics. In this paper, we consider that the communication signal can be subjected to both Gaussian and non-Gaussian noise, but also to different fading conditions. First, we analyze the communication link by showing the relationship between the brightness temperatures of the Moon and the equivalent noise temperature at the receiver of the Lunar Gateway. We propose to analyze the ergodic capacity and the outage probability, as they are essential metrics for the development of reliable communication. In particular, we model the noise with the additive symmetric alpha-stable distribution, which allows a generic analysis for Gaussian and non-Gaussian signal characteristics. Then, we present the closed-form bounds for the ergodic capacity and the outage probability. Finally, the results show the theoretically and operationally achievable performance bounds for the cislunar communication. To give insight into further designs, we also provide our results with comprehensive system settings that include mission objectives as well as orbital and system dynamics.
{"title":"Cislunar Communication Performance and System Analysis With Uncharted Phenomena","authors":"Selen Gecgel Cetin;Ángeles Vazquez-Castro;Gunes Karabulut Kurt","doi":"10.1109/OJCOMS.2024.3474571","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3474571","url":null,"abstract":"The Moon and its surrounding cislunar space have numerous unknowns, uncertainties, or partially charted phenomena that need to be investigated to determine the extent to which they affect cislunar communication. These include temperature fluctuations, spacecraft distance and velocity dynamics, surface roughness, and the diversity of propagation mechanisms. To develop robust and dynamically operative Cislunar space networks (CSNs), we need to analyze the communication system by incorporating inclusive models that account for the wide range of possible propagation environments and noise characteristics. In this paper, we consider that the communication signal can be subjected to both Gaussian and non-Gaussian noise, but also to different fading conditions. First, we analyze the communication link by showing the relationship between the brightness temperatures of the Moon and the equivalent noise temperature at the receiver of the Lunar Gateway. We propose to analyze the ergodic capacity and the outage probability, as they are essential metrics for the development of reliable communication. In particular, we model the noise with the additive symmetric alpha-stable distribution, which allows a generic analysis for Gaussian and non-Gaussian signal characteristics. Then, we present the closed-form bounds for the ergodic capacity and the outage probability. Finally, the results show the theoretically and operationally achievable performance bounds for the cislunar communication. To give insight into further designs, we also provide our results with comprehensive system settings that include mission objectives as well as orbital and system dynamics.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10705126","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142447210","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}
Pub Date : 2024-10-04DOI: 10.1109/OJCOMS.2024.3474170
Eduardo N. Tominaga;Onel L. A. López;Tommy Svensson;Richard D. Souza;Hirley Alves
The Fifth-Generation (5G) wireless communications networks introduced native support for Machine-Type Communications (MTC) use cases. Nevertheless, current 5G networks cannot fully meet the very stringent requirements regarding latency, reliability, and number of connected devices of most MTC use cases. Industry and academia have been working on the evolution from 5G to Sixth Generation (6G) networks. One of the main novelties is adopting Distributed Multiple-Input Multiple-Output (D-MIMO) networks. However, most works studying D-MIMO consider antenna arrays with no movement capabilities, even though some recent works have shown that this could bring substantial performance improvements. In this work, we propose the utilization of Access Points (APs) equipped with Rotary Uniform Linear Arrays (RULAs) for this purpose. Considering a spatially correlated Rician fading model, the optimal angular position of the RULAs is jointly computed by the central processing unit using particle swarm optimization as a function of the location of the active devices. Considering the impact of imperfect location estimates, our numerical results show that the RULAs’s optimal rotation brings substantial performance gains in terms of mean per-user spectral efficiency. The improvement grows with the strength of the line-of-sight components of the channel vectors. Given the total number of antenna elements, we study the trade-off between the number of APs and the number of antenna elements per AP, revealing an optimal number of APs for the cases of APs equipped with static ULAs and RULAs.
{"title":"Distributed MIMO Networks With Rotary ULAs for Indoor Scenarios Under Rician Fading","authors":"Eduardo N. Tominaga;Onel L. A. López;Tommy Svensson;Richard D. Souza;Hirley Alves","doi":"10.1109/OJCOMS.2024.3474170","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3474170","url":null,"abstract":"The Fifth-Generation (5G) wireless communications networks introduced native support for Machine-Type Communications (MTC) use cases. Nevertheless, current 5G networks cannot fully meet the very stringent requirements regarding latency, reliability, and number of connected devices of most MTC use cases. Industry and academia have been working on the evolution from 5G to Sixth Generation (6G) networks. One of the main novelties is adopting Distributed Multiple-Input Multiple-Output (D-MIMO) networks. However, most works studying D-MIMO consider antenna arrays with no movement capabilities, even though some recent works have shown that this could bring substantial performance improvements. In this work, we propose the utilization of Access Points (APs) equipped with Rotary Uniform Linear Arrays (RULAs) for this purpose. Considering a spatially correlated Rician fading model, the optimal angular position of the RULAs is jointly computed by the central processing unit using particle swarm optimization as a function of the location of the active devices. Considering the impact of imperfect location estimates, our numerical results show that the RULAs’s optimal rotation brings substantial performance gains in terms of mean per-user spectral efficiency. The improvement grows with the strength of the line-of-sight components of the channel vectors. Given the total number of antenna elements, we study the trade-off between the number of APs and the number of antenna elements per AP, revealing an optimal number of APs for the cases of APs equipped with static ULAs and RULAs.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10705116","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142438491","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}
Pub Date : 2024-10-04DOI: 10.1109/OJCOMS.2024.3474290
Nadir Adam;Mansoor Ali;Faisal Naeem;Abdallah S. Ghazy;Georges Kaddoum
With the growing interest that is being shown in marine resources, the concept of the Internet of Things (IoT) has been extended to underwater scenarios, which has given rise to the Internet of Underwater Things (IoUT). The IoUT encompasses a network of interconnected intelligent underwater devices that can be used to monitor underwater environments and support various applications, such as underwater exploration, disaster prevention, and environmental monitoring. Advances in underwater wireless communication and sensor technologies have propelled the IoUT concept forward. However, the IoUT faces significant challenges. The harsh and vast underwater environment makes information sensing particularly difficult and leads to insufficient or inaccurate data being collected. Additionally, underwater conditions like pressure variation, hydrological characteristics, temperature changes, water currents, and topography hinder conventional communication models and make data transmission difficult and inefficient. Security in IoUT networks is a critical concern due to hardware limitations and seawater channel imperfections. Constrained sensor nodes and spatial-temporal uncertainty introduced by node mobility further complicate security provisioning. This survey paper addresses these challenges by offering a comprehensive overview of IoUT security. The investigation thoroughly examines both traditional and classic machine learning techniques and focuses on deploying advanced technologies such as federated learning and digital twin. The study effectively addresses integration challenges and open issues and provides a roadmap for future directions to play a pivotal role in formulating robust security mechanisms for IoUT networks.
{"title":"State-of-the-Art Security Schemes for the Internet of Underwater Things: A Holistic Survey","authors":"Nadir Adam;Mansoor Ali;Faisal Naeem;Abdallah S. Ghazy;Georges Kaddoum","doi":"10.1109/OJCOMS.2024.3474290","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3474290","url":null,"abstract":"With the growing interest that is being shown in marine resources, the concept of the Internet of Things (IoT) has been extended to underwater scenarios, which has given rise to the Internet of Underwater Things (IoUT). The IoUT encompasses a network of interconnected intelligent underwater devices that can be used to monitor underwater environments and support various applications, such as underwater exploration, disaster prevention, and environmental monitoring. Advances in underwater wireless communication and sensor technologies have propelled the IoUT concept forward. However, the IoUT faces significant challenges. The harsh and vast underwater environment makes information sensing particularly difficult and leads to insufficient or inaccurate data being collected. Additionally, underwater conditions like pressure variation, hydrological characteristics, temperature changes, water currents, and topography hinder conventional communication models and make data transmission difficult and inefficient. Security in IoUT networks is a critical concern due to hardware limitations and seawater channel imperfections. Constrained sensor nodes and spatial-temporal uncertainty introduced by node mobility further complicate security provisioning. This survey paper addresses these challenges by offering a comprehensive overview of IoUT security. The investigation thoroughly examines both traditional and classic machine learning techniques and focuses on deploying advanced technologies such as federated learning and digital twin. The study effectively addresses integration challenges and open issues and provides a roadmap for future directions to play a pivotal role in formulating robust security mechanisms for IoUT networks.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10705129","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517969","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}
Federated learning (FL) is an emerging machine learning paradigm that enables the participants to train a global model without sharing the training data. Recently, FL has been widely deployed in industrial IoT scenarios because of its data privacy and scalability. However, the current FL architecture relies on a central server to orchestrate the FL process, thus incurring a risk of privacy leakage and single-point failure. To address this issue, we propose a fully decentralized FL architecture based on blockchain technology. Unlike existing blockchain-based FL systems that use blockchain for coordination or storage, we use blockchain as a trustable computing platform for model aggregation. Furthermore, we model the interaction between the FL task publisher and participants as a Stackelberg game and design a rewarding mechanism to incentivize participants to contribute to the FL task. We build a prototype system of the proposed decentralized FL architecture and implement an FL-based damaged package detection application to evaluate the proposed approach. Experimental results show that the blockchain-based decentralized FL is feasible in a practical industrial IoT scenario, and the incentive mechanism performs well with real application data.
{"title":"Blockchain-Based Decentralized Federated Learning With On-Chain Model Aggregation and Incentive Mechanism for Industrial IoT","authors":"Qing Yang;Wei Xu;Taotao Wang;Hao Wang;Xiaoxiao Wu;Bin Cao;Shengli Zhang","doi":"10.1109/OJCOMS.2024.3471621","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3471621","url":null,"abstract":"Federated learning (FL) is an emerging machine learning paradigm that enables the participants to train a global model without sharing the training data. Recently, FL has been widely deployed in industrial IoT scenarios because of its data privacy and scalability. However, the current FL architecture relies on a central server to orchestrate the FL process, thus incurring a risk of privacy leakage and single-point failure. To address this issue, we propose a fully decentralized FL architecture based on blockchain technology. Unlike existing blockchain-based FL systems that use blockchain for coordination or storage, we use blockchain as a trustable computing platform for model aggregation. Furthermore, we model the interaction between the FL task publisher and participants as a Stackelberg game and design a rewarding mechanism to incentivize participants to contribute to the FL task. We build a prototype system of the proposed decentralized FL architecture and implement an FL-based damaged package detection application to evaluate the proposed approach. Experimental results show that the blockchain-based decentralized FL is feasible in a practical industrial IoT scenario, and the incentive mechanism performs well with real application data.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10701002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142447092","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：