プライマリシステムの干渉制限を考慮した周波数共用のためのリソース割り当てに関する研究

In wireless communications, the improvement of spectral efficiency isrequired due to the shortage of frequency resource. As an effectivesolution, spectrum sharing has been attracted attention. A cognitiveradio is promising technology for realization of spectrum sharing. Inthe spectrum sharing, cognitive user (secondary user) has to protectlicensed user (primary user) according to the interference constraint.However, conventional metric of interference constraint cannot avoidlarge performance degradation in primary system with widely rangeof Signal to Noise Ratio (SNR) such as a cellular system. Additionally,conventional interference constraints do not considers schedulingbehavior in cellular system. In order to solve these problems, thispaper proposes novel metric of the interference constraint whichsupports the widely SNR region of the primary system, so calledcapacity conservation ratio (CCR). The CCR is defined as the ratio ofthe capacity of the Primary receiver without interference from thesecondary transmitter, to the decreased primary capacity due tointerference. Proposed interference constraint based on CCR canprotect primary capacities over the widely SNR region. In addition,scheduling behavior of the primary system can be protected by usingproposed interference constraint. In addition, we propose transmitpower control schemes: exact and simplified power control. The exactpower control can satisfy requirement of interference constraintwithout large margin; however, transmit power cannot be derivewithout numerical analysis. In contrast, transmit power isclosed-form solution in the simplified power control with satisfyingthe interference constraint. Finally, this thesis proposes the resourcescheduling under the interference constraint. Proposed schedulingachieves the high throughput and high user fairness in the secondarysystem without increasing feedback information compared withconventional algorithm.現在、無線通信において周波数リソース不足が深刻な問題となっており、抜本的な対策技術としてコグニティブ周波数共用が注目されている。本論文では、周波数共用において既存システムの周波数帯を他システム（2 次システム）が二次利用するために干渉制限指標及びリソース割り当てに関する研究を行った。一つ目の研究では、既存システムに与える与干渉状態の評価指標について提案を行い，幅広い通信品質の既存システムを保護可能な干渉制限について評価を行った．評価ではシステムのリンクが静的モデルおよび動的なリソース配分で変更される動的モデルを用いた．二つ目の研究では，その干渉制限達成可能な送信電力制御の検討を行った。送信電力制御を行う際に，外部からチャネル情報の一部のみが得られると仮定し，確率的に変動するフェージング要素について所望のアウテージ確率を満足できるように数値解析を行い，厳密設計および簡易設計について提案を行った．三つ目の研究では、既存システムが複数端末に対して無線リソースをスケジューリングするモデルへと拡張し，2 次システムが干渉を回避しつつ，効率的リソース割り当てに関する検討を行った。電気通信大学201

Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory

Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization

A bipartite graph based proportional fair scheduling strategy to improve throughput with multiple resource blocks

The fifth-generation wireless communication is expected to provide a huge amount of capacity to cater to the need of an increasing number of mobile consumers, which can be satisfied by device-to-device (D2D) communication. Reusing the cellular user’s resources in an efficient manner helps to increase the spectrum efficiency of the network but it leads to severe interference. The important point in reusing cellular user resources is that D2D communication should not affect the cellular user’s efficiency. After achieving this requirement, the focus is now turned toward the allocation of resources to D2D communication. This resource allocation strategy is to be designed in such a way that it will not affect communication among the cellular user (CU). This scheme improves various performance objectives. This paper aims at designing a proportional fair resource allocation algorithm based on the bipartite graph which maintains the quality of service (QoS) of CUs while providing D2D communication. This algorithm can be merged with any other scheme of resource allocation for improving QoS and adopting changing channels. In this scheme, a D2D pair can be allocated with one or more than one resource blocks. The MATLAB simulations analyze the performance of the proposed scheme

Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks

In this paper, we consider a cognitive radio network that consists of one cognitive base station (CBS) and multiple cognitive users (CUs) in the presence of multiple eavesdroppers, where CUs transmit their data packets to CBS under a primary user's quality of service (QoS) constraint while the eavesdroppers attempt to intercept the cognitive transmissions from CUs to CBS. We investigate the physical-layer security against eavesdropping attacks in the cognitive radio network and propose the user scheduling scheme to achieve multiuser diversity for improving the security level of cognitive transmissions with a primary QoS constraint. Specifically, a cognitive user (CU) that satisfies the primary QoS requirement and maximizes the achievable secrecy rate of cognitive transmissions is scheduled to transmit its data packet. For the comparison purpose, we also examine the traditional multiuser scheduling and the artificial noise schemes. We analyze the achievable secrecy rate and intercept probability of the traditional and proposed multiuser scheduling schemes as well as the artificial noise scheme in Rayleigh fading environments. Numerical results show that given a primary QoS constraint, the proposed multiuser scheduling scheme generally outperforms the traditional multiuser scheduling and the artificial noise schemes in terms of the achievable secrecy rate and intercept probability. In addition, we derive the diversity order of the proposed multiuser scheduling scheme through an asymptotic intercept probability analysis and prove that the full diversity is obtained by using the proposed multiuser scheduling.Comment: 12 pages. IEEE Transactions on Communications, 201

Resource Allocation for Heterogeneous Traffic in LTE Virtual Networks

Cellular network virtualization is being considered as a key trend in future mobile networks towards improved resource utilization. However, virtualization scenarios need investigation to understand the considerations which should be taken into account when deploying virtualized wireless networks in practice. Towards this, we address the performance of a virtualized network in the presence of heterogeneous classes of traffic. In previous cellular network virtualization literature, both Real time (RT) and Non-Real time (NRT) traffic requests have been included without distinction. Both types are provisioned using the same algorithm for allocation of resources specified by the Network Scheduler [1]. However, different types of traffic have different characteristics [2], e.g., RT requests are delay sensitive but may need fixed bandwidth, and hence should be treated differently, especially when wireless channel conditions are factored into the scheduling. We recognize this difference and in this paper, we propose a new approach to improve scheduling of resources for RT and NRT traffic. In particular, we prioritize the traffic belonging to different virtual slices from all service providers (SP/VEs) at the Network Scheduler before allocating resources to different SP/VEs, i.e., We form a Virtual Prioritized Slice (VPS). The virtual prioritized slice is forwarded to the VPS scheduler to serve all RT requests first. Only after the RT traffic is scheduled, the NRT traffic is provisioned using proportional fairness (PF) scheduling. We show by simulation results that this new VPS approach helps outperform recently proposed resource allocation schemes