Pub Date : 2024-06-24DOI: 10.1109/OJVT.2024.3418201
Safa Hamdare;David J. Brown;Yue Cao;Mohammad Aljaidi;Omprakash Kaiwartya;Rahul Yadav;Pratik Vyas;Manish Jugran
The widespread adoption of Electric Vehicles (EV) has emphasized the urgent need for efficient and secure charging infrastructure. While existing research in EV charging infrastructure has primarily concentrated on minimizing charging time at charging stations (CSs), neglecting security-centric charging optimization, particularly with scaled charging infrastructure considering multiple CSs. To address this gap, this paper presents an enhanced Hybrid-Electric Vehicle Charging Management and Security (H-EVCMS) framework. The H-EVCMS framework is meticulously designed to optimize charging price, manage load balancing, and provide security across multiple CS by leveraging the Open Charge Point Protocol (OCPP). The proposed framework's performance is evaluated by examining various charging scenarios and analyzing the booking and power consumption patterns of each CS. The results demonstrate the advantages of the hybrid approach used by the proposed H-EVCMS over traditional charging infrastructure management, showcasing its potential to address the challenges of scaling EV charging infrastructure while ensuring security and efficiency.
{"title":"EV Charging Management and Security for Multi-Charging Stations Environment","authors":"Safa Hamdare;David J. Brown;Yue Cao;Mohammad Aljaidi;Omprakash Kaiwartya;Rahul Yadav;Pratik Vyas;Manish Jugran","doi":"10.1109/OJVT.2024.3418201","DOIUrl":"https://doi.org/10.1109/OJVT.2024.3418201","url":null,"abstract":"The widespread adoption of Electric Vehicles (EV) has emphasized the urgent need for efficient and secure charging infrastructure. While existing research in EV charging infrastructure has primarily concentrated on minimizing charging time at charging stations (CSs), neglecting security-centric charging optimization, particularly with scaled charging infrastructure considering multiple CSs. To address this gap, this paper presents an enhanced Hybrid-Electric Vehicle Charging Management and Security (H-EVCMS) framework. The H-EVCMS framework is meticulously designed to optimize charging price, manage load balancing, and provide security across multiple CS by leveraging the Open Charge Point Protocol (OCPP). The proposed framework's performance is evaluated by examining various charging scenarios and analyzing the booking and power consumption patterns of each CS. The results demonstrate the advantages of the hybrid approach used by the proposed H-EVCMS over traditional charging infrastructure management, showcasing its potential to address the challenges of scaling EV charging infrastructure while ensuring security and efficiency.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"5 ","pages":"807-824"},"PeriodicalIF":5.3,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10569090","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141583486","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-06-06DOI: 10.1109/OJVT.2024.3410834
Toluwaleke Olutayo;Benoit Champagne
This article addresses the problem of symbol detection in time-varying Massive Multiple-Input Multiple-Output (M-MIMO) systems. While conventional detection techniques either exhibit subpar performance or impose excessive computational burdens in such systems, learning-based methods which have shown great potential in stationary scenarios, struggle to adapt to non-stationary conditions. To address these challenges, we introduce innovative extensions to the Learned Conjugate Gradient Network (LcgNet) M-MIMO detector. Firstly, we expound Preconditioned LcgNet (PrLcgNet), which incorporates a preconditioner during training to enhance the uplink M-MIMO detector's filter matrix. This modification enables the detector to achieve faster convergence with fewer layers compared to the original approach. Secondly, we introduce an adaptation of PrLcgNet referred to as Dynamic Conjugate Gradient Network (DyCoGNet), specifically designed for time-varying environments. DyCoGNet leverages self-supervised learning with Forward Error Correction (FEC), enabling autonomous adaptation without the need for explicit labeled data. It also employs meta-learning, facilitating rapid adaptation to unforeseen channel conditions. Our simulation results demonstrate that in stationary scenarios, PrLcgNet achieves faster convergence than LCgNet, which can be leveraged to reduce system complexity or improve Symbol Error Rate (SER) performance. Furthermore, in non-stationary scenarios, DyCoGNet exhibits rapid and efficient adaptation, achieving significant SER performance gains compared to baseline cases without meta-learning and a recent benchmark using self-supervised learning.
{"title":"Dynamic Conjugate Gradient Unfolding for Symbol Detection in Time-Varying Massive MIMO","authors":"Toluwaleke Olutayo;Benoit Champagne","doi":"10.1109/OJVT.2024.3410834","DOIUrl":"https://doi.org/10.1109/OJVT.2024.3410834","url":null,"abstract":"This article addresses the problem of symbol detection in time-varying Massive Multiple-Input Multiple-Output (M-MIMO) systems. While conventional detection techniques either exhibit subpar performance or impose excessive computational burdens in such systems, learning-based methods which have shown great potential in stationary scenarios, struggle to adapt to non-stationary conditions. To address these challenges, we introduce innovative extensions to the Learned Conjugate Gradient Network (LcgNet) M-MIMO detector. Firstly, we expound Preconditioned LcgNet (PrLcgNet), which incorporates a preconditioner during training to enhance the uplink M-MIMO detector's filter matrix. This modification enables the detector to achieve faster convergence with fewer layers compared to the original approach. Secondly, we introduce an adaptation of PrLcgNet referred to as Dynamic Conjugate Gradient Network (DyCoGNet), specifically designed for time-varying environments. DyCoGNet leverages self-supervised learning with Forward Error Correction (FEC), enabling autonomous adaptation without the need for explicit labeled data. It also employs meta-learning, facilitating rapid adaptation to unforeseen channel conditions. Our simulation results demonstrate that in stationary scenarios, PrLcgNet achieves faster convergence than LCgNet, which can be leveraged to reduce system complexity or improve Symbol Error Rate (SER) performance. Furthermore, in non-stationary scenarios, DyCoGNet exhibits rapid and efficient adaptation, achieving significant SER performance gains compared to baseline cases without meta-learning and a recent benchmark using self-supervised learning.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"5 ","pages":"792-806"},"PeriodicalIF":5.3,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551475","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141439460","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}
Sixth generation (6G) networks must guarantee radio-resource availability for coexisting users and machines. Here, non-orthogonal multiple access (NOMA) can address resource limitations by serving multiple devices on the same spectral and temporal resources. Meanwhile, cooperative relays can mitigate the impact with excessive large- and small-scale fading and interference. Still, to unlock the full potential of NOMA in 6G deployments, its performance must be analyzed under interference-limited scenarios with NOMA communications occuring across multiple cells. In this paper, the detrimental effect of co-channel interference (CCI) from nearby NOMA transmissions on a relay-aided NOMA network is examined. More specifically, randomly deployed CCI terminals communicate using NOMA and degrade the uplink communication. Network performance is thoroughly analyzed for various metrics, considering independent and identically distributed non-orthogonal CCI. Furthermore, for improved performance, transmit power, power allocation, and relay location optimization is presented. This scenario can correspond to Industry 4.0 settings, relying on private networks that can adjust the transmit power of interferers within the network. Our analytical findings are verified through Monte-Carlo simulations, revealing that non-orthogonal CCI degrades the system performance, causing system coding gain losses. Nonetheless, the proposed optimization framework can mitigate the impact of non-orthogonal CCI and ensure improved uplink performance.
第六代(6G)网络必须保证共存用户和机器的无线电资源可用性。在这方面,非正交多址接入(NOMA)可以通过在相同的频谱和时间资源上为多个设备提供服务来解决资源限制问题。同时,合作中继可减轻大、小范围过度衰落和干扰的影响。不过,要在 6G 部署中释放 NOMA 的全部潜力,必须分析其在干扰受限场景下的性能,即 NOMA 通信跨越多个小区。本文研究了来自附近 NOMA 传输的同信道干扰(CCI)对中继辅助 NOMA 网络的不利影响。更具体地说,随机部署的 CCI 终端使用 NOMA 进行通信,会降低上行链路通信性能。考虑到独立且同分布的非正交 CCI,针对各种指标对网络性能进行了全面分析。此外,为了提高性能,还介绍了发射功率、功率分配和中继位置优化。这种情况可以对应工业 4.0 的设置,依赖于可以调整网络内干扰者发射功率的专用网络。通过蒙特卡洛模拟验证了我们的分析结果,发现非正交 CCI 会降低系统性能,造成系统编码增益损失。然而,所提出的优化框架可以减轻非正交 CCI 的影响,确保改善上行链路性能。
{"title":"Relay-Aided Uplink NOMA Under Non-Orthogonal CCI and Imperfect SIC in 6G Networks","authors":"Volkan Özduran;Nikolaos Nomikos;Ehsan Soleimani-Nasab;Imran Shafique Ansari;Panagiotis Trakadas","doi":"10.1109/OJVT.2024.3392951","DOIUrl":"https://doi.org/10.1109/OJVT.2024.3392951","url":null,"abstract":"Sixth generation (6G) networks must guarantee radio-resource availability for coexisting users and machines. Here, non-orthogonal multiple access (NOMA) can address resource limitations by serving multiple devices on the same spectral and temporal resources. Meanwhile, cooperative relays can mitigate the impact with excessive large- and small-scale fading and interference. Still, to unlock the full potential of NOMA in 6G deployments, its performance must be analyzed under interference-limited scenarios with NOMA communications occuring across multiple cells. In this paper, the detrimental effect of co-channel interference (CCI) from nearby NOMA transmissions on a relay-aided NOMA network is examined. More specifically, randomly deployed CCI terminals communicate using NOMA and degrade the uplink communication. Network performance is thoroughly analyzed for various metrics, considering independent and identically distributed non-orthogonal CCI. Furthermore, for improved performance, transmit power, power allocation, and relay location optimization is presented. This scenario can correspond to Industry 4.0 settings, relying on private networks that can adjust the transmit power of interferers within the network. Our analytical findings are verified through Monte-Carlo simulations, revealing that non-orthogonal CCI degrades the system performance, causing system coding gain losses. Nonetheless, the proposed optimization framework can mitigate the impact of non-orthogonal CCI and ensure improved uplink performance.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"5 ","pages":"658-680"},"PeriodicalIF":6.4,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10508052","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140950957","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-04-19DOI: 10.1109/OJVT.2024.3391380
Muhammad Haris;Dost Muhammad Saqib Bhatti;Haewoon Nam
Particle Swarm Optimization (PSO) stands as a cornerstone among population-based swarm intelligence algorithms, serving as a versatile tool to tackle diverse scientific and engineering optimization challenges due to its straightforward implementation and promising optimization capabilities. Nonetheless, PSO has its limitations, notably its propensity for slow convergence. Traditionally, PSO operates by guiding swarms through positions determined by their initial velocities and acceleration components, encompassing cognitive and social information. In pursuit of expedited convergence, we introduce a novel approach: the Cognitive and Social Information-Based Hyperbolic Tangent Particle Swarm Optimization (HT-PSO) algorithm. This innovation draws inspiration from the activation functions employed in neural networks, with the singular aim of accelerating convergence. To combat the issue of slow convergence, we reengineer the cognitive and social acceleration coefficients of the PSO algorithm, leveraging the power of the hyperbolic tangent function. This strategic adjustment fosters a dynamic balance between exploration and exploitation, unleashing PSO's full potential. Our experimental trials encompass thirteen benchmark functions spanning unimodal and multimodal landscapes. Besides that, the proposed algorithm is also applied to different UAV path planning scenarios, underscoring its real-world relevance. The outcomes underscore the prowess of HT-PSO, showcasing significantly better convergence rates compared to the state-of-the-art.
{"title":"A Fast-Convergent Hyperbolic Tangent PSO Algorithm for UAVs Path Planning","authors":"Muhammad Haris;Dost Muhammad Saqib Bhatti;Haewoon Nam","doi":"10.1109/OJVT.2024.3391380","DOIUrl":"https://doi.org/10.1109/OJVT.2024.3391380","url":null,"abstract":"Particle Swarm Optimization (PSO) stands as a cornerstone among population-based swarm intelligence algorithms, serving as a versatile tool to tackle diverse scientific and engineering optimization challenges due to its straightforward implementation and promising optimization capabilities. Nonetheless, PSO has its limitations, notably its propensity for slow convergence. Traditionally, PSO operates by guiding swarms through positions determined by their initial velocities and acceleration components, encompassing cognitive and social information. In pursuit of expedited convergence, we introduce a novel approach: the Cognitive and Social Information-Based Hyperbolic Tangent Particle Swarm Optimization (HT-PSO) algorithm. This innovation draws inspiration from the activation functions employed in neural networks, with the singular aim of accelerating convergence. To combat the issue of slow convergence, we reengineer the cognitive and social acceleration coefficients of the PSO algorithm, leveraging the power of the hyperbolic tangent function. This strategic adjustment fosters a dynamic balance between exploration and exploitation, unleashing PSO's full potential. Our experimental trials encompass thirteen benchmark functions spanning unimodal and multimodal landscapes. Besides that, the proposed algorithm is also applied to different UAV path planning scenarios, underscoring its real-world relevance. The outcomes underscore the prowess of HT-PSO, showcasing significantly better convergence rates compared to the state-of-the-art.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"5 ","pages":"681-694"},"PeriodicalIF":6.4,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10505768","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141096361","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-04-18DOI: 10.1109/OJVT.2024.3390833
Constantinos M. Mylonakis;Zaharias D. Zaharis
This article aims to constitute a noteworthy contribution to the domain of direction-of-arrival (DoA) estimation through the application of deep learning algorithms. We approach the DoA estimation challenge as a binary classification task, employing a novel grid in the output layer and a deep convolutional neural network (DCNN) as the classifier. The input of the DCNN is the correlation matrix of signals received by a $4 times 4$