A Simple Algorithm for Neighbor Discovery in Wireless Networks
Daniele Angelosante, E. Biglieri, Marco Lops · 2007
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.