Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks
Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for users in CRNs to search for neighbors via rendezvous process and thereby establish the communication links to exchange the information necess...
Saved in:
Published in | IEEE transactions on parallel and distributed systems Vol. 23; no. 10; pp. 1867 - 1881 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
IEEE
01.10.2012
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for users in CRNs to search for neighbors via rendezvous process and thereby establish the communication links to exchange the information necessary for spectrum management and channel contention, etc. This paper focuses on the design of algorithms for blind rendezvous, i.e., rendezvous without using any centralized controller and common control channel (CCC). We propose a jump-stay channel-hopping (CH) algorithm for blind rendezvous. The basic idea is to generate CH sequence in rounds and each round consists of a jump-pattern and a stay-pattern. Users "jump" on available channels in the jump-pattern while "stay" on a specific channel in the stay-pattern. We prove that two users can achieve rendezvous in one of four possible pattern combinations: jump-stay, stay-jump, jump-jump, and stay-stay. Compared with the existing CH algorithms, our algorithm has the overall best performance in various scenarios and is applicable to rendezvous of multiuser and multihop scenarios. We derive upper bounds on the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithm for both 2-user and multiuser scenarios (shown in Table 1). Extensive simulations are conducted to evaluate the performance of our algorithm. |
---|---|
AbstractList | Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for users in CRNs to search for neighbors via rendezvous process and thereby establish the communication links to exchange the information necessary for spectrum management and channel contention, etc. This paper focuses on the design of algorithms for blind rendezvous, i.e., rendezvous without using any centralized controller and common control channel (CCC). We propose a jump-stay channel-hopping (CH) algorithm for blind rendezvous. The basic idea is to generate CH sequence in rounds and each round consists of a jump-pattern and a stay-pattern. Users "jump" on available channels in the jump-pattern while "stay" on a specific channel in the stay-pattern. We prove that two users can achieve rendezvous in one of four possible pattern combinations: jump-stay, stay-jump, jump-jump, and stay-stay. Compared with the existing CH algorithms, our algorithm has the overall best performance in various scenarios and is applicable to rendezvous of multiuser and multihop scenarios. We derive upper bounds on the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithm for both 2-user and multiuser scenarios (shown in Table 1). Extensive simulations are conducted to evaluate the performance of our algorithm. |
Author | Yiu-Wing Leung Zhiyong Lin Xiaowen Chu Hai Liu |
Author_xml | – sequence: 1 givenname: Hai surname: Liu fullname: Liu, Hai – sequence: 2 givenname: Zhiyong surname: Lin fullname: Lin, Zhiyong – sequence: 3 givenname: Xiaowen surname: Chu fullname: Chu, Xiaowen – sequence: 4 givenname: Yiu-Wing surname: Leung fullname: Leung, Yiu-Wing |
BookMark | eNo9j01PwkAURScGEwHduXPTH2Drm9eZ6TSuCOJXiBrAdTMtb7AKHTJTMPjrhWBc3bs4ubmnxzqNa4ixSw4J55DfzN7upgkCxwTxhHW5lDpGrtPOvoOQcY48P2O9ED4BuJAguuz2ebNax9PW7KIJNXP62bpNiAbLhfN1-7GKrPPR0C2auq23FE3MvHbRC7Xfzn-Fc3ZqzTLQxV_22fv9aDZ8jMevD0_DwTiuUMo25twKFMZKoMxiVgIYTCvCqpS6BJWrvBRagESrrJBWa0VW5qndnzVZVZZpn10fdyvvQvBki7WvV8bvCg7FQbw4iBcH8QJxj18d8ZqI_lHFMdNKpb9_MFWM |
CODEN | ITDSEO |
CitedBy_id | crossref_primary_10_1109_JIOT_2018_2872459 crossref_primary_10_1109_TVT_2017_2726352 crossref_primary_10_1109_TWC_2019_2942296 crossref_primary_10_1016_j_comnet_2022_109125 crossref_primary_10_1109_TCOMM_2019_2903112 crossref_primary_10_1016_j_jnca_2018_03_019 crossref_primary_10_1109_TPDS_2013_192 crossref_primary_10_1109_TCOMM_2022_3194983 crossref_primary_10_1109_ACCESS_2019_2904942 crossref_primary_10_1007_s11276_019_01998_5 crossref_primary_10_1109_TCOMM_2017_2653158 crossref_primary_10_1109_TMC_2020_2997077 crossref_primary_10_1109_TWC_2013_093013_121975 crossref_primary_10_1007_s12095_018_0295_4 crossref_primary_10_1016_j_comcom_2022_08_011 crossref_primary_10_1109_JIOT_2022_3230702 crossref_primary_10_1007_s12046_017_0738_1 crossref_primary_10_1109_TCCN_2023_3315456 crossref_primary_10_3390_s19071703 crossref_primary_10_1109_LCOMM_2021_3076394 crossref_primary_10_1016_j_jpdc_2016_02_001 crossref_primary_10_1109_LCOMM_2017_2680438 crossref_primary_10_1007_s11276_019_01944_5 crossref_primary_10_1109_LCOMM_2013_071013_131029 crossref_primary_10_3390_electronics12081811 crossref_primary_10_1109_TMC_2014_2312715 crossref_primary_10_1109_TWC_2015_2392121 crossref_primary_10_1109_TC_2013_77 crossref_primary_10_1109_TVT_2014_2325832 crossref_primary_10_1002_ett_3217 crossref_primary_10_1109_TVT_2015_2510359 crossref_primary_10_1109_ACCESS_2018_2799956 crossref_primary_10_3390_e25101473 crossref_primary_10_1007_s10623_016_0221_8 crossref_primary_10_3390_s18124360 crossref_primary_10_1016_j_comnet_2020_107681 crossref_primary_10_1007_s13369_022_06966_4 crossref_primary_10_1109_JSAC_2016_2615258 crossref_primary_10_1587_transcom_E97_B_1577 crossref_primary_10_1016_j_jnca_2020_102813 crossref_primary_10_1016_j_adhoc_2020_102261 crossref_primary_10_1109_TMC_2017_2703166 crossref_primary_10_1016_j_jnca_2018_03_032 crossref_primary_10_1016_j_jnca_2016_01_021 crossref_primary_10_1109_TCCN_2020_2966623 crossref_primary_10_1007_s11277_015_3143_2 crossref_primary_10_1186_s13638_015_0356_8 crossref_primary_10_1002_dac_3201 crossref_primary_10_1109_TCCN_2022_3153076 crossref_primary_10_1109_TVT_2018_2865817 crossref_primary_10_1109_TMC_2012_260 crossref_primary_10_1109_TVT_2019_2906455 crossref_primary_10_3390_s21092997 crossref_primary_10_1016_j_comcom_2015_09_003 crossref_primary_10_1016_j_jnca_2017_08_003 crossref_primary_10_1109_TWC_2017_2728659 crossref_primary_10_1109_LCOMM_2023_3344715 crossref_primary_10_1109_MWC_2017_1700046 crossref_primary_10_1109_TII_2017_2774240 crossref_primary_10_1109_TMC_2014_2366746 crossref_primary_10_1109_LWC_2018_2797904 crossref_primary_10_1109_TCCN_2017_2741469 crossref_primary_10_1109_TCCN_2018_2871208 crossref_primary_10_1007_s11277_017_4208_1 crossref_primary_10_1109_TMC_2013_2297313 crossref_primary_10_1109_TVT_2015_2490722 crossref_primary_10_1109_TCOMM_2015_2508803 crossref_primary_10_1016_j_compeleceng_2023_108690 |
Cites_doi | 10.1109/LCOMM.2010.091010.100904 10.1109/INFCOM.2011.5935066 10.1109/JSAC.2008.080103 10.1016/j.phycom.2010.12.004 10.1145/1023720.1023742 10.1109/SURV.2009.090109 10.1109/DYSPAN.2005.1542680 10.1109/JSAC.2008.080110 10.1145/1614320.1614324 10.1109/TMC.2010.60 10.1016/j.comnet.2007.11.013 10.1109/MILCOM.2008.4753398 10.1016/j.adhoc.2009.10.004 10.1109/SAHCN.2009.5168974 10.1016/j.comnet.2006.05.001 10.4304/jcm.1.1.38-47 10.1109/DYSPAN.2008.52 10.1049/el.2010.1990 10.1109/MCOM.2009.4752688 10.1109/WOWMOM.2005.36 10.1109/DYSPAN.2008.78 |
ContentType | Journal Article |
DBID | 97E RIA RIE AAYXX CITATION |
DOI | 10.1109/TPDS.2012.22 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library Online CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library Online url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science |
EISSN | 1558-2183 |
EndPage | 1881 |
ExternalDocumentID | 10_1109_TPDS_2012_22 6127866 |
Genre | orig-research |
GroupedDBID | --Z -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AASAJ AAYOK ABFSI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIC RIE RIG RNI RNS RZB TN5 TWZ UHB VH1 XFK AAYXX CITATION |
ID | FETCH-LOGICAL-c255t-11f424af50e7f27b00a23ce2cb58b06969b484052f6f45f886ef593f219a7cbb3 |
IEDL.DBID | RIE |
ISSN | 1045-9219 |
IngestDate | Fri Aug 23 00:58:39 EDT 2024 Wed Jun 26 19:28:29 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 10 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c255t-11f424af50e7f27b00a23ce2cb58b06969b484052f6f45f886ef593f219a7cbb3 |
PageCount | 15 |
ParticipantIDs | ieee_primary_6127866 crossref_primary_10_1109_TPDS_2012_22 |
PublicationCentury | 2000 |
PublicationDate | 2012-10-01 |
PublicationDateYYYYMMDD | 2012-10-01 |
PublicationDate_xml | – month: 10 year: 2012 text: 2012-10-01 day: 01 |
PublicationDecade | 2010 |
PublicationTitle | IEEE transactions on parallel and distributed systems |
PublicationTitleAbbrev | TPDS |
PublicationYear | 2012 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
References | bibttd20121018675 bibttd20121018674 bibttd20121018673 bibttd20121018672 bibttd20121018671 lin (bibttd201210186719) 0 bibttd201210186721 bibttd201210186710 zhao (bibttd201210186716) 2005 bibttd201210186722 bibttd201210186711 bibttd20121018679 bibttd20121018678 bibttd201210186718 arachchige (bibttd201210186720) 2008 bibttd201210186717 bahl (bibttd20121018677) 2004 bibttd201210186714 bibttd201210186715 bibttd201210186712 bibttd201210186723 ma (bibttd20121018676) 2005 bibttd201210186713 bibttd201210186724 |
References_xml | – ident: bibttd201210186711 doi: 10.1109/LCOMM.2010.091010.100904 – ident: bibttd201210186724 doi: 10.1109/INFCOM.2011.5935066 – ident: bibttd201210186721 doi: 10.1109/JSAC.2008.080103 – start-page: 259 year: 2005 ident: bibttd201210186716 article-title: Distributed Coordination in Dynamic Spectrum Allocation Networks publication-title: Proc IEEE Int'l Symp New Frontiers in Dynamic Spectrum Access Network (DySPAN '05) contributor: fullname: zhao – ident: bibttd201210186717 doi: 10.1016/j.phycom.2010.12.004 – start-page: 216 year: 2004 ident: bibttd20121018677 article-title: SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks publication-title: Proc ACM MobiCom '04 doi: 10.1145/1023720.1023742 contributor: fullname: bahl – ident: bibttd201210186722 doi: 10.1109/SURV.2009.090109 – ident: bibttd20121018673 doi: 10.1109/DYSPAN.2005.1542680 – ident: bibttd20121018675 doi: 10.1109/JSAC.2008.080110 – ident: bibttd20121018678 doi: 10.1145/1614320.1614324 – ident: bibttd201210186712 doi: 10.1109/TMC.2010.60 – ident: bibttd201210186718 doi: 10.1016/j.comnet.2007.11.013 – ident: bibttd201210186714 doi: 10.1109/MILCOM.2008.4753398 – ident: bibttd20121018679 doi: 10.1016/j.adhoc.2009.10.004 – ident: bibttd201210186715 doi: 10.1109/SAHCN.2009.5168974 – ident: bibttd20121018671 doi: 10.1016/j.comnet.2006.05.001 – ident: bibttd20121018674 doi: 10.4304/jcm.1.1.38-47 – ident: bibttd201210186710 doi: 10.1109/DYSPAN.2008.52 – start-page: 203 year: 2005 ident: bibttd20121018676 article-title: Dynamic Open Spectrum Sharing for Wireless Ad Hoc Networks publication-title: Proc IEEE Int'l Symp New Frontiers in Dynamic Spectrum Access Network (DySPAN '05) contributor: fullname: ma – ident: bibttd201210186713 doi: 10.1049/el.2010.1990 – year: 0 ident: bibttd201210186719 article-title: Ring-Walk Rendezvous Algorithms for Cognitive Radio Networks publication-title: Ad Hoc & Sensor Wireless Networks contributor: fullname: lin – ident: bibttd201210186723 doi: 10.1109/MCOM.2009.4752688 – ident: bibttd20121018672 doi: 10.1109/WOWMOM.2005.36 – start-page: 1 year: 2008 ident: bibttd201210186720 article-title: An Asynchronous Neighbor Discovery Algorithm for Cognitive Radio Networks publication-title: Proc IEEE Int'l Symp New Frontiers in Dynamic Spectrum Access Network (DySPAN '08) doi: 10.1109/DYSPAN.2008.78 contributor: fullname: arachchige |
SSID | ssj0014504 |
Score | 2.4500968 |
Snippet | Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for... |
SourceID | crossref ieee |
SourceType | Aggregation Database Publisher |
StartPage | 1867 |
SubjectTerms | Algorithm design and analysis blind rendezvous channel hopping Clocks Cognitive radio Indexes Numerical models Synchronization |
Title | Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks |
URI | https://ieeexplore.ieee.org/document/6127866 |
Volume | 23 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fT8IwEL4AT_ogChrxV_qgbw62bt3W-ERQQkggBiHhbWm7VonKDAwT-ettt0HQ-ODb0qxNc9fLfdd-dwdwbdgUynaUZUthimoTajHMYitQhMbMkVIQkyg8GPq9idefkmkJbre5MFLKjHwmm-Yze8uPE7EyV2Ut7Y2D0PfLUA5tnOdqbV8MPJK1CtTRBbGoNsMtyZ22xo_3T4bEhZsY_3A_O_1UMnfSrcJgs5GcRfLaXKW8Kda_ajT-d6eHcFDgStTOD8IRlOS8BtVNzwZUmHAN9ncKENbhrq-1aWnA-YVG5i58_Zmslqj99pwsZunLO9KIFnU2BCM0YvEsQcOcOL48hkn3YdzpWUU7BUvouCG1HEd52GOK2DJQOND2xrArJBachNz2qU-5p8M9gpWvPKLC0JdaYa7SwmSB4Nw9gco8mctTQBpDKUpsxUTgeLHLQ6wos129GhfCEUEDbjZSjj7yqhlRFm3YNDLaiIw2IowbUDey2_5TiO3s7-Fz2DPzcirdBVTSxUpeakiQ8qvsLHwDMo60SA |
link.rule.ids | 315,786,790,802,27957,27958,55109 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDLYGHIADjw3EmxzgRrc2bdpGnNBgGo9NaGzSblWSJoCAFbEOif16knatBuLALYqiKLJj-XPy2QY4MWwKZTvKsqUwRbUJtRhmsRUoQmPmSCmISRTudP32wLsZkmEFzspcGCllRj6TdTPM_vLjREzMU1lDe-Mg9P0FWNJ-3qZ5tlb5Z-CRrFmgji-IRbUhljR32ujfXz4YGheuY_zDAc11VMkcSmsdOsVRch7JS32S8rqY_qrS-N-zbsDaDFmii_wqbEJFjqqwXnRtQDMjrsLqXAnCGpzfaH1aGnJ-oZ55DZ9-JpMxunh9TD6e06c3pDEtahYUI9Rj8XOCujl1fLwFg9ZVv9m2Zg0VLKEjh9RyHOVhjyliy0DhQFscw66QWHASctunPuWeDvgIVr7yiApDX2qVuUoLkwWCc3cbFkfJSO4A0ihKUWIrJgLHi10eYkWZ7erduBCOCHbhtJBy9J7XzYiyeMOmkdFGZLQRYbwLNSO7cs1MbHt_Tx_DcrvfuYvurru3-7Bi9siJdQewmH5M5KEGCCk_yu7FN-b2t54 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Jump-Stay+Rendezvous+Algorithm+for+Cognitive+Radio+Networks&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Liu%2C+Hai&rft.au=Lin%2C+Zhiyong&rft.au=Chu%2C+Xiaowen&rft.au=Leung%2C+Yiu-Wing&rft.date=2012-10-01&rft.issn=1045-9219&rft.volume=23&rft.issue=10&rft.spage=1867&rft.epage=1881&rft_id=info:doi/10.1109%2FTPDS.2012.22&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TPDS_2012_22 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon |