This paper presents a theoretical study on the bandwidth reservation problem for ad hoc networks. The proposed model is based on the spacial reuse and the existence of interferences. We show that in that case, the bandwidth reservation problem is NP-complete and we provide some bounds that compare solutions of the problems derived with greedy heuristics with an optimal one. We conclude with a discussion on the practical aspect of this model and its potential use in a practical protocol.