Distributed link scheduling with constant overhead

Sujay Sanghavi, Loc Bui, R. Srikant

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

Abstract

This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. The class is parameterized by integers k\geq 1. We show that algorithm k of our class achieves k/(k+2) of the capacity region, for every k\geq 1. . The algorithms have small and constant worst-case overheads: in particular, algorithm k generates a new schedule using (a) time less than 4k+2 round-trip times between neighboring nodes in the network, and (b) at most three control transmissions by any given node, for any k. The control signals are explicitly specified, and face the same interference effects as normal data transmissions. Our class of distributed wireless scheduling algorithms are the first ones guaranteed to achieve any fixed fraction of the capacity region while using small and constant overheads that do not scale with network size. The parameter k explicitly captures the tradeoff between control overhead and scheduler throughput performance and provides a tuning knob protocol designers can use to harness this trade-off in practice.

Original languageEnglish (US)
Title of host publicationSIGMETRICS'07 - Proceedings of the 2007 International Conference on Measurement and Modeling of Computer Systems
Pages313-324
Number of pages12
Edition1
DOIs
StatePublished - 2007
EventSIGMETRICS'07 - 2007 International Conference on Measurement and Modeling of Computer Systems - San Diego, CA, United States
Duration: Jun 12 2007Jun 16 2007

Publication series

NamePerformance Evaluation Review
Number1
Volume35
ISSN (Print)0163-5999

Other

OtherSIGMETRICS'07 - 2007 International Conference on Measurement and Modeling of Computer Systems
Country/TerritoryUnited States
CitySan Diego, CA
Period6/12/076/16/07

Keywords

  • Matchings
  • Primary interference
  • Scheduling
  • Wireless networks

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Distributed link scheduling with constant overhead'. Together they form a unique fingerprint.

Cite this