簡易檢索 / 詳目顯示

研究生: 吳承叡
Wu, Cheng-Jui
論文名稱: 應用於無線網路中支援連續干擾消除之隨機群組位址輪詢
Successive Interference Cancellation Based on Group Randomly Addressed Polling (GRAP) For Wireless Networks
指導教授: 張正尚
Chang, Cheng-Shang
口試委員: 李端興
Lee, Duan-Shin
林華君
Lin, Hwa-Chun
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 通訊工程研究所
Communications Engineering
論文出版年: 2019
畢業學年度: 107
語文別: 英文
論文頁數: 31
中文關鍵詞: 隨機群組位址輪詢連續干擾消除
外文關鍵詞: GRAP, SIC
相關次數: 點閱:1下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在本文中,我們考慮將一個隨機群組位址輪詢(GRAP)系統與使用連續干擾消除的不同隨機存取 (RA)系統相結合,並提出一套用來計算GRAP結合Coded Slotted ALOHA(CSA)的精確(漸進)吞吐量之分析方法,實驗結果表明,GRAP與CSA系統結合後的吞吐量優於傳統slotted ALOHA(SA)系統。確切來說,GRAP結合CSA系統在中等負載下的性能優於CSA系統。此外,我們也表明GRAP結合使用連續干擾消除的不同RA系統的吞吐量與典型不同CSA系統的吞吐量之間成正比關係。在通過廣泛的實驗模擬後,我們也驗證了我們所推導出來的GRAP結合CSA系統其吞吐量理論結果與我們的實驗模擬值是非常吻合的。


    In this thesis, we consider a Group Randomly Addressed Polling (GRAP) system with different random access (RA) schemes that use the successive interference cancellation (SIC) technique. We develop an analytical method that can be used for computing the exact (asymptotic) throughput of GRAP combined with coded slotted ALOHA (CSA) systems. It is shown that GRAP combined with CSA systems outperform the classical slotted ALOHA (SA) system in terms of throughput. In particular, GRAP combined with CSA systems outperform CSA systems in the moderate load. Moreover, we show that the throughput of GRAP with different RA schemes using SIC is proportional to the throughput of different CSA systems. By conducting extensive simulations, we also verify that our theoretical results of the throughput match extremely well with the simulation results of the throughput for the GRAP combined with CSA systems.

    Abstract Contents 1 List of Figures 3 1 Introduction 4 2 Group Randomly Addressed Polling 7 2.1 Background: GRAP system . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 GRAP with a xed number of group . . . . . . . . . . . . . . . . . . . . 8 2.3 GRAP with resampling . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.4 SIC-Based Decoding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3 Throughput Analysis of GRAP with SIC 12 3.1 Graph representation of the IC process . . . . . . . . . . . . . . . . . . . 12 3.2 The similarity between slotted ALOHA system and GRAP system . . . . 14 3.3 Iterative IC analysis of coded GRAP system . . . . . . . . . . . . . . . . 15 3.4 Throughput analysis of coded GRAP system . . . . . . . . . . . . . . . . 18 4 Numerical Results 22 5 Conclusion 28 6 Bibliography 29

    [1] C.-P. Li, J. Jiang, W. Chen, T. Ji, and J. Smee, "5g ultra-reliable and low-latency systems design," in 2017 European Conference on Networks and Communications(EuCNC). IEEE, 2017, pp. 1-5.
    [2] M. Bennis, M. Debbah, and H. V. Poor, "Ultrareliable and low-latency wireless communication: Tail, risk, and scale," Proceedings of the IEEE, vol. 106, no. 10, pp.1834-1853, 2018.
    [3] N. Abramson, "The aloha system: another alternative for computer communications," in Proceedings of the November 17-19, 1970, fall joint computer conference. ACM, 1970, pp. 281-285.
    [4] E. Paolini, G. Liva, and M. Chiani, "Random access on graphs: A survey and new results," in 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR). IEEE, 2012, pp. 1743-1747.
    [5] E. Casini, R. De Gaudenzi, and O. D. R. Herrero, "Contention resolution diversity slotted aloha (crdsa): An enhanced random access schemefor satellite access packet networks," IEEE Transactions on Wireless Communications, vol. 6, no. 4, pp. 1408-
    1419, 2007.
    [6] G. Liva, "Graph-based analysis and optimization of contention resolution diversity slotted aloha," IEEE Transactions on Communications, vol. 59, no. 2, pp. 477-487,
    2011.
    [7] M. Luby, M. Mitzenmacher, and M. A. Shokrollahi, "Analysis of random processes via and-or tree evaluation." in SODA, vol. 98, 1998, pp. 364-373.
    [8] K.-C. Chen and C.-H. Lee, "Group randomly addressed polling for multicell wire-less data networks," in Proceedings of ICC/SUPERCOMM'94-1994 International Conference on Communications. IEEE, 1994, pp. 913-917.
    [9] K.-C. Chen, "Medium access control of wireless lans for mobile computing," IEEE Network, vol. 8, no. 5, pp. 50-63, 1994.
    [10] C.-S. Chang, K.-C. Chen, M.-Y. You, and J.-F. Chang, "Guaranteed quality-of-service wireless access to atm networks," IEEE Journal on selected areas in communications, vol. 15, no. 1, pp. 106-118, 1997.
    [11] C. Stefanovic and D. Vukobratovic, "Coded random access," in Network Coding and Subspace Designs. Springer, 2018, pp. 339-359.
    [12] K. R. Narayanan and H. D. P ster, "Iterative collision resolution for slotted aloha: An optimal uncoordinated transmission policy," in 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC). IEEE, 2012,
    pp. 136-139.
    [13] D. Jakovetic, D. Bajovic, D. Vukobratovic, and V. Crnojevic, "Cooperative slotted aloha for multi-base station systems," IEEE Transactions on Communications, vol. 63, no. 4, pp. 1443-1456, 2015.
    [14] M. Newman, Networks: an introduction. Oxford university press, 2010.
    [15] 3GPP, "3gpp ts 22.104 v16.2.0," in 3rd Generation Partnership Project; Technical Speci cation Group Services and System Aspects; Service requirements for cyber-physical control applications in vertical domains; Stage 1 (Release 16), 2019, pp. 13-15.

    QR CODE