Multicast capacity of multihop cognitive networks

In this paper, we study the capacity of cognitive networks. We focus on the network model consisting of two overlapping ad hoc networks, called the primary ad hoc network (PaN) and secondary ad hoc network (SaN), respectively. PaN and SaN operate on the same space and spectrum. For PaN (or SaN resp.) we assume that primary (or secondary resp.) nodes are placed according to a Poisson point process of intensity n (or m resp.) over a unit square region. We randomly choose ns (or ms resp.) nodes as the sources of multicast sessions in PaN (or SaN resp.), and for each primary source vp (or secondary source vs), we pick uniformly at random nd primary nodes (or md secondary nodes) as the destinations of vp (or vs). Above all, we assume that PaN can adopt the optimal protocol in terms of the throughput. Our main work is to design the multicast strategy for SaN by which it can achieve the optimal throughput, without any negative impact on the throughput for PaN in order sense. Specifically, depending on nd and n, we choose the optimal strategy for PaN from two candidates called percolation strategy and connectivity strategy, respectively. Subsequently, we design the corresponding throughput-optimal strategy for SaN. We further derive the regimes for n, nd, m and md where the throughputs for PaN and SaN can simultaneously achieve the upper bound of their capacities asymptotically.