Ad Hoc Networks最新文献_第3页

Attention model-driven MADDPG algorithm for delay and cost-aware placement of service function chains in 5G

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-03-04 DOI: 10.1016/j.adhoc.2025.103806

Joy Munshi , Sumaya Sultana , Md. Jahid Hassan , Palash Roy , Md. Abdur Razzaque , Abdulhameed Alelaiwi , Md. Zia Uddin , Mohammad Mehedi Hassan

{"title":"Attention model-driven MADDPG algorithm for delay and cost-aware placement of service function chains in 5G","authors":"Joy Munshi , Sumaya Sultana , Md. Jahid Hassan , Palash Roy , Md. Abdur Razzaque , Abdulhameed Alelaiwi , Md. Zia Uddin , Mohammad Mehedi Hassan","doi":"10.1016/j.adhoc.2025.103806","DOIUrl":"10.1016/j.adhoc.2025.103806","url":null,"abstract":"<div><div>The rapidly expanding applications of 5G networks necessitate strategic placement of Virtual Network Functions (VNFs) within Service Function Chains (SFCs) to minimize placement costs while delivering real-time services to users. The dual objectives of this efficient placement strategy are to simultaneously reduce resource usage costs and application service delays in the 5G network. Previous studies have limitations, typically constrained by fixed resource costs or by adopting a greedy approach for resource selection from nearby nodes. In this paper, we introduce a multi-objective linear programming (MOLP) based optimization framework designed for the placement of VNFs in SFC requests, considering a real-time pricing scheme of the resources and the demands of user applications. This framework allows for the analysis of the boundary performances regarding cost and delay, facilitating a balanced trade-off between the two. Given that this problem is proven to be NP-hard in large networks, we have also developed a Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm, which leverages an attention model-based approach for the placement of SFC VNFs. This method focuses on neighboring nodes to help agents reduce the complexity of the solution and effectively capture the dynamic nature of the network environment. Simulation experiments demonstrate that our proposed system model surpasses existing state-of-the-art approaches in terms of resource placement cost and service latency.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"173 ","pages":"Article 103806"},"PeriodicalIF":4.4,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143562351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Sum rate maximization for RSMA aided small cells edge users using meta-learning variational quantum algorithm

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-25 DOI: 10.1016/j.adhoc.2025.103802

Deepak Gupta, Ishan Budhiraja, Bireshwar Dass Mazumdar

{"title":"Sum rate maximization for RSMA aided small cells edge users using meta-learning variational quantum algorithm","authors":"Deepak Gupta, Ishan Budhiraja, Bireshwar Dass Mazumdar","doi":"10.1016/j.adhoc.2025.103802","DOIUrl":"10.1016/j.adhoc.2025.103802","url":null,"abstract":"<div><div>This study aims to enhance wireless communication efficiency by maximizing the sum rate through optimized rate allocation and power control for edge users in small cell networks. Small cells improve coverage and bandwidth in congested networks but face challenges such as interference and limited resources, particularly for users at the cell edge. This article introduces a Meta-LVQA technique to boost system throughput by optimizing rate allocation and power control, ensuring equitable resource distribution among users, and managing in-cell interference using Rate Splitting Multiple Access (RSMA). The problem is initially framed using classical methods. However, this manuscript employs the Meta-Learning Variational Quantum Algorithm (Meta-LVQA) to optimize the sum rate. Therefore, it is necessary to transform the classical equation into an equivalent quantum equation using a quantum circuit. Numerical results demonstrate that RSMA with Meta-LVQA consistently outperforms all other methods. Specifically, RSMA with Meta-LVQA surpasses RSMA with Variational Quantum Algorithm (VQA), NOMA with Meta-LVQA, and NOMA with VQA by <span><math><mrow><mn>3</mn><mo>.</mo><mn>91</mn><mtext>%</mtext><mo>,</mo><mn>10</mn><mo>.</mo><mn>11</mn><mtext>%</mtext><mo>,</mo></mrow></math></span> and <span><math><mrow><mn>31</mn><mo>.</mo><mn>99</mn><mtext>%</mtext><mo>,</mo></mrow></math></span> respectively, when the sum rate is measured against a minimum rate requirement of 1.15 Mbps at SCEU1. When computing the sum rate using four SCEUs, RSMA with Meta-LVQA outperforms RSMA with VQA, NOMA with Meta-LVQA, and NOMA with VQA by <span><math><mrow><mn>13</mn><mo>.</mo><mn>91</mn><mtext>%</mtext><mo>,</mo><mn>18</mn><mo>.</mo><mn>63</mn><mtext>%</mtext><mo>,</mo></mrow></math></span> and <span><math><mrow><mn>43</mn><mo>.</mo><mn>06</mn><mtext>%</mtext><mo>,</mo></mrow></math></span> respectively.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"172 ","pages":"Article 103802"},"PeriodicalIF":4.4,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143511117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reliability and bandwidth aware routing in SDN-based fog computing for IoT applications

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-25 DOI: 10.1016/j.adhoc.2025.103803

Parisa Valizadeh, Mohammad Hossein Yaghmaee, Yasser Sedaghat

{"title":"Reliability and bandwidth aware routing in SDN-based fog computing for IoT applications","authors":"Parisa Valizadeh, Mohammad Hossein Yaghmaee, Yasser Sedaghat","doi":"10.1016/j.adhoc.2025.103803","DOIUrl":"10.1016/j.adhoc.2025.103803","url":null,"abstract":"<div><div>Software-Defined Networking (SDN) and fog computing are pivotal in supporting computationally intensive tasks within Internet of Things (IoT) applications, enhancing efficiency and reliability. However, many IoT applications are constrained by communication paths prone to link failures, necessitating robust fault tolerance techniques to ensure reliable traffic flow. In particular, real-time IoT applications demand stringent reliability and bandwidth requirements (constraints), which are challenging to meet simultaneously. Although previous research has investigated SDN-based routing to improve reliability, developing a routing algorithm that satisfies both reliability and bandwidth constraints remains an NP-hard problem. In this paper, we propose two novel routing algorithms: Reliability Aware Bandwidth constrained Routing (RABR) and Reliability and Bandwidth Constrained Routing (RBCR), specifically designed for SDN-enabled environments. Our approach prioritizes service reliability while meeting strict reliability and bandwidth criteria. The proposed solution integrates several phases, including reliability aware and bandwidth constrained path routing and flow duplication through parallel/hybrid and sequential routing methods. Furthermore, we introduce a greedy heuristic algorithm, implemented by the SDN controller with an efficient time complexity. Simulation results demonstrate that our algorithm surpasses state-of-the-art approaches in critical metrics such as reliability, reliability-bandwidth success rate, and Runtime. As such, our solution emerges as a robust choice for SDN-enabled IoT environments.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"172 ","pages":"Article 103803"},"PeriodicalIF":4.4,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143511460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Collaborative multi-target-tracking via graph-based deep reinforcement learning in UAV swarm networks

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-23 DOI: 10.1016/j.adhoc.2025.103801

Qianchen Ren , Yuanyu Wang, Han Liu, Yu Dai, Wenhui Ye, Yuliang Tang

{"title":"Collaborative multi-target-tracking via graph-based deep reinforcement learning in UAV swarm networks","authors":"Qianchen Ren , Yuanyu Wang, Han Liu, Yu Dai, Wenhui Ye, Yuliang Tang","doi":"10.1016/j.adhoc.2025.103801","DOIUrl":"10.1016/j.adhoc.2025.103801","url":null,"abstract":"<div><div>Due to unmanned aerial vehicles (UAVs) flexibility and affordability, the UAVs swarm network (USNET) is widely used for various complex, challenging tasks such as tracking, surveillance, and monitoring, and the key to accomplishing these tasks lies in the capabilities of the UAVs to collaborate. However, due to the high complexity of real-time information sharing and task cooperation among numerous UAVs in the USNET, it poses significant challenges for multi-target tracking in complex scenarios. In this paper, we study the collaborative multi-target-tracking (CMTT) problem based on the USNET and aim to improve task collaboration capabilities within the USNET. We first design a heuristic target assignment algorithm to simplify the CMTT problem into the optimal topology control problem of the USNET, and then propose an integrated sensing and communication multi-agent reinforcement learning for the USNET topology control algorithm (ISAC-TC) to maximize the collaborative tracking performance of UAVs within the USNET. Specifically, in heterogeneous observation graph representation, the ISAC-TC first utilizes a graph neural network to solve the time-varying dimensions of the agent observation space. Then, an encoder–decoder-based information sharing module is used to achieve efficient communication between agents in the CMTT tasks. Simulation results show that the proposed scheme achieves a higher tracking success rate and tracking fairness than other baselines.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"172 ","pages":"Article 103801"},"PeriodicalIF":4.4,"publicationDate":"2025-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143510402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An optimizing geo-distributed edge layering with double deep Q-networks for predictive mobility-aware offloading in mobile edge computing

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-21 DOI: 10.1016/j.adhoc.2025.103804

Amir Masoud Rahmani , Amir Haider , Saqib Ali , Shakiba Rajabi , Farhad Soleimanian Gharehchopogh , Parisa Khoshvaght , Mehdi Hosseinzadeh

{"title":"An optimizing geo-distributed edge layering with double deep Q-networks for predictive mobility-aware offloading in mobile edge computing","authors":"Amir Masoud Rahmani , Amir Haider , Saqib Ali , Shakiba Rajabi , Farhad Soleimanian Gharehchopogh , Parisa Khoshvaght , Mehdi Hosseinzadeh","doi":"10.1016/j.adhoc.2025.103804","DOIUrl":"10.1016/j.adhoc.2025.103804","url":null,"abstract":"<div><div>In Mobile Edge Computing (MEC), the exponential growth of connected devices and user mobility presents significant challenges in optimizing task offloading, reducing latency, and energy usage. Predictive and adaptive task offloading mechanisms are essential as devices become more mobile and generate demanding tasks. Current methods, such as local computing and random scheduling, struggle to efficiently manage resources and maintain Quality of Service (QoS) in dynamic environments. This paper proposes an optimized Geographic Distributed Edge Layering (GDEL) architecture integrated with Double Deep Q-Networks (DDQN) to enable predictive, mobility-aware offloading. Our model leverages reinforcement learning through a Markov Decision Process (MDP) framework to dynamically allocate resources across distributed edge nodes, making optimal decisions on whether to offload or process tasks locally based on real-time conditions. Simulations show that our model outperforms other methods in key performance metrics, reducing task completion time by up to 48 %, lowering offloading decision latency by 49.3 %, and decreasing energy consumption by 26.5 % compared to traditional models.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"172 ","pages":"Article 103804"},"PeriodicalIF":4.4,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Coexistence of NR-U operators in multichannel scenarios: Fair cooperation or endless struggle for channel resources

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-20 DOI: 10.1016/j.adhoc.2025.103798

Vyacheslav Loginov, Aleksandr Troegubov, Andrey Lyakhov, Evgeny Khorov

引用次数: 0

QRAVDR: A deep Q-learning-based RSU-Assisted Video Data Routing algorithm for VANETs

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-19 DOI: 10.1016/j.adhoc.2025.103790

Huahong Ma, Shuangjin Li, Honghai Wu, Ling Xing, Xiaohui Zhang

{"title":"QRAVDR: A deep Q-learning-based RSU-Assisted Video Data Routing algorithm for VANETs","authors":"Huahong Ma, Shuangjin Li, Honghai Wu, Ling Xing, Xiaohui Zhang","doi":"10.1016/j.adhoc.2025.103790","DOIUrl":"10.1016/j.adhoc.2025.103790","url":null,"abstract":"<div><div>With the rapid development of Internet of Vehicles (IoV) and the increasing demand for video services, video data routing in Vehicular Ad-hoc Networks (VANETs) has become a popular research topic. Challenges such as real-time transmission demands, instability of wireless channels, and high network topology dynamics significantly affect video transmission quality. Although some related studies have used multipath transmission and priority scheduling to improve performance, they usually require accurate models or use a static approach to make decisions, which lack the learning mechanism and the ability to adapt to the dynamic network, resulting in poor video reconstruction quality. To address the above problems, A Deep Q-Learning (DQL)-based RoadSide Unit (RSU)-Assisted Video Data Routing algorithm, named QRAVDR, is proposed for urban VANET environments. The algorithm coordinates the forwarding road segments of different layers of Scalable Video Coding (SVC) video data at the RSUs through DQL, maximizing the video quality at the receiver while minimizing the transmission delay. The Neutrosophic Set Analytic Hierarchy Process method is applied to select the best relay vehicle within the road segments, which guarantees the transmission of keyframes and improves the decoding possibility. Extensive simulation experiments on QRAVDR and other existing algorithms have been conducted using NS-2 employing simulated datasets. The results show that QRAVDR achieves a better overall performance in improving the average frame delivery ratio by about 8.02%, reducing the average end-to-end delay by approximately 9.61%, and improving the average peak signal-to-noise ratio by roughly 7.97%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"171 ","pages":"Article 103790"},"PeriodicalIF":4.4,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143453558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

NOMA-based intelligent resource allocation and trajectory optimization for multi-UAVs assisted semantic communication networks

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-18 DOI: 10.1016/j.adhoc.2025.103762

Ping Xie, Qian Chen, JingYan Wu, Xiangrui Gao, Ling Xing, Yu Zhang, Hanxiao Sun

{"title":"NOMA-based intelligent resource allocation and trajectory optimization for multi-UAVs assisted semantic communication networks","authors":"Ping Xie, Qian Chen, JingYan Wu, Xiangrui Gao, Ling Xing, Yu Zhang, Hanxiao Sun","doi":"10.1016/j.adhoc.2025.103762","DOIUrl":"10.1016/j.adhoc.2025.103762","url":null,"abstract":"<div><div>The limited spectrum resources have a particular impact on UAV-assisted semantic communication networks, which undoubtedly leads to poorer quality of service for users and inefficient communication. Therefore, a NOMA-based multi-UAVs assisted semantic cellular network framework is proposed in this paper, in which each UAV transmits semantic information to multiple users in the shared spectrum resource with different power using non-orthogonal multiple access transmission protocol, thereby achieving higher spectrum utilization. We optimize the quantity of semantic symbols, UAV trajectories, and power allocation concurrently to increase communication efficiency by maximizing the sum rate of semantic information transmission for all users. However, conventional convex optimization approaches have difficulty solving it due to the bi-directional mobility of UAVs and users. Therefore, an enhanced K-means algorithm is employed to create the relationship between UAVs and users periodically. Additionally, a deep reinforcement learning technique based on shared dueling double deep Q networks (SD3QN) is also presented to maximize the quantity of semantic symbols, 3D trajectories, and power allocation. Experimental results show that the proposed semantic cellular network achieves higher spectral efficiency. Meanwhile, the proposed algorithm can effectively reduce the training time and avoid the overestimation problem in Deep Q Networks (DQN). Furthermore, the suggested optimization strategy outperforms the benchmark schemes in terms of semantic sum rate.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"171 ","pages":"Article 103762"},"PeriodicalIF":4.4,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143444307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

URNFresh: Age-of-infomation-based 60 GHz UAV relay networks for video surveillance in linear environments

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-14 DOI: 10.1016/j.adhoc.2025.103789

Wenjia Wu , Hui Lv , Shengyu Sun

{"title":"URNFresh: Age-of-infomation-based 60 GHz UAV relay networks for video surveillance in linear environments","authors":"Wenjia Wu , Hui Lv , Shengyu Sun","doi":"10.1016/j.adhoc.2025.103789","DOIUrl":"10.1016/j.adhoc.2025.103789","url":null,"abstract":"<div><div>In recent years, video surveillance has been widely deployed and utilized, with linear deployment environments such as roads and rivers being very common. With the rapid development and widespread application of 60 GHz communication and unmanned aerial vehicle (UAV) technologies, 60 GHz UAV relay networks have become an ideal solution for high-rate data collection in video surveillance. In this network scenario, the collaborative scheduling of multiple UAVs has become a key issue. However, the existing scheduling schemes are usually designed for two-dimensional or three-dimensional scenarios, lacking relevant considerations and designs for the characteristics of one-dimensional linear scenarios. In addition, these methods rarely consider ensuring data freshness and the age-of-information (AoI) metric to meet the needs of latency-sensitive applications. To this end, we consider the 60 GHz UAV relay network for video surveillance, and investigate the AoI-based multi-UAV collaborative scheduling mechanism in linear environments. Firstly, We formulate the energy-storage-limited and AoI-guaranteed Multi-UAV scheduling problem, which aims to minimize the average cumulative AoI, while considering the constraints of their energy and data storage capacity. Then, we propose the hierarchical reinforcement learning-based multi-UAV collaborative scheduling mechanism called URNFresh, and design corresponding strategies for option selection and fine-grained action selection in aspects such as flight control, data collection, data offloading, and battery replacement. Finally, we conduct simulation experiments to evaluate the performance of URNFresh mechanism. Experimental results demonstrate that the proposed solution outperforms traditional reinforcement learning approaches, and achieves a significant improvement in average cumulative AoI.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"171 ","pages":"Article 103789"},"PeriodicalIF":4.4,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143427949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fast convergent actor–critic reinforcement learning based interference coordination algorithm in D2D networks

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2025-02-14 DOI: 10.1016/j.adhoc.2025.103788

Chen Sun, Jijun Yang, Zhicheng Cao, Zhiyong Yang, Youfeng Yang, Jian Shu

{"title":"Fast convergent actor–critic reinforcement learning based interference coordination algorithm in D2D networks","authors":"Chen Sun, Jijun Yang, Zhicheng Cao, Zhiyong Yang, Youfeng Yang, Jian Shu","doi":"10.1016/j.adhoc.2025.103788","DOIUrl":"10.1016/j.adhoc.2025.103788","url":null,"abstract":"<div><div>This paper presents a Fast Convergent Advantage Actor–Critic (FC-A2C) reinforcement learning algorithm designed to address interference coordination in Device-to-Device (D2D) networks. Traditional reinforcement learning-based interference coordination algorithms often suffer from high complexity and prolonged convergence times. To overcome these limitations, the proposed FC-A2C algorithm integrates a feature extraction network to reduce computational redundancy, a dual-head actor network to separately handle resource allocation and power control, and a central critic network to generate advantage values based on the rewards collected from the nearby agents. These improvements collectively accelerate the convergence of the algorithm while maintaining optimal network performance. Simulation results demonstrate that the FC-A2C algorithm significantly outperforms conventional and typical reinforcement learning-based interference coordination algorithms in terms of convergence speed and multiple performance metrics. The proposed algorithm achieves up to 83% faster convergence and up to 6.1% better network performance compared to existing methods, making it a promising solution for efficient interference coordination in D2D networks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"171 ","pages":"Article 103788"},"PeriodicalIF":4.4,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143427950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0