Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Microwave Mobile Communications
Microwave Mobile Communications
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
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
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
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Scaling Laws for One- and Two-Dimensional Random Wireless Networks in the Low-Attenuation Regime
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Generalized results of transmission capacities for overlaid wireless networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Transmission capacities for overlaid wireless ad hoc networks with outage constraints
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multicast throughput for large scale cognitive networks
Wireless Networks
Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
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.