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”

Modified Genetic Algorithm with Sorting Process for Wireless Sensor Network

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F20%3A10246984" target="_blank" >RIV/61989100:27240/20:10246984 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007%2F978-981-15-0324-5_33" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-981-15-0324-5_33</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-981-15-0324-5_33" target="_blank" >10.1007/978-981-15-0324-5_33</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Modified Genetic Algorithm with Sorting Process for Wireless Sensor Network

  • Original language description

    The genetic algorithm is widely used in optimization problems, in which, a population of candidate solutions is mutated and altered toward better solutions. Usually, genetic algorithm works in optimization problem with a fitness function which is used to evaluate the feasibility and quality of a solution. However, sometimes, it is hard to define the fitness function when there are several optimization objectives, especially only one solution can be selected from a population. In this paper, we modified genetic algorithms with a novel-sorting process to solve the above problem. Two algorithms, the classic genetic algorithm and newly proposed recently M-Genetic algorithm, are simulated and altered by embedding the novel-sorting process. Besides, both the algorithms and their alteration versions are applied into wireless sensor network for locating Relay nodes. The sensor node loss and package loss number are reduced in genetic algorithms with our sorting process compared to the original ones. (C) 2020, Springer Nature Singapore Pte Ltd.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

    <a href="/en/project/EF16_027%2F0008463" target="_blank" >EF16_027/0008463: Science without borders</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • 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

  • Article name in the collection

    Advances in Intelligent Systems and Computing. Volume 1059

  • ISBN

    978-981-15-0323-8

  • ISSN

    2194-5357

  • e-ISSN

    2194-5365

  • Number of pages

    8

  • Pages from-to

    381-388

  • Publisher name

    Springer

  • Place of publication

    Singapur

  • Event location

    Ostrava

  • Event date

    Mar 21, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article