dc.contributor.author | Bondorf, Steffen | |
dc.contributor.author | Chen, Binbin | |
dc.contributor.author | Scarlett, Jonathan | |
dc.contributor.author | Yu, Haifeng | |
dc.contributor.author | Zhao, Yuda | |
dc.date.accessioned | 2020-03-31T09:43:38Z | |
dc.date.available | 2020-03-31T09:43:38Z | |
dc.date.created | 2019-08-05T11:26:38Z | |
dc.date.issued | 2019 | |
dc.identifier.uri | https://hdl.handle.net/11250/2649623 | |
dc.description.abstract | 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 R = O(1/lnN). Here N is the number of nodes in the network, and R is the medium utilization rate.
Ideally, one would hope to achieve R = Θ(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 R = Θ(1). We also prove that the space and time complexities of BMC encoding/decoding are all low-order polynomials | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Association for Computing Machinery (ACM) | en_US |
dc.title | Cross-Sender Bit-Mixing Coding | en_US |
dc.type | Journal article | en_US |
dc.description.version | acceptedVersion | en_US |
dc.source.journal | Proceedings of the ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) | en_US |
dc.identifier.doi | https://doi.org/10.1145/3302506.3310401 | |
dc.identifier.cristin | 1714019 | |
dc.description.localcode | © ACM, 2019. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published here, https://doi.org/10.1145/3302506.3310401 | en_US |
cristin.unitcode | 194,63,30,0 | |
cristin.unitname | Institutt for informasjonssikkerhet og kommunikasjonsteknologi | |
cristin.ispublished | true | |
cristin.fulltext | postprint | |