Neighbor Discovery for Wireless Networks

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.

[1]  A. Gualtierotti.  H. L. Van Trees, Detection, Estimation, and Modulation Theory, , 1976 .

[2]  Bernard Fino,et al.  Multiuser detection: , 1999, Ann. des Télécommunications.

[3]  Peter Grant,et al.  Digital Communications (3rd edition) , 2009 .

[4]  Anthony Ephremides,et al.  An asynchronous neighbor discovery algorithm for wireless sensor networks , 2007, Ad Hoc Networks.

[5]  H. V. Trees.  Detection, Estimation, And Modulation Theory , 2001 .

[6]  Frank R. Kschischang,et al.  A factor graph approach to link loss monitoring in wireless sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[7]  Donald F. Towsley,et al.  On neighbor discovery in wireless networks with directional antennas , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Xiaodong Wang,et al.  Multiuser detection for cooperative networks and performance analysis , 2005, IEEE Transactions on Signal Processing.

[9]  M. Melamed.  Detection , 2021, SETI: Astronomy as a Contact Sport.

[10]  John G. Proakis,et al.  Digital Communications , 1983 .

[11]  F. Martinerie,et al.  Data fusion and tracking using HMMs in a distributed sensor network , 1997, IEEE Transactions on Aerospace and Electronic Systems.