Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network

Authors:
Changchuan Yin;Long Gao;Shuguang Cui
Affiliations:
Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, China and Department of Electrical and Computer Engineering ...;Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2010

Citing 21
Cited 7

Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On outer bounds to the capacity region of wireless networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective

IEEE/ACM Transactions on Networking (TON)
Scaling laws of single-hop cognitive networks

IEEE Transactions on Wireless Communications
Cognitive networks achieve throughput scaling of a homogeneous network

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
The capacity of wireless networks

IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation

IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks

IEEE Transactions on Information Theory
Upper bounds to transport capacity of wireless networks

IEEE Transactions on Information Theory
The transport capacity of wireless networks over fading channels

IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks

IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks

IEEE Transactions on Information Theory
Even One-Dimensional Mobility Increases the Capacity of Wireless Networks

IEEE Transactions on Information Theory
Optimal throughput-delay scaling in wireless networks - part I: the fluid model

IEEE Transactions on Information Theory
Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets

IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

IEEE Transactions on Information Theory
Cognitive radio: brain-empowered wireless communications

IEEE Journal on Selected Areas in Communications

Spectrum sharing between cellular and mobile ad hoc networks: transmission-capacity trade-off

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
A simple upper bound on random access transport capacity

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Random access transport capacity

IEEE Transactions on Wireless Communications
Dual band connectivity of cognitive radio networks

Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management
Throughput and delay scaling laws for mobile overlaid wireless networks

Journal of Network and Computer Applications
Capacity scaling of general cognitive networks

IEEE/ACM Transactions on Networking (TON)
Practical unicast and convergecast scheduling schemes for cognitive radio networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the scaling laws for the throughputs and delays of two coexisting wireless networks that operate in the same geographic region. The primary network consists of Poisson distributed legacy users of density n, and the secondary network consists of Poisson distributed cognitive users of density m, with m n. The primary users have a higher priority to access the spectrum without particular considerations for the secondary users, while the secondary users have to act conservatively in order to limit the interference to the primary users. With a practical assumption that the secondary users only know the locations of the primary transmitters (not the primary receivers), we first show that both networks can achieve the same throughput scaling law as what Gupta and Kumar (IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000) established for a standalone wireless network if proper transmission schemes are deployed, where a certain throughput is achievable for each individual secondary user (i.e., zero outage) with high probability. By using a fluid model, we also show that both networks can achieve the same delay-throughput tradeoff as the optimal one established by El Gamal et al. (IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2568-2592, Jun. 2006) for a standalone wireless network.