• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.456-462
• /
• 2011

This paper investigates the outage behavior of peak interference power limited cognitive radio (CR) networks with multiple transmit antennas. In CR-multi-input single-output (MISO) channel, the total transmit power is distributed over the transmitantennas. First, we use the orthogonal space-time codes (STC) to achieve the transmit diversity at CR-receiver (rx) and investigate the effect of the power distribution on the interference power received at the primary-receiver (P-rx). Then, we investigate the transmit antenna selection (TAS) scheme in which the CR system selects the best transmit antenna and allocates all the power to the selected best antenna. Two transmit antenna selection strategies are proposed depending on if feedback channel is available or not. We derive the closed form expressions of outage probability and outage capacity of all schemes with arbitrary number of transmit-antennas. We show that the proposed schemes significantly improve the outage capacity over the single antenna systems in Rayleigh fading environment. We also show that TAS based scheme outperforms the STC based scheme when peak interference power constraint is imposed on the P-rx only if a feedback channel from CR-rx to CR-transmitter is available.

• Journal of Broadcast Engineering
• /
• v.14 no.2
• /
• pp.134-143
• /
• 2009

In this paper, we propose a new relay selection algorithm for a two-way multiple relay channel. In the two-way multiple relay channel, two users exchange information with each other via multiple relays. The relays use a decode-and-forward or amplify-and-forward protocol, and exploit the combining process of the received packets to reduce the required channel resources. In the multiple relay network, diversity gain is achieved as the number of relays increases, and various schemes are proposed. In this paper, we propose a single best relay selection scheme based on instantaneous channel conditions. First of all, relays obtain the instantaneous channel state information in the handshaking process, and a single best relay is selected in a distributed methods prior to data transmissions. The relay selection metric is proposed so that the end-to-end channel condition is evaluated based on the intantaneous channel state informations. Simulation results show that the proposed relay selection algorithm achieve the increased throughput and diversity order when the number of potential relays is increased.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.1-5
• /
• 2015

Recently, RF energy harvesting technology is a promising technology for small-size IoT(Internet of Things) devices such as sensor to resolve battery scarcity problem. When applied to existing cognitive radio networks, this technology can be expected to increase network throughput through the increase of cognitive user's operating time. This paper proposes a optimal channel-selection policy for RF energy harvesting CR networks model where cognitive users in harvesting zone harvest ambient RF energy from transmission by nearby active primary users and the others in non-harvesting zone choose the channel and communicate with their receiver. We consider that primary users and secondary users are distributed as Poisson point processes and contact with their intended receivers at fixed distances. Finally we can derive the optimal frame duration, transmission power and density of secondary user from the proposed model that can maximize the secondary users's throughput under the given several conditions and suggest future directions of research.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.71-76
• /
• 2013

This paper considers an approach of secondary user selection method in cooperative spectrum sensing, which two users with the best SNR in sensing channel and in reporting channel, respectively, are selected to cooperate with each other in the spectrum sensing. The sensing results reported by two users are then combined to detect PU signal operation. A comparison between this proposed method with conventional selection technique in which only the user having the best sensing channel SNR is selected shows that the proposed method outperforms. We make an assumption that sensing channels experience identical, independent distributed (i.i.d) Rayleigh fading and the reporting channels are invariant and non-identical. Simulation results are derived for demonstration.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3342-3360
• /
• 2014

In this paper, the capacity and BER performance of downlink distributed antenna systems (DAS) with transmit antenna selection and multiple receive antennas are investigated in MIMO composite channel, where path loss, Rayleigh fading and lognormal shadowing are all considered. Based on the performance analysis, using the probability density function (PDF) of the effective SNR and numerical integrations, tightly-approximate closed-form expressions of ergodic capacity and average BER of DAS are derived, respectively. These expressions have more accuracy than the existing expressions, and can match the simulation well. Besides, the outage capacity of DAS is also analyzed, and a tightly-approximate closed-form expression of outage capacity probability is derived. Moreover, a practical iterative algorithm based on Newton's method for finding the outage capacity is proposed. To avoid iterative calculation, another approximate closed-form outage capacity is also derived by utilizing the Gaussian distribution approximation. With these theoretical expressions, the downlink capacity and BER performance of DAS can be effectively evaluated. Simulation results show that the theoretical analysis is valid, and consistent with the corresponding simulation.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.411-419
• /
• 2016

This article investigates the problem of distributed channel selection in opportunistic spectrum access networks from a perspective of interference minimization. The traditional physical (PHY)-layer interference model is for information theoretic analysis. When practical multiple access mechanisms are considered, the recently developed binary medium access control (MAC)-layer interference model in the previous work is more useful, in which the experienced interference of a user is defined as the number of competing users. However, the binary model is not accurate in mathematics analysis with poor achievable performance. Therefore, we propose a real-valued one called stochastic MAC-layer interference model, where the utility of a player is defined as a function of the aggregate weight of the stochastic interference of competing neighbors. Then, the distributed channel selection problem in the stochastic MAC-layer interference model is formulated as a weighted stochastic MAC-layer interference minimization game and we proved that the game is an exact potential game which exists one pure strategy Nash equilibrium point at least. By using the proposed stochastic learning-automata based uncoupled algorithm with heterogeneous learning parameter (SLA-H), we can achieve suboptimal convergence averagely and this result can be verified in the simulation. Moreover, the simulated results also prove that the proposed stochastic model can achieve higher throughput performance and faster convergence behavior than the binary one.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2675-2690
• /
• 2014

We study the problem of optimal opportunistic spectrum access with unknown and heterogeneous channel dynamics in cognitive radio networks. There is neither statistic information about the licensed channels nor information exchange among secondary users in the respective systems. We formulate the problem of maximizing network throughput. To achieve the desired optimization, we propose a win-shift lose-stay algorithm based only on rewards. The key point of the algorithm is to make secondary users tend to shift to another channel after receiving rewards from the current channel. The optimality and the convergence of the proposed algorithm are proved. The simulation results show that for both heterogeneous and homogenous systems the proposed win-shift lose-stay algorithm has better performance in terms of throughput and fairness than an existing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5820-5834
• /
• 2017

This paper investigates the channel selection problem with dynamic users and the asymmetric interference relation in distributed opportunistic spectrum access systems. Since users transmitting data are based on their traffic demands, they dynamically compete for the channel occupation. Moreover, the heterogeneous interference range leads to asymmetric interference relation. The dynamic users and asymmetric interference relation bring about new challenges such as dynamic random systems and poor fairness. In this article, we will focus on maximizing the tradeoff between the achievable utility and access cost of each user, formulate the channel selection problem as a directional graphical game and prove it as an exact potential game presenting at least one pure Nash equilibrium point. We show that the best NE point maximizes both the personal and system utility, and employ the stochastic learning approach algorithm for achieving the best NE point. Simulation results show that the algorithm converges, presents near-optimal performance and good fairness, and the directional graphical model improves the systems throughput performance in different asymmetric level systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2A
• /
• pp.130-138
• /
• 2008

In this paper, we propose a user selection method to maximize the sum-rate of downlink over opportunistic beamforming. The throughput of an opportunistic beamforming with non-uniformly distributed or a small number of users can decrease. In order to improve the throughput, we propose a scheduling method that does not use SINR or SNR but uses the effective channel gain of each user obtained from the SINR or SNR feedback. The proposed method makes it possible to select users flexibly according to the distribution of users. In numerical results, we show that the proposed methods improve the average sum-rate about 60% when users are distributed non uniformly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.260-279
• /
• 2015

In this paper, we investigate physical layer security for multiple decode-and-forward (DF) relaying underlay cognitive radio networks (CRNs) with fixed transmit power at the secondary network against passive eavesdropping attacks. We propose a simple relay selection scheme to improve wireless transmission security based on the instantaneous channel information of all legitimate users and the statistical information about the eavesdropper channels. The closed-form expressions of the probability of non-zero secrecy capacity and the secrecy outage probability (SOP) are derived over independent and non-identically distributed Rayleigh fading environments. Furthermore, we conduct the asymptotic analysis to evaluate the secrecy diversity order performance and prove that full diversity is achieved by using the proposed relay selection. Finally, numerical results are presented to verify the theoretical analysis and depict that primary interference constrain has a significant impact on the secure performance and a proper transmit power for the second transmitters is preferred to be energy-efficient and improve the secure performance.