Source-linked AI summary
Towards Understanding the Fundamentals of Mobility in Cellular Networks
Xingqin Lin, Radha Krishna Ganti, Philip Fleming, Jeffrey G. Andrews
TL;DR
Analytical study of mobility in cellular networks is difficult despite its importance for increasingly small and irregular cells. The paper proposes a tractable infinite-plane RWP model, compares it with classical and trace-derived mobility models, and analyzes handover rate and sojourn time under hexagonal and Poisson-Voronoi base-station models. The proposed model better matches the comparison mobility traces, while Poisson-Voronoi evaluation is about as accurate as hexagonal evaluation but predicts higher handover rates and lower sojourn times.
Problem
Analytical understanding of how mobility affects cellular-network handover rate and sojourn time remains difficult, although these metrics matter for mobility management and signaling overhead.
Method
The paper proposes a tractable RWP mobility model on the entire plane, compares it with classical RWP and synthetic truncated Levy walk models, and applies it to hexagonal and Poisson-Voronoi cellular networks.
Results
The proposed model better matches Levy-walk transition lengths than classical RWP, while Poisson-Voronoi mobility evaluation is about as accurate as hexagonal evaluation but predicts higher handover rates and lower sojourn times.
Takeaways & Limitations
The model provides analytical expressions and bounds for handover rate and sojourn time to support mobility analysis and network design.
Takeaways & Limitations
The proposed RWP model does not capture some temporal and spatial dependencies of mobility patterns and does not fully represent human walks.
Abstract
from arXiv · showhide
Despite the central role of mobility in wireless networks, analytical study on its impact on network performance is notoriously difficult. This paper aims to address this gap by proposing a random waypoint (RWP) mobility model defined on the entire plane and applying it to analyze two key cellular network parameters: handover rate and sojourn time. We first analyze the stochastic properties of the proposed model and compare it to two other models: the classical RWP mobility model and a synthetic truncated Levy walk model which is constructed from real mobility trajectories. The comparison shows that the proposed RWP mobility model is more appropriate for the mobility simulation in emerging cellular networks, which have ever-smaller cells. Then we apply the proposed model to cellular networks under both deterministic (hexagonal) and random (Poisson) base station (BS) models. We present analytic expressions for both handover rate and sojourn time, which have the expected property that the handover rate is proportional to the square root of BS density. Compared to an actual BS distribution, we find that the Poisson-Voronoi model is about as accurate in terms of mobility evaluation as hexagonal model, though being more pessimistic in that it predicts a higher handover rate and lower sojourn time.
I. INTRODUCTION
Mobility management becomes more important as cellular cells shrink and become irregular, motivating a tractable RWP model defined on the entire plane. The paper compares this model with classical and trace-derived alternatives and applies it to hexagonal and Poisson-Voronoi cellular networks.
- Motivation: Smaller, more irregular cells increase the importance and complexity of mobility management in emerging cellular networks.Handover rate and sojourn time matter because they affect signaling overhead, service duration, and cell-association tradeoffs.
- Proposed approach: The proposed RWP model selects a uniform random direction, a random transition length, and a random velocity at each waypoint on the entire plane.It may also include a random pause time at each waypoint.
- Cellular-network analysis: The paper derives analytical results for handover rate and sojourn time under both deterministic hexagonal and random Poisson-Voronoi base-station models.These models span highly regular and highly random base-station deployments, while actual deployments lie between them.
- Proposed approach: The model uses a Rayleigh transition-length distribution whose parameter λ controls mobility patterns: larger λ produces shorter transitions and more frequent direction changes.Different λ values can represent patterns ranging from walking and shopping to driving on highways.
B. Transition time
Transition time is modeled as the movement time between successive waypoints, T = L/V, and its distribution follows from the transition-length and velocity distributions. The section also relates period time to pause time and transition time for direction-switch analysis.
- Definition: Transition time T is the time spent moving between successive waypoints and is defined by T = L/V.Here L is transition length and V is random velocity.
- Distribution: The paper gives the cumulative distribution function of T for any velocity distribution.This is stated as Proposition 1.
- Distribution: Closed-form transition-time probability densities are provided for constant velocity and uniformly distributed velocity on [vmin, vmax].These are the two velocity cases covered by Corollary 1.
- Mean transition time: For uniformly distributed velocity, vmin > 0 is required to ensure finite expected transition time.The lower velocity bound is therefore an explicit condition for a finite mean.
- Direction switch rate: Period time is Tp = T + S, and the direction-switch rate is its inverse, D = 1/Tp.S denotes the random pause time at a waypoint.
D. Spatial node distribution
The proposed model characterizes spatial node distributions during waypoint transitions, with pause times represented by combining moving and waypoint-location distributions. Simulations compare the model with classical RWP and truncated Levy walk mobility models.
- Spatial distribution: Theorem 1 characterizes the spatial node distribution between successive waypoints when pause times are zero.The distribution is represented by the pdf f(r, θ), assuming X0 is at the origin.
- Spatial distribution: The probability of residing in a small area is approximated by the area multiplied by the spatial density f(r, θ).The density also represents expected transition-time proportion per unit area.
- Spatial distribution with pauses: With random pause times, the spatial pdf is a weighted superposition of the moving-node distribution and the waypoint-location distribution.The weights are p and 1−p, where p is the expected proportion of time spent moving.
- Model comparison: The proposed RWP model matches truncated Levy walk transition lengths better than classical RWP, especially at low transition lengths, but lacks its heavy tail.The high-length mismatch diminishes as α increases.
- Model comparison: The proposed and Levy walk models have almost indistinguishable direction switch rates, whereas classical RWP has much lower rates.The comparison uses identical power-law pause-time distributions for the two RWP models and the Levy walk model.
- Model limitations: The proposed model does not claim to fully represent human walks, whose temporal and spatial correlations remain complex and incompletely understood.The authors state that none of the existing mobility models can fully represent human walks.
IV. APPLICATIONS TO HEXAGONAL MODELED CELLULAR NETWORKS
Using the proposed RWP model, the paper derives approximate and exact handover-rate results for hexagonal cellular networks. The rate scales with cell size and velocity, while the approximation closely captures the analytic behavior but can underestimate handovers.
- Handover-rate formulation: Handover rate is defined as expected handovers per movement period divided by expected movement-period time.The definition is H = E[N]/E[Tp].
- Approximation: The proposed approximation replaces neighboring hexagonal layers with rings, enabling closed-form results and bounds for expected handovers.The approximation uses inner and outer radii for each neighboring layer.
- Approximation: The upper–lower bound difference ΔNapp(λd2) increases with λd2 and remains within the range (0, 1).It approaches 0 as λd2 →∞ and 1 as λd2 →0.
- Asymptotic behavior: Under asymptotic conditions including d →0 or λd2 →0, the approximate handover rate admits a simplified expression.The paper also compares this asymptotic result with exact hexagonal-model analysis.
- Scaling and validation: Handover rate is inversely proportional to the square root of hexagonal cell size; quadrupling BS density roughly doubles the rate.Velocity and cell size affect handover rate in a trade-off, while λ does not play a role in the stated result.
- Scaling and validation: The exact analytic result closely matches simulation, whereas the approximation tends to underestimate the actual number of handovers.The comparison uses the hexagonal model with constant velocity and no pause time.
B. Sojourn Time
The paper analyzes sojourn time for the simplified constant-velocity RWP model and derives bounds plus asymptotic behavior. Sojourn time decreases with velocity and cell size, and vanishes as cells become small.
- Definition and setup: Sojourn time is the expected duration a mobile node remains within a serving cell.The section considers constant velocity and no pause time.
- Definition and setup: The analysis focuses on the cell where the connection is initiated during one movement period.The mobile node is assumed co-located with its associated BS at the origin.
- Bounds: No closed-form result is available for the general sojourn-time expression, but numerical evaluation and explicit lower and upper bounds are provided.The bounds are stated in Proposition 5.
- Small-cell behavior: As d →0, sojourn time tends to 0 when E[T] is finite.The paper notes that small-cell networks therefore require fast handover algorithms or alternative handover strategies.
- Asymptotic behavior: As λ →0, sojourn time satisfies ST ∼ αd/ν, where α ∈ (0, 1) is a constant.This result is stated for constant velocity V ≡ν.
- Scaling behavior: Sojourn time is inversely proportional to velocity and proportional to the square root of hexagonal cell size.This contrasts with the asymptotic scaling reported for handover rate.
V. APPLICATIONS TO POISSON-VORONOI MODELED CELLULAR NETWORKS
The Poisson-Voronoi cellular model represents base stations as points of a homogeneous Poisson process, with each base station serving its nearest-association Voronoi cell.
- Poisson-Voronoi model: A Voronoi cell contains the locations closer to its nucleus than to any other point in the point set.The cell is defined through Euclidean-distance comparison.
- Poisson-Voronoi model: A spatial point process is represented as a sum of Dirac measures at its nuclei.The associated Voronoi cells form the Poisson-Voronoi tessellation.
- Cellular interpretation: In the cellular interpretation, base stations are nuclei of a Poisson point process, and users are served within their Voronoi cells.This corresponds to nearest base-station association.
A. Handover Rate
The paper derives handover and sojourn-time results for Poisson-Voronoi cellular networks and compares them with hexagonal models and simulations. Handover rate scales with BS intensity, while Poisson-Voronoi sojourn times are more conservative than hexagonal estimates.
- Handover-rate analysis: The expected number of handovers is obtained by counting intersections between a waypoint segment and Poisson-Voronoi cell boundaries.The expectation averages over the next waypoint’s spatial distribution and the tessellation.
- Handover-rate scaling: The handover rate is inversely proportional to the square root of cell size, consistent with the hexagonal model.
- Handover-rate validation: The analytical Poisson-Voronoi handover result matches simulation closely, and all compared handover rates grow linearly with the square root of BS intensity.
- Handover-rate validation: For a real macro-BS deployment, the Poisson-Voronoi model is about as accurate as the hexagonal model, while the approximate analytic result underestimates handovers.
- Sojourn-time analysis: Poisson-Voronoi sojourn-time analysis requires the distribution of tessellation-induced randomness rather than only the deterministic expression used for hexagonal cells.
- Sojourn-time comparison: The Poisson-Voronoi sojourn-time result is more conservative, yielding smaller mean sojourn times than the hexagonal model, whose bounds are tight.
VI. CONCLUSIONS AND FUTURE WORK
The paper develops a tractable plane-wide RWP model and applies it to handover rate and sojourn time under hexagonal and Poisson-Voronoi BS models. Its future work centers on adding richer mobility dependencies without losing tractability.
- Conclusions: The proposed plane-wide RWP model supports analytical handover-rate and sojourn-time results for both hexagonal and Poisson-Voronoi cellular networks.
- Conclusions: The Poisson-Voronoi model gives smaller sojourn times than the hexagonal model, while the hexagonal model’s upper and lower bounds are tight.
- Future work: The proposed mobility model simplifies real movement and does not capture temporal or spatial dependency in mobility patterns.
APPENDIX
The appendix derives spatial and transition-related distributions for the proposed RWP model and uses them to obtain handover approximations and bounds. The derivations rely on waypoint densities, transition geometry, and monotonicity arguments.
- Waypoint distribution: The random waypoint X1 is represented in polar coordinates, and its probability density is summarized in Lemma 1.
- Spatial distribution: The spatial node distribution is derived from the expected proportion of transition time spent in a small area.
- Spatial distribution: The derivation uses independence between velocity and waypoints when evaluating the spatial distribution.
- Handover bounds: Handover approximations and lower bounds are developed from the waypoint density and a parameterization involving t = 3λd^2.
- Handover bounds: The difference between the approximation bounds is analyzed through a function shown to be strictly decreasing for t > 0.
C. Proof of Proposition 4
The proof applies a Buffon’s-needle-style argument to calculate the probability that a moving node crosses a cell boundary during a short time interval.
- Boundary-crossing probability: A node crossing probability is obtained from boundary length, region area, velocity, time interval, and the expected absolute sine of its uniformly distributed direction.
D. Proof of Proposition 6
The proof applies a general expression for sojourn time using constants over a specified region, the mean waypoint time, and the mean value theorem. It then evaluates a small-λ limit and derives strict bounds on α.
- Proof setup: The proof applies the general expression (26) for ST over a region parameterized by constants (ξx, ξy).The constants lie in the specified region A.
- Proof setup: E[T] = 1 is used in the final equality together with the mean value theorem for integrals.
- Limit evaluation: limλ→0 ST is evaluated using the constant-velocity result for λ and the mean value theorem.
- Conclusion: The proof concludes that α lies within strict bounds derived from the resulting inequalities.
E. Proof of Proposition 7
The proof reduces Poisson-Voronoi handovers along a waypoint path to a one-dimensional sectional tessellation. It characterizes the sectional facets and their intensity, then computes expected handovers using geometric and Poisson-Voronoi identities.
- Geometric setup: The proof introduces centroids for Voronoi facets and uses their translation covariance to organize the geometric argument.
- Sectional tessellation: Intersecting the Poisson-Voronoi tessellation with a fixed line produces a tessellation of that line by nonempty sectional cells.The sectional cells have disjoint relative interiors and cover the line.
- Sectional tessellation: Intersections of Voronoi boundaries with the line form the 0-facets of the sectional tessellation when nonempty.
- Facet intensity: The intensity of sectional 0-facets is defined through an indicator over configurations and centroids in arbitrary Borel subsets of the line.
- Handover calculation: Conditioning on the next waypoint, the expected number of handovers is computed along the interval joining the current and next waypoints.
- Handover calculation: The calculation uses the chosen boundary centroids, a Poisson-Voronoi sectional intensity, Lemma 1, and an additional stated identity before substituting E[T].