arXiv subjects

Mehdi Bennis

Publications and source records attributed to Mehdi Bennis.

366 records · Page 21Linked to original sources

arXiv2013

Matching with Externalities for Context-Aware User-Cell Association in Small Cell Networks

In this paper, we propose a novel user-cell association approach for wireless small cell networks that exploits previously unexplored context information extracted from users' devices, i.e., user equipments (UEs). Beyond characterizing precise quality of service (QoS) requirements that accurately reflect the UEs' application usage, our proposed cell association approach accounts for the devices' hardware type (e.g., smartphone, tablet, laptop). This approach has the practical benefit of enabling the small cells to make better informed cell association decisions that handle practical device-specific QoS characteristics. We formulate the problem as a matching game between small cell base stations (SBSs) and UEs. In this game, the SBSs and UEs rank one another based on well-designed utility functions that capture composite QoS requirements, extracted from the context features (i.e., application in use, hardware type). We show that the preferences used by the nodes to rank one another are interdependent and influenced by the existing network-wide matching. Due to this unique feature of the preferences, we show that the proposed game can be classified as a many-to-one matching game with externalities. To solve this game, we propose a distributed algorithm that enables the players (i.e., UEs and SBSs) to self-organize into a stable matching that guarantees the required applications' QoS. Simulation results show that the proposed context-aware cell association scheme yields significant gains, reaching up to 52% improvement compared to baseline context-unaware approaches.

cs.GT↗

arXiv2013

When Cellular Meets WiFi in Wireless Small Cell Networks

The deployment of small cell base stations(SCBSs) overlaid on existing macro-cellular systems is seen as a key solution for offloading traffic, optimizing coverage, and boosting the capacity of future cellular wireless systems. The next-generation of SCBSs is envisioned to be multi-mode, i.e., capable of transmitting simultaneously on both licensed and unlicensed bands. This constitutes a cost-effective integration of both WiFi and cellular radio access technologies (RATs) that can efficiently cope with peak wireless data traffic and heterogeneous quality-of-service requirements. To leverage the advantage of such multi-mode SCBSs, we discuss the novel proposed paradigm of cross-system learning by means of which SCBSs self-organize and autonomously steer their traffic flows across different RATs. Cross-system learning allows the SCBSs to leverage the advantage of both the WiFi and cellular worlds. For example, the SCBSs can offload delay-tolerant data traffic to WiFi, while simultaneously learning the probability distribution function of their transmission strategy over the licensed cellular band. This article will first introduce the basic building blocks of cross-system learning and then provide preliminary performance evaluation in a Long-Term Evolution (LTE) simulator overlaid with WiFi hotspots. Remarkably, it is shown that the proposed cross-system learning approach significantly outperforms a number of benchmark traffic steering policies.

cs.NI↗

arXiv2013

On the Fly Self-Organized Base Station Placement

In this paper, we address the deployment of base stations (BSs) in a one-dimensional network in which the users are randomly distributed.In order to take into account the users' distribution to optimally place the BSs we optimize the uplink MMSE sum rate. Moreover, given a massive number of antennas at the BSs we propose a novel random matrix theory-based technique so as to obtain tight approximations for the MMSE sum rate in the uplink. We investigate a cooperative (CP) scenario where the BSs jointly decode the messages and a non-cooperative (NCP) scheme in which the BS can only decode its own users. Our results show that the CP strategy considerably outperforms the NCP case. Moreover, we show that there exists a trade off in the BS deployment regarding the position of each BS. Thus, through location games we can optimize the position of each BS in order to maximize the system performance.

cs.NI↗

arXiv2013

Statistical Analysis of Self-Organizing Networks with Biased Cell Association and Interference Avoidance

In this work, we assess the viability of heterogeneous networks composed of legacy macrocells which are underlaid with self-organizing picocells. Aiming to improve coverage, cell-edge throughput and overall system capacity, self-organizing solutions, such as range expansion bias, almost blank subframe and distributed antenna systems are considered. Herein, stochastic geometry is used to model network deployments, while higher-order statistics through the cumulants concept is utilized to characterize the probability distribution of the received power and aggregate interference at the user of interest. A compre- hensive analytical framework is introduced to evaluate the performance of such self-organizing networks in terms of outage probability and average channel capacity with respect to the tagged receiver. To conduct our studies, we consider a shadowed fading channel model incorporating log-normal shadowing and Nakagami-m fading. Results show that the analytical framework matches well with numerical results obtained from Monte Carlo simulations. We also observed that by simply using almost blank subframes the aggregate interference at the tagged receiver is reduced by about 12dB. Although more elaborated interference control techniques such as, downlink bitmap and distributed antennas systems become needed, when the density of picocells in the underlaid tier gets high.

cs.NI↗

arXiv2012

Improving Macrocell - Small Cell Coexistence through Adaptive Interference Draining

The deployment of underlay small base stations (SBSs) is expected to significantly boost the spectrum efficiency and the coverage of next-generation cellular networks. However, the coexistence of SBSs underlaid to an existing macro-cellular network faces important challenges, notably in terms of spectrum sharing and interference management. In this paper, we propose a novel game-theoretic model that enables the SBSs to optimize their transmission rates by making decisions on the resource occupation jointly in the frequency and spatial domains. This procedure, known as interference draining, is performed among cooperative SBSs and allows to drastically reduce the interference experienced by both macro- and small cell users. At the macrocell side, we consider a modified water-filling policy for the power allocation that allows each macrocell user (MUE) to focus the transmissions on the degrees of freedom over which the MUE experiences the best channel and interference conditions. This approach not only represents an effective way to decrease the received interference at the MUEs but also grants the SBSs tier additional transmission opportunities and allows for a more agile interference management. Simulation results show that the proposed approach yields significant gains at both macrocell and small cell tiers, in terms of average achievable rate per user, reaching up to 37%, relative to the non-cooperative case, for a network with 150 MUEs and 200 SBSs.

cs.GT↗

arXiv2011

Spectrum Leasing as an Incentive towards Uplink Macrocell and Femtocell Cooperation

The concept of femtocell access points underlaying existing communication infrastructure has recently emerged as a key technology that can significantly improve the coverage and performance of next-generation wireless networks. In this paper, we propose a framework for macrocell-femtocell cooperation under a closed access policy, in which a femtocell user may act as a relay for macrocell users. In return, each cooperative macrocell user grants the femtocell user a fraction of its superframe. We formulate a coalitional game with macrocell and femtocell users being the players, which can take individual and distributed decisions on whether to cooperate or not, while maximizing a utility function that captures the cooperative gains, in terms of throughput and delay.We show that the network can selforganize into a partition composed of disjoint coalitions which constitutes the recursive core of the game representing a key solution concept for coalition formation games in partition form. Simulation results show that the proposed coalition formation algorithm yields significant gains in terms of average rate per macrocell user, reaching up to 239%, relative to the non-cooperative case. Moreover, the proposed approach shows an improvement in terms of femtocell users' rate of up to 21% when compared to the traditional closed access policy.

cs.GT↗