Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks
Carina Teixeira De Oliveira (LIG), Fabrice Theoleyre (LSIIT), Andrzej, Duda (LIG)

TL;DR
This paper introduces broadcast algorithms for multi-channel multi-interface wireless mesh networks that ensure probabilistic delivery guarantees while minimizing overhead, adaptable to various channel and interface configurations.
Contribution
It presents novel broadcast algorithms that provide probabilistic delivery guarantees in multi-channel multi-interface wireless mesh networks, adaptable to different channel and interface assignments.
Findings
Algorithms effectively limit broadcast overhead
Guarantee minimum delivery probability to neighbors
Adaptable to various channel and interface strategies
Abstract
Multi-channel multi-interface Wireless Mesh Networks permit to spread the load across orthogonal channels to improve network capacity. Although broadcast is vital for many layer-3 protocols, proposals for taking advantage of multiple channels mostly focus on unicast transmissions. In this paper, we propose broadcast algorithms that fit any channel and interface assignment strategy. They guarantee that a broadcast packet is delivered with a minimum probability to all neighbors. Our simulations show that the proposed algorithms efficiently limit the overhead.
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 · Advanced Wireless Network Optimization
