Cross-Sender Bit-Mixing Coding

Scheduling to avoid packet collisions is a long-standing challenge in networking, and has become even trickier in wireless networks with multiple senders and multiple receivers. In fact, researchers have proved that even perfect scheduling can only achieve \mathbf{R}=O(\frac{1}{\ln N}) . Here N is t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 18th International Conference on Information Processing in Sensor Networks S. 205 - 216
Hauptverfasser: Bondorf, Steffen, Chen, Binbin, Scarlett, Jonathan, Yu, Haifeng, Zhao, Yuda
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: ACM 01.04.2019
Schlagworte:
Channel estimation
coding
Coding theory
collision
Decoding
Encoding
Network protocol design
Receivers
Wireless networks
Wireless sensor networks
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Scheduling to avoid packet collisions is a long-standing challenge in networking, and has become even trickier in wireless networks with multiple senders and multiple receivers. In fact, researchers have proved that even perfect scheduling can only achieve \mathbf{R}=O(\frac{1}{\ln N}) . Here N is the number of nodes in the network, and R is the medium utilization rate. Ideally, one would hope to achieve \mathbf{R}=\Theta(1) , while avoiding all the complexities in scheduling. To this end, this paper proposes cross-sender bit-mixing coding (BMC), which does not rely on scheduling. Instead, users transmit simultaneously on suitably-chosen slots, and the amount of overlap in different user's slots is controlled via coding. We prove that in all possible network topologies, using BMC enables us to achieve \mathbf{R}=\Theta(1) . We also prove that the space and time complexities of BMC encoding/decoding are all low-order polynomials.
DOI:10.1145/3302506.3310401