Loading…

Performance Analysis of Opportunistic Cooperation Schemes in Cognitive Radio Networks

In this paper, we propose an opportunistic cooperation scheme in a two-user buffer-aided cognitive radio network. In each time slot, the secondary user (SU) will either transmit its own packets, or help the primary user to forward packets, based on a priority factor α. According to previous cooperat...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2018-04, Vol.67 (4), p.3658-3662
Main Authors: Xu, Dingjie, Gao, Yichen, Yang, Chenchen, Yao, Yao, Xia, Bin
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c357t-b88d46f49f9c0c98cb5ca2a520412b21b31ed97fa7418fd7aaf4a9e121fe313f3
cites cdi_FETCH-LOGICAL-c357t-b88d46f49f9c0c98cb5ca2a520412b21b31ed97fa7418fd7aaf4a9e121fe313f3
container_end_page 3662
container_issue 4
container_start_page 3658
container_title IEEE transactions on vehicular technology
container_volume 67
creator Xu, Dingjie
Gao, Yichen
Yang, Chenchen
Yao, Yao
Xia, Bin
description In this paper, we propose an opportunistic cooperation scheme in a two-user buffer-aided cognitive radio network. In each time slot, the secondary user (SU) will either transmit its own packets, or help the primary user to forward packets, based on a priority factor α. According to previous cooperation schemes, some time slots will be wasted if the selected buffer is empty. However, under the proposed scheme, these time slots will be handed over to the nonempty buffer's transmission, which increases the average service rates of buffers at the SU. Considering the bursty nature of sources, we characterize the evolution of buffer states by using the Markov chain. By calculating the probability of time slot handing over, the increased service rates can be theoretically analyzed, so as to the improvements on the stable throughput region and the average end-to-end transmission delay. Moreover, we further discuss the throughput and delay tradeoffs between the two users, which indicates that we can control the traffic load by adjusting the priority factor. Simulations validate our analysis, and reveal that the proposed cooperation scheme with time slot handing over offers a far larger throughput while maintaining a shorter transmission delay compared with previous schemes.
doi_str_mv 10.1109/TVT.2017.2779164
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8125767</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8125767</ieee_id><sourcerecordid>2174489375</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-b88d46f49f9c0c98cb5ca2a520412b21b31ed97fa7418fd7aaf4a9e121fe313f3</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWKt3wUvA89ZMPprNsRS_oFjR1mvIZhNNbTdrslX6791S8TS8w_MOzIPQJZARAFE3i7fFiBKQIyqlgjE_QgNQTBWKCXWMBoRAWSjBxSk6y3nVR84VDNDy2SUf08Y01uFJY9a7HDKOHs_bNqZu24TcBYunMbYumS7EBr_aD7dxGYemX783oQvfDr-YOkT85LqfmD7zOTrxZp3dxd8couXd7WL6UMzm94_TyaywTMiuqMqy5mPPlVeWWFXaSlhDjaCEA60oVAxcraQ3kkPpa2mM50Y5oOAdA-bZEF0f7rYpfm1d7vQqblP_RdYUJOelYlL0FDlQNsWck_O6TWFj0k4D0Xt5upen9_L0n7y-cnWoBOfcP14CFXIs2S_6DWwp</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174489375</pqid></control><display><type>article</type><title>Performance Analysis of Opportunistic Cooperation Schemes in Cognitive Radio Networks</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Xu, Dingjie ; Gao, Yichen ; Yang, Chenchen ; Yao, Yao ; Xia, Bin</creator><creatorcontrib>Xu, Dingjie ; Gao, Yichen ; Yang, Chenchen ; Yao, Yao ; Xia, Bin</creatorcontrib><description>In this paper, we propose an opportunistic cooperation scheme in a two-user buffer-aided cognitive radio network. In each time slot, the secondary user (SU) will either transmit its own packets, or help the primary user to forward packets, based on a priority factor α. According to previous cooperation schemes, some time slots will be wasted if the selected buffer is empty. However, under the proposed scheme, these time slots will be handed over to the nonempty buffer's transmission, which increases the average service rates of buffers at the SU. Considering the bursty nature of sources, we characterize the evolution of buffer states by using the Markov chain. By calculating the probability of time slot handing over, the increased service rates can be theoretically analyzed, so as to the improvements on the stable throughput region and the average end-to-end transmission delay. Moreover, we further discuss the throughput and delay tradeoffs between the two users, which indicates that we can control the traffic load by adjusting the priority factor. Simulations validate our analysis, and reveal that the proposed cooperation scheme with time slot handing over offers a far larger throughput while maintaining a shorter transmission delay compared with previous schemes.</description><identifier>ISSN: 0018-9545</identifier><identifier>EISSN: 1939-9359</identifier><identifier>DOI: 10.1109/TVT.2017.2779164</identifier><identifier>CODEN: ITVTAB</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Analytical models ; Cognitive radio ; cognitive radio network ; Cooperation ; Delay ; Delays ; Interference ; Markov chains ; Opportunistic transmission ; Packet transmission ; Probability ; Queueing analysis ; Radio networks ; stable throughput region ; Throughput ; throughput delay tradeoff ; Traffic control</subject><ispartof>IEEE transactions on vehicular technology, 2018-04, Vol.67 (4), p.3658-3662</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-b88d46f49f9c0c98cb5ca2a520412b21b31ed97fa7418fd7aaf4a9e121fe313f3</citedby><cites>FETCH-LOGICAL-c357t-b88d46f49f9c0c98cb5ca2a520412b21b31ed97fa7418fd7aaf4a9e121fe313f3</cites><orcidid>0000-0001-9627-7407 ; 0000-0001-9506-3220 ; 0000-0002-1818-689X ; 0000-0003-4713-5765</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8125767$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids></links><search><creatorcontrib>Xu, Dingjie</creatorcontrib><creatorcontrib>Gao, Yichen</creatorcontrib><creatorcontrib>Yang, Chenchen</creatorcontrib><creatorcontrib>Yao, Yao</creatorcontrib><creatorcontrib>Xia, Bin</creatorcontrib><title>Performance Analysis of Opportunistic Cooperation Schemes in Cognitive Radio Networks</title><title>IEEE transactions on vehicular technology</title><addtitle>TVT</addtitle><description>In this paper, we propose an opportunistic cooperation scheme in a two-user buffer-aided cognitive radio network. In each time slot, the secondary user (SU) will either transmit its own packets, or help the primary user to forward packets, based on a priority factor α. According to previous cooperation schemes, some time slots will be wasted if the selected buffer is empty. However, under the proposed scheme, these time slots will be handed over to the nonempty buffer's transmission, which increases the average service rates of buffers at the SU. Considering the bursty nature of sources, we characterize the evolution of buffer states by using the Markov chain. By calculating the probability of time slot handing over, the increased service rates can be theoretically analyzed, so as to the improvements on the stable throughput region and the average end-to-end transmission delay. Moreover, we further discuss the throughput and delay tradeoffs between the two users, which indicates that we can control the traffic load by adjusting the priority factor. Simulations validate our analysis, and reveal that the proposed cooperation scheme with time slot handing over offers a far larger throughput while maintaining a shorter transmission delay compared with previous schemes.</description><subject>Analytical models</subject><subject>Cognitive radio</subject><subject>cognitive radio network</subject><subject>Cooperation</subject><subject>Delay</subject><subject>Delays</subject><subject>Interference</subject><subject>Markov chains</subject><subject>Opportunistic transmission</subject><subject>Packet transmission</subject><subject>Probability</subject><subject>Queueing analysis</subject><subject>Radio networks</subject><subject>stable throughput region</subject><subject>Throughput</subject><subject>throughput delay tradeoff</subject><subject>Traffic control</subject><issn>0018-9545</issn><issn>1939-9359</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LAzEQhoMoWKt3wUvA89ZMPprNsRS_oFjR1mvIZhNNbTdrslX6791S8TS8w_MOzIPQJZARAFE3i7fFiBKQIyqlgjE_QgNQTBWKCXWMBoRAWSjBxSk6y3nVR84VDNDy2SUf08Y01uFJY9a7HDKOHs_bNqZu24TcBYunMbYumS7EBr_aD7dxGYemX783oQvfDr-YOkT85LqfmD7zOTrxZp3dxd8couXd7WL6UMzm94_TyaywTMiuqMqy5mPPlVeWWFXaSlhDjaCEA60oVAxcraQ3kkPpa2mM50Y5oOAdA-bZEF0f7rYpfm1d7vQqblP_RdYUJOelYlL0FDlQNsWck_O6TWFj0k4D0Xt5upen9_L0n7y-cnWoBOfcP14CFXIs2S_6DWwp</recordid><startdate>20180401</startdate><enddate>20180401</enddate><creator>Xu, Dingjie</creator><creator>Gao, Yichen</creator><creator>Yang, Chenchen</creator><creator>Yao, Yao</creator><creator>Xia, Bin</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-9627-7407</orcidid><orcidid>https://orcid.org/0000-0001-9506-3220</orcidid><orcidid>https://orcid.org/0000-0002-1818-689X</orcidid><orcidid>https://orcid.org/0000-0003-4713-5765</orcidid></search><sort><creationdate>20180401</creationdate><title>Performance Analysis of Opportunistic Cooperation Schemes in Cognitive Radio Networks</title><author>Xu, Dingjie ; Gao, Yichen ; Yang, Chenchen ; Yao, Yao ; Xia, Bin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-b88d46f49f9c0c98cb5ca2a520412b21b31ed97fa7418fd7aaf4a9e121fe313f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Analytical models</topic><topic>Cognitive radio</topic><topic>cognitive radio network</topic><topic>Cooperation</topic><topic>Delay</topic><topic>Delays</topic><topic>Interference</topic><topic>Markov chains</topic><topic>Opportunistic transmission</topic><topic>Packet transmission</topic><topic>Probability</topic><topic>Queueing analysis</topic><topic>Radio networks</topic><topic>stable throughput region</topic><topic>Throughput</topic><topic>throughput delay tradeoff</topic><topic>Traffic control</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xu, Dingjie</creatorcontrib><creatorcontrib>Gao, Yichen</creatorcontrib><creatorcontrib>Yang, Chenchen</creatorcontrib><creatorcontrib>Yao, Yao</creatorcontrib><creatorcontrib>Xia, Bin</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on vehicular technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Xu, Dingjie</au><au>Gao, Yichen</au><au>Yang, Chenchen</au><au>Yao, Yao</au><au>Xia, Bin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Performance Analysis of Opportunistic Cooperation Schemes in Cognitive Radio Networks</atitle><jtitle>IEEE transactions on vehicular technology</jtitle><stitle>TVT</stitle><date>2018-04-01</date><risdate>2018</risdate><volume>67</volume><issue>4</issue><spage>3658</spage><epage>3662</epage><pages>3658-3662</pages><issn>0018-9545</issn><eissn>1939-9359</eissn><coden>ITVTAB</coden><abstract>In this paper, we propose an opportunistic cooperation scheme in a two-user buffer-aided cognitive radio network. In each time slot, the secondary user (SU) will either transmit its own packets, or help the primary user to forward packets, based on a priority factor α. According to previous cooperation schemes, some time slots will be wasted if the selected buffer is empty. However, under the proposed scheme, these time slots will be handed over to the nonempty buffer's transmission, which increases the average service rates of buffers at the SU. Considering the bursty nature of sources, we characterize the evolution of buffer states by using the Markov chain. By calculating the probability of time slot handing over, the increased service rates can be theoretically analyzed, so as to the improvements on the stable throughput region and the average end-to-end transmission delay. Moreover, we further discuss the throughput and delay tradeoffs between the two users, which indicates that we can control the traffic load by adjusting the priority factor. Simulations validate our analysis, and reveal that the proposed cooperation scheme with time slot handing over offers a far larger throughput while maintaining a shorter transmission delay compared with previous schemes.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TVT.2017.2779164</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0001-9627-7407</orcidid><orcidid>https://orcid.org/0000-0001-9506-3220</orcidid><orcidid>https://orcid.org/0000-0002-1818-689X</orcidid><orcidid>https://orcid.org/0000-0003-4713-5765</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0018-9545
ispartof IEEE transactions on vehicular technology, 2018-04, Vol.67 (4), p.3658-3662
issn 0018-9545
1939-9359
language eng
recordid cdi_ieee_primary_8125767
source IEEE Electronic Library (IEL) Journals
subjects Analytical models
Cognitive radio
cognitive radio network
Cooperation
Delay
Delays
Interference
Markov chains
Opportunistic transmission
Packet transmission
Probability
Queueing analysis
Radio networks
stable throughput region
Throughput
throughput delay tradeoff
Traffic control
title Performance Analysis of Opportunistic Cooperation Schemes in Cognitive Radio Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T13%3A01%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Performance%20Analysis%20of%20Opportunistic%20Cooperation%20Schemes%20in%20Cognitive%20Radio%20Networks&rft.jtitle=IEEE%20transactions%20on%20vehicular%20technology&rft.au=Xu,%20Dingjie&rft.date=2018-04-01&rft.volume=67&rft.issue=4&rft.spage=3658&rft.epage=3662&rft.pages=3658-3662&rft.issn=0018-9545&rft.eissn=1939-9359&rft.coden=ITVTAB&rft_id=info:doi/10.1109/TVT.2017.2779164&rft_dat=%3Cproquest_ieee_%3E2174489375%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c357t-b88d46f49f9c0c98cb5ca2a520412b21b31ed97fa7418fd7aaf4a9e121fe313f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2174489375&rft_id=info:pmid/&rft_ieee_id=8125767&rfr_iscdi=true