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

• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.641-646
• /
• 2011

In this paper, we investigate a power control problem which is very critical in underlay-based spectrum sharing systems. Although an underlay-based spectrum sharing system is more efficient compared to an overlay-based spectrum sharing system in terms of spectral utilization, some practical problems obstruct its commercialization. One of them is a real-time-based power adaptation of secondary transmitters. In the underlay-based spectrum sharing system, it is essential to adapt secondary user's transmit power to interference channel states to secure primary users' communication. Thus, we propose a practical power control scheme for secondary transmitters. The feedback overhead of our proposed scheme is insignificant because it requires one-bit signaling, while the optimal power control scheme requires the perfect information of channel states. In addition, the proposed scheme is robust to feedback delay. We compare the performance of the optimal and proposed schemes in terms of primary user's outage probability and secondary user's throughput. Our simulation results show that the proposed scheme is almost optimal in terms of both primary user's outage probability and secondary user's throughput when the secondary user's transmit power is low. As the secondary user's transmit power increases, the primary user's outage probability of the proposed scheme is degraded compared with the optimal scheme while the secondary user's throughput still approaches that of the optimal scheme. If the feedback delay is considered, however, the proposed scheme approaches the optimal scheme in terms of both the primary user's outage probability and secondary user's throughput regardless of the secondary user's transmit power.

• Journal of electromagnetic engineering and science
• /
• 제12권1호
• /
• pp.1-7
• /
• 2012

In this paper, we investigated the throughput of a cognitive radio network where two primary frequency channels (PCs) are sensed and opportunistically accessed by N secondary users. The sharing sensing member (SSM) protocol is introduced to sense both PCs simultaneously. According to the SSM protocol, N SUs (Secondary User) are divided into two groups, which allows for the simultaneous sensing of two PCs. With a frame structure, after determining whether the PCs are idle or active during a sensing slot, the SUs may use the remaining time to transmit their own data. The throughput of the network is formulated as a convex optimization problem. We then evaluated an iterative algorithm to allocate the optimal sensing time, fusion rule and the number of members in each group. The computer simulation and numerical results show that the proposed optimal allocation improves the throughput of the SU under a misdetection constraint to protect the PCs. If not, its initial date of receipt shall be nullified.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.175-186
• /
• 2009

A new medium access control (MAC) scheme embedding physical channels into multiband carrier sense multiple access/collision avoidance (CSMA/CA) networks is proposed to provide strict quality of service (QoS) guarantee to high priority users. In the proposed scheme, two priority classes of users, primary and secondary users, are supported. For primary users physical channels are provided to ensure strict QoS, whereas secondary users are provided with best-effort service using CSMA/CA modified for multiband operation. The performance of the proposed MAC scheme is investigated using a new multiband CSMA/CA Markov chain model capturing the primary user activity and the operation of secondary users in multiple bands. The throughput of secondary users is obtained as a function of the primary user activity and other CSMA/CA parameters. It is shown that the new MAC scheme yields larger throughput than the conventional single-band CSMA/CA when both schemes use the same bandwidth.

• 한국통신학회논문지
• /
• 제36권11A호
• /
• pp.892-902
• /
• 2011

Cong Shen과 Micael P. Fitz에 의해 제안된 OSO(opportunistic spatial orthogonalization)는 주 사용자가 모든 라이선스 주파수 대역을 점유하고 있는 동안에 부 사용자들이 그 주파수 대역을 동시에 사용할 수 있도록 하는 기법이다. 본 논문에서는 single-input multi-output system을 기반으로 하여, 주 사용자의 송신 전략을 유지하며 주 사용자의 송신기에서 활성 부 사용자의 수신기로 가는 간섭을 고려한 활성 부 사용자 선택 알고리즘을 소개한다. 제안한 알고리즘은 주 사용자에게 최소한의 전송 용량(throughput)을 보장하며 기존 OSO 방법보다 더 높은 성능을 보인다. 우리는 모의실험을 통해 여러 제약 조건 하에서 제안한 알고리즘의 성능을 검증한다.

• 경영과학
• /
• 제28권3호
• /
• pp.15-29
• /
• 2011

In this paper, we consider a system working at both primary service and secondary service. A server can switch between the primary service and the secondary service or it can be assigned to secondary service as a dedicated server. A service policy is characterized by the number of servers dedicated to the secondary service and a rule for switching the remaining servers between two services. The primary service system is modelled as a Markovian queueing system and the throughput is a function of the number of servers, buffer capacity, and service policy. And the secondary service system has a service level requirement strategically determined to perform the service assigned. There is a revenue obtained from throughput and costs due to servers and buffers. We study the problem of simultaneously determining the optimal total number of servers, buffers, and service policy to maximize profit of the system subject to both an expected customer waiting time constraint of the primary service and a service level constraint of the secondary service and develop an algorithm which can be successfully applied with the small number of computations.

• ETRI Journal
• /
• 제34권2호
• /
• pp.276-279
• /
• 2012

In this letter, a modified 802.11-based opportunistic spectrum access is proposed for single-channel cognitive radio networks where primary users operate on a slot-by-slot basis. In our opportunistic spectrum access, control frames are used to reduce the slot-boundary impact and achieve channel reservation to improve throughput of secondary users. An absorbing Markov chain model is used to analyze the throughput of secondary users. Simulation results show that the analysis accurately predicts the saturation throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3075-3093
• /
• 2014

In this paper, we consider an advanced wireless user, called primary-secondary user (PSU) who is capable of harvesting renewable energy and connecting to both the primary network and cognitive radio networks simultaneously. Recently, energy harvesting has received a great deal of attention from the research community and is a promising approach for maintaining long lifetime of users. On the other hand, the cognitive radio function allows the wireless user to access other primary networks in an opportunistic manner as secondary users in order to receive more throughput in the current time slot. Subsequently, in the paper we propose the channel access policy for a PSU with consideration of the energy harvesting, based on a Partially Observable Markov decision process (POMDP) in which the optimal action from the action set will be selected to maximize expected long-term throughput. The simulation results show that the proposed POMDP-based channel access scheme improves the throughput of PSU, but it requires more computations to make an action decision regarding channel access.

• 정보과학회 논문지
• /
• 제43권12호
• /
• pp.1412-1419
• /
• 2016

인지 무선 센서 네트워크 (CRSNs)에서 보조 사용자가 (SUs) 주 사용자 (PUs)에 간섭을 주지 않고 기회주의적 방식으로 라이선스 대역을 사용할 수 있다. SUs가 스펙트럼 센싱을 통해 PU의 존재 여부를 확인할 수 있다. 그리고 센싱 시간은 스펙트럼 센싱의 중요한 파라미터이다. 센싱 시간은 센싱 성능과 스루풋 간의 균형을 얻을 수 있다. 본 논문에서는 다른 관점에서 이 균형을 탐구하기를 통해 스펙트럼 센싱을 위한 새로운 기법을 제안한다: a) PU의 검출 (SSPD)과 b)스루풋(SSST)을 극대화을 위한 스펙트럼 센싱이다. 제안한 기법에서 현재 프레임의 첫 번째 센싱 결과에 따라 동적인 두 번째 스펙트럼 센싱을 수행한다. CRSNs에서 에너지 제약을 때문에 네트워크 에너지 효율도 센싱 시간의 최적화를 통해 최대화된다. 시뮬레이션 결과를 통하여 제안된 SSPD과 SSST가 각각의 에너지 효율과 스루풋의 성능을 향상시킬 수 있음을 검증하였다.

• 방송공학회논문지
• /
• 제21권1호
• /
• pp.113-116
• /
• 2016

무선 인지 네트워크(cognitive radio network)는 주파수 사용을 허가받지 않은 이차 사용자들이 일차 사용자의 통신을 방해하지 않으면서 일차 사용자의 주파수를 사용하도록 하는 기술이다. 본 논문에서는 무선 인지 네트워크에서 다수의 이차 사용자(secondary user)가 하나의 일차 사용자(primary user)의 주파수를 사용할 때 이차 사용자들 간의 충돌을 줄이면서 스펙트럼을 사용할 수 있는 다중 접속(multiple access)을 제안한다. 다중 접속은 p-persistent와 non-persistent 방법을 이차 사용자 네트워크에 적합하게 변형하여 사용하였다. 각 다중 접속 방식에 대해서 전체 이차 사용자의 처리율(throughput)을 수식으로 유도하였고, 이를 몬테카를로(Monte Carlo) 모의실험을 통해 검증하였다. 모의실험 결과 채널 접속 확률 및 최대 대기 프레임 숫자를 적절하게 잡아야 처리율이 최대가 됨을 확인하였다.