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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
