All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Journal of Internet Technology

  • ISSN

    1607-9264

  • e-ISSN

  • Volume of the periodical

    19

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    TW - TAIWAN (PROVINCE OF CHINA)

  • Number of pages

    8

  • Pages from-to

    1111-1118

  • UT code for WoS article

    000441139700014

  • EID of the result in the Scopus database

    2-s2.0-85052023549