A method for optimizing the adaptation of communication routes in a wireless network consisting of communication nodes, said network comprising several nodes, the transmission of stream data being carried out in the form of flows and between at least two source nodes Ns and at least two destination nodes Nd, having the following steps: • step 1, a step of broadcasting a first message M from a source node Si, Ns to all the other nodes of the network, in order to discover several paths Ci or routes capable of being used, • on receipt of the message M a node of the network stores, for each of the flows that it receives, the distance NN of the node in relation to the source node Ns or to the preceding node sending said flow, in order to generate a table Tf for each path traversal Ci initiated by the source node Ns for each flow coming from its neighbor nodes, the distance to the source node and the identifier Id of the neighbor node, • step 2, each destination node Nd for flows, transmits messages Mtopo to each of the neighbor nodes that are candidates to be a relay for several flows, said messages Mtopo containing information obtained by making use of the information in the table for storing the information collected in step 1, • step 3, each of the nodes receiving the flows transmits to the neighbor nodes said information contained in said message Mtopo, said information being transmitted by mutual agreement by identifying the paths Ci on which network coding will be able to be applied, • a node E identifies itself as a pivot node if it receives from at least a first destination neighbor node D a first flow X 1, from a second destination node F different from the first destination node D a second flow X 2, the first flow and the second flow being included in a flow list Lf and if it sends coded flows on separate paths, and on receipt of a second message emitted by the second destination node D, said node transmits to the nodes associated with the flows in Tf a message Mp informing that a node E is a pivot node Np, said pivot node transmitting its identifier Idp to the other nodes using a routing protocol, • step 4, the identifiers corresponding to the nodes that have identified themselves as pivot nodes are transmitted to the source nodes Ns, which will alert the destination nodes using the routing protocol, • then the source nodes Ns take the decision to make a change of flows or of streams and to propose to one or more pivot nodes that they use network coding for at least two flows in order to generate a single flow for the transmission to a destination node. • step 1, a step of broadcasting a first message M from a source node Si, Ns to all the other nodes of the network, in order to discover several paths Ci or routes capable of being used, • on receipt of the message M a node of the network stores, for each of the flows that it receives, the distance NN of the node in relation to the source node Ns or to the preceding node sending said flow, in order to generate a table Tf for each path traversal Ci initiated by the source node Ns for each flow coming from its neighbor nodes, the distance to the source node and the identifier Id of the neighbor node, • step 2, each destination node Nd for flows, transmits messages Mtopo to each of the neighbor nodes that are candidates to be a relay for several flows, said messages Mtopo containing information obtained by making use of the information in the table for storing the information collected in step 1, • step 3, each of the nodes receiving the flows transmits to the neighbor nodes said information contained in said message Mtopo, said information being transmitted by mutual agreement by identifying the paths Ci on which network coding will be able to be applied, • a node E identifies itself as a pivot node if it receives from at least a first destination neighbor node D a first flow X 1, from a second destination node F different from the first destination node D a second flow X 2, the first flow and the second flow being included in a flow list Lf and if it sends coded flows on separate paths, and on receipt of a second message emitted by the second destination node D, said node transmits to the nodes associated with the flows in Tf a message Mp informing that a node E is a pivot node Np, said pivot node transmitting its identifier Idp to the other nodes using a routing protocol, • step 4, the identifiers corresponding to the nodes that have identified themselves as pivot nodes are transmitted to the source nodes Ns, which will alert the destination nodes using the routing protocol, • then the source nodes Ns take the decision to make a change of flows or of streams and to propose to one or more pivot nodes that they use network coding for at least two flows in order to generate a single flow for the transmission to a destination node.