• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3237-3256
• /
• 2012

In the context of effective usage of a scarce spectrum resource, emerging wireless communication standards will demand spectrum sharing with existing systems as well as multiple access with higher spectral efficiency. We mathematically analyze the sum throughput of a spectrum sharing space-division multiple access (SDMA) system, which forms a transmit null in the direction of other coexisting systems while satisfying orthogonal beamforming constraints. For a large number of users N, the SDMA throughput scales as log N at high signal-to-noise ratio (SNR) ((J-1) loglog N at normal SNR), where J is the number of transmit antennas. This indicates that multiplexing gain of the spectrum sharing SDMA is $\frac{J-1}{J}$ times less than that of the non-spectrum sharing SDMA only using orthogonal beamforming, whereas no loss in multiuser diversity gain. Although the spectrum sharing SDMA always has lower throughput compared to the non-spectrum sharing SDMA in the non-coexistence scenario, it offers an intriguing opportunity to reuse spectrum already allocated to other coexisting systems.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.227-237
• /
• 2014

Throughput scaling laws for two coexisting ad hoc networks with m primary users (PUs) and n secondary users (SUs) randomly distributed in an unit area have been widely studied. Early work showed that the secondary network performs as well as stand-alone networks, namely, the per-node throughput of the secondary networks is ${\Theta}(1/\sqrt{n{\log}n})$. In this paper, we show that by exploiting directional spectrum opportunities in secondary network, the throughput of secondary network can be improved. If the beamwidth of secondary transmitter (TX)'s main lobe is ${\delta}=o(1/{\log}n)$, SUs can achieve a per-node throughput of ${\Theta}(1/\sqrt{n{\log}n})$ for directional transmission and omni reception (DTOR), which is ${\Theta}({\log}n)$ times higher than the throughput with-out directional transmission. On the contrary, if ${\delta}={\omega}(1/{\log}n)$, the throughput gain of SUs is $2{\pi}/{\delta}$ for DTOR compared with the throughput without directional antennas. Similarly, we have derived the throughput for other cases of directional transmission. The connectivity is another critical metric to evaluate the performance of random ad hoc networks. The relation between the number of SUs n and the number of PUs m is assumed to be $n=m^{\beta}$. We show that with the HDP-VDP routing scheme, which is widely employed in the analysis of throughput scaling laws of ad hoc networks, the connectivity of a single SU can be guaranteed when ${\beta}$ > 1, and the connectivity of a single secondary path can be guaranteed when ${\beta}$ > 2. While circumventing routing can improve the connectivity of cognitive radio ad hoc network, we verify that the connectivity of a single SU as well as a single secondary path can be guaranteed when ${\beta}$ > 1. Thus, to achieve the connectivity of secondary networks, the density of SUs should be (asymptotically) bigger than that of PUs.