We consider the problem of determining, in a distributed and scalable manner, which nodes are neighbors in a wireless sensor network. We consider an un-supervised network operating on a frequency-flat Gaussian multipleaccess channel, shared by K + 1 nodes, transmitting synchronously and independently a set of known signal waveforms. A number of ND algorithms, relying on different optimization criteria, are introduced. A thorough statistical analysis for the proposed ND algorithms is presented, and the results demonstrate that a number of reduced complexity receivers exist achieving satisfactory performances.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Neighbor discovery in wireless networks: A multiuser-detection approach |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
Abstract: | We consider the problem of determining, in a distributed and scalable manner, which nodes are neighbors in a wireless sensor network. We consider an un-supervised network operating on a frequency-flat Gaussian multipleaccess channel, shared by K + 1 nodes, transmitting synchronously and independently a set of known signal waveforms. A number of ND algorithms, relying on different optimization criteria, are introduced. A thorough statistical analysis for the proposed ND algorithms is presented, and the results demonstrate that a number of reduced complexity receivers exist achieving satisfactory performances. |
Handle: | http://hdl.handle.net/11580/16333 |
Appare nelle tipologie: | 1.1 Articolo in rivista |