Competitive routing in hybrid communication networks and message efficient SetCover in Ad Hoc networks / vorgelegt von Christina Kolb ; [Gutachter: Prof. Dr. Christian Scheideler (Universität Paderborn), Prof. Dr. Friedhelm Meyer auf der Heide (Universität Paderborn)]. Paderborn, 2022
Content
- Introduction
- A short story
- The Hybrid Communication Model
- Competitive Routing
- Radio Holes and the Problem of Radio Holes
- SetCover
- Research Questions
- Thesis Overview
- Model and Main Results
- Related Work
- Preliminaries
- Competitive Routing in Complete Triangulations
- Polygonal Routing
- Parallel Convex Hull Algorithm
- Chernoff Bounds
- SetCover
- Competitive Routing with Holes
- Convex Hulls as Hole Abstraction
- Bounding Boxes as Hole Abstractions
- Intersection of Hole Abstractions
- Competitive Paths via Intersecting Bounding Boxes
- Pairwise Intersecting Bounding Boxes
- Multiple Intersecting Bounding Boxes
- Simulation Results
- Algorithms for Bounding Box Intersections
- Gaining Routing Information
- Computing the 2-Localized Delaunay Graph
- Hypercube and Convex Hull Computation
- Hole Detection
- Information Dissemination of Convex Hulls, Bounding Boxes, and Hole Rings
- Efficient SetCover
- Conclusion and Future Work
- List of Figures
- Bibliography