Network slicing and resource provisioning in 6G focus on creating multiple customized virtual networks over a shared infrastructure. However, these approaches also introduce challenges, like increased architectural complexity, higher implementation costs, security vulnerabilities between slices in resource optimization across highly dynamic and heterogeneous network environments. In this work, Exponentially Tactical Unit Algorithm (ETUA) is devised for network slicing in 6G. Initially, blockchain-enabled 6G network is simulated, and the set of features, like user device type, delay rate and packet loss rate are collected from various devices. Moreover, network slicing is done by ETUA that integrates Exponentially Weighted Moving Average (EWMA) and Tactical Unit Algorithm (TUA). Finally, resource allocation is performed using Attention High-order Deep Network (AHoNet) by considering the parameters that includes bit error probability, sum rate and trust. The efficacy of ETUA is examined by bit error probability, utility and latency with 0.012, 0.950 and 0.509 Sec.
Oleksandr Pidpalyi, Олександр Романов, Larysa Globa, Антон Романов · 6 authors
The subject matter of the article is the iTZBEI (Integrated Trust–ZTA–Blockchain SDN Efficiency Index) – a novel composite metric for quantitative security assessment of software-defined networks (SDN) integrating Zero Trust Architecture (ZTA) and Blockchain technologies. The relevance of the research is determined by the fact that the centralized SDN control model generates critical vulnerabilities, including DDoS attacks, unauthorized routing manipulation, and insider threats – for which no unified quantitative evaluation framework currently exists. The study introduced a formalized aggregated security metric that enables continuous monitoring and comparative assessment across all components of the SDN–ZTA–Blockchain architecture. The tasks to be solved include: (1) identification of principal SDN attack vectors; (2) formalization of a transaction-processing algorithm covering the full access lifecycle; (3) definition of nine local security indicators; and (4) construction of the iTZBEI index with justified weighting coefficients. The methods used combine mathematical formalization of access control processes, cryptographic transaction verification, and experimental emulation of attack scenarios in a Mininet–OpenDaylight–Hyperledger Fabric environment. Conclusions. The obtained results of the article consist in the development of a functional algorithm that performs dynamic verification of user requests, makes adaptive authorization decisions according to the principles of least privilege, and records these decisions in an immutable distributed ledger. A metrics system is proposed, including local indicators such as the Continuous Authorisation Integrity Score (CAIS), the Blockchain Audit Integrity Score (BAIS), and the Local Policy Integrity (LPI). On this basis, the generalized Integrated Trust and Zero-Trust Blockchain Evaluation Index (iTZBEI) is described as an aggregated metric for comparative evaluation and continuous monitoring of the network’s security state. Scientific novelty. This study introduces a unified SDN + ZTA + Blockchain framework for network security, formalizes a transaction-level algorithm that directly links access decisions with distributed audit procedures, and proposes the iTZBEI metric as the first integral indicator for evaluating the integration’s effectiveness in dynamic network environments.
Kapil K. Jajulwar, Priya Dasarwar, Uma Yadav, Bhakti Prasad Thakre · 6 authors
Blockchain consensus mechanisms are important to ensure the safe validation of transactions. However, the limitations of high computational complexity, energy consumption, and mining latency restrict the scalability of blockchain in large-scale IP-based and wireless network environments. Current methods mainly rely on single optimization methods without jointly optimizing miner selection and hash computation, resulting in inferior performance under dynamic network conditions. To fill this gap, this study presents a new hybrid bioinspired optimization framework for efficient blockchain mining, integrating Genetic Algorithm (GA), Firefly optimization, and Particle Swarm Optimization (PSO) into a unified architecture to take advantage of their complementary strengths. The proposed method uses both historical and real-time performance metrics to determine the best mining nodes. The Firefly algorithm is used to optimize the selection of hash ranges to reduce CPU workload. PSO is used to select high-performance neighboring nodes for collaborative mining. The model is implemented using the NS-2 simulator and tested over a network of 1000 wireless nodes under different consensus protocols. The experimental results illustrate 4.3% decrease in computational complexity, 4% decrease in energy consumption, and 5% decrease in mining delay. The model further reduces mining complexity by up to 34.2% and reduces the energy utilization from 24.5% to 16.6%, demonstrating its effectiveness for scalable and energy-efficient blockchain deployment.
This perspective examines whether nuclear fusion can provide a scalable, low-carbon power source for rapidly growing AI-driven data center demand. As large language models, cloud computing, and cryptocurrency mining accelerate electricity consumption growth, data centers are projected to account for a substantially larger share of U.S. and global electricity use in the coming decades, creating significant pressure on grid reliability and decarbonization goals. We evaluate the technical and economic alignment between data center load profiles and nuclear power, particularly fusion, through a comparative analysis of capacity factors, levelized cost of electricity, grid interconnection constraints, and deployment pathways. Unlike intermittent renewables, nuclear fission and fusion offer high-capacity-factor, firm baseload generation suited to AI training and inference workloads that require continuous, reliable power. Preliminary techno-economic analysis suggests that several Nth-of-a-kind fusion concepts, particularly magnetic confinement systems, may become cost-competitive with firmed renewable systems and advanced fission for hyperscale data center applications. Co-location of fusion plants with data centers further reduces transmission bottlenecks, improves resilience, and aligns with emerging hyperscaler procurement strategies. We also assess recent regulatory developments and argue that fusion's favorable safety profile and reduced waste burden improve its long-term social and political viability relative to fission. We conclude that fusion represents a strategically important pathway for sustainably powering next-generation computing infrastructure and should be prioritized in both policy and industrial deployment planning.
Multi-cloud adoption has widened the enterprise attack surface to a degree that perimeter-based defence can no longer address. Traffic is now flowing continuously across AWS, Azure, and GCP, and the majority of deployed Zero Trust Architecture (ZTA) systems are still using static rule tables, with no ability to provide an audit trail of the reasoning behind decisions, and with logs stored in datastores that can be modified by an insider without detection. This paper proposes ZT-ChainGuard, a framework that overcomes these three limitations in one architecture that integrates an ensemble machine learning trust-scoring engine, ZTA policy enforcement and a blockchain-based audit trail. The trust-scoring engine is a two-layer stacking ensemble, with XGBoost and Random Forest as base learners, and Logistic Regression as a meta-learner, and it returns a continuous trust score, P(Attack | flow), for each network flow, which is then used to trigger the ZT policy decision at a threshold of 0.5. The explanation of each decision is provided by SHAP values at both the global and per-flow level, and each decision is stored as an immutable, SHA-256 hash-chained block. On CICIDS2017 (2.83 million flows, 14 attack classes) the framework achieves 99.90% accuracy, 99.71% F1-score, and 99.99% ROC-AUC; on ToN-IoT (2.23 million IoT records, 9 attack types) it achieves 99.81% accuracy, 99.88% F1-score, and 100% ROC-AUC. The latency of inferences is 0.006ms per sample, and the overhead of auditing the blockchain is 0.019ms per block. This performance is not just a quirk of a particular split, as it is shown to be stable across the three folds of three-fold cross validation.
An increasing number of special Internet of Things (IoT) applications are being deployed within federated and zero-trust (ZT) environments. These ad-hoc networks consist of heterogeneous, resource-constrained devices from various administrative domains, all of which are susceptible to compromise. The dynamic nature of these environments necessitates near-real-time Situational Awareness (SA), where processed data varies with its sensitivity and reliability, without dependence on a central authority. Examples include NATO and non-NATO coalitions engaged in hybrid military operations or humanitarian aid scenarios. To address the challenges of security, reliability, and context-aware data dissemination, we propose FedM, a multi-level formal model designed for context-aware and policy-driven data dissemination in federated IoT environments. This model is built upon various access control models and Denning’s research on information flow control (IFC), prioritizing the protection and reliability of data flows. A crucial element of this model is the distributed ledger, which facilitates the dynamic modification of label expressiveness, enhances resilience against disruption attacks, and separates policy logic from application functionality to mitigate risks associated with the benevolent developer. Additionally, we delineate a deterministic and history- and precedence-aware policy enforcement procedure to resolve conflicting actions and introduce processing primitives for the ongoing Data Quality Assessment (DQA) process. Our model also aligns with the concepts of Ubiquitous and Continuum Computing. Furthermore, in our paper we illustrate a policy-based dissemination pipeline, incorporating a bounded trustworthiness dimension. Additionally, we present a refined multi-layered framework that proposes the deployment of Information Flow Control (IFC) components, such as the Open Policy Agent decision engine, to facilitate policy-driven contextual data dissemination. We provide preliminary benchmarks for resource-constrained platforms, along with a formal threat model that addresses implicit flows, the benevolent developer problem, and the behavior of a distributed ledger under degraded network conditions. Finally, we conduct a formal verification of our model using the P framework.
Layer 2 scaling solutions—including payment-channel-based Lightning Networksand rollup-based off-chain execution environments—are commonly understood aslinear scaling projects for blockchain transaction throughput. This paper proposesan alternative structural interpretation: the emergence of Layer 2 is not a continuous increase in system capacity, but a percolation phase transition that occurswhen the density of off-chain channels or cross-rollup connections crosses a critical threshold. During this phase transition, the system shifts from a fragmentedlocally connected state to a globally routable giant connected state. The paperanalyzes the Lightning Network and the rollup ecosystem as comparative cases.Empirical studies of the Lightning Network show that its scale-free topology forcescritical hub nodes to bear a disproportionate connection load, thereby binding thenetwork’s global connectivity to the survival of a few high-centrality nodes. Therollup ecosystem faces the structural predicament of liquidity fragmentation, and itsevolution toward cross-rollup interoperability likewise exhibits a phase-transitionlogic from quantitative change to qualitative change in network effects. Based onthe above analysis, this paper distills three design principles for Layer 2 scalability:facilitating the institutionalization of cross-domain connections, avoiding overlyhomogenized cognitive convergence, and implementing differentiated verificationrouting among tasks with different security requirements.
Hassan Cessi Ibrahim, Damilare Timothy Ogunjobi, Philip Mensah
The networks that run operational technology (OT) substations, water treatment plants, oil and gas pipelines, and manufacturing lines are moving from a centralized control to a federated, multi-stakeholder architecture coordinated by permissioned distributed ledgers. Protection and control loops in the electrical grid and other critical infrastructure have protection-relay tripping times, IEC 61850 GOOSE message classes, and SCADA/PMU polling cycles that impose multi-millisecond to sub-second deadlines on protection and control operations, while Byzantine fault-tolerant (BFT) consensus protocols like PBFT, Tendermint, HotStuff, and HoneyBadgerBFT were designed for settlement workloads that can tolerate hundreds of milliseconds to seconds of latency. In this paper, we survey four representative BFT families, discuss their structural latency and scalability constraints for OT deployment, and introduce a hybrid consensus algorithm called IsoBFT (Isochronous Byzantine Fault Tolerance), which combines an optimistic single-round-trip fast path with a PBFT-style fallback mechanism based on a network-stability monitor, and elects a small rotating committee using a verifiable random function (VRF). A formal system model, safety/liveness/termination proof, and security analysis for eight attack classes are provided, with a proposition quantifying the degradation of the practical availability of the safety guarantee when the global Byzantine fraction is approaching one-third. Using realistic Modbus/DNP3/IEC 61850 OT traffic, the discrete-event simulation of the design IsoBFT managed to execute realistic workloads with median consensus latency ranging from 4.90ms at n = 10-50 to 9.17-11.26ms at n = 100 and n = 500, remaining competitive with or better than PBFT and Tendermint across this range. Committee-bounded communication overhead stayed essentially flat with respect to the number of validators from n = 10 to n = 50, but newly completed runs at n = 100 and n = 500 (n = 200 still outstanding) show overhead growing faster than the quadratic scaling of PBFT and Tendermint over that range, together with a heavy P95/P99 latency tail not present at smaller scale; this discrepancy with the theoretical scale-independence result is reported and discussed rather than resolved. IsoBFT could reduce the median latency by approximately 81% and 56% under up to 33% Byzantine faults compared to HotStuff and HoneyBadgerBFT, respectively, at n = 10-50, while maintaining the safety of the system; a Byzantine-resilience sweep at n = 100 shows a narrower advantage over PBFT/Tendermint than at smaller scale.
Q-PROOF is an experimental blockchain architecture based on adaptive consensus, aperiodic topology, and quadratic governance. The model integrates Aperiodic Consensus Relaxation (ACR), distributed reputation, Sybil attack defense, coordinated attack detection, and post-quantum migration pathways. This technical white paper outlines the core consensus engine, mathematical modeling of system tension, correlation-aware consensus mechanics, and benchmark comparisons demonstrating enhanced finality and resilience against coordinated network capture.