On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks

Xiaohan Kang, I. Hong Hou, Lei Ying

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

5 Citations (Scopus)

Abstract

We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoretical upper and lower bounds for general traffic. The bounds depend on the interference degree of the network and the max/min delay bound ratio. The performance of LDF is further evaluated using simulations and compared with two other algorithms. The simulation results show that LDF significantly outperforms the other two algorithms.

Original languageEnglish (US)
Title of host publicationMSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015
PublisherAssociation for Computing Machinery
Pages217-226
Number of pages10
Volume2015-June
ISBN (Electronic)9781450334891, 9781450335140, 9781450335171, 9781450335188, 9781450335232, 9781450335249, 9781450335256
DOIs
StatePublished - Jun 22 2015
Event16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2015 - Hangzhou, China
Duration: Jun 22 2015Jun 25 2015

Other

Other16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2015
CountryChina
CityHangzhou
Period6/22/156/25/15

Fingerprint

Wireless networks
Scheduling
Wireless ad hoc networks
Quality of service

Keywords

  • Ad hoc networks
  • Capacity requirement
  • Largest-deficit-first
  • Quality of service
  • Real-time scheduling

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Kang, X., Hou, I. H., & Ying, L. (2015). On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks. In MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015 (Vol. 2015-June, pp. 217-226). Association for Computing Machinery. https://doi.org/10.1145/2746285.2746302

On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks. / Kang, Xiaohan; Hou, I. Hong; Ying, Lei.

MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015. Vol. 2015-June Association for Computing Machinery, 2015. p. 217-226.

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

Kang, X, Hou, IH & Ying, L 2015, On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks. in MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015. vol. 2015-June, Association for Computing Machinery, pp. 217-226, 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2015, Hangzhou, China, 6/22/15. https://doi.org/10.1145/2746285.2746302
Kang X, Hou IH, Ying L. On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks. In MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015. Vol. 2015-June. Association for Computing Machinery. 2015. p. 217-226 https://doi.org/10.1145/2746285.2746302
Kang, Xiaohan ; Hou, I. Hong ; Ying, Lei. / On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks. MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015. Vol. 2015-June Association for Computing Machinery, 2015. pp. 217-226
@inproceedings{b943501d9c1148d8949a7f4867fa1ce6,
title = "On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks",
abstract = "We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoretical upper and lower bounds for general traffic. The bounds depend on the interference degree of the network and the max/min delay bound ratio. The performance of LDF is further evaluated using simulations and compared with two other algorithms. The simulation results show that LDF significantly outperforms the other two algorithms.",
keywords = "Ad hoc networks, Capacity requirement, Largest-deficit-first, Quality of service, Real-time scheduling",
author = "Xiaohan Kang and Hou, {I. Hong} and Lei Ying",
year = "2015",
month = "6",
day = "22",
doi = "10.1145/2746285.2746302",
language = "English (US)",
volume = "2015-June",
pages = "217--226",
booktitle = "MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks

AU - Kang, Xiaohan

AU - Hou, I. Hong

AU - Ying, Lei

PY - 2015/6/22

Y1 - 2015/6/22

N2 - We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoretical upper and lower bounds for general traffic. The bounds depend on the interference degree of the network and the max/min delay bound ratio. The performance of LDF is further evaluated using simulations and compared with two other algorithms. The simulation results show that LDF significantly outperforms the other two algorithms.

AB - We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoretical upper and lower bounds for general traffic. The bounds depend on the interference degree of the network and the max/min delay bound ratio. The performance of LDF is further evaluated using simulations and compared with two other algorithms. The simulation results show that LDF significantly outperforms the other two algorithms.

KW - Ad hoc networks

KW - Capacity requirement

KW - Largest-deficit-first

KW - Quality of service

KW - Real-time scheduling

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

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

U2 - 10.1145/2746285.2746302

DO - 10.1145/2746285.2746302

M3 - Conference contribution

AN - SCOPUS:85048534053

VL - 2015-June

SP - 217

EP - 226

BT - MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015

PB - Association for Computing Machinery

ER -