Algorithm for energy-efficient interaction of wireless sensor network nodes

The actual problem of developing methods of interaction in wireless sensor networks focused on energy saving is discussed. It is shown that the operation of a wireless sensor network is built taking into account compromise mechanisms that make it possible to extend the life of the network in the pre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Nauchno-tekhnicheskiĭ vestnik informat͡s︡ionnykh tekhnologiĭ, mekhaniki i optiki Jg. 22; H. 2; S. 294 - 301
Hauptverfasser: Tatarnikova, T.M., Bimbetov, F., Gorina, E.V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: ITMO University 01.12.2024
Schlagworte:
ISSN:2226-1494, 2500-0373
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The actual problem of developing methods of interaction in wireless sensor networks focused on energy saving is discussed. It is shown that the operation of a wireless sensor network is built taking into account compromise mechanisms that make it possible to extend the life of the network in the presence of low-power sensor nodes on which the network is built. It is concluded that it is necessary to introduce new algorithms into the operation of wireless sensor networks, which make it possible to reduce the number of operations when calculating a route, transmitting data, or other operations without losing functionality, but contributing to a reduction in energy consumption. The paper proposes one of such algorithms that develops the idea of clustering wireless sensor networks in order to reduce the power consumption of sensor nodes by transferring some of the functions to the head nodes of the clusters. Unlike the well-known adaptive clustering algorithm with low energy consumption LEACH, the proposed algorithm is based on swarm intelligence and allows choosing not only the head nodes of clusters in the current round of functioning of the wireless sensor network, but also promising nodes that become heads of clusters in subsequent rounds. If we consider that one cycle of the wireless sensor network consists of a certain predetermined number of rounds, then the procedure for searching for cluster heads can be performed not at the beginning of each round, but only at the beginning of each cycle of the wireless sensor network. It is shown that the determination of the heads of wireless sensor network clusters in the future allows to reduce the total energy consumption and thereby increase the duration of the network life cycle. The advantage of adding the bee swarm algorithm to the wireless sensor network clustering procedure is demonstrated in terms of such indicators as the time of death of the first sensor node, the dependence of the number of functioning nodes on the network operation time and the data packet delivery coefficient. The wireless sensor network clustering procedure with the addition of the bee swarm algorithm to select cluster heads for the future can be useful when deploying a wireless sensor network in real applications.
AbstractList The actual problem of developing methods of interaction in wireless sensor networks focused on energy saving is discussed. It is shown that the operation of a wireless sensor network is built taking into account compromise mechanisms that make it possible to extend the life of the network in the presence of low-power sensor nodes on which the network is built. It is concluded that it is necessary to introduce new algorithms into the operation of wireless sensor networks, which make it possible to reduce the number of operations when calculating a route, transmitting data, or other operations without losing functionality, but contributing to a reduction in energy consumption. The paper proposes one of such algorithms that develops the idea of clustering wireless sensor networks in order to reduce the power consumption of sensor nodes by transferring some of the functions to the head nodes of the clusters. Unlike the well-known adaptive clustering algorithm with low energy consumption LEACH, the proposed algorithm is based on swarm intelligence and allows choosing not only the head nodes of clusters in the current round of functioning of the wireless sensor network, but also promising nodes that become heads of clusters in subsequent rounds. If we consider that one cycle of the wireless sensor network consists of a certain predetermined number of rounds, then the procedure for searching for cluster heads can be performed not at the beginning of each round, but only at the beginning of each cycle of the wireless sensor network. It is shown that the determination of the heads of wireless sensor network clusters in the future allows to reduce the total energy consumption and thereby increase the duration of the network life cycle. The advantage of adding the bee swarm algorithm to the wireless sensor network clustering procedure is demonstrated in terms of such indicators as the time of death of the first sensor node, the dependence of the number of functioning nodes on the network operation time and the data packet delivery coefficient. The wireless sensor network clustering procedure with the addition of the bee swarm algorithm to select cluster heads for the future can be useful when deploying a wireless sensor network in real applications.
Author Gorina, E.V.
Tatarnikova, T.M.
Bimbetov, F.
Author_xml – sequence: 1
  givenname: T.M.
  orcidid: 0000-0002-6419-0072
  surname: Tatarnikova
  fullname: Tatarnikova, T.M.
– sequence: 2
  givenname: F.
  orcidid: 0000-0001-9740-7998
  surname: Bimbetov
  fullname: Bimbetov, F.
– sequence: 3
  givenname: E.V.
  orcidid: 0000-0003-0908-7221
  surname: Gorina
  fullname: Gorina, E.V.
BookMark eNqNkEtLxDAQgIMouD7-Qw9eo8kkbVrwsi4-Fhe86DlM81ijNZGkIP57W18HT8IwL2a-w3dAdmOKjpATzk65qtvmDAAaymUnKTAAOgeFaRKM75AF1IxRJpTYnfqfy31yXMoTY4yrKQEsyO1y2KYcxseXyqdcuejy9p0674MJLo5ViKPLaMaQYpV89RayG1wpVXGxTPfRjW8pP1cxWVeOyJ7Hobjj73pIHq4u71c3dHN3vV4tN9SAAE57oxq0XQMtSt91QlgFjKOyyI1sFULrve85Ys29tN7UvLe8YQrq1rQSjDgk6y-uTfikX3N4wfyuEwb9uUh5qzGPwQxO911tGsEBhZBSWYm2Z6JD3zS2Vc6riXX-xTI5lZKd_-Vxpj8969menu3p2bOeQ0-e9eR5er_4827CiLOtMWMY_gf5AM0Rh7o
CitedBy_id crossref_primary_10_17586_2226_1494_2025_25_4_762_770
crossref_primary_10_58399_CRAN2457
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.17586/2226-1494-2022-22-2-294-301
DatabaseName CrossRef
Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Open Access Full Text
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2500-0373
EndPage 301
ExternalDocumentID oai_doaj_org_article_b95c6312a33447d4adb039af66d87ef7
10_17586_2226_1494_2022_22_2_294_301
GroupedDBID 642
AAYXX
ADBBV
AFKRA
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BENPR
BPHCQ
BYOGL
CITATION
GROUPED_DOAJ
KQ8
PIMPY
PQQKQ
PROAC
VCL
VIT
ID FETCH-LOGICAL-c2321-bc76ad9628a4f9933d7201a7da1c487a28fffb1aa51f4dfc51bd1607258c842c3
IEDL.DBID DOA
ISSN 2226-1494
IngestDate Mon Nov 03 22:07:14 EST 2025
Sat Nov 29 03:57:44 EST 2025
Tue Nov 18 22:23:03 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2321-bc76ad9628a4f9933d7201a7da1c487a28fffb1aa51f4dfc51bd1607258c842c3
ORCID 0000-0002-6419-0072
0000-0001-9740-7998
0000-0003-0908-7221
OpenAccessLink https://doaj.org/article/b95c6312a33447d4adb039af66d87ef7
PageCount 8
ParticipantIDs doaj_primary_oai_doaj_org_article_b95c6312a33447d4adb039af66d87ef7
crossref_primary_10_17586_2226_1494_2022_22_2_294_301
crossref_citationtrail_10_17586_2226_1494_2022_22_2_294_301
PublicationCentury 2000
PublicationDate 2024-12-01
PublicationDateYYYYMMDD 2024-12-01
PublicationDate_xml – month: 12
  year: 2024
  text: 2024-12-01
  day: 01
PublicationDecade 2020
PublicationTitle Nauchno-tekhnicheskiĭ vestnik informat͡s︡ionnykh tekhnologiĭ, mekhaniki i optiki
PublicationYear 2024
Publisher ITMO University
Publisher_xml – name: ITMO University
SSID ssj0001700022
ssib026971427
Score 2.27555
Snippet The actual problem of developing methods of interaction in wireless sensor networks focused on energy saving is discussed. It is shown that the operation of a...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
StartPage 294
SubjectTerms алгоритм роя пчел
беспроводная сенсорная сеть
глава кластера
жизненный цикл
кластеризация
сенсорный узел
энергоэффективность
Title Algorithm for energy-efficient interaction of wireless sensor network nodes
URI https://doaj.org/article/b95c6312a33447d4adb039af66d87ef7
Volume 22
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Open Access Full Text
  customDbUrl:
  eissn: 2500-0373
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001700022
  issn: 2226-1494
  databaseCode: DOA
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrZ3LSwMxEMaDFBE9iE-sL3LoNXSzm80meKpiEZTiQaG3kM3DB3UrbfXvd2Z3LfWkB2FPYbOEjyEzH5v8hpCes8KBsVCsUMIzEUXCrEoCkyHRZRDaulhDXO-K0UiNx_p-pdUXnglr8MCNcP1S505mPLUZsum8sL5MMm2jlF4VIdb3yJNCr5gpiKRU6oKLlm_52kBiMFthpzmoNxjYArFBerhjQL0s-8tBCBowZ_iwVOMvA_4jX61g_ev8M9wh223hSAfNgnfJWqj2yNYKTnCf3A4mT1Mw-89vFEpRGuprfSzUkAjILRTRELPmIgOdRoqU4glsdHQOVhber5oT4bSa-jA_II_D64erG9Y2S2AOiiLOSldI67VMlRURio7MF5DbbeEtd2BKbKpijCW3NudR-OhyXnqEy6W5ckqkLjsknWpahSNCs8i1sA69kRNBOgU5X0YRQXaoxpTtkotvSYxrSeLY0GJi0FGgoAYFNSioQUENPgYENSBol-TL2e8NUeOP8y5R_eUc5GLXAxAtpo0W81u0HP_HR07IJqxONIdaTklnMfsIZ2TdfS5e5rPzOhC_AMwt2UY
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Algorithm+for+energy-efficient+interaction+of+wireless+sensor+network+nodes&rft.jtitle=Nauchno-tekhnicheski%C4%AD+vestnik+informat%CD%A1s%EF%B8%A1ionnykh+tekhnologi%C4%AD%2C+mekhaniki+i+optiki&rft.au=T.+M.+Tatarnikova&rft.au=F.+Bimbetov&rft.au=E.+V.+Gorina&rft.date=2024-12-01&rft.pub=ITMO+University&rft.issn=2226-1494&rft.eissn=2500-0373&rft.volume=22&rft.issue=2&rft.spage=294&rft.epage=301&rft_id=info:doi/10.17586%2F2226-1494-2022-22-2-294-301&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_b95c6312a33447d4adb039af66d87ef7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2226-1494&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2226-1494&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2226-1494&client=summon