Revisiting the optimal scheduling problem

— In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the determination of minimum-length schedules are based on a collision channel model, in which neighboring transmissions cause destructive interference if and only if they are within the “interference region” of the receiving nodes. By contrast, here we adopt a more realistic model for the physical layer by requiring that a threshold be exceeded by the signal-to-interference-plus-noise ratio (SINR) for a transmission to be successful. Further we include aspects of the routing problem and utilize column generation for carrying out the computations.

• Type: Conference
• Year: 2008
• Where: CISS
• Authors: Sastry Kompella, Jeffrey E. Wieselthier, Anthony Ephremides
• Keywords: Certain Traffic Demands, CISS 2008, Collision Channel Model, Information Management, Minimum-length Schedules