Using Locality-sensitive Hashing for Rendezvous Search

TL;DR

This paper introduces LSH-based algorithms for the multichannel rendezvous problem in IoT, leveraging channel set similarity to improve expected time-to-rendezvous over random methods.

Contribution

It proposes novel LSH-inspired channel hopping algorithms that exploit channel set similarity, enhancing rendezvous efficiency in both synchronous and asynchronous settings.

Findings

Algorithms outperform random in ETTR

Expected rendezvous time inversely related to Jaccard index

Dimensionality reduction accelerates asynchronous rendezvous

Abstract

The multichannel rendezvous problem is a fundamental problem for neighbor discovery in many IoT applications. The existing works in the literature focus mostly on improving the worst-case performance, and the average-case performance is often not as good as that of the random algorithm. As IoT devices (users) are close to each other, their available channel sets, though they might be different, are similar. Using the locality-sensitive hashing (LSH) technique in data mining, we propose channel hopping algorithms that exploit the similarity between the two available channel sets to increase the rendezvous probability. For the synchronous setting, our algorithms have the expected time-to-rendezvous (ETTR) inversely proportional to a well-known similarity measure called the Jaccard index. For the asynchronous setting, we use dimensionality reduction to speed up the rendezvous process. Our numerical results show that our algorithms can outperform the random algorithm in terms of ETTR.