Multi-destination Aggregation with Binary Symmetric Broadcast Channel Based Coding in 802.11 WLANs
Xiaomin Chen, Douglas Leith

TL;DR
This paper explores binary symmetric broadcast channel coding for multi-destination aggregation in 802.11 WLANs, showing significant throughput improvements with simple, software-only solutions like time-sharing coding.
Contribution
It introduces a novel binary symmetric broadcast channel approach and compares superposition and time-sharing coding for WLANs, demonstrating substantial throughput gains.
Findings
Over 100% throughput increase in various conditions
Time-sharing coding achieves most gains with minimal performance loss
Performance improvements are achieved through software changes only
Abstract
In this paper we consider the potential benefits of adopting a binary symmetric broadcast channel paradigm for multi-destination aggregation in 802.11 WLANs, as opposed to a more conventional packet erasure channel paradigm. We propose two approaches for multi-destination aggregation, i.e. superposition coding and a simpler time-sharing coding. Theoretical and simulation results for both unicast and multicast traffic demonstrate that increases in network throughput of more than 100% are possible over a wide range of network conditions and that the much simpler time-sharing scheme yields most of these gains and have minimal loss of performance. Importantly, these performance gains are achieved exclusively through software rather than hardware changes.
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
TopicsWireless Networks and Protocols · Cooperative Communication and Network Coding · Advanced Wireless Network Optimization
