International Journal of Digital Communication and Analog Signals
Synchronized and Asynchronized Comparative Analysis Channel-Hopping-Based Communication Rendezvous In Cognitive Radio Networks
Abstract
Rendezvous is an essential operation for a cognitive users to establish communication links in cognitive radio networks (CRNs). To ensure the rendezvous in limited time, every single existing rendezvous algorithms create CH (channel-hoping) successions utilizing the entire channel set and endeavor meet on each of the channels (i.e., both accessible channels and unavailable channels). We will present ETCH, productive channel-hopping-based communication rendezvous protocols for CR systems. ETCH protocols incorporate SYNC-ETCH and ASYNC-ETCH. SYNC-ETCH, which expect worldwide clock synchronization, effectively use all the rendezvous in building up control channels constantly. ASYNC-ETCH have the capacity to make a couple of nodes rendezvous without being synchronized. Utilizing a mix of hypothetical investigation and simulations, we will demonstrate that correlation in the middle of SYNC and ASYNC for communication rendezvous in CR networks Keywords: Channel hopping, endezvous, random access protocolReferences (13)
- Xiao Y., Hu F. Cognitive Radio Networks. CRC Press, 2008.
- Alpern S., Gal S. The Theory of Search Game and Rendezvous. Springer. 2003.
- Arachchige J.L., Venkatesan S., Mittal N. An asynchronous neighbor discovery algorithm for cognitive radio networks. Proceedings of IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks. 2008; 1–5p.
- Theis N.C., Thomas R.W., DaSilva L.A. Rendezvous for cognitive radios. IEEE Transactions on Mobile Computing. 2011; 10(2): 216–27p.
- Kondareddy Y., Agrawal P., Sivalingam K. Cognitive radio network setup without a common control channel. Proceedings of IEEE Interna-tional Conference on Military Communications. pp. 1-6, 2008.
- Fette B. Cognitive radio technology. Academic Press. 2006
- Horine and D. Turgut, Link Rendezvous Protocol for Cognitive Radio Networks, Proceedings of IEEE International Symposium on New Fron¬tiers in Dynamic Spectrum Access Networks, pp. 444-447, 2007.
- Horine, Turgut D. Performance analysis of link rendezvous protocol for cognitive radio networks. Proceedings of Second IEEE International Conference on Cognitive Radio Oriented Wireless Networks and Communications. 2007; 503–7p.
- Balachandran K., Kang J.H. Neighbor discovery with dynamic spectrum access in adhoc networks. Proceedings of IEEE Conference on Vehicular Technology. 2006; 2: 512–7p.
- Theis N.C. The Modular Clock Algorithm for Blind Rendezvous. AFIT/GCS. 2009.
- Lin Z., Liu H., Chu X. et al. Jump-Stay Based Channel-hopping Algorithm with Guaranteed Rendezvous for Cognitive Radio Networks. IEEE International Conference on Computer Communications. 2011; 2444–52p.
- DaSilva L., Guerreiro I. Sequence-based rendezvous for dynamic spectrum access. Proceedings of IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks. 2008; 1–7p.
- Pu, Wyglinski A., McLernon M. A frequency rendezvous approach for decentralized dynamic spectrum access networks. In CROWNCOM 09. 2009; 1–6p.