skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on June 27, 2026

Title: Low-Latency Preamble-Free Transmission of Short Messages via Quickest Change Detection
The latency and control overhead of sending the preamble in synchronous communications can be excessive when transmitting short sensing/control messages. To reduce these overheads, this work proposes a preamble-free solution based on the framework of quickest change detection. Specific contributions include a joint decoding/demodulation scheme that is provably asymptotically optimal, and a more practical CuSum-like implementation. Numerical results show that the proposed scheme reduces the latency by 47%–79% when compared to the preamble-based solutions. The scheme is also inherently robust and automatically adapts to any unknown underlying SNRs.  more » « less
Award ID(s):
2309887
PAR ID:
10618854
Author(s) / Creator(s):
;
Publisher / Repository:
IEEE
Date Published:
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We study multi-base station (BS) preamble detection schemes for the narrow-band Internet of Things (NB-IoT) random access by using stochastic geometry analysis. Specifically, we compare the preamble detection performance of two baseline detection schemes: Quantize-and-Forward (QnF) and Detect-and-Forward (DnF). QnF requires the feedback of quantized received power levels while DnF requires 1-bit feedback of local detection result. Our results show that DnF scheme outperforms QnF scheme when the backhaul capacity is limited or when the minimum distance between user and BSs is less than a threshold. Our results also show that the use of multiple collaborative BSs can lead to a significant improvement of the preamble detection performance, as well as reduction of the total power of the preamble transmission. 
    more » « less
  2. Network densification through the deployment of WiFi access points (APs) is a promising solution towards achieving high connectivity rates required for emerging applications. A critical first step is to discover an AP before an active association between the client and the AP can be established. Legacy AP discovery procedures initiated by the client result in high latency in the order of a few 100 ms and waste spectrum, especially when clients need to frequently switch between multiple APs. We propose CSIscan that exploits the broadcast nature of WiFi channels by embedding discovery related information within an AP’s ongoing regular transmissions. The AP does this by intelligently distorting the transmitted OFDM frame by inducing perturbations in the preamble, and these injected ‘bits’ of information are detected via changes in the perceived channel state information (CSI). A deep learning framework allocates the optimal level of distortion on a per-subcarrier basis that keeps the resulting packet error rate to less than 1%. Existing clients perceive no changes in their ongoing communication, while potential new clients quickly obtain discovery information at the same time. We experimentally demonstrate that CSIscan reduces the overall WiFi latency from 150 ms to 10 ms and improves spectrum utilization with ∼ 72% reduction in the probe traffic. We show that CSIscan delivers up to 40 discovery information bits in the outgoing WiFi packet in an indoor environment. 
    more » « less
  3. Abstract Non-volatile memories (NVMs) have the potential to reshape next-generation memory systems because of their promising properties of near-zero leakage power consumption, high density and non-volatility. However, NVMs also face critical security threats that exploit the non-volatile property. Compared to volatile memory, the capability of retaining data even after power down makes NVM more vulnerable. Existing solutions to address the security issues of NVMs are mainly based on Advanced Encryption Standard (AES), which incurs significant performance and power overhead. In this paper, we propose a lightweight memory encryption/decryption scheme by exploiting in-situ memory operations with negligible overhead. To validate the feasibility of the encryption/decryption scheme, device-level and array-level experiments are performed using ferroelectric field effect transistor (FeFET) as an example NVM without loss of generality. Besides, a comprehensive evaluation is performed on a 128 × 128 FeFET AND-type memory array in terms of area, latency, power and throughput. Compared with the AES-based scheme, our scheme shows ~22.6×/~14.1× increase in encryption/decryption throughput with negligible power penalty. Furthermore, we evaluate the performance of our scheme over the AES-based scheme when deploying different neural network workloads. Our scheme yields significant latency reduction by 90% on average for encryption and decryption processes. 
    more » « less
  4. null (Ed.)
    File-sharing systems like Dropbox offer insufficient privacy because a compromised server can see the file contents in the clear. Although encryption can hide such contents from the servers, metadata leakage remains significant. The goal of our work is to develop a file-sharing system that hides metadata---including user identities and file access patterns. Metal is the first file-sharing system that hides such metadata from malicious users and that has a latency of only a few seconds. The core of Metal consists of a new two-server multi-user oblivious RAM (ORAM) scheme, which is secure against malicious users, a metadata-hiding access control protocol, and a capability sharing protocol. Compared with the state-of-the-art malicious-user file-sharing scheme PIR-MCORAM (Maffei et al.'17), which does not hide user identities, Metal hides the user identities and is 500x faster (in terms of amortized latency) or 10^5x faster (in terms of worst-case latency). 
    more » « less
  5. Cellular network control procedures (e.g., mobility, idle-active transition to conserve energy) directly influence data plane behavior, impacting user-experienced delay. Recognizing this control-data plane interdependence, L25GC re-architects the 5G Core (5GC) network, and its processing, to reduce latency of control plane operations and their impact on the data plane. Exploiting shared memory, L25GC eliminates message serialization and HTTP processing overheads, while being 3GPP-standards compliant. We improve data plane processing by factoring the functions to avoid control-data plane interference, and using scalable, flow-level packet classifiers for forwarding-rule lookups. Utilizing buffers at the 5GC, L25GC implements paging, and an intelligent handover scheme avoiding 3GPP's hairpin routing, and data loss caused by limited buffering at 5G base stations, reduces delay and unnecessary message processing. L25GC's integrated failure resiliency transparently recovers from failures of 5GC software network functions and hardware much faster than 3GPP's reattach recovery procedure. L25GC is built based on free5GC, an open-source kernel-based 5GC implementation. L25GC reduces event completion time by ~50% for several control plane events and improves data packet latency (due to improved control plane communication) by ~2×, during paging and handover events, compared to free5GC. L25GC's design is general, although current implementation supports a limited number of user sessions. 
    more » « less