• Journal of Communications and Networks
• /
• 제18권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.

• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.394-405
• /
• 2015

This paper considers a wideband cognitive radio network which can simultaneously sense multiple narrowband channels and thus aggregate the detected available channels for transmission and proposes a novel cognitive radio system that exhibits improved sensing throughput and can save power consumption of secondary user (SU) compared to the conventional cognitive radio system studied so far. More specifically, under the proposed cognitive radio system, we study the problem of designing the optimal sensing time and power allocation strategy, in order to maximize the ergodic throughput of the proposed cognitive radio system under two different schemes, namely the wideband sensing-based spectrum sharing scheme and the wideband opportunistic spectrum access scheme. In our analysis, besides the average interference power constraint at primary user, the average transmit power constraint of SU is also considered for the two schemes and then a subgradient algorithm is developed to obtain the optimal sensing time and the corresponding power allocation strategy. Finally, numerical simulations are presented to verify the performance of the two proposed schemes.

• 대한전자공학회논문지TC
• /
• 제47권11호
• /
• pp.59-68
• /
• 2010

본 논문은 보상함수 수정을 통해 보다 완벽한 DSA(Dynamic Spectrum Access)를 수행하는 새로운 방법을 제시하였다. POMDP(Partially Observable Markov Decision Process)는 미래의 스펙트럼 상태를 예측하는데 사용되는 알고리즘으로서, 그 중 보상함수는 스펙트럼을 예측하는데 있어 가장 중요한 부분이다. 그러나 보상함수는 Busy 및 Idle의 두 가지 상태만 갖고 있기 때문에 채널에서 충돌이 발생하게 되면 보상함수는 Busy를 반환함으로써 2차 사용자의 성능을 감소시키게 된다. 따라서 본 논문에서는 기존의 Busy를 Busy 및 Collision 의 두 상태로 구분하였고, 이렇게 추가된 Collision 상태를 통해 2차 사용자의 채널 접근 기회를 보다 향상시킴으로서 데이터 전송율을 증대시킬 수 있도록 하였다. 또한 본 논문은 새로운 알고리즘의 신뢰도 벡터를 수학적으로 분석하였다. 마지막으로 시뮬레이션 결과를 통해 개선된 보상함수의 성능을 검증하고, 이를 통해 새로운 알고리즘이 CR 네트워크에서 2차 사용자의 성능을 향상시킬 수 있음을 보인다.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.102-110
• /
• 2013

This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1594-1617
• /
• 2018

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3172-3193
• /
• 2022

Cognitive radio-simultaneous wireless information and power transfer (CR-SWIPT) has attracted much interest since it can improve both the spectrum and energy efficiency of wireless networks. This paper focuses on the resource sharing between a point-to-point primary system (PRS) and a multiuser multi-antenna cellular cognitive radio system (CRS) containing a large number of cognitive users (CUs). The resource sharing optimization problem is formulated by jointly scheduling CUs and adjusting the transmit power at the cognitive base station (CBS). The effect of accessing CUs' spatial channel correlation on the possible transmit power of the CBS is investigated. Accordingly, we provide a low-complexity suboptimal approach termed the semi-correlated semi-orthogonal user selection (SC-SOUS) algorithm to enhance the spectrum efficiency. In the proposed algorithm, CUs that are highly correlated to the information decoding primary receiver (IPR) and mutually near orthogonal are selected for simultaneous transmission to reduce the interference to the IPR and increase the sum rate of the CRS. We further develop a spatial correlation-based resource sharing (SC-RS) strategy to improve energy sharing performance. CUs nearly orthogonal to the energy harvesting primary receiver (EPR) are chosen as candidates for user selection. Therefore, the EPR can harvest more energy from the CBS so that the energy utilization of the network can improve. Besides, zero-forcing precoding and power control are adopted to eliminate interference within the CRS and meet the transmit power constraints. Simulation results and analysis show that, compared with the existing CU selection methods, the proposed low-complex strategy can enhance both the achievable sum rate of the CRS and the energy sharing capability of the network.

• 제어로봇시스템학회논문지
• /
• 제22권2호
• /
• pp.104-109
• /
• 2016

In this paper, a localization method for multiple robots based on Bayesian inference is proposed when multiple robots adopting multi-RAT (Radio Access Technology) communications exist in cognitive radio networks. Multiple robots are separately defined by primary and secondary users as in conventional mobile communications system. In addition, the heterogeneous spectrum environment is considered in this paper. To improve the performance of localization for multiple robots, a realistic multiple primary user distribution is explained by using the probabilistic graphical model, and then we introduce the Gibbs sampler strategy based on Bayesian inference. In addition, the secondary user selection minimizing the value of GDOP (Geometric Dilution of Precision) is also proposed in order to overcome the limitations of localization accuracy with Gibbs sampling. Via the simulation results, we can show that the proposed localization method based on GDOP enhances the accuracy of localization for multiple robots. Furthermore, it can also be verified from the simulation results that localization performance is significantly improved with increasing number of observation samples when the GDOP is considered.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.1976-1997
• /
• 2016

This paper investigates the problem of co-tier interference mitigation for dynamic small- cell networks, in which the load of each small-cell varies with the number of active associated small-cell users (SUs). Due to the fact that most small-cell base stations (SBSs) are deployed in an ad-hoc manner, the problem of reducing co-tier interference caused by dynamic loads in a distributed fashion is quite challenging. First, we propose a new distributed channel allocation method for small-cells with dynamic loads and define a dynamic interference graph. Based on this approach, we formulate the problem as a dynamic interference graph game and prove that the game is a potential game and has at least one pure strategy Nash equilibrium (NE) point. Moreover, we show that the best pure strategy NE point minimizes the expectation of the aggregate dynamic co-tier interference in the small-cell network. A distributed dynamic learning algorithm is then designed to achieve NE of the game, in which each SBS is unaware of the probability distributions of its own and other SBSs' dynamic loads. Simulation results show that the proposed approach can mitigate dynamic co-tier interference effectively and significantly outperform random channel selection.

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.664-677
• /
• 2011

In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.

• Journal of Information Technology Applications and Management
• /
• 제15권1호
• /
• pp.261-270
• /
• 2008

Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.