pith. sign in

arxiv: 1506.07895 · v1 · pith:2SIAJBJEnew · submitted 2015-06-25 · 💻 cs.DC · cs.DS· cs.NI

Stateless Geocasting

Jordan Adamek , Mikhail Nesterenko , S\'ebastien Tixeuil (NPA , LINCS , IUF , LIP6) This is my paper
classification 💻 cs.DC cs.DScs.NI
keywords messagealgorithmsgeocastingstatelessareacomplexitycorrectdata
0
0 comments X
read the original abstract

We present two stateless algorithms that guarantee to deliver the message to every device in a designated geographic area: flooding and planar geocasting. Due to the algorithms' statelessness, intermediate devices do not have to keep message data between message transmissions. We formally prove the algorithms correct, estimate their message complexity and evaluate their performance through simulation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.