Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

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

Bulletin of Electrical Engineering and Informatics · Vol. 12 No. 1 (2022) · hlm. 224–231

DOI
10.11591/eei.v12i1.4078
ISSN
2089-3191, 2302-9285
Terbit
2022-11-07
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

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.

Kata kunci

Jaringan kolaborasi para penulis

6 penulis · 7 tautan kepenulisan bersama · 3 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Technology - Iraq
  • University of Baghdad
  • Mustansiriyah University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Russul HaithamAfiliasi tidak diketahui1
Aseel Ghazi MahmoudUniversity of Baghdad1
Nadia Moqbel HassanMustansiriyah University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">MOCAB/HEFT algorithm of multi radio wireless communication improved achievement assessment</dc:title><dc:creator>Thaar Habeb Nasser</dc:creator><dc:creator>Ekhlas Kadhum Hamza</dc:creator><dc:creator>Ahmed Mudheher Hasan</dc:creator><dc:subject>task scheduling</dc:subject><dc:subject>heterogeneous computing</dc:subject><dc:subject>transmission path selection</dc:subject><dc:subject>packet delivery ratio</dc:subject><dc:subject>broadcast redundancy</dc:subject><dc:description xml:lang="en">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.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2022-11-07</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v12i1.4078</dc:identifier><dc:identifier>10.11591/eei.v12i1.4078</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 12 No 1 (2022); 224-231</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/4078/3070</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>