23 June 2021 in IEEE Transactions on Network and Service Management
Cellular network design must incorporate disaster response and repair scenarios. Requirements for high reliability and low latency often fail to incorporate network survivability for mission critical services. This paper defines a practical modelling approach using a Markov chain Matrix Exponential (ME) model. Transient and the steady state representations of system repair models, namely, fast and slow (i.e., crew-based) repairs for networks consisting of a multiple repair crews have been analyzed. Failures are exponentially modeled as per common practice, but ME distributions describe the more complex recovery processes. The model used in this paper is evaluated for varying number of repair crews, base stations, repair models and squared coefficient of variation values. This model is scalable for larger networks, calculates the restoration and network availability times, consists of asymptotic approximations to estimate network availability and determines the optimal number repair crews required. This ME model shows how survivable networks can be designed based on controlling numbers of crews, times taken for individual repair stages in the repair process, and the balance between fast and slow repairs.
5 March 2020 in IEEE Transactions on Vehicular Technology
We propose partial packet duplication; when cellular dual connectivity is available we propose to duplicate only some portion of the time as needed. This satisfies reliability constraints defined as (1) the probability of fades staying shorter than a certain duration and (2) the probability of non-fades (i.e., time back above the SINR threshold) lasting longer than a certain duration. Fade durations and non-fade durations have been estimated in the literature to fit exponential distributions. We also choose exponential random variables to control duplication processes, which allows Markov chain modeling of the entire process. Using matrix exponential distribution formulations of the Markov chain in the context of partial packet duplication, we fully describe the partial packet duplication behavior, examine asymptotic performance, and define ranges of duplication parameters that meet both fade and non-fade duration constraints. Then we choose the best parameters that minimize resources used on the secondary link for packet duplication.