IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v83y2016i3d10.1007_s11134-016-9490-1.html
   My bibliography  Save this article

Queue-proportional rate allocation with per-link information in multihop wireless networks

Author

Listed:
  • Bin Li

    (University of Illinois at Urbana-Champaign)

  • R. Srikant

    (University of Illinois at Urbana-Champaign)

Abstract

The backpressure scheduling algorithm for multihop wireless networks is known to be throughput optimal, but it requires each node to maintain per-destination queues. Recently, a clever generalization of processor sharing has been proposed which is also throughput optimal, but which only uses per-link queues. Here, we propose another algorithm, called Queue-Proportional Rate Allocation (QPRA), which also only uses per-link queues and allocates service rates to links in proportion to their queue lengths, and employs the Serve-In-Random-Order queueing discipline within each link. Through fluid limit techniques and using a novel Lyapunov function, we show that the QPRA algorithm achieves the maximum throughput. We demonstrate an advantage of QPRA by showing that, for the so-called primary interference model, it is able to develop a low-complexity scheduling scheme which approximates QPRA and achieves a constant fraction of the maximum throughput region, independent of network size.

Suggested Citation

  • Bin Li & R. Srikant, 2016. "Queue-proportional rate allocation with per-link information in multihop wireless networks," Queueing Systems: Theory and Applications, Springer, vol. 83(3), pages 329-359, August.
    • Handle: RePEc:spr:queues:v:83:y:2016:i:3:d:10.1007_s11134-016-9490-1
    DOI: 10.1007/s11134-016-9490-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-016-9490-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-016-9490-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Seva Shneer & Alexander Stolyar, 2020. "Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 109-128, February.
    2. Maury Bramson & Bernardo D’Auria & Neil Walton, 2017. "Proportional Switching in First-in, First-out Networks," Operations Research, INFORMS, vol. 65(2), pages 496-513, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:83:y:2016:i:3:d:10.1007_s11134-016-9490-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.