Variable weight sequences for adaptive scheduled access in MANETs

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

5 Citations (Scopus)

Abstract

Scheduling access to a shared channel in mobile ad hoc networks must address numerous competing requirements, for example on throughput, delay, and fairness. It must address disparate and dynamic traffic demands as well as losses due to collisions with neighbouring transmitters. It must address changes in the topology of the network that arise from mobility. Topology transparent scheduling schemes have been proposed as a means to support reasonable delay guarantees, minimum throughput guarantees, and to a lesser extent fairness concerns. Sequences based on codes and combinatorial designs have been explored that support topology transparent scheduling for mobile ad hoc networks. However, all of the schemes proposed provide every node with the same (or essentially the same) channel access, by assigning each node a transmission frame in which the number of transmission slots ('weight') is the same. In order to mitigate effects of losses due to collision, it is important to limit the set of frame schedules that are permitted; but at the same time, using frames with differing weights can improve throughput without sacrificing fairness. Combinatorial requirements for variable weight frame schedules are determined based on these observations.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages53-64
Number of pages12
Volume7280 LNCS
DOIs
StatePublished - 2012
Event7th International Conference on Sequences and Their Applications, SETA 2012 - Waterloo, ON, Canada
Duration: Jun 4 2012Jun 8 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7280 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th International Conference on Sequences and Their Applications, SETA 2012
CountryCanada
CityWaterloo, ON
Period6/4/126/8/12

Fingerprint

Fairness
Scheduling
Throughput
Topology
Mobile ad hoc networks
Mobile Ad Hoc Networks
Schedule
Collision
Combinatorial Design
Traffic Dynamics
Transmitters
Requirements
Vertex of a graph
Transmitter

Keywords

  • adaptation
  • medium access control
  • mobile ad hoc networks
  • topology-transparent scheduling
  • variable weight sequences

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lutz, J., Colbourn, C., & Syrotiuk, V. (2012). Variable weight sequences for adaptive scheduled access in MANETs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7280 LNCS, pp. 53-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7280 LNCS). https://doi.org/10.1007/978-3-642-30615-0_5

Variable weight sequences for adaptive scheduled access in MANETs. / Lutz, Jonathan; Colbourn, Charles; Syrotiuk, Violet.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7280 LNCS 2012. p. 53-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7280 LNCS).

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

Lutz, J, Colbourn, C & Syrotiuk, V 2012, Variable weight sequences for adaptive scheduled access in MANETs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7280 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7280 LNCS, pp. 53-64, 7th International Conference on Sequences and Their Applications, SETA 2012, Waterloo, ON, Canada, 6/4/12. https://doi.org/10.1007/978-3-642-30615-0_5
Lutz J, Colbourn C, Syrotiuk V. Variable weight sequences for adaptive scheduled access in MANETs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7280 LNCS. 2012. p. 53-64. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-30615-0_5
Lutz, Jonathan ; Colbourn, Charles ; Syrotiuk, Violet. / Variable weight sequences for adaptive scheduled access in MANETs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7280 LNCS 2012. pp. 53-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{59f4f2330cd94faab6ed80087f1e4a62,
title = "Variable weight sequences for adaptive scheduled access in MANETs",
abstract = "Scheduling access to a shared channel in mobile ad hoc networks must address numerous competing requirements, for example on throughput, delay, and fairness. It must address disparate and dynamic traffic demands as well as losses due to collisions with neighbouring transmitters. It must address changes in the topology of the network that arise from mobility. Topology transparent scheduling schemes have been proposed as a means to support reasonable delay guarantees, minimum throughput guarantees, and to a lesser extent fairness concerns. Sequences based on codes and combinatorial designs have been explored that support topology transparent scheduling for mobile ad hoc networks. However, all of the schemes proposed provide every node with the same (or essentially the same) channel access, by assigning each node a transmission frame in which the number of transmission slots ('weight') is the same. In order to mitigate effects of losses due to collision, it is important to limit the set of frame schedules that are permitted; but at the same time, using frames with differing weights can improve throughput without sacrificing fairness. Combinatorial requirements for variable weight frame schedules are determined based on these observations.",
keywords = "adaptation, medium access control, mobile ad hoc networks, topology-transparent scheduling, variable weight sequences",
author = "Jonathan Lutz and Charles Colbourn and Violet Syrotiuk",
year = "2012",
doi = "10.1007/978-3-642-30615-0_5",
language = "English (US)",
isbn = "9783642306143",
volume = "7280 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "53--64",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Variable weight sequences for adaptive scheduled access in MANETs

AU - Lutz, Jonathan

AU - Colbourn, Charles

AU - Syrotiuk, Violet

PY - 2012

Y1 - 2012

N2 - Scheduling access to a shared channel in mobile ad hoc networks must address numerous competing requirements, for example on throughput, delay, and fairness. It must address disparate and dynamic traffic demands as well as losses due to collisions with neighbouring transmitters. It must address changes in the topology of the network that arise from mobility. Topology transparent scheduling schemes have been proposed as a means to support reasonable delay guarantees, minimum throughput guarantees, and to a lesser extent fairness concerns. Sequences based on codes and combinatorial designs have been explored that support topology transparent scheduling for mobile ad hoc networks. However, all of the schemes proposed provide every node with the same (or essentially the same) channel access, by assigning each node a transmission frame in which the number of transmission slots ('weight') is the same. In order to mitigate effects of losses due to collision, it is important to limit the set of frame schedules that are permitted; but at the same time, using frames with differing weights can improve throughput without sacrificing fairness. Combinatorial requirements for variable weight frame schedules are determined based on these observations.

AB - Scheduling access to a shared channel in mobile ad hoc networks must address numerous competing requirements, for example on throughput, delay, and fairness. It must address disparate and dynamic traffic demands as well as losses due to collisions with neighbouring transmitters. It must address changes in the topology of the network that arise from mobility. Topology transparent scheduling schemes have been proposed as a means to support reasonable delay guarantees, minimum throughput guarantees, and to a lesser extent fairness concerns. Sequences based on codes and combinatorial designs have been explored that support topology transparent scheduling for mobile ad hoc networks. However, all of the schemes proposed provide every node with the same (or essentially the same) channel access, by assigning each node a transmission frame in which the number of transmission slots ('weight') is the same. In order to mitigate effects of losses due to collision, it is important to limit the set of frame schedules that are permitted; but at the same time, using frames with differing weights can improve throughput without sacrificing fairness. Combinatorial requirements for variable weight frame schedules are determined based on these observations.

KW - adaptation

KW - medium access control

KW - mobile ad hoc networks

KW - topology-transparent scheduling

KW - variable weight sequences

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

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

U2 - 10.1007/978-3-642-30615-0_5

DO - 10.1007/978-3-642-30615-0_5

M3 - Conference contribution

AN - SCOPUS:84864074431

SN - 9783642306143

VL - 7280 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 53

EP - 64

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -