Distributed CSMA with pairwise coding
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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2018
|
| Online Access: | http://hdl.handle.net/1721.1/116698 https://orcid.org/0000-0001-8238-8130 |
| _version_ | 1826215827500695552 |
|---|---|
| author | Jones, Nathaniel M. Shrader, Brooke E. Modiano, Eytan H |
| author2 | Lincoln Laboratory |
| author_facet | Lincoln Laboratory Jones, Nathaniel M. Shrader, Brooke E. Modiano, Eytan H |
| author_sort | Jones, Nathaniel M. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T16:37:43Z |
| format | Article |
| id | mit-1721.1/116698 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:37:43Z |
| publishDate | 2018 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1166982022-10-02T08:35:44Z Distributed CSMA with pairwise coding Jones, Nathaniel M. Shrader, Brooke E. Modiano, Eytan H Lincoln Laboratory Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Jones, Nathaniel M. Shrader, Brooke E. Modiano, Eytan H 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. United States. Dept. of Defense. Assistant Secretary of Defense for Research & Engineering United States. Air Force (Air Force Contract FA8721-05-C-0002) 2018-06-29T17:01:45Z 2018-06-29T17:01:45Z 2013-07 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-5946-7 978-1-4673-5944-3 978-1-4673-5945-0 0743-166X http://hdl.handle.net/1721.1/116698 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. https://orcid.org/0000-0001-8238-8130 en_US http://dx.doi.org/10.1109/INFCOM.2013.6567011 2013 Proceedings IEEE INFOCOM Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) Prof. Modiano |
| spellingShingle | Jones, Nathaniel M. Shrader, Brooke E. Modiano, Eytan H Distributed CSMA with pairwise coding |
| title | Distributed CSMA with pairwise coding |
| title_full | Distributed CSMA with pairwise coding |
| title_fullStr | Distributed CSMA with pairwise coding |
| title_full_unstemmed | Distributed CSMA with pairwise coding |
| title_short | Distributed CSMA with pairwise coding |
| title_sort | distributed csma with pairwise coding |
| url | http://hdl.handle.net/1721.1/116698 https://orcid.org/0000-0001-8238-8130 |
| work_keys_str_mv | AT jonesnathanielm distributedcsmawithpairwisecoding AT shraderbrookee distributedcsmawithpairwisecoding AT modianoeytanh distributedcsmawithpairwisecoding |