透過您的圖書館登入
IP:3.145.206.244
  • 學位論文

全雙工之合作式感知無線電網路之干擾管理

Interference Management in Cooperative Cognitive Radio Networks with Full-­Duplex Transceivers

指導教授 : 林澤
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


我們在有多個次要基地台(secondary base stations)之合作式感知無線電網路(cooperative cognitive radio networks)上考慮在傳輸中斷(outage probability constraints)下之協調之波束設計問題(coordinated beamforming design problem),並且次要基地台配備使用分時多工存取(time devision multiple access)之全雙工(full-duplex)傳收機。所有次要基地台只知道局部通道分佈資訊(local channel distribution information)。一系列的近似方法被用來解決這個問題,像是半正定放寬(semidefinite relaxation)和第一皆近似(first-order approximation)方法。藉由解一連串凸近似問題(convex approximation problem)我們得到了一個接近最佳的解,也就是,提出來的連續凸近似(successive convex approximation)演算法產生了一個令人滿意的解。我們分析證明了{f P1}之解之任意一個極限點是一個平穩點(stationary point)。針對半雙工(half-duplex)傳收機制定協調之波束設計問題,並且在模擬裡存在一個全雙工與半雙工之折衷。此外,我們可以觀察到自干擾(self-interference)限制了全雙工傳收機的表現。藉由比較連續凸近似演算法與天線選擇(antenna selection)、最大比例傳送(maximum ratio transmission)之表現來檢驗其演算法之表現。

並列摘要


We consider the coordinated beamforming design problem for the cooperative cognitive radio networks (CCRN) with multiple secondary base station (SBS) under outage probability constraints, and the SBSs are equipped with full-duplex (FD) transceivers applying time division multiple access (TDMA) for transmission. All SBSs only know the local channel distribution information (CDI). A series of approximation methods are employed to deal with this problem, such as semidefinite relaxation (SDR) and first-order approximation method. We obtain the near-optimal solution via solving a sequence of convex approximation problems, i.e., the proposed efficient successive convex approximation (SCA) algorithm yields a satisfactory solution. We analytically prove that any limit point of the conservative approximation problem P1’s solution is a stationary point. The coordinated beamforming design problem for the SBS with half-duplex (HD) transceiver is formulated, and there exists a tradeoff between FD and HD transceivers in the simulation results. Furthermore, we can observe that the self-interference limits the performance of FD transceivers. The performance of the proposed SCA algorithm is examined by comparing with exhaustive search method, antenna selection (AS) scheme, and maximum ratio transmission (MRT).

參考文獻


[1] J. Mitola and J. Maguire, G.Q., “Cognitive radio: making software radios more personal,” Per- sonal Communications, IEEE, vol. 6, no. 4, pp. 13–18, Aug 1999.
[2] F.Negro,I.Ghauri,andD.T.M.Slock,“Transmissiontechniquesandchannelestimationforspa- tial interweave tdd cognitive radio systems,” in Signals, Systems and Computers, 2009 Conference Record of the Forty-Third Asilomar Conference on, Nov 2009, pp. 523–527.
[3] A. Goldsmith, S. Jafar, I. Maric, and S. Srinivasa, “Breaking spectrum gridlock with cognitive radios: An information theoretic perspective,” Proceedings of the IEEE, vol. 97, no. 5, pp. 894– 914, May 2009.
[4] S. Srinivasa and S. Jafar, “The throughput potential of cognitive radio: A theoretical perspective,” in Signals, Systems and Computers, 2006. ACSSC ’06. Fortieth Asilomar Conference on, Oct 2006, pp. 221–225.
[5] M. H. M. Costa, “Writing on dirty paper (corresp.),” Information Theory, IEEE Transactions on, vol. 29, no. 3, pp. 439–441, May 1983.

延伸閱讀