Latency Optimal Broadcasting in Noisy Wireless Mesh Networks
Qin Xin, Yan Xia

TL;DR
This paper introduces a new latency-optimal broadcasting algorithm for noisy wireless mesh networks that is robust to noise and faults, improving previous results and extending to multi-message scenarios.
Contribution
It presents the first asymptotically optimal, noise-robust broadcasting algorithm for single and multiple messages in wireless mesh networks, addressing open problems in the field.
Findings
Achieves $D+O( ext{log}^2 n)$ latency for single-message broadcasting.
Extends robustness to noisy models with improved bounds over prior work.
Provides a multi-message broadcasting algorithm with $O(D + k ext{log} n + ext{log}^2 n)$ complexity.
Abstract
In this paper, we adopt a new noisy wireless network model introduced very recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically, for a given noise parameter any sender has a probability of of transmitting noise or any receiver of a single transmission in its neighborhood has a probability of receiving noise. In this paper, we first propose a new asymptotically latency-optimal approximation algorithm (under faultless model) that can complete single-message broadcasting task in time units/rounds in any WMN of size and diameter . We then show this diameter-linear broadcasting algorithm remains robust under the noisy wireless network model and also improves the currently best known result in CHHZ17 by a factor. In this paper, we also further extend our robust single-message broadcasting…
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 · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
