Earticle

초록

영어

Slotted-Aloha (S-Aloha) has been widely employed in random access networks owing to its simple implementation in a distributed manner. To enhance the throughput performance of the S-Aloha, connection-based slotted-Aloha (CS-Aloha) has been proposed in recent years. The fundamental principle of the CS-Aloha is to establish a connection with a short-sized request packet before transmitting data packets. Subsequently, the connected node transmits long-sized data packets in a batch of size 𝑀 . This approach efficiently reduces collisions, resulting in improved throughput compared to the S-Aloha, particularly for a large 𝑀 . In this paper, we address the short-term fairness of the CS-Aloha, as quantified by Jain’s fairness index. Specifically, we evaluate how equitably the CS-Aloha allocates time slots to all nodes in the network within a finite time interval. Through simulation studies, we identify the impact of system parameters on the short-term fairness of the CS-Aloha and propose an optimal transmission probability to support short-term fairness.

목차

Abstract
1. Introduction
2. Overview of the CS-Aloha
3. Short-term Fairness
4. Simulation Studies
4.1 Parameter setup
4.2 Impact of the window size 𝒘 on the short-term fairness of the CS-Aloha
4.3 Impact of the batch size M on the short-term fairness of the CS-Aloha
4.4 Impact of the transmission probability r on the short-term fairness of the CS-Aloha
5. Conclusion
References

키워드

저자

• Yoora Kim [ Associate Professor, Department of Mathematics, University of Ulsan, Korea ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  The International Journal of Advanced Smart Convergence

• 간기

  계간

• pISSN

  2288-2847

• eISSN

  2288-2855

• 수록기간

  2012~2025

• 십진분류

  KDC 326 DDC 380