Stateless Geocasting
Jordan Adamek, Mikhail Nesterenko, S\'ebastien Tixeuil (NPA, LINCS,, IUF, LIP6)
TL;DR
This paper introduces two stateless geocasting algorithms, flooding and planar, that ensure message delivery to all devices in a geographic area without requiring intermediate devices to store message data.
Contribution
The paper presents novel stateless algorithms for geocasting, with formal correctness proofs, message complexity analysis, and simulation-based performance evaluation.
Findings
Algorithms guarantee message delivery in geographic areas
Statelessness reduces device memory requirements
Performance is validated through simulation
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Energy Efficient Wireless Sensor Networks