Spatial–Temporal Queuing Theoretic Modeling of Opportunistic Multihop Wireless Networks With and Without Cooperation

Abstract

In this paper, we characterize the average end-toend delay in an opportunistic multi-hop secondary cognitive radio network overlaid with a primary multi-hop network. Nodes in both networks use random medium access control (MAC) scheme with exponentially distributed back-off. We first model the network as a two-class priority queuing network and use queuing-theoretic approximation techniques to obtain a set of relations involving the mean and second moments of the interarrival time and service time of packets at a secondary node. Then, applying these parameters to an equivalent open singleclass G/G/1-queuing network, we obtain expressions for the average end-to-end delay of a packet in the secondary network using a diffusion approximation. Next we extend the analysis to a case where secondary nodes cooperatively relay primary packets so as to improve their own transmission opportunities. The mathematical results are validated against extensive simulations.

Queue size estimation of nodes in a heterogeneous ocean network with multiple priority traffic

“…In the context of cognitive radio network, Das and Abouzeid (2015) analysed average end to end delay of a packet using a diffusion approach. Analysis of service time of packets, channel availability distributions, interruption periods, and a service-resume transmission are computed in Azarfar et al (2014).…”

Spectrum Handoffs Based on Preemptive Repeat Priority Queue in Cognitive Radio Networks

“…In this scheme, the SU must perform spectrum sensing at the beginning of each time slot and then transmits its data transmission in the rest of the slot only when the operating channel is detected to be idle. For simplicity, the spectrum sensing is supposed to be perfect without missed detections or false alarms as in [ 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 ]. Note that a channel can only be occupied by one user at any time.…”

“…In [ 15 ], the preemptive resume priority (PRP) M/G/1 queuing network model was proposed to characterize the connection-based spectrum handoff behaviors with multiple interruptions in multiple-channel CR networks, where the SU can significantly reduce the extended data delivery time by applying the traffic-adaptive target channel sequence selection method. In [ 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 ], multiple interruptions and the extended data delivery time were also studied in the PRP M/G/1 queuing network model. However, the authors only considered a single-channel CR network.…”

“…In order to reduce the complexity of the algorithm, it proposed the equiprobable target channel selection and the primary traffic-based target channel selection, which were not optimal selection schemes for the considered secondary connection. In general, in [ 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 ], all the CR networks were established based on the preemptive resume priority queuing system model. That is, when the secondary connection was interrupted due to the appearance of the primary connection, the interrupted secondary connection would reactively or proactively determine a best available channel to resume its unfinished data transmission.…”

“…In this paper, unlike [ 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 ], we propose an analytical framework based on the preemptive repeat identical (PRI) M/G/1 queuing network model to characterize spectrum handoff behaviors with general service time distribution of both primary and secondary connections, multiple interruptions and transmission time delay resulting from the appearance of primary connections. Under the preemptive repeat policy, when interruptions happen, the secondary connection will start from the beginning.…”