Abstract
The neighbor discovery paradigm finds wide application in Internet of Things networks, where the number of active devices is orders of magnitude smaller than the total device population. Designing low-complexity schemes for asynchronous neighbor discovery has recently gained significant attention from the research community. Concurrently, a divide-and-conquer framework, referred to as coupled compressive sensing, has been introduced for the synchronous massive random access channel. This work adapts this novel algorithm to the problem of asynchronous neighbor discovery with unknown transmission delays. Simulation results suggest that the proposed scheme requires much fewer transmissions to achieve a performance level akin to that of state-of-the-art techniques.
Original language | English (US) |
---|---|
Title of host publication | 2019 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 - Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 4569-4573 |
Number of pages | 5 |
ISBN (Electronic) | 9781479981311 |
DOIs | |
State | Published - May 2019 |
Event | 44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 - Brighton, United Kingdom Duration: May 12 2019 → May 17 2019 |
Publication series
Name | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
---|---|
Volume | 2019-May |
ISSN (Print) | 1520-6149 |
Conference
Conference | 44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 |
---|---|
Country/Territory | United Kingdom |
City | Brighton |
Period | 5/12/19 → 5/17/19 |
Funding
This material is based upon work supported by the National Science Foundation (NSF) under Grant No. CCF-1619085.
Keywords
- Neighbor discovery
- asynchronous schemes.
- compressive sensing
- forward error correction
- random access
ASJC Scopus subject areas
- Software
- Signal Processing
- Electrical and Electronic Engineering