ES2575785T3 - Resource allocation - Google Patents

Description

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

DESCRIPTION

Resource allocation

The present invention relates to the field of mobile and meshed communications networks, for example mobile ad-hoc networks. Said networks include a plurality of radio transmitters / receivers interconnected among themselves via radio links. These radio transmitters / receivers are for example a computer terminal equipped with a Wi-Fi link, a portable telephone or any other wireless communication device, but can also be a mobile vehicle that integrates a wireless communication device. These radio transmitters / receivers are also known under the name of nodes in the state of the art.

The invention relates more precisely to the allocation of resources, a resource being defined by a time slot, also known with the expression slot, and at least one associated channel, said channel being at least one frequency of emission / reception that allows one or some communications in the mobile network. An example of these resources is presented in Figure 1. The allocation of resources is done in particular using multiple access to the means of transmission by time division (known in English with the expression "Time Division Multiple Access" or TDMA) or of the frequency (known in English with the expression "Frequency Division Multiple Access" or FDMA).

The mobile and meshed communication network includes radio transmitters / receivers distributed in different groups, in the state of the art these groups are also known as cluster or with the English name of cluster. An example of the mobile radio network is presented in Figure 2. Each group has a sender / receiver head of the group, and one of the senders / receivers is defined as the central sender / receiver of the network. The groupings are defined respecting the following rules:

- Each radio transmitter / receiver is either the chief sender / receiver of the group (CH) or the subordinate sender / receiver of the group (CM).

- The subordinate senders / receivers are all in radio range of their chief sender / receiver (CH).

- Each radio transmitter / receiver does not belong to a single group.

- The chief emitters / receivers (CH) are not radio neighbors.

- The central radio transmitter / receiver can be no matter which of the radio transmitters / receivers.

Two transmitters / receivers are in proximity if they are in radio range.

Two groupings A and B are called neighbors if at least one transmitter / receiver of one is in proximity with one transmitter / receiver of the other.

Two groupings A and B are in close proximity if at least one of the following conditions is true:

- They're neighbors.

- There is at least one radio transmitter / receiver of group A and one radio transmitter / receiver of group B that have a common neighbor in another group.

An example of these different conditions is presented in Figure 3. Figure 4 presents a situation in which the groupings A and C are not in close proximity.

Determination devices of the different groupings, of the transmitters / receivers chief of the group and of the central emitter / receiver of the network are described in the state of the art for example in the following documents:

- The IETF RFC recommendation number 3626 on OLSR which is the English acronym of Optimized Link State Routing Protocol written by T. Clausen and P. Jacquet

- The article by M. Gerla and J. T.-C. Tsai, which has the title Mutlicluster, mobile, multimedia radio network, published in "Journal of Wireless Networks, 1 (3): 255-265, July 1995"

- The article by Chiang, H. WU, W. Liuet M. Gerla which is entitled Routing in clustered multihop, mobile wireless networks with fading channel, published during the ICCS / ISPACS'96 conference held in Singapore in November 1996

- The article by Fabien Esmiol et al. "Distributed Multi-Level Cooperative Scheme for QoS Support in Public Safety Networks" XP032021963.

The object of the invention is therefore to dynamically allocate resources to the radio transmitters / receivers so as to ensure the transmission of these radio transmitters / receivers towards one or more of the neighboring radio transmitters / receivers, avoiding conflicts of interest. attributions (for example resulting from the fact that a radio transmitter / receiver can not transmit and receive simultaneously). The object of the invention is also to avoid interference between radio transmitters / receivers. This assignment therefore requires a complex coordination between the radio transmitters / receivers. This allocation may also depend on the communication needs of the different radio transmitters / receivers. In order to respond to the evolution of the organization of the groups and the resource needs of radio transmitters / receivers, it is necessary to have a system

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

that allows assignments to be modified continuously.

It is known, in the state of the art, a solution in which the mobile communication network is not organized into a set of groupings. The assignment depends on the type of transmission considered: diffusion-type transmission to all neighboring radio transmitters / receivers, point-to-point transmission (from a radio transmitter / receiver to a neighboring radio transmitter / receiver) and more general, from a radio transmitter / receiver to all or part of the neighboring radio transmitters / receivers. The assignment to avoid conflicts must take into account a certain number of rules, for example, not assigning the same time slot to different transmissions that involve common radio transmitters / receivers. Another rule is not to assign transmissions in the same channel of a temporary slot, if this implies an interference. This type of distribution negotiation is slow. However, the amount of resources to be allocated depends on the traffic need of the radio transmitter / receiver, so if the reactivity is reduced, situations may arise in which the resources allocated to a radio transmitter / receiver may be insufficient while that those assigned to another radio transmitter / receiver are too much.

Systems are also known that allow the allocation of resources in a mobile communication network, but only between radio transmitters / receivers of the same group. The allocation of the resources used for communications between radio transmitters / receivers belonging to two different groups is done using a multiple access by code division (known in English under the expression Code Division Multiple Access or CDMA). However, this type of allocation of resources within the framework of a mobile mesh communication network is not effective, in fact the interference due to the near / far effect can not be suppressed in this type of network.

Another solution known in the state of the art is to use a system of resource allocation equivalent to that used in a cellular network. In this case, it is considered that the access points are the senders / receivers of the group and the users are the radio transmitters / receivers. However, in these systems only the transmissions of a radio transmitter / receiver to the access point (sender / receiver head of the group) are taken into account. These systems do not allow the allocation of resources for direct transmissions between a radio transmitter / receiver and one or some neighboring radio transmitters / receivers. In addition, resource allocations for transmissions between radio transmitters / receivers belonging to different groupings or communications between two master transmitters / receivers can not be made by these systems. In effect in cellular networks, communications between two transmitters / receivers of different groupings pass through an interconnection network independent of the access points (senders / receivers group leader) and it is therefore not necessary to allocate resources. In the case of the use of small access points known under the name of femto-cells, there are known systems of resource allocation between these access points, however this type of assignment does not allow the allocation of resources for direct communication between two senders / receivers.

The present invention is mainly aimed at solving these problems by proposing a system and a procedure for allocating resources in a network of mobile and meshed communications, which allows an allocation of the resources that serve for communications between radio transmitters / receivers that belong to different groups and minimizing the exchanges, necessary for the allocation of these resources, between the different radio transmitters / receivers of the mobile and meshed communications network.

It is proposed, according to one aspect of the invention, a system for allocating communication resources, a resource comprising a time slot and at least one associated channel, said channel comprising at least one frequency of reception and / or reception usable during said time slot. , in a mobile mesh network comprising a first set of radio transmitters / receivers communicating with each other by means of radio links, at least one group, including a second set of at least one radio transmitter / receiver of said first set, said second set comprising a sender / receiver head in a relationship boss - subordinates with the set of radio transmitters / receivers of the second set. The mobile meshed network also comprising a central radio transmitter / receiver of the network belonging to said first set. This system being characterized in that it includes first means for determining said or said groupings, second means of assigning all or part of said resources by assigning a resource to a single group that can use said resource for one or some communications between radio transmitters / receivers of said group; or by assigning a resource to a single first group that can use said resource for communication between some radio transmitters / receivers of said first group and radio transmitters / receivers belonging to one or several neighboring destination groups, if none of the other resources that share the same time slot with said resource is determined as belonging to one of said destination groupings, or to another second group for links to one of said destination groupings of the first group, except if the first group and the second group does not have any emitter / receiver that has a neighbor of common radio in the groupings of destination. Said system also includes third means of allocation, for all or part of the groupings, of all or part of the resources assigned to said group, to one of the radio receiving transmitters of the group.

The system therefore allows an allocation of the network resources of mobile and meshed communications, minimizing the time of realization of this assignment and the messages exchanged to realize this

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

assignment.

According to one embodiment said second means are further adapted to initialize a priority index associated with each of said groupings from the number of radio transmitters / receivers belonging to the group, the number of radio transmitters / receivers that belong to the neighboring groups and the necessary resource requirements for the radio transmitters / receivers belonging to the group. Said second means are adapted to assign a resource to the group having the lowest priority index and which can use said resource for the communication between radio transmitters / receivers of said group, or to assign a resource to the first group that has the lowest priority index and can use said resource for communication between radio transmitters / receivers of said group and radio transmitters / receivers belonging to one or more neighboring destination groupings, if none of the other resources that share the same time slot with said resource is determined as belonging to one of the neighboring groupings or to another second group for links to one of said groupings of destination of the first group, except possibly if said first group and said second group do not have no emitter / receiver that has a neighbor of common radio that belongs to one of the groupings destination and update the priority index following a resource assignment.

This characteristic technique allows an allocation of resources to be maximized in order to maximize the resources assigned to the groups that have the greatest need for resources. The groups that have the greatest need for resources are the groups that have a large number of radio transmitters / receivers in the group, a large number of neighbors or for which the group's radio transmitters / receivers exchange a large number of radio stations. data.

According to one embodiment, said first determining means are also adapted for the determination of said central radio transmitter / receiver, said system also comprising fourth means, associated with a group, of transmitting the necessary resources for all or part of the radio transmitters / receivers of the group, towards the sender / receiver head of the grouping, of concatenation of the necessary resources for all the radio transmitters / receivers belonging to the group and of transmission of the necessary resources concatenated to the central radio transmitter / receiver and a fifth means associated to a group, of transmission of the resources assigned by the second means towards the sender / receiver head of the grouping and of transmission of the resources assigned by the third means towards the emitters / receivers radio of the group.

This characteristic technique allows managing a centralized resource allocation system in which the central radio allows the allocation of resources among the different groupings and the chief radios of the group allow allocating the resources among the different radio transmitters / receivers that are members of the group. group.

According to one embodiment, the second means and / or the third means are adapted for the division of the temporary slots into temporary sub-slots and the assignment of the temporary sub-slots to radio transmitters / receivers which may be different or groupings that may be different.

This characteristic technique allows to improve the allocation of resources for the transmission of data that need a low speed and a reduced latency. These data are, for example, real-time data or signaling data.

According to one embodiment, said system further comprises sixth means, for all or part of the radio transmitters / receivers and groups, of memorization of an authorization for use by the radio transmitter / receiver or the grouping of all or part of the available resources.

This characteristic technique allows managing a situation in which a network is split into two independent networks and avoiding interferences between independent networks.

Advantageously, the method of assigning communication resources, a resource comprising a time slot and at least one associated channel, said channel comprising at least one frequency of reception or reception usable during said time slot, in a mobile mesh network comprising a first set of radio transmitters / receivers communicating with each other by means of radio links, at least one group, including a second set of at least one radio transmitter / receiver of said first set, said second set comprising an emitter / receiver boss in a boss-subordinate relationship with the set of radio transmitters / receivers, a central radio transmitter / receiver of the network belonging to said first set, said method being characterized in that it includes a first step of determining the or such groupings, a second stage of allocation of all or part of said resources by assignment of a resource to a ica group that can use said resource for one or some communications between radio transmitters / receivers of said group; or by assigning a resource to a single first group that can use said resource for communication between radio transmitters / receivers of said first group and radio transmitters / receivers belonging to one or more neighboring destination groupings, if none of the other resources that share the same time slot with said resource is determined as belonging to one of said destination groupings, or to another second group for links to one of said

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

groupings of destination of the first group, except if the first group and the second group do not have any emitter / receiver that has a neighbor of common radio in the groupings of destination and a third stage of assignment, for all or part of the groupings, of all or part of the resources assigned to said group, by the sender / receiver head of the group to one of the radio transmitters / receivers of the group.

The invention will be better understood, and other advantages will arise with the reading of the detailed description made as a non-limiting example and with the help of the figures among which:

- Figure 1 presents the definition of resources

- Figure 2 presents the definition of a mobile and meshed communication network

- Figure 3 presents an example of groupings that are neighboring

- Figure 4 presents an example of groupings that are not neighboring

- Figure 5 shows the difference between the different types of communications

- Figure 6 presents a first embodiment of the system according to an aspect of the invention

- Figure 7 shows a first embodiment of the method according to an aspect of the invention

- Figure 8 presents an example of resource allocation in a mobile meshed communication network

The invention is carried out in a mobile and meshed communication network that has a dynamic organization. This organization makes it possible to regroup radio transmitters / receivers in a plurality of groupings. Each group comprises a set of radio transmitters / receivers and among these radio transmitters / receivers, one of the radio transmitters / receivers is designated to be the chief transmitter / receiver of the group. Each radio transmitter / receiver belongs to a single group. In addition, among the radio transmitters / receivers of the whole network one of the radio transmitters / receivers is designated to be the central emitter / receiver of the network.

The transmission needs of the transmitters / receivers in the network can be translated into transmission needs inside the group and between neighboring groups. In general, a type of transmission between groups implies a grouping of origin S and one or more neighboring destination groupings D1, D2, D3.

The transmissions that take place in the network are of the following types:

- Communications from a radio transmitter / receiver of a group to one or several radio transmitters / receivers of the same group. These communications are also called intra communication.

- Communications from a radio transmitter / receiver of a group to one or more radio transmitters / receivers of another group. These communications are also referred to as point-to-point communications.

Some communications from a sender / receiver of a group to the emitters / receivers of neighboring groups called inter diffusion type.

- The communication of a radio transmitter / receiver of a group to all neighboring radio transmitters / receivers belong or not to the same group. These communications are also referred to as broadcast communications.

Figure 5 presents the difference between these different types of communication.

The system as presented in figure 6 includes a first device 101 for determining the group (s). This device will therefore allow to determine the topology of the network, which will be used by the following devices.

The system also includes a second device 102 for allocating the resources to the different types of communications of the groupings. This allocation is determined based on topological considerations and the communication needs expressed by the senders / receivers. The needs of each receiving emitter of a group are organized and regrouped according to their type (ie intra type, inter diffusion type, inter point to point type or diffusion type) by the head of the group and subsequently transmitted to the central transmitter / receiver . The assignment is made respecting on the other hand some limitations of neighborhoods between the different radio transmitters / receivers. This assignment is made respecting the following rules:

- In general no assignment on the same time slot between two types of communications of the group if the source group of one of the types is in the target groupings of the other.

- In general no assignment on the same time slot between two types of communications of the group if the communications of the group comprise common target groupings.

- However, the two previous rules may not be applied if the issuers / receivers involved are different. Thus, if two groupings A and B are not in close proximity, the communications from A to Di and from B to Di can use the same time slot, even if the communications of the group have common target groupings.

- It results from the preceding rules that there is no assignment on the same time slot of a resource used for the inter communication of a group A and of an intra or inter resource of a group B if the 2 groupings are in close proximity.

5

10

fifteen

twenty

25

30

35

40

- No multiple assignment of the same resource in the network.

The assignment is therefore made by assigning a resource to a single group that can use said resource for one or some communications between radio transmitters / receivers of said group, if none of the other resources that share the same time slot with said resource is determined as belonging to the group; or by assigning a resource to a single group A that can use said resource for communication between radio transmitters / receivers of said group A and radio transmitters / receivers belonging to one or more neighboring destination groupings, if none of the other resources that share the same time slot with said resource is determined as belonging to one of said destination groupings, or to another group B for links to one of said groupings of destination of group A, except possibly if the group A and group B does not have any emitter / receiver that has a neighbor of common radio in the target groupings.

These rules allow resolving cases of conflict and independence of decision in the use of resources between heads of groups. That is to say that each group leader can, in the phase of allocation of resources to the members of the group, assign the resources to the subordinates of their group without having to coordinate with the other group leaders. This mechanism can be distributed in all or part of the radio transmitters / receivers of the network or carried out by the central transmitter / receiver. This central emitter / receiver is chosen dynamically so as to minimize the distance in number of radio jumps between the central receiver and the cluster managers. This allows to minimize the signaling flows and the attribution delays that are directly proportional to this distance. In one embodiment this assignment is made in the following manner considering nothing more than the communications of the intra and diffusion grouping:

The second allocation device uses input a set of requirements that represent the resource needs of each group. Each resource need is characterized by:

- The type of communication, intra-group communication or inter-group communication

- A weight that characterizes the criticality of the request

- The group to which this need for resources is associated.

Each group is associated with a set of variables, which characterize the topology, determined in the following way:

- A variable that characterizes the intra topology whose weight is a function of the relationship between the number of radio transmitters / receivers in the group and the total number of radio transmitters / receivers in the network.

- A variable that characterizes the inter topology whose weight is a function of the relationship between the number of neighbors at 1 and 2 jumps of the group and the total sum of the numbers of neighbors to 1 and 2 jumps of all the groupings of the network.

By neighborhood 1 and 2 jumps of a group means the set of radio transmitters / receivers that do not belong to this group and neighbors to 1 or 2 jumps of at least one radio transmitter of the group.

An emitter / receiver is said neighbor to 2 jumps of another transmitter / receiver if they are not neighbors to 1 jump and if they have at least one common neighbor emitter / receiver.

The assignment device 102 then considers each available resource sequentially. The considered resource is assigned to the need of resources, allowed in relation to the rules expressed above and whose weight is higher. This need for resources then reduces its weight and the device then deals with the next available resource.

An example of allocation result by the central emitter is given in the table below. Corresponds to the one represented in figure 8:

 CT1 CT2 CT3 CT4 CT5 CT6 CT7 CT8 CT9 CT10 CT11 CT12 CT13

 Channel 1

 1A 4R 3R 1R 2R 1A 4R 3R 1R 2R 1A 4R 3R

 Channel 2

 4A 2A 3A 4A 2A 3A 4A 2A

 Channel 3

 1A 2A 3A 1A 2A 3A 1A 2A

 Channel 4

 4A 4A 4A

 Channel 5

 4A 4A 4A

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

In the above table CT designates the time slot, xA designates the allocation of resources to the group x for intra communications, xR designates the allocation of resources to the group x for inter communications.

It is noted that in this network only groups 2 and 3 are not neighbors. It is for this reason that the allocation device arrives to put in the same time slot inter resources of the group 3 with intra resources of the group 2 (for example CT3) and inversely (for example CT13). On the other hand, this case of the figure does not occur for the other groupings.

The allocator nevertheless arrives to put in the same time slot intra resources of different groupings.

In a centralized embodiment it is necessary that the first device 101 for determining the group or groups is not already adapted for the determination and the central radio transmitter / receiver.

The system includes a third device 103 that allows distributing the resources assigned to a group between the different transmitters / receivers belonging to the group. In one embodiment this allocation can be made distributed among all or part of the radio transmitters / receivers of the group. In another embodiment this assignment can be made by the sender / receiver head of the group, this centralized mode of implementation allows to limit the message exchanges and therefore the network load. This third allocation device uses only the immediate need, independently of the need that allowed the allocation of resources to the group by the device 102. It is nevertheless necessary to respect the attribution to the types of transmission (intra-group communication or communication). inter grouping). In the case of a centralized assignment the sender / receiver head of the group then broadcasts to the issuers / receivers of the group a description of the allocation of the resources.

In an embodiment of the third device, each sender / receiver is characterized by a priority index whose value is for example N / D where N is the number of time slots or resources already allocated to the sender / receiver and D is the number of assignments requested per second. For example, if 1 resource is requested over 10 and each resource has a direction of 24 ms then D = 10 / 0.0240 = 4.17. The device then allocates the resources for the emitters / receivers that have the highest priority priority index. This resource assigned to the sender / receiver must, however, be compatible with a type determined by the second device 102.

In one embodiment it is possible to reassign a resource already assigned to another sender / receiver. However, this reassignment should not be made more than if the priority index of the sender / receiver is lower than the priority index of the sender / receiver for which the resource is reassigned.

In an embodiment of the second assignment device 102, it is possible to define for each group a priority index depending on the number of radio transmitters / receivers belonging to the group, of the number of radio transmitters / receivers belonging to the neighboring groups and the necessary resources for the radio transmitters / receivers that belong to the group. This index will allow the second resource allocation device to choose the groups that have the priority priority index. Then, when a resource is assigned to a group, the priority index of said group is updated. In one embodiment this index can be (T - t (j)) / D (j) in this relation T is the current instant, t (j) is the instant of the last assignment to a group j and D (j) is the maximum delay desired between the allocation of resources. The device 102 will then assign resources to the group j for which the relation (T - t (j)) / D (j) is maximum.

In a centralized embodiment, the second device 102 is contained in the central radio transmitter / receiver and the third device 103 is contained in the chief transmitters / receivers of the group. This embodiment includes a fourth device for transmitting the necessary resources for all or part of the senders / receivers of the group, towards the sender / receiver head of the group, of concatenation of the necessary resources for all the senders / receivers belonging to the group and transmission of the necessary resources concatenated to the central radio transmitter / receiver. This embodiment also includes a fifth device associated with a group, which transmits the resources assigned by the second device 102 to the sender / receiver head of the group and transmits the resources assigned by the third device 103 to the senders / recipients of the group.

These devices use the transmission of four different types of signaling messages:

- A message that allows the request of resources, transmitted by each subordinate of the group to its boss and that contains the list of the flows issued by this subordinate. Each flow is characterized by the source and destination addresses and a value that identifies the service contract characterized by a speed and a latency required, this value can for example use the fields as under the acronym DSCP by "Differentiated Services Code" Point. "

- A message that allows the transmission by the head of each group towards the central radio transmitter / receiver and that summarizes the demands received from its members. For each subordinate, the leader of the cluster transmits a single demand that corresponds to the smallest of the latencies of the flows received from this member and the sum of the velocity demands of the flows received from this subordinate.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

- A message transmitted by the central radio transmitter / receiver to all the group leaders that contains the list of resources assigned to each group.

- A message transmitted by each group leader to their subordinates and containing the list of resources assigned to each member.

In a centralized embodiment it is necessary that the first device 101 for determining the group or groups is not adapted for the determination and the central radio transmitter / receiver.

Figure 7 gives the different steps of the method according to an embodiment of the invention. This procedure includes the following steps:

- As a prerequisite, the system must know the topology of the network and have proceeded to regroup the issuers / receivers with the choice of a leader for each group. Retrieve references

- A stage of choice of the central transmitter / receiver. This choice can be made through the MNEP algorithm given below.

- A stage of transmitting the needs of the senders / receivers chief of the group towards the central sender / receiver.

- A stage of allocation of resources to the different groupings by the central sender / receiver. An example of carrying out this algorithm is described below.

- A stage of transmission of the results of the central assignment to the issuers / receivers of the group leaders.

- An allocation stage by the issuers / receivers of the group leaders. An example of carrying out this algorithm is described below.

- A stage of transmission of the result of the assignment by the group leader issuers / receivers towards their subordinate senders / receivers of the group.

The procedure that allows the determination of the central emitter / receiver by election is as follows:

The following definitions are proposed /

- V the set of the transmitters / receivers of the network.

- E the set of radio links between emitters / receivers {x, y} of the network, where x and V e and e V (non-oriented links)

- w (x, y) the weight associated with the link (x, y). w (x, y)> 0.

- dist (x, y) the distance between x and y being x and V e y e V, is calculated with the help of a shortest path calculation algorithm between x and y.

- exc (x) = max and e V dist (x, y): the eccentricity of a node x and V.

- rad (G) = min x e G exc (x) the radius of the network.

- diam (G) = max x e G exc (x) the diameter of the network.

- Let P be the set of emitters / receivers x and V such that exc (x) = rad (G). P is the set of nodes that are in the center of the network.

- The central sender / receiver is the emitter / receiver x e P that has the highest degree, that is, the largest number of neighbors U. In case of equality, the sender / receiver with the greater MAC address is chosen.

The procedure that allows intergroup assignment is as follows. A cost function value is associated to each resource request. Let slot (i) be the number of the last time slot assigned to request i. Let D (i) be the recurrence requested by the petition i. To the time slot N the value of the cost function of the request i is (N - slot (i)) / D (i). The principle of intergroup allocation is to allocate resources by groups of temporary slots not considering more than the temporary traffic slots and omitting the temporary slots, satisfying as a priority requests for resources whose cost function has the highest value. . Since there are conflicts between certain requests and the number of available frequency slots associated with each time slot of a group of T time slots can be variable, the order in which the resources are assigned to the requests is not indifferent. For this reason, at each iteration of the algorithm on a group of T time slots, all the permutations of the time slots of this group are evaluated. By permutation, all the time slots are evaluated one by one, and the algorithm assigns the frequency channels to the requests that respect the conflicts that exist between them (two requests can share the same time slot only if they are not in conflict). Once all the permutations have been evaluated, only the number of assigned resources as well as the number of requests to which at least one resource has been assigned are kept as candidates. Once the allocation has been calculated on a sufficient number of groups of temporary T slots, the algorithm calculates a shorter reason to transmit to the group leader emitters / receivers. This shorter message is either slot_threshold = 0, the variable that must take as value the number of time slots from which the allocator has assigned at least one resource each request, or slots_pattem_starting_slot and slots_pattem_ending_slot are the variables that take respectively the values of the first and last time slots to be retained in the long reason to define the short reason to be distributed to the network grouping heads.

5

10

fifteen

twenty

25

30

35

40

Four. Five

The procedure is based on an iterative treatment that calculates an assignment over a large number of time slots.

WHEREAS the length of the assignment reason is less than the target length MAKE

Use the stage of EVALUATION OF THE PERMUTATIONS OF T RANTIES.

Use the stage of SELECTION OF PERMUTATION OF T RANTIES.

Update the assignment data for the current T time slots based on the permutation selected.

IF slot_threshold is null AND at least one resource has been assigned to each request THEN

Position slot_threshold to the current length of the assignment reason.

These stages shorten the long assignment reason calculated above to generate a short reason to distribute to the chief emitters / receivers of the network group. The principle is that starting from an initial length, the longer the reason lengthens, the lower the maximum cost associated with requests for this reason. These stages are completed when the maximum cost does not already decrease substantially.

Use the stage CALCULATION OF THE ALLOCATION REASON.

Stage EVALUATION OF PERMUTATIONS OF T GROUPS

These stages evaluate the different permutations of T temporal slots that exist in a length of T temporal slots.

Sort the requests in decreasing order of the values of their cost function. Initialize to zero the maximum number of resources allocated for a permutation.

Initialize to zero a table that will contain the number of resources allocated for each permutation.

Initialize to zero the maximum number of requests satisfied for a permutation.

Initialize to zero a table that will contain the number of requests satisfied for each permutation.

FOR each permutation of the T temporary slots DO

The updates of the assignments of temporary slots to the requests as well as the values of cost functions are valid only in the context of the permutations considered. They will not become definitive only for the permutation that is selected at the end of the loop.

FOR each time slot of the permutation DO

FOR each appeal request DO

Calculate the value of the cost function associated with the current request if it is assigned the time slot considered.

Sort the requests in decreasing order of the values of their cost function.

Determine the real number of the time slot considered.

FOR each appeal request (considered in the decreasing order of the values of its cost function) MAKE

IF free frequency channels remain in the time slot considered THEN

If the considered time slot is already assigned (if this is the case it is necessarily in a different frequency channel) to another conflicting request THEN

IF a current slot has not yet been assigned to the current request THEN

This stage allows priority to be given to requests that do not have any resources assigned to them.

Decrease the D (i) value of the current request by 1.

IF NOT THEN THEN

Assign the first available channel in the temporary slot considered to the current request. Increase by 1 the number of resources allocated for the current permutation.

IF NOT THEN THEN

IF a current slot has not yet been assigned to the current request THEN

5

10

fifteen

twenty

25

30

35

40

Decrease the D (i) value of the current request by 1.

If it is necessary to update the maximum number of resources allocated for a permutation.

Count the number of requests satisfied for the current permutation.

If it is necessary to update the maximum number of requests satisfied for a permutation.

This check that follows is an optimization of the calculation time.

IF the number of usable channels per time slot is the same for all time slots THEN Exit the PARA loop.

Stage SELECTION OF PERMUTATION OF T GROUPS

Having been evaluated every permutation, it is now about retaining the best. The process is in two stages.

FOR each of the permutations of T temporary slots DO

In a first iteration, only the permutations that have both the maximum assigned resources and the maximum number of satisfied requests are retained.

IF the current permutation satisfies the maximum number of requests AND if the number of resources allocated for the current permutation is maximum THEN

Keep the current permutation for the second stage of selection of the permutations.

Consider permutation_1 the first of the permutations of T temporary slots retained during the first stage.

Initialize selected_permutation to the value permutation_1.

Extract permutation_1 from the list of permutations of T temporary slots retained during the first stage.

WHILE the list of permutations of T temporary slots retained during the first stage is not valid. DO

Consider permutation_2 the first of the permutations of T temporary slots retained during the first stage.

Extract permutation_2 from the list of permutations of T temporary slots retained during the first stage.

FOR each request (considered in the decreasing order of the values of its cost function) request_1 considered in the permutation permutation_1 DO

Let request_2 be the request of the same order in the permutation permutation_2 as request_1 in the permutation selected_permutation.

IF the value of the cost function of the request request_2 is lower than the value of the cost function of the request request_1 THEN

Assign the value permutation_2 to selected_permutation.

Exit the PArA loop.

YES NO if the values are the same THEN

Keep the current value of selected_permutation.

Go to the next iteration of the PARA loop.

IF NOT THEN THEN

Keep the current value of selected_permutation.

Exit the PARA loop.

The permutation selected is selected_permutation.

Stage CALCULATION OF THE ALLOCATION REASON

These stages generate a short motive to be distributed to the heads of the network group.

Position slots_pattern_starting_slot to value 2 * slot_threshold. Position slots_pattern_ending_slot to the value slots_pattern_starting_slot + T - 1.

5

10

fifteen

twenty

25

30

35

40

Four. Five

Initialize to zero the maximum cost metric previous_max_cost.

Initialize to zero the maximum cost practice max_cost.

EXECUTING IN LOOP INDEFINITELY FOR EACH REQUEST FOR RESOURCES i MAKE

FOR each pair of successive time slots (slot1, slot2) with slot1> slots_pattern_starting_slot and slot2 ^ slots_pattern_ending_slot DO

Calculate cost cost = (slot2 - slot1) / D (i).

SI cost> max_cost THEN

max_cost = cost

Calculate the loop_cost cost between the last and the first time slot assigned to the request i.

IF loop_cost> max_cost THEN THEN

max_cost = loop_cost

IF the previous_max_cost / max_cost e [0,99, 1,01] THEN Exit the infinite loop.

IF NOT

Increase slots_pattern_ending_slot in T.

Assign previous_max_cost the value of max_cost.

At the end of these stages, the calculated reason is the reason between the slots temporary slots_pattern_starting_slot and slots_pattern_ending_slot.

The procedure for allocating the resources by the chief sender / receiver of the group is carried out in one embodiment in the following manner:

The sender / receiver head of the group takes as input the assignment reason defined by the central sender / receiver and deduces a reason for assignment as indicated in the previous section. Among the resources included in this motive, certain of them are marked as having low latency. Prior to any assignment, all of these resources are considered to respond to a fictitious request.

The algorithm considers two types of requests: large time slot requests and temporary mini slot requests.

In a first large loop for each request except the fictitious request begins by looking for a resource (mini temporary slot or temporary slot according to the type of the request) free, later if it is impossible to recover a resource (mini temporary slot or temporary slot) according to the type of petition) to the detriment of another petition (except the fictitious petition). At most, a single temporary mini-slot resource per temporary slot is assigned to each temporary mini-slot request.

In a second large loop, a very similar treatment is carried out except that: (1) the resources considered are not more than a mini-slot resources, which can be assigned to requests for mini-slots as well as requests for temporary slots big; (2) resources of temporary slots allocated during the first large loop are forbidden for recovery. The condition under which only a single mini temporary slot can be allocated per time slot to a temporary mini slot request is always in effect.

In the third and last large loop, the same treatment is performed as during the second large loop except that:

(1) all resources allocated during the first two large loops are prohibited for recovery;

(2) Within the same large time slot, several mini time slots can be assigned to a request for a temporary mini slot.

In the following stages, after an assignment has been made (whether it is a temporary slot or a temporary mini slot), the set of requests is classified in increasing order of their cost function and the current iteration of the large loop in the process of execution (1, 2 or 3) is finished.

The following definitions are used:

- Nrecurso: total number of mini temporary slots

- kasign: total number of large temporary slots

5

10

fifteen

twenty

25

30

35

40

Four. Five

- Ngroup: number of requests

- D (i): number of temporary slots required for the application i

- Koef (i) = 1 / D (i)

- Asign (i, kr, k): the value of Asign (i, kr, k) indicates the channel (none if null value) assigned to the request i over the mini time slot number kr in the repetition k of the reason defined by the central emitter / receiver

- A (i, k): value 1 if the request i is compatible with a large temporary slot k

- Conflic (i, j): 1 if the i and j requests are in conflict

- Prohibi (temporary slot, channel): 1 if the resource (time slot, channel) is prohibited for assignment

- minislot (i): indicates whether request i requests a temporary mini slot (1) or a full temporary slot (4)

- Sasign (i) indicates the number of mini temporary slots assigned to the request i

The procedure uses 2 cost functions f1 and f2 defined in this document below:

In the first large loop of the algorithm, the function f1 () is used.

It is defined as follows:

If Sasign (i) = 0 then f1 (i) = 0.

If not f1 (i) = (Sasign (k) - minislot (k)) / minislot (k) * Koef (k) + 1/1000 If f1 (i) <1/1000 then f1 (i) = 1/1000

The division by minislot (k) means that, in relation to the value of the cost function, assigning a temporary slot (= 4 mini time slots) to a temporary slot request is equivalent to assigning a temporary mini slot to a Request for temporary mini slot.

In the second large loop of the algorithm, the function f2 () is used. It is defined as follows:

If Sasign (i) = 0 then f2 (i) = 0.

If not f2 (i) = (Sasign (k) - 1) / minislot (k) * Koef (k) + 1/1000 If f2 (i) <1/1000 then f2 (i) = 1/1000

The difference between f1 () and f2 () is in the substitution of the minislot (k) value for the constant 1. This allows the allocation of a temporary mini slot to a large slot request to count less than the allocation of a mini slot temporary slot to a temporary mini slot request.

Main stages of the procedure

Stage BIG LOOP 1

As long as at least one temporary slot or mini slot slot resource has been assigned or reassigned during the preceding iteration of the LARGE LOOP 1 then look to allocate a resource to a request (While convergence = 0)

As long as there are requests remaining to be evaluated (the fictitious request is ignored, the requests are considered one after the other, in the increasing order of their cost function f1 ().) And no temporary slot has been assigned to the current request (While test2 = 0 And I1 <Ngroup)

Summon the stage LOOP 1 SEARCH FOR FREE RESOURCE if no resources have been assigned during the LOOP 1 stage

SEARCH FOR FREE RESOURCE then it is necessary to seek to recover a resource to the detriment of another petition

Use stage STAGE LOOP 1 RECOVERY RECOVERY Mark all resources assigned to large slot requests as prohibited for recovery. Sort requests in increasing order of their cost function f2 ().

Stage BIG LOOP 2

As long as at least one temporary mini-slot resource has been allocated or reassigned during the preceding iteration of the LARGE LOOP 2 then look to allocate a resource to a request (While convergence = 0)

As long as there are some requests to be evaluated (the fictitious request is ignored, the requests are considered one after the other, in the increasing order of their cost function f2 ().) And no temporary mini slot has been assigned to the request current (While test2 = 0 And I1 <Ngroup)

5

10

fifteen

twenty

25

30

35

40

Four. Five

Use the stage LOOP 2 RESOURCE SEARCH MINI FREE SLOT If no resource has been assigned during the LOOP 2 SEQUENCE OF MINIMUM FREE SLOT RESOURCES then it is necessary to seek to recover a resource to the detriment of another request

Use stage STAGE LOOP 2 RECOVERY OF MINI SLOT RESOURCE

Mark all the resources assigned during the treatments carried out during the stage GRAN LOOP 1 and the stage GRAN LOOP 2 as prohibited for the recovery.

Sort requests in increasing order of their cost function f2 ().

Stage BIG LOOP 3

As long as at least one temporary mini-slot resource has been allocated or reassigned during the preceding iteration of the LARGE LOOP 3, then seek to allocate a resource to a request (While convergence = 0)

As long as there are some requests to be evaluated (the fictitious request is ignored, the requests are considered one after the other, in the increasing order of their cost function f2 ().) And no temporary slot has been assigned to the current request (While test2 = 0 And I1 <Ngroup)

Use the stage LOOP 3 SEARCH FOR RESOURCE MINI FREE SLOT

If no resources have been assigned during the LOOP 3 SEQUENCE OF MINI SLOT RESOURCE SEQUENCE then it is necessary to seek to recover a resource to the detriment of another request.

Use stage STAGE LOOP 3 RECOVERY OF RESOURCE MINI SLOT

Stage LOOP 1 RECOVERY OF FREE RESOURCE

Search for a free resource (Large time slots are considered one by one, from the large time slot offset to a constant (for example 7) relative to the last large time slot assigned to the current request.) (While test3 = 0 And kb <kasign)

If the current request is a request for large temporary slots (If mini-slot (i) = 4 Then)

Verify that the following conditions are met:

- the large time slot is compatible with the current request (A (i, kr) = 1)

- the large time slot is not already assigned to the current request (Asign (i, krs, k) = 0)

- no petition in conflict with the current petition has resources within the large time slot

- a free channel remains in the large time slot and in each of the mini time slots of the large time slot. If these conditions are verified then (If test4 = 0 And channel> 0 Then)

Assign the 4 mini temporary slots to the current request

Sort the requests in increasing order of their cost function f1 (). If the current request is a request for mini temporary slots (If minislot (i) = 1 Then):

Verify that the following conditions are met:

- in the current large time slot no mini time slots have already been assigned to the current request

- The large time slot is compatible with the current request.

Stage MINI SLOT LOOP 1

If all these conditions are verified then consider the mini time slots one by one until a resource is assigned to the current request (While imini <4 And testmini = 0)

Verify that the following conditions are met:

- no petition in conflict with the current petition has resources in the temporary mini slot

- one free channel remains in all the mini temporary slots of the large time slot.

If these conditions are verified then (If test4 = 0 And channel> 0 Then)

Assign to the current request the temporary mini slot in the first free channel on all the mini temporary slots of the large temporary slot

Sort the requests in increasing order of their cost function f1 ().

If no temporary mini slot allocation has been made to the current request then (If testmini = 0 Then)

5

10

fifteen

twenty

25

30

35

40

Four. Five

Stage MINI SLOT LOOP 2

Perform the same treatment as in the MINI SLOT LOOP 1 but agreeing to assign a channel in a temporary mini slot even if this channel is not free in all the mini temporary slots of the large time slot.

Stage LOOP 1 RECOVERY OF RESOURCES

Search for a resource to recover (Large temporary slots are considered one by one, starting with the large temporary slot shifted by a constant (for example 7) in relation to the last large temporary slot assigned to the current request.) (While test3 = 0 And kb <kasign)

By default, the resource considered is recoverable.

If the current request is a request for large temporary slots (If mini-slot (i) = 4 Then)

Verify that the following conditions are met:

- the large time slot is compatible with the current request (A (i, kr) = 1)

- the large time slot is not already assigned to the current request (Asign (i, krs, k) = 0)

If all these conditions are verified then consider one by one the 4 mini temporary slots of the large time slot.

Search if there is a request in the current temporary mini slot that has a channel that is assigned to it and that is in conflict with the current request i. If this is the case and that either ((f1 (i, n + 1)> f1 (j, n)) or (f1 (i, n + 1) = f1 (j, n) ei> j) or that the subscription for the benefit of i to the detriment of j is prohibited then no recovery of the channel in the large time slot is possible.

If it is possible to recover a channel in the resource of the large time slot then (If test4 = 0 Then)

Search the petition to the detriment of which the resource will be recovered.

Assign to the current request all mini-time slots in the selected channel De-allocate the appropriate resources:

For requests in conflict with the current request, all channels allocated in all temporary mini slots of the large time slot

For requests not in conflict with the current request, only the channel that has been recovered, in all the temporary mini-slots of the temporary slot

Sort the requests in increasing order of their cost function f1 ().

If the current request is a request for mini temporary slots (If mini-slot (i) = 1 Then)

Verify that the following conditions are met:

- in the current large time slot no mini time slots have already been assigned to the current request

- The large time slot is compatible with the current request Stage MINI SLOT LOOP 3

If all these conditions are verified then consider the 4 mini temporary slots of the large time slot one by one until a resource can be assigned to the current request to the detriment of another request (While imini <4 And testmini = 0)

Search if there is a request in the current temporary mini slot that has a channel that is assigned to it and that is in conflict with the current request i. If this is the case and that either ((f1 (i, n + 1)> f1 (j, n)) or (f1 (i, n + 1) = f1 (j, n) ei> j) or that the subscription for the benefit of i to the detriment of j is prohibited then no recovery of the channel in the current temporary mini slot is possible.

If it is possible to recover a channel in the temporary mini slot then (If test4 = 0 Then)

Search the petition to the detriment of which the resource will be recovered.

Assign the current mini-slot to the current request on the selected channel De-allocate the appropriate resources:

For each petition in conflict with the current petition

If the request is a request for a large temporary slot, all its channels in all its mini temporary slots of the large time slot. If the request is a temporary mini slot request, its channel in the temporary mini slot reassigned to the current request.

For each request not in conflict with the current request

If the request is a request for a large temporary slot, only the channel that has been recovered

5

10

fifteen

twenty

25

30

35

40

Four. Five

in all the temporary mini slots of the large temporary slot.

If the request is a temporary mini slot request, only the channel that has been retrieved in the temporary mini slot reassigned to the current request.

Sort the requests in increasing order of their cost function f1 ().

Stage LOOP 2 SEARCH RESOURCES MINI FREE SLOT

Search for a free resource (Large time slots are considered one by one, from the large time slot shifted by a constant (for example, 7) relative to the last large time slot assigned to the current request.) (While test3 = 0 And kb <kasign)

Consider one by one the mini temporary slots of the large time slot (While imini <4 And testmini = 0). Verify that the following conditions are met:

- there is at least one channel not prohibited in the current temporary mini slot

- the current request if it is a temporary mini slot does not already have a channel in one of the temporary mini slots of the large temporary slot

- the large time slot is compatible with the current request (A (i, kr) = 1)

- the temporary mini slot is not already assigned to the current request (Asign (i, krs, k) = 0)

If all these conditions are verified then

Verify that the following conditions are met:

- there is a free channel in the temporary mini slot

- No conflicting slot has channel in the temporary mini slot

If these two conditions are verified then (If test4 = 0 And channel> 0 Then)

Assign the current mini temporary slot to the current request on the first free channel Sort the requests in increasing order of their cost function f2 ().

Stage LOOP 2 RECOVERY OF RESOURCES MINI SLOT

Search for a resource to recover (Large temporary slots are considered one by one, starting with the large temporary slot shifted by a constant (for example 7) in relation to the last large temporary slot assigned to the current request.) (While test3 = 0 And kb <kasign)

By default, the resource considered is recoverable

Consider one by one the mini temporary slots of the large time slot (While imini <4 And testmini = 0). Verify that the following conditions are met:

- there is at least one channel not prohibited in the current temporary mini slot

- the current request if it is a temporary mini slot does not already have a channel in one of the temporary mini slots of the large temporary slot

- the large time slot is compatible with the current request (A (i, kr) = 1)

- the temporary mini slot is not already assigned to the current request (Asign (i, krs, k) = 0)

If all these conditions are verified then look for if there exists in the current temporary mini slot a request j that has a channel that is assigned to it and that is in conflict with the current request i. If this is the case and that either ((f2 (i, n + 1)> f2 (j, n)) or (f2 (i, n + 1) = f2 (j, n) ei> j) or that the subscription for the benefit of i to the detriment of j is prohibited then no recovery of the channel in the current temporary mini slot is possible.

If it is possible to recover a channel in the temporary mini slot then (If test4 = 0 Then)

Search the petition to the detriment of which the resource will be recovered.

Assign the current mini-slot to the current request on the selected channel De-allocate the appropriate resources:

For each request in conflict with the current request, its channel in the temporary mini slot reassigned to the current request

For each request not in conflict with the current request, your channel only if it is the channel that has been reassigned to the current request

Sort requests in increasing order of their cost function f2 ().

5

10

fifteen

twenty

25

30

Stage LOOP 3 SEARCH FOR RESOURCES MINI FREE SLOT

This procedure is identical to the Stage LOOP 2 of RESOURCE SEARCH MINI FREE SLOT except that the condition that limits the assignment to a request for a temporary mini slot by the large time slot is no longer verified.

Stage LOOP 3 RECOVERY OF RESOURCES MINI SLOT

This procedure is identical to Stage LOOP 2 RECOVERY OF MINI SLOT RESOURCES except that the condition that limits the allocation to a request for a temporary mini slot through the large time slot is no longer verified.

In one embodiment, certain temporary slots are divided into a plurality of time sub-slots (an advantageous division can be to divide the time slots into four time slots). The second device 102 or the third device 103 are adapted to use these temporary sub-slots. The configuration of the temporary slots that can be shared is carried out during a stage that precedes the use of the system or during the use of the system. This division of the time slots makes it possible to transmit data that requires low speed and low latency. These types of data are, for example, signaling data or real-time data. However, it is necessary to treat these two types of data in a different way, in effect the transmission of the signaling data is permanent while the transmission of real-time data is activated on demand. This thus results in the fact that when the real-time data transmission is not activated the time sub-slots are available for the transmission of other types of data. The third device 103 may not be authorized to use a temporary sub-slot, assigned to a group that temporarily matches another time slot, which contains a second time sub-slots, if radio transmitters / receivers in the group participate in a data exchange that uses one of these second time sub-slots. In order to avoid that a large number of temporary sub-slots that can subscribe are attributed to the same group, the second device does not assign consecutive temporary sub-slots to the same group. If certain of the temporary sub-slots could not be assigned to real-time data, they can be used for the transmission of other types of data.

In one embodiment, a sixth device allows memorizing the resources usable by radio transmitters / receivers or by grouping. Furthermore, in this embodiment, the second and the third assignment device are adapted for the allocation of resources to a radio transmitter / receiver or to a group, only if the resource is indicated as being usable by the sender / receiver of the radio. radio or group. This embodiment allows managing a possible network split in two independent networks and thus avoiding interferences between these two independent networks.

Claims (6)

5 10 fifteen twenty 25 30 35 40 Four. Five fifty 55 1. Communication resource allocation system, a resource comprising a time slot and at least one associated channel, said channel comprising at least one frequency of reception and / or reception usable during said time slot, in a mobile mesh network comprising : - a first set of radio transmitters / receivers that communicate with each other by means of radio links, - at least one group, including a second set of at least one radio transmitter / receiver of said first set, said second set comprising a sender / receiver in a chief-subordinate relationship with the set of radio transmitters / receivers of the second set; Y - a central radio transmitter / receiver of the network belonging to said first set, said system being characterized in that it includes: - first means of determining said or said groupings, - second means of allocation of all or part of said resources: - by assignment of a resource to a single group that can use said resource for one or some communications between radio transmitters / receivers of said group; or - by assigning a resource to a single first group that can use said resource for communication between radio transmitters / receivers of said first group and radio transmitters / receivers belonging to one or more neighboring destination groupings, if none of the other resources that share the same time slot with said resource is determined as belonging to one of said destination groupings, or to a second group, for links to one of said destination groupings of the first group, except if the first group and the second group does not have any emitter / receiver that has a neighbor of common radio in the groupings of destination - third means of allocation, for all or part of the groupings, of all or part of the resources assigned to said group, to one of the radio transmitters / receivers of the group. 2. System according to claim 1 wherein said second means are further adapted to: - initialize a priority index associated with each of said groupings starting from; - the number of radio transmitters / receivers belonging to the group, - the number of radio transmitters / receivers belonging to the neighboring groupings; Y - of the necessary resource requirements for radio broadcasters / receivers belonging to the group - assign a resource to the group that has the lowest priority index and that can use said resource for communication between radio transmitters / receivers of said group, - assign a resource to the first group having the lowest priority index and which can use said resource for communication between radio transmitters / receivers of said group and radio transmitters / receivers belonging to one or more groupings of radio stations neighboring destinations, if none of the other resources that share the same time slot with said resource is determined as belonging to one of the neighboring groupings or to another second group for links to one of said destination groupings of the first group, except possibly if said first group and said second group do not have any emitter / receiver that has a neighbor of common radio that belongs to one of the groupings of destination; Y - update the priority index following a resource assignment. System according to claim 1 or 2 wherein: said first determination means are also adapted for the determination of said central radio transmitter / receiver, said system also comprising: - a quarter means, associated to a group, of transmission of the necessary resources for all or part of the radio transmitters / receivers of the group, towards the sender / receiver head of the group, of concatenation of the necessary resources for the group of the radio transmitters / receivers belonging to the group and transmission of the necessary resources concatenated to the central radio transmitter / receiver, - Fifth means associated to a group, of transmission of the resources assigned by the second means towards the sender / receiver head of the group and of transmission of the resources assigned by the third means towards the radio transmitters / receivers of the group. System according to one of claims 1 to 3, in which the second means and / or the third means are adapted for the division of the temporary slots into temporary sub-slots and the assignment of the temporary sub-slots to some emitters / radio receivers that can be different or groups that can be 5 10 fifteen twenty 25 30 different System according to one of claims 1 to 4, further comprising sixth means, for all or part of the radio transmitters / receivers and groups, for storing an authorization for use by the radio transmitter / receiver or the grouping all or part of the available resources; and wherein said third means are further adapted not to assign a resource to a radio transmitter / receiver or to a group if said radio transmitter / receiver or said group are not authorized to use said resource. 6. Procedure for allocating communication resources, a resource comprising a time slot and at least one associated channel, said channel comprising at least one transmission or reception frequency usable during said time slot, in a mobile mesh network comprising: - a first set of radio transmitters / receivers that communicate with each other by means of radio links, - at least one group, including a second set of at least one radio transmitter / receiver of said first set, said second set comprising a sender / receiver in a chief-subordinate relationship with the set of radio transmitters / receivers - a central radio transmitter / receiver of the network belonging to said first set, said method being characterized in that it includes: - a first stage of determining the or of said groupings - a second stage of allocation of all or part of said resources: - by assignment of a resource to a single group that can use said resource for one or some communications between radio transmitters / receivers of said group; or - by assigning a resource to a single first group that can use said resource for communication between radio transmitters / receivers of said first group and radio transmitters / receivers belonging to one or more neighboring destination groupings, if none of the other resources that share the same time slot with said resource is determined as belonging to one of said destination groupings, or to a second group for links to one of said destination groupings of the first group, except if the first group and the second group does not have any emitter / receiver that has a neighbor of common radio in the groupings of destination - a third stage of allocation, for all or part of the groupings, of all or part of the resources allocated to said group, by the chief transmitter / receiver of the group to one of the radio transmitters / receivers of the group.