Handbook of CDMA system design, engineering, and optimization
Handbook of CDMA system design, engineering, and optimization
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
A demand-assignment access control for multi-code DS-CDMA wireless packet (ATM) networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
UMTS/IMT-2000 based on wideband CDMA
IEEE Communications Magazine
Adaptive cell sectorization for CDMA systems
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Cell sectorization has been shown as a promising technique to improve the overall capacity in direct sequence code division multiple access (DS-CDMA) systems. It has been further demonstrated that the use of adaptive antenna arrays with dynamic cell sectoring is particularly suitable for non-uniformly distributed users. In this paper, we first re-formulate cell sectoring into an optimization problem and solve it with dynamic programming algorithm. We next show that this has two major practical drawbacks: the complexity and oscillation of users between neighboring sectors. We then present an efficient Cluster-based Sectoring (CS) algorithm for adaptive cell sectorization to overcome these two inefficiencies: Firstly, the computation complexity of CS algorithm is much lower than that of the optimal sectoring algorithm. In particular under high-density case, the complexity is bounded and does not depend on the number of users in a cell; Secondly, the CS algorithm maintains the excellent property of avoiding sector boundaries frequently crossing those users closely located within short angular distances. In addition, we also investigate the support for multi-rate applications with the proposed CS algorithm. Through extensive experimental study, we find that the performance of proposed CS scheme obtains comparable performance with greatly reduced complexity when comparing to the optimal solution.