Slot Assign Algorithm with Threshold Based on Irregular Repetition Slotted ALOHA (IRSA)

Huaicui Zheng; Changle Li; Ni Tian; Jun Cheng

IoT as a Service. 4th EAI International Conference, IoTaaS 2018, Xi’an, China, November 17–18, 2018, Proceedings

Research Article

Slot Assign Algorithm with Threshold Based on Irregular Repetition Slotted ALOHA (IRSA)

Download

161 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-030-14657-3_22,
    author={Huaicui Zheng and Changle Li and Ni Tian and Jun Cheng},
    title={Slot Assign Algorithm with Threshold Based on Irregular Repetition Slotted ALOHA (IRSA)},
    proceedings={IoT as a Service. 4th EAI International Conference, IoTaaS 2018, Xi’an, China, November 17--18, 2018, Proceedings},
    proceedings_a={IOTAAS},
    year={2019},
    month={3},
    keywords={Random multiple access protocol SIC CRDSA IRSA Slot assign algorithm with threshold},
    doi={10.1007/978-3-030-14657-3_22}
}

Huaicui Zheng
Changle Li
Ni Tian
Jun Cheng
Year: 2019
Slot Assign Algorithm with Threshold Based on Irregular Repetition Slotted ALOHA (IRSA)
IOTAAS
Springer
DOI: 10.1007/978-3-030-14657-3_22

Huaicui Zheng¹, Changle Li¹^,*, Ni Tian¹, Jun Cheng²^,*

1: Xidian University
2: Doshisha University

*Contact email: clli@mail.xidian.edu.cn, jcheng@mail.doshisha.ac.jp

Abstract

As successive interference cancellation (SIC) technology has become a research hotspot recently, random multiple access protocols based on SIC such as contention resolution diversity slotted ALOHA (CRDSA) and irregular repetition slotted ALOHA (IRSA) are put forward one after the other. Although throughput performance for these protocols has been improved significantly. Yet the throughput will drop dramatically when the load increases gradually. In this paper, in order to get a higher throughput in the case of high load, we propose a slot assign algorithm with threshold based on IRSA to obtain a throughput T which is more than 1.

Keywords: Random multiple access protocol SIC CRDSA IRSA Slot assign algorithm with threshold

Published: 2019-03-07
Appears in: SpringerLink

: http://dx.doi.org/10.1007/978-3-030-14657-3_22