Multiple Slot Reservation for Rapid Data Traffic Transmission in the Satellite Random Access Channel 


Vol. 40,  No. 10, pp. 1889-1899, Oct.  2015


PDF
  Abstract

In this paper, we propose a multiple slot reservation scheme to transmit data rapidly in the satellite random access channel. In the R-CRDSA (Reservation scheme with Contention Resolution Diversity Slotted ALOHA), each satellite terminal can use only one slot in a frame. Therefore, many slots are wasting in the low traffic load and the satellite terminals which have large date needs many frame to transmit their data although there are unused slots. In the multiple slot reservation scheme, each satellite terminal transmits a packet with their data size and reserves many slots in the light of data size and slot reservation status. Therefore, each satellite terminal transmits their data faster than R-CRDSA. This is because they can reserve many slots in a frame. Furthermore, we simulate proposed scheme and validate the performance of proposed scheme.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Lee, J. Lee, J. Lim, H. Park, H. Noh, "Multiple Slot Reservation for Rapid Data Traffic Transmission in the Satellite Random Access Channel," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 10, pp. 1889-1899, 2015. DOI: .

[ACM Style]

Yun-sung Lee, Jin-seok Lee, Jae-sung Lim, Hyung-won Park, and Hong-jun Noh. 2015. Multiple Slot Reservation for Rapid Data Traffic Transmission in the Satellite Random Access Channel. The Journal of Korean Institute of Communications and Information Sciences, 40, 10, (2015), 1889-1899. DOI: .

[KICS Style]

Yun-sung Lee, Jin-seok Lee, Jae-sung Lim, Hyung-won Park, Hong-jun Noh, "Multiple Slot Reservation for Rapid Data Traffic Transmission in the Satellite Random Access Channel," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 10, pp. 1889-1899, 10. 2015.