About: Low degree connectivity in ad-hoc networks

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

About: Low degree connectivity in ad-hoc networks 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 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. (en)
Title	Low degree connectivity in ad-hoc networks Low degree connectivity in ad-hoc networks (en)
skos:prefLabel	Low degree connectivity in ad-hoc networks Low degree connectivity in ad-hoc networks (en)
skos:notation	RIV/00216208:11320/05:00206154!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Kučera, Luděk
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	528450
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/05:00206154
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	degree; connectivity; ad-hoc; networks (en)
http://linked.open.../riv/klicoveSlovo	connectivity networks degree ad-hoc
http://linked.open...ontrolniKodProRIV	[0BC76A902E13]
http://linked.open...v/mistoKonaniAkce	Berlin
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Algorithms - ESA 2005
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2005
http://linked.open...iv/tvurceVysledku	Kučera, Luděk
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000233893100020
http://linked.open.../riv/zahajeniAkce	2005-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	3-540-29118-0
http://localhost/t...ganizacniJednotka	11320
is http://linked.open...avai/riv/vysledek of	Low degree connectivity in ad-hoc networks

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, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software