skip to main content
10.1145/2641798.2641827acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

Deterministic distributed rendezvous algorithms for multi-radio cognitive radio networks

Published: 21 September 2014 Publication History

Abstract

Rendezvous is a fundamental process in constructing Cognitive Radio Networks (CRNs), through which the user can communicate with its neighbors by establishing a link on some licensed frequency band (channel). Most of the existing elegant rendezvous algorithms assume each user is equipped with a single radio. Nowadays the multi-radio cognitive radio architecture, where each user can access k ≥ 2 channels at the same time, has become a reality. In this paper, we study the rendezvous problem in multi-radio CRN to see whether and to what extent the multi-radio capability can improve the rendezvous performance. To begin with, we propose a family of deterministic distributed algorithms for two special situations when k=2 and k=O(√n), where n is the number of all channels. These algorithms show that the maximum time to rendezvous (MTTR) can be reduced (largely) in multi-radio CRN. Then we derive a lower bound of MTTR as Ω({|Vi||Vj|}/k2) for arbitrary k (Vi, Vj represents two users' available channel sets) and present a distributed algorithm to guarantee rendezvous in O({|Vi||Vj|}/k2) time slots, which meets the lower bound. Extensive simulations are conducted to corroborate our theoretical analyses.

References

[1]
M. Ahmadi, Y. Zhuang, and J. Pan. Distributed robust channel assignment for multi-radio cognitive radio networks. In Vehicular Technology Conference (VTC Fall), 2012 IEEE, pages 1--5. IEEE, 2012.
[2]
I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty. Next generation/dynamic spectrum access/cognitive radio wireless networks: a survey. Computer Networks, 50(13):2127--2159, 2006.
[3]
K. Bian and J.-M. Park. Maximizing rendezvous diversity in rendezvous protocols for decentralized cognitive radio networks. Mobile Computing, IEEE Transactions on, 12(7):1294--1307, 2013.
[4]
K. Bian, J.-M. Park, and R. Chen. A quorum-based framework for establishing control channels in dynamic spectrum access networks. In Proceedings of the 15th annual international conference on Mobile computing and networking, pages 25--36. ACM, 2009.
[5]
K. Bian, J.-M. Park, and R. Chen. Control channel establishment in cognitive radio networks using channel hopping. Selected Areas in Communications, IEEE Journal on, 29(4):689--703, 2011.
[6]
Z. Cai, S. Ji, J. He, and A. G. Bourgeois. Optimal distributed data collection for asynchronous cognitive radio networks. In Distributed Computing Systems (ICDCS), pages 245--254. IEEE, 2012.
[7]
S. Chen, A. Russell, A. Samanta, and R. Sundaram. Deterministic blind rendezvous in cognitive radio networks. arXiv preprint arXiv:1401.7313, 2014.
[8]
I. Chuang, H.-Y. Wu, K.-R. Lee, and Y.-H. Kuo. Alternate hop-and-wait channel rendezvous method for cognitive radio networks. In INFOCOM, 2013 Proceedings IEEE, pages 746--754. IEEE, 2013.
[9]
L. A. DaSilva and I. Guerreiro. Sequence-based rendezvous for dynamic spectrum access. In New Frontiers in Dynamic Spectrum Access Networks. 3rd IEEE Symposium on, pages 1--7. IEEE, 2008.
[10]
R. Draves, J. Padhye, and B. Zill. Routing in multi-radio, multi-hop wireless mesh networks. In Proceedings of the 10th annual international conference on Mobile computing and networking, pages 114--128. ACM, 2004.
[11]
A. G. Fragkiadakis, E. Z. Tragos, and I. G. Askoxylakis. A survey on security threats and detection techniques in cognitive radio networks. Communications Surveys & Tutorials, IEEE, 15(1):428--445, 2013.
[12]
Z. Gu, Q.-S. Hua, and W. Dai. Local sequence based rendezvous algorithms for cognitive radio networks. In Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pages 371--379. IEEE, 2014.
[13]
Z. Gu, Q.-S. Hua, Y. Wang, and F. Lau. Nearly optimal asynchronous blind rendezvous algorithm for cognitive radio networks. In Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pages 371--379. IEEE, 2013.
[14]
X. Huang, D. Lu, P. Li, and Y. Fang. Coolest path: spectrum mobility aware routing metrics in cognitive ad hoc networks. In Distributed Computing Systems (ICDCS), 2011 31st International Conference on, pages 182--191. IEEE, 2011.
[15]
S. Ji, R. Beyah, and Z. Cai. Minimum-latency broadcast scheduling for cognitive radio networks. In Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pages 389--397. IEEE, 2013.
[16]
W. Kim, A. J. Kassler, M. Di Felice, and M. Gerla. Urban-x: towards distributed channel assignment in cognitive multi-radio mesh networks. In Wireless Days (WD), 2010 IFIP, pages 1--5. IEEE, 2010.
[17]
Y. R. Kondareddy, P. Agrawal, and K. Sivalingam. Cognitive radio network setup without a common control channel. In Military Communications Conference, 2008. MILCOM 2008. IEEE, pages 1--6. IEEE, 2008.
[18]
Z. Lin, H. Liu, X. Chu, and Y. Leung. Enhanced jump-stay rendezvous algorithm for cognitive radio networks. 2013.
[19]
H. Liu, Z. Lin, X. Chu, and Y.-W. Leung. Jump-stay rendezvous algorithm for cognitive radio networks. Parallel and Distributed Systems, IEEE Transactions on, 23(10):1867--1881, 2012.
[20]
R. Paul, Y. Z. Jembre, and Y.-J. Choi. Multi-interface rendezvous in self-organizing cognitive radio networks. In Dynamic Spectrum Access Networks (DYSPAN), 2014 IEEE International Symposium on, pages 531--540. IEEE, 2014.
[21]
J. Pérez-Romero, O. Salient, R. Agustí, and L. Giupponi. A novel on-demand cognitive pilot channel enabling dynamic spectrum allocation. In New Frontiers in Dynamic Spectrum Access Networks. 2nd IEEE International Symposium on, pages 46--54. IEEE, 2007.
[22]
K. Ramachandran, I. Sheriff, E. M. Belding, and K. C. Almeroth. A multi-radio 802.11 mesh network architecture. Mobile Networks and Applications, 13(1-2):132--146, 2008.
[23]
J. Shin, D. Yang, and C. Kim. A channel rendezvous scheme for cognitive radio networks. Communications Letters, IEEE, 14(10):954--956, 2010.
[24]
Y. Song, J. Xie, and X. Wang. A novel unified analytical model for broadcast protocols in multi-hop cognitive radio ad hoc networks. 2013.
[25]
L. Yu, H. Liu, Y.-W. Leung, X. Chu, and Z. Lin. Multiple radios for effective rendezvous in cognitive radio networks. In Communications (ICC), 2013 IEEE International Conference on, pages 2857--2862. IEEE, 2013.

Cited By

View all
  • (2024)A composite channel hopping algorithm for blind rendezvous in heterogeneous cognitive radio networksTelecommunication Systems10.1007/s11235-024-01123-886:3(417-432)Online publication date: 20-Mar-2024
  • (2022)Channel hopping for blind rendezvous in cognitive radio networksComputer Communications10.1016/j.comcom.2022.08.011195:C(82-98)Online publication date: 1-Nov-2022
  • (2022)An Optimal Asymmetric Synchronous Blind Rendezvous Algorithm in Cognitive Radio Networks for Internet of ThingsArabian Journal for Science and Engineering10.1007/s13369-022-06966-448:2(1595-1607)Online publication date: 10-Jun-2022
  • Show More Cited By

Index Terms

  1. Deterministic distributed rendezvous algorithms for multi-radio cognitive radio networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      MSWiM '14: Proceedings of the 17th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
      September 2014
      352 pages
      ISBN:9781450330305
      DOI:10.1145/2641798
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 21 September 2014

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. distributed algorithms
      2. rendezvous
      3. wireless network

      Qualifiers

      • Research-article

      Funding Sources

      Conference

      MSWiM'14
      Sponsor:

      Acceptance Rates

      MSWiM '14 Paper Acceptance Rate 32 of 128 submissions, 25%;
      Overall Acceptance Rate 398 of 1,577 submissions, 25%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)10
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 13 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)A composite channel hopping algorithm for blind rendezvous in heterogeneous cognitive radio networksTelecommunication Systems10.1007/s11235-024-01123-886:3(417-432)Online publication date: 20-Mar-2024
      • (2022)Channel hopping for blind rendezvous in cognitive radio networksComputer Communications10.1016/j.comcom.2022.08.011195:C(82-98)Online publication date: 1-Nov-2022
      • (2022)An Optimal Asymmetric Synchronous Blind Rendezvous Algorithm in Cognitive Radio Networks for Internet of ThingsArabian Journal for Science and Engineering10.1007/s13369-022-06966-448:2(1595-1607)Online publication date: 10-Jun-2022
      • (2021)On Heterogeneous Sensing Capability for Distributed Rendezvous in Cognitive Radio NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2020.299707720:11(3211-3226)Online publication date: 1-Nov-2021
      • (2019)A Novel Multi-Radio Rendezvous Scheme for Cognitive Radio Networks2019 12th IFIP Wireless and Mobile Networking Conference (WMNC)10.23919/WMNC.2019.8881570(154-161)Online publication date: Sep-2019
      • (2019)Difference-Set-Based Channel Hopping for Minimum-Delay Blind Rendezvous in Multi-Radio Cognitive Radio NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2019.290645568:5(4918-4932)Online publication date: May-2019
      • (2019)A Homogeneous Multi-Radio Rendezvous Algorithm for Cognitive Radio NetworksIEEE Communications Letters10.1109/LCOMM.2019.290345823:4(736-739)Online publication date: Apr-2019
      • (2019)Efficient Channel Hopping for Blind Rendezvous in Multi-Radio Cognitive Radio Networks2019 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOBECOM38437.2019.9014326(1-6)Online publication date: Dec-2019
      • (2019)Online Popularity Prediction of Video Segments: Towards More Efficient Content Delivery Networks2019 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOBECOM38437.2019.9013162(1-6)Online publication date: Dec-2019
      • (2019)Multi‐radio channel rendezvous in cognitive radio networksIET Communications10.1049/iet-com.2018.595613:10(1433-1442)Online publication date: Jun-2019
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media