Abstract: A distributed method for dynamically assigning time-frequency resources in a network comprising several stations is disclosed. The stations are organized in groups (or interfaces) of several stations with each group comprising an allocation table Tsi. Each group exchanges this allocation table by means of a signaling protocol with groups that are defined as being in conflict with it by a constraints graph. The method uses an arbitration function to settle the conflicts and the assignments of allocations between the groups in conflict according to the constraints graph. In performing the method, each interface Ji transmits the allocation table TJi associated with it to the interfaces K indicated as being in conflict in the constraints graph. An interface Ji looks, for each allocation AJi that it has entered in its table TJi, whether the allocation AJi is used in the table received from an interface K that is in conflict.

Abstract: A distributed method for dynamically assigning time-frequency resources in a network comprising several stations is disclosed. The stations are organized in groups (or interfaces) of several stations with each group comprising an allocation table Tsi. Each group exchanges this allocation table by means of a signaling protocol with groups that are defined as being in conflict with it by a constraints graph. The method uses an arbitration function to settle the conflicts and the assignments of allocations between the groups in conflict according to the constraints graph. In performing the method, each interface Ji transmits the allocation table TJi associated with it to the interfaces K indicated as being in conflict in the constraints graph. An interface Ji looks, for each allocation AJi that it has entered in its table TJi, whether the allocation AJi is used in the table received from an interface K that is in conflict.