  We consider a multi-agent system where agents compete for the access to the
radio resource. By combining some application-level parameters, such as the
resilience, with a knowledge of the radio environment, we propose a new way of
modeling the scheduling problem as an optimization problem. We design
accordingly a low-complexity solver. The performance are compared with
state-of-the-art schedulers via simulations. The numerical results show that
this application-oriented scheduler performs better than standard schedulers.
As a result, it offers more space for the selection of the application-level
parameters to reach any arbitrary performance.
