Optimization of Boundary Recognition Algorithms for Wireless Sensor Network Applications

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F11%3APU93581" target="_blank" >RIV/00216305:26220/11:PU93581 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization of Boundary Recognition Algorithms for Wireless Sensor Network Applications

Popis výsledku v původním jazyce

Recognition of network boundaries in wireless sensor network (WSN) applications is crucial from two reasons. First, a knowledge of boundary nodes can help to increase a security performance of sensor network. And second it can significantly contributes to the energy conservation of inner nodes that can be switched into the sleeping modes during no activity is presented on the network boundaries. Furthermore, the knowledge of boundary nodes is necessary condition for some localization algorithms appliedinto the WSN environment. We proposed two novel algorithms referred to as BRC and BRBC and compare their recognition efficiency with three know related algorithms. The results of simulations showed that all algorithms achieved high ratio of success detections, however it is shown that only the novel algorithms achieved the low ratio of the false detections.

Název v anglickém jazyce

Optimization of Boundary Recognition Algorithms for Wireless Sensor Network Applications

Popis výsledku anglicky

Recognition of network boundaries in wireless sensor network (WSN) applications is crucial from two reasons. First, a knowledge of boundary nodes can help to increase a security performance of sensor network. And second it can significantly contributes to the energy conservation of inner nodes that can be switched into the sleeping modes during no activity is presented on the network boundaries. Furthermore, the knowledge of boundary nodes is necessary condition for some localization algorithms appliedinto the WSN environment. We proposed two novel algorithms referred to as BRC and BRBC and compare their recognition efficiency with three know related algorithms. The results of simulations showed that all algorithms achieved high ratio of success detections, however it is shown that only the novel algorithms achieved the low ratio of the false detections.

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/FR-TI2%2F571" target="_blank" >FR-TI2/571: *Adaptibilní bezdrátové senzorové sítě s vizualizací dat pro krizové řízení</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

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

In Proceeding of TSP 2011

ISBN

978-1-4577-1409-2

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

216-221

Název nakladatele

Neuveden

Místo vydání

Neuveden

Místo konání akce

Budapest

Datum konání akce

18. 8. 2011

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

WRD - Celosvětová akce

Kód UT WoS článku

—