MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
SIAM Journal on Control and Optimization
Neighbor discovery in wireless networks and the coupon collector's problem
Proceedings of the 15th annual international conference on Mobile computing and networking
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A brief overview of ad hoc networks: challenges and directions
IEEE Communications Magazine - Part Anniversary
Evaluation and design of beaconing in mobile wireless networks
Ad Hoc Networks
| Hi-index | 0.00 |
Fast and efficient neighbor discovery is crucial to the deployment of wireless ad hoc networks. Conventional random access neighbor discovery schemes assume a collision model for the medium access control layer and require each neighbor to transmit its identity repeatedly with random delay to resolve collision. This paper proposes a compressed neighbor discovery scheme which jointly detect all neighbors simultaneously by allowing them to simultaneously report their identity using structured signaling. The compressed neighbor discovery scheme consists of non-coherent (energy) detection followed by a simple, efficient algorithm based on group testing, which is easy to implement in wireless terminals. The performance of the scheme is characterized for networks of any given size, assuming that transmissions are subject to Rayleigh fading. The compressed neighbor discovery scheme is shown to achieve faster and more reliable neighbor discovery than existing random access schemes. For example, in a wireless ad hoc network of ten thousand nodes, where each nodes has on average six neighbors, the compressed neighbor discovery scheme is 40% faster.