Convex relaxation algorithms for energy-infeasibility tradeoff in cognitive radio networks

Xiangping Zhai, Liang Zheng, Chee Wei Tan

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

In cognitive radio networks, uncontrolled access of secondary users degrades the performance of primary users and can even lead to system infeasibility, as the secondary users are allowed to transmit simultaneously on a shared spectrum. We study the feasibility of the total energy consumption minimization problem subjecting to power budget and Signal-to-Interference-plus- Noise Ratio (SINR) constraints. Finding the largest set of secondary users (i.e., the system capacity) that can be supported in the system is hard to solve due to the nonconvexity of the cardinality objective. We formulate this problem as a vector-cardinality optimization problem, and propose a convex relaxation that replaces the objective with a continuous and convex function. Motivated by the sum-of-infeasibilities heuristic, a joint power and admission control algorithm is proposed to compute the maximum number of secondary users that can be supported. Numerical results are presented to show that our algorithm is theoretically sound and practically implementable. © 2013 IFIP.
Original languageEnglish
Title of host publication2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013
Pages396-403
Publication statusPublished - 2013
Event2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013 - Tsukuba Science City, Japan
Duration: 13 May 201317 May 2013

Conference

Conference2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2013
Country/TerritoryJapan
CityTsukuba Science City
Period13/05/1317/05/13

Research Keywords

  • admission control
  • cognitive radio networks
  • feasibility
  • optimization
  • Power control

Fingerprint

Dive into the research topics of 'Convex relaxation algorithms for energy-infeasibility tradeoff in cognitive radio networks'. Together they form a unique fingerprint.

Cite this