Scheduling in mobile ad hoc networks with topology and channel-state uncertainty

Lei Ying, Sanjay Shakkottai

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

20 Citations (Scopus)

Abstract

We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiulas and Ephremides) require instantaneous network state (topology, queues-lengths, and fading channel-state) in order to make scheduling/routing decisions. However, such instantaneous network-wide (global) information is hard to come by in practice, especially when mobility induces a time-varying topology. With information delays and a lack of global network state, different mobile nodes have differing "views" of the network, thus inducing uncertainty and inconsistency across mobile nodes in their topology knowledge and network state information. In such a setting, we first characterize the through-optimal rate region and develop a back-pressure-like scheduling algorithm, which we show is throughput-optimal. Then, by partitioning the geographic region spatially into disjoint tiles, and sharing delayed topology and network state information only among mobile nodes currently within each tile, we develop a localized low-complexity scheduling algorithm. The algorithm uses instantaneous local information (the queue length, channel state and current position at a mobile node) along with delayed network state information from nodes that were within its tile (i.e., from nodes that were within a nearby geographic region as opposed to network-wide information). The proposed algorithm is shown to be near-optimal, where the geographic distance over which delayed network-state information is shared determines the provable lower bound on the achievable throughput.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages2347-2355
Number of pages9
DOIs
StatePublished - 2009
Externally publishedYes
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period4/19/094/25/09

Fingerprint

Mobile ad hoc networks
Tile
Scheduling
Topology
Throughput
Scheduling algorithms
Fading channels
Uncertainty

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Scheduling in mobile ad hoc networks with topology and channel-state uncertainty. / Ying, Lei; Shakkottai, Sanjay.

Proceedings - IEEE INFOCOM. 2009. p. 2347-2355 5062161.

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

Ying, L & Shakkottai, S 2009, Scheduling in mobile ad hoc networks with topology and channel-state uncertainty. in Proceedings - IEEE INFOCOM., 5062161, pp. 2347-2355, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 4/19/09. https://doi.org/10.1109/INFCOM.2009.5062161
Ying, Lei ; Shakkottai, Sanjay. / Scheduling in mobile ad hoc networks with topology and channel-state uncertainty. Proceedings - IEEE INFOCOM. 2009. pp. 2347-2355
@inproceedings{0abdbac80dab4c1da6591d19cab68329,
title = "Scheduling in mobile ad hoc networks with topology and channel-state uncertainty",
abstract = "We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiulas and Ephremides) require instantaneous network state (topology, queues-lengths, and fading channel-state) in order to make scheduling/routing decisions. However, such instantaneous network-wide (global) information is hard to come by in practice, especially when mobility induces a time-varying topology. With information delays and a lack of global network state, different mobile nodes have differing {"}views{"} of the network, thus inducing uncertainty and inconsistency across mobile nodes in their topology knowledge and network state information. In such a setting, we first characterize the through-optimal rate region and develop a back-pressure-like scheduling algorithm, which we show is throughput-optimal. Then, by partitioning the geographic region spatially into disjoint tiles, and sharing delayed topology and network state information only among mobile nodes currently within each tile, we develop a localized low-complexity scheduling algorithm. The algorithm uses instantaneous local information (the queue length, channel state and current position at a mobile node) along with delayed network state information from nodes that were within its tile (i.e., from nodes that were within a nearby geographic region as opposed to network-wide information). The proposed algorithm is shown to be near-optimal, where the geographic distance over which delayed network-state information is shared determines the provable lower bound on the achievable throughput.",
author = "Lei Ying and Sanjay Shakkottai",
year = "2009",
doi = "10.1109/INFCOM.2009.5062161",
language = "English (US)",
isbn = "9781424435135",
pages = "2347--2355",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Scheduling in mobile ad hoc networks with topology and channel-state uncertainty

AU - Ying, Lei

AU - Shakkottai, Sanjay

PY - 2009

Y1 - 2009

N2 - We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiulas and Ephremides) require instantaneous network state (topology, queues-lengths, and fading channel-state) in order to make scheduling/routing decisions. However, such instantaneous network-wide (global) information is hard to come by in practice, especially when mobility induces a time-varying topology. With information delays and a lack of global network state, different mobile nodes have differing "views" of the network, thus inducing uncertainty and inconsistency across mobile nodes in their topology knowledge and network state information. In such a setting, we first characterize the through-optimal rate region and develop a back-pressure-like scheduling algorithm, which we show is throughput-optimal. Then, by partitioning the geographic region spatially into disjoint tiles, and sharing delayed topology and network state information only among mobile nodes currently within each tile, we develop a localized low-complexity scheduling algorithm. The algorithm uses instantaneous local information (the queue length, channel state and current position at a mobile node) along with delayed network state information from nodes that were within its tile (i.e., from nodes that were within a nearby geographic region as opposed to network-wide information). The proposed algorithm is shown to be near-optimal, where the geographic distance over which delayed network-state information is shared determines the provable lower bound on the achievable throughput.

AB - We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiulas and Ephremides) require instantaneous network state (topology, queues-lengths, and fading channel-state) in order to make scheduling/routing decisions. However, such instantaneous network-wide (global) information is hard to come by in practice, especially when mobility induces a time-varying topology. With information delays and a lack of global network state, different mobile nodes have differing "views" of the network, thus inducing uncertainty and inconsistency across mobile nodes in their topology knowledge and network state information. In such a setting, we first characterize the through-optimal rate region and develop a back-pressure-like scheduling algorithm, which we show is throughput-optimal. Then, by partitioning the geographic region spatially into disjoint tiles, and sharing delayed topology and network state information only among mobile nodes currently within each tile, we develop a localized low-complexity scheduling algorithm. The algorithm uses instantaneous local information (the queue length, channel state and current position at a mobile node) along with delayed network state information from nodes that were within its tile (i.e., from nodes that were within a nearby geographic region as opposed to network-wide information). The proposed algorithm is shown to be near-optimal, where the geographic distance over which delayed network-state information is shared determines the provable lower bound on the achievable throughput.

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

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

U2 - 10.1109/INFCOM.2009.5062161

DO - 10.1109/INFCOM.2009.5062161

M3 - Conference contribution

SN - 9781424435135

SP - 2347

EP - 2355

BT - Proceedings - IEEE INFOCOM

ER -