Adaptive Bit Partitioning for Multicell Intercell Interference Nulling with Delayed Limited Feedback

Base station cooperation can exploit knowledge of the users' channel state information (CSI) at the transmitters to manage co-channel interference. Users have to feedback CSI of the desired and interfering channels using finite-bandwidth backhaul links. Existing codebook designs for single-cell limited feedback can be used for multicell cooperation by partitioning the available feedback resources between the multiple channels. In this paper, a new feedback-bit allocation strategy is proposed, as a function of the delays in the communication links and received signal strengths in the downlink. Channel temporal correlation is modeled as a function of delay using the Gauss-Markov model. Closed-form expressions for bit partitions are derived to allocate more bits to quantize the stronger channels with smaller delays and fewer bits to weaker channels with larger delays, assuming random vector quantization. Cellular network simulations are used to show that the proposed algorithm yields higher sum-rates than an equal-bit allocation technique.Comment: Submitted to IEEE Transactions on Signal Processing, July 201

Comparison and validation of community structures in complex networks

The issue of partitioning a network into communities has attracted a great deal of attention recently. Most authors seem to equate this issue with the one of finding the maximum value of the modularity, as defined by Newman. Since the problem formulated this way is NP-hard, most effort has gone into the construction of search algorithms, and less to the question of other measures of community structures, similarities between various partitionings and the validation with respect to external information. Here we concentrate on a class of computer generated networks and on three well-studied real networks which constitute a bench-mark for network studies; the karate club, the US college football teams and a gene network of yeast. We utilize some standard ways of clustering data (originally not designed for finding community structures in networks) and show that these classical methods sometimes outperform the newer ones. We discuss various measures of the strength of the modular structure, and show by examples features and drawbacks. Further, we compare different partitions by applying some graph-theoretic concepts of distance, which indicate that one of the quality measures of the degree of modularity corresponds quite well with the distance from the true partition. Finally, we introduce a way to validate the partitionings with respect to external data when the nodes are classified but the network structure is unknown. This is here possible since we know everything of the computer generated networks, as well as the historical answer to how the karate club and the football teams are partitioned in reality. The partitioning of the gene network is validated by use of the Gene Ontology database, where we show that a community in general corresponds to a biological process.Comment: To appear in Physica A; 25 page

Hybrid Spectrum Allocation Scheme in Wireless Cellular Networks

Mobile services have seen a major upswing driven by the bandwidth hungry applications thus leading to higher data rate requirements on the wireless networks. Spectrum being the most precious resource in the wireless industry is of keen interest. Various spectrum assignment and frequency reuse schemes have been proposed in literature. However in future networks, dynamic schemes that adapt to spatio-temporal variation in the environment are desired. We thus present a hybrid spectrum assignment scheme which adapts its allocation strategies depending on user distribution in the system. Results show that the proposed dynamic spectrum assignment strategy improves spectrum utilization thereby providing a higher data rate for the users

Spatial Coordination Strategies in Future Ultra-Dense Wireless Networks

Ultra network densification is considered a major trend in the evolution of cellular networks, due to its ability to bring the network closer to the user side and reuse resources to the maximum extent. In this paper we explore spatial resources coordination as a key empowering technology for next generation (5G) ultra-dense networks. We propose an optimization framework for flexibly associating system users with a densely deployed network of access nodes, opting for the exploitation of densification and the control of overhead signaling. Combined with spatial precoding processing strategies, we design network resources management strategies reflecting various features, namely local vs global channel state information knowledge exploitation, centralized vs distributed implementation, and non-cooperative vs joint multi-node data processing. We apply these strategies to future UDN setups, and explore the impact of critical network parameters, that is, the densification levels of users and access nodes as well as the power budget constraints, to users performance. We demonstrate that spatial resources coordination is a key factor for capitalizing on the gains of ultra dense network deployments.Comment: An extended version of a paper submitted to ISWCS'14, Special Session on Empowering Technologies of 5G Wireless Communication