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...
Saved in:
| Published in: | Proceedings of the 18th International Conference on Information Processing in Sensor Networks pp. 205 - 216 |
|---|---|
| Main Authors: | , , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
ACM
01.04.2019
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!