Scaling laws of single-hop cognitive networks

We consider a cognitive network consisting of n cognitive users uniformly distributed with constant density among primary users. Each user has a single transmitter and a single receiver, and the primary and cognitive users transmit concurrently. The cognitive users use single-hop transmission in two scenarios: (i) with constant transmit power, and (ii) with transmit power scaled according to the distance to a designated primary transmitter. We show that, in both cases, the cognitive users can achieve a throughput scaled linearly with the number of users n. The first scenario requires the cognitive users to have the transmitter-receiver (Tx-Rx) distance bounded, but it can be arbitrarily large. Then with high probability, any network realization has the throughput scaling linearly with n. The second scenario allows the cognitive Tx-Rx distance to grow with the network at a feasible exponent as a function of the path loss and the power scaling factors. In this case, the average network throughput grows at least linearly with n and at most as n log(n). These results suggest that single-hop transmission may be a suitable choice for cognitive transmission.

[1]  Vahid Tarokh,et al.  The Primary Exclusive Region in Cognitive Networks , 2008, 2008 5th IEEE Consumer Communications and Networking Conference.

[2]  Vahid Tarokh,et al.  Scaling Laws of Cognitive Networks , 2007, 2007 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications.

[3]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[4]  Pramod Viswanath,et al.  On outer bounds to the capacity region of wireless networks , 2006, IEEE Transactions on Information Theory.

[5]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  P. Spreij.  Probability and Measure , 1996 .

[7]  N. Hoven,et al.  Power scaling for cognitive radio , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[8]  Panganamala Ramana Kumar,et al.  On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks , 2006, IEEE Transactions on Information Theory.

[9]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[10]  Ayfer Özgür,et al.  Scaling Laws for One- and Two-Dimensional Random Wireless Networks in the Low-Attenuation Regime , 2007, IEEE Transactions on Information Theory.

[11]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[12]  P. Viswanath,et al.  Upper bounds to transport capacity of wireless networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[13]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[14]  Panganamala Ramana Kumar,et al.  Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach , 2006, Found. Trends Netw..

[15]  Sanjeev R. Kulkarni,et al.  A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.

[16]  Emre Telatar,et al.  Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks , 2004, ISIT.

[17]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .

[18]  Mai Vu,et al.  On the primary exclusive region of cognitive networks , 2008, IEEE Transactions on Wireless Communications.

[19]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[20]  Panganamala Ramana Kumar,et al.  Capacity bounds for ad hoc and hybrid wireless networks , 2004, CCRV.