Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach

Simple item page
dc.creatorAngelosante, Daniele
dc.creatorBiglieri, Ezio
dc.creatorLops, Marco
dc.date2007-04-24
dc.date.accessioned2026-07-07T08:15:58Z
dc.date.available2026-07-07T08:15:58Z
dc.descriptionWe 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 $K+1$ 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.
dc.identifierhttps://arxiv.org/abs/0704.3241
dc.identifierhttp://arxiv.org/abs/0704.3241
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133627
dc.subjectInformation Theory
dc.titleNeighbor Discovery in Wireless Networks:A Multiuser-Detection Approach
dc.typetext

Files

Collections

arXiv