Abstract
This work proposes a distributed resource allocation (RA) algorithm for packet bit-interleaved coded OFDM transmissions in the uplink of heterogeneous networks (HetNets), characterized by small cells deployed over a macrocell area and sharing the same band. Every user allocates its transmission resources, i.e., bits per active subcarrier, coding rate, and power per subcarrier, to minimize the power consumption while both guaranteeing a target quality of service (QoS) and accounting for the interference inflicted by other users transmitting over the same band. The QoS consists of the number of information bits delivered in error-free packets per unit of time, or goodput (GP), estimated at the transmitter by resorting to an efficient effective SNR mapping technique. First, the RA problem is solved in the point-to-point case, thus deriving an approximate yet accurate closed-form expression for the power allocation (PA). Then, the interference-limited HetNet case is examined, where the RA problem is described as a non-cooperative game, providing a solution in terms of generalized Nash equilibrium. Thanks to the closed-form of the PA, the solution analysis is based on the best response concept. Hence, sufficient conditions for existence and uniqueness of the solution are analytically derived, along with a distributed algorithm capable of reaching the game equilibrium.
Highlights
Future wireless networks are required to offer extremely enhanced capabilities including very high achievable data rates, very low latency, ultra-high reliability, and the possibility to handle very high density of devices [1]
Worth to be cited are [15, 16], where the energy-efficient power control (PC) problem for wireless data and code division multiple access (CDMA) networks is addressed, respectively, [17, 18], wherein the NCG framework is exploited to tackle the distributed power allocation (PA) problem for EE maximization in orthogonal frequency division multiplexing (OFDM) channels and multiple-input multipleoutput (MIMO) heterogeneous networks (HetNets), respectively, whereas in [19] the issue of dynamic resource allocation (RA) is investigated in the context of multi-user cognitive networks, by exploiting a NCG for signal waveform design combined with sparsity constraints
After bit-interleaving, the coded binary symbols (CBS) are Gray-mapped into Sk complex-valued symbols, which are transmitted through a frame of Lk
Summary
Future wireless networks are required to offer extremely enhanced capabilities including very high achievable data rates, very low latency, ultra-high reliability, and the possibility to handle very high density of devices [1]. Worth to be cited are [15, 16], where the energy-efficient PC problem for wireless data and code division multiple access (CDMA) networks is addressed, respectively, [17, 18], wherein the NCG framework is exploited to tackle the distributed PA problem for EE maximization in OFDM channels and MIMO HetNets, respectively, whereas in [19] the issue of dynamic RA is investigated in the context of multi-user cognitive networks, by exploiting a NCG for signal waveform design combined with sparsity constraints. The RA is evaluated by means of a non-cooperative game that provides a joint optimization of channel allocation, power control, and precoding of the D2D users, by maximizing the sum-rate of the cellular uplink network. Users within the same cell, either MC or SC, transmits over orthogonal frequencies according
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
