Sciweavers

Share
TMC
2010

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

8 years 10 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—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 (i) assignment of channels to interfaces and communication links, and (ii) scheduling of non-interfering links for simultaneous transmission. Prior work has looked at restricted versions of the above problem. In this article, we design approximation algorithms for the joint routing, channel assignment, and link scheduling problem in wireless networks with general interference models. The unique contributions of our work include addressing the above joint problem in the context of physical interference model and single-path routing (wherein, traffic between a source-destination is restricted to a single path). To the best of our knowledge, ours is the ...
Mahmoud Al-Ayyoub, Himanshu Gupta
Added 31 Jan 2011
Updated 31 Jan 2011
Type Journal
Year 2010
Where TMC
Authors Mahmoud Al-Ayyoub, Himanshu Gupta
Comments (0)
books