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”

Localized Algorithm for Border Nodes Detection in WSNs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F12%3APU110522" target="_blank" >RIV/00216305:26220/12:PU110522 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/WTS.2012.6266101" target="_blank" >http://dx.doi.org/10.1109/WTS.2012.6266101</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/WTS.2012.6266101" target="_blank" >10.1109/WTS.2012.6266101</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Localized Algorithm for Border Nodes Detection in WSNs

  • Original language description

    The routing possesses a serious challenge in ad-hoc wireless sensor networks. In this paper, we focus on so-called self-organizing coordinate systems, which are perceived as the current state of the art in this area. More specifically, we focus on providing of a solid starting point by a detection of nodes located on a network's border. Our intention is to limit the number of nodes involved in this process in order to decrease their energy consumption. Thus, every node requires only locally available data to detect whether it is located on the network's border. We achieved this by fragmenting the network into smaller segments called packs. Then, an analysis of their mutual relations allows to identifying nodes on the network's border. We study three significantly different scenarios, offering various applications in the routing process. Moreover, a slight modification of the algorithm allows to find the center node of the network.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2012

  • 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

    Wireless Telecommunications Symposium (WTS), 2012

  • ISBN

    978-1-4577-0579-3

  • ISSN

    1934-5070

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1-8

  • Publisher name

    IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA

  • Place of publication

    London

  • Event location

    Trenčín

  • Event date

    Jun 18, 2012

  • Type of event by nationality

    CST - Celostátní akce

  • UT code for WoS article

    000315051400031