A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks
In cognitive radio network, two or more nodes need to establish a link on an available channel when they want to transmit a data. Rendezvous is a process that nodes explore the available channels to establish a link when a pair of nodes wants to communicate with each other. The method of finding a c...
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Junhyung Kim Yongmi Baek Jeongbae Yun Kenchul Cho Kyuchang Lee Jihun Han Suk-Gyu Lee Kijun Han |
| description | In cognitive radio network, two or more nodes need to establish a link on an available channel when they want to transmit a data. Rendezvous is a process that nodes explore the available channels to establish a link when a pair of nodes wants to communicate with each other. The method of finding a common channel is a challenging problem. To use of a dedicated control channel can be a solution to find the common channel but it may result in a bottleneck and create a single point of failure. In this letter, we present a rendezvous sequence scheme to find a common channel. The proposed scheme guarantees the successful rendezvous within the bounded time. |
| doi_str_mv | 10.1109/SCET.2012.6342033 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6342033</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6342033</ieee_id><sourcerecordid>6342033</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-16aa79ca9cd9fce7e03aca4d3b097ff8faeebeec10cf0657f86f03d72ac4d1003</originalsourceid><addsrcrecordid>eNo1j1FLwzAUhSMiqLM_QHzJH2i9adqmeRxlbsJQsH0fd8mNRl1T227ifr0F53k5nO_AgcPYrYBECND3dbVokhREmhQyS0HKM3YtslwpoYtMn7NIq_I_5_KSRcPwDpNKUUpIr9hqzl-oIxzJ8mUf9h2v6WtPraGJt5aOh7AfeG3eaEfchZ5X4bX1oz9MPVof-BON36H_GG7YhcPPgaKTz1jzsGiqVbx-Xj5W83XsNYyxKBCVNqiN1c6QIpBoMLNyC1o5Vzok2hIZAcZBkStXFg6kVSmazAoAOWN3f7OeiDZd73fY_2xO3-UvcYVOWg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Junhyung Kim ; Yongmi Baek ; Jeongbae Yun ; Kenchul Cho ; Kyuchang Lee ; Jihun Han ; Suk-Gyu Lee ; Kijun Han</creator><creatorcontrib>Junhyung Kim ; Yongmi Baek ; Jeongbae Yun ; Kenchul Cho ; Kyuchang Lee ; Jihun Han ; Suk-Gyu Lee ; Kijun Han</creatorcontrib><description>In cognitive radio network, two or more nodes need to establish a link on an available channel when they want to transmit a data. Rendezvous is a process that nodes explore the available channels to establish a link when a pair of nodes wants to communicate with each other. The method of finding a common channel is a challenging problem. To use of a dedicated control channel can be a solution to find the common channel but it may result in a bottleneck and create a single point of failure. In this letter, we present a rendezvous sequence scheme to find a common channel. The proposed scheme guarantees the successful rendezvous within the bounded time.</description><identifier>ISBN: 9781457719653</identifier><identifier>ISBN: 1457719657</identifier><identifier>EISBN: 1457719649</identifier><identifier>EISBN: 9781457719646</identifier><identifier>EISBN: 1457719630</identifier><identifier>EISBN: 9781457719639</identifier><identifier>DOI: 10.1109/SCET.2012.6342033</identifier><language>eng</language><publisher>IEEE</publisher><subject>Availability ; Cognitive radio ; Computer science ; Educational institutions ; Indexes</subject><ispartof>2012 Spring Congress on Engineering and Technology, 2012, p.1-4</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6342033$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6342033$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Junhyung Kim</creatorcontrib><creatorcontrib>Yongmi Baek</creatorcontrib><creatorcontrib>Jeongbae Yun</creatorcontrib><creatorcontrib>Kenchul Cho</creatorcontrib><creatorcontrib>Kyuchang Lee</creatorcontrib><creatorcontrib>Jihun Han</creatorcontrib><creatorcontrib>Suk-Gyu Lee</creatorcontrib><creatorcontrib>Kijun Han</creatorcontrib><title>A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks</title><title>2012 Spring Congress on Engineering and Technology</title><addtitle>SCET</addtitle><description>In cognitive radio network, two or more nodes need to establish a link on an available channel when they want to transmit a data. Rendezvous is a process that nodes explore the available channels to establish a link when a pair of nodes wants to communicate with each other. The method of finding a common channel is a challenging problem. To use of a dedicated control channel can be a solution to find the common channel but it may result in a bottleneck and create a single point of failure. In this letter, we present a rendezvous sequence scheme to find a common channel. The proposed scheme guarantees the successful rendezvous within the bounded time.</description><subject>Availability</subject><subject>Cognitive radio</subject><subject>Computer science</subject><subject>Educational institutions</subject><subject>Indexes</subject><isbn>9781457719653</isbn><isbn>1457719657</isbn><isbn>1457719649</isbn><isbn>9781457719646</isbn><isbn>1457719630</isbn><isbn>9781457719639</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j1FLwzAUhSMiqLM_QHzJH2i9adqmeRxlbsJQsH0fd8mNRl1T227ifr0F53k5nO_AgcPYrYBECND3dbVokhREmhQyS0HKM3YtslwpoYtMn7NIq_I_5_KSRcPwDpNKUUpIr9hqzl-oIxzJ8mUf9h2v6WtPraGJt5aOh7AfeG3eaEfchZ5X4bX1oz9MPVof-BON36H_GG7YhcPPgaKTz1jzsGiqVbx-Xj5W83XsNYyxKBCVNqiN1c6QIpBoMLNyC1o5Vzok2hIZAcZBkStXFg6kVSmazAoAOWN3f7OeiDZd73fY_2xO3-UvcYVOWg</recordid><startdate>201205</startdate><enddate>201205</enddate><creator>Junhyung Kim</creator><creator>Yongmi Baek</creator><creator>Jeongbae Yun</creator><creator>Kenchul Cho</creator><creator>Kyuchang Lee</creator><creator>Jihun Han</creator><creator>Suk-Gyu Lee</creator><creator>Kijun Han</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201205</creationdate><title>A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks</title><author>Junhyung Kim ; Yongmi Baek ; Jeongbae Yun ; Kenchul Cho ; Kyuchang Lee ; Jihun Han ; Suk-Gyu Lee ; Kijun Han</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-16aa79ca9cd9fce7e03aca4d3b097ff8faeebeec10cf0657f86f03d72ac4d1003</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Availability</topic><topic>Cognitive radio</topic><topic>Computer science</topic><topic>Educational institutions</topic><topic>Indexes</topic><toplevel>online_resources</toplevel><creatorcontrib>Junhyung Kim</creatorcontrib><creatorcontrib>Yongmi Baek</creatorcontrib><creatorcontrib>Jeongbae Yun</creatorcontrib><creatorcontrib>Kenchul Cho</creatorcontrib><creatorcontrib>Kyuchang Lee</creatorcontrib><creatorcontrib>Jihun Han</creatorcontrib><creatorcontrib>Suk-Gyu Lee</creatorcontrib><creatorcontrib>Kijun Han</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Junhyung Kim</au><au>Yongmi Baek</au><au>Jeongbae Yun</au><au>Kenchul Cho</au><au>Kyuchang Lee</au><au>Jihun Han</au><au>Suk-Gyu Lee</au><au>Kijun Han</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks</atitle><btitle>2012 Spring Congress on Engineering and Technology</btitle><stitle>SCET</stitle><date>2012-05</date><risdate>2012</risdate><spage>1</spage><epage>4</epage><pages>1-4</pages><isbn>9781457719653</isbn><isbn>1457719657</isbn><eisbn>1457719649</eisbn><eisbn>9781457719646</eisbn><eisbn>1457719630</eisbn><eisbn>9781457719639</eisbn><abstract>In cognitive radio network, two or more nodes need to establish a link on an available channel when they want to transmit a data. Rendezvous is a process that nodes explore the available channels to establish a link when a pair of nodes wants to communicate with each other. The method of finding a common channel is a challenging problem. To use of a dedicated control channel can be a solution to find the common channel but it may result in a bottleneck and create a single point of failure. In this letter, we present a rendezvous sequence scheme to find a common channel. The proposed scheme guarantees the successful rendezvous within the bounded time.</abstract><pub>IEEE</pub><doi>10.1109/SCET.2012.6342033</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781457719653 |
| ispartof | 2012 Spring Congress on Engineering and Technology, 2012, p.1-4 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6342033 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Availability Cognitive radio Computer science Educational institutions Indexes |
| title | A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T02%3A22%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Repeated%20Group%20Sequence%20Rendezvous%20Scheme%20for%20Cognitive%20Radio%20Networks&rft.btitle=2012%20Spring%20Congress%20on%20Engineering%20and%20Technology&rft.au=Junhyung%20Kim&rft.date=2012-05&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.isbn=9781457719653&rft.isbn_list=1457719657&rft_id=info:doi/10.1109/SCET.2012.6342033&rft_dat=%3Cieee_6IE%3E6342033%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457719649&rft.eisbn_list=9781457719646&rft.eisbn_list=1457719630&rft.eisbn_list=9781457719639&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6342033&rfr_iscdi=true |