Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach
Information Theory
2007-07-13 v1 math.IT
Abstract
We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequency-flat Gaussian channel, where nodes associate their identities to nonorthogonal signatures, transmitted at random times, synchronously, and independently. A number of neighbor-discovery algorithms, based on different optimization criteria, are introduced and analyzed. Numerical results show how reduced-complexity algorithms can achieve a satisfactory performance.
Cite
@article{arxiv.0704.3241,
title = {Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach},
author = {Daniele Angelosante and Ezio Biglieri and Marco Lops},
journal= {arXiv preprint arXiv:0704.3241},
year = {2007}
}