User admission and clustering for uplink multiuser wireless systems

Jian Zhao, Tony Q.S. Quek, Zhongding Lei

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

We consider the uplink transmission in multiuser wireless systems with multiple single-antenna transmitting users and a multiantenna receiver. We address two problems in this paper. The first problem is user admission, i.e., given a large number of users, how to admit the maximum number of users that can simultaneously satisfy quality of service (QoS) and power constraints. The second problem is how to distribute the data among the users when they are allowed to share data before transmission. The aim is to minimize the total data exchange cost. Such a problem is called user clustering. We formulate those problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose a common framework to tackle those problems by first applying the l1-norm relaxation and then solving them with convex optimization methods. Simulations show that the proposed algorithms achieve excellent performance. For user admission, the numbers of admitted users by the proposed algorithms are close to the optimum numbers of admitted users obtained by exhaustive search (ES). For user clustering, the total data exchange cost is reduced by more than 10% after only a few iterations. When the QoS requirement is low, the user data exchange can be avoided using the proposed method, which achieves the optimum result obtained by ES.

原文English
文章編號6810858
頁(從 - 到)636-651
頁數16
期刊IEEE Transactions on Vehicular Technology
64
發行號2
DOIs
出版狀態Published - 2015 二月 1

All Science Journal Classification (ASJC) codes

  • 汽車工程
  • 航空工程
  • 電氣與電子工程
  • 應用數學

指紋

深入研究「User admission and clustering for uplink multiuser wireless systems」主題。共同形成了獨特的指紋。

引用此