About: Localized Algorithm for Border Nodes Detection in WSNs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Localized Algorithm for Border Nodes Detection in WSNs Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. 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. (en)
Title	Localized Algorithm for Border Nodes Detection in WSNs Localized Algorithm for Border Nodes Detection in WSNs (en)
skos:prefLabel	Localized Algorithm for Border Nodes Detection in WSNs Localized Algorithm for Border Nodes Detection in WSNs (en)
skos:notation	RIV/00216305:26220/12:PU110522!RIV15-MSM-26220___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Kenyeres, Martin
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta elektrotechniky a komunikačních technologií
http://linked.open...dnocenehoVysledku	147329
http://linked.open...ai/riv/idVysledku	RIV/00216305:26220/12:PU110522
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	ad hoc networks, sensor placement, telecommunication network routing,wireless sensor networks, WSN, ad hoc wireless sensor networks, energy consumption, localized algorithm, network border node detection, routing process, self-organizing coordinate syste (en)
http://linked.open.../riv/klicoveSlovo	ad hoc networks ad hoc wireless sensor networks network border node detection routing process self-organizing coordinate syste sensor placement telecommunication network routing energy consumption WSN wireless sensor networks localized algorithm
http://linked.open...ontrolniKodProRIV	[89793A0673CD]
http://linked.open...v/mistoKonaniAkce	Trenčín
http://linked.open...i/riv/mistoVydani	London
http://linked.open...i/riv/nazevZdroje	Wireless Telecommunications Symposium (WTS), 2012
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Rupp, Markus Kenyeres, Jozef Kenyeres, Martin Farkaš, Peter
http://linked.open...vavai/riv/typAkce	CST - Celostátní
http://linked.open...ain/vavai/riv/wos	000315051400031
http://linked.open.../riv/zahajeniAkce	2012-06-18 (xsd:date)
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/WTS.2012.6266101
http://purl.org/ne...btex#hasPublisher	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
https://schema.org/isbn	978-1-4577-0579-3
http://localhost/t...ganizacniJednotka	26220

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software