Ad Hoc Networks最新文献_第3页

Research on collaborative offloading and resource allocation of Internet of vehicles in ISAC scenarios based on digital twin 基于数字孪生的ISAC场景下车联网协同卸载与资源分配研究

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-09-01 DOI: 10.1016/j.adhoc.2025.104009

Jianbin Xue , Hefei Wu , Ruihao Zhang , Zhenqin Wang

{"title":"Research on collaborative offloading and resource allocation of Internet of vehicles in ISAC scenarios based on digital twin","authors":"Jianbin Xue , Hefei Wu , Ruihao Zhang , Zhenqin Wang","doi":"10.1016/j.adhoc.2025.104009","DOIUrl":"10.1016/j.adhoc.2025.104009","url":null,"abstract":"<div><div>The evolution of sixth-generation (6 G) networks toward ultra-low latency and full-domain coverage necessitates dynamic digital twin networks for environmental perception in Internet of Vehicles (IoV) systems. However, the massive volume of sensing and communication data in IoV systems challenges traditional cloud computing with latency and energy overload. While multi-access edge computing (MEC) mitigates latency by moving computation to the network edge, its limited coverage remains a bottleneck. Integrated Sensing and Communication (ISAC) further enhances vehicular awareness by enabling real-time environmental perception. We propose a Sensing-aware Joint service node Auction Offloading (SJAO) scheme that decomposes computation-intensive tasks and dynamically offloads subtasks to the edge server, assisting vehicles, or local units. A virtual control unit orchestrates offloading to minimize overall system cost. To handle the uncertainty of assisting vehicle resources, a multi-attribute reverse auction mechanism is introduced, considering computational capacity, channel state, and pricing. Additionally, a DT-enhanced Twin Delayed Deep Deterministic Policy Gradient Perception Offloading (TD3PO) algorithm is developed, incorporating environment change detection for DT adaptation and fusing DT outputs with policy actions to improve convergence and decision quality. Simulation results confirm that the proposed TD3PO algorithm significantly outperforms benchmark schemes in terms of system cost, efficiency, and adaptability.</div><div>© 2014 xxxxxxxx. Hosting by Elsevier B.V. All rights reserved.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 104009"},"PeriodicalIF":4.8,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145050131","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

Connectivity-aware UAV mobility in cellular networks: DRL path planning and predictive handover 蜂窝网络中的连接感知无人机移动性：DRL路径规划和预测切换

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-09-01 DOI: 10.1016/j.adhoc.2025.103999

Wenjin Yang, Bo Li

{"title":"Connectivity-aware UAV mobility in cellular networks: DRL path planning and predictive handover","authors":"Wenjin Yang, Bo Li","doi":"10.1016/j.adhoc.2025.103999","DOIUrl":"10.1016/j.adhoc.2025.103999","url":null,"abstract":"<div><div>The seamless integration of unmanned aerial vehicles (UAVs) into cellular networks promises transformative advances in logistics and emergency response, yet is fundamentally challenged by volatile airspace connectivity and inefficient handover mechanisms. To address these issues, we present a synergistic framework that unifies three-dimensional deep reinforcement learning (DRL)-based path planning with a predictive Reference Signal Received Power (RSRP)-aware handover algorithm. This framework jointly optimizes global path selection—using a multi-step dueling double deep Q-network (D3QN) to navigate challenging connectivity—and local handover management—employing a foresighted, proactive strategy to enhance handover efficiency. Such anticipatory decision-making ensures robust UAV communication under dynamic channel conditions. Unlike traditional separate optimization, it couples path planning with handover via future trajectory insights, enabling proactive adjustments. This integration yields superior performance, balancing throughput, outage risk, and handover overhead more effectively than isolated methods. Simulation results demonstrate substantial improvements over baseline methods in throughput, outage probability, and handover frequency across diverse flight scenarios. This work highlights that an integrated, anticipatory approach is crucial for developing scalable and resilient UAV communications in next-generation wireless networks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 103999"},"PeriodicalIF":4.8,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145004387","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

A tripartite matching game model for resource allocation in Multi-UAV assisted WSNs under asymmetric information 非对称信息下多无人机辅助无线传感器网络资源分配的三方匹配博弈模型

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-09-01 DOI: 10.1016/j.adhoc.2025.103994

Shuang Zhang , Wen Tian , Xufei Ding , Xin Sun , Huaifeng Shi

{"title":"A tripartite matching game model for resource allocation in Multi-UAV assisted WSNs under asymmetric information","authors":"Shuang Zhang , Wen Tian , Xufei Ding , Xin Sun , Huaifeng Shi","doi":"10.1016/j.adhoc.2025.103994","DOIUrl":"10.1016/j.adhoc.2025.103994","url":null,"abstract":"<div><div>Unmanned aerial vehicles (UAVs) assisted wireless sensor networks (WSNs), a key component of the Internet of Things (IoT), comprise high mobility data collection device and numerous sensor nodes (SNs) that possess capabilities in sensing, computation, and wireless communication. However, UAV assisted WSN is limited by finite battery energy resources, which can result in substantial resource waste and increased energy consumption due to incorrect matching after multiple UAVs deployments. To resolve this matter, this paper proposes a tripartite matching game model for resource allocation in multi-UAV assisted WSNs (TGRUW) under asymmetric information. Specifically, the TGRUW combines the Vickrey–Clarke–Groves-based reverse (Reverse VCG) auction and the Second-price sealed auction (SPSA) algorithm, which can be used to deal with false information in the process of communication device matching and reduce energy consumption in device matching and communication, while considering computational efficiency, Nash equilibrium, and individual rationality. Finally, numerical simulation results demonstrate that the proposed algorithms achieve significant energy saving compared with random sampling-based method (RSBM), low cost preferred method (LCPM) and high valuation preferred method (HVPM).</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 103994"},"PeriodicalIF":4.8,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144997713","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

Heuristic community path awareness based routing algorithm in opportunistic Networks 机会网络中基于启发式社区路径感知的路由算法

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-09-01 DOI: 10.1016/j.adhoc.2025.104005

Feng Zhang , Yongqiang Shi , Gang Xu , Guanghui Wei , Zixuan Yuan

{"title":"Heuristic community path awareness based routing algorithm in opportunistic Networks","authors":"Feng Zhang , Yongqiang Shi , Gang Xu , Guanghui Wei , Zixuan Yuan","doi":"10.1016/j.adhoc.2025.104005","DOIUrl":"10.1016/j.adhoc.2025.104005","url":null,"abstract":"<div><div>To address the challenge of excessive transmission overhead during message delivery in large-scale opportunistic networks, this paper proposes a routing algorithm based on heuristic community path awareness (HCAR). Nodes with similar social relationships are first grouped into communities. Differentiated strategies are then employed for intra-community and inter-community message forwarding. Specifically, within the same community, a heuristic function optimizes routing paths between source and destination nodes. For inter-community message forwarding, a community proximity metric is introduced to evaluate a node’s interaction density with the target community. This metric serves as an encounter-driven heuristic function to identify the shortest inter-community routing path. Relay node selection for both scenarios is dynamically optimized by integrating heuristic functions with encounter probability models. Extensive experiments using both simulation scenarios and real-world datasets were conducted to validate the effectiveness of HCAR. Compared to EPST, BubbleRap, Epidemic, and Prophet routing algorithms, HCAR achieves at least a 15.6% higher message delivery rate, 12% lower latency, and a notably reduced transmission overhead of 36.5%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 104005"},"PeriodicalIF":4.8,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144989988","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

Detection and mitigation of Multicast DIS flooding attacks in RPL-based IoT networks 基于rpl的物联网网络中组播DIS泛洪攻击的检测与缓解

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-08-30 DOI: 10.1016/j.adhoc.2025.104002

Prajisha C. , Vasudevan A.R.

{"title":"Detection and mitigation of Multicast DIS flooding attacks in RPL-based IoT networks","authors":"Prajisha C. , Vasudevan A.R.","doi":"10.1016/j.adhoc.2025.104002","DOIUrl":"10.1016/j.adhoc.2025.104002","url":null,"abstract":"<div><div>Routing Protocol for Low-Power and Lossy Networks (RPL) is the de facto standard for IPv6-based wireless sensor networks in Internet of Things (IoT) environments. However, the inherent characteristics of Low Power and Lossy Networks (LLNs), including limited energy resources, constrained memory and processing capabilities, high packet loss rates, and dynamic network topologies, make RPL highly susceptible to control plane disturbances. Among these, multicast DIS flooding attacks are particularly damaging, as they repeatedly trigger Trickle timer resets across multiple neighbors, causing excessive control message propagation, severe energy depletion, and routing instability. Existing countermeasures often require protocol modifications, incur high overhead, or fail to discriminate between normal and malicious multicast DIS patterns in dynamic environments. Motivated by these challenges, this work proposes DIS-FDM, a lightweight, fully distributed detection and mitigation scheme for multicast DIS floods. DIS-FDM employs Dempster-Shafer theory (DST) to fuse evidence from local DIS traffic load and parent change frequency, allowing accurate attack detection without altering core RPL functions. The simulation results in Contiki/Cooja demonstrate that DIS-FDM significantly reduces control overhead, improves packet delivery ratio, and reduces power consumption compared to baseline RPL and existing defenses.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 104002"},"PeriodicalIF":4.8,"publicationDate":"2025-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144989987","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

A computation offloading scheme based on age of information for substation power IoT 基于信息时代的变电站电力物联网计算卸载方案

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-08-29 DOI: 10.1016/j.adhoc.2025.104003

Xue Li , Xiaojuan Chen , Guohua Li , Guangwei Hou

{"title":"A computation offloading scheme based on age of information for substation power IoT","authors":"Xue Li , Xiaojuan Chen , Guohua Li , Guangwei Hou","doi":"10.1016/j.adhoc.2025.104003","DOIUrl":"10.1016/j.adhoc.2025.104003","url":null,"abstract":"<div><div>With the continuous development of power internet of things (PIoT), many smart IoT devices, such as drones, robots, and infrared cameras, are now widely used in substation inspections, resulting in a large amount of IoT task data. Furthermore, additional support is necessary to facilitate data processing for most computation-intensive applications due to limitations in computing resources and the endurance of smart devices (SDs). Therefore, this paper proposes an age of information (AoI) based computing task offloading scheme (ATO) for substation PIoT to solve the data processing problem. This paper utilizes time-average AoI to measure the freshness of the task computation results received by the user platform and develops a freshness model of task data processing for substation inspection scenario. We construct a system cost function by considering both the system’s time-average AoI and the energy consumption of wireless smart devices (WLSDs). We formulate a constrained optimization problem to minimize the system cost. Additionally, we propose a nonlinear parameter-improved Grey Wolf optimizer (ATO-NGWO) for the proposed ATO problem. The simulation results demonstrate that the ATO-NGWO can reduce average system cost by 2.4%, 6.5%, 9.5%, and 7.4% compared to ATO Grey Wolf optimizer (ATO-GWO), ATO Genetic Algorithm (ATO-GA), ATO Particle Swarm Optimization (ATO-PSO), and ATO Random Selection Algorithm (ATO-RSA). In cases where the computing capacity of the edge service center (ESC) is low, ATO-NGWO can lower system cost by 24% and 30% compared to All-Local Computing (ALC) and All-Edge Computing (AEC), respectively. In cases where ESC’s computing capacity is sufficient, ATO-NGWO can reduce system cost by 34% and 11.2%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 104003"},"PeriodicalIF":4.8,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144989986","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

Trust management for underwater Internet of Things: A combined hidden Markov and cloud model approach 水下物联网的信任管理：隐马尔可夫和云模型的结合方法

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-08-25 DOI: 10.1016/j.adhoc.2025.104000

Fangyuan Xing , Zhiquan Jiang , Yutian Tan , Fei Tong

{"title":"Trust management for underwater Internet of Things: A combined hidden Markov and cloud model approach","authors":"Fangyuan Xing , Zhiquan Jiang , Yutian Tan , Fei Tong","doi":"10.1016/j.adhoc.2025.104000","DOIUrl":"10.1016/j.adhoc.2025.104000","url":null,"abstract":"<div><div>Underwater wireless optical sensor networks (UWOSN) have emerged as a transformative solution for marine exploration systems, revolutionizing applications ranging from seabed mineral prospecting to real-time oceanic monitoring through their unparalleled bandwidth and ultra-low latency. However, as underwater sensors and devices tend to persistently operate in unattended harsh environments, they are vulnerable to attacks by security threats, including hybrid attacks targeting both network nodes and communication paths. Due to the limitations in node energy and channel characteristics, traditional encryption algorithms and trust management approaches designed for terrestrial wireless sensor networks (WSN) are unsuitable for underwater WSN. To this end, this paper studies trust management for UWOSN considering both network node and link attacks. Aligned with clustered network architectures, a three-layer trust management framework is proposed in this paper. The collection layer harvests node and link trust evidences, the processing layer computes node and link comprehensive trust clouds, and the decision-making layer determines node and link states via hidden Markov model for final trust adjudication. Hidden Markov model and cloud model are combined and employed to eliminate discrepancies between the observed states inferred from the collected trust evidences and the hidden states showing the actual states of UWOSN nodes and links in dynamic environments. Simultaneously, recognizing that uniform threshold standards are unsuitable for trust management of sensor nodes in geographically marginalized positions, the proposed dynamic thresholds are designed to overcome spatial constraints and mitigate elevated false positive rates. Experimental results demonstrate that the proposed combined hidden Markov and cloud model (HMCM) trust management approach outperforms related notable studies in terms of detection rate, false detection rate, and packet delivery rate.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"178 ","pages":"Article 104000"},"PeriodicalIF":4.8,"publicationDate":"2025-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144912084","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

Joint optimization of computation offloading and power control in user-centric networks based on dual layer mobile edge computing 基于双层移动边缘计算的以用户为中心网络中计算卸载与功率控制的联合优化

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-08-23 DOI: 10.1016/j.adhoc.2025.103998

Peiying Zhang , Yuekai Sun , Lizhuang Tan , Maher Guizani , Mohammad Kamrul Hasan , Jian Wang

{"title":"Joint optimization of computation offloading and power control in user-centric networks based on dual layer mobile edge computing","authors":"Peiying Zhang , Yuekai Sun , Lizhuang Tan , Maher Guizani , Mohammad Kamrul Hasan , Jian Wang","doi":"10.1016/j.adhoc.2025.103998","DOIUrl":"10.1016/j.adhoc.2025.103998","url":null,"abstract":"<div><div>In mobile edge computing (MEC) over traditional cellular networks (TCN), users located at the cell edges are prone to severe edge interference and signal attenuation, leading to low throughput and even transmission interruptions. These edge effects significantly hinder the offloading of computational tasks from end devices to MEC servers, adversely affecting the user equipment (UE) experience. To address these issues and improve UE experience within the network, we design a user-centric network (UCN) structure comprising a three-tier network interconnected through communication links to ensure low latency and reliable transmission during computation offloading. For the computation offloading problem within UCN, we design a network model with dual-layer MEC servers that considers the competitive nature of UEs in real-world scenarios. This model is solved using a multi-agent reinforcement learning algorithm to optimize network strategies, achieving minimal long-term average total delay and power consumption. Experimental results demonstrate that the proposed scheme significantly reduces system power consumption, with a maximum reduction of 36.19% compared to other baseline algorithms. The scheme also achieves substantial reduction in the long-term average total delay by 39.5%. These algorithms indicate that the proposed approach offers considerable advantages in enhancing UE experience and reducing the energy consumption.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"179 ","pages":"Article 103998"},"PeriodicalIF":4.8,"publicationDate":"2025-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145004388","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 hierarchical optimization algorithm for multi-UAV-BS network for dynamic users 面向动态用户的多无人机- bs网络快速分层优化算法

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-08-22 DOI: 10.1016/j.adhoc.2025.104001

Chunyuan Tian, Yanzhi Hu, Shengbin Lin, Liteng Hong, Zhiyong Shi

{"title":"Fast hierarchical optimization algorithm for multi-UAV-BS network for dynamic users","authors":"Chunyuan Tian, Yanzhi Hu, Shengbin Lin, Liteng Hong, Zhiyong Shi","doi":"10.1016/j.adhoc.2025.104001","DOIUrl":"10.1016/j.adhoc.2025.104001","url":null,"abstract":"<div><div>In response to dynamic user requirements, unmanned aerial vehicles can act as airborne base stations (UAV-BSs) and adopt real-time position adjustment tactics to offer access services. Nevertheless, the frequent movements of UAV-BSs heighten the complexity of network adjustments and diminish battery durability. To tackle this challenge, this paper proposes a fast hierarchical optimization algorithm. By jointly optimizing frequency allocation, power optimization, and position deployment, the algorithm intends to maximize the number of users receiving high-quality-of-service (QoS) communications. When real-time monitoring detects that the user's communication quality falls below the threshold, the algorithm triggers optimization of power and frequency parameters. To solve the non-convex optimization problem, the Block Coordinate Descent (BCD) algorithm and Genetic Algorithm (GA) are employed in an alternating computational process to obtain optimal solution. If a portion of users has not been restored above the threshold after adjusting these parameters, the re-deployment of the positions of the multi-UAV-BS will be triggered, and all parameters will be re-optimized. Simulation results show that the proposed algorithm not only presents robust convergence but also achieves a 95.5 % user coverage rate. Compared with single-objective optimization methods, the proposed algorithm shows superior performance.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"178 ","pages":"Article 104001"},"PeriodicalIF":4.8,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144912085","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

Transmission scheduling for remote state estimation with quantized communication against tampering attacks 针对篡改攻击的量化通信远程状态估计传输调度

IF 4.8 3区计算机科学

Ad Hoc Networks Pub Date : 2025-08-22 DOI: 10.1016/j.adhoc.2025.103997

Mengqi Li, Yanpeng Hu, Jin Guo

引用次数: 0