This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n9http://localhost/temp/predkladatel/
n3http://purl.org/net/nknouf/ns/bibtex#
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
n18https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F05%3A00206154%21RIV10-MSM-11320___/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F05%3A00206154%21RIV10-MSM-11320___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
The aim of the paper is to investigate the average case behavior of certain algorithms that are designed for connecting mobile agents in the two- or three-dimensional space. The general model is the following: let $X$ be a set of points in the $d$-dimensional Euclidean space $E_d$, $d\ge 2$, $r$ be a function that associates each element of $x\in X$ with a positive real number $r(x)$. A graph $G(X,r)$ is an oriented graph with the vertex set $X$, in which $(x,y)$ is an edge if and only if $\rho(x,y)\le r(x)$, where $\rho(x,y)$ denotes the Euclidean distance in the space $E_d$. Given a set $X$, the goal is to find a function $r$ so that the graph $G(X,r)$ is strongly connected (note that the graph $G(X,r)$ need not be symmetric). The function $r$ computed by the algorithm of the present paper is such that, given a random set $X$ of points, the average value of $r(x)^d$ (related to the average transmitter power) is almost surely constant. The aim of the paper is to investigate the average case behavior of certain algorithms that are designed for connecting mobile agents in the two- or three-dimensional space. The general model is the following: let $X$ be a set of points in the $d$-dimensional Euclidean space $E_d$, $d\ge 2$, $r$ be a function that associates each element of $x\in X$ with a positive real number $r(x)$. A graph $G(X,r)$ is an oriented graph with the vertex set $X$, in which $(x,y)$ is an edge if and only if $\rho(x,y)\le r(x)$, where $\rho(x,y)$ denotes the Euclidean distance in the space $E_d$. Given a set $X$, the goal is to find a function $r$ so that the graph $G(X,r)$ is strongly connected (note that the graph $G(X,r)$ need not be symmetric). The function $r$ computed by the algorithm of the present paper is such that, given a random set $X$ of points, the average value of $r(x)^d$ (related to the average transmitter power) is almost surely constant.
dcterms:title
Low degree connectivity in ad-hoc networks Low degree connectivity in ad-hoc networks
skos:prefLabel
Low degree connectivity in ad-hoc networks Low degree connectivity in ad-hoc networks
skos:notation
RIV/00216208:11320/05:00206154!RIV10-MSM-11320___
n5:aktivita
n20:Z
n5:aktivity
Z(MSM0021620838)
n5:dodaniDat
n11:2010
n5:domaciTvurceVysledku
n10:4991311
n5:druhVysledku
n14:D
n5:duvernostUdaju
n21:S
n5:entitaPredkladatele
n16:predkladatel
n5:idSjednocenehoVysledku
528450
n5:idVysledku
RIV/00216208:11320/05:00206154
n5:jazykVysledku
n13:eng
n5:klicovaSlova
degree; connectivity; ad-hoc; networks
n5:klicoveSlovo
n7:degree n7:networks n7:connectivity n7:ad-hoc
n5:kontrolniKodProRIV
[0BC76A902E13]
n5:mistoKonaniAkce
Berlin
n5:mistoVydani
Berlin
n5:nazevZdroje
Algorithms - ESA 2005
n5:obor
n6:BA
n5:pocetDomacichTvurcuVysledku
1
n5:pocetTvurcuVysledku
1
n5:rokUplatneniVysledku
n11:2005
n5:tvurceVysledku
Kučera, Luděk
n5:typAkce
n15:WRD
n5:wos
000233893100020
n5:zahajeniAkce
2005-01-01+01:00
n5:zamer
n19:MSM0021620838
s:numberOfPages
12
n3:hasPublisher
Springer-Verlag
n18:isbn
3-540-29118-0
n9:organizacniJednotka
11320