• ETRI Journal
• /
• 제39권3호
• /
• pp.345-352
• /
• 2017

Traffic management is a highly beneficial mechanism for satisfying quality-of-service requirements and overcoming the resource scarcity problems in networks. This paper introduces an optimal connection admission control mechanism to decrease the packet loss ratio and end-to-end delay in cognitive radio sensor networks (CRSNs). This mechanism admits data flows based on the value of information sent by the sensor nodes, the network state, and the estimated required resources of the data flows. The number of required channels of each data flow is estimated using a proposed formula that is inspired by a graph coloring approach. The proposed admission control mechanism is formulated as a semi-Markov decision process and a linear programming problem is derived to obtain the optimal admission control policy for obtaining the maximum reward. Simulation results demonstrate that the proposed mechanism outperforms a recently proposed admission control mechanism in CRSNs.

• International journal of advanced smart convergence
• /
• 제7권1호
• /
• pp.15-23
• /
• 2018

Spectrum allocation is a key operation in cognitive radio networks (CRNs), where secondary users (SUs) are usually selfish - to achieve itself utility maximization. In view of this context, much prior lit literature proposed spectrum allocation base on non-cooperative game models. However, the most of them proposed non-cooperative game models based on complete information of CRNs. In practical, primary users (PUs) in a dynamic wireless environment with noise uncertainty, shadowing, and fading is difficult to attain a complete information about them. In this paper, we propose a non-cooperative game joint hidden markov model scheme for spectrum allocation in CRNs. Firstly, we propose a new hidden markov model for SUs to predict the sensing results of competitors. Then, we introduce the proposed hidden markov model into the non-cooperative game. That is, it predicts the sensing results of competitors before the non-cooperative game. The simulation results show that the proposed scheme improves the energy efficiency of networks and utilization of SUs.

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

This paper proposes a new dynamic spectrum access (DSA) algorithm for cognitive radio networks. Once initialized, this algorithm works without the need of coordination overhead and hence can be used when no control channel is available. Secondary user (SU) lists and predetermined access control are used in this algorithm. We analyze the probability of no SU collision with primary user and the throughput of our proposed algorithm. Extensive simulations show that our algorithm outperforms the existing DSA algorithm in terms of both the aggregate throughput and the traffic distribution fairness. Furthermore, the validity of our analysis is confirmed by simulation results.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.417-427
• /
• 2017

Power allocation is an important factor for cognitive radio networks to achieve higher communication capacity and faster equilibrium. This paper considers power allocation problem to each cognitive user to maximize capacity of the cognitive systems subject to the constraints on the total power of each cognitive user and the interference levels of the primary user. Since this power control problem can be formulated as a mixed-integer nonlinear programming (NP) equivalent to variational inequality (VI) problem in convex polyhedron which can be transformed into complementary problem (CP), we utilize modified projection method to solve this CP problem instead of finding NP solution and give a power control allocation algorithm with a subcarrier allocation scheme. Simulation results show that the proposed algorithm performs well and effectively reduces the system power consumption with almost maximum capacity while achieve Nash equilibrium.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1333-1343
• /
• 2016

Spectrum sharing in centrally controlled cognitive radio (CR) networks has been widely studied, however, research on channel access for distributively controlled individual cognitive users has not been fully characterized. This paper conducts an analysis of random channel access of cognitive users controlled in a distributed manner in a CR network. Based on the proposed estimation method, each cognitive user can estimate the current channel condition by using its own Markov-chain model and can compute its own blocking probability, collision probability, and forced termination probability. Using the proposed scheme, CR with distributed control (CR-DC), CR devices can make self-controlled decisions based on the status estimations to adaptively control its system parameters to communicate better.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.50-67
• /
• 2015

The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.

• 한국인터넷방송통신학회논문지
• /
• 제9권6호
• /
• pp.29-35
• /
• 2009

본 논문에서는 무선인지네트워크를 위한 효율적인 채널 선택 알고리즘을 제안하고 그 성능을 비교분석한다. 제안된 알고리즘에서는 다중의 가용한 채널들 중 최적 채널 선택을 위해 히스토리 윈도우 범위에서 각 채널의 기(primary) 사용자에 의한 채널 사용률 및 성능, 현 채널 품질 그리고 기 사용자의 통계적 트래픽 활동 특성을 고려한다. 시뮬레이션을 통해 무선인지(secondary)사용자들이 제안된 알고리즘을 통하여 다중의 채널들중 데이터 전송을 위한 최적의 채널을 선택할 수 있음을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3731-3750
• /
• 2014

This paper considers a wideband cognitive radio network (WCRN) which can simultaneously sense multiple narrowband channels and thus aggregate the detected available channels for transmission and studies the ergodic throughput of the WCRN that operated under: the wideband sensing-based spectrum sharing (WSSS) scheme and the wideband opportunistic spectrum access (WOSA) scheme. In our analysis, besides the average interference power constraint at PU, the average transmit power constraint of SU is also considered for the two schemes and a novel cognitive radio sensing frame that allows data transmission and spectrum sensing at the same time is utilized, and then the maximization throughput problem is solved by developing a gradient projection method. Finally, numerical simulations are presented to verify the performance of the two proposed schemes.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.130-139
• /
• 2014

Due to the unpredictable nature of channel availability, carrying delay-sensitive traffic in cognitive radio networks (CRNs) is very challenging. Spectrum leasing of radio resources has been proposed in the so called coordinated CRNs to improve the quality of service (QoS) experienced by secondary users (SUs). In this paper, the performance of coordinated CRNs under fixed-rate with hard-delay-constraints traffic is analyzed. For the adequate and fair performance comparison, call admission control strategies with fractional channel reservation to prioritize ongoing secondary calls over new ones are considered. Maximum Erlang capacity is obtained by optimizing the number of reserved channels. Numerical results reveal that system performance strongly depends on the value of the mean secondary service time relative to the mean primary service time. Additionally, numerical results show that, in CRNs without spectrum leasing, there exists a critical utilization factor of the primary resources from which it is not longer possible to guarantee the required QoS of SUs and, therefore, services with hard delay constraints cannot be even supported in CRNs. Thus, spectrum leasing can be essential for CRN operators to provide the QoS demanded by fixed-rate applications with hard delay constraints. Finally, the cost per capacity Erlang as function of both the utilization factor of the primary resources and the maximum allowed number of simultaneously rented channels is evaluated.

• 융합신호처리학회논문지
• /
• 제13권3호
• /
• pp.156-161
• /
• 2012

임의 접속(random access) 프로토콜은 기본적으로 센싱 기능을 가지고 있으며, 이것을 이용하여 분산형 무선 네트워크 시스템 구축에 적합한 특징을 가지고 있다. 이러한 기술적 특징은 중앙식 제어(centralized control)가 어려운 이기종 시스템들이 동작하는 인지 무선 통신 환경에 대하여 장점을 가지며, 인지 무선 통신 환경에서 임의 접속의 성능을 검증해 보아야 한다는 동기를 제공한다. 이 논문에서 우리는 인지 무선 통신 환경에서 CSMA/CA(carrier-sensing multiple access with collision avoidance)기법을 도입하고, 성능을 분석하는 기본 틀을 제공한다.