Expected time to rendezvous in multi-hop cognitive radio networks
| dc.contributor.author | Ortiz Guerra, Erik | |
| dc.contributor.author | Suarez Mora, David | |
| dc.contributor.author | Lopez, Edgar Alexander | |
| dc.contributor.author | Alfonso Reguera, Vitalio | |
| dc.contributor.author | Blanco Garrido, Fabian | |
| dc.contributor.author | Cruz Flores, Liliana | |
| dc.contributor.department | Universidad Central "Marta Abreu" de Las Villas. Facultad de Ingeniería Eléctrica. Departamento de Electrónica y Telecomunicaciones | en_US |
| dc.contributor.department | Universidad Cooperativa de Colombia (UCC) | en_US |
| dc.coverage.spatial | Guatemala City, Guatemala | en_US |
| dc.date.accessioned | 2018-11-07T14:36:07Z | |
| dc.date.available | 2018-11-07T14:36:07Z | |
| dc.date.issued | 2017-11-08 | |
| dc.description.abstract | The design of blind rendezvous strategies for dy- namic spectrum access in multi-users, multi-hop networks is a challenging task. In this paper, a two radios synchronization strategy that minimizes the time to rendezvous in multi-users networks is analyze. In fact, it has been recently demonstrated that this synchronization strategy provides optimum results in terms of maximum time to rendezvous (MTTR). In this paper, the analysis to the expected time to rendezvous (ETTR) and derive analytical expressions for its numerical computation is extended. The estimated ETTR is compared with those obtained by simulation, using a representative blind rendezvous channel hopping sequence. The results indicate that the numerical ex- pressions provide good estimates of the actual ETTR. Moreover, the ETTR achieved by the proposed synchronization strategy has proven to be bounded by the MTTR of a pair-wise rendezvous process irrespective of the number of users and the network topology. This property makes the analyzed rendezvous mecha- nism, and particularly the synchronization strategy, suitable for the deployment of large and dense networks. | en_US |
| dc.identifier.citation | Citar según la fuente original: [1] B. F. Lo, I. F. Akyildiz and A. M. Al-Dhelaan. Efficient Recovery Control Channel Design in Cognitive Radio Ad Hoc Networks. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY , Vol. 59, Num. 9 (2010). [2] M. Timmers,S. Pollin, A. Dejonghe, L. Van der Perre and F. Catthoor. Distributed Multichannel MAC Protocol for Multihop Cognitive Radio Networks. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY ,Vol. 59, Num. 1 (2010) [3] Y. Baek, J. Yun, J. Kim, J. Li, W. Bekulu, J Kyu, S. Hwang and K. Han. Movable Rendezvous Channel Selection for Distributed Cognitive Radio Networks. Spring Congr. Eng. Technol .(May 2012) [4] Z. Htike, C. S. Hong, and S. Lee. The Life Cycle of the Rende zvous Problem of Cognitive Radio Ad Hoc Networks: A Survey. J. Comput. Sci. Eng .,Vol. 7, Num. 2 (Jun 2013) [5] H. Liu, Z. Lin, X. Chu and Y. Leung, Ring-Walk Based Channe l-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks. IEEE/ACM International Conference on Green Computing and Communications, 2010. [6] G.-Y. Chang, W.-H. Teng, H.-Y. Chen, and J.-P. Sheu, Nove l Channel-Hopping Schemes for Cognitive Radio Networks. IEEE Trans. Mob. Comput .Vol. 13, N ́um. 2, Feb 2012. [7] H. Liu, Z. Lin, X. Chu, and Y. W. Leung, Jump-stay rendezvous algorithm for cognitive radio networks. IEEE Trans. Parallel Distrib. Syst .,Vol. 23, Num. 10. 2012. [8] G.-Y. Chang and J.-F. Huang, A Fast Rendezvous Channel-Hopping Algorithm for Cognitive Radio Networks. IEEE Commun. Lett .,Vol. 17, Num. 7. Jul, 2013. [9] Guerra, E. O., V. A. Reguera, R. D. Souza, G. Brante, and E. M. G. Fernandez. Simple role-based rendezvous algorithm for cognitive ad hoc radio networks, Electronics Letters , 50, no. 3, 182-184, 2014. [10] V. A. Reguera, E. Ortiz, R. Demo, Evelio M. G. and G. Brante. Short Channel Hopping Sequence Approach to Rendezvous for Cognitive Networks. IEEE COMMUNICATIONS LETTERS , Vol. 18, Num. 2, 2014. [11] E. O. Guerra, V. A. Reguera, R. D. Souza, E. G. Fernndez, and M. E. Pellenz, Systematic construction of common channel hopping rendezvous strategies in cognitive radio networks, EURASIP Journal on Wireless Communications and Networking , 2015:134, 2015. [12] V. A. Reguera, E. Ortiz,C. M. Algora, A. Now ́e and K. Steenhaut. On the Upper Bound for the Time to Rendezvous in Multi-hop Cognitive Radio Networks, 21st IEEE International Workshop on Computer Aided Modelling and Design of Communication Links and Networks , Toronto, Canada, Oct 22-25, 2016 [13] L. Yu, H. Liu, Y.-W. Leung, X. Chu, and Z. Lin, Multiple radios for effective rendezvous in cognitive radio networks. IEEE International Conference on Communications (ICC) , 2013. [14] L. Yu, H. Liu, Y.-W. Leung, X. Chu, and Z. Lin. Multiple Radios for Fast Rendezvous in Cognitive Radio Networks. “IEEE Trans. Mob. Comput. 2014. | en_US |
| dc.identifier.isbn | 978-1-5386-2098-4 | en_US |
| dc.identifier.uri | https://dspace.uclv.edu.cu/handle/123456789/10213 | |
| dc.language.iso | en_US | en_US |
| dc.relation.conference | 9 th IEEE Latin-American Conference on Communications (LATINCOM 2017) | en_US |
| dc.rights | Este documento es Propiedad Patrimonial de IEEE Communications Society y se socializa en este Repositorio gracias a la política de acceso abierto del Congreso 9 th IEEE Latin-American Conference on Communications (LATINCOM 2017) | en_US |
| dc.rights.holder | IEEE Communications Society | en_US |
| dc.subject | Blind Rendezvous | en_US |
| dc.subject | Channel Hopping Sequences | en_US |
| dc.subject | Cognitive Radio Networks | en_US |
| dc.subject | Multi-Hop Networks | en_US |
| dc.title | Expected time to rendezvous in multi-hop cognitive radio networks | en_US |
| dc.type | Proceedings | en_US |