Compressed sensing algorithm for neighbour discovery in mobile ad hoc networks

Abstract

Considering the neighbour discovery problem in mobile ad hoc networks (MANETS) with omnidirectional antennas, all nodes want to discover the nodes within a single hop and obtain their identities. However, many existing algorithms spend an extra overhead for neighbour discovery and there is a need of response from neighbours. In this study, a slot allocation scheme is introduced for duplex communication, making all nodes recognisable to each other with a unique codeword. Then, a novel neighbour discovery algorithm based on compressed sensing to apply in this scheme is proposed; it enables all nodes to update neighbour information through the received signal after one or several frames and spends no extra overhead. Furthermore, many algorithms cannot be applied in the overload networks, but the algorithm proposed here is suited for overload networks; the upper bound for its active neighbours is limited to the performance of the network. Finally, the algorithm is validated through simulation and the effect of the three main factors on the performance of the algorithm is researched. The result implies that this algorithm can adapt to various scenarios of the MANETS.