Latest ArticlesSatellite Internet of things (SatIoT), positioned as the core evolutionary direction in sixth-generation (6G) mobile network architectures, is establishing a globally seamless ubiquitous IoT connectivity framework with integrated service capabilities through space-terrestrial collaborative networking technologies. Multiple access technology, as a key technology supporting dynamic access for large-scale users in SatIoT, primarily aims to achieve on-demand, orderly, and reliable concurrent access services for massive user terminals through intelligent allocation mechanisms of wireless resources. We review the evolutionary trajectory of ALOHA-based multiple access technologies, categorize existing access technologies into two major technical lineages—slotted random multiple access and unslotted random multiple access—from the perspective of time constraints on data transmission, and conduct a classified analysis of their technical characteristics, delving deeply into the physical layer implementation principles and protocol properties of various technical approaches. Regarding the direction of convergent innovation, we summarize the design paradigms and research achievements of novel hybrid random multiple access technologies, and collate cutting-edge research progress from dimensions such as protocol architectures, spectrum sensing, and service modeling. Finally, we identify future technological directions and development trends in areas including on-demand access control, simplify random multi-access, multi-access edge computing (MEC)-enabled random multi-access, and data-model co-driven model and scenario verification.
The industrial Internet of things (IIoT) faces increasingly severe security threats, and traditional perimeter-based security models are no longer adequate to address evolving and complex demands. Zero trust, an emerging security model centered on the core principle of “never trust, always verify,” has gradually gained attention. However, the research and application of zero trust in the IIoT domain are still in their early stages, necessitating more comprehensive and systematic exploration. We provide a systematic review of the development and applications of zero trust in the industrial sector, with a focus on analyzing its core technologies and practical scenarios while identifying current research trends and future directions. We introduce the basic concepts and principles of industrial zero trust, establishing a theoretical foundation for subsequent discussions. We then systematically outline the migration strategies and evaluation methods for industrial zero trust architectures and summarize key technologies, including authentication, software-defined perimeters, micro-segmentation, secure communication channels, and trust evaluation, collectively forming the core supporting framework of industrial zero trust. Furthermore, we delve into the critical role of access control within the zero trust model and its value in fine-grained permission management. By examining typical IIoT application scenarios, we further explore the practical advantages of zero trust in complex environments. Finally, we identify existing challenges in industrial zero trust and discuss potential future development directions.
With the rapid development of artificial intelligence generated content (AIGC) technologies and the widespread deployment of large language models (LLMs), networks in artificial intelligence data centers are encountering significant challenges. Flow control is a crucial approach for optimizing network performance, providing extremely high bandwidth and ultra-low latency. This paper reviews key issues and solutions in the field of fine-grained flow control, focusing on advances in three key areas: adaptive load balancing mechanisms that dynamically distribute traffic making full use of network resources to avoid congestion, proactive congestion control strategies designed to predict and alleviate potential congestion, and out-of-order packet reordering techniques that ensure data integrity despite non-sequential arrivals. We summarize the mainstream implementation solutions and provide a detailed comparison. Building on this, we discuss the key technical solutions currently adopted by leading artificial intelligence data centers, along with the network devices that support fine-grained flow control. We also identify unresolved challenges in this field, propose potential solutions, and explore future development trends, especially as AI technologies continue to evolve and demand more sophisticated network infrastructures. This review offers valuable insights for researchers and practitioners to optimize network performance in AI-driven applications and highlights important directions for future research in fine-grained flow control.
Softwareization of network function (NF) provides flexibility for the implementation and deployment of new network applications. However, duo to more complex program structure and running environment compared with NF hardware, NF software introduces various performance issues, such as, short-term throughput anomalies and long-tail delays, and degrades user experience. Once NF performance problem occurs, it is necessary to quickly locate problematic modules and determine the cause of the problems through performance measurement. Facing to complex operating environments of NF, increasingly expanding code size, and diverse root causes of problems, coarse-grained performance measurement cannot meet the requirement of problem location and analysis. More efficient fine-grained NF performance measurement is necessary. For the two types of widely used NF performance measurement methods: sampling-based and instrumentation-based, we first prove through actual measurement analysis that, the sampling-based performance measurement method is not suitable for fine-grained NF performance measurement, and the instrumentation-based method will generate a large amount of additional measurement overhead, affecting the measurement results. To this end, we propose a function-level dynamic instrumentation method that combines dynamic library piling and function-level fast breakpoints. Compared with static instrumentation, dynamic instrumentation can execute instrumentation on demand in runtime. It is more suitable for use in the production environment. Our dynamic instrumentation method reduces the instrumentation overhead by an average of 70% compared with baseline fast breakpoints. On this basis, we design and implement the packet-level NF performance measurement method LProfile, based on lightweight probes and storage optimization. Compared with TAU, a general-purpose performance measurement tool, LProfile reduces the single-point measurement overhead by 82%.
In crowdsensing systems, users complete sensing tasks by providing data, but variations in sensor precision, user behavior, and environmental factors lead to significant differences in data quality. Truth discovery techniques mitigate the impact of low-quality data by aggregating multiple user inputs with weighted mechanisms. However, existing methods often overlook personalized privacy needs, exposing sensitive user information. Meanwhile, encryption-based privacy protection mechanisms, though secure, suffer from high computational and communication overhead, making them impractical for large-scale crowdsensing applications. To address these challenges, we propose personalized differential privacy truth discovery (PDPTD), a framework that integrates local differential privacy (LDP) with truth discovery, ensuring both strong privacy protection and high-quality data aggregation. Specifically, PDPTD employs a randomized response mechanism, enabling users to dynamically adjust their data perturbation levels based on personalized privacy budgets. This flexible approach balances privacy protection and data utility, allowing users to contribute valuable data while safeguarding sensitive information. On the server side, PDPTD incorporates a weighted aggregation strategy that compensates for information loss caused by perturbation, effectively improving inference accuracy. Additionally, PDPTD introduces a dynamic user weighting mechanism, which assigns weights based on data quality. This ensures that even if some users select higher perturbation levels, the system can still infer results closed to the true values, maintaining data reliability and consistency.Theoretical analysis and experimental results demonstrate that PDPTD complies with LDP principles while ensuring high accuracy in final inferred results. This makes it a practical and efficient solution for large-scale crowdsensing applications, where balancing privacy, data utility, and computational efficiency is crucial.
To address the limitations in search expressiveness and the inadequacy of verification mechanisms in existing searchable encryption methods, we propose a verifiable Boolean searchable encryption scheme based on blockchain index (VBSE-BI). The scheme first constructs a security model supporting verifiable Boolean search, and based on this model, designs an incremental secure index construction method utilizing blockchain storage structures and achieves efficient search while ensuring the tamper-proof nature of the index structure. Moreover, the scheme introduces an efficient dynamic update mechanism for the secure index, effectively avoiding the significant storage and update overhead caused by auxiliary update structures. To meet the integrity verification requirements of Boolean searches, the scheme defines the unforgeability of Boolean search results and proposes a Boolean operation integrity verification algorithm based on bilinear map accumulators and the extended Euclidean algorithm. Security analysis demonstrates that VBSE-BI scheme can resist dynamic chosen keyword attacks in the random oracle model and satisfy unforgeability under the bilinear q-strong Diffie-Hellman assumption. Compared with similar schemes, VBSE-BI not only supports more expressive Boolean search statements but also significantly reduces the user’s computational complexity to log n (where n is the number of keywords). Experimental results show that by optimizing the verification algorithm, the scheme keeps the user’s verification time consistently low (1.0−1.8 s), accounting for only 9.98%−14.03% of the server-side computation time. These findings indicate that VBSE-BI is highly suitable for resource-constrained mobile devices, providing a solid theoretical foundation and efficiency assurance for the practical application of searchable encryption.
The multi-level blockchains architecture is an architecture that organizes multiple blockchains into a tree, where each blockchain can control and manage part of the functions and on-chain data of the next level of the blockchains to which it is connected by cross-chain technology. However, the cross-chain transfer of assets under this architecture is a multi-hop cross-chain problem, where the evidence of successful execution of a cross-chain transaction needs to be transmitted and verified in multiple hops on the path from the source chain to the target chain, resulting in longer execution latency of the cross-chain transaction, higher evidence transmission overhead and verification overhead. Therefore, we propose a lightweight and efficiently verified assets cross-chain transfer method for multi-level blockchains architecture, which introduces a top-level witness chain connecting each multi-level architecture and deploys a witness contract on each chain, so that the parent chains of the source and target chains in a cross-chain transaction act as witness chains to drive the completion of the cross-chain transaction. We also introduce a cross-chain transaction verification evidence based on Verkle tree, the method organizes the cross-chain transaction information to be processed in the same block in a Verkle tree employing KZG polynomial commitment, and adds the KZG commitment and the proof data into the evidence, and proves the execution state of the cross-chain transaction by verifying the evidence, so as to optimize the transmission and verification of the evidence. Theoretical analysis and experiments on the prototype of the method prove that the method reduces the execution latency of the cross-chain transaction and reduces the evidence verification overhead compared with the scheme using SPV without increasing the evidence transmission overhead, which is lightweight and efficiently verified.
The Internet has become one of critical infrastructures in modern society, in which transmission performance directly determines the capability and value of the services it carries. With the rapid development of mobile and interactive Internet applications, low-latency transmission in large-scale Internet faces three technical challenges at the application layer, transport layer, and network layer, that are the mismatch between dynamic sending decisions of application data and available network resources, the incoordination between network transmission decisions and changes in network status, and the inconsistency between differentiated services and the processing logic of network devices. To address the bottlenecks of traditional hierarchical and single-point transmission optimization, we propose and construct a collaborative transmission technology system for large-scale Internet services. It introduces the technological achievements within this system in three aspects: intelligent transmission decision-making for applications, multi-dimensional collaborative transmission, and customized in-network transmission acceleration, including key insights, basic ideas and principles, and results of large-scale deployment. Finally, the next development trends of Internet transmission technology are prospected.
In the current context of cross-domain identity authentication and data sharing for industrial Internet of things (IIoT) devices, edge servers and blockchain technology play vital roles in enabling rapid data forwarding and secure storage. Existing mechanisms for cross-domain authentication and data sharing are facing a range of security risks, and are further challenged by high computational and communication overhead at the device level, as well as by overly complex authentication structures. To address these problems, we propose a lightweight cross-domain authentication and data sharing scheme based on blockchain technology, specifically designed for IIoT scenarios. The proposed scheme enables anonymous cross-domain authentication and secure data sharing for industrial devices. Furthermore, we introduce a distributed key generation mechanism to construct service keys. Based on service keys, a lightweight message authentication algorithm is designed to ensure the confidentiality of service-related information at the device side, while minimizing resource consumption to the greatest extent. A detailed security analysis demonstrates that the proposed scheme satisfies the critical security properties of unforgeability, confidentiality, unlinkability, and anonymity. In addition, performance evaluation results show that the proposed scheme achieves superior performance compared with existing solutions in terms of computational overhead, communication cost, and the efficiency of blockchain query operations.
With the rapid development of blockchain applications, light clients have become essential components in digital wallets and cross-chain communication due to their minimal storage and computational overhead. However, existing light client protocols face significant limitations in terms of storage and communication costs, security, and compatibility across different consensus mechanisms. We propose DecXClient, a general and secure light client protocol compatible with multiple consensus models. DecXClient introduces a dynamic validator set election mechanism based on chain quality attributes, eliminating reliance on trusted third parties. By integrating weighted multi-signature schemes, it enables a concise and efficient proof generation paradigm that enhances anti-fraud resilience while reducing resource consumption. Without depending on centralized relays, DecXClient maintains sublinear communication and storage complexity, effectively mitigating Eclipse attacks and other security threats. Experimental evaluations using real blockchain network environment demonstrate that the protocol produces state proofs as small as 1248 bytes—significantly outperforming existing schemes. The average proof generation latency ranges from 266.4 milliseconds to 2.5 seconds, with negligible verification time. These results validate the feasibility and practicality of DecXClient, offering a robust solution for lightweight blockchain access across diverse application scenarios.