Fully Distributed Rendezvous Algorithm for Non-anonymous Users

Abstract

In Chap. 13, we present efficient distributed algorithms for both synchronous and asynchronous users that are non-anonymous. These algorithms utilize global information such as the number of the external ports N and the number of users M (or the maximum value for the users’ identifier (ID)). In practical large scale networks, it is difficult for the users to know these information beforehand. For example, in cognitive radio networks, no general standard exists dividing the total licensed spectrum into N channels, such as the IEEE 802.11 standard which only concerns frequencies ranging 470–710 MHz [1], and so it is impractical for the users to know the value of N. Moreover, all users are physically dispersed in the system and they may join or leave freely, and hence they cannot know the number of users in advance as there is no central controller. Therefore, it is desirable to design a fully distributed algorithm where only the users’ local information would be utilized. Actually, in a general distributed system, this kind of local information is limited to the user’s ID and the number of the user’s available ports since there exists no global labels for the ports. In Sect. 14.1, we present the first fully distributed algorithm called the Conversion Based Hopping (CBH) algorithm, which guarantees oblivious blind rendezvous in a short time. The correctness and complexity are analyzed in Sect. 14.2. We summarize the chapter in Sect. 14.3.