Léonce Thérèse Pidy Pidy, Justin Moskolaï Ngossaha, Thenuka Karunathilake, Samuel Bowong Tsakou, Anna Förster
Vehicular ad hoc networks (VANETs) are an essential enabler of intelligent transport systems (ITS), facilitating real-time communication among vehicles to enhance traffic safety and mobility. However, challenges such as high node mobility, frequent topology changes, and variable network density continue to impede the design of reliable and efficient routing protocols. This paper proposes CARAC (Cluster-based Ant-colony Routing with Adaptive Cluster Head), a hybrid routing protocol that integrates dynamic clustering using the K-medoids algorithm with Ant Colony Optimisation (ACO) to improve route stability, scalability, and data delivery performance. CARAC forms mobility-aware clusters by grouping vehicles based on spatial proximity and relative velocity. Each node periodically computes a local stability index to evaluate its membership within a cluster, allowing adaptive cluster maintenance. The protocol also incorporates ACO for optimal path selection and utilises Road Side Units (RSUs) as relays when direct communication between cluster heads is not feasible. Simulation experiments conducted in NS-3 with a vehicular network scenario demonstrate that CARAC consistently outperforms benchmark protocols such as AQRV, MetaLearn and CPB. It delivers higher route discovery success, better packet delivery performance, lower latency, and greater throughput. These results validate the advantages of combining clustering, bio-inspired optimisation, and adaptive stability evaluation in VANET routing, positioning CARAC as a robust and scalable solution for next-generation ITS applications.
车辆自组织网络(VANETs)是智能交通系统(ITS)的重要推动者,促进车辆之间的实时通信,以提高交通安全和机动性。然而,节点的高移动性、频繁的拓扑变化和多变的网络密度等挑战仍然阻碍着可靠和高效路由协议的设计。本文提出了CARAC (Cluster-based Ant- Colony Routing with Adaptive Cluster Head),这是一种混合路由协议,它将使用K-medoids算法和蚁群优化(ACO)的动态聚类集成在一起,以提高路由的稳定性、可扩展性和数据传输性能。CARAC根据空间接近度和相对速度对车辆进行分组,形成机动感知集群。每个节点定期计算本地稳定性指数,以评估其在集群中的成员资格,从而允许自适应集群维护。该协议还结合了ACO进行最优路径选择,并在集群头之间无法直接通信时利用路旁单元(rsu)作为中继。在NS-3车载网络场景中进行的仿真实验表明,CARAC始终优于AQRV、MetaLearn和CPB等基准协议。路由发现成功率高、报文发送性能好、时延低、吞吐量大。这些结果验证了在VANET路由中结合集群,生物启发优化和自适应稳定性评估的优势,将CARAC定位为下一代ITS应用的强大且可扩展的解决方案。
{"title":"An Efficient Cluster-Based Routing Protocol for Enhanced Data Delivery and Stability in VANETs: Cluster-Based Ant-Colony Routing With Adaptive Cluster Head","authors":"Léonce Thérèse Pidy Pidy, Justin Moskolaï Ngossaha, Thenuka Karunathilake, Samuel Bowong Tsakou, Anna Förster","doi":"10.1049/ntw2.70013","DOIUrl":"10.1049/ntw2.70013","url":null,"abstract":"<p>Vehicular ad hoc networks (VANETs) are an essential enabler of intelligent transport systems (ITS), facilitating real-time communication among vehicles to enhance traffic safety and mobility. However, challenges such as high node mobility, frequent topology changes, and variable network density continue to impede the design of reliable and efficient routing protocols. This paper proposes CARAC (Cluster-based Ant-colony Routing with Adaptive Cluster Head), a hybrid routing protocol that integrates dynamic clustering using the K-medoids algorithm with Ant Colony Optimisation (ACO) to improve route stability, scalability, and data delivery performance. CARAC forms mobility-aware clusters by grouping vehicles based on spatial proximity and relative velocity. Each node periodically computes a local stability index to evaluate its membership within a cluster, allowing adaptive cluster maintenance. The protocol also incorporates ACO for optimal path selection and utilises Road Side Units (RSUs) as relays when direct communication between cluster heads is not feasible. Simulation experiments conducted in NS-3 with a vehicular network scenario demonstrate that CARAC consistently outperforms benchmark protocols such as AQRV, MetaLearn and CPB. It delivers higher route discovery success, better packet delivery performance, lower latency, and greater throughput. These results validate the advantages of combining clustering, bio-inspired optimisation, and adaptive stability evaluation in VANET routing, positioning CARAC as a robust and scalable solution for next-generation ITS applications.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70013","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144894327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Large scale software-defined networks have two main concerns, which are scalability and reliability. One of the problems with multi-controller architectures in these networks is the static mapping between SDN switches and controllers, which prevents the control plane from adapting to traffic changes. The dynamic mapping between switches and controllers by migrating switches from highly loaded controllers to lightly loaded controllers can provide compatibility for the control plane. This paper first discusses multi-controller load balancing as a key research challenge and then explores switch migration as a solution. A variety of load balancing methods based on switch migration are investigated and then a comprehensive comparison is made between them.
{"title":"A Survey of Load Balancing Approaches Based on Switch Migration in Software-Defined Networks","authors":"Hamid Reza Naji, Harir Riyahi","doi":"10.1049/ntw2.70015","DOIUrl":"10.1049/ntw2.70015","url":null,"abstract":"<p>Large scale software-defined networks have two main concerns, which are scalability and reliability. One of the problems with multi-controller architectures in these networks is the static mapping between SDN switches and controllers, which prevents the control plane from adapting to traffic changes. The dynamic mapping between switches and controllers by migrating switches from highly loaded controllers to lightly loaded controllers can provide compatibility for the control plane. This paper first discusses multi-controller load balancing as a key research challenge and then explores switch migration as a solution. A variety of load balancing methods based on switch migration are investigated and then a comprehensive comparison is made between them.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70015","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144832776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Paulo Victor, Iris Viana dos Santos Santana, Álvaro Sobrinho, Lenardo Chaves e Silva, Leandro Dias da Silva, Danilo F. S. Santos, Angelo Perkusich
This study experiments with machine learning algorithms for detecting distributed denial of service attacks as a multiclass classification problem. The algorithms included the K-nearest neighbours, decision trees, support vector machines, random forests, extreme gradient boosting, gradient boosting machines and multilayer perceptron. We validated the models using the hold-out and cross-validation methods, performed class and model ablation analysis to evaluate performance impacts and applied feature selection techniques, feature importance and statistical tests. For instance, using 10-fold cross-validation with 79 features, 11 attack types and regular network traffic, the tree-based models achieved accuracies ranging from 75.69% to 76.24%. When using 15 features, seven attacks and regular network traffic, model accuracy improved significantly, ranging from 97.77% to 98.08%. Furthermore, in specific application scenarios, some models achieved near-perfect classification performance. Decision tree achieved the highest accuracy score for the local network communication scenario, reaching 99.86%, followed by software distribution or updates at 99.70%, web platforms and online applications at 98.25%, video streaming or online gaming at 97.06%, infrastructure monitoring and management at 95.00% and directory services and corporate authentication at 87.15%. Depending on the application scenario, our results indicate that specialised models can support classification tasks targeting specific system components with high performance.
{"title":"Distributed Denial of Service Detection: Enhancing Machine Learning Models for Multiclass Classification","authors":"Paulo Victor, Iris Viana dos Santos Santana, Álvaro Sobrinho, Lenardo Chaves e Silva, Leandro Dias da Silva, Danilo F. S. Santos, Angelo Perkusich","doi":"10.1049/ntw2.70014","DOIUrl":"10.1049/ntw2.70014","url":null,"abstract":"<p>This study experiments with machine learning algorithms for detecting distributed denial of service attacks as a multiclass classification problem. The algorithms included the K-nearest neighbours, decision trees, support vector machines, random forests, extreme gradient boosting, gradient boosting machines and multilayer perceptron. We validated the models using the hold-out and cross-validation methods, performed class and model ablation analysis to evaluate performance impacts and applied feature selection techniques, feature importance and statistical tests. For instance, using 10-fold cross-validation with 79 features, 11 attack types and regular network traffic, the tree-based models achieved accuracies ranging from 75.69% to 76.24%. When using 15 features, seven attacks and regular network traffic, model accuracy improved significantly, ranging from 97.77% to 98.08%. Furthermore, in specific application scenarios, some models achieved near-perfect classification performance. Decision tree achieved the highest accuracy score for the local network communication scenario, reaching 99.86%, followed by software distribution or updates at 99.70%, web platforms and online applications at 98.25%, video streaming or online gaming at 97.06%, infrastructure monitoring and management at 95.00% and directory services and corporate authentication at 87.15%. Depending on the application scenario, our results indicate that specialised models can support classification tasks targeting specific system components with high performance.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145128994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yassir AL-Karawi, Raad S. Alhumaima, Hamed Al-Raweshidy
This paper proposes a strategy for designing Open Radio Access Networks (ORAN) to maximise their energy efficiency using solar power, supplemented by Reconfigurable Intelligent Surfaces (RIS) and Mobile Edge Computing (MEC). Because grid power is not always available where these ORAN systems are built, our approach manages the difficulties created by dynamic energy and timing issues found in isolated environments. The approach concentrates on allocating energy to all transmitters, CPU speed and RIS phases in real time, subject to strict rules on power use, latency issues and heat. The primal-dual algorithm we propose reacts to queue and energy changes to update the dual variables and control policies without access to every channel parameter. Our combined (composite) cost function measures energy use, delays encountered by users, reliability of the SINR and fairness. Results from the simulation indicate that using the proposed method lowers energy usage by 25% and average delay by 18%, outperforming baseline models under varying solar and traffic patterns. Robustness is further validated through sensitivity and ablation analyses. This work demonstrates the feasibility of deploying sustainable, intelligent ORAN infrastructures in remote 6G scenarios where conventional power and connectivity are unavailable.
{"title":"Energy-Aware Optimisation for Off-Grid ORAN With RIS and Edge Computing","authors":"Yassir AL-Karawi, Raad S. Alhumaima, Hamed Al-Raweshidy","doi":"10.1049/ntw2.70012","DOIUrl":"10.1049/ntw2.70012","url":null,"abstract":"<p>This paper proposes a strategy for designing Open Radio Access Networks (ORAN) to maximise their energy efficiency using solar power, supplemented by Reconfigurable Intelligent Surfaces (RIS) and Mobile Edge Computing (MEC). Because grid power is not always available where these ORAN systems are built, our approach manages the difficulties created by dynamic energy and timing issues found in isolated environments. The approach concentrates on allocating energy to all transmitters, CPU speed and RIS phases in real time, subject to strict rules on power use, latency issues and heat. The primal-dual algorithm we propose reacts to queue and energy changes to update the dual variables and control policies without access to every channel parameter. Our combined (composite) cost function measures energy use, delays encountered by users, reliability of the SINR and fairness. Results from the simulation indicate that using the proposed method lowers energy usage by 25% and average delay by 18%, outperforming baseline models under varying solar and traffic patterns. Robustness is further validated through sensitivity and ablation analyses. This work demonstrates the feasibility of deploying sustainable, intelligent ORAN infrastructures in remote 6G scenarios where conventional power and connectivity are unavailable.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144773857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This work presents a novel machine learning (ML)-driven framework to optimise reactive routing protocols (RRPs) in mobile ad hoc networks (MANETs), tackling congestion control through intelligent, real-time protocol selection. Building on our prior Adaptive Expanding Ring Search (AERS) method enhanced with random early detection (RED), the study introduces an ML classification system that dynamically identifies the most efficient RRP based on network conditions. High-accuracy classifiers, AdaBoost (95%), K-Nearest Neighbours (93%), and Decision Trees (92%), enable data-driven decision-making, systematically evaluating protocols across diverse topologies to maximise performance. The framework ensures context-aware routing, significantly improving Quality of Service (QoS) through enhanced packet delivery, reduced latency, and robust congestion mitigation. Rigorous NS-3 simulations validate the approach, demonstrating measurable gains over conventional methods. By integrating predictive analytics into routing strategy, this research advances the design and deployment of RRPs, bridging algorithmic innovation with practical implementation. The results offer high-impact insights for both academic research and real-world MANET applications, establishing a new paradigm for adaptive, efficient routing in dynamic wireless environments.
{"title":"Adaptive Routing Strategies for Optimisation in MANETs Through Integration of Expanding Ring Search and Random Early Detection Using Machine Learning","authors":"Durre Nayab, Mohammad Haseeb Zafar, Madiha Sher","doi":"10.1049/ntw2.70005","DOIUrl":"10.1049/ntw2.70005","url":null,"abstract":"<p>This work presents a novel machine learning (ML)-driven framework to optimise reactive routing protocols (RRPs) in mobile ad hoc networks (MANETs), tackling congestion control through intelligent, real-time protocol selection. Building on our prior Adaptive Expanding Ring Search (AERS) method enhanced with random early detection (RED), the study introduces an ML classification system that dynamically identifies the most efficient RRP based on network conditions. High-accuracy classifiers, AdaBoost (95%), K-Nearest Neighbours (93%), and Decision Trees (92%), enable data-driven decision-making, systematically evaluating protocols across diverse topologies to maximise performance. The framework ensures context-aware routing, significantly improving Quality of Service (QoS) through enhanced packet delivery, reduced latency, and robust congestion mitigation. Rigorous NS-3 simulations validate the approach, demonstrating measurable gains over conventional methods. By integrating predictive analytics into routing strategy, this research advances the design and deployment of RRPs, bridging algorithmic innovation with practical implementation. The results offer high-impact insights for both academic research and real-world MANET applications, establishing a new paradigm for adaptive, efficient routing in dynamic wireless environments.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144717054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
5G networks and beyond set a critical requirement for both massive capacity and seamless connectivity to all users. This implies that, the network must have both very high capacity and users' fairness. Non-Orthogonal Multiple-Access (NOMA)-based Multibeam Satellite Networks (MBSNs) are designed for 5G networks, and are thus, required to provide both high capacity and high users' fairness. Most existing power-allocation (PA) algorithms for NOMA-MBSNs focus on maximising the network's throughput alone, with not much attention on user's fairness. This leaves a critical requirement of 5G networks unaddressed. As an attempt to close this gap, this paper, proposes a PA algorithm that maximises the users' fairness of a 2Users NOMA-MBSN. To do so, the maximisation request is formulated as an optimisation problem. The original problem being NP-hard, it is decomposed into two sub-problems; namely, the intra-beam and the inter-beam fairness maximisation. Each of these problem is independently solved by means of numerical search methods. In this regards, the concept of converging the Offered-Capacity to Traffic-Request (OCTR) ratios of respective users, in order to maximise the system's fairness, is employed. Thus, based on the OCTR-ratios convergence concept, the fairness maximisations power-allocation algorithms, which respectively solve the two sub-problems, are designed. The two algorithms include the intra-beam and the inter-beam power-allocation algorithms. A global power-allocation algorithm (PAA-1) combines the two algorithm, to yield a solution to the original problem. Numerical results confirm that, the algorithm makes all the OCTR-ratios of all user converge; thus maximising the network's users-fairness. Results also demonstrate the superiority of the proposed PAA-1 with respect to achieved system's fairness, compared to some other existing PA algorithms.
{"title":"Power-Allocation Algorithm for Fairness Maximisation of Non-Orthogonal Multiple Access-Based Multibeam Satellite Networks","authors":"Joel Biyoghe, Vipin Balyan","doi":"10.1049/ntw2.70011","DOIUrl":"10.1049/ntw2.70011","url":null,"abstract":"<p>5G networks and beyond set a critical requirement for both massive capacity and seamless connectivity to all users. This implies that, the network must have both very high capacity and users' fairness. Non-Orthogonal Multiple-Access (NOMA)-based Multibeam Satellite Networks (MBSNs) are designed for 5G networks, and are thus, required to provide both high capacity and high users' fairness. Most existing power-allocation (PA) algorithms for NOMA-MBSNs focus on maximising the network's throughput alone, with not much attention on user's fairness. This leaves a critical requirement of 5G networks unaddressed. As an attempt to close this gap, this paper, proposes a PA algorithm that maximises the users' fairness of a 2Users NOMA-MBSN. To do so, the maximisation request is formulated as an optimisation problem. The original problem being NP-hard, it is decomposed into two sub-problems; namely, the intra-beam and the inter-beam fairness maximisation. Each of these problem is independently solved by means of numerical search methods. In this regards, the concept of converging the Offered-Capacity to Traffic-Request (OCTR) ratios of respective users, in order to maximise the system's fairness, is employed. Thus, based on the OCTR-ratios convergence concept, the fairness maximisations power-allocation algorithms, which respectively solve the two sub-problems, are designed. The two algorithms include the <i>intra-beam</i> and <i>the inter-beam</i> power-allocation algorithms. A global power-allocation algorithm (PAA-1) combines the two algorithm, to yield a solution to the original problem. Numerical results confirm that, the algorithm makes all the OCTR-ratios of all user converge; thus maximising the network's users-fairness. Results also demonstrate the superiority of the proposed PAA-1 with respect to achieved system's fairness, compared to some other existing PA algorithms.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144672840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chen Guanzhou, Kouki Takahashi, Mai Mikogami, Yuki Ichimura, Takeshi Hirai, Taewoon Kim, Shigeo Shioda
This paper investigates the characteristics of slotted ALOHA and power-domain nonorthogonal multiple access (PD-NOMA) hybrid schemes, focusing on two key performance metrics, namely device transmission success probability and base station throughput, while also considering distance-based unfairness among devices. We analyse three distinct hybrid schemes: a scheme where all devices transmit signals with equal power without utilising received signal strength (RSS) targets (Scheme 1), a scheme where devices randomly select one of multiple RSS targets at the nearest base station (Scheme 2), and a scheme where devices select one of multiple RSS targets based on their proximity to the nearest base station (Scheme 3). Our findings reveal that while Scheme 1 has the highest performance, it also has the most pronounced distance-based unfairness. Conversely, Scheme 2 has the lowest performance but effectively mitigates distance-based unfairness. The performance of Scheme 3 improves as the number of RSS targets increases; however, this coincides with an increase in distance-based unfairness. These results suggest that achieving a balance between fairness and performance improvement may be inherently challenging in grant-free access schemes.
{"title":"Performance Analysis of Hybrid Scheme of Slotted ALOHA and PD-NOMA for Massive Machine-Type Communications","authors":"Chen Guanzhou, Kouki Takahashi, Mai Mikogami, Yuki Ichimura, Takeshi Hirai, Taewoon Kim, Shigeo Shioda","doi":"10.1049/ntw2.70009","DOIUrl":"10.1049/ntw2.70009","url":null,"abstract":"<p>This paper investigates the characteristics of slotted ALOHA and power-domain nonorthogonal multiple access (PD-NOMA) hybrid schemes, focusing on two key performance metrics, namely device transmission success probability and base station throughput, while also considering distance-based unfairness among devices. We analyse three distinct hybrid schemes: a scheme where all devices transmit signals with equal power without utilising received signal strength (RSS) targets (Scheme 1), a scheme where devices randomly select one of multiple RSS targets at the nearest base station (Scheme 2), and a scheme where devices select one of multiple RSS targets based on their proximity to the nearest base station (Scheme 3). Our findings reveal that while Scheme 1 has the highest performance, it also has the most pronounced distance-based unfairness. Conversely, Scheme 2 has the lowest performance but effectively mitigates distance-based unfairness. The performance of Scheme 3 improves as the number of RSS targets increases; however, this coincides with an increase in distance-based unfairness. These results suggest that achieving a balance between fairness and performance improvement may be inherently challenging in grant-free access schemes.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144672825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A Software-Defined Network (SDN)-based Vehicular Ad Hoc Network (VANET) plays a crucial role in Intelligent Transport Systems (ITS) by enhancing road safety for drivers and vehicles through the periodic exchange of messages and data related to traffic, vehicle status, and weather conditions. Additionally, it offers entertainment services for passengers. However, SDN-based VANETs face security challenges, particularly in the central control unit, making them vulnerable to Distributed Denial-of-Service (DDoS) attacks, which can disrupt the entire network. Moreover, due to the programmability of SDN infrastructure, injection attacks can manipulate traffic or generate false crisis events. The network is also susceptible to various cyber threats, including man-in-the-middle (MITM), tracking, and replay attacks, necessitating robust security measures. Several security frameworks have been proposed to mitigate these risks, but many authentication mechanisms suffer from high computational and communication costs or provide protection against specific attacks while remaining ineffective against others. To address these limitations, we introduce a hybrid security framework integrating an authentication system between the trusted authority (TA), lead vehicle (LV), and other vehicles, along with an intrusion detection system (IDS). The authentication process involves key generation by the TA, mutual authentication between the TA and LV, as well as between the LV and other vehicles, while ensuring secure encryption using the AES-ECDH algorithm. To enhance security further, the proposed IDS utilises Fuzzy C-Means clustering to detect malicious activities and network threats. Performance analysis demonstrates that our approach effectively improves security, privacy, and efficiency while maintaining a low computational overhead, outperforming existing solutions.
{"title":"A Secure Privacy-Preserving System for SDN-Based VANET Using the AES-ECDH Algorithm","authors":"Adi El-Dalahmeh, Jie Li, Moawiah El-Dalahmeh","doi":"10.1049/ntw2.70010","DOIUrl":"10.1049/ntw2.70010","url":null,"abstract":"<p>A Software-Defined Network (SDN)-based Vehicular Ad Hoc Network (VANET) plays a crucial role in Intelligent Transport Systems (ITS) by enhancing road safety for drivers and vehicles through the periodic exchange of messages and data related to traffic, vehicle status, and weather conditions. Additionally, it offers entertainment services for passengers. However, SDN-based VANETs face security challenges, particularly in the central control unit, making them vulnerable to Distributed Denial-of-Service (DDoS) attacks, which can disrupt the entire network. Moreover, due to the programmability of SDN infrastructure, injection attacks can manipulate traffic or generate false crisis events. The network is also susceptible to various cyber threats, including man-in-the-middle (MITM), tracking, and replay attacks, necessitating robust security measures. Several security frameworks have been proposed to mitigate these risks, but many authentication mechanisms suffer from high computational and communication costs or provide protection against specific attacks while remaining ineffective against others. To address these limitations, we introduce a hybrid security framework integrating an authentication system between the trusted authority (TA), lead vehicle (LV), and other vehicles, along with an intrusion detection system (IDS). The authentication process involves key generation by the TA, mutual authentication between the TA and LV, as well as between the LV and other vehicles, while ensuring secure encryption using the AES-ECDH algorithm. To enhance security further, the proposed IDS utilises Fuzzy C-Means clustering to detect malicious activities and network threats. Performance analysis demonstrates that our approach effectively improves security, privacy, and efficiency while maintaining a low computational overhead, outperforming existing solutions.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144657686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The transformation of industrial systems through real-time analytics, autonomous control, and intelligent data acquisition has underscored the pivotal role of Industrial Edge Computing (IEC) in next-generation Industrial Internet of Things (IIoT) environments. By enabling decentralized processing close to data sources, IEC enhances responsiveness, supports latency-sensitive applications, and reduces the strain on centralized infrastructure. However, as IIoT ecosystems grow in scale and complexity, traditional edge solutions face increasing challenges related to device heterogeneity, dynamic network conditions, bandwidth constraints, and energy efficiency. This special issue explores emerging advancements in edge intelligence that address these pressing challenges. It brings together innovative research that leverages artificial intelligence, advanced communication technologies, and architectural innovations to improve the adaptability, resilience, and performance of edge-enabled industrial systems. The featured studies contribute novel techniques for real-time data processing, secure and efficient communication, and intelligent decision-making at the edge, all of which are essential for supporting industrial automation, predictive maintenance, and cyber-physical operations. Collectively, these contributions highlight the immense potential of edge intelligence to redefine the operational landscape of industrial systems. This issue is intended to support ongoing research and practical innovation in the evolving domain of edge-enabled IIoT technologies.
{"title":"Guest Editorial: Edge Intelligence for Next Generation Industrial IoT Applications","authors":"Varun G. Menon, Mainak Adhikari, Brij Bhooshan Gupta, Abhishek Hazra, Spyridon Mastorakis","doi":"10.1049/ntw2.70008","DOIUrl":"10.1049/ntw2.70008","url":null,"abstract":"<p>The transformation of industrial systems through real-time analytics, autonomous control, and intelligent data acquisition has underscored the pivotal role of Industrial Edge Computing (IEC) in next-generation Industrial Internet of Things (IIoT) environments. By enabling decentralized processing close to data sources, IEC enhances responsiveness, supports latency-sensitive applications, and reduces the strain on centralized infrastructure. However, as IIoT ecosystems grow in scale and complexity, traditional edge solutions face increasing challenges related to device heterogeneity, dynamic network conditions, bandwidth constraints, and energy efficiency. This special issue explores emerging advancements in edge intelligence that address these pressing challenges. It brings together innovative research that leverages artificial intelligence, advanced communication technologies, and architectural innovations to improve the adaptability, resilience, and performance of edge-enabled industrial systems. The featured studies contribute novel techniques for real-time data processing, secure and efficient communication, and intelligent decision-making at the edge, all of which are essential for supporting industrial automation, predictive maintenance, and cyber-physical operations. Collectively, these contributions highlight the immense potential of edge intelligence to redefine the operational landscape of industrial systems. This issue is intended to support ongoing research and practical innovation in the evolving domain of edge-enabled IIoT technologies.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144551004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rakesh Kumar Godi, Swathi Agarwal, A. S. Hamsa, S. Supreeth, B. J. Ambika, S. Rohith
The introduction of vehicle clouds, whose processing, sensor, and networking capabilities are forcefully dispersed to authorised users, is prompted by the rising popularity of cloud computing. When certain vehicles enter and exit the cloud, new computational resources become available, creating an unpredictable environment that makes measuring key performance indicators like job completion time very challenging. As part of a Nomadic Vehicular Cloud (NVC) system that includes automobiles on a roadway, our main contribution is to reduce job migrations. It has been calculated how long it will take to complete the task without spending more money because of vehicular cloud operations. The simulation outcome showed that the suggested approach successfully reduces task completion time and enhances NVC performance. According to the performance data, our technique shortens work completion time by 25% compare to other approaches.
{"title":"Improvising the Performance of Nomadic Vehicular Cloud by Reducing Task Migrations","authors":"Rakesh Kumar Godi, Swathi Agarwal, A. S. Hamsa, S. Supreeth, B. J. Ambika, S. Rohith","doi":"10.1049/ntw2.70006","DOIUrl":"10.1049/ntw2.70006","url":null,"abstract":"<p>The introduction of vehicle clouds, whose processing, sensor, and networking capabilities are forcefully dispersed to authorised users, is prompted by the rising popularity of cloud computing. When certain vehicles enter and exit the cloud, new computational resources become available, creating an unpredictable environment that makes measuring key performance indicators like job completion time very challenging. As part of a Nomadic Vehicular Cloud (NVC) system that includes automobiles on a roadway, our main contribution is to reduce job migrations. It has been calculated how long it will take to complete the task without spending more money because of vehicular cloud operations. The simulation outcome showed that the suggested approach successfully reduces task completion time and enhances NVC performance. According to the performance data, our technique shortens work completion time by 25% compare to other approaches.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144315230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}