Dragonfly Algorithm Inspired Reduced Time Complexity Scheduling Technique for Multi-Antenna Systems.
Saved in:
| Title: | Dragonfly Algorithm Inspired Reduced Time Complexity Scheduling Technique for Multi-Antenna Systems. |
|---|---|
| Authors: | Mohanty, Jyoti1 (AUTHOR) jyoti_rs@ece.nits.ac.in, Pattanayak, Prabina2 (AUTHOR) prabina.pattanayak@ieee.org, Dey, Abhinaba2 (AUTHOR) abhinaba_rs@ece.nits.ac.in, Sabat, Dukhishyam3 (AUTHOR) dukhishyam_rs@ece.nits.ac.in |
| Source: | IETE Journal of Research. Dec2025, Vol. 71 Issue 12, p3977-3992. 16p. |
| Subjects: | MIMO systems, Time complexity, Broadcasting industry, Optimization algorithms, Computer scheduling |
| Abstract: | The major disadvantage of a single input single output system is that it can only communicate with a single user at a time. The multi-input multi-output (MIMO) system solves this limitation since it makes maximum use of available resources and can communicate with numerous users at the same time. In contrast, when we utilize standard methods for multi-user MIMO broadcasting systems, such as dirty paper coding (DPC), the computational and time complexity increases as the number of users and transmit antennas grows. As a result, it is necessary to increase the throughput of the system by shortening the processing time. As a result, the binary dragonfly algorithm (binary DA) may be viewed as a solution for optimizing resource usage while also reducing the complexity related with time and calculation. When compared to other algorithms like DPC, random search, and binary bat algorithm (binary BA), it is simpler and more versatile. Because of the extra factor of parameter initialization, it has a faster convergence rate and more searching capability. When it comes to multi-link MIMO broadcasting systems, the searching capability of binary DA is beneficial in improving optimization performance. Through a series of simulations, the article demonstrates the superiority of the method when compared to competing algorithms. Moreover, it has been noticed that the suggested method accomplishes the required outcomes in a shorter amount of time as well. [ABSTRACT FROM AUTHOR] |
| Copyright of IETE Journal of Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The major disadvantage of a single input single output system is that it can only communicate with a single user at a time. The multi-input multi-output (MIMO) system solves this limitation since it makes maximum use of available resources and can communicate with numerous users at the same time. In contrast, when we utilize standard methods for multi-user MIMO broadcasting systems, such as dirty paper coding (DPC), the computational and time complexity increases as the number of users and transmit antennas grows. As a result, it is necessary to increase the throughput of the system by shortening the processing time. As a result, the binary dragonfly algorithm (binary DA) may be viewed as a solution for optimizing resource usage while also reducing the complexity related with time and calculation. When compared to other algorithms like DPC, random search, and binary bat algorithm (binary BA), it is simpler and more versatile. Because of the extra factor of parameter initialization, it has a faster convergence rate and more searching capability. When it comes to multi-link MIMO broadcasting systems, the searching capability of binary DA is beneficial in improving optimization performance. Through a series of simulations, the article demonstrates the superiority of the method when compared to competing algorithms. Moreover, it has been noticed that the suggested method accomplishes the required outcomes in a shorter amount of time as well. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 03772063 |
| DOI: | 10.1080/03772063.2025.2538587 |
