Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms

In this paper, we propose a novel class of Nash problems for cognitive radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own opportunistic throughput by choosing jointly the sensing duratio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2013-07, Vol.59 (7), p.4626-4661
Hauptverfasser: Scutari, G., Jong-Shi Pang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 4661
container_issue 7
container_start_page 4626
container_title IEEE transactions on information theory
container_volume 59
creator Scutari, G.
Jong-Shi Pang
description In this paper, we propose a novel class of Nash problems for cognitive radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own opportunistic throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power allocation. The proposed general formulation allows us to accommodate several (transmit) power and (deterministic/probabilistic) interference constraints, such as constraints on the maximum individual and/or aggregate (probabilistic) interference tolerable at the primary receivers. To keep the optimization as decentralized as possible, global (coupling) interference constraints are imposed by penalizing each SU with a set of time-varying prices based upon his contribution to the total interference; the prices are thus additional variable to optimize. The resulting players' optimization problems are nonconvex; moreover, there are possibly price clearing conditions associated with the global constraints to be satisfied by the solution. All this makes the analysis of the proposed games a challenging task; none of classical results in the game theory literature can be successfully applied. The main contribution of this paper is to develop a novel optimization-based theory for studying the proposed nonconvex games; we provide a comprehensive analysis of the existence and uniqueness of a standard Nash equilibrium, devise alternative best-response based algorithms, and establish their convergence. Some of the proposed algorithms are totally distributed and asynchronous, whereas some others require limited signaling among the SUs (in the form of consensus algorithms) in favor of better performance; overall, they are thus applicable to a variety of CR scenarios, either cooperative or noncooperative, which allows the SUs to explore the existing tradeoff between signaling and performance.
doi_str_mv 10.1109/TIT.2013.2239354
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2013_2239354</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6409459</ieee_id><sourcerecordid>2997770581</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-70e398278ba98b310a704f22f04ffa1047e9dea703ef76fed87066214634fe103</originalsourceid><addsrcrecordid>eNo9kM1rGzEQxUVoIG6Se6EXQelxXX2tPnozTuokBLc07nmRd0e2zFqKpXXS_PdVauPLDDPze2_gIfSJkjGlxHxb3C_GjFA-ZowbXoszNKJ1rSoja_EBjQihujJC6Av0MedNGUVN2QjtHqIPA36CkH1YYRs6_Cu-QsKTvo-tHXwM2Ac8j6GN4QX-4mlcBT_4F8C_becjntkt5O94bvMa3-72vvfL5O1_oxufh-SX-wG6YreKyQ_rbb5C5872Ga6P_RL9-XG7mN5Vjz9n99PJY9VyyYdKEeBGM6WX1uglp8QqIhxjrlRnKREKTAdlycEp6aDTikjJqJBcOKCEX6IvB9_nFHd7yEOzifsUysuGcqlZzbWoC0UOVJtizglc85z81qa3hpLmPdimBNu8B9scgy2Sr0djm1vbu2RD6_NJx5TQQmpVuM8HzgPA6SwFMaI2_B-5xIEA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1368253845</pqid></control><display><type>article</type><title>Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms</title><source>IEEE Electronic Library Online</source><creator>Scutari, G. ; Jong-Shi Pang</creator><creatorcontrib>Scutari, G. ; Jong-Shi Pang</creatorcontrib><description>In this paper, we propose a novel class of Nash problems for cognitive radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own opportunistic throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power allocation. The proposed general formulation allows us to accommodate several (transmit) power and (deterministic/probabilistic) interference constraints, such as constraints on the maximum individual and/or aggregate (probabilistic) interference tolerable at the primary receivers. To keep the optimization as decentralized as possible, global (coupling) interference constraints are imposed by penalizing each SU with a set of time-varying prices based upon his contribution to the total interference; the prices are thus additional variable to optimize. The resulting players' optimization problems are nonconvex; moreover, there are possibly price clearing conditions associated with the global constraints to be satisfied by the solution. All this makes the analysis of the proposed games a challenging task; none of classical results in the game theory literature can be successfully applied. The main contribution of this paper is to develop a novel optimization-based theory for studying the proposed nonconvex games; we provide a comprehensive analysis of the existence and uniqueness of a standard Nash equilibrium, devise alternative best-response based algorithms, and establish their convergence. Some of the proposed algorithms are totally distributed and asynchronous, whereas some others require limited signaling among the SUs (in the form of consensus algorithms) in favor of better performance; overall, they are thus applicable to a variety of CR scenarios, either cooperative or noncooperative, which allows the SUs to explore the existing tradeoff between signaling and performance.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2013.2239354</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Applied sciences ; Cognitive radio ; Convergence ; distributed algorithms ; Exact sciences and technology ; Game theory ; Games ; Information theory ; Information, signal and communications theory ; Interference constraints ; Joints ; Optimization ; Optimization algorithms ; quasi-Nash equilibrium ; Radiocommunication specific techniques ; Radiocommunications ; Sensors ; spectrum sensing ; Switching and signalling ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments) ; variational inequalities</subject><ispartof>IEEE transactions on information theory, 2013-07, Vol.59 (7), p.4626-4661</ispartof><rights>2014 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2013</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-70e398278ba98b310a704f22f04ffa1047e9dea703ef76fed87066214634fe103</citedby><cites>FETCH-LOGICAL-c363t-70e398278ba98b310a704f22f04ffa1047e9dea703ef76fed87066214634fe103</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6409459$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6409459$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=27484687$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Scutari, G.</creatorcontrib><creatorcontrib>Jong-Shi Pang</creatorcontrib><title>Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In this paper, we propose a novel class of Nash problems for cognitive radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own opportunistic throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power allocation. The proposed general formulation allows us to accommodate several (transmit) power and (deterministic/probabilistic) interference constraints, such as constraints on the maximum individual and/or aggregate (probabilistic) interference tolerable at the primary receivers. To keep the optimization as decentralized as possible, global (coupling) interference constraints are imposed by penalizing each SU with a set of time-varying prices based upon his contribution to the total interference; the prices are thus additional variable to optimize. The resulting players' optimization problems are nonconvex; moreover, there are possibly price clearing conditions associated with the global constraints to be satisfied by the solution. All this makes the analysis of the proposed games a challenging task; none of classical results in the game theory literature can be successfully applied. The main contribution of this paper is to develop a novel optimization-based theory for studying the proposed nonconvex games; we provide a comprehensive analysis of the existence and uniqueness of a standard Nash equilibrium, devise alternative best-response based algorithms, and establish their convergence. Some of the proposed algorithms are totally distributed and asynchronous, whereas some others require limited signaling among the SUs (in the form of consensus algorithms) in favor of better performance; overall, they are thus applicable to a variety of CR scenarios, either cooperative or noncooperative, which allows the SUs to explore the existing tradeoff between signaling and performance.</description><subject>Algorithm design and analysis</subject><subject>Applied sciences</subject><subject>Cognitive radio</subject><subject>Convergence</subject><subject>distributed algorithms</subject><subject>Exact sciences and technology</subject><subject>Game theory</subject><subject>Games</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Interference constraints</subject><subject>Joints</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>quasi-Nash equilibrium</subject><subject>Radiocommunication specific techniques</subject><subject>Radiocommunications</subject><subject>Sensors</subject><subject>spectrum sensing</subject><subject>Switching and signalling</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>variational inequalities</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kM1rGzEQxUVoIG6Se6EXQelxXX2tPnozTuokBLc07nmRd0e2zFqKpXXS_PdVauPLDDPze2_gIfSJkjGlxHxb3C_GjFA-ZowbXoszNKJ1rSoja_EBjQihujJC6Av0MedNGUVN2QjtHqIPA36CkH1YYRs6_Cu-QsKTvo-tHXwM2Ac8j6GN4QX-4mlcBT_4F8C_becjntkt5O94bvMa3-72vvfL5O1_oxufh-SX-wG6YreKyQ_rbb5C5872Ga6P_RL9-XG7mN5Vjz9n99PJY9VyyYdKEeBGM6WX1uglp8QqIhxjrlRnKREKTAdlycEp6aDTikjJqJBcOKCEX6IvB9_nFHd7yEOzifsUysuGcqlZzbWoC0UOVJtizglc85z81qa3hpLmPdimBNu8B9scgy2Sr0djm1vbu2RD6_NJx5TQQmpVuM8HzgPA6SwFMaI2_B-5xIEA</recordid><startdate>20130701</startdate><enddate>20130701</enddate><creator>Scutari, G.</creator><creator>Jong-Shi Pang</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130701</creationdate><title>Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms</title><author>Scutari, G. ; Jong-Shi Pang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-70e398278ba98b310a704f22f04ffa1047e9dea703ef76fed87066214634fe103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithm design and analysis</topic><topic>Applied sciences</topic><topic>Cognitive radio</topic><topic>Convergence</topic><topic>distributed algorithms</topic><topic>Exact sciences and technology</topic><topic>Game theory</topic><topic>Games</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Interference constraints</topic><topic>Joints</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>quasi-Nash equilibrium</topic><topic>Radiocommunication specific techniques</topic><topic>Radiocommunications</topic><topic>Sensors</topic><topic>spectrum sensing</topic><topic>Switching and signalling</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>variational inequalities</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Scutari, G.</creatorcontrib><creatorcontrib>Jong-Shi Pang</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library Online</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Scutari, G.</au><au>Jong-Shi Pang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2013-07-01</date><risdate>2013</risdate><volume>59</volume><issue>7</issue><spage>4626</spage><epage>4661</epage><pages>4626-4661</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In this paper, we propose a novel class of Nash problems for cognitive radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own opportunistic throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power allocation. The proposed general formulation allows us to accommodate several (transmit) power and (deterministic/probabilistic) interference constraints, such as constraints on the maximum individual and/or aggregate (probabilistic) interference tolerable at the primary receivers. To keep the optimization as decentralized as possible, global (coupling) interference constraints are imposed by penalizing each SU with a set of time-varying prices based upon his contribution to the total interference; the prices are thus additional variable to optimize. The resulting players' optimization problems are nonconvex; moreover, there are possibly price clearing conditions associated with the global constraints to be satisfied by the solution. All this makes the analysis of the proposed games a challenging task; none of classical results in the game theory literature can be successfully applied. The main contribution of this paper is to develop a novel optimization-based theory for studying the proposed nonconvex games; we provide a comprehensive analysis of the existence and uniqueness of a standard Nash equilibrium, devise alternative best-response based algorithms, and establish their convergence. Some of the proposed algorithms are totally distributed and asynchronous, whereas some others require limited signaling among the SUs (in the form of consensus algorithms) in favor of better performance; overall, they are thus applicable to a variety of CR scenarios, either cooperative or noncooperative, which allows the SUs to explore the existing tradeoff between signaling and performance.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2013.2239354</doi><tpages>36</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 2013-07, Vol.59 (7), p.4626-4661
issn 0018-9448
1557-9654
language eng
recordid cdi_crossref_primary_10_1109_TIT_2013_2239354
source IEEE Electronic Library Online
subjects Algorithm design and analysis
Applied sciences
Cognitive radio
Convergence
distributed algorithms
Exact sciences and technology
Game theory
Games
Information theory
Information, signal and communications theory
Interference constraints
Joints
Optimization
Optimization algorithms
quasi-Nash equilibrium
Radiocommunication specific techniques
Radiocommunications
Sensors
spectrum sensing
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
variational inequalities
title Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T13%3A45%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Joint%20Sensing%20and%20Power%20Allocation%20in%20Nonconvex%20Cognitive%20Radio%20Games:%20Nash%20Equilibria%20and%20Distributed%20Algorithms&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Scutari,%20G.&rft.date=2013-07-01&rft.volume=59&rft.issue=7&rft.spage=4626&rft.epage=4661&rft.pages=4626-4661&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2013.2239354&rft_dat=%3Cproquest_RIE%3E2997770581%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1368253845&rft_id=info:pmid/&rft_ieee_id=6409459&rfr_iscdi=true