An investigation on blind rendezvous algorithms

Network terminals with channel switching capability, before beginning communication, need to complete Rendezvous process. In this process, they meet one another in a commonly-available-channel at the same time to coordinate their channel switching mechanism. In this paper several algorithms applicable to a subclass of rendezvous challenge, namely blind rendezvous, under symmetric and asymmetric system models are simulated and their performance is evaluated. A new role-based method is proposed and through simulations its efficiency is demonstrated in comparison with other mechanisms.