Significant Overhead Research Articles

DONGLE 2.0: Direct FPGA-Orchestrated NVMe Storage for HLS

Rapid growth in data size poses significant computational and memory challenges to data processing. FPGA accelerators and near-storage processing have emerged as compelling solutions for tackling the growing computational and memory requirements. Many FPGA-based accelerators have shown to be effective in processing large data sets by leveraging the storage capability of either host-attached or FPGA-attached storage devices. However, the current HLS development environment does not allow direct access to host-or FPGA-attached NVMe storage from the HLS code. As such, users must frequently hand off between HLS and host code to access data in storage, and such a process requires tedious programming to ensure functional correctness. Moreover, since the HLS code uses radically different methods to access storage compared to DRAM, the HLS codebase targeting DRAM-based platforms cannot be easily ported to NVMe-based platforms, resulting in limited code portability and reusability. Furthermore, frequent suspension of HLS kernel and synchronization between CPU and FPGA introduce significant latency overhead and require sophisticated scheduling mechanisms to hide latency. To address these challenges, we propose a new HLS storage interface named DONGLE 2.0 that enables direct FPGA-orchestrated NVMe storage access. By providing a unified interface for storage and memory access, DONGLE 2.0 allows a single-source HLS program to target multiple memory/storage devices, thus making the codebase cleaner, portable, and more efficient. DONGLE 2.0 is an extension to DONGLE 1.0 [ 1 ] but adds support for host-attached storage. While its primary focus is still on FPGA NVMe access in near-storage configurations, the added host storage support ensures its compatibility with platforms that lack native support for FPGA-attached NVMe storage. We implemented a prototype of DONGLE 2.0 using an AMD/Xilinx Alveo U200 FPGA and Solidigm DC-P4610 SSD. Our evaluation on various workloads showed a geometric mean speed-up of 2.3× and a reduction in lines of code (LoC) by 2.4× compared to the state-of-the-art commercial platform when using FPGA-attached NVMe storage. Moreover, DONGLE 2.0 demonstrated a geometric mean speed-up of 1.5× and a reduction in LoC by 2.4× compared to the state-of-the-art commercial platform when using host-attached NVMe storage.

Advancing IoT security with flame: A hybrid approach combining fuzzy logic and artificial lizard search optimization

The increasing usage of Internet of Things (IoT) devices has created a need for secure and efficient solutions to protect sensitive data from unauthorized access. However, the complicated and massive structure of IoT systems poses various security risks and challenges, especially in dynamic scenarios with high signaling overhead caused by subscriber mobility. So, in this paper, a Fuzzy-based Lightweight Authentication and Management of Encryption approach called ‘FLAME’ is proposed to solve the decentralized lightweight group key management problem by measuring the degree of security using fuzzy logic (FL) based on various factors like device and user behavior, network conditions, and resource availability. For effective key-based authentication, adopted an Artificial Lizard Search Optimization (ALSO) based RSA (Rivest, Shamir, Adleman) algorithm that generates private and public keys based on security evaluation outcome. The publishers and subscribers obtain encryption keys from the group key manager based on their security level, and dissemination is optimized by the ALSO algorithm. By leveraging the FL and ALSO based RSA algorithm, the system offers secure communication with limited utilization and protects confidential data in IoT environments. According to the analysis, results signify that the FLAME approach has a faster key generation, dissemination, and revocation time compared to existing approaches, along with reduced overhead during key management operations, and increased attack detection capacity of 98.7 %.

An edge-assisted group authentication scheme for the narrowband internet of things

As an emerging wireless communication technology, narrowband Internet of Things is widely used in various scenarios, but it also brings new security problems, especially the group authentication between terminal devices and servers. In narrowband Internet of Things, terminal devices are often deployed in unattended environments, which are vulnerable to various attacks and controlled by adversaries, resulting in identity information leakage. Secondly, a large number of terminal devices send authentication request information to the server at the same time, which is easy to cause network signaling congestion, and the centralized calculation mode of the server will cause a large delay in the authentication process. To solve these problems, we propose an edge-assisted group authentication scheme for narrowband Internet of Things. Firstly, a lightweight encryption algorithm LCHAOSAES was used to encrypt the terminal device identity to prevent the terminal device identity information leakage. Then, the edge computing method was used to add an edge network layer to the NB-IoT system architecture to assist in completing the group authentication of massive terminal devices, and the edge assistance could realize decentralization and reduce the load of centralized processing of the server. The Burrows Abadi Needham logic verification, informal security analysis and performance analysis show that the proposed scheme is robust under malicious attacks such as replay attack, man-in-the-middle attack and insider attack, and has less signaling overhead and delay.

Grant-Free Random Access Enhanced by Massive MIMO and Non-Orthogonal Preambles

Massive multiple input multiple output (MIMO) enabled grant-free random access (mGFRA) stands out as a promising random access (RA) solution, thus effectively addressing the need for massive access in massive machine-type communications (mMTCs) while ensuring high spectral efficiency and minimizing signaling overhead. However, the bottleneck of mGFRA is mainly dominated by the orthogonal preamble collisions, since the orthogonal preamble pool is small and of a fixed-sized. In this paper, we explore the potential of non-orthogonal preambles to overcome limitations and enhance the success probability of mGFRA without extending the length of the preamble. Given the RA procedure of mGFRA, we analyze the factors influencing the success rate of mGFRA with non-orthogonal preamble and propose to use two types of sequences, namely Gold sequence and Gaussian distribution sequence, as the preambles for mGFRA. Simulation results demonstrate the effectiveness of these two types pf non-orthogonal preambles in improving the success probability of mGFRA. Moreover, the system parameters’ impact on the performance of mGFRA with non-orthogonal preambles is examined and deliberated.

Modeling of double ground fault modes in power supply systems of non-traction consumers of railway transport

THE PURPOSE. Development of digital models to determine the modes of double ground faults in 6-10 kV overhead signaling lines supplying signaling, centralization and automatic blocking facilities.METHODS. To create the models, methods of multiphase modeling of electric power systems were used, based on the use of lattice equivalent circuits from RLCelements connected according to complete graph circuits. For modeling, the industrial software package Fazonord, developed at the Irkutsk State Transport University, was used.RESULTS. The developed models provide correct accounting of all factors influencing the modes of double ground faults, including increased electromagnetic influences of the traction network. In contrast to known approaches, the dynamics of changes in these influences caused by variations in traction loads during train movement are modeled.CONCLUSION. The proposed approach to modeling double ground fault modes is universal and can be used for standard traction power supply systems, as well as promising high-voltage traction networks. The results obtained can be used in practice to configure relay protection devices for overhead signaling lines in order to reliably detect double ground fault modes and take measures to eliminate them. In addition, the modeling methodology presented in the article can be used when selecting measures to improve the reliability of power supply to signaling and automatic blocking facilities that ensure the safety of train traffic, as well as to develop methods and algorithms for determining distances to places of double ground faults in overhead power lines feeding signaling facilities , centralization and autoblocking. The presented results confirmed the effectiveness of the proposed approach for modeling double ground fault modes.

An IOV Spectrum Sharing Approach based on Multi-Agent Deep Reinforcement Learning

Highly dynamic Internet of Vehicles spectrum sharing can share spectrum owned by vehicle-to-infrastructure links through multiple workshop links to achieve efficient resource allocation. Aiming at the problem that the rapid variations in channel states in highly dynamic vehicular environments can make it challenging for base stations to gather and manage information about instantaneous channel states, we present a multi-agent deep reinforcement learning-based V2X spectrum access algorithm. The algorithm is designed to optimize the throughput of V2I user under V2V user delay and reliability constraints, and uses the experience gained from interacting with the communication environment to update the Q network to improve spectrum and power allocation strategies. Implicit collaborative agents are trained through an improved DQN model combined with dueling network architecture and long short-term memory network layers and public rewards. With lagged Q-learning and concurrent experience replay trajectories, the training process was stabilized and the non-stationarity problem caused by concurrent learning of multiple agents was resolved. Simulation results demonstrate that our presented algorithm achieves a mean successful payload delivery rate of 95.89%, which is 16.48% greater than that of the randomized baseline algorithm. Our algorithm obtains approximately the optimal value and shows performance close to the centralized brute force algorithm, which provides a better strategy for further minimizing the signaling overhead of the Internet of Vehicles communication system.

Analysis of micro- vs. macro-flows management in QKD-secured edge computing

Quantum Key Distribution (QKD) holds the promise of a secure exchange of cryptographic material between applications that have access to the same network of QKD nodes, interconnected through fiber optic or satellite links. Worldwide several such networks are being deployed at a metropolitan level, where edge computing is already offered by the telco operators to customers as a viable alternative to both cloud and on-premise hosting of computational resources. In this paper, we investigate the implications of enabling QKD for edge-native applications from a practical perspective of resource allocation in the QKD network and the edge infrastructure. Specifically, we consider the dichotomy between aggregating all the applications on the same source–destination path vs. adopting a more flexible micro-flow approach, inspired from Software Defined Networking (SDN) concepts. Our simulation results show that there is a fundamental trade-off between the efficient use of resources and the signaling overhead, which we managed to diminish with the use of suitable hybrid solutions.

Beam pointing optimization for spatial diversity MIMO free space optical communications

In this paper, we propose a beam pointing algorithm to find optimal beam coordinates maximizing link performance in multiple-input multiple-output (MIMO) free space optical communications (FSOC) with spatial diversity. We first derive the received signal-to-noise ratio (SNR) with spatial diversity and analyze the convexity condition of SNR function with respect to transmit beam coordinates. Then, we obtain the beam coordinates maximizing the received SNR through an alternating optimization (AO) algorithm and Newton’s method. However, the proposed algorithm requires instantaneous channel state information (CSI), which requires a high signaling overhead in MIMO FSOC. Thus, instead of exploiting instantaneous CSI, we utilize statistical CSI and propose a robust beam pointing algorithm with respect to atmospheric turbulence and pointing error. Numerical results show that our proposed algorithm outperforms conventional schemes in a dynamic FSOC network. Furthermore, we confirm that the optimal coordinates which are robust to the channel conditions approach to the centroid of receiver lenses as the strength of turbulence and pointing error increases.

Instantaneous received signal strength-based sensor activation for energy-efficient distributed cooperative sensor networks

In this paper, a network-independent distributed relay sensor (RS) activating method is proposed for energy-efficient cooperative communications using RSs. To achieve this, we introduce a novel metric termed the signal contribution-to-noise contribution ratio and design the required instantaneous received signal strength at RS for each RS to independently determine the activation. Therefore, the proposed RS activation (i.e., adaptive cooperation) is readily enabled without significant signaling overhead in the networks. The numerical results indicated that the proposed RS activation strategy can improve the received signal-to-noise ratio at a destination sensor with fewer active RSs, extending the lifetime of the sensor network.

An LSTM-based hybrid proximal policy optimization spectrum access algorithm in vehicular network

PurposeIn order to meet the different quality of service (QoS) requirements of vehicle-to-infrastructure (V2I) and multiple vehicle-to-vehicle (V2V) links in vehicle networks, an efficient V2V spectrum access mechanism is proposed in this paper.Design/methodology/approachA long-short-term-memory-based multi-agent hybrid proximal policy optimization (LSTM-H-PPO) algorithm is proposed, through which the distributed spectrum access and continuous power control of V2V link are realized.FindingsSimulation results show that compared with the baseline algorithm, the proposed algorithm has significant advantages in terms of total system capacity, payload delivery success rate of V2V link and convergence speed.Originality/valueThe LSTM layer uses the time sequence information to estimate the accurate system state, which ensures the choice of V2V spectrum access based on local observation effective. The hybrid PPO framework shares training parameters among agents which speeds up the entire training process. The proposed algorithm adopts the mode of centralized training and distributed execution, so that the agent can achieve the optimal spectrum access based on local observation information with less signaling overhead.

A Multi-Agent Reinforcement Learning-Based Grant-Free Random Access Protocol for mMTC Massive MIMO Networks

The expected huge number of connected devices in Internet of Things (IoT) applications characterizes the massive machine-type communication (mMTC) scenario, one prominent use case of beyond fifth-generation (B5G) systems. To meet mMTC connectivity requirements, grant-free (GF) random access (RA) protocols are seen as a promising solution due to the small amount of data that MTC devices usually transmit. In this paper, we propose a GF RA protocol based on a multi-agent reinforcement learning approach, applied to aid IoT devices in selecting the least congested RA pilots. The rewards obtained by the devices in collision cases resemble the congestion level of the chosen pilot. To enable the operation of the proposed method in a realistic B5G network scenario and aiming to reduce signaling overheads and centralized processing, the rewards in our proposed method are computed by the devices taking advantage of a large number of base station antennas. Numerical results demonstrate the superior performance of the proposed method in terms of latency, network throughput, and per-device throughput compared with other protocols.

A Blockchain-Assisted Security Protocol for Group Handover of MTC Devices in 5G Wireless Networks.

In the realm of the fifth-generation (5G) wireless cellular networks, renowned for their dense connectivity, there lies a substantial facilitation of a myriad of Internet of Things (IoT) applications, which can be supported by the massive machine-type communication (MTC) technique, a fundamental communication framework. In some scenarios, a large number of machine-type communication devices (MTCD) may simultaneously enter the communication coverage of a target base station. However, the current handover mechanism specified by the 3rd Generation Partnership Project (3GPP) Release 16 incurs high signaling overhead within the access and core networks, which may have negative impacts on network efficiency. Additionally, other existing solutions are vulnerable to malicious attacks such as Denial of Service (DoS), Distributed Denial of Service (DDoS) attacks, and the failure of Key Forward Secrecy (KFS). To address this challenge, this paper proposes an efficient and secure handover authentication protocol for a group of MTCDs supported by blockchain technology. This protocol leverages the decentralized nature of blockchain technology and combines it with certificateless aggregate signatures to mutually authenticate the identity of a base station and a group of MTCDs. This approach can reduce signaling overhead and avoid key escrow while significantly lowering the risk associated with single points of failure. Additionally, the protocol protects device anonymity by encrypting device identities with temporary anonymous identity markers with the Elliptic Curve Diffie-Hellman (ECDH) to abandon serial numbers to prevent linkage attacks. The resilience of the proposed protocol against predominant malicious attacks has been rigorously validated through the application of the BAN logic and Scyther tool, underscoring its robust security attributes. Furthermore, compared to the existing solutions, the proposed protocol significantly reduces the authentication cost for a group of MTCDs during handover, while ensuring security, demonstrating commendable efficiency.

Codebook-Based Solutions for Reconfigurable Intelligent Surfaces and Their Open Challenges

Reconfigurable intelligent surfaces (RIS) is a revolutionary technology to cost-effectively improve the performance of wireless networks. We first review the existing framework of channel estimation and passive beamforming (CE & PBF) in RISassisted communication systems. To reduce the excessive pilot signaling overhead and implementation complexity of the CE & PBF framework, we conceive a codebook-based framework to strike flexible tradeoffs between communication performance and signaling overhead. Moreover, we provide useful insights into the codebook design and learning mechanisms of the RIS reflection pattern. Finally, we analyze the scalability of the proposed framework by flexibly adapting the training overhead to the specified quality-of-service requirements and then elaborate on its appealing advantages over the existing CE & PBF approaches. It is shown that our novel codebook-based framework can be beneficially applied to all RIS-assisted scenarios and avoids the curse of model dependency faced by its existing counterparts, thus constituting a competitive solution for practical RIS-assisted communication systems.

An efficient authentication protocol with privacy-preserving for virtual power plant

As an important manifestation of the current development and transformation of the world’s power and energy industries, the virtual power plant is an important foundation for optimizing the layout of energy resources. However, since there are many open channels in the virtual power plant, adversaries can implement eavesdropping, replay, impersonation, forgery, and other attacks to access the virtual power plant, and even publish false data in the virtual power plant to disrupt the operation of the virtual power plant. In addition, it is easy for an adversary to deduce key information such as the layout of virtual power plant equipment through the identity of the device. In this context, to ensure the security and privacy of devices when accessing the platform, in this paper, we propose an efficient authentication protocol based on the elliptic curve cryptography and zero-knowledge proof, which requires only two information exchanges. Security analysis shows that the proposed protocol can meet security features such as mutual authentication, key agreement, perfect forward secrecy, and device anonymity. Performance analysis indicates that the proposed protocol achieves a reasonable balance between computational and signaling overhead, and it is more suitable for achieving efficient device authentication and privacy protection in virtual power plants.

Box2Poly: Memory-Efficient Polygon Prediction of Arbitrarily Shaped and Rotated Text

Recently, Transformer-based text detection techniques have sought to predict polygons by encoding the coordinates of individual boundary vertices using distinct query features. However, this approach incurs a significant memory overhead and struggles to effectively capture the intricate relationships between vertices belonging to the same instance. Consequently, irregular text layouts often lead to the prediction of outlined vertices, diminishing the quality of results. To address these challenges, we present an innovative approach rooted in Sparse R-CNN: a cascade decoding pipeline for polygon prediction. Our method ensures precision by iteratively refining polygon predictions, considering both the scale and location of preceding results. Leveraging this stabilized regression pipeline, even employing just a single feature vector to guide polygon instance regression yields promising detection results. Simultaneously, the leverage of instance-level feature proposal substantially enhances memory efficiency ( > 50% less vs. the SOTA method DPText-DETR) and reduces inference speed (> 40% less vs. DPText-DETR) with comparable performance on benchmarks. The code is available at https://github.com/Albertchen98/Box2Poly.git.

Access authentication via blockchain in space information network.

Space Information Network (SIN) has significant benefits of providing communication anywhere at any time. This feature offers an innovative way for conventional wireless customers to access enhanced internet services by using SIN. However, SIN's characteristics, such as naked links and maximum signal latency, make it difficult to design efficient security and routing protocols, etc. Similarly, existing SIN authentication techniques can't satisfy all of the essentials for secure communication, such as privacy leaks or rising authentication latency. The article aims to develop a novel blockchain-based access authentication mechanism for SIN. The proposed scheme uses a blockchain application, which has offered anonymity to mobile users while considering the satellites' limited processing capacity. The proposed scheme uses a blockchain application, which offers anonymity to mobile users while considering the satellites' limited processing capacity. The SIN gains the likelihood of far greater computational capacity devices as technology evolves. Since authenticating in SIN, the technique comprises three entities: low Earth orbit, mobile user, and network control centre. The proposed mutual authentication mechanism avoids the requirement of a ground station, resulting in less latency and overhead during mobile user authentication. Finally, the new blockchain-based authentication approach is being evaluated with AVISPA, a formal security tool. The simulation and performance study results illustrate that the proposed technique delivers efficient security characteristics such as low authentication latency, minimal signal overhead and less computational cost with group authentication.

FCSN: Global Context Aware Segmentation by Learning the Fourier Coefficients of Objects in Medical Images.

The encoder-decoder model is a commonly used Deep learning (DL) model for medical image segmentation. Encoder-decoder models make pixel-wise predictions that focus heavily on local patterns. As a result, the predicted mask often fails to preserve the object's shape and topology, which requires an understanding of the image's global context. In this work, we propose a Fourier Coefficient Segmentation Network (FCSN)---a novel global context-aware DL model that segments an object by learning the complex Fourier Coefficients of the object's masks. The Fourier coefficients are calculated by integrating over the mask's contour. Hence, FCSN is naturally motivated to incorporate a broader image context when estimating the coefficients. The global context awareness of FCSN helps produce more accurate segmentation and is more robust to local perturbations, such as additive noise or motion blur. We compare FCSN on other state-of-the-art global context-aware models (UNet++, DeepLabV3+, UNETR) on 5 medical image segmentation tasks (ISIC_2018, RIM_CUP, RIM_DISC, PROSTATE, FETAL). When compared with UNETR, FCSN attains significantly lower Hausdorff scores with 19.14 (6%), 17.42 (6%), 9.16 (14%), 11.18 (22%), and 5.98 (6%) for ISIC_2018, RIM_CUP, RIM_DISC, PROSTATE, and FETAL tasks respectively. Moreover, FCSN is lightweight by discarding the decoder module. FCSN only requires 29.7 M parameters which are 75.6 M and 9.9 M fewer than UNETR and DeepLabV3+, respectively. FCSN attains inference/training speeds of 1.6 ms/img and 6.3 ms/img, which is 8 and 3 faster than UNet and UNETR. Our work is available at https://github.com/nus-morninlab/FCSN.

Hybrid FSO/RF Communications in Space–Air–Ground Integrated Networks: A Reduced Overhead Link Selection Policy

Space–air–ground integrated network (SAGIN) is considered an enabler for sixth-generation (6G) networks. By integrating terrestrial and non-terrestrial (satellite, aerial) networks, SAGIN seems to be a quite promising solution to provide reliable connectivity everywhere and all the time. Its availability can be further enhanced if hybrid free space optical (FSO)/radio frequency (RF) links are adopted. In this paper, the performance of a hybrid FSO/RF communication system operating in SAGIN has been analytically evaluated. In the considered system, a high-altitude platform station (HAPS) is used to forward the satellite signal to the ground station. Moreover, the FSO channel model assumed takes into account the turbulence, pointing errors, and path losses, while for the RF links, a relatively new composite fading model has been considered. In this context, a new link selection scheme has been proposed that is designed to reduced the signaling overhead required for the switching operations between the RF and FSO links. The analytical framework that has been developed is based on the Markov chain theory. Capitalizing on this framework, the performance of the system has been investigated using the criteria of outage probability and the average number of link estimations. The numerical results presented reveal that the new selection scheme offers a good compromise between performance and complexity.

Provably secured and lightweight authenticated encryption protocol in machine-to-machine communication in industry 4.0

Industry 4.0 and the industrial Internet of Things (IIoT) aim to create a platform for data-driven decision-making through machine-to-machine (M2M) communication, often facilitated by the 6LoWPAN standard. However, as a resource-constrained device, 6LoWPAN raises security and privacy concerns for M2M communications, necessitating efficient and lightweight authentication and key establishment (AKE) protocols. Existing AKE protocols relying on asymmetric and symmetric cryptographic keys are susceptible to attacks and entail significant storage, communication, and computation overheads. This study examines a scheme called SLAP to uncover vulnerabilities and challenges in AKE-based M2M deployments in IIoT, including traceability, denial of service (DoS), perfect forward secrecy (PFS), and ephemeral secret leakage (ESL) attacks. Therefore, a privacy-preserving, secure, and lightweight authenticated encryption protocol called provably secure, lightweight, authenticated encryption (PSLAE) is proposed to address these issues. This approach includes hash operations, XOR operations, and authenticated encryption primitives for lightweight and secure mechanisms. It uses a one-time alias identity and fresh parameters to ensure privacy and protection against traceability and DoS, PFS, and ESL attacks. PSLAE undergoes rigorous informal and formal verification through SVO logic and Scyther, demonstrating resilience against the extended Canetti–Krawczyk and Dolev–Yao threat models. Moreover, it provides a lightweight, secure, efficient, and reduced storage, communication, and computation overhead compared with related works for AKE-based M2M in IIoT.

Energy-efficient routing, power control and energy clustering for energy harvesting-enabled spectrum sharing IoT sensor networks

We investigate a spectrum sharing system that enables energy harvesting from distributed multi-antenna energy transmitter devices for primary dual-band device-to-device networks and secondary dual-band wireless sensor networks (WSNs), incorporating a multi-stage rectenna energy harvesting circuit model. We formulate a new multi-hop routing problem for network energy efficiency maximization of this system, which involves the interconnected tasks of WSN routing, controlling the transmit power of sensor nodes, and energy transmitter clustering, taking into account interference, power budget and rate constraints. To tackle these interconnected tasks effectively, we propose an integrated solution that includes both centralized and distributed routing schemes. Furthermore, the solution incorporates energy transmitter clustering schemes based on harvested power and channel gain. We provide an analysis of the computation complexity and signaling overhead for the proposed solution. Our simulation results demonstrate that the proposed routing and clustering schemes outperform their respective benchmark schemes, achieving significant performance gains.