University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Layered backpressure scheduling for delay reduction in ad hoc networks

Maglaras, LA and Katsaros, D (2011) Layered backpressure scheduling for delay reduction in ad hoc networks 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2011 - Digital Proceedings.

Full text not available from this repository.


Packet scheduling in wireless ad hoc networks is a fundamental problem for ad hoc networking. Backpressure scheduling is a solid and throughput optimal policy for such networks, but suffers from increased delays. In this article, we present an holistic approach to improve upon the delay problems of backpressure-type algorithms. We develop two scheduling policies, namely Voting-based and Layered backpressure routing which both are throughput optimal. We experimentally compare the proposed policies against all the delay-aware backpressure policies and conclude that Layered backpressure is a high performance policy compromising a little delay for robustness, low computational complexity and simplicity. © 2011 IEEE.

Item Type: Article
Divisions : Surrey research (other units)
Authors :
Katsaros, D
Date : 19 September 2011
DOI : 10.1109/WoWMoM.2011.5986388
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:09
Last Modified : 24 Jan 2020 23:32

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800