214 research outputs found

    Spatial SINR Games of Base Station Placement and Mobile Association

    Full text link
    We study the question of determining locations of base stations that may belong to the same or to competing service providers. We take into account the impact of these decisions on the behavior of intelligent mobile terminals who can connect to the base station that offers the best utility. The signal to interference and noise ratio is used as the quantity that determines the association. We first study the SINR association-game: we determine the cells corresponding to each base stations, i.e., the locations at which mobile terminals prefer to connect to a given base station than to others. We make some surprising observations: (i) displacing a base station a little in one direction may result in a displacement of the boundary of the corresponding cell to the opposite direction; (ii) A cell corresponding to a BS may be the union of disconnected sub-cells. We then study the hierarchical equilibrium in the combined BS location and mobile association problem: we determine where to locate the BSs so as to maximize the revenues obtained at the induced SINR mobile association game. We consider the cases of single frequency band and two frequency bands of operation. Finally, we also consider hierarchical equilibria in two frequency systems with successive interference cancellation

    Green Base Station Placement for Microwave Backhaul Links

    Get PDF
    Wireless mobile backhaul networks have been proposed as a substitute in cases in which wired alternatives are not available due to economical or geographical reasons. In this work, we study the location problem of base stations in a given region where mobile terminals are distributed according to a certain probability density function and the base stations communicate through microwave backhaul links. Using results of optimal transport theory, we provide the optimal asymptotic distribution of base stations in the considered setting by minimizing the total power over the whole network.Comment: Proceedings of the International Symposium on Ubiquitous Networking (UNet'17), May 2017, Casablanca, Morocc

    Optimal Base Station Placement: A Stochastic Method Using Interference Gradient In Downlink Case

    Get PDF
    In this paper, we study the optimal placement and optimal number of base stations added to an existing wireless data network through the interference gradient method. This proposed method considers a sub-region of the existing wireless data network, hereafter called region of interest. In this region, the provider wants to increase the network coverage and the users throughput. In this aim, the provider needs to determine the optimal number of base stations to be added and their optimal placement. The proposed approach is based on the Delaunay triangulation of the region of interest and the gradient descent method in each triangle to compute the minimum interference locations. We quantify the increase of coverage and throughput.Comment: This work has been presented in the 5th International ICST Conference on Performance Evaluation Methodologies and Tools (Valuetools 2011

    Spatial games and global optimization for the mobile association problem: the downlink case

    No full text
    International audienceWe study the mobile association problem: we determine the cells corresponding to each base station, i.e, the locations at which intelligent mobile terminals prefer to connect to a given base station rather than to others. This paper proposes a new approach based on optimal transport theory to characterize the solution based on previous works on fluid approximations. We are able to characterize the global optimal solution, as well as the user optimal solution, for the downlink case problem

    Planning for Small Cells in a Cellular Network

    Get PDF
    In this thesis, we analyze the effect of deploying small cells on the performance of a network comprising several macro cells. We identify potential locations for low-power base-stations based on the coverage patterns of the macro cells and propose three schemes for placing the small cells. We show that by judiciously installing just two small cells for every macro base-station at these locations and allocating separate resources to all the small cells on a global level, we can increase the performance of the network significantly (~ 45%). An added benefit of our schemes is that we can switch o the macro base-stations at night (when the number of active users is low) and significantly reduce their operation cost.4 month
    corecore