14,398 research outputs found

    A universal approach to coverage probability and throughput analysis for cellular networks

    No full text
    This paper proposes a novel tractable approach for accurately analyzing both the coverage probability and the achievable throughput of cellular networks. Specifically, we derive a new procedure referred to as the equivalent uniformdensity plane-entity (EUDPE)method for evaluating the other-cell interference. Furthermore, we demonstrate that our EUDPE method provides a universal and effective means to carry out the lower bound analysis of both the coverage probability and the average throughput for various base-station distribution models that can be found in practice, including the stochastic Poisson point process (PPP) model, a uniformly and randomly distributed model, and a deterministic grid-based model. The lower bounds of coverage probability and average throughput calculated by our proposed method agree with the simulated coverage probability and average throughput results and those obtained by the existing PPP-based analysis, if not better. Moreover, based on our new definition of cell edge boundary, we show that the cellular topology with randomly distributed base stations (BSs) only tends toward the Voronoi tessellation when the path-loss exponent is sufficiently high, which reveals the limitation of this popular network topology

    A Universal Approach to Coverage Probability and Throughput Analysis for Cellular Networks

    Full text link

    Scalable RAN Virtualization in Multi-Tenant LTE-A Heterogeneous Networks (Extended version)

    Full text link
    Cellular communications are evolving to facilitate the current and expected increasing needs of Quality of Service (QoS), high data rates and diversity of offered services. Towards this direction, Radio Access Network (RAN) virtualization aims at providing solutions of mapping virtual network elements onto radio resources of the existing physical network. This paper proposes the Resources nEgotiation for NEtwork Virtualization (RENEV) algorithm, suitable for application in Heterogeneous Networks (HetNets) in Long Term Evolution-Advanced (LTE-A) environments, consisting of a macro evolved NodeB (eNB) overlaid with small cells. By exploiting Radio Resource Management (RRM) principles, RENEV achieves slicing and on demand delivery of resources. Leveraging the multi-tenancy approach, radio resources are transferred in terms of physical radio Resource Blocks (RBs) among multiple heterogeneous base stations, interconnected via the X2 interface. The main target is to deal with traffic variations in geographical dimension. All signaling design considerations under the current Third Generation Partnership Project (3GPP) LTE-A architecture are also investigated. Analytical studies and simulation experiments are conducted to evaluate RENEV in terms of network's throughput as well as its additional signaling overhead. Moreover we show that RENEV can be applied independently on top of already proposed schemes for RAN virtualization to improve their performance. The results indicate that significant merits are achieved both from network's and users' perspective as well as that it is a scalable solution for different number of small cells.Comment: 40 pages (including Appendices), Accepted for publication in the IEEE Transactions on Vehicular Technolog
    • …
    corecore