Multiple Prime Expansion Channel Hopping for Blind Rendezvous in a Wireless Sensor Network

A channel rendezvous is a significant aspect of communication. In this context, blind rendezvous is the process of selecting a common available channel and establishing a communication link for wireless devices in a wireless sensor network. The rendezvous of asymmetric and heterogeneous wireless devices is a challenge. Thus, to improve speeds and stability of rendezvous, we analyze time slot overlap and channel determinism in the rendezvous algorithm and propose a rendezvous algorithm named Multiple Prime Expansion (MPE). In a final simulation study, we compare the performance of the MPE with other existing algorithms in an asymmetric and heterogeneous scenario. Results show that MPE has excellent performance for the ATTR and MTTR.