Distributed CSMA with pairwise coding
Name
njones_distcsma_infocom13 copy.pdf
Size
664.96 KB
Format
Adobe PDF
Checksum (MD5)
3d440497ba4fc36a8735ddeb2973277d
Author(s) • •
Jones, Nathaniel M.
Shrader, Brooke E.
Modiano, Eytan H
Date Issued
July 2013
Journal
2013 Proceedings IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Jones, Nathaniel M., Brooke Shrader, and Eytan Modiano. “Distributed CSMA with Pairwise Coding.” 2013 Proceedings IEEE INFOCOM (April 2013), Turin, Italy, Institute of Electrical and Electronics Engineers (IEEE), 2013.
Version
Author's final manuscript
Abstract
We consider distributed strategies for joint routing, scheduling, and network coding to maximize throughput in wireless networks. Network coding allows for an increase in network throughput under certain routing conditions. We previously developed a centralized control policy to jointly optimize for routing and scheduling combined with a simple network coding strategy using max-weight scheduling (MWS) [9]. In this work we focus on pairwise network coding and develop a distributed carrier sense multiple access (CSMA) policy that supports all arrival rates allowed by the network subject to the pairwise coding constraint. We extend our scheme to optimize for packet overhearing to increase the number of beneficial coding opportunities. Simulation results show that the CSMA strategy yields the same throughput as the optimal centralized policy of [9], but at the cost of increased delay. Moreover, overhearing provides up to an additional 25% increase in throughput on random topologies.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2013.6567011