在本篇論文中，我們主要是研究出了一種在具有協作接收器的衰落通道中的Coded Slotted ALOHA（CSA）系統。在以往的研究中，只考慮到了分別採用多個接收器非協作狀態下的吞吐量分析和單個接收器加上連續干擾消除 (SIC) 的吞吐量分析。而具有協作接收器的CSA的吞吐量分析非常困難，因為它必須同時處理來自連續干擾消除（SIC）的空間分集增益和時間分集增益。

為了解決這個問題，我們提出了一種抽象接收器（解碼器）， 在本文中稱為Poisson Receiver。我們證明了具有空間分集的 Slotted ALOHA（SA）系統本身也是Poisson Receiver，它們可以用作模塊來分析更複雜的系統。特別地，我們將CSA經典的 and-or tree 評估方法擴展到 Poisson-or tree評估方法，用於Coded Poisson Receiver（CPR）中的吞吐量分析。

同時我們也證明了CPR系統整體也是 Poisson Receiver。據我們所知，似乎我們的Poisson-or tree評估方法是第一種可用於計算具有空間多樣性和時間多樣性的CSA系統的精確（漸近）吞吐量的分析方法。通過進行廣泛的模擬，我們還驗證了理論結果與模擬結果的匹配程度。據我們對於同主題的其他論文的調研，我們是第一個計算出準確的吞吐量理論值的。

In this theis, we consider a coded slotted ALOHA (CSA) system in a correlated on-off fading channel with coop-erative receivers. Throughput analysis for CSA with cooperative receivers is known to be very difficult as it has to tackle both spatial diversity gain and temporal diversity gain from the successive interference cancellation (SIC) at the same time.
To tackle such a problem, we propose an abstract receiver (decoder), called a Poisson receiver in the paper. We show that slotted ALOHA (SA) systems with spatial diversity are Poisson receivers and they can be used as building blocks to analyze more complicated systems. In particular, we extend the classical and-or tree evaluation method for CSA to the Poisson-or tree evaluation method for throughput analysis in coded Poisson receivers (CPR).
We show CPR systems are also Poisson receivers. To the best of our knowledge, it seems that our Poisson-or tree evaluation method is the first analytical method that can be used for computing the exact (asymptotic) throughput of a CSA system with both spatial diversity and temporal diversity. By conducting extensive simulations, we also verify that our theoretical results match extremely well with the simulation results.

1 Introduction 4-7
2 Slootted ALOHA 8-18
3 Poisson receivers and coded Poisson receivers 19-27
4 CSA in a correlated on-off fading channel with two receivers 28-33
5 Conclusion 34
6 Bibliograpgy 35-37

[1] N. Abramson, “The aloha system: another alternative for computer communica-tions,” in Proceedings of the November 17-19, 1970, fall joint computer conference. ACM, 1970, pp. 281–285.
[2] E. Paolini, G. Liva, and M. Chiani, “Random access on graphs: A survey and new results,” in Signals, Systems and Computers (ASILOMAR), 2012 Conference Record of the Forty Sixth Asilomar Conference on. IEEE, 2012, pp. 1743–1747.
[3] E. Paolini, C. Stefanovi´c, G. Liva, and P. Popovski, “Coded random access: ap-plying codes on graphs to design random access protocols,” IEEE Communications Magazine, vol. 53, no. 6, pp. 144–150, 2015.
[4] A. Munari, F. Clazzer, and G. Liva, “Multi-receiver aloha systems-a survey and new results,” in Communication Workshop (ICCW), 2015 IEEE International Confer-ence on. IEEE, 2015, pp. 2108–2114.
[5] ˇC. Stefanovic´ and D. Vukobratovi´c, “Coded random access,” in Network Coding and Subspace Designs. Springer, 2018, pp. 339–359.
[6] A. Munari, M. Heindlmaier, G. Liva, and M. Berioli, “The throughput of slotted aloha with diversity,” in Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on. IEEE, 2013, pp. 698–706.
[7] 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, 2007.
[8] 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.
[9] 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.
[10] K. R. Narayanan and H. D. Pfister, “Iterative collision resolution for slotted aloha: An optimal uncoordinated transmission policy,” in Turbo Codes and Iterative Infor-mation Processing (ISTC), 2012 7th International Symposium on. IEEE, 2012, pp. 136–139.
[11] C. Stefanovi´c, K. F. Trilingsgaard, N. K. Pratas, and P. Popovski, “Joint estima-tion and contention-resolution protocol for wireless random access,” in 2013 IEEE International Conference on Communications (ICC). IEEE, 2013, pp. 3382–3387.
[12] D. Jakoveti´c, D. Bajovi´c, D. Vukobratovi´c, and V. Crnojevi´c, “Cooperative slot-ted aloha for multi-base station systems,” IEEE Transactions on Communications, vol. 63, no. 4, pp. 1443–1456, 2015.
[13] S. Ogata, K. Ishibashi, and G. Abreu, “Multi-access diversity gain via multiple base station cooperation in frameless aloha,” in Signal Processing Advances in Wireless Communications (SPAWC), 2017 IEEE 18th International Workshop on. IEEE, 2017, pp. 1–5.
[14] E. Paolini, G. Liva, and M. Chiani, “Graph-based random access for the collision channel without feedback: Capacity bound,” in 2011 IEEE Global Telecommunica-tions Conference-GLOBECOM 2011. IEEE, 2011, pp. 1–5.
[15] M. Newman, Networks: an introduction. OUP Oxford, 2009.
[16] G. Liva, E. Paolini, M. Lentmaier, and M. Chiani, “Spatially-coupled random ac-cess on graphs,” in 2012 IEEE International Symposium on Information Theory Proceedings. IEEE, 2012, pp. 478–482.