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
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Capacity of a wireless ad hoc network with infrastructure
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Multicast capacity for hybrid wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Capacity of large-scale CSMA wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
On the primary exclusive region of cognitive networks
IEEE Transactions on Wireless Communications
Scaling laws of single-hop cognitive networks
IEEE Transactions on Wireless Communications
Achievable multicast throughput for homogeneous wireless ad hoc networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
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
Asymptotic Bounds of Information Dissemination in Power-Constrained Wireless Networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Capacity limits of cognitive radio with distributed and dynamic spectral activity
IEEE Journal on Selected Areas in Communications
Routing in Distributed Cognitive Radio Networks: A Survey
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In this paper, we focus on the achievable throughput of cognitive networks consisting of the primary ad hoc network (PaN) and the secondary ad hoc network (SaN). We construct PaN and SaN by placing nodes according to Poisson point processes of density n and m respectively over a unit square region. We directly study the multicast throughput of cognitive network to unify that of unicast and broadcast sessions. In order to ensure the priority of primary users in meanings of throughput, we design a metric called throughput decrement ratio (TDR) to measure the ratio of the throughput of PaN in presence of SaN to that of PaN in absence of SaN. Endowing PaN with the right to determine the threshold of the TDR, we propose multicast schemes based on TDMA and multihop routing for the two networks respectively and derive their achievable multicast throughput depending on the given threshold. Specially, we show when PaN has sparser density than SaN, to be specific, $$n=o\left({\frac{m} {(\log m)^2}}\right),$$ and if PaN only cares about the order of its throughput, SaN can simultaneously achieve the same order of the aggregated multicast throughput as it were a stand-alone network in absence of PaN.