Skip to main navigation Skip to search Skip to main content

Power allocation based on duality in a cognitive system

  • Chun Fan*
  • , Lin Ma
  • , Xuezhi Tan
  • , Yao Wang
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In a cognitive radio network based on underlay, the secondary users need to ensure that the interference to the primary users does not exceed the maximum interference tolerance. In this paper, a new algorithm of power allocation is proposed by solving optimal problem according to the theory of duality. The algorithm proposed can satisfy both the limitation of interference tolerance and the requirement of maximum utility, while the requirement of rate can also be considered. Numerical results indicate that the proposed algorithm can limit the secondary users' interference under a predefined threshold while maintaining a maximum utility of the system.

Original languageEnglish
Title of host publicationProceedings of the 2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012
Pages1127-1131
Number of pages5
DOIs
StatePublished - 2012
Event2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012 - Harbin, Heilongjiang, China
Duration: 8 Dec 201210 Dec 2012

Publication series

NameProceedings of the 2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012

Conference

Conference2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012
Country/TerritoryChina
CityHarbin, Heilongjiang
Period8/12/1210/12/12

Keywords

  • Cognitive radio
  • Dual
  • Power allocation
  • Sub-gradient

Fingerprint

Dive into the research topics of 'Power allocation based on duality in a cognitive system'. Together they form a unique fingerprint.

Cite this