Joint scheduling and congestion control in mobile ad-hoc networks

Umut Akyol, Matthew Andrews, Piyush Gupta, John Hobby, Iraj Saniee, Alexander Stolyar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. We describe a wireless Greedy Primal Dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program.

Original languageEnglish (US)
Title of host publicationINFOCOM 2008
Subtitle of host publication27th IEEE Communications Society Conference on Computer Communications
Pages1292-1300
Number of pages9
DOIs
StatePublished - Sep 15 2008
Externally publishedYes
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: Apr 13 2008Apr 18 2008

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
CountryUnited States
CityPhoenix, AZ
Period4/13/084/18/08

Fingerprint

Mobile ad hoc networks
Scheduling
Network protocols
Wireless networks
Scheduling algorithms
Flow rate

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Akyol, U., Andrews, M., Gupta, P., Hobby, J., Saniee, I., & Stolyar, A. (2008). Joint scheduling and congestion control in mobile ad-hoc networks. In INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications (pp. 1292-1300). [4509706] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2007.111

Joint scheduling and congestion control in mobile ad-hoc networks. / Akyol, Umut; Andrews, Matthew; Gupta, Piyush; Hobby, John; Saniee, Iraj; Stolyar, Alexander.

INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. p. 1292-1300 4509706 (Proceedings - IEEE INFOCOM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Akyol, U, Andrews, M, Gupta, P, Hobby, J, Saniee, I & Stolyar, A 2008, Joint scheduling and congestion control in mobile ad-hoc networks. in INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications., 4509706, Proceedings - IEEE INFOCOM, pp. 1292-1300, INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications, Phoenix, AZ, United States, 4/13/08. https://doi.org/10.1109/INFOCOM.2007.111
Akyol U, Andrews M, Gupta P, Hobby J, Saniee I, Stolyar A. Joint scheduling and congestion control in mobile ad-hoc networks. In INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. p. 1292-1300. 4509706. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2007.111
Akyol, Umut ; Andrews, Matthew ; Gupta, Piyush ; Hobby, John ; Saniee, Iraj ; Stolyar, Alexander. / Joint scheduling and congestion control in mobile ad-hoc networks. INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. pp. 1292-1300 (Proceedings - IEEE INFOCOM).
@inproceedings{e88e36cccc7a4a1b8060b1fd5b3f482c,
title = "Joint scheduling and congestion control in mobile ad-hoc networks",
abstract = "In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. We describe a wireless Greedy Primal Dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program.",
author = "Umut Akyol and Matthew Andrews and Piyush Gupta and John Hobby and Iraj Saniee and Alexander Stolyar",
year = "2008",
month = "9",
day = "15",
doi = "10.1109/INFOCOM.2007.111",
language = "English (US)",
isbn = "9781424420261",
series = "Proceedings - IEEE INFOCOM",
pages = "1292--1300",
booktitle = "INFOCOM 2008",

}

TY - GEN

T1 - Joint scheduling and congestion control in mobile ad-hoc networks

AU - Akyol, Umut

AU - Andrews, Matthew

AU - Gupta, Piyush

AU - Hobby, John

AU - Saniee, Iraj

AU - Stolyar, Alexander

PY - 2008/9/15

Y1 - 2008/9/15

N2 - In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. We describe a wireless Greedy Primal Dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program.

AB - In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. We describe a wireless Greedy Primal Dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program.

UR - http://www.scopus.com/inward/record.url?scp=51349115215&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51349115215&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2007.111

DO - 10.1109/INFOCOM.2007.111

M3 - Conference contribution

AN - SCOPUS:51349115215

SN - 9781424420261

T3 - Proceedings - IEEE INFOCOM

SP - 1292

EP - 1300

BT - INFOCOM 2008

ER -