Cognitive Neighbor Discovery With Directional Antennas in Self-Organizing IoT Networks

摘要

This article investigates the problem of synchronous randomized neighbor discovery with directional antennas. Due to the long tail effect, it will take long time to discover the last few neighbors, which increases overall neighbor discovery time. This effect is due to small proportion of remaining undiscovered neighbors. Moreover, improper choices of reception probabilities make the discovery even worse. In this article, a cognitive framework is proposed to minimize the expectation of neighbor discovery time. We present a scheme in which reception probabilities are dynamically adjusted. We consider an ideal scenario and a practical scenario. In an ideal scenario where perfect information about the number of neighbors is available, reception probabilities are adjusted according to the number of neighbors. A method of dynamic programming is used to recursively calculate the optimal reception probabilities. In an actual scenario where perfect information about number of neighbors is unavailable, a neighbor estimation method based on maximum-likelihood estimation is executed before probability adjustment. Simulation results show that when perfect information about neighbor is available and total transmission probability is within a proper range (between 0.1 and 0.2), the average neighbor discovery time can be significantly reduced (by 38% to 43%, respectively) compared with an existing probability-fixed scheme. With imperfect information, the scheme also works well and realizes appreciable reduction in average neighbor discovery time compared with existing self-adaptive schemes.