Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Computer Engineering
Guaranteed Rendezvous For Cognitive Radio Networks Based On Cycle Length, Li Gou
Guaranteed Rendezvous For Cognitive Radio Networks Based On Cycle Length, Li Gou
Dissertations, Master's Theses and Master's Reports
Rendezvous is a fundamental process establishing a communication link on common channel between a pair of nodes in the cognitive radio networks. How to reach rendezvous efficiently and effectively is still an open problem. In this work, we propose a guaranteed cycle lengths based rendezvous (CLR) algorithm for cognitive radio networks. When the cycle lengths of the two nodes are coprime, the rendezvous is guaranteed within one rendezvous period considering the time skew between the two nodes. When Ti and Tj are not coprime, i.e., Ti=Tj, the deadlock checking and node IDs are combined …