Using Braids for Byzantine-Resistant Geometric Routing on Polyhedral Networks
Online routing | Nodes are myopic (only see immediate neighbors) |
Robust routing on low-resource devices
1 faulty “Byzantine” node
Offline routing | Routing tables (nodes store directions) |
Geometric routing | |
Greedy routing | Go to node closest to destination |
Face routing | Always turn right (or left) |
Byzantine node | Node that behaves arbitrarily |
Network | Graph |
Polyhedral | |
Planar | No edges intersect |
3-Connected | To disconnect the network, you need to remove 3 nodes |
3-Connected | \(\exists\) 3 disjoint paths between each pair of nodes |
Exactly what they sound like.
Route along 3 disjoint paths
For each node, find 2 disjoint paths that skip it.
Route along collectively disjoint paths
For each node, find a set of collectively disjoint paths that skip it.
Prof. Mikhail Nesterenko, for supervising the research
Prof. Gokarna Sharma, for his feedback
Prof. Jenya Soprunova, for her feedback
Prof. Darci Kracht, for advice on the presentation
@inproceedings{BeRGeRJMM, title={Using Braids for Byzantine Resistant Geographic Routing on Polyhedral Networks}, author={Brown Zaz and Mikhail Nesterenko}, booktitle={Joint Mathematics Meet}, address={San Francisco, USA}, month={Jan}, year={2024}, url={https://zazbrown.com/research/talk/JMM/BeRGeR/BeRGeR.html} }