Mixed Integer-Linear Programming for Link Scheduling in Interference-Limited Networks

The authors consider the problem of link scheduling in wireless networks with interference. The problem of computing a link schedule to minimize the power consumption with the constraint that each link supports a given average data rate is formulated as an optimization problem. A simple analytical solution is obtained for Time Division Multiple Access (TDMA) scheduling to minimize a linear combination of the average power consumption on the links; this schedule gives the minimum total power consumption for regular topologies. They, then propose a method to compute energy efficient link schedules.

Provided by: Stanford University Topic: Mobility Date Added: Nov 2010 Format: PDF

Find By Topic