License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ECRTS.2019.11
URN: urn:nbn:de:0030-drops-107482
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10748/
Go to the corresponding LIPIcs Volume Portal


Gong, Tao ; Zhang, Tianyu ; Hu, Xiaobo Sharon ; Deng, Qingxu ; Lemmon, Michael ; Han, Song

Reliable Dynamic Packet Scheduling over Lossy Real-Time Wireless Networks

pdf-format:
LIPIcs-ECRTS-2019-11.pdf (2 MB)


Abstract

Along with the rapid development and deployment of real-time wireless network (RTWN) technologies in a wide range of applications, effective packet scheduling algorithms have been playing a critical role in RTWNs for achieving desired Quality of Service (QoS) for real-time sensing and control, especially in the presence of unexpected disturbances. Most existing solutions in the literature focus either on static or dynamic schedule construction to meet the desired QoS requirements, but have a common assumption that all wireless links are reliable. Although this assumption simplifies the algorithm design and analysis, it is not realistic in real-life settings. To address this drawback, this paper introduces a novel reliable dynamic packet scheduling framework, called RD-PaS. RD-PaS can not only construct static schedules to meet both the timing and reliability requirements of end-to-end packet transmissions in RTWNs for a given periodic network traffic pattern, but also construct new schedules rapidly to handle abruptly increased network traffic induced by unexpected disturbances while minimizing the impact on existing network flows. The functional correctness of the RD-PaS framework has been validated through its implementation and deployment on a real-life RTWN testbed. Extensive simulation-based experiments have also been performed to evaluate the effectiveness of RD-PaS, especially in large-scale network settings.

BibTeX - Entry

@InProceedings{gong_et_al:LIPIcs:2019:10748,
  author =	{Tao Gong and Tianyu Zhang and Xiaobo Sharon Hu and Qingxu Deng and Michael Lemmon and Song Han},
  title =	{{Reliable Dynamic Packet Scheduling over Lossy Real-Time Wireless Networks}},
  booktitle =	{31st Euromicro Conference on Real-Time Systems (ECRTS 2019)},
  pages =	{11:1--11:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-110-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{133},
  editor =	{Sophie Quinton},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10748},
  URN =		{urn:nbn:de:0030-drops-107482},
  doi =		{10.4230/LIPIcs.ECRTS.2019.11},
  annote =	{Keywords: Real-time wireless networks, lossy links, dynamic packet scheduling, reliability}
}

Keywords: Real-time wireless networks, lossy links, dynamic packet scheduling, reliability
Collection: 31st Euromicro Conference on Real-Time Systems (ECRTS 2019)
Issue Date: 2019
Date of publication: 02.07.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI