Asynchronous and noncoherent neighbor discovery for the IoT using sparse-graph codes
Lists
Only you see this
Abstract
In this paper, we design a fast and efficient energy-based and asynchronous neighbor discovery protocol for the Internet of Things (IoT). In our solution, we relax the assumption of frame-level synchronization. We formulate a novel asynchronous group testing scheme and apply it to the neighbor discovery problem. We then show that our proposed scheme is able to detect the set of K active neighbors <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> among a network of n nodes with codeword length and decoding complexity of Θ(K log (K) log (n)). Finally, we provide extensive simulation results to verify our theoretical guarantees.
BibTeX
@inproceedings{chandrasekher2017asynchronous,
author = {Kabir Chandrasekher and Kangwook Lee and Peter Kairouz and Ramtin Pedarsani and Kannan Ramchandran},
title = {{Asynchronous and noncoherent neighbor discovery for the IoT using sparse-graph codes}},
booktitle = {ICC},
year = {2017},
doi = {10.1109/icc.2017.7996746},
}Loading related content...