Pub Date : 2026-01-15DOI: 10.1016/j.adhoc.2026.104148
Jihong Wang, Yongxin Fan, Yanan Zhu, Miao Yu, Yang Li
In clustered energy harvesting-cognitive radio sensor networks (EH-CRSNs), reliance on direct links for both EH and data transmission causes distant nodes to deplete energy faster, thereby shortening network lifetime. To address the above issues, this paper integrates an active intelligent reflecting surface (IRS) into EH-CRSNs and proposes a system energy efficiency (EE) maximization-oriented clustering protocol (EEMCP) to achieve a trade-off between network lifetime and monitoring capability. Specifically, by optimizing the reflection coefficient matrix of the active IRS during uplink transmission, the transmission range of cluster heads (CHs) is extended, enabling direct communication with the sink and mitigating data delivery failures caused by the absence of suitable relay nodes in conventional clustered EH-CRSNs. Furthermore, the optimal cluster radius is theoretically derived with the objective of maximizing system EE, thereby constraining local control signaling and intra-cluster communication ranges to reduce energy consumption. High-quality CHs are then selected to form clusters through joint evaluation of node-level communication capacity and channel quality to enhance data transmission performance. Simulations indicate that the EEMCP protocol enables superior system EE, exceeding the peak EE of existing clustering protocols by at least 1.98 times.
{"title":"System energy efficiency maximization-oriented clustering protocol design for active IRS-aided EH-CRSNs","authors":"Jihong Wang, Yongxin Fan, Yanan Zhu, Miao Yu, Yang Li","doi":"10.1016/j.adhoc.2026.104148","DOIUrl":"10.1016/j.adhoc.2026.104148","url":null,"abstract":"<div><div>In clustered energy harvesting-cognitive radio sensor networks (EH-CRSNs), reliance on direct links for both EH and data transmission causes distant nodes to deplete energy faster, thereby shortening network lifetime. To address the above issues, this paper integrates an active intelligent reflecting surface (IRS) into EH-CRSNs and proposes a system energy efficiency (EE) maximization-oriented clustering protocol (EEMCP) to achieve a trade-off between network lifetime and monitoring capability. Specifically, by optimizing the reflection coefficient matrix of the active IRS during uplink transmission, the transmission range of cluster heads (CHs) is extended, enabling direct communication with the sink and mitigating data delivery failures caused by the absence of suitable relay nodes in conventional clustered EH-CRSNs. Furthermore, the optimal cluster radius is theoretically derived with the objective of maximizing system EE, thereby constraining local control signaling and intra-cluster communication ranges to reduce energy consumption. High-quality CHs are then selected to form clusters through joint evaluation of node-level communication capacity and channel quality to enhance data transmission performance. Simulations indicate that the EEMCP protocol enables superior system EE, exceeding the peak EE of existing clustering protocols by at least 1.98 times.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"184 ","pages":"Article 104148"},"PeriodicalIF":4.8,"publicationDate":"2026-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146023873","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}
Pub Date : 2026-01-14DOI: 10.1016/j.adhoc.2026.104149
Rodolfo W.L. Coutinho , Azzedine Boukerche
Computer vision embedded in Internet of Things (IoT) systems will enable a new era of smart applications where video inference provides contextual awareness for the system. The limited resource capabilities of IoT devices and edge computing servers, often used to support computation-intensive IoT tasks, might not be enough to process video content produced by IoT devices in a computer vision-based smart system. In contrast to state-of-the-art where IoT video inference is performed locally at IoT devices or at edge and cloud servers, we propose a novel collaborative IoT paradigm where IoT devices share their idle resources for the processing of video frames in video analytics systems. We proposed a novel stochastic framework for modeling scenarios of collaborative IoT and edge/cloud continuum for video analytics systems. The proposed mathematical framework considers the unique characteristics of video analytics systems, IoT devices, and edge and cloud servers used to process video flows from IoT cameras in a collaborative manner. The obtained results show that the collaborative processing at neighboring IoT devices, i.e., IoT helpers, contributes to reduce the overall latency for video inference. However, high offloading costs might becoming a limiting factor which would request the design of more efficient offloading strategies.
{"title":"Distributed video analytics for IoT intelligent systems","authors":"Rodolfo W.L. Coutinho , Azzedine Boukerche","doi":"10.1016/j.adhoc.2026.104149","DOIUrl":"10.1016/j.adhoc.2026.104149","url":null,"abstract":"<div><div>Computer vision embedded in Internet of Things (IoT) systems will enable a new era of smart applications where video inference provides contextual awareness for the system. The limited resource capabilities of IoT devices and edge computing servers, often used to support computation-intensive IoT tasks, might not be enough to process video content produced by IoT devices in a computer vision-based smart system. In contrast to state-of-the-art where IoT video inference is performed locally at IoT devices or at edge and cloud servers, we propose a novel collaborative IoT paradigm where IoT devices share their idle resources for the processing of video frames in video analytics systems. We proposed a novel stochastic framework for modeling scenarios of collaborative IoT and edge/cloud continuum for video analytics systems. The proposed mathematical framework considers the unique characteristics of video analytics systems, IoT devices, and edge and cloud servers used to process video flows from IoT cameras in a collaborative manner. The obtained results show that the collaborative processing at neighboring IoT devices, i.e., IoT helpers, contributes to reduce the overall latency for video inference. However, high offloading costs might becoming a limiting factor which would request the design of more efficient offloading strategies.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"184 ","pages":"Article 104149"},"PeriodicalIF":4.8,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146023875","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}
Pub Date : 2026-01-09DOI: 10.1016/j.adhoc.2026.104145
Cong Wang , Menglong Dong , Ying Yuan , Guorui Li
Unmanned aerial vehicle base stations (UAV-BSs) are effective and rapid to provide recovery of emergency communication after disasters due to their maneuverability. However, the throughput of mobile terminals (MTs) is prone to be limited by the trajectory and energy constraints of UAV-BSs. To improve throughput for MTs while guaranteeing energy efficiency of UAV-BSs, we propose an energy-efficient trajectory planning framework based on multi-agent heterogeneous graph reinforcement learning. We formulate the joint optimization problem as a partially observable Markov decision process. Then, we propose a heterogeneous graph-based method to represent relationships between UAV-BSs and network entities. Subsequently, we design a multi-agent graph attention recurrent actor-critic framework (MA-GAR) to efficiently learn over the heterogeneous graphs. Finally, we introduce a digital twin empowered centralized training and decentralized execution mechanism in MA-GAR to reduce energy consumption of UAV-BSs. Experimental results show that the proposed MA-GAR outperforms the benchmark algorithms in convergence speed, system throughput, energy consumption, and service fairness.
{"title":"Energy-efficient trajectory planning for UAV-assisted communication recovery using multi-agent graph reinforcement learning","authors":"Cong Wang , Menglong Dong , Ying Yuan , Guorui Li","doi":"10.1016/j.adhoc.2026.104145","DOIUrl":"10.1016/j.adhoc.2026.104145","url":null,"abstract":"<div><div>Unmanned aerial vehicle base stations (UAV-BSs) are effective and rapid to provide recovery of emergency communication after disasters due to their maneuverability. However, the throughput of mobile terminals (MTs) is prone to be limited by the trajectory and energy constraints of UAV-BSs. To improve throughput for MTs while guaranteeing energy efficiency of UAV-BSs, we propose an energy-efficient trajectory planning framework based on multi-agent heterogeneous graph reinforcement learning. We formulate the joint optimization problem as a partially observable Markov decision process. Then, we propose a heterogeneous graph-based method to represent relationships between UAV-BSs and network entities. Subsequently, we design a multi-agent graph attention recurrent actor-critic framework (MA-GAR) to efficiently learn over the heterogeneous graphs. Finally, we introduce a digital twin empowered centralized training and decentralized execution mechanism in MA-GAR to reduce energy consumption of UAV-BSs. Experimental results show that the proposed MA-GAR outperforms the benchmark algorithms in convergence speed, system throughput, energy consumption, and service fairness.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"184 ","pages":"Article 104145"},"PeriodicalIF":4.8,"publicationDate":"2026-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145928710","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}
Pub Date : 2026-01-06DOI: 10.1016/j.adhoc.2026.104137
Nadine Abbas
The use of unmanned aerial vehicles (UAVs) is becoming an integral element in modern wireless sensor networks (WSNs), due to their flexibility and cost-effectiveness, especially for data collection in challenging hard-to-reach environments. Cluster-based solutions further enhance data collection efficiency by allowing sensor nodes (SNs) to act as cluster heads (CHs) aggregating and relaying data to UAVs. Traditional approaches often rely on static clustering and lack transparency in decision-making regarding CH selection and UAV deployment. This work proposes an explainable energy-efficient UAV-assisted cluster-based data collection framework that integrates optimal and sub-optimal solutions as well as adopts machine learning-based CH prediction augmented with explainable AI techniques. First, we formulate a joint multi-objective optimization problem to minimize UAV usage, ensure energy-efficient CH selection, and guarantee data collection within deadline constraints. Second, we propose a sequential solving approach and then a scalable iterative cluster-based approach to provide real-time solutions for large-scale networks. Moreover, we develop machine learning (ML) models to predict CH selection using a customized dataset generated from extensive simulations of our proposed approach, capturing features like location, neighborhood density, data size, and deadlines. Furthermore, we use Explainable AI (XAI) techniques, particularly SHAP, to interpret the CH prediction model, providing insights into feature importance and decision rationale. This transparency enables network operators to validate CH assignments and strategically plan UAV deployment. Overall, the proposed framework achieves near-optimal trade-offs between UAV deployment, energy consumption, and execution time, leveraging flexible communication, emphasizing spatial and connectivity features and enhancing model interpretability for real-world applications.
{"title":"Explainable energy-efficient UAV-assisted cluster-based data collection in WSNs","authors":"Nadine Abbas","doi":"10.1016/j.adhoc.2026.104137","DOIUrl":"10.1016/j.adhoc.2026.104137","url":null,"abstract":"<div><div>The use of unmanned aerial vehicles (UAVs) is becoming an integral element in modern wireless sensor networks (WSNs), due to their flexibility and cost-effectiveness, especially for data collection in challenging hard-to-reach environments. Cluster-based solutions further enhance data collection efficiency by allowing sensor nodes (SNs) to act as cluster heads (CHs) aggregating and relaying data to UAVs. Traditional approaches often rely on static clustering and lack transparency in decision-making regarding CH selection and UAV deployment. This work proposes an explainable energy-efficient UAV-assisted cluster-based data collection framework that integrates optimal and sub-optimal solutions as well as adopts machine learning-based CH prediction augmented with explainable AI techniques. First, we formulate a joint multi-objective optimization problem to minimize UAV usage, ensure energy-efficient CH selection, and guarantee data collection within deadline constraints. Second, we propose a sequential solving approach and then a scalable iterative cluster-based approach to provide real-time solutions for large-scale networks. Moreover, we develop machine learning (ML) models to predict CH selection using a customized dataset generated from extensive simulations of our proposed approach, capturing features like location, neighborhood density, data size, and deadlines. Furthermore, we use Explainable AI (XAI) techniques, particularly SHAP, to interpret the CH prediction model, providing insights into feature importance and decision rationale. This transparency enables network operators to validate CH assignments and strategically plan UAV deployment. Overall, the proposed framework achieves near-optimal trade-offs between UAV deployment, energy consumption, and execution time, leveraging flexible communication, emphasizing spatial and connectivity features and enhancing model interpretability for real-world applications.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"184 ","pages":"Article 104137"},"PeriodicalIF":4.8,"publicationDate":"2026-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145908941","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}
Pub Date : 2026-01-05DOI: 10.1016/j.adhoc.2026.104135
Mauro Farina, Erica Salvato, Martino Trevisan, Alberto Bartoli
In recent years, Unmanned Aerial Vehicles (UAVs) (also called drones) networks have become increasingly popular in scenarios where rapid deployment, flexible mobility, and real-time data acquisition are crucial, such as disaster relief, environmental monitoring, military operations, and smart city infrastructure. However, due to their dynamic nature and dependence on wireless communication, they are intrinsically vulnerable to a variety of cyberattacks. In this work, we present DRUID, a decentralized scheme for silently identifying a compromised drone that selectively alters the messages it forwards. The scheme uses a combination of secret sharing and multipath routing to allow a pair of communicating drones, namely and , to detect the presence of a compromised drone along any route between them, thereby categorizing each route as either safe or compromised. The scheme operates iteratively and consists of three key modules: (i) an Information Retrieval Procedure that allows to learn more about the topology, (ii) a binary search-like Identification Procedure, and (iii) if the previous module fails to identify the compromised drone, a Node Repositioning Procedure that relocates nodes closer to the compromised path. We validate DRUID on a large and diverse set of 178 731 graphs representing realistic UAV networks with different communication ranges. Comparing our scheme to previous work, experiments show that DRUID achieves a 97 % identification rate—up from the 54 % of the most recent alternative approach. We analyze the cost associated with the node repositioning procedure in terms of computation time and drone movement, and show that it generally takes a few seconds.
{"title":"DRUID: Coordinating drone movements for compromised node identification","authors":"Mauro Farina, Erica Salvato, Martino Trevisan, Alberto Bartoli","doi":"10.1016/j.adhoc.2026.104135","DOIUrl":"10.1016/j.adhoc.2026.104135","url":null,"abstract":"<div><div>In recent years, Unmanned Aerial Vehicles (UAVs) (also called drones) networks have become increasingly popular in scenarios where rapid deployment, flexible mobility, and real-time data acquisition are crucial, such as disaster relief, environmental monitoring, military operations, and smart city infrastructure. However, due to their dynamic nature and dependence on wireless communication, they are intrinsically vulnerable to a variety of cyberattacks. In this work, we present <span>DRUID</span>, a decentralized scheme for silently identifying a compromised drone that selectively alters the messages it forwards. The scheme uses a combination of secret sharing and multipath routing to allow a pair of communicating drones, namely <span><math><mi>A</mi></math></span> and <span><math><mi>B</mi></math></span>, to detect the presence of a compromised drone along any route between them, thereby categorizing each route as either safe or compromised. The scheme operates iteratively and consists of three key modules: (i) an Information Retrieval Procedure that allows <span><math><mi>A</mi></math></span> to learn more about the topology, (ii) a binary search-like Identification Procedure, and (iii) if the previous module fails to identify the compromised drone, a Node Repositioning Procedure that relocates nodes closer to the compromised path. We validate <span>DRUID</span> on a large and diverse set of 178<!--> <!-->731 graphs representing realistic UAV networks with different communication ranges. Comparing our scheme to previous work, experiments show that <span>DRUID</span> achieves a 97<!--> <!-->% identification rate—up from the 54<!--> <!-->% of the most recent alternative approach. We analyze the cost associated with the node repositioning procedure in terms of computation time and drone movement, and show that it generally takes a few seconds.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"184 ","pages":"Article 104135"},"PeriodicalIF":4.8,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145908940","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}
Pub Date : 2026-01-05DOI: 10.1016/j.adhoc.2025.104130
Yan Zhang, Shijie Xu, Qingqing Huang, Yan Han
The sensor nodes equipped with IEEE 802.15.4e (6TiSCH) wireless protocol stack and IPv6 time slot channel hopping mode have deterministic network characteristics after networking, providing low-latency and highly reliable communication for industrial scenarios with growing demand for low-power sensor networks. However, existing scheduling algorithms perform poorly under the bursty traffic commonly found in industrial environments. Due to the limitations of their design principles, they are unable to respond quickly to changes in traffic or differentiate between bursty traffic patterns to accurately sense traffic conditions, resulting in high latency, low reliability and additional power consumption. Therefore, we propose a scheduling method called the Kalman Filter Traffic Sensing Prediction Scheduling Function (KSF). KSF utilizes the filtered processing of node Cell usage and per-slot frame queue increment as the primary basis for scheduling decisions, coupled with adaptive filtering parameters, to achieve the ability to ignore transient fluctuation noise and respond quickly after the occurrence of bursts. In addition, we utilize filtering to predict the ratio of the number of received data packets to the number of sent data packets in the next slot frame to distinguish burst patterns and dynamically change KSF’s scheduling strategy. Experiments demonstrate that KSF exhibits more optimal scheduling performance under bursty traffic conditions, reducing latency by 14.82% compared to the well-known OTF while maintaining the lowest power consumption across all traffic rates.
{"title":"Kalman filter scheduling for 6TiSCH network with traffic adaptation optimized for bursty traffic","authors":"Yan Zhang, Shijie Xu, Qingqing Huang, Yan Han","doi":"10.1016/j.adhoc.2025.104130","DOIUrl":"10.1016/j.adhoc.2025.104130","url":null,"abstract":"<div><div>The sensor nodes equipped with IEEE 802.15.4e (6TiSCH) wireless protocol stack and IPv6 time slot channel hopping mode have deterministic network characteristics after networking, providing low-latency and highly reliable communication for industrial scenarios with growing demand for low-power sensor networks. However, existing scheduling algorithms perform poorly under the bursty traffic commonly found in industrial environments. Due to the limitations of their design principles, they are unable to respond quickly to changes in traffic or differentiate between bursty traffic patterns to accurately sense traffic conditions, resulting in high latency, low reliability and additional power consumption. Therefore, we propose a scheduling method called the Kalman Filter Traffic Sensing Prediction Scheduling Function (KSF). KSF utilizes the filtered processing of node Cell usage and per-slot frame queue increment as the primary basis for scheduling decisions, coupled with adaptive filtering parameters, to achieve the ability to ignore transient fluctuation noise and respond quickly after the occurrence of bursts. In addition, we utilize filtering to predict the ratio of the number of received data packets to the number of sent data packets in the next slot frame to distinguish burst patterns and dynamically change KSF’s scheduling strategy. Experiments demonstrate that KSF exhibits more optimal scheduling performance under bursty traffic conditions, reducing latency by 14.82% compared to the well-known OTF while maintaining the lowest power consumption across all traffic rates.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"184 ","pages":"Article 104130"},"PeriodicalIF":4.8,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145928709","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}
Pub Date : 2025-12-31DOI: 10.1016/j.adhoc.2025.104133
Zongpu Wei, Jinsong Wang, Zening Zhao, Zhao Zhao, Kai Shi
Integrating an intrusion detection system (IDS) into UAVs is critical for safeguarding their operational reliability and overall security. Centralized IDS deployed in data centers has become impractical, primarily due to concerns over data privacy and computational constraints. Federated learning (FL)-based IDS alleviates the data leakage issue inherent in traditional IDS. Nevertheless, its integration with UAV systems still encounters unavoidable challenges. Firstly, the requirement for local model training on UAVs imposes substantial computational overhead. Secondly, the non-independent and identically distributed (non-IID) data characteristics of UAVs directly impair the performance of the IDS model. Thirdly, the constant dynamic changes in UAV network connectivity undermine the robustness of the federated IDS. To address these challenges, this paper presents a U-shaped split federated intrusion detection system (UpsFed-IDS) for securing UAV communication. Inspired by FL and Split Learning (SL), we offload a portion of the IDS model training to the Ground Control Station (GCS). This approach ensures that raw data and labels remain on the UAVs, which enhances data privacy protection and reduces the computational overhead on the UAV side. Within this system, we propose a split-specific head personalization method to decouple global feature learning from local model personalization under the SL scheme, which strengthens the IDS model performance in heterogeneous data scenarios. Furthermore, a client failover mechanism is designed to tackle disconnections occurring during training in dynamic UAV networks, which effectively improves the overall robustness of the system. Extensive experimental evaluations are conducted on the UAVCAN attack and WSN-DS datasets. The results demonstrate that UpsFed-IDS outperforms existing FL frameworks in both attack recognition performance and local computation overhead.
{"title":"UpsFed-IDS: U-shaped split federated intrusion detection system for securing UAV communication in dynamic networks","authors":"Zongpu Wei, Jinsong Wang, Zening Zhao, Zhao Zhao, Kai Shi","doi":"10.1016/j.adhoc.2025.104133","DOIUrl":"10.1016/j.adhoc.2025.104133","url":null,"abstract":"<div><div>Integrating an intrusion detection system (IDS) into UAVs is critical for safeguarding their operational reliability and overall security. Centralized IDS deployed in data centers has become impractical, primarily due to concerns over data privacy and computational constraints. Federated learning (FL)-based IDS alleviates the data leakage issue inherent in traditional IDS. Nevertheless, its integration with UAV systems still encounters unavoidable challenges. Firstly, the requirement for local model training on UAVs imposes substantial computational overhead. Secondly, the non-independent and identically distributed (non-IID) data characteristics of UAVs directly impair the performance of the IDS model. Thirdly, the constant dynamic changes in UAV network connectivity undermine the robustness of the federated IDS. To address these challenges, this paper presents a U-shaped split federated intrusion detection system (UpsFed-IDS) for securing UAV communication. Inspired by FL and Split Learning (SL), we offload a portion of the IDS model training to the Ground Control Station (GCS). This approach ensures that raw data and labels remain on the UAVs, which enhances data privacy protection and reduces the computational overhead on the UAV side. Within this system, we propose a split-specific head personalization method to decouple global feature learning from local model personalization under the SL scheme, which strengthens the IDS model performance in heterogeneous data scenarios. Furthermore, a client failover mechanism is designed to tackle disconnections occurring during training in dynamic UAV networks, which effectively improves the overall robustness of the system. Extensive experimental evaluations are conducted on the UAVCAN attack and WSN-DS datasets. The results demonstrate that UpsFed-IDS outperforms existing FL frameworks in both attack recognition performance and local computation overhead.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104133"},"PeriodicalIF":4.8,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884183","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}
The deployment of unmanned aerial vehicles (UAVs) for wireless coverage in dynamic environments, such as public gatherings, road junctions, and urban intersections, presents numerous challenges owing to variations in the size of the hotspots, the mobility patterns of the users, and quality of service (QoS) requirements. Although the iterative or heuristic algorithms used in previous papers can potentially adapt to these changes, they would either incur significant runtime overhead on computationally constrained UAV hardware or require uninterrupted backhaul communication. In this paper, we formalize the above Dynamic UAV Deployment (DUDE) problem, show that it is NP-hard, and propose a hybrid Convolutional Neural Network-based (CNN-based) approach to predict the optimal 3D placement of a single UAV. Our CNN-based model is trained on a custom synthetic dataset that encompasses diverse user distributions and hotspot sizes, allowing it to perform extensive offline training and then infer UAV positions online in real-time, thereby eliminating the need for repeated online iterations. Experimental results demonstrate that our model achieves a mean absolute error of 3.5 and an average score exceeding 96% in predicting the UAV’s 3D position across heterogeneous hotspot areas and different statistical distributions of position of users. We also provide extensive comparisons with greedy user-assignment schemes and demonstrate improved connectivity under QoS constraints.
{"title":"A deep learning-based approach for heterogeneous hotspot-coverage in UAV deployment","authors":"Kolichala Rajashekar , Vamsi Krishna Sunkara , Subhajit Sidhanta","doi":"10.1016/j.adhoc.2025.104127","DOIUrl":"10.1016/j.adhoc.2025.104127","url":null,"abstract":"<div><div>The deployment of unmanned aerial vehicles (UAVs) for wireless coverage in dynamic environments, such as public gatherings, road junctions, and urban intersections, presents numerous challenges owing to variations in the size of the hotspots, the mobility patterns of the users, and quality of service (QoS) requirements. Although the iterative or heuristic algorithms used in previous papers can potentially adapt to these changes, they would either incur significant runtime overhead on computationally constrained UAV hardware or require uninterrupted backhaul communication. In this paper, we formalize the above Dynamic UAV Deployment (DUDE) problem, show that it is NP-hard, and propose a hybrid Convolutional Neural Network-based (CNN-based) approach to predict the optimal 3D placement of a single UAV. Our CNN-based model is trained on a custom synthetic dataset that encompasses diverse user distributions and hotspot sizes, allowing it to perform extensive offline training and then infer UAV positions online in real-time, thereby eliminating the need for repeated online iterations. Experimental results demonstrate that our model achieves a mean absolute error of 3.5 and an average <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> score exceeding 96% in predicting the UAV’s 3D position across heterogeneous hotspot areas and different statistical distributions of position of users. We also provide extensive comparisons with greedy user-assignment schemes and demonstrate improved connectivity under QoS constraints.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104127"},"PeriodicalIF":4.8,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884185","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}
Pub Date : 2025-12-30DOI: 10.1016/j.adhoc.2025.104125
Haozhe Liu , Jinfang Zhao , Qun Zhao , Hongliang Sun
Wireless sensor networks (WSNs) are extensively employed in contemporary practical applications. Consequently, analyzing the reliability of WSNs is a significant research area. Recent research has focused on the impact of multiple operational states and functional dependencies on system reliability. However, current reliability modeling approaches rarely address both the effects of data transmission blocking and component dependency failures. Furthermore, studies on system states frequently neglect the diverse operational modes of WSNs, potentially leading to an inaccurate characterization of system behavior over time. To address these shortcomings, this study conceptualizes multi-state WSNs as modular k-out-of-n systems with FDEP, where each module comprising a cluster head (CH) node and its corresponding sensor nodes. Dynamic Bayesian network (DBN) models are employed to construct the structure function of the multi-state WSN. The parameters encoded in the DBN graphical structure of the multi-state WSN are generated automatically by a customized algorithm. Furthermore, an inferencing α-factor method is introduced in DBN model to integrate prior knowledge with observations for updating system reliability while accounting for common cause failures (CCFs). Finally, taking a multi-state meteorological surveillance system as an example, its traffic model is multi-hop transmission, consisting of 8 modules and 46 sensor nodes. The dynamic reliability was evaluated comprehensively when considering FDEP and CCF to illustrate applicability of the proposed framework.
{"title":"Reliability analysis of multi-state wireless sensor networks with functional dependency based on dynamic Bayesian networks","authors":"Haozhe Liu , Jinfang Zhao , Qun Zhao , Hongliang Sun","doi":"10.1016/j.adhoc.2025.104125","DOIUrl":"10.1016/j.adhoc.2025.104125","url":null,"abstract":"<div><div>Wireless sensor networks (WSNs) are extensively employed in contemporary practical applications. Consequently, analyzing the reliability of WSNs is a significant research area. Recent research has focused on the impact of multiple operational states and functional dependencies on system reliability. However, current reliability modeling approaches rarely address both the effects of data transmission blocking and component dependency failures. Furthermore, studies on system states frequently neglect the diverse operational modes of WSNs, potentially leading to an inaccurate characterization of system behavior over time. To address these shortcomings, this study conceptualizes multi-state WSNs as modular <em>k</em>-out-of-<em>n</em> systems with FDEP, where each module comprising a cluster head (CH) node and its corresponding sensor nodes. Dynamic Bayesian network (DBN) models are employed to construct the structure function of the multi-state WSN. The parameters encoded in the DBN graphical structure of the multi-state WSN are generated automatically by a customized algorithm. Furthermore, an inferencing <em>α</em>-factor method is introduced in DBN model to integrate prior knowledge with observations for updating system reliability while accounting for common cause failures (CCFs). Finally, taking a multi-state meteorological surveillance system as an example, its traffic model is multi-hop transmission, consisting of 8 modules and 46 sensor nodes. The dynamic reliability was evaluated comprehensively when considering FDEP and CCF to illustrate applicability of the proposed framework.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"183 ","pages":"Article 104125"},"PeriodicalIF":4.8,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884344","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}
Pub Date : 2025-12-30DOI: 10.1016/j.adhoc.2025.104134
Liping Luo , Zhou Peng , Han Xu , Renhai Feng
Accurate Topology Identification (TI) in non-cooperative networks is critical, particularly during various communication engagements that demand low computational overhead. Active interception has proven effective in such scenarios. Specifically, active interception is performed on full-duplex eavesdroppers which cause frequency hopping, thereby obtaining corresponding received signal strength as indicator. However, its interference power adjustment requires numerous iterations and causes overwhelming frequency hopping. This paper proposes a novel Reinforcement Learning-based Active Interception and Node Localization (RLAI-NL) method. RLAI-NL aims to accurately identify network topology. Four different frequency hopping patterns are designed to evaluate the performance of RLAI-NL. Using Reinforcement Learning (RL), an intelligent agent is trained to dynamically adjust its interference power. Through dynamic learning and policy optimization, the agent avoids unnecessary power consumption associated with specially designed search strategies, while adapting effectively to both small- and large-scale networks as well as various communication modes. Simulation results demonstrate that RLAI significantly outperforms traditional active interception methods, achieving 99% accuracy with fewer frequency hops and iterations, thereby reducing computational complexity and power consumption.
{"title":"A reinforcement learning–based active interception algorithm for wireless networks topology identification","authors":"Liping Luo , Zhou Peng , Han Xu , Renhai Feng","doi":"10.1016/j.adhoc.2025.104134","DOIUrl":"10.1016/j.adhoc.2025.104134","url":null,"abstract":"<div><div>Accurate Topology Identification (TI) in non-cooperative networks is critical, particularly during various communication engagements that demand low computational overhead. Active interception has proven effective in such scenarios. Specifically, active interception is performed on full-duplex eavesdroppers which cause frequency hopping, thereby obtaining corresponding received signal strength as indicator. However, its interference power adjustment requires numerous iterations and causes overwhelming frequency hopping. This paper proposes a novel Reinforcement Learning-based Active Interception and Node Localization (RLAI-NL) method. RLAI-NL aims to accurately identify network topology. Four different frequency hopping patterns are designed to evaluate the performance of RLAI-NL. Using Reinforcement Learning (RL), an intelligent agent is trained to dynamically adjust its interference power. Through dynamic learning and policy optimization, the agent avoids unnecessary power consumption associated with specially designed search strategies, while adapting effectively to both small- and large-scale networks as well as various communication modes. Simulation results demonstrate that RLAI significantly outperforms traditional active interception methods, achieving 99% accuracy with fewer frequency hops and iterations, thereby reducing computational complexity and power consumption.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"184 ","pages":"Article 104134"},"PeriodicalIF":4.8,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146023874","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}