Deterministic rendezvous scheme in multichannel access networks
Electronics Letters2010Vol. 46(20), pp. 1402–1404
Citations Over TimeTop 10% of 2010 papers
Abstract
In multichannel access networks, nodes must establish a link on a channel before data transmission begins. To find such a channel, either a centralised or a distributed approach may be employed. Presented is a distributed channel rendezvous scheme. The scheme determines the order, in which two nodes visit available channels to rendezvous within 2N+1 slots, where N is the number of channels and a slot is the minimum interval required to establish a link between any pair of nodes that are in a common channel. More notably, the scheme can be implemented without slot synchronisation which is hard to accomplish in a distributed manner.
Related Papers
- → Channel-Hopping Sequence and Rendezvous MAC for Cognitive Radio Networks(2022)9 cited
- → Channel Hopping Sequences for Rendezvous Establishment in Cognitive Radio Sensor Networks(2014)4 cited
- → A Rendezvous Scheme for Self-Organizing Cognitive Radio Sensor Networks(2014)8 cited
- → Deterministic approach to rendezvous channel setup in cognitive radio networks(2013)2 cited