Cognitive Wyner Networks with Clustered Decoding

We study an interference network where equally-numbered transmitters and receivers lie on two parallel lines, each transmitter opposite its intended receiver. We consider two short-range interference models: the "asymmetric network," where the signal sent by each transmitter is interfered only by the signal sent by its left neighbor (if present), and a "symmetric network," where it is interfered by both its left and its right neighbors. Each transmitter is cognizant of its own message, the messages of the $t_\ell$ transmitters to its left, and the messages of the $t_r$ transmitters to its right. Each receiver decodes its message based on the signals received at its own antenna, at the $r_\ell$ receive antennas to its left, and the $r_r$ receive antennas to its right. For such networks we provide upper and lower bounds on the multiplexing gain, i.e., on the high-SNR asymptotic logarithmic growth of the sum-rate capacity. In some cases our bounds meet, e.g., for the asymmetric network. Our results exhibit an equivalence between the transmitter side-information parameters $t_\ell, t_r$ and the receiver side-information parameters $r_\ell, r_r$ in the sense that increasing/decreasing $t_\ell$ or $t_r$ by a positive integer $\delta$ has the same effect on the multiplexing gain as increasing/decreasing $r_\ell$ or $r_r$ by $\delta$. Moreover---even in asymmetric networks---there is an equivalence between the left side-information parameters $t_\ell, r_\ell$ and the right side-information parameters $t_r, r_r$.Comment: Second revision submitted to IEEE Transactions on Information Theor

Cooperative Wideband Spectrum Sensing Based on Joint Sparsity

COOPERATIVE WIDEBAND SPECTRUM SENSING BASED ON JOINT SPARSITY By Ghazaleh Jowkar, Master of Science A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science at Virginia Commonwealth University Virginia Commonwealth University 2017 Major Director: Dr. Ruixin Niu, Associate Professor of Department of Electrical and Computer Engineering In this thesis, the problem of wideband spectrum sensing in cognitive radio (CR) networks using sub-Nyquist sampling and sparse signal processing techniques is investigated. To mitigate multi-path fading, it is assumed that a group of spatially dispersed SUs collaborate for wideband spectrum sensing, to determine whether or not a channel is occupied by a primary user (PU). Due to the underutilization of the spectrum by the PUs, the spectrum matrix has only a small number of non-zero rows. In existing state-of-the-art approaches, the spectrum sensing problem was solved using the low-rank matrix completion technique involving matrix nuclear-norm minimization. Motivated by the fact that the spectrum matrix is not only low-rank, but also sparse, a spectrum sensing approach is proposed based on minimizing a mixed-norm of the spectrum matrix instead of low-rank matrix completion to promote the joint sparsity among the column vectors of the spectrum matrix. Simulation results are obtained, which demonstrate that the proposed mixed-norm minimization approach outperforms the low-rank matrix completion based approach, in terms of the PU detection performance. Further we used mixed-norm minimization model in multi time frame detection. Simulation results shows that increasing the number of time frames will increase the detection performance, however, by increasing the number of time frames after a number of times the performance decrease dramatically

Approximate Sum-Capacity of K-user Cognitive Interference Channels with Cumulative Message Sharing

This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of the users with index less than i. We propose a computable outer bound valid for any memoryless channel. We first evaluate the sum-rate outer bound for the high- SNR linear deterministic approximation of the Gaussian noise channel. This is shown to be capacity for the 3-user channel with arbitrary channel gains and the sum-capacity for the symmetric K-user channel. Interestingly. for the K user channel having only the K th cognitive know all the other messages is sufficient to achieve capacity i.e cognition at transmitter 2 to K-1 is not needed. Next the sum capacity of the symmetric Gaussian noise channel is characterized to within a constant additive and multiplicative gap. The proposed achievable scheme for the additive gap is based on Dirty paper coding and can be thought of as a MIMO-broadcast scheme where only one encoding order is possible due to the message sharing structure. As opposed to other multiuser interference channel models, a single scheme suffices for both the weak and strong interference regimes. With this scheme the generalized degrees of freedom (gDOF) is shown to be a function of K, in contrast to the non cognitive case and the broadcast channel case. Interestingly, it is show that as the number of users grows to infinity the gDoF of the K-user cognitive interference channel with cumulative message sharing tends to the gDoF of a broadcast channel with a K-antenna transmitter and K single-antenna receivers. The analytical additive additive and multiplicative gaps are a function of the number of users. Numerical evaluations of inner and outer bounds show that the actual gap is less than the analytical one.Comment: Journa

Sequentially Distributed Coalition Formation Game for Throughput Maximization in C-RANs

Cloud radio access network (C-RAN) has been proposed as a solution to reducing the huge cost of network upgrade while providing the spectral and energy efficiency needed for the new generation cellular networks. In order to reduce the interference that occur in C-RAN and maximize throughput, this paper proposes a sequentially distributed coalition formation (SDCF) game in which players, in this case the remote radio heads (RRHs), can sequentially join multiple coalitions to maximize their throughput. Contrary to overlapping coalition formation (OCF) game where players contribute fractions of their limited resources to different coalitions, the SDCF game offers better stability by allowing sequential coalition formation depending on the availability of resources and therefore providing a balance between efficient spectrum use and interference management. An algorithm for the proposed model is developed based on the merge-only method. The performance of the proposed algorithm in terms of stability, complexity and convergence to final coalition structure is also investigated. Simulation results show that the proposed SDCF game did not only maximize the throughput in the C-RAN, but it also shows better performances and larger capabilities to manage interference with increasing number of RRHs compared to existing methods

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

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