Résumé : We consider in this paper the distributed call scheduling problem in wireless networks. Due to interference in this kind of network, active links have to respect interference constraints. For example primary model permits to activate edges without common node. We assume we have random arrivals and the goal is to ensure for example the stability of the queueing system, bounding the average number of awaiting messages in the wireless network. Centralized algorithms permit to decide which links are activated at each step but it assumed a global knowledge of the network. It is necessary to design distributed algorithms which use local knowledge. We propose in this paper two distributed algorithms, valid for any binary interference model and with constant overhead, improving previous proposed ensuring only the first or the second feature.