Please use this identifier to cite or link to this item:
Title: Cross-sender bit-mixing coding
Authors: H. Yu 
Y. Zhao 
Steffen Bondorf 
Binbin Chen 
Jonathan Scarlett 
Keywords: Coding
Wireless networks
Issue Date: 16-Apr-2019
Publisher: Association for Computing Machinery, Inc
Citation: H. Yu, Y. Zhao, Steffen Bondorf, Binbin Chen, Jonathan Scarlett (2019-04-16). Cross-sender bit-mixing coding. IPSN 2019 - Proceedings of the 2019 Information Processing in Sensor Networks : 205 - 216. ScholarBank@NUS Repository.
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(ln1N ). 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.
Source Title: IPSN 2019 - Proceedings of the 2019 Information Processing in Sensor Networks
ISBN: 9781450362849
DOI: 10.1145/3302506.3310401
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
5. 1807.04449.pdf1.3 MBAdobe PDF




checked on Feb 1, 2023

Page view(s)

checked on Feb 2, 2023


checked on Feb 2, 2023

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.