The primary user (PU) transmission is sporadic in nature, which explains why the PU is inactive during some time slots, geographic directions or frequency bands. The frequency bands where the PU is not active are called "spectrum holes". Secondary users (SUs) periodically perform sensing to detect the spectrum holes and monitor primary spectrum. For the best possible spectrum utilization, PU signal detection is very crucial. For measuring the spectrum sensing performance, two main metrics are applied, like, probability of false alarm (PFA) and probability of detection (PD). Due to PFA and PD, the conventional sensing techniques have to face issues. These two constraints used to hinder spectrum utilization. Traditional sensing strategies are mostly based on feature extraction of received signal. Advancement of artificial intelligence (AI) has reduced the inaccuracy in detection of spectrum hole. Deep learning (DL) based approaches have shown a remarkable improvement in this aspect. Hence, the present research work was undertaken to address the problem of spectrum sensing in low SNR and improves accuracy. This research penetrates into the use of deep neural network (DNN) for sensing the vacant spectrum accurately. In this article, RadioML2016.10b dataset was used for the experiments. The results are also studied. The proposed approach shows betterment in sensing than other existing spectrum detection models. DeepSenseNet model was validated through simulation results and showed that it has achieved 98.84% prediction accuracy () with 97.53% precision and 97.62% recall.
{"title":"A hybrid deep learning based approach for spectrum sensing in cognitive radio","authors":"Sonali Mondal , Manash Pratim Dutta , Swarnendu Kumar Chakraborty","doi":"10.1016/j.phycom.2024.102497","DOIUrl":"10.1016/j.phycom.2024.102497","url":null,"abstract":"<div><p>The primary user (PU) transmission is sporadic in nature, which explains why the PU is inactive during some time slots, geographic directions or frequency bands. The frequency bands where the PU is not active are called \"spectrum holes\". Secondary users (SUs) periodically perform sensing to detect the spectrum holes and monitor primary spectrum. For the best possible spectrum utilization, PU signal detection is very crucial. For measuring the spectrum sensing performance, two main metrics are applied, like, probability of false alarm (PFA) and probability of detection (PD). Due to PFA and PD, the conventional sensing techniques have to face issues. These two constraints used to hinder spectrum utilization. Traditional sensing strategies are mostly based on feature extraction of received signal. Advancement of artificial intelligence (AI) has reduced the inaccuracy in detection of spectrum hole. Deep learning (DL) based approaches have shown a remarkable improvement in this aspect. Hence, the present research work was undertaken to address the problem of spectrum sensing in low SNR and improves accuracy. This research penetrates into the use of deep neural network (DNN) for sensing the vacant spectrum accurately. In this article, RadioML2016.10b dataset was used for the experiments. The results are also studied. The proposed approach shows betterment in sensing than other existing spectrum detection models. DeepSenseNet model was validated through simulation results and showed that it has achieved 98.84% prediction accuracy (<span><math><msub><mi>P</mi><mi>a</mi></msub></math></span>) with 97.53% precision and 97.62% recall.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102497"},"PeriodicalIF":2.0,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142238391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-10DOI: 10.1016/j.phycom.2024.102498
Chen Lu , Jianfeng Shi , Baolong Li , Xiao Chen
Low earth orbit satellite networks (LSN) have been widely recognized as a key element in the development of next-generation wireless communication networks, offering extensive coverage and seamless connectivity across multiple domains. To achieve the minimum transmission latency for highly-dynamic LSN, this paper first establishes a low earth orbit (LEO) satellite downlink communication model while considering outdated channel state information and high mobility. Then, through the design of user association and satellite power allocation strategies, a dynamic problem of minimizing transmission latency is formulated and solved using successive convex approximation and alternating optimization methods. Simulation results clearly illustrate the substantial reduction in transmission latency achieved by the proposed algorithm, successfully meeting the quality of service demands in dynamic environments during the entire mobility cycle of the LEO satellite.
{"title":"Dynamic resource allocation for low earth orbit satellite networks","authors":"Chen Lu , Jianfeng Shi , Baolong Li , Xiao Chen","doi":"10.1016/j.phycom.2024.102498","DOIUrl":"10.1016/j.phycom.2024.102498","url":null,"abstract":"<div><p>Low earth orbit satellite networks (LSN) have been widely recognized as a key element in the development of next-generation wireless communication networks, offering extensive coverage and seamless connectivity across multiple domains. To achieve the minimum transmission latency for highly-dynamic LSN, this paper first establishes a low earth orbit (LEO) satellite downlink communication model while considering outdated channel state information and high mobility. Then, through the design of user association and satellite power allocation strategies, a dynamic problem of minimizing transmission latency is formulated and solved using successive convex approximation and alternating optimization methods. Simulation results clearly illustrate the substantial reduction in transmission latency achieved by the proposed algorithm, successfully meeting the quality of service demands in dynamic environments during the entire mobility cycle of the LEO satellite.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102498"},"PeriodicalIF":2.0,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142172990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-07DOI: 10.1016/j.phycom.2024.102490
Xiaoyang Liu , Kangqi Zhang , Xiaoqin Zhang , Giacomo Fiumara , Pasquale De Meo
The improvement of positioning accuracy in Wireless Sensor Networks (hereafter, WSN) is crucial to develop advanced Internet of Things (IOT, for short) applications. However, the conventional distance vector-hop (DV-Hop) localization algorithm has shortcomings such as low accuracy and weak stability. To overcome these shortcomings, this paper proposes a hybrid improved compressed particle swarm optimization algorithm (HICPSO), which consists of a scheme of linearly decreasing inertia weights, compressed velocity vectors, population Gaussian variants and optimal boundary selection. Then, HICPSO is integrated with DV-Hop to gradually reduce the distance error of least squares method (LSM) estimated with the efficient search advantage of HICPSO. Our simulation results show that the HICPSO algorithm possesses better computational accuracy and search performance on the 22 benchmark test functions compared with the algorithms such as the Improved Adaptive Genetic Algorithm (IAGA) and Adaptive Weighted Particle Swarm Optimizer (AWPSO). Meanwhile, compared with IAGA and AWPSO, the positioning accuracy of HICPSO-based positioning algorithm is improved by 4.28% and 4.76% respectively, and the stability is improved by one order of magnitude.
{"title":"A hybrid improved compressed particle swarm optimization WSN node location algorithm","authors":"Xiaoyang Liu , Kangqi Zhang , Xiaoqin Zhang , Giacomo Fiumara , Pasquale De Meo","doi":"10.1016/j.phycom.2024.102490","DOIUrl":"10.1016/j.phycom.2024.102490","url":null,"abstract":"<div><p>The improvement of positioning accuracy in Wireless Sensor Networks (hereafter, WSN) is crucial to develop advanced Internet of Things (IOT, for short) applications. However, the conventional distance vector-hop (DV-Hop) localization algorithm has shortcomings such as low accuracy and weak stability. To overcome these shortcomings, this paper proposes a hybrid improved compressed particle swarm optimization algorithm (HICPSO), which consists of a scheme of linearly decreasing inertia weights, compressed velocity vectors, population Gaussian variants and optimal boundary selection. Then, HICPSO is integrated with DV-Hop to gradually reduce the distance error of least squares method (LSM) estimated with the efficient search advantage of HICPSO. Our simulation results show that the HICPSO algorithm possesses better computational accuracy and search performance on the 22 benchmark test functions compared with the algorithms such as the Improved Adaptive Genetic Algorithm (IAGA) and Adaptive Weighted Particle Swarm Optimizer (AWPSO). Meanwhile, compared with IAGA and AWPSO, the positioning accuracy of HICPSO-based positioning algorithm is improved by 4.28% and 4.76% respectively, and the stability is improved by one order of magnitude.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102490"},"PeriodicalIF":2.0,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-06DOI: 10.1016/j.phycom.2024.102489
M. Ramadevi , S. Anuradha , L. PadmaSree
Cooperative Non Orthogonal Multiple Access (C-NOMA) has gained significant recent interest as a highly promising option in providing quality of service to the users. It is a key component of upcoming communication systems. The primary objective of our work is to improve the downlink CNOMA system’s performance with a single ground station and two users by considering perfect channel. The fading effect causes a decrease in system performance. To improve system performance, the existing Selection Combining (SC) and Maximal Ratio Combining (MRC) diversity approaches are inadequate. In order to enhance performance, the proposed Adaptive Selection Combining and Selective Branch Maximal Ratio Combining diversity technique (SC-SBMRC) is used in downlink C-NOMA system at the receiver for fusion. Bit Error Rate and Outage Probability metrics are used to assess C-NOMA system’s performance with different fading channels. The proposed system taken in to consideration of Nakagami-m and Rayleigh generalized fading channels with ‘’ distribution by incorporating three essential fading parameters. The simulation experiments were carried out by using MATLAB Software. From the results it is observed that the Bit Error Rate is reduced from to and also the Outage Probability enhanced from to . Based on the numerical findings, the Cooperative Non-Orthogonal Multiple Access system with Adaptive SC-SBMRC diversity technique shows superior performance as compared to conventional C-NOMA system in providing quality of service to distant user.
{"title":"C-NOMA system with adaptive SC-SBMRC diversity receiver over fading channels","authors":"M. Ramadevi , S. Anuradha , L. PadmaSree","doi":"10.1016/j.phycom.2024.102489","DOIUrl":"10.1016/j.phycom.2024.102489","url":null,"abstract":"<div><div>Cooperative Non Orthogonal Multiple Access (C-NOMA) has gained significant recent interest as a highly promising option in providing quality of service to the users. It is a key component of upcoming communication systems. The primary objective of our work is to improve the downlink CNOMA system’s performance with a single ground station and two users by considering perfect channel. The fading effect causes a decrease in system performance. To improve system performance, the existing Selection Combining (SC) and Maximal Ratio Combining (MRC) diversity approaches are inadequate. In order to enhance performance, the proposed Adaptive Selection Combining and Selective Branch Maximal Ratio Combining diversity technique (SC-SBMRC) is used in downlink C-NOMA system at the receiver for fusion. Bit Error Rate and Outage Probability metrics are used to assess C-NOMA system’s performance with different fading channels. The proposed system taken in to consideration of Nakagami-m and Rayleigh generalized fading channels with ‘<span><math><mrow><mi>α</mi><mo>−</mo><mi>η</mi><mo>−</mo><mi>μ</mi></mrow></math></span>’ distribution by incorporating three essential fading parameters. The simulation experiments were carried out by using MATLAB Software. From the results it is observed that the Bit Error Rate is reduced from <span><math><mrow><mn>4</mn><mo>.</mo><mn>8</mn><mo>×</mo><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup></mrow></math></span> to <span><math><mrow><mn>3</mn><mo>.</mo><mn>0</mn><mo>×</mo><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mo>−</mo><mn>3</mn></mrow></msup></mrow></math></span>and also the Outage Probability enhanced from <span><math><mrow><mn>9</mn><mo>.</mo><mn>6</mn><mo>×</mo><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mo>−</mo><mn>2</mn></mrow></msup></mrow></math></span> to <span><math><mrow><mn>9</mn><mo>.</mo><mn>4</mn><mo>×</mo><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mo>−</mo><mn>3</mn></mrow></msup></mrow></math></span>. Based on the numerical findings, the Cooperative Non-Orthogonal Multiple Access system with Adaptive SC-SBMRC diversity technique shows superior performance as compared to conventional C-NOMA system in providing quality of service to distant user.</div></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102489"},"PeriodicalIF":2.0,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-06DOI: 10.1016/j.phycom.2024.102486
Zebiao Shan , Ruiguang Yao , Xiaosong Liu , Yunqing Liu
Aiming at the problem that the existing direction of arrival (DOA) estimation algorithms are difficult to achieve high-precision estimation in environments with mixed Alpha-stable distribution noise and Gaussian-colored noise, a look ahead orthogonal matching pursuit algorithm based on Fractional Order Cumulants (FOC) is proposed for acoustic vector sensor (AVS) arrays. Firstly, the algorithm computes the FOC matrix of the observed data and exploits the semi-invariance of the FOC to separate Alpha-stable distribution noise and Gaussian-colored noise from the observed data. Furthermore, the property that FOC is insensitive to the Alpha-stable distribution processes and Gaussian processes is then exploited to suppress the Alpha-stable distribution noise and Gaussian-colored noise. Subsequently, the FOC matrix is reconstructed through the vectorization operator, and an FOC-based sparse DOA estimation model is derived. Finally, the look ahead orthogonal matching pursuit algorithm predicts the impact of each candidate atom on minimizing the residual. It selects the optimal atom to enter the support set, obtaining the DOA estimation of the target. The effectiveness of the proposed algorithm is verified through computer simulations. The simulation results show that the proposed algorithm has high estimation accuracy and success probability.
针对现有的到达方向(DOA)估计算法难以在阿尔法稳定分布噪声和高斯彩色噪声混合的环境中实现高精度估计的问题,提出了一种基于分数阶积(FOC)的声学矢量传感器(AVS)阵列前瞻正交匹配追寻算法。首先,该算法计算观测数据的 FOC 矩阵,并利用 FOC 的半不变性从观测数据中分离出阿尔法稳定分布噪声和高斯彩色噪声。此外,利用 FOC 对阿尔法稳定分布过程和高斯过程不敏感的特性,可以抑制阿尔法稳定分布噪声和高斯彩色噪声。随后,通过矢量化算子重建 FOC 矩阵,并得出基于 FOC 的稀疏 DOA 估计模型。最后,前瞻正交匹配追求算法会预测每个候选原子对残差最小化的影响。它选择最优原子进入支持集,从而获得目标的 DOA 估计值。通过计算机仿真验证了所提算法的有效性。仿真结果表明,所提算法具有较高的估计精度和成功概率。
{"title":"DOA estimation for acoustic vector sensor array based on fractional order cumulants sparse representation","authors":"Zebiao Shan , Ruiguang Yao , Xiaosong Liu , Yunqing Liu","doi":"10.1016/j.phycom.2024.102486","DOIUrl":"10.1016/j.phycom.2024.102486","url":null,"abstract":"<div><p>Aiming at the problem that the existing direction of arrival (DOA) estimation algorithms are difficult to achieve high-precision estimation in environments with mixed Alpha-stable distribution noise and Gaussian-colored noise, a look ahead orthogonal matching pursuit algorithm based on Fractional Order Cumulants (FOC) is proposed for acoustic vector sensor (AVS) arrays. Firstly, the algorithm computes the FOC matrix of the observed data and exploits the semi-invariance of the FOC to separate Alpha-stable distribution noise and Gaussian-colored noise from the observed data. Furthermore, the property that FOC is insensitive to the Alpha-stable distribution processes and Gaussian processes is then exploited to suppress the Alpha-stable distribution noise and Gaussian-colored noise. Subsequently, the FOC matrix is reconstructed through the vectorization operator, and an FOC-based sparse DOA estimation model is derived. Finally, the look ahead orthogonal matching pursuit algorithm predicts the impact of each candidate atom on minimizing the residual. It selects the optimal atom to enter the support set, obtaining the DOA estimation of the target. The effectiveness of the proposed algorithm is verified through computer simulations. The simulation results show that the proposed algorithm has high estimation accuracy and success probability.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102486"},"PeriodicalIF":2.0,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142172989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The bandwidth and power resources in underwater acoustic sensor networks (UASNs) are severely limited. By adopting adaptive resource allocation technique, the network capacity and energy efficiency of UASNs can be improved. In this paper, we model the underwater acoustic (UWA) soft frequency reuse (SFR) network as a multi-agent system, and propose a multi-agent deep Q network based resource allocation (MADQN-RA) method. The system state is designed as outdated feedback channel state information (CSI) sequences, considering the time-varying and long propagation delay features of UWA channel. By establishing an effective joint reward expression, the intelligent agents can mapping the relationship of state–action and reward in time-varying UWA channel and make corresponding resource allocation decisions. Furthermore, to improve the learning efficiency, a dynamic state length method is proposed with the specific design of multi-stage experience buffer. The pre-training method is also combined for further improvement of system efficiency. Simulation results show that the system performance of the proposed methods is better than other learning-based methods and channel prediction-based methods, and is closer to the theoretical optimal value.
水下声学传感器网络(UASN)的带宽和功率资源非常有限。通过采用自适应资源分配技术,可以提高水下声学传感器网络的网络容量和能效。本文将水下声学(UWA)软频率重用(SFR)网络建模为一个多代理系统,并提出了一种基于深度 Q 网络的多代理资源分配(MADQN-RA)方法。考虑到 UWA 信道的时变性和长传播延迟特性,将系统状态设计为过时反馈信道状态信息(CSI)序列。通过建立有效的联合奖励表达式,智能代理可以映射时变 UWA 信道中的状态-行动和奖励关系,并做出相应的资源分配决策。此外,为了提高学习效率,还提出了一种动态状态长度方法,并具体设计了多阶段经验缓冲区。为了进一步提高系统效率,还结合了预训练方法。仿真结果表明,所提方法的系统性能优于其他基于学习的方法和基于信道预测的方法,更接近理论最优值。
{"title":"Resources allocation for underwater acoustic soft frequency reuse network based on multi-agent deep reinforcement learning","authors":"Yuzhi Zhang, Mengfan Li, Xiaomei Feng, Xiang Han, Menglei Jia","doi":"10.1016/j.phycom.2024.102487","DOIUrl":"10.1016/j.phycom.2024.102487","url":null,"abstract":"<div><div>The bandwidth and power resources in underwater acoustic sensor networks (UASNs) are severely limited. By adopting adaptive resource allocation technique, the network capacity and energy efficiency of UASNs can be improved. In this paper, we model the underwater acoustic (UWA) soft frequency reuse (SFR) network as a multi-agent system, and propose a multi-agent deep Q network based resource allocation (MADQN-RA) method. The system state is designed as outdated feedback channel state information (CSI) sequences, considering the time-varying and long propagation delay features of UWA channel. By establishing an effective joint reward expression, the intelligent agents can mapping the relationship of state–action and reward in time-varying UWA channel and make corresponding resource allocation decisions. Furthermore, to improve the learning efficiency, a dynamic state length method is proposed with the specific design of multi-stage experience buffer. The pre-training method is also combined for further improvement of system efficiency. Simulation results show that the system performance of the proposed methods is better than other learning-based methods and channel prediction-based methods, and is closer to the theoretical optimal value.</div></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102487"},"PeriodicalIF":2.0,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the continuous evolution of communication technologies such as 5G/6G and the continuous development of artificial intelligence (AI), rail transit wireless communication systems have seen unprecedented growth opportunities. However, this is accompanied by a series of challenges, including the accuracy of channel estimation in high-speed mobile environment, the complexity of resource management, and edge collaborative optimization. The aim of this paper is to explore these issues in depth and propose corresponding solutions. Firstly, we integrate AI with rail transit wireless communication to build relevant architectures and summarize the solutions to the rail transit wireless communication problems based on AI algorithms and the related research progress. Secondly, we apply AI algorithms to improving the stability of channel estimation in complex and changing channel environments, so as to enhance the communication quality. Finally, to meet the demands of rail transit wireless communication, we introduce a resource management and edge collaborative optimization model, and explore the prospects of the wide application of multiple AI algorithms in these fields. In this paper, significant progress has been made in channel estimation, resource management and edge collaborative optimization through in-depth research and innovation combined with AI algorithms. This lays the foundation for introducing more efficient and reliable communication solutions for intelligent rail transit systems.
{"title":"Artificial intelligence in rail transit wireless communication systems: Status, challenges and solutions","authors":"Junhui Zhao , Xu Gao , Zhengyuan Wu , Qingmiao Zhang , Haitao Han","doi":"10.1016/j.phycom.2024.102484","DOIUrl":"10.1016/j.phycom.2024.102484","url":null,"abstract":"<div><p>With the continuous evolution of communication technologies such as 5G/6G and the continuous development of artificial intelligence (AI), rail transit wireless communication systems have seen unprecedented growth opportunities. However, this is accompanied by a series of challenges, including the accuracy of channel estimation in high-speed mobile environment, the complexity of resource management, and edge collaborative optimization. The aim of this paper is to explore these issues in depth and propose corresponding solutions. Firstly, we integrate AI with rail transit wireless communication to build relevant architectures and summarize the solutions to the rail transit wireless communication problems based on AI algorithms and the related research progress. Secondly, we apply AI algorithms to improving the stability of channel estimation in complex and changing channel environments, so as to enhance the communication quality. Finally, to meet the demands of rail transit wireless communication, we introduce a resource management and edge collaborative optimization model, and explore the prospects of the wide application of multiple AI algorithms in these fields. In this paper, significant progress has been made in channel estimation, resource management and edge collaborative optimization through in-depth research and innovation combined with AI algorithms. This lays the foundation for introducing more efficient and reliable communication solutions for intelligent rail transit systems.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102484"},"PeriodicalIF":2.0,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-03DOI: 10.1016/j.phycom.2024.102479
Muhammad Waqas Nawaz, Wanquan Zhang, David Flynn, Lei Zhang, Rafiq Swash, Qammer H. Abbasi, Muhammad Ali Imran, Olaoluwa Popoola
The advent of 6G wireless networks has the potential to unlock diverse applications of scalable autonomy. By advantageously coupling the individual and aggregated attributes of diverse multi-UAV fleets, a range of high-value applications such as logistics, enhanced disaster response, urban navigation, and surveillance can be significantly improved. However, enabling effective communication for knowledge fusion necessitates the intrinsic optimization of performance metrics like energy consumption, resource allocation, latency, and computational overheads to enhance autonomous efficiency. Furthermore, designing robust security features is essential to safeguarding privacy, control, and operational integrity. This paper explores a novel collaborative knowledge-sharing (KS) framework that leverages 6G and edge-computing capabilities to facilitate the cooperative training of decentralized machine learning models among multiple UAVs, without the need to transmit raw data. This framework aims to enhance the learning experience and operational efficiency of autonomous vehicles. The DECKS (distributed edge-based collaborative knowledge-sharing) architecture enables Federated Learning (FL) within UAV networks, allowing local models to be trained and shared among neighboring UAVs for creating global models. This promotes intelligent knowledge aggregation without a central entity, enhancing collaborative capabilities among autonomous vehicles. The DECKS architecture efficiently extracts and distributes collaborative shared experience to ground vehicles through edge and direct inference, reducing energy consumption, latency, and computational overhead. Our simulation analysis demonstrates that the DECKS architecture has the potential to reduce energy consumption by 70% in sensorless vehicles and improve autonomous vehicle learning performance by 15% compared to centralized approaches in a distributed environment. This improvement is achieved by comparing the efficiency of systems with and without aggregated knowledge, as well as with a centralized system.
{"title":"6G edge-networks and multi-UAV knowledge fusion for urban autonomous vehicles","authors":"Muhammad Waqas Nawaz, Wanquan Zhang, David Flynn, Lei Zhang, Rafiq Swash, Qammer H. Abbasi, Muhammad Ali Imran, Olaoluwa Popoola","doi":"10.1016/j.phycom.2024.102479","DOIUrl":"10.1016/j.phycom.2024.102479","url":null,"abstract":"<div><p>The advent of 6G wireless networks has the potential to unlock diverse applications of scalable autonomy. By advantageously coupling the individual and aggregated attributes of diverse multi-UAV fleets, a range of high-value applications such as logistics, enhanced disaster response, urban navigation, and surveillance can be significantly improved. However, enabling effective communication for knowledge fusion necessitates the intrinsic optimization of performance metrics like energy consumption, resource allocation, latency, and computational overheads to enhance autonomous efficiency. Furthermore, designing robust security features is essential to safeguarding privacy, control, and operational integrity. This paper explores a novel collaborative knowledge-sharing (KS) framework that leverages 6G and edge-computing capabilities to facilitate the cooperative training of decentralized machine learning models among multiple UAVs, without the need to transmit raw data. This framework aims to enhance the learning experience and operational efficiency of autonomous vehicles. The DECKS (distributed edge-based collaborative knowledge-sharing) architecture enables Federated Learning (FL) within UAV networks, allowing local models to be trained and shared among neighboring UAVs for creating global models. This promotes intelligent knowledge aggregation without a central entity, enhancing collaborative capabilities among autonomous vehicles. The DECKS architecture efficiently extracts and distributes collaborative shared experience to ground vehicles through edge and direct inference, reducing energy consumption, latency, and computational overhead. Our simulation analysis demonstrates that the DECKS architecture has the potential to reduce energy consumption by 70% in sensorless vehicles and improve autonomous vehicle learning performance by 15% compared to centralized approaches in a distributed environment. This improvement is achieved by comparing the efficiency of systems with and without aggregated knowledge, as well as with a centralized system.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102479"},"PeriodicalIF":2.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1874490724001976/pdfft?md5=16f9dae623695a2c2b9f25d24b653de7&pid=1-s2.0-S1874490724001976-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In mobile opportunistic networks, messages are transmitted through opportunistic contacts between nodes. Hence, the successful delivery of messages heavily relies on the mutual cooperation among nodes in the network. However, due to limited network resources such as node energy and cache space, nodes tend to be selfish, and they are unwilling to actively participate in message forwarding. In response to this challenge, lots of incentive mechanisms have been proposed. However, most of them rely on single incentives, there are issues such as inadequate handling of selfish nodes and vulnerability to malicious attacks, which ultimately lead to poor incentive effects. Therefore, in this paper, a Dual Incentive mechanism based on Graph attention neural network and Contract (DIGC) is introduced to encourage active participation of network nodes in data transmission. This incentive mechanism is divided into two steps. In the first step, the graph attention neural network is used to evaluate the reputation of nodes to achieve the goal of reputation-based incentive, and blockchain is employed to store and manage node reputation to ensure security and transparency. In the second step, an incentive based on contract theory is introduced, where personalized contracts were designed based on the different resources owned by nodes, thereby establishing a reward mechanism to encourage collaborative transmission. Extensive simulations based on two real-life mobility traces have been done to evaluate the performance of our DIGC compared with other existing incentive mechanisms. The results show that, our proposed mechanism can greatly improve throughput and reduce average delay while ensuring the overall delivery performance of the network.
{"title":"A dual incentive mechanism based on graph attention neural network and contract in mobile opportunistic networks","authors":"Huahong Ma, Yuxiang Gu, Honghai Wu, Ling Xing, Xiaohui Zhang","doi":"10.1016/j.phycom.2024.102485","DOIUrl":"10.1016/j.phycom.2024.102485","url":null,"abstract":"<div><p>In mobile opportunistic networks, messages are transmitted through opportunistic contacts between nodes. Hence, the successful delivery of messages heavily relies on the mutual cooperation among nodes in the network. However, due to limited network resources such as node energy and cache space, nodes tend to be selfish, and they are unwilling to actively participate in message forwarding. In response to this challenge, lots of incentive mechanisms have been proposed. However, most of them rely on single incentives, there are issues such as inadequate handling of selfish nodes and vulnerability to malicious attacks, which ultimately lead to poor incentive effects. Therefore, in this paper, a Dual Incentive mechanism based on Graph attention neural network and Contract (DIGC) is introduced to encourage active participation of network nodes in data transmission. This incentive mechanism is divided into two steps. In the first step, the graph attention neural network is used to evaluate the reputation of nodes to achieve the goal of reputation-based incentive, and blockchain is employed to store and manage node reputation to ensure security and transparency. In the second step, an incentive based on contract theory is introduced, where personalized contracts were designed based on the different resources owned by nodes, thereby establishing a reward mechanism to encourage collaborative transmission. Extensive simulations based on two real-life mobility traces have been done to evaluate the performance of our DIGC compared with other existing incentive mechanisms. The results show that, our proposed mechanism can greatly improve throughput and reduce average delay while ensuring the overall delivery performance of the network.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"67 ","pages":"Article 102485"},"PeriodicalIF":2.0,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-29DOI: 10.1016/j.phycom.2024.102483
Ziang Liu, Tianyu Song, Ruohan Zhao, Jiyu Jin, Guiyue Jin
In massive multi-input multi-output (MIMO) systems, it is necessary for user equipment (UE) to transmit downlink channel state information (CSI) back to the base station (BS). As the number of antennas increases, the feedback overhead of CSI consumes a significant amount of uplink bandwidth resources. To minimize the bandwidth overhead, we propose an efficient parallel attention transformer, called EPAformer, a lightweight network that utilizes the transformer architecture and efficient parallel self-attention (EPSA) for CSI feedback tasks. The EPSA expands the attention area of each token within the transformer block effectively by dividing multiple heads into parallel groups and conducting self-attention in horizontal and vertical stripes. The proposed EPSA achieves better feature compression and reconstruction. The simulation results display that the EPAformer surpasses previous deep learning-based approaches in terms of reconstruction performance and complexity.
{"title":"An efficient parallel self-attention transformer for CSI feedback","authors":"Ziang Liu, Tianyu Song, Ruohan Zhao, Jiyu Jin, Guiyue Jin","doi":"10.1016/j.phycom.2024.102483","DOIUrl":"10.1016/j.phycom.2024.102483","url":null,"abstract":"<div><p>In massive multi-input multi-output (MIMO) systems, it is necessary for user equipment (UE) to transmit downlink channel state information (CSI) back to the base station (BS). As the number of antennas increases, the feedback overhead of CSI consumes a significant amount of uplink bandwidth resources. To minimize the bandwidth overhead, we propose an efficient parallel attention transformer, called EPAformer, a lightweight network that utilizes the transformer architecture and efficient parallel self-attention (EPSA) for CSI feedback tasks. The EPSA expands the attention area of each token within the transformer block effectively by dividing multiple heads into parallel groups and conducting self-attention in horizontal and vertical stripes. The proposed EPSA achieves better feature compression and reconstruction. The simulation results display that the EPAformer surpasses previous deep learning-based approaches in terms of reconstruction performance and complexity.</p></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"66 ","pages":"Article 102483"},"PeriodicalIF":2.0,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}