{"title":"On minimizing the energy consumption in NB-Fi networks with restrictions on packet loss rate and duty cycle","authors":"Dmitry Bankov, Anastasiia Fedorishcheva, Polina Levchenko, Andrey Lyakhov, Evgeny Khorov","doi":"10.1016/j.adhoc.2025.104132","DOIUrl":"10.1016/j.adhoc.2025.104132","url":null,"abstract":"<div><div>Low-power wide-area networks (LPWANs) are a widely adopted solution for collecting data from remote sensors. One of the possible LPWAN solutions is NB-Fi (Narrow Band Fidelity), which has two options to ensure reliable data delivery. The first one uses acknowledgments. However, the regulation rules of the ISM (Industrial, Scientific, and Medical) bands used by NB-Fi define the minimal duty cycle, which limits the total intensity of packet transmissions by base stations and sensors. As the number of sensors in an NB-Fi network is typically high, the duty cycle restriction may prevent the base station from sending some acknowledgments. Another option to ensure the delivery of sensor data is to use unsolicited retries, which increases not only data reliability but also both the network load and the energy consumption of the sensors. This paper sheds light on how to combine and configure these two options in order to provide the required transmission reliability with minimal sensors’ energy consumption and comply with the duty cycle restrictions. For that, we develop a mathematical model of an NB-Fi network and propose an algorithm based on this model for choosing the ratio of sensors that use acknowledgments and the number of transmission attempts for sensors that use unsolicited retries. Numerical results confirm that the algorithm minimizes the sensors’ energy consumption while satisfying the restrictions on the duty cycle and the packet loss rate.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104132"},"PeriodicalIF":4.8,"publicationDate":"2026-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884184","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}
Ad Hoc NetworksPub Date : 2026-03-15Epub Date: 2025-12-26DOI: 10.1016/j.adhoc.2025.104126
Xuejian Chi , Xiaoya Jin , Dapeng Jiao
{"title":"TSP-DRL: High-robustness service deployment for mobile virtual reality","authors":"Xuejian Chi , Xiaoya Jin , Dapeng Jiao","doi":"10.1016/j.adhoc.2025.104126","DOIUrl":"10.1016/j.adhoc.2025.104126","url":null,"abstract":"<div><div>Mobile virtual reality (MVR), leveraging edge computing’s proximity to end devices, enables real-time responsiveness and improves users’ Quality of Experience (QoE), and has therefore attracted growing attention. However, the mobility and instability of edge environments render edge servers vulnerable to network attacks or hardware failures, undermining service continuity. Prior studies have devoted limited attention to the systemic impact of such failures. In this work, we study the problem of robust service deployment and scheduling, focusing on how to deploy service components to mitigate the degradation in user experience caused by server failures. This problem presents two challenges: (i) seamless takeover of users served by failed servers; and (ii) balancing robustness gains against the total system cost. To overcome these challenges, we design a two-stage service placement strategy based on deep reinforcement learning (TSP-DRL). In the first stage, an iterative search groups neighboring edge servers to identify those that can take over users from failed servers. In the second stage, a deep reinforcement learning agent models the complex relationship between robustness gains and total cost, enabling efficient service-component placement in dynamic environments. Finally, real trace-based data simulations indicate that, compared with state-of-the-art methods, TSP-DRL improves robustness gains by 12%–23% while reducing total system cost by 11%–14%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104126"},"PeriodicalIF":4.8,"publicationDate":"2026-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884186","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}
Ad Hoc NetworksPub Date : 2026-03-15Epub Date: 2025-12-06DOI: 10.1016/j.adhoc.2025.104118
John Breeden , Mohammad S. Khan , Simone Silvestri , Biju Bajracharya , Chandler Scott
{"title":"Mitigating slice vulnerabilities in 5G core networks: A comprehensive survey","authors":"John Breeden , Mohammad S. Khan , Simone Silvestri , Biju Bajracharya , Chandler Scott","doi":"10.1016/j.adhoc.2025.104118","DOIUrl":"10.1016/j.adhoc.2025.104118","url":null,"abstract":"<div><div>Network slicing in the fifth generation (5G) cellular architecture provides fundamental support for the key performance required by users. To create the infrastructure of network slicing, enablers such as software-defined networking and network function virtualization facilitate a separation between the physical distributed infrastructure and the controls and functions that provide the services and that construct the individual, isolated network slices. In the modern framework of 5G, a single service provider no longer needs to maintain the physical infrastructure and the enabling functions. Third-party vendors and suppliers lease out their facilities and services to the 5G framework of the primary service provider. The 5G architecture derives from multiple services, distributed over great distances, and managed by multiple parties. Each of these enablers and providers adds vulnerabilities to the architecture and to network slicing specifically. In this work, we will examine the interweaving of the technological enablers and external infrastructure providers, identify vulnerabilities created by this complexity, and discuss the potential mitigation for these vulnerabilities. In order to rigorously evaluate vulnerabilities and mitigation, analysis requires a clearly-defined perspective. Network defenders often follow a perspective of defense-in-depth which concentrates on covering all possible vulnerabilities from multiple threat vectors. In this discussion, we will apply the concepts of attack-in-depth and the cyber kill chain from a threat actor’s perspective as contrasted to the cybersecurity concept of defense-in-depth. Finally, we will examine a case study that demonstrates how a series of vulnerabilities cascade into an advanced attack that infiltrates and exploits users’ network slices.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104118"},"PeriodicalIF":4.8,"publicationDate":"2026-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145738226","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}
Ad Hoc NetworksPub Date : 2026-03-15Epub Date: 2025-12-02DOI: 10.1016/j.adhoc.2025.104111
Debin Wei , Jinglong Wen , Pingduo Xu , Huaifeng Shi , Chengsheng Pan
{"title":"Dependent tasks joint scheduling and offloading for edge computing based on deep reinforcement learning","authors":"Debin Wei , Jinglong Wen , Pingduo Xu , Huaifeng Shi , Chengsheng Pan","doi":"10.1016/j.adhoc.2025.104111","DOIUrl":"10.1016/j.adhoc.2025.104111","url":null,"abstract":"<div><div>In the mobile edge computing (MEC) scenario, numerous complex applications consist of dependent tasks. Efficient offloading of these applications is essential for reducing latency and minimizing terminal energy consumption. However, existing studies typically employ a decoupled decision-making paradigm, where the task scheduling sequence is predetermined before independently determining the offloading location. This approach separates the scheduling and offloading processes, significantly limiting the exploration of the strategy space and hindering the identification of the global optimal solution. To address these limitations, we propose a joint scheduling and offloading algorithm based on Proximal Policy Optimization (JSO-PPO). We construct an integrated Markov Decision Process (MDP) model and introduce an action masking mechanism, unifying task scheduling and location offloading into a single end-to-end decision. Furthermore, to enhance the algorithm’s performance and stability, the JSO-PPO integrates Deep Dense Architectures in Reinforcement Learning (D2RL) for superior state representation and introduces an adaptive penalty term into its objective function for more stable convergence. Simulation results demonstrate that, compared to multiple existing algorithms, the proposed JSO-PPO achieves significant improvements in minimizing the weighted sum of application finish latency and user equipment energy consumption. These findings validate the efficiency and robustness of our joint optimization paradigm in dynamic and complex edge environments.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104111"},"PeriodicalIF":4.8,"publicationDate":"2026-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145738225","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}
Ad Hoc NetworksPub Date : 2026-03-15Epub Date: 2025-11-29DOI: 10.1016/j.adhoc.2025.104108
Hai Lin, Xi Yu, Zhihong Chen, Yue Cao
{"title":"RAG-HIDS: A multi-relational graph-based hierarchical intrusion detection system for in-vehicle networks","authors":"Hai Lin, Xi Yu, Zhihong Chen, Yue Cao","doi":"10.1016/j.adhoc.2025.104108","DOIUrl":"10.1016/j.adhoc.2025.104108","url":null,"abstract":"<div><div>With the increasing complexity and connectivity of modern vehicles, the security of in-vehicle networks has become a critical concern. The Controller Area Network (CAN), as the primary communication protocol, lacks authentication and encryption, making it highly vulnerable to cyberattacks. Intrusion detection systems (IDSs) serve as a vital line of defense by monitoring CAN traffic and identifying suspicious behavior. While graph-based IDSs can model complex relationships among CAN traffic, most existing graph-based methods operate at coarse detection levels such as window or CAN ID level. This limits their ability to detect fine-grained or stealthy attacks. To overcome these limitations, we propose RAG-HIDS, a novel Relation-Aware Graph-based Hierarchical Intrusion Detection System for CAN bus traffic. Our method constructs a multi-relational graph that captures both short-term temporal dependencies and long-term functional consistency among messages. Based on this representation, we design a hierarchical detection framework that first performs rapid intrusion screening at the window level, followed by fine-grained anomaly localization at the message level. Experiments on Car-Hacking dataset show that RAG-HIDS achieves 100% accuracy at the window level and over 99.6% at the message level across multiple attack types. And we demonstrate the model’s robustness across different vehicle types through multi-vehicle training and per-vehicle evaluation on the Survival dataset.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104108"},"PeriodicalIF":4.8,"publicationDate":"2026-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145651806","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}
{"title":"Joint optimization of device scheduling and trajectory planning for UAV-assisted data collection in wireless power supply networks","authors":"Pingjie Xia, GuoQiang Zheng, Zhe Han, Zhenhua Li, Huahong Ma, Baofeng Ji","doi":"10.1016/j.adhoc.2025.104085","DOIUrl":"10.1016/j.adhoc.2025.104085","url":null,"abstract":"<div><div>This paper addresses the problem of long-term service inequality of IoT devices in UAV-assisted wireless power communication networks. Considering factors such as the number of device historical services, the amount of device data, the UAV flight trajectory, and the binary service decision of the device, the scheduling and trajectory planning for UAV-assisted wireless power supply network data collection are modeled as a multi-objective optimization problem. The goals are to minimize the UAV’s energy usage, maximize the overall volume of data gathered, and guarantee long-term equity in device maintenance. Given the NP-hardness and mixed integer non-linear nature of the problem, a multi-objective master–slave co-optimization (MOMSCO) algorithm is proposed. The algorithm breaks the optimization problem down into a primary module and smaller modules for the solution. The primary module designs a multi-objective dynamically balanced sequence generating algorithm, chooses the best device service sequence, and calls the sub-module to optimize the UAV’s flying trajectory. By building a lightweight state space and creating a multi-objective reward function, the submodule proposes an expanded Deep Deterministic Policy Gradient (DDPG) algorithm to co-optimize UAV energy consumption and data gathering. Numerical simulation is used to validate the real scenario, and the findings demonstrate that the device service’s fairness significantly improves, steadily converging to about 97% after several data collection cycles. The usefulness of the suggested algorithm in enhancing system performance and long-term service fairness is further demonstrated by the fact that the system energy efficiency of the proposed scheme beats that of the benchmark scheme in every round.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104085"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145580099","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}
Ad Hoc NetworksPub Date : 2026-03-01Epub Date: 2025-11-19DOI: 10.1016/j.adhoc.2025.104097
Mengdi Li, Zhuotong Feng, Bo Li
{"title":"Efficient joint optimization of task offloading and resource allocation for LEO satellite edge computing","authors":"Mengdi Li, Zhuotong Feng, Bo Li","doi":"10.1016/j.adhoc.2025.104097","DOIUrl":"10.1016/j.adhoc.2025.104097","url":null,"abstract":"<div><div>In emerging space–air–ground integrated networks, Low Earth Orbit (LEO) satellites offer edge computing capabilities. However, their limited onboard resources make efficient computation offloading a significant bottleneck. To address this challenge, we propose two novel algorithms that jointly optimize task offloading and resource allocation. The first is the Adaptive Large-Scale Task Priority Offloading and Resource Allocation (ALTPORA) algorithm, which prioritizes tasks to dynamically align offloading decisions with real-time satellite resource availability. The second is the Particle Swarm Optimization-based Joint Task Offloading and Resource Allocation (PSO-JTORA) algorithm, which employs a unified optimization framework to resolve resource contention. Simulation results demonstrate the superiority of our designs. ALTPORA consistently outperforms traditional methods in scalability and resource management. Notably, PSO-JTORA achieves up to 12.5% latency reduction compared with existing schemes and simultaneously lowers energy consumption under high-load conditions. These results highlight the effectiveness of our methods in balancing performance with resource constraints, providing a robust pathway toward more efficient and sustainable LEO satellite edge computing in future integrated networks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104097"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145624180","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}
Ad Hoc NetworksPub Date : 2026-03-01Epub Date: 2025-11-13DOI: 10.1016/j.adhoc.2025.104063
Isaac López-Villegas , Erick Axel Martínez-Rios , Javier Izquierdo-Reyes , Rogelio Bustamante-Bello , Francisco Falcone
{"title":"A systematic literature review of emergency communications assisted by unnamed aerial vehicles","authors":"Isaac López-Villegas , Erick Axel Martínez-Rios , Javier Izquierdo-Reyes , Rogelio Bustamante-Bello , Francisco Falcone","doi":"10.1016/j.adhoc.2025.104063","DOIUrl":"10.1016/j.adhoc.2025.104063","url":null,"abstract":"<div><div>Reliable communication systems are critical during emergency scenarios such as floods, earthquakes, fires, and hurricanes to ensure timely information exchange and minimize damage. However, traditional communication infrastructure is often severely compromised during such events. Unmanned Aerial Vehicles (UAVs) have emerged as a promising solution to deploy temporary communication networks in disaster-affected areas. Although several studies have proposed architectures and deployment strategies for UAV-assisted communication, and reviews have addressed their potential, comprehensive discussions on protocol configurations, architectural considerations, and deployment parameter optimization remain limited. This paper presents a systematic literature review covering the period from 2014 to 2024, focusing on the use of UAVs in emergency communication systems. The reviewed articles are classified into a structured taxonomy according to the emergency scenario, UAV role, communication architecture, and protocol layer. Additionally, common communication parameters optimized for deployment, such as coverage and throughput, and the optimization methods employed, including heuristic and artificial intelligence techniques, are identified. The findings reveal that UAVs are predominantly deployed as aerial base stations for large-scale dynamic disasters, with protocol development focusing mainly on the physical, data link, and network layers. However, the lack of standardized deployment guidelines and limited real-world experimentation highlight a significant research gap. This review underscores the need for benchmark methodologies to support the effective and comparable deployment of UAV-assisted emergency communication systems.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104063"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529374","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}
{"title":"PGN-MO-DDQN: A preference-driven multi-objective offloading algorithm for mobile edge video analytics","authors":"Honghai Wu, Chenyang Wang, Ling Xing, Huahong Ma, Ruijuan Zheng, Xiaoli Song","doi":"10.1016/j.adhoc.2025.104100","DOIUrl":"10.1016/j.adhoc.2025.104100","url":null,"abstract":"<div><div>With the rapid proliferation of intelligent video analytics in real-time applications such as the Internet of Vehicles and urban surveillance, Mobile Edge Computing (MEC) systems face persistent challenges, including complex inter-frame dependencies, severe bandwidth fluctuations, and intensive resource contention. Conventional offloading strategies based on fixed rules or static weights are often inadequate for maintaining robustness in scenarios with conflicting multi-objective requirements. To address these challenges, this paper proposes PGN-MO-DDQN, an adaptive multi-objective reinforcement learning framework for task offloading and scheduling, driven by a Preference Generation Network (PGN). The proposed framework leverages the multi-objective architecture of Double-DQN and incorporates a PGN to automatically produce dynamic weight vectors for latency, load balancing, and analytical accuracy (mean average precision, mAP) according to real-time system states, while dynamically determining the offloading ratio between local and edge processing to balance communication latency and computational load, thereby enabling adaptive multi-objective optimization. Experimental evaluations conducted on the EdgeSimPy platform show that, compared with representative baseline algorithms such as Greedy, Fixed-DDQN, HRL-V2I, and TOLB, PGN-MO-DDQN reduces average task latency by 17%, decreases server load imbalance by 13%, and improves mAP by 5.8%. Overall, the proposed framework provides a robust solution for adaptive multi-objective video offloading, effectively balancing latency, accuracy, and resource use in dynamic edge environments.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104100"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145693912","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}
Ad Hoc NetworksPub Date : 2026-03-01Epub Date: 2025-11-20DOI: 10.1016/j.adhoc.2025.104098
Errong Pei, Niexin Xiang, Chenkai Ren
{"title":"Resource allocation and trajectory optimization for air-ground MEC systems with dual connectivity in unlicensed spectrum","authors":"Errong Pei, Niexin Xiang, Chenkai Ren","doi":"10.1016/j.adhoc.2025.104098","DOIUrl":"10.1016/j.adhoc.2025.104098","url":null,"abstract":"<div><div>Unmanned Aerial Vehicles (UAVs) have emerged as pivotal components in Air-Ground Mobile Edge Computing (AGMEC) systems, leveraging their line-of-sight connectivity and maneuverability to enhance service coverage. In order to mitigate the growing spectrum scarcity, AGMEC systems are increasingly adopting unlicensed bands, though this raises interference concerns for incumbent users such as WiFi systems. To address these issues, this paper proposes three key innovations: (1) An interference-aware hybrid fairness spectrum sharing mechanism that ensures proportional fairness between AGMEC and WiFi systems while maintaining quality-of-service thresholds. (2) A dual-connectivity-enhanced data offloading scheme that integrates dual connectivity (DC) with frequency-division multiple access (FDMA), enabling terrestrial mobile users (MUs) to dynamically utilize both UAV and ground base station links for load-adaptive resource splitting. (3) A joint optimization framework that maximizes the dual-link weighted average rate through co-design of UAV trajectory, power allocation, and subchannel bandwidth assignment. The resulting mixed-integer non-convex problem is systematically decomposed via block coordinate descent (BCD) and solved iteratively using successive convex approximation (SCA). Simulation results show that our approach achieves a superior weighted sum rate compared to benchmark schemes, offering an effective solution for efficient AGMEC operation in shared unlicensed environments.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"182 ","pages":"Article 104098"},"PeriodicalIF":4.8,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145624181","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}