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 Scopus citations

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
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

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
Volume2015-June

Other

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

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

Fingerprint Dive into the research topics of 'On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks'. Together they form a unique fingerprint.

  • 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 (pp. 217-226). (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc); Vol. 2015-June). Association for Computing Machinery. https://doi.org/10.1145/2746285.2746302