Wireless node identification: Fundamental limits and practical design
Dongning Guo (Northwestern)
A critical task in massive-access wireless networks is to quickly and reliably identify all transmitting nodes in a neighborhood. This is also known as neighbor discovery. We show that identification through a multi-access channel is in fact a compressed sensing problem by nature. We study the fundamental limits of node identification in the many-user information theory setting. We also describe practical designs for fast node identification with and without perfect synchronization.