Scheduling performance enhancement by network coding in wireless mesh networks

Jung-Shian Li, Kuang-Hao Liu, N. Chilamkurti, L. Shu, T. Q. Duong

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

When a wireless mesh network accommodates interactive applications with quality of service requirements, schedule-based protocols are more suitable than contention-based protocols. In this paper, the problem of determining an appropriate schedule assignment for multiple group transmissions within a spatial time division multiple access link scheduling network is referred to as an integrated multiple-group communication and link scheduling problem. A polynomial-time scheduling algorithm, designated as a source-parallel-aware assignment (SPAA), is proposed to increase the spatial utilisation within each time slot in order to enhance the network throughput. Furthermore, an advanced version of SPAA, designated as joint source-parallel-aware assignment with network coding (JSANC), is proposed to reduce the effects of bottleneck paths on the schedule frame length by flexibly applying conventional or opportunistic network coding approaches. Simulation results show that the proposed algorithms achieve a better network throughput than existing flow-based or particular order-based scheduling schemes.

Original languageEnglish
Pages (from-to)1912-1919
Number of pages8
JournalIET Communications
Volume6
Issue number13
DOIs
Publication statusPublished - 2012 Sep 5

Fingerprint

Network coding
Wireless mesh networks (WMN)
Scheduling
Throughput
Network protocols
Time division multiple access
Scheduling algorithms
Quality of service
Polynomials
Communication

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Li, Jung-Shian ; Liu, Kuang-Hao ; Chilamkurti, N. ; Shu, L. ; Duong, T. Q. / Scheduling performance enhancement by network coding in wireless mesh networks. In: IET Communications. 2012 ; Vol. 6, No. 13. pp. 1912-1919.
@article{33dcedae2b5b49bd8a2983a47a559f8e,
title = "Scheduling performance enhancement by network coding in wireless mesh networks",
abstract = "When a wireless mesh network accommodates interactive applications with quality of service requirements, schedule-based protocols are more suitable than contention-based protocols. In this paper, the problem of determining an appropriate schedule assignment for multiple group transmissions within a spatial time division multiple access link scheduling network is referred to as an integrated multiple-group communication and link scheduling problem. A polynomial-time scheduling algorithm, designated as a source-parallel-aware assignment (SPAA), is proposed to increase the spatial utilisation within each time slot in order to enhance the network throughput. Furthermore, an advanced version of SPAA, designated as joint source-parallel-aware assignment with network coding (JSANC), is proposed to reduce the effects of bottleneck paths on the schedule frame length by flexibly applying conventional or opportunistic network coding approaches. Simulation results show that the proposed algorithms achieve a better network throughput than existing flow-based or particular order-based scheduling schemes.",
author = "Jung-Shian Li and Kuang-Hao Liu and N. Chilamkurti and L. Shu and Duong, {T. Q.}",
year = "2012",
month = "9",
day = "5",
doi = "10.1049/iet-com.2011.0445",
language = "English",
volume = "6",
pages = "1912--1919",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology",
number = "13",

}

Scheduling performance enhancement by network coding in wireless mesh networks. / Li, Jung-Shian; Liu, Kuang-Hao; Chilamkurti, N.; Shu, L.; Duong, T. Q.

In: IET Communications, Vol. 6, No. 13, 05.09.2012, p. 1912-1919.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Scheduling performance enhancement by network coding in wireless mesh networks

AU - Li, Jung-Shian

AU - Liu, Kuang-Hao

AU - Chilamkurti, N.

AU - Shu, L.

AU - Duong, T. Q.

PY - 2012/9/5

Y1 - 2012/9/5

N2 - When a wireless mesh network accommodates interactive applications with quality of service requirements, schedule-based protocols are more suitable than contention-based protocols. In this paper, the problem of determining an appropriate schedule assignment for multiple group transmissions within a spatial time division multiple access link scheduling network is referred to as an integrated multiple-group communication and link scheduling problem. A polynomial-time scheduling algorithm, designated as a source-parallel-aware assignment (SPAA), is proposed to increase the spatial utilisation within each time slot in order to enhance the network throughput. Furthermore, an advanced version of SPAA, designated as joint source-parallel-aware assignment with network coding (JSANC), is proposed to reduce the effects of bottleneck paths on the schedule frame length by flexibly applying conventional or opportunistic network coding approaches. Simulation results show that the proposed algorithms achieve a better network throughput than existing flow-based or particular order-based scheduling schemes.

AB - When a wireless mesh network accommodates interactive applications with quality of service requirements, schedule-based protocols are more suitable than contention-based protocols. In this paper, the problem of determining an appropriate schedule assignment for multiple group transmissions within a spatial time division multiple access link scheduling network is referred to as an integrated multiple-group communication and link scheduling problem. A polynomial-time scheduling algorithm, designated as a source-parallel-aware assignment (SPAA), is proposed to increase the spatial utilisation within each time slot in order to enhance the network throughput. Furthermore, an advanced version of SPAA, designated as joint source-parallel-aware assignment with network coding (JSANC), is proposed to reduce the effects of bottleneck paths on the schedule frame length by flexibly applying conventional or opportunistic network coding approaches. Simulation results show that the proposed algorithms achieve a better network throughput than existing flow-based or particular order-based scheduling schemes.

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

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

U2 - 10.1049/iet-com.2011.0445

DO - 10.1049/iet-com.2011.0445

M3 - Article

VL - 6

SP - 1912

EP - 1919

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 13

ER -