Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Firefly Algorithm Solution to Improving Threshold Distributed Energy Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks

IAES International Journal of Artificial Intelligence · Vol. 6 No. 3 (2017) · hlm. 91–99

DOI
10.11591/ijai.v6.i3.pp91-99
ISSN
2252-8938, 2089-4872
Terbit
2017-09-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

The improvement of the lifetime of heterogeneous wireless sensor networks is a challenge for many researches. One of the most important protocols to achieve this goal is to divide the network into clusters that run by a single node called cluster head and the others have attached. However, all nodes must form the cluster including the nearest nodes to the base station which should be excluded from the clustering process. Furthermore these nodes consume more energy since each member node communicates directly with their cluster head and not with the base station. To eliminate these notes from cluster process, we need to formulate a new energy total of the network which depends on the number of these nodes. In this paper we propose a new technic to optimize this energy which basing on the firefly algorithm. The developed approach allows the boundary of the excluded nodes efficiently. Computer simulation in MATLAB proves the superiority of this method concerning the increase of the lifetime and the number of the received packet messages compared to the others protocols.

Kata kunci

Jaringan kolaborasi para penulis

3 penulis · 3 tautan kepenulisan bersama

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

  • Abdelmalek Essaâdi University
  • 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

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: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Firefly Algorithm Solution to Improving Threshold Distributed Energy Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks</dc:title>
	<dc:creator>Mostafa, Baghouri</dc:creator>
	<dc:creator>Saad, Chakkor</dc:creator>
	<dc:creator>Abderrahmane, Hajraoui</dc:creator>
	<dc:subject xml:lang="en-US"></dc:subject>
	<dc:subject xml:lang="en-US">Clustering based algorithm, Energy-efficiency, Heterogeneous wireless sensor networks, Nature-inspired, Network lifetime</dc:subject>
	<dc:description xml:lang="en-US">The improvement of the lifetime of heterogeneous wireless sensor networks is a challenge for many researches. One of the most important protocols to achieve this goal is to divide the network into clusters that run by a single node called cluster head and the others have attached. However, all nodes must form the cluster including the nearest nodes to the base station which should be excluded from the clustering process. Furthermore these nodes consume more energy since each member node communicates directly with their cluster head and not with the base station. To eliminate these notes from cluster process, we need to formulate a new energy total of the network which depends on the number of these nodes. In this paper we propose a new technic to optimize this energy which basing on the firefly algorithm. The developed approach allows the boundary of the excluded nodes efficiently. Computer simulation in MATLAB proves the superiority of this method concerning the increase of the lifetime and the number of the received packet messages compared to the others protocols.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2017-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/7969</dc:identifier>
	<dc:identifier>10.11591/ijai.v6.i3.pp91-99</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 6, No 3: September 2017; 91-99</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v6.i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/7969/6784</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>