• Title/Summary/Keyword: radio resource sharing

Search Result 47, Processing Time 0.021 seconds

Performance Analysis of Dynamic Spectrum Allocation in Heterogeneous Wireless Networks

  • Ha, Jeoung-Lak;Kim, Jin-Up;Kim, Sang-Ha
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.292-301
    • /
    • 2010
  • Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high-quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4-D Markov chain. We argue that there may exist a break-even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

Resource Allocation based on Hybrid Sharing Mode for Heterogeneous Services of Cognitive Radio OFDM Systems

  • Lei, Qun;Chen, Yueyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.149-168
    • /
    • 2015
  • In cognitive radio networks (CRNs), hybrid overlay and underlay sharing transmission mode is an effective technique for improving the efficiency of radio spectrum. Unlike existing works in the literature, where only one secondary user (SU) uses overlay and underlay modes, the different transmission modes should be allocated to different SUs, according to their different quality of services (QoS), to achieve the maximal efficiency of radio spectrum. However, hybrid sharing mode allocation for heterogeneous services is still a challenge in CRNs. In this paper, we propose a new resource allocation method for hybrid sharing transmission mode of overlay and underlay (HySOU), to achieve more potential resources for SUs to access the spectrum without interfering with the primary users. We formulate the HySOU resource allocation as a mixed-integer programming problem to optimize the total system throughput, satisfying heterogeneous QoS. To decrease the algorithm complexity, we divide the problem into two sub-problems: subchannel allocation and power allocation. Cutset is used to achieve the optimal subchannel allocation, and the optimal power allocation is obtained by Lagrangian dual function decomposition and subgradient algorithm. Simulation results show that the proposed algorithm further improves spectrum utilization with a simultaneous fairness guarantee, and the achieved HySOU diversity gain is a satisfactory improvement.

Short Term Spectrum Trading in Future LTE Based Cognitive Radio Systems

  • Singh, Hiran Kumar;Kumar, Dhananjay;Srilakshmi, R.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.34-49
    • /
    • 2015
  • Market means of spectrum trading have been utilized as a vital method of spectrum sharing and access in future cognitive radio system. In this paper, we consider the spectrum trading with multiple primary carrier providers (PCP) leasing the spectrum to multiple secondary carrier providers (SCP) for a short period of time. Several factors including the price of the resource, duration of leasing, and the spectrum quality guides the proposed model. We formulate three trading policies based on the game theory for dynamic spectrum access in a LTE based cognitive radio system (CRS). In the first, we consider utility function based resource sharing (UFRS) without any knowledge of past transaction. In the second policy, each SCP deals with PCP using a non-cooperative resource sharing (NCRS) method which employs optimal strategy based on reinforcement learning. In variation of second policy, third policy adopts a Nash bargaining while incorporating a recommendation entity in resource sharing (RERS). The simulation results suggest overall increase in throughput while maintaining higher spectrum efficiency and fairness.

Radio Resource Sharing Among Users in Hybrid Access Femtocells

  • Becvar, Zdenek;Plachy, Jan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2590-2606
    • /
    • 2014
  • A problem related to deployment of femtocells is how to manage access of users to radio resources. On one hand, all resources of the femtocell can be reserved for users belonging to a closed subscriber group (CSG), which is a set of users defined by a femtocell subscriber. This approach, known as closed access, however, increases interference to users not included in the CSG as those users do not have a permission to access this femtocell. Contrary, resources can be shared by all users with no priority in an open access mode. In this case, the femtocell subscriber shares radio as well as backhaul resources with all other users. Thus, throughput and quality of service of the subscriber and the CSG users can be deteriorated. To satisfy both the CSG as well as non-CSG users, a hybrid access is seen as a compromise. In this paper, we propose a new approach for sharing radio resources among all users. As in common cases, the CSG users have a priority for usage of a part of resources while rest of the resources is shared by all users proportionally to their requirements. As the simulation results show, the proposed resource sharing scheme significantly improves throughput of the CSG users and their satisfaction with granted bitrates. At the same time, throughput and satisfaction of the non-CSG users is still guaranteed roughly at the same level as if conventional sharing schemes are applied.

Spatial Correlation-based Resource Sharing in Cognitive Radio SWIPT Networks

  • Rong, Mei;Liang, Zhonghua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.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.

Comparison of two methodologies on spectrum sharing information for unlicensed use in the 6-GHz band

  • Um, Jungsun;Kim, Bongsu;Kim, Igor;Park, Seungkeun
    • ETRI Journal
    • /
    • v.44 no.4
    • /
    • pp.531-542
    • /
    • 2022
  • With the increasing demand for unlicensed spectrum, several regulators have been opening up the 6-GHz band for unlicensed use while ensuring compliance with the technical requirement to avoid harmful interference in the existing primary services (PSs). In this paper, we present two methodologies, a channel-based method and a frequency-based method, which are applicable to a frequency coordination system that calculates the permissible transmit power in the channels or frequencies available to a secondary service (SS). In addition, we have demonstrated that the available transmit power of an SS can be maximized by adjusting the power allocation of the assigned resource units under the condition that the channel of the SS is partially overlapped with that of the PS. Based on the analysis results, it is suggested that it would be better to utilize the two methods selectively according to the operating channel conditions of the PS and the SS.

Adaptive Radio Resource Allocation for a Mobile Packet Service in Multibeam Satellite Systems

  • Lim, Kwang-Jae;Kim, Soo-Young;Lee, Ho-Jin
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.43-52
    • /
    • 2005
  • In this paper, we introduce an adaptive radio resource allocation for IP-based mobile satellite services. We also present a synchronous multibeam CDMA satellite system using an orthogonal resource sharing mechanism among downlink beams for the adaptive packet transmission. The simulation results, using a Ka-band mobile satellite channel and various packet scheduling schemes, show that the proposed system and resource allocation scheme improves the beam throughput by more than two times over conventional systems. The simulation results also show that, in multibeam satellite systems, a system-level adaptation to a user's channel and interference conditions according to user locations and current packet traffic is more efficient in terms of throughput improvement than a user-level adaptation.

  • PDF

Point-to-Point Communication of Cognitive Radios via Underlay Spectrum Sharing (언더레이 주파수 공유를 이용한 인지무선 통신장치의 점대점 통신방법)

  • Lee, Hye-Won;Han, Kwang-Hun;Hwang, Young-Woo;Choi, Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9A
    • /
    • pp.697-703
    • /
    • 2009
  • Cognitive radios are typically known to exploit vacant spectrum resources in order not to interfere with primary communication systems. However, cognitive radios may not be able to secure a clear spectrum band in a bustling spectrum band. Underlay spectrum sharing provides a way to cope with such a spectrum sharing problem. Cognitive radios share the same spectrum band with the spectrum licensees, i.e., primary users, by adjusting signal transmission power so as not to severely deteriorate the performance of the primary users. We propose an underlay spectrum sharing policy leveraging uplink spectrum resource to be used in a cellular network. A pair of end terminals attempts to establish a direct point-to-point link, and perform as cognitive radios in the sense that they share the uplink radio resource of other primary users. We formulate the transmit power constraints of the cognitive radios and propose a practical uplink band sharing framework. Our simulation results demonstrate that such an uplink sharing underlay direct link can enhance the throughput performance of point-to-point link with low overhead.

Radio Resource Sharing using Power Control of Base-station in Cognitive Radio System (코그니티브 라디오 시스템에서의 전력 제어를 이용한 무선 자원 공유)

  • Kwon, Yang-Soo;Ji, Young-Geun;Chung, Jae-Hak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.1057-1064
    • /
    • 2007
  • Cognitive radio(CR) technique which utilizes empty frequency bands allocated to private business but not being used temporally has been researched. According to the standard, CR users detect the primary user using the same channel, CR users should move to the another channel to guarantee the primary user's decodability. Thus, CR systems cannot use the same channel and support the CR user's QoS(Quality of Service) during the channel moving time. In this paper, we propose a radio resource sharing method that CR basestation controls the transmission power with the primary user's SNR(Signal to Noise Ratio) to increase the spectral efficiency of area and to minimize the outage of CR users. In addition, computer simulation demonstrates show that the proposed method improved spectral efficiency of area and decreased outage probability of CR users.

Game Algorithm for Power Control in Cognitive Radio Networks (전파 인지 네트워크에서 전력 제어를 위한 게임 알고리즘)

  • Rho, Chang-Bae;Halder, N.;Song, Ju-Bin
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.2
    • /
    • pp.201-207
    • /
    • 2009
  • Recently effective spectrum resource technologies have been studied using a game theorectical approach for cognitive radio networks. Radio resource management is required an effective scheme because the performance of a radio communication system much depends on it's effectiveness. In this paper, we suggest a game theoretical algorithm for adaptive power control which is required an effect scheme in cognitive radio networks. It will be a distributed network. In the network distributed cognitive radio secondary users require an adaptive power control. There are many results which are suggested some possibility of game theoretical approaches for communication resource sharing. However, we suggest a practical game algorithm to achieve Nash equilibrium of all secondary users using a Nash equilibrium theorem in this paper. Particularly, a game model was analyzed for adaptive power control of a cognitive radio network, which is involved in DSSS (Direct Sequence Spread Spectrum) techniques. In case of K=63 and N=12 in the DSSS network, the number of iteration was less than maximum 200 using the suggested algorithm.

  • PDF