DocumentCode
463827
Title
A Simple Algorithm for Neighbor Discovery in Wireless Networks
Author
Angelosante, Daniele ; Biglieri, Ezio ; Lops, Marco
Author_Institution
DEAIMI, Cassino Univ., Italy
Volume
3
fYear
2007
fDate
15-20 April 2007
Abstract
We consider the neighbor-discovery problem in a fixed wireless network where each node is identified by its signature, and the signatures are chosen so as to limit collisions. Limited-complexity constraints lead to a simple algorithm based on incoherent detection of nodes. The performance of this algorithm is evaluated by computing the probability of a false alarm and of a missed detection of a single node.
Keywords
computational complexity; radio networks; limited-complexity constraints; missed detection; neighbor discovery; wireless networks; Change detection algorithms; Clustering algorithms; Intelligent networks; Neodymium; Network topology; Receiving antennas; Routing; Signal to noise ratio; Surfaces; Wireless networks; Wireless networks; neighbor discovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on
Conference_Location
Honolulu, HI
ISSN
1520-6149
Print_ISBN
1-4244-0727-3
Type
conf
DOI
10.1109/ICASSP.2007.366499
Filename
4217673
Link To Document