Stateless Geocasting
Distributed, Parallel, and Cluster Computing
2015-06-29 v1 Data Structures and Algorithms
Networking and Internet Architecture
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.
Cite
@article{arxiv.1506.07895,
title = {Stateless Geocasting},
author = {Jordan Adamek and Mikhail Nesterenko and Sébastien Tixeuil},
journal= {arXiv preprint arXiv:1506.07895},
year = {2015}
}