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”

α-fraction first strategy for hierarchical model in wireless sensor networks

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://ericdata.com/tw/detail.aspx?no=413899" target="_blank" >http://ericdata.com/tw/detail.aspx?no=413899</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    α-fraction first strategy for hierarchical model in wireless sensor networks

  • Original language description

    Energy hole refers to the critical issue near the sinks for data collecting, this problem effects the lifetime of wireless sensor network to a great extent. Frequently data forwarding from distributed sensors to the sink will speed up the energy consumption of the sensors near the sink. This circumstance shortens the lifetime of the sensor network. In this paper, an α-fraction first strategy was proposed to build a hierarchical model of wireless sensor networks that concerning the energy consumption. The model mixes the so-called relay nodes into the network for transmitting and collecting data from the other sensor nodes. We studied the Farthest First traversal and Harel methods, then combined the proposed α-fraction first strategy with the two methods respectively. Three algorithms of FF+Fr(α), HD+Fr(α), and HL+Fr(α) were designed for determining the relay nodes in sensor networks. The algorithms can be used to construct a twotier sensor network with fewer relay nodes than the results of the Farthest First traversal and Harel methods. The proposed strategy also could be used with any other algorithms that regarding for choosing one of many options. The simulation results show that our proposed algorithms perform well. Thus, the network lifetime can be prolonged. (C) 2018 American Academy of Pediatric Dentistry. All rights reserved.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS 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

    6

  • Country of publishing house

    TW - TAIWAN (PROVINCE OF CHINA)

  • Number of pages

    10

  • Pages from-to

    1717-1726

  • UT code for WoS article

  • EID of the result in the Scopus database

    2-s2.0-85060145277