Minimizing multiplayer interactive delay in multihop wireless networks

Kuang-Hao Liu, Jung-Shian Li, Chun Yen Wang, Naveen Chilamkurti, Athanasios V. Vasilakos

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

SUMMARY Minimizing the schedule frame length in spatial time division multiple access networks is essential in enhancing the performance of multiplayer interactive applications in multiple-group multicasting environments. In this paper, the joint link scheduling and multiple-group communication problem in such networks is referred to as a real-time multiple-group communication tree scheduling (RMGCTS) problem in which the objective is to minimize the total schedule frame length. It is shown that the RMGCTS problem can be represented as an integer linear programming problem. Two particular RMGCTS problems are considered, namely, back-to-back RMGCTS for applications with a receiving-jitter constraint, and general RMGCTS for applications with a delay constraint. Two heuristic algorithms, designated as back-to-back scheduling and level-by-level scheduling, are proposed to provide efficient solutions of the back-to-back and general RMGCTS problems by maximizing the spatial reuse capability within each time slot, thereby minimizing the schedule frame length. The simulation results show that the proposed schemes yield an effective reduction in the length of the multicast schedule frame compared to that obtained from existing tree-based or pure-color scheduling algorithms.

Original languageEnglish
Pages (from-to)1330-1349
Number of pages20
JournalInternational Journal of Communication Systems
Volume25
Issue number10
DOIs
Publication statusPublished - 2012 Oct 1

Fingerprint

Wireless networks
Scheduling
Communication
Multicasting
Time division multiple access
Heuristic algorithms
Scheduling algorithms
Jitter
Linear programming
Telecommunication links
Color

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Liu, Kuang-Hao ; Li, Jung-Shian ; Wang, Chun Yen ; Chilamkurti, Naveen ; Vasilakos, Athanasios V. / Minimizing multiplayer interactive delay in multihop wireless networks. In: International Journal of Communication Systems. 2012 ; Vol. 25, No. 10. pp. 1330-1349.
@article{5badc4c77b2345a5a85adcdcb17c2a17,
title = "Minimizing multiplayer interactive delay in multihop wireless networks",
abstract = "SUMMARY Minimizing the schedule frame length in spatial time division multiple access networks is essential in enhancing the performance of multiplayer interactive applications in multiple-group multicasting environments. In this paper, the joint link scheduling and multiple-group communication problem in such networks is referred to as a real-time multiple-group communication tree scheduling (RMGCTS) problem in which the objective is to minimize the total schedule frame length. It is shown that the RMGCTS problem can be represented as an integer linear programming problem. Two particular RMGCTS problems are considered, namely, back-to-back RMGCTS for applications with a receiving-jitter constraint, and general RMGCTS for applications with a delay constraint. Two heuristic algorithms, designated as back-to-back scheduling and level-by-level scheduling, are proposed to provide efficient solutions of the back-to-back and general RMGCTS problems by maximizing the spatial reuse capability within each time slot, thereby minimizing the schedule frame length. The simulation results show that the proposed schemes yield an effective reduction in the length of the multicast schedule frame compared to that obtained from existing tree-based or pure-color scheduling algorithms.",
author = "Kuang-Hao Liu and Jung-Shian Li and Wang, {Chun Yen} and Naveen Chilamkurti and Vasilakos, {Athanasios V.}",
year = "2012",
month = "10",
day = "1",
doi = "10.1002/dac.1309",
language = "English",
volume = "25",
pages = "1330--1349",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",
number = "10",

}

Minimizing multiplayer interactive delay in multihop wireless networks. / Liu, Kuang-Hao; Li, Jung-Shian; Wang, Chun Yen; Chilamkurti, Naveen; Vasilakos, Athanasios V.

In: International Journal of Communication Systems, Vol. 25, No. 10, 01.10.2012, p. 1330-1349.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Minimizing multiplayer interactive delay in multihop wireless networks

AU - Liu, Kuang-Hao

AU - Li, Jung-Shian

AU - Wang, Chun Yen

AU - Chilamkurti, Naveen

AU - Vasilakos, Athanasios V.

PY - 2012/10/1

Y1 - 2012/10/1

N2 - SUMMARY Minimizing the schedule frame length in spatial time division multiple access networks is essential in enhancing the performance of multiplayer interactive applications in multiple-group multicasting environments. In this paper, the joint link scheduling and multiple-group communication problem in such networks is referred to as a real-time multiple-group communication tree scheduling (RMGCTS) problem in which the objective is to minimize the total schedule frame length. It is shown that the RMGCTS problem can be represented as an integer linear programming problem. Two particular RMGCTS problems are considered, namely, back-to-back RMGCTS for applications with a receiving-jitter constraint, and general RMGCTS for applications with a delay constraint. Two heuristic algorithms, designated as back-to-back scheduling and level-by-level scheduling, are proposed to provide efficient solutions of the back-to-back and general RMGCTS problems by maximizing the spatial reuse capability within each time slot, thereby minimizing the schedule frame length. The simulation results show that the proposed schemes yield an effective reduction in the length of the multicast schedule frame compared to that obtained from existing tree-based or pure-color scheduling algorithms.

AB - SUMMARY Minimizing the schedule frame length in spatial time division multiple access networks is essential in enhancing the performance of multiplayer interactive applications in multiple-group multicasting environments. In this paper, the joint link scheduling and multiple-group communication problem in such networks is referred to as a real-time multiple-group communication tree scheduling (RMGCTS) problem in which the objective is to minimize the total schedule frame length. It is shown that the RMGCTS problem can be represented as an integer linear programming problem. Two particular RMGCTS problems are considered, namely, back-to-back RMGCTS for applications with a receiving-jitter constraint, and general RMGCTS for applications with a delay constraint. Two heuristic algorithms, designated as back-to-back scheduling and level-by-level scheduling, are proposed to provide efficient solutions of the back-to-back and general RMGCTS problems by maximizing the spatial reuse capability within each time slot, thereby minimizing the schedule frame length. The simulation results show that the proposed schemes yield an effective reduction in the length of the multicast schedule frame compared to that obtained from existing tree-based or pure-color scheduling algorithms.

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

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

U2 - 10.1002/dac.1309

DO - 10.1002/dac.1309

M3 - Article

VL - 25

SP - 1330

EP - 1349

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

IS - 10

ER -