Localized Algorithm for Border Nodes Detection in WSNs

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Localized Algorithm for Border Nodes Detection in WSNs

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Localized Algorithm for Border Nodes Detection in WSNs

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

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

Název statě ve sborníku

Wireless Telecommunications Symposium (WTS), 2012

ISBN

978-1-4577-0579-3

ISSN

1934-5070

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1-8

Název nakladatele

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

Místo vydání

London

Místo konání akce

Trenčín

Datum konání akce

18. 6. 2012

Typ akce podle státní příslušnosti

CST - Celostátní akce

Kód UT WoS článku

000315051400031