Link scheduling in polynomial time

  • Authors:
  • B. Hajek;G. Sasaki

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL;-

  • Venue:
  • IEEE Transactions on Information Theory - Part 1
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network. The constraint on conversations is that each station can converse with only one other station at a time. The first algorithm is strongly polynomial and finds a schedule of minimum length that allows each pair of neighboring stations to converse directly for a prescribed length of time. The second algorithm is designed for the situation in which messages must be relayed multiple hops. The algorithm produces, in polynomial time, a routing vector and compatible link schedule that jointly meet a prespecified end-to-end demand, so that the schedule has the smallest possible length