A traffic model and analysis for cellular mobile radio telephone systems with handoff are described. Three schemes for call traffic handling are considered. One is nonprioritized and two are priority oriented. Fixed channel assignment is considered. In the nonprioritized scheme the base stations make no distinction between new call attempts and handoff attempts. Attempts which find all channels occupied are cleared. In the first priority scheme considered, a fixed number of channels in each cell are reserved exclusively for handoff calls. The second priority scheme employs a similar channel assignment strategy, but, additionally, the queueing of handoff attempts is allowed. Appropriate analytical models and criteria are developed and used to derive performance characteristics. These show, for example, blocking probability, forced termination probability, and fraction of new calls not completed, as functions of pertinent system parameters. General formulas are given and specific numerical results for nominal system parameters are presented.

Comments on "Teletraffic model and performance analysis for cellular mobile radio telephone systems with prioritized and nonprioritized handoff procedures"

This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed/centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.

Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey

For small cell technology to significantly increase the capacity of tower-based cellular networks, mobile users will need to be actively pushed onto the more lightly loaded tiers (corresponding to, e.g., pico and femtocells), even if they offer a lower instantaneous SINR than the macrocell base station (BS). Optimizing a function of the long-term rate for each user requires (in general) a massive utility maximization problem over all the SINRs and BS loads. On the other hand, an actual implementation will likely resort to a simple biasing approach where a BS in tier j is treated as having its SINR multiplied by a factor Aj ≥ 1, which makes it appear more attractive than the heavily-loaded macrocell. This paper bridges the gap between these approaches through several physical relaxations of the network-wide association problem, whose solution is NP hard. We provide a low-complexity distributed algorithm that converges to a near-optimal solution with a theoretical performance guarantee, and we observe that simple per-tier biasing loses surprisingly little, if the bias values Aj are chosen carefully. Numerical results show a large (3.5x) throughput gain for cell-edge users and a 2x rate gain for median users relative to a maximizing received power association.

User Association for Load Balancing in Heterogeneous Cellular Networks

For small cell technology to significantly increase the capacity of tower-based cellular networks, mobile users will need to be actively pushed onto the more lightly loaded tiers (corresponding to, e.g., pico and femtocells), even if they offer a lower instantaneous SINR than the macrocell base station (BS). Optimizing a function of the long-term rates for each user requires (in general) a massive utility maximization problem over all the SINRs and BS loads. On the other hand, an actual implementation will likely resort to a simple biasing approach where a BS in tier j is treated as having its SINR multiplied by a factor A_j>=1, which makes it appear more attractive than the heavily-loaded macrocell. This paper bridges the gap between these approaches through several physical relaxations of the network-wide optimal association problem, whose solution is NP hard. We provide a low-complexity distributed algorithm that converges to a near-optimal solution with a theoretical performance guarantee, and we observe that simple per-tier biasing loses surprisingly little, if the bias values A_j are chosen carefully. Numerical results show a large (3.5x) throughput gain for cell-edge users and a 2x rate gain for median users relative to a max received power association.

Traffic Model and Performance Analysis for Cellular Mobile Radio Telphone Systems with Prioritized and Non-Prioritized Handoff Procedures.

This paper considers the problem of channel assignment in mobile communication systems, where the service area is divided in hexagonal cells. In particular, a Hybrid Channel Assignment Scheme is studied and certain results are obtained using GPSS simulation of a model 40-cell system.

N. Georganas

Papers

A Hybrid Channel Assignment Scheme in Large-Scale, Cellular-Structured Mobile Communication Systems