One- and Multi-Pass Long-Hop Routing for Wireless Network
Przemys{\l}aw B{\l}a\'skiewicz, Jacek Cicho\'n, Jakub Lemiesz,, Miros{\l}aw Kuty{\l}owski, Marcin Zawada
TL;DR
This paper analyzes probabilistic long-hop routing algorithms in wireless networks, focusing on how distance estimates influence routing decisions and their mathematical properties.
Contribution
It provides a mathematical analysis of a class of probabilistic long-hop routing algorithms based on distance estimates.
Findings
Mathematical characterization of routing algorithm behavior
Insights into the probabilistic nature of long-hop routing
Potential implications for wireless network efficiency
Abstract
In our paper we provide mathematical analysis of a probabilistic long-hop routing algorithms which uses as the randomizing factor the estimate of distance of a station from the previous-hop source of the message.
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
TopicsCooperative Communication and Network Coding · Mobile Ad Hoc Networks · Advanced MIMO Systems Optimization