Preview

Journal of Instrument Engineering

Advanced search

Speed Analysis of ALOHA-Based Random-Access Algorithm with Various Slot Duration

https://doi.org/10.17586/0021-3454-2024-67-9-759-766

Abstract

   For multi-user systems of random multiple access to a common communication channel, built on the basis of the ALOHA algorithm, a method for organizing conflict resolution algorithms is considered. In such systems, the time in the common channel is divided into slots equal to the duration of the message transmission time, and subscribers randomly select a slot for transmission. In some systems, the slots have different durations, which under certain conditions can increase the speed of the algorithm. To determine these conditions, options for the influence of the slot duration on the speed of the algorithm are considered. It is shown that the speed of algorithms built on the basis of the ALOHA algorithm can be increased if the relative duration of the empty slot is different from one. An algorithm is proposed that provides the maximum speed when this condition is met. An optimization problem is formulated and solved for choosing the optimal value of the parameter at which the speed of the proposed algorithm is maximum. Similar results are demonstrated for the case when the relative duration of the empty slot is much greater than one.

About the Authors

I. A. Pastushok
St. Petersburg State University of Aerospace Instrumentation
Russian Federation

Irina A. Pastushok, Student

Department of Information Security

St. Petersburg



A. M. Turlikov
St. Petersburg State University of Aerospace Instrumentation
Russian Federation

Andrey M. Turlikov, Dr. Sci., Professor, Head of the Department

Department of Infocommunication Technologies and Communication Systems

St. Petersburg



References

1. Yu Y., Giannakis G. IEEE Transactions on Information Theory, 2007, no. 12(53), pp. 4628–4639.

2. Burkov A.A. Information and Control Systems, 2023, no. 2, pp. 39–50. (in Russ.)

3. Jeon S.-W. IEEE Transactions on Mobile Computing, 2022, vol. 22, рр. 5418–5433.

4. Tsybakov B.S., Faingol'd V.B. Problems of Information Transmission, 1992, no. 1(28), pp. 79–86.

5. Bogatyrev V.A., Bogatyrev S.V., Bogatyrev A.V. 2019 Wave Electronics and its Application in Information and Telecommunication, 2019, art. no. 8840647.

6. Bogatyrev V.A. Information Technologies, 2006, no. 9, pp. 25–30. (in Russ.) DOI: 10.1109/WECONF.2019.8840647

7. Bogatyrev V.A. Instruments and Systems: Monitoring, Control, and Diagnostics, 2006, no. 10, pp. 18–21. (in Russ.)

8. Bogatyrev V.A., Bogatyrev A.V. Information Technologies, 2016, no. 6(22), pp. 409–416. (in Russ.)

9. Tsybakov B.S., Mikhailov V.A., Likhanov N.B. Problems of Information Transmission, 1983, no. 1(19), pp. 50–68.

10. Falin G.I. Problemy Peredachi Informatsii, 1982, no. 3(18), pp. 85–90. (in Russ.)

11. Mikhailov V.A. Problems of Information Transmission, 1988, no. 1(24), pp. 47–56.

12. Rivest R. IEEE Transactions on Information Theory, 1987, no. 3(33), pp. 323–328.

13. Wu Y. IEEE Wireless Communications, 2020, no. 4(27), pp. 148–156.

14. Alhashimi H.F. Electronics, 2023, no. 3(12), pp. 647.

15. Burkov A.A., Rachugin R.O., Turlikov A.M. Information and Control Systems, 2022, no. 5, pp. 49–59, doi: 10.31799/1684-8853-2022-5-49-59.

16. Burkov A., Shneer S., Turlikov A. IEEE Communications Letters, 2020, no. 1(25), pp. 299–302.

17. Salah H., Hazem A.A., Joerg R., Heuberger A. IEEE Communications Letters, 2015, no. 11(19), pp. 2009–2015.

18. Salah H., Gaydadjiev G. IEEE Journal of Radio Frequency Identification, 2023, рр. 83–90.

19. Bianchi G. IEEE Journal on Selected Areas in Communications, 2000, no. 3(18), pp. 535–547.


Review

For citations:


Pastushok I.A., Turlikov A.M. Speed Analysis of ALOHA-Based Random-Access Algorithm with Various Slot Duration. Journal of Instrument Engineering. 2024;67(9):759-766. (In Russ.) https://doi.org/10.17586/0021-3454-2024-67-9-759-766

Views: 41


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 0021-3454 (Print)
ISSN 2500-0381 (Online)