skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Load Balancing in Small-Cell Access Point Placement
We address the uplink small-cell access point (AP) placement problem for optimal throughput, while considering load balancing (LB) among the APs. To consider LB and consequently incorporate fairness in user spectral access, i.e., the frequency of user-to-AP communications, we modify the Lloyd algorithm from vector quantization so that delays incurred by the existence of a large number of users in a cell are accounted for in the AP placement process. Accordingly, we present two methods, the first of which involves the incorporation of weights proportional to the cell occupancy, hence called the Occupancy Weighted Lloyd algorithm (OWLA). The second method adds a new step to the Lloyd algorithm, which involves re-assigning users from higher to lower occupancy cells, and the adoption of a distance threshold to cap the throughput lost in the assignment process. This formulated Lloyd-type algorithm is called the Cell Equalized Lloyd Algorithm-α (CELA-α) where α is a factor that allows for throughput and spectrum access delay trade-off. Extensive simulations show that both CELA-α and OWLA algorithms provide significant gains, in comparison to the standard Lloyd algorithm, in 95%-likely user spectral access. For the α values considered in this paper, CELA-α achieves gains up to 20.83%, while OWLA yields a gain of 12.5%. Both algorithms incur minimal throughput losses of different degrees, and the choice of using one algorithm over the other for AP placement depends on system LB as well as throughput requirements.  more » « less
Award ID(s):
2124929 2225617
PAR ID:
10524106
Author(s) / Creator(s):
; ;
Publisher / Repository:
IEEE
Date Published:
ISSN:
2577-2465
ISBN:
979-8-3503-1114-3
Page Range / eLocation ID:
1 to 5
Subject(s) / Keyword(s):
Base station placement, Beyond 5G, fairness, Lloyd algorithm, throughput optimization, user cell association
Format(s):
Medium: X
Location:
Florence, Italy
Sponsoring Org:
National Science Foundation
More Like this
  1. In this paper, we explore the small-cell uplink access point (AP) placement problem in the context of throughput optimality and provide solutions while taking into consideration inter-cell interference (ICI). First, we briefly review the vector quantization (VQ) approach and related single user throughput optimal formulations for AP placement. Then, we investigate the small-cell case with multiple users and expose the limitations of mean squared error based VQ for solving this problem. While the Lloyd algorithm from the VQ approach is found not to strictly solve the small-cell case, based on the tractability and quality of the resulting AP placement, we deem it suitable as a simple and appropriate framework to solve more complicated problems. Accordingly, to minimize ICI and consequently enhance achievable throughput, we design two Lloyd-type algorithms, namely the Interference Lloyd algorithm and the Inter-AP Lloyd algorithm, both of which incorporate ICI in their distortion functions. Simulation results show that both of the proposed algorithms provide superior 95%-likely rate over the traditional Lloyd algorithm and the Inter-AP Lloyd algorithm yields a significant increase of up to 36.34% in achievable rate over the Lloyd algorithm. 
    more » « less
  2. We investigate the multi-faceted access point (AP) placement problems in uplink small-cell and cell-free networks in the context of throughput-optimality and to what extent the popular Lloyd algorithm from vector quantization (VQ) is suited to solve them. We develop single user throughput optimization formulations and solutions related to VQ considering the small cell scenario, after which we expand the formulations to multiple users. For the cell-free scenario, we consider the mean throughput of all users and a max-min technique. We compare the rate performances of the AP placement solutions from both scenarios with the Lloyd algorithm. While the Lloyd algorithm is found not to strictly solve for small cell AP locations and its approach is divergent from the cell-free perspective, we conclude from numerical experiments that it is good enough for both scenarios. 
    more » « less
  3. We examine the problem of uplink cell-free access point (AP) placement in the context of optimal throughput. In this regard, we formulate two main placement problems, namely the sum rate and minimum rate maximization problems, and discuss the challenges associated with solving the underlying optimization problems with the help of some simple scenarios. As a practical solution to the AP placement problem, we suggest a vector quantization (VQ) approach. The suitability of the VQ approach to cell-free AP placement is investigated by examining three VQ-based solutions. First, the standard VQ approach, that is the Lloyd algorithm (using the squared error distortion function) is described. Second, the tree-structured VQ (TSVQ), which performs successive partitioning of the distribution space is applied. Third, a probability density function optimized VQ (PDFVQ) procedure is outlined, enabling efficient, low complexity, and scalable placement, and is aimed at a massive distributed multiple-input-multiple-output scenario. While the VQ-based solutions do not explicitly solve the cell-free AP placement problems, numerical experiments show that their sum and minimum rate performances are good enough, and offer a good starting point for gradient-based optimization methods. Among the VQ solutions, PDFVQ, with its distinct advantages, offers a good trade-off between sum and minimum rates. 
    more » « less
  4. We study a heterogeneous two-tier wireless sensor network in which N heterogeneous access points (APs) collect sensing data from densely distributed sensors and then forward the data to M heterogeneous fusion centers (FCs). This heterogeneous node deployment problem is modeled as a quantization problem with distortion defined as the total power consumption of the network. The necessary conditions of the optimal AP and FC node deployment are explored in this paper. We provide a variation of Voronoi diagrams as the optimal cell partition for this network, and show that each AP should be placed between its connected FC and the geometric center of its cell partition. In addition, we propose a heterogeneous two-tier Lloyd-like algorithm to optimize the node deployment. Simulation results show that our proposed algorithm outperforms the existing methods like Minimum Energy Routing, Agglomerative Clustering, and Divisive Clustering, on average. 
    more » « less
  5. Millimeter-wave communication is a highly promising technology to deliver multi-gigabit-per-second transmission rates for next-generation wireless LANs (WLANs). To achieve such ultra-high throughput performance in indoor scenarios, line-of-sight (LoS) connectivity becomes a critical requirement. Prior work has proposed access point (AP) mobility as an approach to improve LoS conditions and, thereby, approach optimum mmWave WLAN performance. In this work, we present a comprehensive simulation study of linear AP mobility that investigates various dimensions, including the number of mobile APs, the placement of the mobile AP platforms, and the length of the platforms. The results show how WLAN performance varies across these dimensions and also compares the results against a varying number of static APs to quantity the performance gains achievable from mobility. The results show that even 2 or 3 mobile APs can significantly outperform a much larger number of static APs and that deploying up to 3 mobile APs in a room brings substantial performance gains. 
    more » « less