IP Library › Granted Patent US 12,568,357
Granted Patent B2
US 12,568,357 · App. 18/396,784 · Granted Mar 3, 2026

Chirp-based over-the-air computation for privacy-preserving distributed localization

Inventors: Safi Shams M Hoque (Columbia, SC); Alphan Sahin (Columbia, SC)
Assignee: UNIVERSITY OF SOUTH CAROLINA
H04W12/02H04W84/18
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,568,357
App. No.
18/396,784
Granted
Mar 3, 2026
Kind
B2
Abstract

The disclosure deals with method and system for an over-the-air computation (OAC) approach for privacy-preserving localization in a sensor network. The disclosed approach relies on a voting-based distributed localization and the computation of the majority votes (MVs) with OAC. In this method, the anchor node (AN)'s votes encoding the potential location of a server node (SN) are mapped to a circularly-shifted chirp (CSC) signal and all AN simultaneously transmit their CSC signals. The aggregated signal is received at the SN and the MV votes are detected non-coherently without requiring an ideal time-synchronization or channel state information (CSI). We further disclose an iterative refinement procedure to increase the localization performance. The CSCs result in spectral-efficient and power-efficient transmission, while disclosed iterative refinements and repetitions decrease the gap between the root-mean-square error (RMSE) and the quantization bound.

Claims (40)

1 . An over-the-air computation methodology for privacy-preserving localization in a sensor network without using channel state information (CSI) at a plurality of anchor nodes (ANs) or at a server node (SN), comprising:

providing an over-the-air computation network with superposed update vectors received at a server node (SN) as transmitted from a plurality of anchor nodes (ANs), wherein the superposed update vectors comprise the superposed local vectors of votes;

providing one or more processors; and

providing one or more non-transitory computer-readable media that store instructions that, when executed by the one or more processors, cause the one or more processors to perform operations, the operations comprising:

transmitting local vectors as anchor node (AN) votes, encoding the potential location of the server node (SN), from each respective anchor node of the plurality of anchor nodes (ANs),

receiving the superposed update vector at the server node (SN), and

determining the majority vote (MV) for each element of the superposed update vector at the server node (SN) by aggregating the local vectors through superposition at the SN for computing the MV votes using non-coherent energy detection, wherein the MV votes are detected non-coherently without requiring an ideal time-synchronization or channel state information (CSI),

wherein the transmitted local vectors comprise respective baseband circularly-shifted chirp (CSC) signals, the respective circularly-shifted chirp (CSC) signals being synthesized at the respective anchor nodes (ANs) through a discrete Fourier transform (DFT)-spread orthogonal frequency division multiplexing (OFDM) transmitter using frequency-domain spectral shaping (FDSS), each transmitted simultaneously from all of the anchor nodes (ANs).

2 . The over-the-air computation methodology according to claim 1 , wherein the operations further comprise using non-coherent energy detection for voting-based distributed localization determination.

3 . The over-the-air computation methodology according to claim 2 , the operations further comprising:

providing a distributed learning application; and

inputting the majority votes (MVs) into the distributed learning application for updating the application.

4 . The over-the-air computation methodology according to claim 3 , wherein the distributed learning application comprises federated edge learning (FEEL).

5 . The over-the-air computation methodology according to claim 1 , wherein the sensor network comprises a wireless sensor network (WSN) comprising a portion of an Internet-of-Things (IoT) network.

6 . The over-the-air computation methodology according to claim 1 , wherein the operations further comprise refining the anchor node (AN) votes using multiple transmit iterations.

7 . The over-the-air computation methodology according to claim 1 , wherein the SN is mobile and the operations further comprise using multiple transmit iterations and multiple transmit repetitions to enhance localization resolution and increase detection probability.

8 . The over-the-air computation methodology according to claim 1 , wherein the server node and each anchor node (AN) are respectively equipped with a single antenna.

9 . The over-the-air computation methodology according to claim 1 , wherein the operations further comprise that each anchor node (AN) is aware of its location through use of a Global Positioning System (GPS) or through having a fixed location configuration.

10 . The over-the-air computation methodology according to claim 9 , wherein the operations further comprise that each anchor node (AN) can respectively measure its distance from the SN.

11 . The over-the-air computation methodology according to claim 10 , wherein the operations further comprise that the anchor nodes (ANs) respectively measure distance from the SN by using methodology based on one of (1) received signal strength indicator (RSSI), (2) time of arrival (ToA), or (3) time difference of arrival (TDoA).

12 . An over-the-air computation system for privacy-preserving localization in a sensor network without using channel state information (CSI) at a plurality of anchor nodes (ANs) or at a server node (SN), comprising:

an over-the-air computation network to process superposed update vectors received at a server node (SN) as transmitted from a plurality of anchor nodes (ANs), wherein the superposed update vectors comprise the superposed local vectors of votes;

one or more processors; and

one or more non-transitory computer-readable media that store instructions that, when executed by the one or more processors, cause the one or more processors to perform operations, the operations comprising:

transmitting local vectors as votes, encoding the potential location of the server node (SN), from each respective anchor node of the plurality of anchor nodes (ANs),

receiving the superposed update vector at the server node (SN), and

determining the majority vote (MV) for each element of the superposed update vector at the server node (SN) by aggregating the local vectors through superposition at the SN for computing the MV votes using non-coherent energy detection, wherein the MV votes are detected non-coherently without requiring an ideal time-synchronization or channel state information (CSI),

wherein the transmitted local vectors comprise respective baseband circularly-shifted chirp (CSC) signals, the respective circularly-shifted chirp (CSC) signals being synthesized at the respective ANs through a discrete Fourier transform (DFT)-spread orthogonal frequency division multiplexing (OFDM) transmitter using frequency-domain spectral shaping (FDSS), each transmitted simultaneously from all of the anchor nodes (ANs).

13 . The over-the-air computation system according to claim 12 , wherein the operations further comprise using non-coherent energy detection for voting-based distributed localization determination.

14 . The over-the-air computation system according to claim 13 , the operations further comprising:

providing a distributed learning application; and

inputting the majority votes (MVs) into the distributed learning application for updating the Model parameters.

15 . The over-the-air computation system according to claim 14 , wherein the distributed learning application comprises federated edge learning (FEEL).

16 . The over-the-air computation system according to claim 12 , wherein the sensor network comprises a wireless sensor network (WSN) comprising a portion of an Internet-of-Things (IoT) network.

17 . The over-the-air computation system according to claim 12 , wherein the operations further comprise refining the anchor node (AN) votes by using multiple transmit iterations.

18 . The over-the-air computation system according to claim 12 , wherein the SN is mobile and the operations further comprise using multiple transmit iterations and multiple transmit repetitions to enhance localization resolution and increase detection probability.

19 . The over-the-air computation system according to claim 12 , wherein the server node and each anchor node (AN) are respectively equipped with a single antenna.

20 . The over-the-air computation system according to claim 12 , wherein the operations further comprise that each anchor node (AN) is aware of its location through use of a Global Positioning System (GPS) or through having a fixed location configuration.

21 . The over-the-air computation system according to claim 20 , wherein the operations further comprise that each anchor node (AN) can respectively measure its distance from the SN.

22 . The over-the-air computation system according to claim 21 , wherein the operations further comprise that the anchor nodes (ANs) respectively measure distance from the SN by using methodology based on one of (1) received signal strength indicator (RSSI), (2) time of arrival (ToA), or (3) time difference of arrival (TDoA).

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 27, 2023
From: HOQUE, SAFI SHAMS M; SAHIN, ALPHAN
To: UNIVERSITY OF SOUTH CAROLINA
Reel/Frame 065958/0267 →
Continuity (3)
Provisional Application 63594597 · Oct 31, 2023
Provisional Application 63437774 · Jan 9, 2023
Related Publication 20240236657A1 · Jul 11, 2024
References Cited (20)
US 11652679B2 · Sahin · 2023 [cited by examiner]
US 20140378164A1 · Holm · 2014 [cited by examiner]
US 20200271747A1 · Wu · 2020 [cited by examiner]
US 20220337972A1 · Karmanov · 2022 [cited by examiner]
US 20230214667A1 · Hoque · 2023 [cited by examiner]
US 20240020968A1 · Haskin · 2024 [cited by examiner]
WO WO2011056218A2 · 2011 [cited by examiner]
A Survey on Mobile Anchor Node Assisted Localization in Wireless Sensor Networks (Year: 2016). [cited by examiner]
Distributed Localization in Wireless Sensor Networks: A Quantitative Comparison (Year: 2003). [cited by examiner]
He et al. Abstract For “Range-free localization schemes for large scale sensor networks,” in Proc. ACM International Conference on Mobile Computing and Networking. New York, NY, USA: Association for Computing Machinery,… [cited by applicant]
Hellstrom et al. “Wireless for machine learning: A survey,” Foundations and Trends in Signal Processing, vol. 15, No. 4, pp. 290-399, 2022. [cited by applicant]
Hoque et al. “Chirp-based over-the-air computation for long-range federated edge learning,” in Proc. IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Sep. 2022, pp. 1-7. [cited by applicant]
Liu et al. “Attack-resistant location estimation in sensor networks,” in IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. IEEE, 2005, pp. 99-106. [cited by applicant]
Sahin et al. “Distributed learning over a wireless network with FSK-based majority vote,” in Proc. IEEE International Conference on Advanced Communication Technologies and Networking (CommNet), Dec. 2021, pp. 1-9. [cited by applicant]
Sahin et al. Abstract For “Over-the-air computation with DFT-spread OFDM for federated edge learning,” in Proc. IEEE Wireless Communications and Networking Conf. (WCNC), Apr. 2022, pp. 1-6. [cited by applicant]
Sahin et al. Abstract For “DFT-Spread-OFDM-based chirp transmission,” IEEE Communications Letters, vol. 25, No. 3, pp. 902-906, 2021. [cited by applicant]
Shi et al. Abstract For “Resilient privacy-preserving distributed localization against dishonest nodes in internet of things,” IEEE Internet of Things Journal, vol. 7, No. 9, pp. 9214-9223, 2020. [cited by applicant]
Shu et al. Abstract For “Multi-lateral privacy-preserving localization in pervasive environments,” in IEEE Infocom 2014-IEEE Conference on Computer Communications. IEEE, 2014, pp. 2319-2327. [cited by applicant]
Zhu et al. “One-bit over-the-air aggregation for communication-efficient federated edge learning: Design and convergence analysis,” IEEE Trans. Wireless Commun., vol. 20, No. 3, pp. 2120-2135, Nov. 2021. [cited by applicant]
Zhu et al. “Broadband analog aggregation for low-latency federated edge learning,” IEEE Trans. Wireless Commun., vol. 19, No. 1, pp. 491-506, Jan. 2020. [cited by applicant]