On ad hoc routing with guaranteed delivery
Mark Braverman
TL;DR
This paper introduces a simple, efficient routing algorithm for ad hoc networks that guarantees message delivery using universal exploration sequences, ensuring reliable communication.
Contribution
It presents a novel poly-time, log-space routing algorithm for ad hoc networks that guarantees delivery, leveraging universal exploration sequences.
Findings
Routing algorithm guarantees delivery in polynomial time
Uses universal exploration sequences for reliable routing
Operates within log-space complexity
Abstract
We point out a simple poly-time log-space routing algorithm in ad hoc networks with guaranteed delivery using universal exploration sequences.
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 · Energy Efficient Wireless Sensor Networks · Vehicular Ad Hoc Networks (VANETs)