Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
  • First Online:
IoT as a Service (IoTaaS 2018)

Included in the following conference series:

  • 897 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramson, N.: THE ALOHA SYSTEM - another alternative for computer communications. In: Proceedings of Fall Joint Computer Conference, pp. 281–285. ACM, New York (1970)

    Google Scholar 

  2. Davis, D.-H., Gronemeyer, S.-A.: Performance of slotted ALOHA random access with delay capture and randomized time of arrival. IEEE Trans. Commun. 28(5), 703–710 (1980)

    Article  Google Scholar 

  3. Gagan, L.-C., Stephen, S.-R.: Diversity ALOHA - a random access scheme for satellite communications. IEEE Trans. Commun. 31(3), 450–457 (1983)

    Article  Google Scholar 

  4. Liang, Y., Li, X., Zhang, J., Liu, Y.: A novel random access scheme based on successive interference cancellation for 5G networks. In: Wireless Communications and Networking Conference, pp. 1–6. IEEE, San Francisco (2017)

    Google Scholar 

  5. Stefanovic, C., Lazaro, F., Popovski, P.: Frameless ALOHA with reliability-latency guarantees. In: 2017 IEEE Global Communications Conference, pp. 1–6. IEEE, Singapore (2017)

    Google Scholar 

  6. Lzaro, F., Stefanović, Ć.: Finite-length analysis of frameless ALOHA with multi-user detection. IEEE Commun. Lett. 214, 769–772 (2017)

    Article  Google Scholar 

  7. Casini, E., De Gaudenzi, R., Del Rio Herrero, O.: Contention resolution diversity slotted ALOHA (CRDSA): an enhanced random access schemefor satellite access packet networks. IEEE Trans. Wirel. Commun. 6(4), 1408–1419 (2007)

    Article  Google Scholar 

  8. Liva, G.: Graph-based analysis and optimization of contention resolution diversity slotted ALOHA. IEEE Trans. Commun. 59(2), 477–487 (2011)

    Article  Google Scholar 

  9. Vem, A., Narayanan, K.-R., Cheng, J., Chamberland J.-F.: A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel. In: 2017 IEEE Information Theory Workshop, pp. 6–10. IEEE, Kaohsiung (2017)

    Google Scholar 

  10. Narayanan, K.-R., Pfister, H.-D.: Iterative collision resolution for slotted ALOHA: an optimal uncoordinated transmission policy. In: 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, pp. 136–139. IEEE, Gothenburg (2012)

    Google Scholar 

  11. Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work was supported in part by the National Natural Science Foundation of China under Grants U1801266, and 61571350, and in part by the Key Research and Development Program of Shaanxi under Contract 2017KW-004, Contract 2017ZDXM-GY-022, Contract 2018ZDXMGY-038, and Contract 2018ZDCXL-GY-04-02.

Author information

Authors and Affiliations

  1. State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, 710071, China

    Huaicui Zheng, Changle Li & Ni Tian

  2. Department of Intelligent Information Engineering and Science, Doshisha University, Kyoto, 6008586, Japan

    Jun Cheng

Authors
  1. Huaicui Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Changle Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ni Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Changle Li .

Editor information

Editors and Affiliations

  1. Northwestern Polytechnical University, Xi′an, China

    Bo Li

  2. Northwestern Polytechnical University, Xi'an, China

    Mao Yang

  3. Shandong University, Jinan, Qinghai, China

    Hui Yuan

  4. Northwestern Polytechnical University, Xi'an, Shaanxi, China

    Zhongjiang Yan

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zheng, H., Li, C., Tian, N., Cheng, J. (2019). Slot Assign Algorithm with Threshold Based on Irregular Repetition Slotted ALOHA (IRSA). In: Li, B., Yang, M., Yuan, H., Yan, Z. (eds) IoT as a Service. IoTaaS 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 271. Springer, Cham. https://doi.org/10.1007/978-3-030-14657-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14657-3_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14656-6

  • Online ISBN: 978-3-030-14657-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics