Uplink capacity of self-organizing clustered orthogonal CDMA networks in flat fading channels

In this paper, we derive a deterministic equivalent of the Shannon-transform of certain type of large unitary random matrices. This approximation is exploited to evaluate the uplink channel capacity of clustered orthogonal CDMA network. When non-uniform power allocation among the users of each cluster is allowed, we derive an explicit iterative water-filling algorithm which, upon convergence, achieves the multiuser decoding capacity. In particular, we show that, in a self-organizing clustered orthogonal CDMA network, each cluster can optimize its power allocation policy independently of the other clusters at the expense of a small feedback overhead. Simulations corroborate the theoretical derivations.