Mobility

Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models

Download Now Free registration required

Executive Summary

Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of source-destination pairs), optimization of throughput entails design of "Efficient" routes between the given source-destination pairs, in conjunction with assignment of channels to interfaces and communication links, and scheduling of non-interfering links for simultaneous transmission. Prior work has looked at restricted versions of the above problem. In this paper, the authors design approximation algorithms for the joint routing, channel assignment, and link scheduling problem in wireless networks with general interference models.

  • Format: PDF
  • Size: 312.65 KB