Adaptive packet scheduling over a wireless channel under constrained jamming

Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou

Research output: Contribution to journalArticle

Abstract

In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most efficient way. The data is sent as the payload of packets, and becomes useless if the packet is jammed. We consider a jammer with constrained power, defined by parameters ρ and σ, which represent the rate at which the adversary may jam the channel, and the length of the largest burst of jams it can cause, respectively. This definition translates to the Adversarial Queuing Theory (AQT) constraints, typically used for packet arrivals. We propose deterministic algorithms that decide the length of the packets sent in order to maximize the goodput rate; i.e., the amount of useful payload successfully transmitted over time. To do so, we first define and study a static version of the problem, which is used as a building block for the dynamic problem. We start by assuming packets of the same length and characterizing the corresponding quasi-optimal length. Then, we show that by adapting the length of the packets, the goodput rate can be improved. Hence, we develop optimal adaptive algorithms that choose the packet lengths depending on the jams that have occurred up to that point in time, in order to maximize the total payload transmitted successfully over a period T in the presence of up to f jams.

Original languageEnglish (US)
Pages (from-to)72-89
Number of pages18
JournalTheoretical Computer Science
Volume692
DOIs
StatePublished - Sep 5 2017
Externally publishedYes

Fingerprint

Constraint theory
Adaptive Scheduling
Packet Scheduling
Jamming
Adaptive algorithms
Telecommunication links
Scheduling
Communication
Receiver
Maximise
Queuing Theory
Deterministic Algorithm
Dynamic Problem
Adaptive Algorithm
Optimal Algorithm
Burst
Building Blocks
Choose

Keywords

  • Adversarial jamming
  • Adversarial Queuing Theory
  • Online algorithms
  • Packet scheduling
  • Unreliable communication
  • Wireless channel

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Adaptive packet scheduling over a wireless channel under constrained jamming. / Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, Dariusz R.; Zavou, Elli.

In: Theoretical Computer Science, Vol. 692, 05.09.2017, p. 72-89.

Research output: Contribution to journalArticle

Fernández Anta, Antonio ; Georgiou, Chryssis ; Kowalski, Dariusz R. ; Zavou, Elli. / Adaptive packet scheduling over a wireless channel under constrained jamming. In: Theoretical Computer Science. 2017 ; Vol. 692. pp. 72-89.
@article{f5e4c8f328ad4da999f74dc984d8e804,
title = "Adaptive packet scheduling over a wireless channel under constrained jamming",
abstract = "In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most efficient way. The data is sent as the payload of packets, and becomes useless if the packet is jammed. We consider a jammer with constrained power, defined by parameters ρ and σ, which represent the rate at which the adversary may jam the channel, and the length of the largest burst of jams it can cause, respectively. This definition translates to the Adversarial Queuing Theory (AQT) constraints, typically used for packet arrivals. We propose deterministic algorithms that decide the length of the packets sent in order to maximize the goodput rate; i.e., the amount of useful payload successfully transmitted over time. To do so, we first define and study a static version of the problem, which is used as a building block for the dynamic problem. We start by assuming packets of the same length and characterizing the corresponding quasi-optimal length. Then, we show that by adapting the length of the packets, the goodput rate can be improved. Hence, we develop optimal adaptive algorithms that choose the packet lengths depending on the jams that have occurred up to that point in time, in order to maximize the total payload transmitted successfully over a period T in the presence of up to f jams.",
keywords = "Adversarial jamming, Adversarial Queuing Theory, Online algorithms, Packet scheduling, Unreliable communication, Wireless channel",
author = "{Fern{\'a}ndez Anta}, Antonio and Chryssis Georgiou and Kowalski, {Dariusz R.} and Elli Zavou",
year = "2017",
month = "9",
day = "5",
doi = "10.1016/j.tcs.2017.06.020",
language = "English (US)",
volume = "692",
pages = "72--89",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Adaptive packet scheduling over a wireless channel under constrained jamming

AU - Fernández Anta, Antonio

AU - Georgiou, Chryssis

AU - Kowalski, Dariusz R.

AU - Zavou, Elli

PY - 2017/9/5

Y1 - 2017/9/5

N2 - In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most efficient way. The data is sent as the payload of packets, and becomes useless if the packet is jammed. We consider a jammer with constrained power, defined by parameters ρ and σ, which represent the rate at which the adversary may jam the channel, and the length of the largest burst of jams it can cause, respectively. This definition translates to the Adversarial Queuing Theory (AQT) constraints, typically used for packet arrivals. We propose deterministic algorithms that decide the length of the packets sent in order to maximize the goodput rate; i.e., the amount of useful payload successfully transmitted over time. To do so, we first define and study a static version of the problem, which is used as a building block for the dynamic problem. We start by assuming packets of the same length and characterizing the corresponding quasi-optimal length. Then, we show that by adapting the length of the packets, the goodput rate can be improved. Hence, we develop optimal adaptive algorithms that choose the packet lengths depending on the jams that have occurred up to that point in time, in order to maximize the total payload transmitted successfully over a period T in the presence of up to f jams.

AB - In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most efficient way. The data is sent as the payload of packets, and becomes useless if the packet is jammed. We consider a jammer with constrained power, defined by parameters ρ and σ, which represent the rate at which the adversary may jam the channel, and the length of the largest burst of jams it can cause, respectively. This definition translates to the Adversarial Queuing Theory (AQT) constraints, typically used for packet arrivals. We propose deterministic algorithms that decide the length of the packets sent in order to maximize the goodput rate; i.e., the amount of useful payload successfully transmitted over time. To do so, we first define and study a static version of the problem, which is used as a building block for the dynamic problem. We start by assuming packets of the same length and characterizing the corresponding quasi-optimal length. Then, we show that by adapting the length of the packets, the goodput rate can be improved. Hence, we develop optimal adaptive algorithms that choose the packet lengths depending on the jams that have occurred up to that point in time, in order to maximize the total payload transmitted successfully over a period T in the presence of up to f jams.

KW - Adversarial jamming

KW - Adversarial Queuing Theory

KW - Online algorithms

KW - Packet scheduling

KW - Unreliable communication

KW - Wireless channel

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

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

U2 - 10.1016/j.tcs.2017.06.020

DO - 10.1016/j.tcs.2017.06.020

M3 - Article

AN - SCOPUS:85023610121

VL - 692

SP - 72

EP - 89

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -