Open vs Closed Access Femtocells in the Uplink

Femtocells are assuming an increasingly important role in the coverage and capacity of cellular networks. In contrast to existing cellular systems, femtocells are end-user deployed and controlled, randomly located, and rely on third party backhaul (e.g. DSL or cable modem). Femtocells can be configured to be either open access or closed access. Open access allows an arbitrary nearby cellular user to use the femtocell, whereas closed access restricts the use of the femtocell to users explicitly approved by the owner. Seemingly, the network operator would prefer an open access deployment since this provides an inexpensive way to expand their network capabilities, whereas the femtocell owner would prefer closed access, in order to keep the femtocell's capacity and backhaul to himself. We show mathematically and through simulations that the reality is more complicated for both parties, and that the best approach depends heavily on whether the multiple access scheme is orthogonal (TDMA or OFDMA, per subband) or non-orthogonal (CDMA). In a TDMA/OFDMA network, closed-access is typically preferable at high user densities, whereas in CDMA, open access can provide gains of more than 200% for the home user by reducing the near-far problem experienced by the femtocell. The results of this paper suggest that the interests of the femtocell owner and the network operator are more compatible than typically believed, and that CDMA femtocells should be configured for open access whereas OFDMA or TDMA femtocells should adapt to the cellular user density.Comment: 21 pages, 8 figures, 2 tables, submitted to IEEE Trans. on Wireless Communication

Optimal decentralized spectral resource allocation for OFDMA downlink of femto networks via adaptive gradient vector step size approach

For the orthogonal frequency division multiple access (OFDMA) downlink of a femto network, the resource allocation scheme would aim to maximize the area spectral efficiency (ASE) subject to constraints on the radio resources per transmission interval accessible by each femtocell. An optimal resource allocation scheme for completely decentralized femtocell deployments leads to a nonlinear optimization problem because the cost function of the optimization problem is nonlinear. In this paper, an adaptive gradient vector step size approach is proposed for finding the optimal solution of the optimization problem. Computer numerical simulation results show that our proposed method is more efficient than existing exhaustive search methods

A self-organized resource allocation scheme for heterogeneous macro-femto networks

This paper investigates the radio resource management (RRM) issues in a heterogeneous macro-femto network. The objective of femto deployment is to improve coverage, capacity, and experienced quality of service of indoor users. The location and density of user-deployed femtos is not known a-priori. This makes interference management crucial. In particular, with co-channel allocation (to improve resource utilization efficiency), RRM becomes involved because of both cross-layer and co-layer interference. In this paper, we review the resource allocation strategies available in the literature for heterogeneous macro-femto network. Then, we propose a self-organized resource allocation (SO-RA) scheme for an orthogonal frequency division multiple access based macro-femto network to mitigate co-layer interference in the downlink transmission. We compare its performance with the existing schemes like Reuse-1, adaptive frequency reuse (AFR), and AFR with power control (one of our proposed modification to AFR approach) in terms of 10 percentile user throughput and fairness to femto users. The performance of AFR with power control scheme matches closely with Reuse-1, while the SO-RA scheme achieves improved throughput and fairness performance. SO-RA scheme ensures minimum throughput guarantee to all femto users and exhibits better performance than the existing state-of-the-art resource allocation schemes

Decentralized spectral resource allocation for OFDMA downlink of coexisting macro/femto networks using filled function method

For an orthogonal frequency division multiple access (OFDMA) downlink of a spectrally coexisting macro and femto network, a resource allocation scheme would aim to maximize the area spectral efficiency (ASE) subject to constraints on the radio resources per transmission interval accessible by each femtocell. An optimal resource allocation scheme for completely decentralized deployments leads however to a nonconvex optimization problem. In this paper, a filled function method is employed to find the global maximum of the optimization problem. Simulation results show that our proposed method is efficient and effective

Partially-Distributed Resource Allocation in Small-Cell Networks

We propose a four-stage hierarchical resource allocation scheme for the downlink of a large-scale small-cell network in the context of orthogonal frequency-division multiple access (OFDMA). Since interference limits the capabilities of such networks, resource allocation and interference management are crucial. However, obtaining the globally optimum resource allocation is exponentially complex and mathematically intractable. Here, we develop a partially decentralized algorithm to obtain an effective solution. The three major advantages of our work are: 1) as opposed to a fixed resource allocation, we consider load demand at each access point (AP) when allocating spectrum; 2) to prevent overloaded APs, our scheme is dynamic in the sense that as the users move from one AP to the other, so do the allocated resources, if necessary, and such considerations generally result in huge computational complexity, which brings us to the third advantage: 3) we tackle complexity by introducing a hierarchical scheme comprising four phases: user association, load estimation, interference management via graph coloring, and scheduling. We provide mathematical analysis for the first three steps modeling the user and AP locations as Poisson point processes. Finally, we provide results of numerical simulations to illustrate the efficacy of our scheme.Comment: Accepted on May 15, 2014 for publication in the IEEE Transactions on Wireless Communication

Power adjustment and scheduling in OFDMA femtocell networks

Densely-deployed femtocell networks are used to enhance wireless coverage in public spaces like office buildings, subways, and academic buildings. These networks can increase throughput for users, but edge users can suffer from co-channel interference, leading to service outages. This paper introduces a distributed algorithm for network configuration, called Radius Reduction and Scheduling (RRS), to improve the performance and fairness of the network. RRS determines cell sizes using a Voronoi-Laguerre framework, then schedules users using a scheduling algorithm that includes vacancy requests to increase fairness in dense femtocell networks. We prove that our algorithm always terminate in a finite time, producing a configuration that guarantees user or area coverage. Simulation results show a decrease in outage probability of up to 50%, as well as an increase in Jain's fairness index of almost 200%

Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks

In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a novel approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing work which assumes that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as a coalition formation game with overlapping coalitions. In this game, each small cell base station can choose to participate in one or more cooperative groups (or coalitions) simultaneously, so as to optimize the tradeoff between the benefits and costs associated with cooperation. We study the properties of the proposed overlapping coalition formation game and we show that it exhibits negative externalities due to interference. Then, we propose a novel decentralized algorithm that allows the small cell base stations to interact and self-organize into a stable overlapping coalitional structure. Simulation results show that the proposed algorithm results in a notable performance advantage in terms of the total system sum-rate, relative to the noncooperative case and the classical algorithms for coalitional games with non-overlapping coalitions