Computer Science – Information Theory
Scientific paper
2007-04-24
Computer Science
Information Theory
Scientific paper
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 $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.
Angelosante Daniele
Biglieri Ezio
Lops Marco
No associations
LandOfFree
Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-225869