Springe direkt zu Inhalt

Disputation Max Willert

24.03.2021 | 18:00
Thema der Dissertation:
Routing and Stabbing
Thema der Disputation:
Geometric Routing in Theta-Graphs
Abstract: "Theta-graphs are a well-known class of geometric graphs and received much attention in the last decade since they are used to model wireless sensor networks. In a Theta-k-graph the plane around each vertex is partitioned into k disjoint cones and an edge is connected to the closest visible vertex in each cone. Theta-graphs are known to be good spanners and they admit competitive and local routing algorithms. We will introduce the notion of constrained Theta-graphs and focus on the routing and spanning properties of the constrained Theta-6- and constrained half-Theta-6-graph. Finally, we will give a short overview of other types of Theta-graphs."

Zeit & Ort

24.03.2021 | 18:00