Performance Simulation of Finite-Source Cognitive Radio Networks with Servers Subjects to Breakdowns and Repairs

• Published in: Journal of mathematical sciences (New York, N.Y.) Vol. 237; no. 5; pp. 702 - 711
• Main Authors: Nemouchi, H., Sztrik, J.
• Format: Journal Article
• Language: English
• Published: New York Springer US 04.03.2019; Springer; Springer Nature B.V
• Subjects: Analysis; Breakdown; Breakdowns; Cognitive radio; Computer simulation; Maintenance; Mathematics; Mathematics and Statistics; Performance evaluation; Preempting; Queues; Queuing theory; Response time; Servers; Servers (Computers)
• DOI: 10.1007/s10958-019-04196-y
• ISSN: 1072-3374

The present paper deals with the performance evaluation of a cognitive radio network with the help of a queueing model. The queueing system contains two interconnected, not independent sub-systems. The first part is for the requests of the Primary Units (PU). The number of sources is finite, and each source generates high priority requests after a exponentially distributed time. The requests are sent to a single server unit or Primary Channel Service (PCS) with a preemptive priority queue. The service times are assumed to be exponentially distributed. The second sub-system is for the requests of the Secondary Units (SU), which is finite sources system too; the inter-request times and service times of the single server unit or Secondary system Channel Service (SCS) are assumed to be exponentially distributed, respectively. A generated high priority packet goes to the primary service unit. If the unit is idle, the service of the packet begins immediately. If the server is busy with a high priority request, the packet joins the preemptive priority queue. When the unit is engaged with a request from SUs, the service is interrupted and the interrupted low priority task is sent back to the SCS. Depending on the state of the secondary channel, the interrupted job is directed to either the server or the orbit. In case the requests from SUs find the SCS idle, the service starts, and if the SCS is busy, the packet looks for the PCS. In the case of an idle PCS, the service of the low-priority packet begins at the high-priority channel (PCS). If the PCS is busy, the packet goes to the orbit. From the orbit it retries to be served after an exponentially distributed time. The novelty of our investigation is that each server is subject to random breakdowns, in which case the interrupted request is sent to the queue or orbit, respectively. The operating and repair times of the servers are assumed to be generally distributed. Finally, all the random times included in the model construction are assumed to be independent of each other. The main aim of the paper is to analyze the effect of the nonreliability of the servers on the mean and variance of the response time for the SUs by using simulation.