The Impact of Sensing Range on Spatial-Temporal Opportunity

In this paper, we study the impact of secondary user (SU) sensing range on spectrum access opportunity in cognitive radio networks. We first derive a closed-form ex- pression of spectrum access opportunity by taking into ac- count the random variations in number, locations and trans- mitted powers of primary users (PUs). Then, we show how SU sensing range affects spectrum access opportunity, and the tradeoff between SU sensing range and spectrum ac- cess opportunity is formulated as an optimization problem to maximize spectrum access opportunity. Furthermore, we prove that there exists an optimal SU sensing range which yields the maximum spectrum access opportunity, and nu- merical results validate our theoretical analysis

Interference and Deployment Issues for Cognitive Radio Systems in Shadowing Environments

In this paper we describe a model for calculating the aggregate interference encountered by primary receivers in the presence of randomly placed cognitive radios (CRs). We show that incorporating the impact of distance attenuation and lognormal fading on each constituent interferer in the aggregate, leads to a composite interference that cannot be satisfactorily modeled by a lognormal. Using the interference statistics we determine a number of key parameters needed for the deployment of CRs. Examples of these are the exclusion zone radius, needed to protect the primary receiver under different types of fading environments and acceptable interference levels, and the numbers of CRs that can be deployed. We further show that if the CRs have apriori knowledge of the radio environment map (REM), then a much larger number of CRs can be deployed especially in a high density environment. Given REM information, we also look at the CR numbers achieved by two different types of techniques to process the scheduling information.Comment: to be presented at IEEE ICC 2009. This posting is the same as the original one. Only author's list is updated that was unfortunately not correctly mentioned in first versio

Random Access Transport Capacity

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants as well. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability.Comment: Submitted to IEEE Trans. on Wireless Communications, Sept. 200