Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Klaus, Volbert"'
Publikováno v:
Proceedings of the 12th International Conference on Sensor Networks.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d16d1df31444a423fbfb901f9e3a1d84
https://doi.org/10.5220/0011791200003399
https://doi.org/10.5220/0011791200003399
Autor:
Danilo Nunes, Klaus Volbert
Publikováno v:
Proceedings of the 11th International Conference on Sensor Networks.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85126c97f649157ec5dce9f39522434d
https://doi.org/10.5220/0010912800003118
https://doi.org/10.5220/0010912800003118
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030301095
There has been a lot of research been done in the domain of Wireless Sensor Networks in recent years. Nowadays, Wireless Sensor Networks are in operation in a wide range of different scenarios and applications, like energy management services, heat a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4f46baa5d59832598ec1b517d609a1e
https://doi.org/10.1007/978-3-030-30110-1_5
https://doi.org/10.1007/978-3-030-30110-1_5
Publikováno v:
EURASIP Journal on Embedded Systems. 2017
Smart grid, smart metering, electromobility, and the regulation of the power network are keywords of the transition in energy politics. In the future, the power grid will be smart. Based on different works, this article presents a data collection, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cc23b23fc27752ec5827dd76725a99b
https://doi.org/10.1186/s13639-016-0045-7
https://doi.org/10.1186/s13639-016-0045-7
Publikováno v:
WISES
In this article, we present a system for energy measurement at mains sockets. It consists of several smart energy measuring devices (SEMD) that use a low-power radio protocol to dynamically build and connect to a radio network to transfer power usage
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e97a2bc349c9857ad2cf7a06cce2d2e
https://doi.org/10.1186/s13639-016-0041-y
https://doi.org/10.1186/s13639-016-0041-y
Publikováno v:
Theory of Computing Systems. 37:343-370
We investigate the problem of path selection in radio networks for a given static set of n sites in two- and three-dimensional space. For static point-to-point communication we define measures for congestion, dilation, and energy consumption that tak
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff43f6ce22768d99aaafe15ccd00c827
https://doi.org/10.1007/s00224-004-1124-z
https://doi.org/10.1007/s00224-004-1124-z
Publikováno v:
Ad-Hoc, Mobile, and Wireless Networks ISBN: 9783540291329
ADHOC-NOW
ADHOC-NOW
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004. In this paper we present a distributed, localized and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19f6e7519f8a6e51404f79d0543a94e1
https://doi.org/10.1007/11561354_21
https://doi.org/10.1007/11561354_21
Autor:
Klaus Volbert
Publikováno v:
DIALM-POMC
We consider static wireless networks where the area around each device is subdivided into a fixed number of equal sectors or cones. Each node has one transmitter per sector and can adjust its transmitting power to send out data in each sector separat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f475563b6562b708bce2cccf2a7c8187
https://doi.org/10.1145/1022630.1022646
https://doi.org/10.1145/1022630.1022646
Publikováno v:
IPDPS
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the SparsY-grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6c76cca10962b933404d1737f919e56
https://doi.org/10.1109/ipdps.2003.1213107
https://doi.org/10.1109/ipdps.2003.1213107
Publikováno v:
Algorithms and Computation ISBN: 9783540241317
ISAAC
ISAAC
For c ∈ $\mathbb R$, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric distance Based on this property to approximate a complete w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33ea16599d65d18725a08d90a9ade872
https://doi.org/10.1007/978-3-540-30551-4_69
https://doi.org/10.1007/978-3-540-30551-4_69