Queueing models for cognitive wireless networks with sensing time of secondary users

Phung-Duc, Tuan; Akutsu, Kohei; Kawanishi, Ken’ichi; Salameh, Osama; Wittevrongel, Sabine

doi:10.1007/s10479-021-04118-9

Cited by 15 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Akutsu and Phung-Duc [8] examine a closely related Markovian model in which secondary customers first sense the channels before occupying them. The stability condition is conjectured and verified by simulation in [8] and further proved using a Lyapunov function approach [9]. Salameh et al [10,11] consider models with a limited number of sensing secondary users.…”

Section: Introductionmentioning

confidence: 82%

See 1 more Smart Citation

Modified Erlang Loss System for Cognitive Wireless Networks

et al. 2022

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 82%

“…As a result, the system turns out to be a combination of a priority system and a retrial system. Under exponential assumptions, this system has been considered in the paper [9]. In this section, using previous notation and results, we extend the stability analysis to general service times distributions.…”

Section: A System With Class-2 Retrial Customersmentioning

confidence: 99%

Modified Erlang Loss System for Cognitive Wireless Networks

et al. 2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…When a data packet arrives at an overloaded node, a sizeable queuing delay is generated, and significantly affects the timely delivery of delay-sensitive services. Therefore, it is necessary to focus on a low-delay queuing strategy to guarantee meeting the delay requirements of different services [19].…”

Section: Low-delay Queuing Strategy Based On Service Prioritymentioning

confidence: 99%

A Clustering Routing Algorithm Based on Improved Ant Colony Optimization for an Urban Rail Transit Ad Hoc Network

Su,

Xiao,

Han

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

As traffic pressure increases, urban rail transit has attracted attention because of its high speed and growing capacity in recent years. However, the traditional vehicle–ground communication systems of urban rail transit have been unable to meet the increasing requirements for communication. In this paper, we introduce an ad hoc network for urban rail transit to improve communication reliability, reduce end-to-end latency, and improve throughput of vehicle–ground communication. A novel clustering algorithm based on improved ant colony optimization is presented, which integrates various variables to elect cluster heads and adopts a low-latency queuing strategy. In addition, the algorithm can also replace the cluster heads adaptively to optimize the communication quality. Through the simulation results, the proposed algorithm can reduce the packet loss rate by about 60%, reduce the delay by about 50%, and improve the throughput by about 40% compared with the classical clustering routing protocol.

show abstract

“…Customer's retrial phenomenon is common in various real-world systems, such as manufacturing systems, computer systems, wireless sensor networks, call centers, telecommunication networks, web access, switching networks, cognitive radio network, etc. [27,33,40,44,52]. Therefore, retrial queue analysis becomes a crucial problem in queueing theory.…”

Section: Introductionmentioning

confidence: 99%

“…However, non-preemptive priority allows higher priority customers to move to the front of the queue but must wait until the service of the lower priority customer is finished. Priority retrial queues have various applications, including real-time systems, operating systems, manufacturing systems, simulation and medical service systems, cognitive radio systems, and computer systems [22,40,46]. For a review of main results and methods, the reader is referred to [3, 6, 18-20, 28, 30-32, 36, 49, 51].…”

Section: Introductionmentioning

confidence: 99%

Lower and upper stochastic bounds for the joint stationary distribution of a non-preemptive priority retrial queueing system

HABLAL,

TOUCHE,

ALEM

et al. 2023

Hacettepe Journal of Mathematics and Statistics

View full text Add to dashboard Cite

Consider a single-server retrial queueing system with non-preemptive priority service, where customers arrive in a Poisson process with a rate of $\lambda_1$ for high-priority customers (class 1) and $\lambda_2$ for low-priority customers (class 2). If a high-priority customer is blocked, they are queued, while a low-priority customer must leave the service area and return after some random period of time to try again. In contrast with existing literature, we assume different service time distributions for the two customer classes. This investigation proposes a stochastic comparison method based on the general theory of stochastic orders to obtain lower and upper bounds for the joint stationary distribution of the number of customers at departure epochs in the considered model. Specifically, we discuss the stochastic monotonicity of the embedded Markov queue-length process in terms of both the usual stochastic and convex orders. We also perform a numerical sensitivity analysis to study the effect of the arrival rate of high-priority customers on system performance measures.

show abstract

Queueing models for cognitive wireless networks with sensing time of secondary users

Cited by 15 publications

References 31 publications

Modified Erlang Loss System for Cognitive Wireless Networks

Modified Erlang Loss System for Cognitive Wireless Networks

A Clustering Routing Algorithm Based on Improved Ant Colony Optimization for an Urban Rail Transit Ad Hoc Network

Lower and upper stochastic bounds for the joint stationary distribution of a non-preemptive priority retrial queueing system

Contact Info

Product

Resources

About