請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/40320完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 陳光禎 | |
| dc.contributor.author | Sung-Yin Shih | en |
| dc.contributor.author | 施頌音 | zh_TW |
| dc.date.accessioned | 2021-06-14T16:44:46Z | - |
| dc.date.available | 2011-08-18 | |
| dc.date.copyright | 2011-08-18 | |
| dc.date.issued | 2011 | |
| dc.date.submitted | 2011-08-12 | |
| dc.identifier.citation | [1] NTIA, “U.S. frequency allocation allocation, [online]
http://www.ntia.doc.gov/osmhome/allochrt.pdf.” [2] 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. [3] F. Report and Order, “Federal communication commission std,” FCC 02-48, Feb. 2002. [4] S. Haykin, “Cognitive radio: brain-empowered wireless communications,” IEEE J. Sel. Areas Commun., vol. 23, no. 2, pp. 201–220, Feb. 2005. [5] I. Mitola, J., “Cognitive radio for flexible mobile multimedia communications,” in Proc. IEEE MoMuC, 1999. [6] K.-C. Chen, Y.-J. Peng, N. R. Prasad, Y.-C. Liang, and S. Sun, “Cognitive radio network architecture: Part i-general structure,” ACM ICUIMC, Seoul, 2008. [7] T. Yucek and H. Arslan, “A survey of spectrum sensing algorithms for cognitive radio applications,” IEEE Communications Surveys Tutorials, vol. 11, no. 1, pp. 116 –130, 2009. [8] Q. Zhao and B. Sadler, “A survey of dynamic spectrum access,” IEEE Signal Process. Mag., vol. 24, no. 3, pp. 79–89, May 2007. [9] G. Ganesan and Y. G. Li, “Cooperative spectrum sensing in cognitive radio– part i: two user networks,” IEEE Trans. Wireless Commun., vol. 6, no. 6, pp. 2204–2213, Jun. 2007. [10] K.-C. Chen, B. K. Cetin, Y.-C. Peng, N. Prasad, J. Wang, and S. Lee, “Routing for cognitive radio networks consisting of opportunistic links,” in Proc. Wiley WCMC, 2009. [11] Y. Shi, T. Hou, and H. Zhou, “Per node based optimal power control for multihop cognitive radio networks,” IEEE Trans. Wireless Commun., vol. 8, no. 10, pp. 5290–5299, Oct. 2009. [12] S.-Y. Tu and K.-C. Chen, “General spectrum sensing in cognitive radio networks,” submitted to IEEE Trans. Inf. Theory, arXiv:0907.2859v1, Jul. 2009. [13] D. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289–1306, Apr. 2006. [14] E. Candes, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Comm. Pure Appl. Math., vol. 59, no. 8, pp. 1207–1223, Aug. 2006. [15] R. Baraniuk, “Compressive sensing [lecture notes],” IEEE Signal Process. Mag., vol. 24, no. 4, pp. 118–121, Jul. 2007. [16] E. Candes and M. Wakin, “An introduction to compressive sampling,” IEEE Signal Process. Mag., vol. 25, no. 2, pp. 21 –30, Mar. 2008. [17] M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk, “Single-pixel imaging via compressive sampling,” Signal Processing Mag- azine, IEEE, vol. 25, no. 2, pp. 83 –91, Mar. 2008. [18] J. A. Bazerque and G. B. Giannakis, “Distributed spectrum sensing for cognitive radio networks by exploiting sparsity,” IEEE Trans. Signal Process., vol. 58, no. 3, pp. 1847–1862, Mar. 2010. [19] L. Husheng, “Reconstructing geographical-spectral pattern in cognitive radio networks,” in Proc. IEEE CrownCom, 2010. [20] T.-W. Chiang and K.-C. Chen, “Synthetic aperture radar construction of spectrum map for cognitive radio networking,” in Proc. ACM IWCMC, 2010. [21] Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, “Counter braids: A novel counter architecture for per-flow measurement,” in ACM SIGMETRICS Int. Conf. Meas. Model. Comput. Syst., 2008, pp. 121–132. [22] S. Sarvotham, D. Baron, and R. Baraniuk, “Sudocodes - fast measurement and reconstruction of sparse signals,” in IEEE International Symposium on Information Theory, Jul. 2006, pp. 2804 –2808. [23] D. Baron, S. Sarvotham, and R. Baraniuk, “Bayesian compressive sensing via belief propagation,” IEEE Trans. Signal Process., vol. 58, no. 1, pp. 269 –280, Jan. 2010. [24] W. Wang, M. Wainwright, and K. Ramchandran, “Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices,” IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2967 –2979, Jun. 2010. [25] R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, “Combining geometry and combinatorics: A unified approach to sparse signal recovery,” in 46th Annual Allerton Conference on Communication, Control, and Computing, Sep. 2008, pp. 798 –805. [26] W. Xu and B. Hassibi, “Efficient compressive sensing with deterministic guarantees using expander graphs,” in IEEE Information Theory Workshop, Sep. 2007, pp. 414 –419. [27] V. Guruswami, C. Umans, and S. Vadhan, “Unbalanced expanders and randomness extractors from parvaresh-vardy codes,” in 27th Annual IEEE Conference on Computational Complexity, CCC ’07., Jun. 2007, pp. 96 –108. [28] P. Indyk, “Explicit constructions for compressed sensing of sparse signals,” in 19th Annu. ACM-SIAM Symp. Discrete Algorithms, 2008, pp. 30–33. [29] S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank, “Efficient and robust compressed sensing using optimized expander graphs,” IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4299 –4308, Sep. 2009. [30] M. Khajehnejad, A. Dimakis, W. Xu, and B. Hassibi, “Sparse recovery of nonnegative signals with minimal expansion,” IEEE Trans. Signal Process., vol. 59, no. 1, pp. 196 –208, Jan. 2011. [31] B. Karp and H. T. Kung, “GPSR: Greedy perimeter stateless routing for wireless sensor networks,” in Proc. ACM MobiCom, 2000. [32] C.-K. Yu, K.-C. Chen, and S.-M. Cheng, “Cognitive radio network tomography,” IEEE Trans. Veh. Technol., vol. 59, no. 4, pp. 1980–1997, May 2010. [33] B. Chen, Z. Zhou, Y. Zhao, and H. Yu, “Efficient error estimating coding: feasibility and applications,” in Proc. ACM SIGCOMM, 2010. [34] W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak, “Compressive wireless sensing,” in Proc. IEEE IPSN, 2006. [35] P. Tune, S. R. Bhaskaran, and S. Hanly, “Number of measurements in sparse signal recovery,” in Proc. IEEE ISIT, 2009. [36] D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization,” Proc. Nat. Acad. Sci., vol. 100, no. 5, pp. 2197–2202, 2003. [37] S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Rev., vol. 43, no. 1, p. 129V159, 2001. [38] J. Tropp and A. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655 –4666, Dec. 2007. [39] M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 1.21,” http://cvxr.com/cvx, May 2010. [40] F. Aurenhammer, “Voronoi diagrams : a survey of a fundamental geometric data structure,” ACM Comput. Surv., vol. 23, pp. 345–405, September 1991. [41] T. M. Cover and J. A. Thomas, Elements of information theory. Wiley- Interscience, 1991. [42] A. Gilbert and P. Indyk, “Sparse recovery using sparse matrices,” Proceedings of the IEEE, vol. 98, no. 6, pp. 937 –947, Jun. 2010. [43] P. Indyk and M. Ruzic, “Near-optimal sparse recovery in the l1 norm,” in 49th Annu. Symp. Found. Comput. Sci., 2008, pp. 199–207. [44] R. Berinde, P. Indyk, and M. Ruzic, “Practical near-optimal sparse recovery in the l1 norm,” in 46th Annu. Allerton Conf. Commun. Control Comput., 2008, pp. 198–205. [45] A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin, “One skech for all: Fast algorithms for compressed sensing,” in 39th Annu. ACM Symp. Theory Comput., 2007, pp. 237–246. [46] M. Sipser and D. Spielman, “Expander codes,” IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710 –1722, Nov. 1996. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/40320 | - |
| dc.description.abstract | 感知無線電網路(cognitive radio networks)由主要網路(primary network)與次要網路(secondary network)所組成，藉由次要網路執行頻譜偵測(spectrum sensing)來充分使用被主要網路浪費的無線電資源(radio resource)，解決現今越來越多無線裝置需要使用無線電資源、然而現有頻譜分配政策卻導致頻譜使用效率低落的棘手問題。另一方面，現存合作式中繼技術(cooperative relay)使感知無線電網路能夠進行多點傳輸(multi-hop transmission)，然而為達到成功的網路功能，則必須仰賴與地理位置相關的無線電資源使用狀況，因此如何獲取此資訊則為傳統頻譜偵測的一大挑戰。
本論文提出具有頻譜與地理位置資訊的頻譜地圖。有別於常見感知無線電網 路受限於臨機鏈結而只能討論統計特性，頻譜地圖成功幫助在高度動態環境下的 多點傳輸路由機制。由於頻譜偵測只能提供感知無線電使用者局部區域的資訊， 使得頻譜地圖的建立面臨困難；我們採用前瞻性的壓縮取樣技術，藉由極少數的 局部偵測結果即可完成頻譜地圖的建立。除此之外，我們使用消息理論分析建立 頻譜地圖的通訊開銷(communication overhead)理論值，並使用擴展圖 (expander graph)將頻譜地圖的概念具體化。最後我們運用頻譜地圖進行可靠的 感知無線電端對端(end to end)封包傳輸，同時保證主要使用者的通訊品質並最 大化次要網路的網路吞吐量。 | zh_TW |
| dc.description.abstract | Cooperative relay enables general multi-hop cognitive radio networks (CRN) over cognitive radios (CR) and nodes of primary system (PS). However, successful CR networking such as routing relies on the knowledge of radio resource availability associated with location, which is a challenge of traditional spectrum sensing. We introduce the concept of spectrum map encompassing spectrum and location information
to deterministically assist multi-hop routing in highly dynamic environment, while common routing of CRN paying attention to statistical nature of opportunistic links. Since it is not feasible to construct the entire spectrum map as traditional spectrum sensing only knows local information of CR transmitter, we adopt the novel compressed sensing technique to establish spectrum map based on a small number of available local sensing results. Besides directly apply Compressed Sensing theory, we theoretically analyze the communication overhead and practically construct the spectrum map via expander graph. Finally we use spectrum map to reliably route packets of CRs in an end-to-end way, under the guaranteed outage for nodes in PS and maximizing the throughput among cooperative CRs. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-14T16:44:46Z (GMT). No. of bitstreams: 1 ntu-100-R98942039-1.pdf: 2895501 bytes, checksum: 0475e7d5fba6a820d55b31af9fe15cd1 (MD5) Previous issue date: 2011 | en |
| dc.description.tableofcontents | Abstract i
Contents ii List of Figures iv List of Tables vi 1 Introduction 1 1.1 Cognitive Radio Networks . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Motivation and Challenge of Spectrum Map . . . . . . . . . . . . . . 4 1.3 Background of Compressed Sensing . . . . . . . . . . . . . . . . . . . 6 1.4 Overview of Spectrum Map Construction and Applications . . . . . . 7 1.5 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2 Compressed Sensing Construction of Spectrum Map 11 2.1 Spectrum Map Definition . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.2 Information-Exchange Mechanism . . . . . . . . . . . . . . . . . . . . 13 2.3 CS formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.3.1 Verification of the sparse signal . . . . . . . . . . . . . . . . . 19 2.3.2 The measurement matrix satisfies RIP . . . . . . . . . . . . . 20 2.3.3 Reconstruction algorithm . . . . . . . . . . . . . . . . . . . . . 21 2.4 Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 2.4.1 Environment setting . . . . . . . . . . . . . . . . . . . . . . . 23 2.4.2 Spectrum Map Construction . . . . . . . . . . . . . . . . . . . 24 2.4.3 Construction Error . . . . . . . . . . . . . . . . . . . . . . . . 24 3 Analysis of Minimum Feedback Overhead 26 3.1 Necessary feedback information . . . . . . . . . . . . . . . . . . . . . 26 3.2 Communication overhead . . . . . . . . . . . . . . . . . . . . . . . . . 28 3.3 Information theoretic limit . . . . . . . . . . . . . . . . . . . . . . . . 30 3.4 Numerical Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 4 Explicit Construction of Spectrum Map 36 4.1 Explicit Spectrum Map Construction via Expander Graph . . . . . . 38 4.2 The Sparse RIP-(1) Measurement Matrix . . . . . . . . . . . . . . . . 41 4.3 Minimal Expansion of Measurement Matrix . . . . . . . . . . . . . . 43 4.4 Numerical Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 4.4.1 Recovery Probability of Adjacency Matrix A and Perturbation Matrix ˜A. . . . . . . . . . . . . . . . . . . . . . . . . . . 46 4.4.2 Performance of Different Decoding Algorithms . . . . . . . . . 46 5 Routing by Spectrum Map in Cognitive Radio Networks 49 5.1 Spectrum Map-aided Routing (SMAR) . . . . . . . . . . . . . . . . . 49 5.1.1 Spectrum Map of Interference Power Level . . . . . . . . . . . 50 5.1.2 Spectrum Map of One-bit Receiving Ability . . . . . . . . . . 51 5.2 Performance Measure . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 5.3 Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 5.3.1 Demonstration of Proposed Routing Algorithm . . . . . . . . 55 5.3.2 Routing Performance Analysis . . . . . . . . . . . . . . . . . . 55 6 Conclusion 59 Bibliography 61 | |
| dc.language.iso | en | |
| dc.subject | 多點傳輸路由設計 | zh_TW |
| dc.subject | 頻譜地圖 | zh_TW |
| dc.subject | 壓縮取樣 | zh_TW |
| dc.subject | 擴展圖 | zh_TW |
| dc.subject | 合作式中繼 | zh_TW |
| dc.subject | 感知無線電網路 | zh_TW |
| dc.subject | Cooperative relay | en |
| dc.subject | Routing in Cognitive Radio Networks | en |
| dc.subject | Expander graph | en |
| dc.subject | Spectrum map | en |
| dc.subject | Compressed Sensing | en |
| dc.title | 以壓縮取樣技術建立感知無線電網路之頻譜地圖及其應用 | zh_TW |
| dc.title | Compressed Sensing Construction of Spectrum Map in Cognitive Radio Networks and Its Applications | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 99-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 貝蘇章,蘇育德,林嘉慶,張寶基 | |
| dc.subject.keyword | 頻譜地圖,合作式中繼,壓縮取樣,擴展圖,感知無線電網路,多點傳輸路由設計, | zh_TW |
| dc.subject.keyword | Spectrum map,Cooperative relay,Compressed Sensing,Expander graph,Routing in Cognitive Radio Networks, | en |
| dc.relation.page | 66 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2011-08-12 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
| 顯示於系所單位： | 電信工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-100-1.pdf 未授權公開取用 | 2.83 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。