Hybrid algorithm optimization for coverage problem in wireless sensor networks

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10251987" target="_blank" >RIV/61989100:27240/22:10251987 - isvavai.cz</a>

Result on the web

<a href="https://link.springer.com/article/10.1007/s11235-022-00883-5" target="_blank" >https://link.springer.com/article/10.1007/s11235-022-00883-5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11235-022-00883-5" target="_blank" >10.1007/s11235-022-00883-5</a>

Result language

angličtina

Original language name

Hybrid algorithm optimization for coverage problem in wireless sensor networks

Original language description

With the continuous development of evolutionary computing, many excellent algorithms have emerged, which are applied in all walks of life to solve various practical problems. In this paper, two hybrid fish, bird and insect algorithms based on different architectures are proposed to solve the optimal coverage problem in wireless sensor networks. The algorithm combines the characteristics of three algorithms, namely, particle swarm optimization algorithm, Phasmatodea population evolution algorithm and fish migration optimization algorithm. The new algorithm has the advantages of the three algorithms. In order to prove the effectiveness of the algorithm, we first test it on 28 benchmark functions. The results show that the two hybrid fish, bird and insect algorithms with different architectures have significant advantages. Then we apply the proposed algorithm to solve the coverage problem of wireless sensor networks through experimental simulation. The experimental results show the advantages of our proposed algorithm and prove that our proposed hybrid fish, bird and insect algorithm is suitable for solving the coverage problem of wireless sensor networks.

Czech name

—

Czech description

—

Type

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

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2022

Confidentiality

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

Name of the periodical

Telecommunication Systems

ISSN

1018-4864

e-ISSN

1572-9451

Volume of the periodical

80

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

17

Pages from-to

105-121

UT code for WoS article

000782004700008

EID of the result in the Scopus database

—