Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

An energy aware scheme for layered chain in underwater wireless sensor networks using genetic algorithm

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 11 No. 5 (2021)

DOI
10.11591/ijece.v11i5.pp4272-4280
ISSN
2722-2578, 2088-8708
Published
2021-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.

Collaboration network of the authors

9 authors · 16 co-authorship links · 5 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Abou Bekr Belkaïd
  • Université de ain Témouchent
  • University of Leicester
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Djilali MoussaouiUniversity of Abou Bekr Belkaïd3
Mohammed Hicham HachemiUniversity of Abou Bekr Belkaïd2
Haroun Errachid AdardourUniversity of Abou Bekr Belkaïd2
Rachid MerzouguiUniversity of Abou Bekr Belkaïd2
Samir KamecheUniversity of Abou Bekr Belkaïd1
Saïd AssousUniversity of Leicester1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 1 Nov 2026.
Metadata as oai_dc, converted from Crossref
<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>An energy aware scheme for layered chain in underwater wireless sensor networks using genetic algorithm</dc:title><dc:creator>Souiki, Sihem</dc:creator><dc:creator>Irid, Sidi Mohamed Hadj</dc:creator><dc:creator>Hadjila, Mourad</dc:creator><dc:description>&lt;jats:p&gt;Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2021-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v11i5.pp4272-4280</dc:identifier><dc:identifier>10.11591/ijece.v11i5.pp4272-4280</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 11 No 5 (2021); 4272</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/23667/15072</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>