This paper investigates distributed algorithms for joint power allocation and user association in heterogeneous networks. We propose auction-based algorithms for offloading macrocell users (MUs) from the macrocell base station to privately owned small-cell access points (SCAs). We first propose a simultaneous multiple-round ascending auction (SMRA) for allocating MUs to SCAs. Taking into account the overheads incurred by SCAs during valuation in the SMRA, further improvements are proposed using techniques known as sub-optimal altered SMRA, the combinatorial auction with item bidding (CAIB), and its variations; the sequential CAIB and the repetitive CAIB. The proof for existence of the Walrasian equilibrium is demonstrated through establishing that the valuation function used by the SCAs is a gross substitute. Finally, we show that truthful bidding is individual rational for all of our proposed algorithms.
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Materials Science(all)