A Clustering Scheme for Wireless Sensor Networks Based on Genetic Algorithm and Dominating Set

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10241897" target="_blank" >RIV/61989100:27240/18:10241897 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.3966/160792642018081904014" target="_blank" >http://dx.doi.org/10.3966/160792642018081904014</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3966/160792642018081904014" target="_blank" >10.3966/160792642018081904014</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Clustering Scheme for Wireless Sensor Networks Based on Genetic Algorithm and Dominating Set

Popis výsledku v původním jazyce

The basic K-center problem is a fundamental facility location problem. Given n vertices with some distances, one wants to build k facilities in different vertices, so as to minimize the maximum distance from a vertex to its corresponding facility. This problem is known as the NP-hard problem, and grouping sensor nodes into a cluster is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption, and achieving better network performance. This study proposed a new method for solving the K-center problem based on the Genetic algorithm and dominating (GADO) set, and it is called the GADO method for wireless sensor network. An evaluation of the proposed GADO shows a decrease in the number of the centers compared to the well-known Farthest-first traversal method and dominating set only-based methods. Not only is the total distance from the centers to the sink node less than the other two algorithms, but the proposed GADO also diminishes the data delay and increases the lifetime of the centers.

Název v anglickém jazyce

A Clustering Scheme for Wireless Sensor Networks Based on Genetic Algorithm and Dominating Set

Popis výsledku anglicky

The basic K-center problem is a fundamental facility location problem. Given n vertices with some distances, one wants to build k facilities in different vertices, so as to minimize the maximum distance from a vertex to its corresponding facility. This problem is known as the NP-hard problem, and grouping sensor nodes into a cluster is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption, and achieving better network performance. This study proposed a new method for solving the K-center problem based on the Genetic algorithm and dominating (GADO) set, and it is called the GADO method for wireless sensor network. An evaluation of the proposed GADO shows a decrease in the number of the centers compared to the well-known Farthest-first traversal method and dominating set only-based methods. Not only is the total distance from the centers to the sink node less than the other two algorithms, but the proposed GADO also diminishes the data delay and increases the lifetime of the centers.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Internet Technology

ISSN

1607-9264

e-ISSN

—

Svazek periodika

19

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

TW - Čínská republika (Tchaj-wan)

Počet stran výsledku

8

Strana od-do

1111-1118

Kód UT WoS článku

000441139700014

EID výsledku v databázi Scopus

2-s2.0-85052023549