Abstract: A system and method for communication resource allocation, a resource including a time slot and at least one associated channel, said channel including at least one transmit and/or receive frequency usable during said time slot, in a mobile meshed network including a first set of radio transceivers communicating with one another via radio links, at least one group, comprising a second set of at least one radio transceiver of said first set, said second set including a master transceiver in a master/subordinate relationship with all the radio transceivers of the second set, a central radio transceiver of the network belonging to said first set.

Abstract: A system and method for communication resource allocation, a resource including a time slot and at least one associated channel, said channel including at least one transmit and/or receive frequency usable during said time slot, in a mobile meshed network including a first set of radio transceivers communicating with one another via radio links, at least one group, comprising a second set of at least one radio transceiver of said first set, said second set including a master transceiver in a master/subordinate relationship with all the radio transceivers of the second set, a central radio transceiver of the network belonging to said first set.

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 synchronization method in a communication network is disclosed. A number of stations exchange messages between themselves. A synchronization pattern characteristic of the clock reference of the sender is inserted into each message transmitted by a sender. The clock reference of each station is updated with the clock reference that it receives from another station of the network if, and only if, the received time is leading the clock reference. The update is done by calculating the difference ?X=T?a?Ta between the time of sending T?a of the message received by a station A and the time of reception Ta of the same message by the station B, and applying a correction 0<?Y<=?X if the received time of sending is leading by a quantity of at least ? (?X>?>0).

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 synchronization method in a communication network comprising a number of stations exchanging messages between themselves comprising at least the following steps: inserting into each message transmitted by a sender a synchronization pattern characteristic of the clock reference of the sender, updating the clock reference of each station with the clock reference that it receives from another station of the network if, and only if, the received time is leading the clock reference, the update being done as follows: calculating the difference ?X=T?a?Ta between the time of sending T?a of the message received by a station A and the time of reception Ta of the same message by the station B, applying a correction 0<?Y<=?X if the received time of sending is leading by a quantity of at least ? (?X>?>0).