MOCAB/HEFT algorithm of multi radio wireless communication improved achievement assessment

Abstract

Network-wide conveying is vital in remote associations, and the great part of these broadcasts are built on single-channel single-radio (SC-SR) network frameworks. The problem of the current work is divided into two parts. The first part shows that increasing broadcast and redundancy lead to an increase in time consumption. The second problem is solving complexity problems when tasks are scheduled in a heterogeneous manner in a computing system, where the processors in the network may not be identical and take different time periods to carry out the same task. The goals of this work are to reduce the total cost of network-wide broadcasting to minimize the search space and to solve the complexity problem when tasks are scheduled in a heterogeneous way in the computing system. The MOCAB algorithm is used to select the best transmission path over the network in the first stage. Then, the tasks will be scheduled using the heterogeneous earliest finish time (HEFT) algorithm to extract the values of actual finish time (AFT), earliest start time (EST), and earliest finish time (EFT). The performance of the MOCAB algorithm was evaluated with that of the HEFT algorithm in terms of the delivery ratio of packets delivered. The results showed that the MOCAB algorithm outperformed the HEFT.