A new model for packet scheduling in multihop wireless networks

  • Authors:
  • Haiyun Luo;Songwu Lu;Vaduvur Bharghavan

  • Affiliations:
  • UCLA, Computer Science Department, Los Angeles, CA;UCLA, Computer Science Department, Los Angeles, CA;Coordinated Science Laboratory, University of Illinois

  • Venue:
  • MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
  • Year:
  • 2000

Quantified Score

Hi-index 0.06

Visualization

Abstract

The goal of packet scheduling disciplines is to achieve fair and maximum allocation of channel bandwidth. However, these two criteria can potentially be in conflict in a generic-topology multihop wireless network where a single logical channel is shared among multiple contending flows and spatial reuse of the channel bandwidth is possible. In this paper, we propose a new model for packet scheduling that addresses this conflict. The main results of this paper are the following: (a) a two-tier service model that provides a minimum “fair” allocation of the channel bandwidth for each packet flow and additionally maximizes spatial reuse of bandwidth, (b) an ideal centralized packet scheduling algorithm that realizes the above service model, and (c) a practical distributed backoff-based channel contention mechanism that approximates the ideal service within the framework of the CSMA/CA protocol.