Optimal routing and scheduling for a simple network coding scheme
Name
Nathan_Infocom2012 copy.pdf
Size
224.32 KB
Format
Adobe PDF
Checksum (MD5)
37350aae80f605ee741d5fb416d57654
Author(s)
Jones, Nathaniel M.
Shrader, Brooke E.
Modiano, Eytan H
Date Issued
May 2012
Journal
2012 Proceedings IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Jones, Nathaniel M., Brooke Shrader, and Eytan Modiano. “Optimal Routing and Scheduling for a Simple Network Coding Scheme.” 2012 Proceedings IEEE INFOCOM (March 2012), Orlando, FL, USA, 2012.
Version
Author's final manuscript
Abstract
We consider jointly optimal routing, scheduling, and network coding strategies to maximize throughput in wireless networks. While routing and scheduling techniques for wireless networks have been studied for decades, network coding is a relatively new technique that allows for an increase in throughput under certain topological and routing conditions. In this work we introduce k-tuple coding, a generalization of pairwise coding with next-hop decodability, and fully characterize the region of arrival rates for which the network queues can be stabilized under this coding strategy. We propose a dynamic control policy for routing, scheduling, and k-tuple coding, and prove that our policy is throughput optimal subject to the k-tuple coding constraint. We provide analytical bounds on the coding gain of our policy, and present numerical results to support our analytical findings. We show that most of the gains are achieved with pairwise coding, and that the coding gain is greater under 2-hop than 1-hop interference. Simulations show that under 2-hop interference our policy yields median throughput gains of 31% beyond optimal scheduling and routing on random topologies with 16 nodes.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2012.6195772
