We propose a simple approximate model for unslotted opportunistic spectrum access networks under nonsaturation conditions. The main simplification we introduce is that all secondary users, except a tagged one, in nonsaturated setting can be approximated by saturated ones with a scaled version of backoff interval. We analyze the approximate model and verify the model using simulations.

We propose an opportunistic spectrum access scheme for unslotted secondary users exploiting spectrum opportunities in unslotted primary networks. An analytical model is developed to investigate the performance of the proposed scheme, and numerical results are presented to evaluate the performance in unslotted primary networks.

In this paper, a preemptive priority queueing model is developed to derive the system dwelling time of secondary calls in a cognitive radio system in which a primary call's reoccupation of the channel is modeled as a preemptive event that forces a secondary call to attempt a spectrum handover. The suspension of secondary call service which may happen when the immediate spectrum handover fails, is included in our computation of the system dwelling time. The results are helpful in evaluating cognitive radio systems in terms of service delay and in determining system design parameters such as required buffer size and system capacity.

A multiple-places reservation discipline is studied in a discrete-time priority queueing system. We obtain the joint distribution of system state, from which the delays of high and low priority packets are derived. Comparison is made with the cases of FIFO, single-place reservation discipline and HOL priority.

In this paper, we consider a network of N identical IEEE 802.11 DCF (Distributed Coordination Function) terminals with RTS/CTS mechanism, each of which is assumed to be saturated. For performance analysis, we propose a simple and efficient mathematical model to derive the statistical characteristics of the network such as the inter-transmission time of packets in the network and the service time (the inter-transmission time of successful packet transmissions) of the network. Numerical results and simulations are provided to validate the accuracy of our model and to study the performance of the IEEE 802.11 DCF network.

In this letter, we propose an enhanced gentle distributed coordination function (GDCF), which is a simple and effective collision resolution mechanism, to improve the performance of IEEE 802.11 DCF. We compare performance of the enhanced GDCF with that of the legacy DCF and the conventional GDCF via analysis and simulations. The enhanced GDCF introduces a new counter to check the number of consecutively successful transmissions, and the maximum permitted values of the counter differ for different backoff stages. The proposed GDCF is shown to have performance superior to that of the conventional GDCF for various combinations of contending stations and frame length.