Modified Erlang Loss System for Cognitive Wireless Networks

Abstract

This paper considers a modified Erlang loss system for cognitive wireless networks and related applications. A primary user has pre-emptive priority over secondary users, and the primary customer is lost if upon arrival all the channels are used by other primary users. Secondary users cognitively use idle channels, and they can stay (either in an infinite buffer or in an orbit) in cases where idle channels are not available upon arrival or they are interrupted by primary users. While the infinite buffer model represents the case with zero sensing time, the infinite orbit model represents the case with positive sensing time. We obtain an explicit stability condition for the cases where arrival processes of primary users and secondary users follow Poisson processes, and their service times follow two distinct arbitrary distributions. The stability condition is insensitive to the service time distributions and implies the maximal throughout of secondary users. Moreover, we extend the stability analysis to the system with outgoing calls. For a special case of exponential service time distributions, we analyze the buffered system in depth to show the effect of parameters on the delay performance and the mean number of interruptions of secondary users. Our simulations for distributions rather than exponential reveal that the mean number of terminations for secondary users is less sensitive to the service time distribution of primary users.

Stability condition of multiclass classical retrials: a revised regenerative proof

“…where 𝐿 is a constant. (For details see formulas ( 21)-(25) in the paper [13].) This implies that, under assumption (3.6), lim…”

“…Moreover, the approach used in this paper has a promising potential to analyse stability condition of a multiserver multicalss system in which the service times are both class-and server-dependent. In particular, it is demonstrated in a recent paper [13] where the stability analysis of a retrial system (a modified Erlang system) with two classes of customers and 𝑐 identical servers has been performed by means of the same approach.…”