Network architectures for demanding 5G performance requirements: Tailored toward specific needs of efficiency and flexibility
…, A Mitschele-Thiel, T Dudda, M Dod… - IEEE Vehicular …, 2019 - ieeexplore.ieee.org
The fifth generation (5G) of mobile networks is envisioned to support new applications having
demanding requirements, such as low latency and high reliability, which is the focus of this …
demanding requirements, such as low latency and high reliability, which is the focus of this …
[PDF][PDF] Cooperative Driving in Mixed Traffic with Heterogeneous Communications and Cloud Infrastructure.
R Auerswald, R Busse, M Dod, R Fritzsche… - VEHITS, 2019 - scitepress.org
In this paper we introduce an Intelligent Transport System (ITS), designed for enabling
cooperative driving manoeuvres in mixed traffic scenarios considering heterogeneous …
cooperative driving manoeuvres in mixed traffic scenarios considering heterogeneous …
[PDF][PDF] Bipartition polynomials, the ising model, and domination in graphs
This paper introduces a trivariate graph polynomial that is a common generalization of the
domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial …
domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial …
IVS-KOM: A reference platform for heterogeneous ITS communications
R Jacob, M Gay, M Dod, S Lorenz… - 2020 IEEE 92nd …, 2020 - ieeexplore.ieee.org
Various radio technologies address the diverse performance requirements of today’s ITS
applications and compete for deployment. Instead of choosing a specific technology, a …
applications and compete for deployment. Instead of choosing a specific technology, a …
[HTML][HTML] Graph products of the trivariate total domination polynomial and related polynomials
M Dod - Discrete Applied Mathematics, 2016 - Elsevier
A vertex subset W ⊆ V of the graph G = ( V , E ) is a total dominating set if every vertex of the
graph is adjacent to at least one vertex in W . The total domination polynomial is the …
graph is adjacent to at least one vertex in W . The total domination polynomial is the …
The independent domination polynomial
M Dod - arXiv preprint arXiv:1602.08250, 2016 - arxiv.org
A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if
every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of …
every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of …
Domination in graphs with application to network reliability
M Dod - 2015 - tubaf.qucosa.de
In this thesis we investigate different domination-related graph polynomials, like the connected
domination polynomial, the independent domination polynomial, and the total domination …
domination polynomial, the independent domination polynomial, and the total domination …
Heterogeneous infrastructure for cooperative driving of automated and non-automated connected vehicles
R Auerswald, M Dod, L Franke, R Fritzsche… - Smart Cities, Green …, 2021 - Springer
Automated driving is an active topic of research, while first results have already found their
way into productive use. Nonetheless, nearly all of today’s vehicles are still non-automated. …
way into productive use. Nonetheless, nearly all of today’s vehicles are still non-automated. …
[PDF][PDF] Zuverlässigkeit in gerichteten Netzwerken
M Dod - 2012 - researchgate.net
Diese Arbeit beschäftigt sich mit verschiedenen Zuverlässigkeitsproblemen in gerichteten
Netzwerken. Dabei wird speziell die s, t-Zuverlässigkeit und die s, T-Zuverlässigkeit betrachtet…
Netzwerken. Dabei wird speziell die s, t-Zuverlässigkeit und die s, T-Zuverlässigkeit betrachtet…
[PDF][PDF] Potentiale der Car2X-Infrastruktur
M Dod, S Kischnick - researchgate.net
Die immer weiter fortschreitende informationstechnische Vernetzung des Alltags erreicht
auch zunehmend die Fahrzeuge und wird besonders durch die bessere Verfügbarkeit der …
auch zunehmend die Fahrzeuge und wird besonders durch die bessere Verfügbarkeit der …