Stateless Reliable Geocasting

Jordan Adamek (1) , Mikhail Nesterenko (1) , James Scott Robinson (1) , Sébastien Tixeuil (2, 3, 4)

1 Department of computer science
2 NPA - Networks and Performance Analysis
3 IUF - Institut universitaire de France
4 LINCS - Laboratory of Information, Network and Communication Sciences

We present two geometric routing algorithms that reliably deliver messages to all devices in a geocast region. One algorithm is based on flooding, the other on concurrent geometric routing. They are the fist known stateless geocasting algorithms. We formally prove the algorithms correct, evaluate their performance through abstract and concrete simulation and estimate their message complexity.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Géométrie algorithmique [cs.CG]; Algorithme et structure de données [cs.DS]; Réseaux et télécommunications [cs.NI]

Jordan Adamek, Mikhail Nesterenko, James Scott Robinson, Sébastien Tixeuil. Stateless Reliable Geocasting. 36th IEEE Symposium on Reliable Distributed Systems (SRDS 2017), Sep 2017, Hong Kong, China. ⟨hal-01549915⟩