Department of Science and Technology
This talk consists in two parts. In the first part, we revisit the maximum link activation problem with a generic model of wireless network that consists in a set of radio links being coupled by a channel gain matrix. Given the signal-to-interference-and-noise ratio (SINR) requirement, the problem amounts to determining how many of the links can be activated simultaneously at maximum. Link activation is a key element in scheduling and cross-layer resource allocation. We present mathematical formulations of the problem in the context of optimal scheduling, highlighting the impact of formulation on computational efficiency. In the second part of the talk, recent results and new perspectives are discussed. We present a reformulation of the link activation problem, enabling the global optimum to be reached in orders of magnitude faster. We then extend the problem definition and formulation for interference cancellation and cooperative transmission with relaying.