Delivered by: Mr. Diogo Quintas (from Centre for Telecommunications Research, King's College London)
Abstract:
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.
Iniciativa apoiada pelo VTS Portugal Chapter.
Ver cartaz