Diff-Max: Separation of routing and scheduling in backpressure-based wireless networks
Name
Modiano_Diff-Max.pdf
Size
331.87 KB
Format
Adobe PDF
Checksum (MD5)
fc8dc70a642a9e2659034b4c4b0514d5
Author(s)
Seferoglu, Hulya
Modiano, Eytan H.
Date Issued
April 2013
Journal
Proceedings of the 2013 IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Seferoglu, Hulya, and Eytan Modiano. “Diff-Max: Separation of routing and scheduling in backpressure-based wireless networks.” In 2013 Proceedings IEEE INFOCOM, 1555-1563. Institute of Electrical and Electronics Engineers, 2013.
Version
Original manuscript
Abstract
Backpressure routing and scheduling, with throughput-optimal operation guarantee, is a promising technique to improve throughput in wireless multi-hop networks. Although backpressure is conceptually viewed as layered, the decisions of routing and scheduling are made jointly, which imposes several challenges in practice. In this work, we present Diff-Max, an approach that separates routing and scheduling and has three strengths: (i) Diff-Max improves throughput significantly, (ii) the separation of routing and scheduling makes practical implementation easier by minimizing cross-layer operations; i.e., routing is implemented in the network layer and scheduling is implemented in the link layer, and (iii) the separation of routing and scheduling leads to modularity; i.e., routing and scheduling are independent modules in Diff-Max, and one can continue to operate even if the other does not. Our approach is grounded in a network utility maximization (NUM) formulation and its solution. Based on the structure of Diff-Max, we propose two practical schemes: Diff-subMax and wDiff-subMax. We demonstrate the benefits of our schemes through simulation in ns-2.
Description
Original manuscript September 19, 2012
MIT Department
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 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2013.6566951
