Abstract

In this paper, topology-transparent scheduling for mobile multi-hop wireless networks is extended from constant-weight to variable-weight schedules. A construction of variable-weight topology-transparent schedules – the first of its kind – is provided based on transversal designs from the finite field. The schedules are integrated into the VWATT medium access control (MAC) protocol, enabling nodes to dynamically select their schedule weights to accommodate both their local traffic load and local topology while maintaining a guarantee on maximum delay. Simulations show VWATT to increase throughput compared to constant-weight topology-transparent schedules, to reduce both maximum and expected delay relative to schedules whose weights are not constrained to the set of weights, and to adapt rapidly to changes in topology and traffic load. The results suggest variable-weight topology-transparent scheduling as a viable approach to medium access control when a bound on delay is required.

Original languageEnglish (US)
Pages (from-to)16-28
Number of pages13
JournalComputer Networks
Volume122
DOIs
StatePublished - Jul 20 2017

Fingerprint

Scheduling
Topology
Medium access control
Wireless networks
Throughput
Network protocols

Keywords

  • Adaptive algorithms
  • Channel allocation
  • Combinatorial mathematics
  • Distributed algorithms
  • Wireless networks

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Variable-weight topology-transparent scheduling. / Lutz, Jonathan; Colbourn, Charles; Syrotiuk, Violet.

In: Computer Networks, Vol. 122, 20.07.2017, p. 16-28.

Research output: Contribution to journalArticle

@article{1bb9c910f85d452a955401efbcf94604,
title = "Variable-weight topology-transparent scheduling",
abstract = "In this paper, topology-transparent scheduling for mobile multi-hop wireless networks is extended from constant-weight to variable-weight schedules. A construction of variable-weight topology-transparent schedules – the first of its kind – is provided based on transversal designs from the finite field. The schedules are integrated into the VWATT medium access control (MAC) protocol, enabling nodes to dynamically select their schedule weights to accommodate both their local traffic load and local topology while maintaining a guarantee on maximum delay. Simulations show VWATT to increase throughput compared to constant-weight topology-transparent schedules, to reduce both maximum and expected delay relative to schedules whose weights are not constrained to the set of weights, and to adapt rapidly to changes in topology and traffic load. The results suggest variable-weight topology-transparent scheduling as a viable approach to medium access control when a bound on delay is required.",
keywords = "Adaptive algorithms, Channel allocation, Combinatorial mathematics, Distributed algorithms, Wireless networks",
author = "Jonathan Lutz and Charles Colbourn and Violet Syrotiuk",
year = "2017",
month = "7",
day = "20",
doi = "10.1016/j.comnet.2017.04.023",
language = "English (US)",
volume = "122",
pages = "16--28",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",

}

TY - JOUR

T1 - Variable-weight topology-transparent scheduling

AU - Lutz, Jonathan

AU - Colbourn, Charles

AU - Syrotiuk, Violet

PY - 2017/7/20

Y1 - 2017/7/20

N2 - In this paper, topology-transparent scheduling for mobile multi-hop wireless networks is extended from constant-weight to variable-weight schedules. A construction of variable-weight topology-transparent schedules – the first of its kind – is provided based on transversal designs from the finite field. The schedules are integrated into the VWATT medium access control (MAC) protocol, enabling nodes to dynamically select their schedule weights to accommodate both their local traffic load and local topology while maintaining a guarantee on maximum delay. Simulations show VWATT to increase throughput compared to constant-weight topology-transparent schedules, to reduce both maximum and expected delay relative to schedules whose weights are not constrained to the set of weights, and to adapt rapidly to changes in topology and traffic load. The results suggest variable-weight topology-transparent scheduling as a viable approach to medium access control when a bound on delay is required.

AB - In this paper, topology-transparent scheduling for mobile multi-hop wireless networks is extended from constant-weight to variable-weight schedules. A construction of variable-weight topology-transparent schedules – the first of its kind – is provided based on transversal designs from the finite field. The schedules are integrated into the VWATT medium access control (MAC) protocol, enabling nodes to dynamically select their schedule weights to accommodate both their local traffic load and local topology while maintaining a guarantee on maximum delay. Simulations show VWATT to increase throughput compared to constant-weight topology-transparent schedules, to reduce both maximum and expected delay relative to schedules whose weights are not constrained to the set of weights, and to adapt rapidly to changes in topology and traffic load. The results suggest variable-weight topology-transparent scheduling as a viable approach to medium access control when a bound on delay is required.

KW - Adaptive algorithms

KW - Channel allocation

KW - Combinatorial mathematics

KW - Distributed algorithms

KW - Wireless networks

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

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

U2 - 10.1016/j.comnet.2017.04.023

DO - 10.1016/j.comnet.2017.04.023

M3 - Article

VL - 122

SP - 16

EP - 28

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

ER -