Creating and sharing knowledge for telecommunications

Seminar ''Randomized Approximate Scheduling in Multi Hop Networks''

on 21-12-2010


Mr. Diogo Quintas, Centre for Telecommunications Research, King’s College London

Tuesday, December 21th, 2010 at 14h30

Throughput optimal routing algorithms, first purposed by Tassiulas and Ephremides in 1992, rely in solving a maximization problem that, in general and depending on the particular interference model and degrees of freedom, is in NP-complete.

Two non-optimal scheduling algorithms with provable performance bounds will be explored and a simple randomization technique is introduced such that the average performance of both techniques is improved.

More Information..