Energy-Efficient Heterogeneous Cellular Networks with Spectrum Underlay and Overlay Access

In this paper, we provide joint subcarrier assignment and power allocation schemes for quality-of-service (QoS)-constrained energy-efficiency (EE) optimization in the downlink of an orthogonal frequency division multiple access (OFDMA)-based two-tier heterogeneous cellular network (HCN). Considering underlay transmission, where spectrum-efficiency (SE) is fully exploited, the EE solution involves tackling a complex mixed-combinatorial and non-convex optimization problem. With appropriate decomposition of the original problem and leveraging on the quasi-concavity of the EE function, we propose a dual-layer resource allocation approach and provide a complete solution using difference-of-two-concave-functions approximation, successive convex approximation, and gradient-search methods. On the other hand, the inherent inter-tier interference from spectrum underlay access may degrade EE particularly under dense small-cell deployment and large bandwidth utilization. We therefore develop a novel resource allocation approach based on the concepts of spectrum overlay access and resource efficiency (RE) (normalized EE-SE trade-off). Specifically, the optimization procedure is separated in this case such that the macro-cell optimal RE and corresponding bandwidth is first determined, then the EE of small-cells utilizing the remaining spectrum is maximized. Simulation results confirm the theoretical findings and demonstrate that the proposed resource allocation schemes can approach the optimal EE with each strategy being superior under certain system settings

Spectrum Auction Design

Spectrum auctions are used by governments to assign and price licenses for wireless communications. The standard approach is the simultaneous ascending auction, in which many related lots are auctioned simultaneously in a sequence of rounds. I analyze the strengths and weaknesses of the approach with examples from US spectrum auctions. I then present a variation, the package clock auction, adopted by the UK, which addresses many of the problems of the simultaneous ascending auction while building on its strengths. The package clock auction is a simple dynamic auction in which bidders bid on packages of lots. Most importantly, the auction allows alternative technologies that require the spectrum to be organized in different ways to compete in a technology-neutral auction. In addition, the pricing rule and information policy are carefully tailored to mitigate gaming behavior. An activity rule based on revealed preference promotes price discovery throughout the clock stage of the auction. Truthful bidding is encouraged, which simplifies bidding and improves efficiency. Experimental tests and early auctions confirm the advantages of the approach.Auctions, spectrum auctions, market design, package auction, clock auction, combinatorial auction

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