Network

Network operators increasingly rely on abstracted telemetry (e.g., flow records and time-aggregated statistics) to achieve scalable monitoring of high-speed networks, but this abstraction fundamentally constrains the forensic and security inferences that can be supported from network data. We present a design-time audit framework that evaluates which threat hypotheses become non-supportable as network evidence is transformed from packet-level traces to flow records and time-aggregated statistics. Our methodology examines three evidence layers (L0: packet headers, L1: IP Flow Information Export (IPFIX) flow records, L2: time-aggregated flows), computes a catalog of 13 network-forensic artifacts (e.g., destination fan-out, inter-arrival time burstiness, SYN-dominant connection patterns) at each layer, and maps artifact availability to tactic support using literature-grounded associations with MITRE Adversarial Tactics, Techniques, and Common Knowledge (ATT&CK). Applied to backbone traffic from the MAWI Day-In-The-Life (DITL) archive, the audit reveals selectiveinference loss: Execution becomes non-supportable at L1 (due to loss of packet-level timing artifacts), while Lateral Movement and Persistence become non-supportable at L2 (due to loss of entity-linked structural artifacts). Inference coverage decreases from 9 to 7 out of 9 evaluated ATT&CK tactics, while coverage of defensive countermeasures (MITRE D3FEND) increases at L1 (7 → 8 technique categories) then decreases at L2 (8 → 7), reflecting a shift from behavioral monitoring to flow-based controls. The framework provides network architects with a practical tool for configuring telemetry systems (e.g., IPFIX exporters, P4 pipelines) to reason about and provision the minimum forensic coverage. Full article

Devices equipped with the Global Positioning System (GPS) generate massive volumes of trajectory data on a daily basis, imposing substantial computational, network, and storage burdens. Online trajectory simplification reduces redundant points in a streaming manner while preserving essential spatial and temporal characteristics. A representative method in this line of research is Directed acyclic graph-based Online Trajectory Simplification (DOTS). However, DOTS does not preserve stay-related information and can incur high computational cost. To address these limitations, we propose Directed acyclic graph-based Online Trajectory Simplification with Stay Areas (DOTSSA), a fast online simplification method that integrates DOTS with an online stay area detection algorithm (SA). In DOTSSA, SA continuously monitors movement patterns to detect stay areas and segments the incoming trajectory accordingly, after which DOTS is applied to the extracted segments. This approach ensures the preservation of stay areas while reducing computational overhead through localized DAG construction. Experimental evaluations on a real-world dataset show that, compared with DOTS, DOTSSA can reduce compression time, while achieving comparable compression ratios and preserving key trajectory features. Full article

In recent years, with the improvement of unmanned aerial vehicle (UAV) performance, various applications have been explored. In environments such as disaster areas, where existing infrastructure may be damaged, alternative uplink communication for transmitting observation data from UAVs to the ground station (GS) is critical. However, conventional mobile ad hoc network (MANET) routing protocols do not sufficiently account for GS-oriented traffic or the highly mobile UAV topology. This study proposed a flying ad hoc network (FANET) routing protocol that introduces a control option called GS flood, where the GS periodically disseminates routing information, enabling each UAV to efficiently acquire fresh source routes to the GS. Evaluation using NS-3 in a disaster scenario confirmed that the proposed method achieves a higher packet delivery ratio and practical latency compared to the representative MANET routing protocols, namely DSR, AODV, and OLSR, while operating with fewer control IP packets than existing methods. Furthermore, although the multihop throughput between UAVs and the GS in the proposed method plateaued at approximately 40% of the physical-layer maximum, it demonstrated performance exceeding realistic satellite uplink capacities ranging from several hundred kbps to several Mbps. Full article

The Internet of Things (IoT) has transformed global connectivity by linking people, smart devices, and data. However, as the number of connected devices continues to grow, ensuring secure data transmission and communication has become increasingly challenging. IoT security threats arise at the device level due to limited computing resources, mobility, and the large diversity of devices, as well as at the network level, where the use of varied protocols by different vendors introduces further vulnerabilities. Physical Unclonable Functions (PUFs) provide a lightweight, hardware-based security primitive that exploits inherent device-specific variations to ensure uniqueness, unpredictability, and enhanced protection of data and user privacy. Additionally, modeling attacks against PUF architectures is challenging due to the random and unpredictable physical variations inherent in their design, making it nearly impossible for attackers to accurately replicate their unique responses. This study collected approximately 80,000 Challenge Response Pairs (CRPs) from a Ring Oscillator (RO) PUF design to evaluate its resilience against modeling attacks. The predictive performance of five machine learning algorithms, i.e., Support Vector Machines, Logistic Regression, Artificial Neural Networks with a Multilayer Perceptron, K-Nearest Neighbors, and Gradient Boosting, was analyzed, and the results showed an average accuracy of approximately 60%, demonstrating the strong resistance of the RO PUF to these attacks. The NIST statistical test suite was applied to the CRP data of the RO PUF to evaluate its randomness quality. The p-values from the 15 statistical tests confirm that the CRP data exhibit true randomness, with most values exceeding the 0.01 threshold and supporting the null hypothesis of randomness. Full article

Efficient clustering is essential for reducing energy consumption and extending the operational lifetime of Wireless Sensor Networks. Classical protocols such as LEACH, PEGASIS, HEED, and EEHC frequently exhibit unbalanced energy usage, resulting in early node failures and reduced communication reliability. This study introduces an Enhanced Grey Wolf Optimization-based Neural Network (EGWO-NN) designed to adaptively select cluster heads by continuously optimizing decision parameters according to real-time network conditions. The proposed method is evaluated against four benchmark protocols using statistical comparisons of node survivability, transmission energy, and communication performance. Results show that EGWO-NN sustains significantly more alive nodes per round, with strong statistical differences compared with LEACH, PEGASIS, HEED, and EEHC (t = 18.27, 9.94, 18.91, 18.93; p < ${10}^{-22}$). Transmission energy analysis similarly indicates significant improvements across all pairwise tests (|t| = 4.12–46.34; p < ${10}^{-4}$), supported by an overall ANOVA result (F = 14.74, p = $1.42\times {10}^{-10}$). EGWO-NN also enhances data delivery, outperforming baseline protocols in both packets sent and Packet Delivery Ratio, with highly significant differences (t = 17.62–19.75 and 11.25–22.89). These findings demonstrate that EGWO-NN provides a robust and scalable approach for improving energy efficiency and communication reliability in WSNs. Full article

One of the main sources of entertainment is live video streaming platforms, which allow viewers to watch video streams in real time. However, because of the increasing demand for high quality content, the vulnerability of streaming systems against cyberattacks highlights how crucial it is to implement strong security mechanisms without sacrificing performance. Therefore, the safeguard of video streams against cyberthreats such as content tampering and interception is a top priority while still maintaining robustness against network fluctuations. Two distinct scenarios are proposed to test AES-128 encryption in securing HTTP live streaming segments against content tampering and resilience to packet loss. Results show that AES-128 encryption provides confidentiality and successfully prevents meaningful manipulation of the video content, confirming its reliability as segment encryption does not significantly alter packet loss-induced playback behavior compared to unencrypted streaming under the tested conditions, Performance analysis shows that AES-128 has no significant difference in data loss for up to 4% of network packet loss compared to unencrypted segments. Full article

The expansion of 5G networks has led to larger attack surfaces due to more applications and use cases, more IoT connections, and the distributed 5G system architecture. Existing security frameworks often lack the ability to perform real-time, context-aware risk assessments that are specifically adapted to dynamic 5G environments. In this paper, we present an integrated framework that combines Snort intrusion detection with a risk and impact assessment model to evaluate threats in real time. By correlating intrusion alerts with contextual risk metrics tied to 5G core functions, the framework prioritizes incidents and supports timely mitigation. Evaluation in a controlled testbed shows the framework’s stability, scalability, and effective risk classification, thereby strengthening cybersecurity for next-generation networks. Full article

Underwater networks are crucial for monitoring the marine ecosystem, enabling data collection to support the preservation and protection of natural resources. Among the various technologies available, acoustic and optical communications stand out for their superior performance in underwater environments. Acoustic technologies are suitable for long-range communications, typically operating over hundreds of meters up to several kilometers, albeit with low data rates ranging from a few hundred bps to few tens of kbps. In contrast, optical technologies excel in providing high data rates, often between 1 and 10 Mbps, but only over short distances (e.g., 50 m) in controlled conditions. To leverage the strengths of these technologies, recent research has proposed multi-modal underwater systems; however, these solutions generally rely on single-level or at most dual-level architectures, limiting the benefits of a structured hierarchical approach. In this review paper, after discussing related work on multi-technology acoustic and optical networks, we highlight relevant design guidelines for multi-technology, multi-level underwater architectures, explicitly considering three layers: a deep acoustic layer, an intermediate optical layer, and an upper RF-enabled surface layer. For illustration, we also discuss a PoC of such a hierarchical architecture under development at the University of Catania, Italy, in the Area Marina Isole dei Ciclopi natural reserve. The PoC includes optical nodes capable of transmitting up to 10 Mbps over short ranges and acoustic nodes (both software defined and not) supporting rates of tens of kbps over hundreds of meters and being adaptive to network conditions, interconnected through hybrid multi-technology nodes deployed across the three network levels. By assigning specific technologies to appropriate layers, the architecture enhances scalability, robustness, and adaptability to dynamic underwater conditions. This design strategy not only improves data transmission efficiency but also ensures seamless operation across diverse marine scenarios, making it an effective solution for a wide range of underwater monitoring applications. Full article

IoT applications are increasingly common, yet they often rely on expensive, externally managed authentication services. This paper introduces a novel, self-contained authentication method for IoT applications which leverages fog computing principles to lower operational costs and infrastructure complexity. The proposed system, fogauth, combines device serial numbers with cryptographically generated UUIDs to establish secure identification without third-party services. A static cloud-side architecture coupled with a lightweight, locally hosted API enables secure authentication through object-storage operations. Performance testing demonstrates comparable security performance to commercial cloud-based authentication while reducing long-term operational costs and maintaining latency at below 2 minutes in production conditions. fogauth provides a scalable and economically viable alternative for companies seeking to reduce cloud dependency and minimize long-term costs associated with IoT application security. To support reproducibility, a complete open-source implementation and validation dataset are provided, allowing independent replication and extension of the system. Full article

Future programmable networks such as 5G/6G and large-scale IoT deployments demand dynamic and intelligent bandwidth control mechanisms to ensure stable Quality of Service (QoS) under highly variable traffic conditions. Conventional queue-based schedulers and emerging machine learning techniques still struggle with slow reaction to congestion, unstable fairness, and high computational costs. To address these challenges, this paper proposes a Dynamic Predictive Feedback (DPF) mechanism that integrates clustered-LSTM based short-term traffic prediction with meta-control driven adaptive bandwidth adjustment in a Software-Defined Networking (SDN) architecture. The prediction module proactively estimates future queue depth and arrival rates using in-band network telemetry (INT), while the feedback controller continuously adjusts scheduling weights based on congestion risk and fairness metrics. Extensive emulation experiments conducted under Static, Bursty IoT, Mixed, and Stress workloads show that DPF consistently outperforms state-of-the-art solutions, including A-WFQ and DRL-based schedulers, achieving up to 32% higher throughput, up to 40% lower latency, and 10–12% lower CPU and memory usage. Moreover, DPF demonstrates strong fairness (Jain’s Index ≥ 0.96), high adaptability, and minimal performance variance across scenarios. These results confirm that DPF is a scalable and resource-efficient solution capable of supporting the demands of future programmable, 5G/6G-ready network infrastructures. Full article

Among the 15 beamlines in the first phase of the High-Energy Photon Source (HEPS) in China, the maximum peak data generation volume can reach 1 PB per day, with the maximum peak data generation rate reaching 3.2 Tb/s. This poses significant challenges to the underlying network system. To meet the storage, computing, and analysis needs of HEPS scientific data, this paper designed a high-performance and scalable network architecture based on RoCE (RDMA over Converged Ethernet). Test results demonstrate that the RoCE-based HEPS data center network system achieves high bandwidth and ultra-low latency, stably maintains reliable transmission performance during the interaction of scientific data storage, computing, and analysis, and exhibits excellent scalability to adapt to the future expansion of HEPS beamlines. Full article

Modern Software-Defined Wide Area Networks (SD-WANs) require adaptive controller placement addressing multi-objective optimization where latency minimization, load balancing, and fault tolerance must be simultaneously optimized. Traditional static approaches fail under dynamic network conditions with evolving traffic patterns and topology changes. This paper presents a novel hybrid framework integrating Gaussian Mixture Model (GMM) clustering with Multi-Agent Reinforcement Learning (MARL) for dynamic controller placement. The approach leverages probabilistic clustering for intelligent MARL initialization, reducing exploration requirements. Centralized Training with Decentralized Execution (CTDE) enables distributed optimization through cooperative agents. Experimental evaluation using real-world topologies demonstrates a noticeable reduction in the latency, improvement in network balance, and significant computational efficiency versus existing methods. Dynamic adaptation experiments confirm superior scalability during network changes. The hybrid architecture achieves linear scalability through problem decomposition while maintaining real-time responsiveness, establishing practical viability. Full article

Current federated identity management systems lack contextual awareness of workflows across independent systems, creating security gaps and workflow integrity challenges. This article details the design and implementation of Alohomora, a distributed workflow-aware authentication system that maintains cross-system workflow context through path-bound tokens. Alohomora complements existing identity providers such as OAuth and SAML by adding workflow orchestration capabilities while leveraging standard authentication protocols for initial user verification. The system introduces workflow graphs as a formal model for representing dependencies between functions across heterogeneous systems and employs a distributed caching architecture with collaboration groups for scalable session management. In a typical deployment scenario, an employee onboarding workflow across human resources services, account provisioning, and benefits systems forms a trust group where Alohomora enforces ordered step execution, validates prerequisite completion at each transition, and generates cryptographic completion assertions upon workflow finalization. Extensive performance evaluation under concurrent user requests demonstrates polynomial performance characteristics with superior scalability compared to centralized OAuth introspection. The results show that Alohomora maintains high throughput under heavy load while providing strong, secure access control through workflow path binding and distributed trust orchestration. The prototype implementation is available as open source. Full article

Heterogeneous wireless sensor networks (HWSNs), comprising super nodes and normal sensors, offer a promising solution for monitoring diverse environments. However, their deployment is constrained by the limited battery life of sensors. To address this issue, clustering and routing techniques have been employed to conserve energy. Nevertheless, existing approaches often struggle with suboptimal energy distribution and weak network coverage. Additionally, they mostly failed to exploit other energy saving techniques such as sleep scheduling. This paper proposes a novel genetic algorithm (GA)-based approach to optimize sleep scheduling, routing, and clustering in HWSNs. The method comprises two phases, namely join sleep scheduling and tree construction, and clustering of normal nodes. Inspired by the concept of unequal clustering, the HWSN is split into some rings in the first phase, and the number of awake super nodes in each ring keeps the same. This approach addresses the challenges of balancing energy consumption and network lifetime. Furthermore, including network coverage and energy-related criteria in the proposed GA yields long-lasting network operation. Through rigorous simulations, we demonstrate that, on average, our algorithm reduces energy consumption and improves network coverage by 23% and 21.9%, respectively, and extends network lifetime by 501 rounds, compared to the state-of-the-art methods. Full article

This paper presents a real-time handover and link assignment framework for low-Earth-orbit (LEO) satellite networks operating in dense urban canyons. The proposed Markov chain-guided simulated annealing (MCSA) algorithm optimizes user-to-satellite assignments under dynamic channel and capacity constraints. By incorporating Markov chains to guide state transitions, MCSA achieves faster convergence and more effective exploration than conventional simulated annealing. Simulations conducted in Ku-band urban canyon environments show that the framework achieves an average user satisfaction of about 97%, providing an approximately 10% improvement over genetic algorithm (GA) results. It also delivers 10–15% higher resource utilization, lower blocking rates comparable to integer linear programming (ILP), and superior runtime scalability with linear complexity $O(k·|U|·|S\left|\right)$. These results confirm that MCSA provides a scalable and robust real-time mobility management solution for next-generation LEO satellite systems. Full article

Orbital angular momentum (OAM) beams exhibit divergence during transmission, which constrains the capacity of communication system channels. To address these challenges, intelligent reflecting surfaces (IRSs), which can independently manipulate incident electromagnetic waves by adjustment of their amplitude and phase, are employed to construct IRS-assisted OAM communication systems. By introducing additional information pathways, IRSs enhance diversity gain. We studied the simulations of two placement methods for an IRS: arbitrary placement and standard placement. In the case of arbitrary placement, the beam reflected by the IRS can be decomposed into different OAM modes, producing various reception powers corresponding to each OAM mode component. This improves the signal-to-noise ratio (SNR) at the receiver, thereby enhancing channel capacity. In particular, when the IRS is symmetrically and uniformly positioned at the center of the main transmission axis, its elements can be approximated as a uniform circular array (UCA). This configuration not only achieves optimal reception along the direction of the maximum gain of the orbital angular momentum beam but also reduces the antenna radius required at the receiver to half or even less. Full article

Vehicular Ad-Hoc Networks (VANETs) play a critical role in Intelligent Transportation Systems (ITS), enabling communication between vehicles and roadside infrastructure. This paper proposes an Adaptive Context-Aware VANET Routing (ACAVR) protocol designed to handle the challenges of high mobility, dynamic topology, and variable vehicle density in urban environments. The proposed protocol integrates context-aware routing, dynamic clustering, and geographic forwarding to enhance performance under diverse traffic conditions. Simulation results demonstrate that ACAVR achieves higher throughput, improved packet delivery ratio, lower end-to-end delay, and reduced routing overhead compared to existing routing schemes. The proposed ACAVR outperforms benchmark protocols such as DyTE, RGoV, and CAEL, improving PDR by 12–18%, reducing delay by 10–15%, and increasing throughput by 15–22%. Full article

This paper investigates cooperative behavior among Autonomous Systems (ASs) within a federated network environment designed to support collaborative shared-technology deployment. It makes use of the concept of an AS federation, where independently managed systems adhere to a shared standard while maintaining implementation flexibility. Using a systematic game-theoretic framework, the study models various coalition structures—including full cooperation, partial coalitions, and defection—across several canonical cooperative games. The analysis evaluates the effects of different cooperation strategies and resource-sharing schemes on payoff distribution and coalition stability. Simulation results over short- and medium-to-long-term horizons demonstrate that cooperative coalition formation, especially with fair payoff allocation, consistently outperforms solitary strategies. The study also identifies key thresholds affecting partial coalition viability and explores the impact of defection on overall federation performance. By linking theoretical game models with practical deployment challenges in heterogeneous networked systems, this work offers valuable insights for designing mechanisms that promote effective cooperation in complex, resource-constrained environments. Full article

As network automation and self-organizing networks (SONs) rapidly evolve, edge devices increasingly demand lightweight, real-time, and high-precision classification algorithms to support critical tasks such as traffic identification, intrusion detection, and fault diagnosis. In recent years, cross-entropy (CE) loss has been widely adopted in deep learning classification tasks due to its computational efficiency and ease of optimization. However, traditional CE methods primarily focus on class separability without explicitly constraining intra-class compactness and inter-class boundaries in the feature space, thereby limiting their generalization performance on complex classification tasks. To address this issue, we propose a novel classification loss framework—Contrastive Geometric Cross-Entropy (CGCE). Without incurring additional computational or memory overhead, CGCE explicitly introduces learnable class representation vectors and constructs the loss function based on the dot-product similarity between features and these class representations, thus explicitly reinforcing geometric constraints in the feature space. This mechanism effectively enhances intra-class compactness and inter-class separability. Theoretical analysis further demonstrates that minimizing the CGCE loss naturally induces clear and measurable geometric class boundaries in the feature space, a desirable property absent from traditional CE methods. Furthermore, CGCE can seamlessly incorporate the prior knowledge of pretrained models, converging rapidly within only a few training epochs (for example, on the CIFAR-10 dataset using the ViT model, a single training epoch is sufficient to reach 99% of the final training accuracy.) Experimental results on both text and image classification tasks show that CGCE achieves accuracy improvements of up to 2% over traditional CE methods, exhibiting stronger generalization capabilities under challenging scenarios such as class imbalance, few-shot learning, and noisy labels. These findings indicate that CGCE has significant potential as a superior alternative to traditional CE methods. Full article