Vehicular Communications最新文献

筛选
英文 中文
Effective throughput maximization of beamspace MIMO-NOMA with finite blocklength 有限块长波束空间MIMO-NOMA的有效吞吐量最大化
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-03-13 DOI: 10.1016/j.vehcom.2025.100908
Yiyang Zhang , Yuan Yin , Jiaheng Wang , Kang Zheng
{"title":"Effective throughput maximization of beamspace MIMO-NOMA with finite blocklength","authors":"Yiyang Zhang ,&nbsp;Yuan Yin ,&nbsp;Jiaheng Wang ,&nbsp;Kang Zheng","doi":"10.1016/j.vehcom.2025.100908","DOIUrl":"10.1016/j.vehcom.2025.100908","url":null,"abstract":"<div><div>Non-orthogonal multiple access (NOMA) has recently been integrated into beamspace multiple-input multiple-output (MIMO) for improved capacity and throughput. To apply the promising beamspace MIMO-NOMA in practical millimeter-wave applications, finite blocklength has to be considered. Therefore, in this article, we consider the effective throughput as the performance metric, which incorporates both the transmission rate and error performance in the finite blocklength regime. For the considered downlink beamspace MIMO-NOMA system, we derive the expression of system effective throughput with given blocklength and decoding error probability. To maximize the system effective throughput and simultaneously provide the quality-of-service (QoS) guarantee of data rate for each user, the transmit precoding and power allocation are optimized. We first provide an effective precoding design to mitigate the inter-beam interference. For power allocation, we apply monotonic optimization to obtain a globally optimal solution, and further develop a low-complexity algorithm based on the principles of convex-concave procedure (CCP). Simulation results show that the proposed schemes achieve higher spectrum and energy efficiency compared to several baseline schemes, including the traditional resource allocation algorithm based on the infinite blocklength assumption, and the existing beamspace MIMO.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100908"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143642083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
QRCF: A new Q-learning-based routing approach using a smart cylindrical filtering system in flying ad hoc networks QRCF:一种新的基于q学习的路由方法,在飞行自组织网络中使用智能圆柱滤波系统
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-04-04 DOI: 10.1016/j.vehcom.2025.100905
Amir Masoud Rahmani , Amir Haider , Monji Mohamed Zaidi , Abed Alanazi , Shtwai Alsubai , Abdullah Alqahtani , Mohammad Sadegh Yousefpoor , Efat Yousefpoor , Mehdi Hosseinzadeh
{"title":"QRCF: A new Q-learning-based routing approach using a smart cylindrical filtering system in flying ad hoc networks","authors":"Amir Masoud Rahmani ,&nbsp;Amir Haider ,&nbsp;Monji Mohamed Zaidi ,&nbsp;Abed Alanazi ,&nbsp;Shtwai Alsubai ,&nbsp;Abdullah Alqahtani ,&nbsp;Mohammad Sadegh Yousefpoor ,&nbsp;Efat Yousefpoor ,&nbsp;Mehdi Hosseinzadeh","doi":"10.1016/j.vehcom.2025.100905","DOIUrl":"10.1016/j.vehcom.2025.100905","url":null,"abstract":"<div><div>To ensure reliable data transmission in flying ad hoc networks (FANETs), efficient routing protocols are necessary to establish communication paths in FANETs. Recently, reinforcement learning (RL), particularly Q-learning, has become a promising approach for overcoming challenges faced by traditional routing protocols due to its capacity for autonomous adaptation and self-learning. This study presents a Q-learning-based routing strategy, enhanced by an innovative cylindrical filtering technique, named QRCF in FANETs. In QRCF, the dissemination interval of hello packets is adaptively adjusted based on the connection status of nearby UAVs. Then, this routing process leverages Q-learning to discover reliable and stable routes, using a state set refined by the cylindrical filtering technique to accelerate the search for the optimal path in the network. Afterward, the reward value is computed using metrics such as relative speed, connection time, residual energy, and movement path. Finally, QRCF is deployed in the network simulator 2 (NS2), and its performance is evaluated against three routing schemes, QRF, QFAN, and QTAR. These evaluations are presented based on the number of UAVs and their speed. In general, when changing the number of nodes, QRCF improves energy usage (about 5.01%), data delivery ratio (approximately 1.20%), delay (17.71%), and network longevity (about 3.21%). However, it has a higher overhead (approximately 10.91%) than QRF. Moreover, when changing the speed of UAVs in the network, QRCF improves energy usage (about 4.94%), data delivery ratio (approximately 2.36%), delay (about 17.5%), and network lifetime (approximately 8.75%). However, it increases routing overhead (approximately 15.47%) in comparison with QRF.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100905"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143792512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing task offloading in vehicular networks: A multi-agent cloud-edge-device framework 增强车辆网络中的任务卸载:一个多智能体云边缘设备框架
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-02-25 DOI: 10.1016/j.vehcom.2025.100898
Peiying Zhang , Enqi Wang , Lizhuang Tan , Neeraj Kumar , Jian Wang , Kai Liu
{"title":"Enhancing task offloading in vehicular networks: A multi-agent cloud-edge-device framework","authors":"Peiying Zhang ,&nbsp;Enqi Wang ,&nbsp;Lizhuang Tan ,&nbsp;Neeraj Kumar ,&nbsp;Jian Wang ,&nbsp;Kai Liu","doi":"10.1016/j.vehcom.2025.100898","DOIUrl":"10.1016/j.vehcom.2025.100898","url":null,"abstract":"<div><div>In vehicular networks, the increasing demand for computational resources often exceeds the capabilities of in-vehicle devices. To address these challenges, we propose a cloud-edge-device collaborative framework integrated with a Multi-Agent Deep Reinforcement Learning (MADRL) algorithm for dynamic optimization of task offloading and resource allocation. Experimental evaluations demonstrate the proposed algorithm's superiority over traditional methods, achieving an 11% reduction in energy consumption and a 23% increase in task completion rate compared to local processing-only strategies, while reducing average task delay by 50% relative to static offloading approaches. The MADRL-based framework not only ensures efficient task distribution but also adapts to fluctuating network conditions, achieving a resource utilization rate of 85%. These findings underscore its potential to enhance performance in intelligent transportation systems by balancing computational efficiency, energy consumption, and task latency.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100898"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143512480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computational intelligence-based routing schemes in flying ad-hoc networks (FANETs): A review 基于计算智能的飞行自组织网络路由方案综述
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-03-24 DOI: 10.1016/j.vehcom.2025.100913
Parisa Khoshvaght , Jawad Tanveer , Amir Masoud Rahmani , May Altulyan , Yazeed Alkhrijah , Mohammad Sadegh Yousefpoor , Efat Yousefpoor , Mokhtar Mohammadi , Mehdi Hosseinzadeh
{"title":"Computational intelligence-based routing schemes in flying ad-hoc networks (FANETs): A review","authors":"Parisa Khoshvaght ,&nbsp;Jawad Tanveer ,&nbsp;Amir Masoud Rahmani ,&nbsp;May Altulyan ,&nbsp;Yazeed Alkhrijah ,&nbsp;Mohammad Sadegh Yousefpoor ,&nbsp;Efat Yousefpoor ,&nbsp;Mokhtar Mohammadi ,&nbsp;Mehdi Hosseinzadeh","doi":"10.1016/j.vehcom.2025.100913","DOIUrl":"10.1016/j.vehcom.2025.100913","url":null,"abstract":"<div><div>Recently, the rapid development of wireless technologies, low-priced equipment, advances in networking protocols, and access to modern communication, electrical, and sensing technologies have led to the evolution of flying ad hoc networks (FANETs). However, the high movement of unmanned aerial vehicles (UAVs) in these networks causes iterated failures of communication links and constant changes in network topology. These features challenge the design of a proper routing protocol in FANETs. Today, computational intelligence (CI) techniques are rapidly developing as a mighty and intelligent computing model. This promising technology can be used to improve various applied areas, especially routing in FANETs. This paper examines and assesses various CI-based routing techniques in FANETs. Accordingly, this paper introduces a classification of CI-based routing protocols for FANETs. This categorization includes three groups: learning system-based routing methods (including artificial neural networks, reinforcement learning, and deep reinforcement learning), fuzzy-based routing schemes, and bio-inspired routing schemes (evolutionary algorithms and swarm intelligence). Subsequently, based on the offered classification, the most recent CI-based routing methods and their key features are outlined. Ultimately, the opportunities and challenges in this area have been mentioned to help researchers familiarize themselves with future research directions in CI-based routing algorithms for FANETs and work toward improving these methods in such networks.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100913"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143725010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Intelligent and efficient Metaverse rendering and caching in UAV-aided vehicular edge computing 无人机辅助车辆边缘计算中智能高效的元空间渲染和缓存
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-03-06 DOI: 10.1016/j.vehcom.2025.100904
Linlin Yuan , Guoquan Wu , Kebing Jin , Ya Li , Jianhang Tang , Shaobo Li
{"title":"Intelligent and efficient Metaverse rendering and caching in UAV-aided vehicular edge computing","authors":"Linlin Yuan ,&nbsp;Guoquan Wu ,&nbsp;Kebing Jin ,&nbsp;Ya Li ,&nbsp;Jianhang Tang ,&nbsp;Shaobo Li","doi":"10.1016/j.vehcom.2025.100904","DOIUrl":"10.1016/j.vehcom.2025.100904","url":null,"abstract":"<div><div>The extensive application of the Metaverse in the Internet of Vehicles (IoV) has provided broader application scenarios and innovative opportunities for intelligent vehicle travel. The implementation of the Metaverse, which necessitates low latency, high precision, and swift feedback and interaction, can be effectively addressed by harnessing unmanned aerial vehicle (UAV)-assisted IoV technology. However, the actual wireless communication environment of UAV-assisted IoV networks, characterized by variability and complexity amidst numerous uncertain and uncontrollable interference factors, underscores the urgent need for research on the efficient communication and computing within the Metaverse. In this work, we investigate an efficient rendering scheme for Metaverse applications in UAV-aided edge computing networks, where multiple UAVs perform various Metaverse applications for vehicles with the help of a ground base station. Considering image quality and frame refresh rate as key metrics, we formulate a joint system utility optimization problem to minimize response time and energy consumption. To provide stable and high-quality vehicular Metaverse services, we develop an intelligent rendering and caching method for intelligent vehicular Metaverse, where a diffusion probabilistic model-based Metaverse frame rendering algorithm and a deep learning-based Metaverse frame caching algorithm are jointly designed. The proposed method can achieve optimal resource allocation results with low time complexity by fully exploring the benefits of a double auction model between vehicles and UAVs and a social model between different vehicles. Based on real-world datasets, we conduct extensive simulation experiments. Numerical results indicate that the proposed algorithm can improve resource utilization and reduce Metaverse frame rendering time and system energy consumption significantly.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100904"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A distributed multi-agent joint optimization algorithm based on CERL and A2C for resource allocation in vehicular networks 基于CERL和A2C的汽车网络资源分配多智能体联合优化算法
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-04-09 DOI: 10.1016/j.vehcom.2025.100919
Ming Sun , Zexu Jiang , Erhan Dong , Tianyu Lv
{"title":"A distributed multi-agent joint optimization algorithm based on CERL and A2C for resource allocation in vehicular networks","authors":"Ming Sun ,&nbsp;Zexu Jiang ,&nbsp;Erhan Dong ,&nbsp;Tianyu Lv","doi":"10.1016/j.vehcom.2025.100919","DOIUrl":"10.1016/j.vehcom.2025.100919","url":null,"abstract":"<div><div>Vehicular networking plays an indispensable role in enhancing road safety and traffic efficiency. Although existing technologies have made significant progress in reusing vehicle-to-infrastructure (V2I) link resources for vehicle-to-vehicle (V2V) links, they still face challenges such as the high dimensionality of the joint action space and unsatisfactory optimization with limited in-vehicle radio resources, variable environments, and uncertainties. Reinforcement learning-based joint algorithms that separately optimize channel allocation and power selection can reduce the dimensionality of the joint action space. However, it is difficult to effectively coordinate channel allocation and power selection, which greatly affects the performance of them. To address these challenges, this paper proposes a distributed multi-agent joint optimization algorithm based on a novel cross-entropy loss-based reinforcement learning (CERL) algorithm and the A2C algorithm for separately optimizing channels and power in vehicular networks. Furthermore, a multi-round stochastic search strategy is presented to optimize the experience pools and coordinate the channel allocation and the power selection for the proposed distributed multi-agent joint optimization algorithm. With the help of the multi-round stochastic search strategy, the proposed distributed multi-agent joint optimization algorithm can significantly improve the optimization performance in resource allocation. To evaluate the performance of the proposed distributed multi-agent joint optimization algorithm in both the V2V link transmission success rate and the V2I link throughput, a comprehensive simulation study is conducted under different channel resource availability scenarios with different sizes of security data. The experimental results demonstrate that our proposed algorithm can significantly improve the V2I link throughput and the V2V link transmission success rate, and outperforms the existing algorithms in terms of radio efficiency. Specifically, under two different channel resource availability scenarios, our proposed algorithm can achieve more than 99.9 % average V2V link transmission success rate and 2.99 Mbps and 2.07 Mbps higher average V2I link throughput than the competitive algorithm D3QN-LS when the security data size ranges from 1 × 1060 Bytes to 8 × 1060 Bytes. The proposed algorithm theoretically provides a new perspective and solution for separately optimizing channels and power in high-dimensional complex dynamic environments of vehicular networks.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100919"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143825647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Secure energy efficiency maximization for mobile jammer-aided UAV communication: Joint power and trajectory optimization 移动干扰机辅助无人机通信的安全能源效率最大化:联合功率和轨迹优化
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-03-13 DOI: 10.1016/j.vehcom.2025.100910
Jiazheng Lv, Jianhua Cheng, Peng Li, Runze Bai
{"title":"Secure energy efficiency maximization for mobile jammer-aided UAV communication: Joint power and trajectory optimization","authors":"Jiazheng Lv,&nbsp;Jianhua Cheng,&nbsp;Peng Li,&nbsp;Runze Bai","doi":"10.1016/j.vehcom.2025.100910","DOIUrl":"10.1016/j.vehcom.2025.100910","url":null,"abstract":"<div><div>This paper considers a mobile jammer-aided unmanned aerial vehicle (UAV) relay communication system, where a relay UAV assists information transmission between the source node and the destination node, while a friendly jammer UAV emits an interference signal to the eavesdropper to suppress its eavesdropping behavior. The secure energy efficiency (SEE) maximization problem is studied. The objective is to maximize the SEE via jointly optimizing power and UAVs' trajectories. The formulated problem is non-convex and subject to information-causality constraints, power constraints, and mobility constraints, which cannot be solved directly by convex optimization tools. To solve the problem, the block coordinate descent method is applied to decouple the original problem into four sub-problems. Then, an efficient iterative algorithm is proposed to address the non-convex problem through the successive convex approximation technique. Additionally, Dinkelbach's algorithm is employed to handle the fractional programming problem, thereby obtaining an approximate solution with guaranteed convergence. Different schemes are evaluated to validate the effectiveness of the proposed design. The simulation results show that the proposed design can improve SEE effectively compared with other schemes.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100910"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143643796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
3D position error bound for wideband localization systems with application to UAVs 应用于无人机的宽带定位系统三维位置误差约束
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-03-13 DOI: 10.1016/j.vehcom.2025.100909
Alberto Facheris, Luca Reggiani
{"title":"3D position error bound for wideband localization systems with application to UAVs","authors":"Alberto Facheris,&nbsp;Luca Reggiani","doi":"10.1016/j.vehcom.2025.100909","DOIUrl":"10.1016/j.vehcom.2025.100909","url":null,"abstract":"<div><div>Positioning is a crucial element of the new connected world and its integration with the current and future releases of the mobile system technology has been gaining interest since the introduction of the 5G verticals. In the application layer, positioning provides an additional and, in many cases, a fundamental value for the implementation of services like terrestrial and non-terrestrial vehicles, industrial robots and many other advanced systems. In this work we present a study on the formulation of the 3D Position Error Bound (PEB) based on Time-of-Arrival measures. We extend the analysis of the localization Cramer Rao Bound to the 3D geometry including the impacts of multipath, multiple anchors, clock and position offsets. In addition, we elaborate the result, providing a deeper insight on potential applications of this analytical tool, as positioning of Unmanned Aerial Vehicles in areas covered by 5G signals.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100909"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143715605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Collaborative coverage path planning for UAV swarm for multi-region post-disaster assessment 多区域灾后评估无人机群协同覆盖路径规划
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-04-04 DOI: 10.1016/j.vehcom.2025.100915
Yonghua Xiong , Yan Zhou , Jinhua She , Anjun Yu
{"title":"Collaborative coverage path planning for UAV swarm for multi-region post-disaster assessment","authors":"Yonghua Xiong ,&nbsp;Yan Zhou ,&nbsp;Jinhua She ,&nbsp;Anjun Yu","doi":"10.1016/j.vehcom.2025.100915","DOIUrl":"10.1016/j.vehcom.2025.100915","url":null,"abstract":"<div><div>The suddenness of natural disasters demands rapid response and timely information. The rapid development of unmanned aerial vehicle (UAV) technology offers new opportunities for post-disaster assessment. At the same time, UAV swarms covering multiple post-disaster regions also face challenges. Uneven UAV utilization and region allocation can lead to overuse and excessive energy consumption of certain UAVs, reducing collaboration effectiveness and coverage efficiency. To improve the collaboration efficiency, we present a metric for collaboration synchronization rate, rationally allocate regions, and optimize coverage paths to reduce the travel distance difference between UAVs. Minimizing the number of UAVs used and shortening the total travel distance can improve the coverage efficiency. In this paper, we study the Multi-UAV Multi-region Complete Coverage Path Planning (MMCCPP) problem in post-disaster scenarios. First, we establish a multi-objective model that optimizes the number of UAVs, total travel distance, and collaboration synchronization rate. Then, we develop the Coverage Path Planning (SPSO-CPP) method based on improved Set-Based Particle Swarm Optimization (S-PSO) to plan the minimum number of UAVs and the optimal coverage paths, incorporating a greedy region-chosen mechanism and comprehensive optimization of paths within and between regions. Finally, we validate the feasibility, effectiveness, and superiority of the proposed algorithm through simulation test comparisons.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100915"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143792510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximizing the energy efficiency using M-PSO in multi-hop UAV-IRS network for improved post-disaster emergency communication services 在多跳无人机-红外系统网络中使用 M-PSO 实现能效最大化,以改进灾后应急通信服务
IF 5.8 2区 计算机科学
Vehicular Communications Pub Date : 2025-06-01 Epub Date: 2025-04-11 DOI: 10.1016/j.vehcom.2025.100920
Humairah Hamid, G.R. Begh
{"title":"Maximizing the energy efficiency using M-PSO in multi-hop UAV-IRS network for improved post-disaster emergency communication services","authors":"Humairah Hamid,&nbsp;G.R. Begh","doi":"10.1016/j.vehcom.2025.100920","DOIUrl":"10.1016/j.vehcom.2025.100920","url":null,"abstract":"<div><div>Natural disasters often damage the ground infrastructure, leading to communication failures that hamper emergency response efforts. Solutions dependent on ground-based infrastructure suffer from severe limitations in these scenarios owing to fixed positions, limited energy sources, and limited coverage. Existing methodologies, often relying on terrestrial relay points or fixed infrastructure, face challenges in adjusting to rapidly changing conditions in disaster areas, leading to ineffective energy consumption and limited communication range. To address this challenge, this work proposes a novel approach that employs Unmanned Aerial Vehicles (UAVs) alongside Intelligent Reflecting Surface (IRS) to deal with the connectivity challenges and provide energy-efficient communication services for Ground Users (GUs). The proposed framework includes a multi-hop communication model in which UAV-IRS units function as mobile relays, establishing strong connections between the affected area nodes and a temporary base station. We propose a Modified Particle Swarm Optimization (M-PSO) technique that optimally adjusts UAV placement and transmit power while the IRS phase shifts are independently optimized using Gradient Descent (GD) to enhance energy efficiency. Simulation results indicate that our setup significantly enhances communication capabilities in a disaster-stricken region, outperforming conventional methods for enhancing coverage and energy efficiency, thereby providing a resilient alternative for emergency communication in disaster-affected regions.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"53 ","pages":"Article 100920"},"PeriodicalIF":5.8,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143828420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书