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

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

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

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

Control and data channel resource allocation in OFDMA heterogeneous networks

This paper investigates the downlink resource allocation problem in Orthogonal Frequency Division Multiple Access (OFDMA) Heterogeneous Networks (HetNets) consisting of macro cells and small cells sharing the same frequency band. Dense deployment of small cells overlaid by a macro layer is considered to be one of the most promising solutions for providing hotspot coverage in future 5G networks. The focus is to devise an optimised policy for small cells’ access to the shared spectrum, in terms of their transmissions, in order to keep small cell served users sum data rate at high levels while ensuring that certain level of quality of service (QoS) for the macro cell users in the vicinity of small cells is provided. Both data and control channel constraints are considered, to ensure that not only the macro cell users’ data rate demands are met, but also a certain level of Bit Error Rate (BER) is ensured for the control channel information. Control channel reliability is especially important as it holds key information to successfully decode the data channel. The problem is addressed by our proposed linear binary integer programming heuristic algorithm which maximises the small cells utility while ensuring the macro users imposed constraints. To further reduce the computational complexity, we propose a progressive interference aware low complexity heuristic solution. Discussion is also presented for the implementation possibility of our proposed algorithms in a practical network. The performance of both the proposed algorithms is compared with the conventional Reuse-1 scheme under different fading conditions and small cell loads. Results show a negligible drop in small cell performance for our proposed schemes, as a trade-off for ensuring all macro users data rate demands, while Reuse-1 scheme can even lead up to 40 % outage when control region of the small cells in heavily loaded

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