Abstract: This method, executed in a group of nodes of the ad hoc network (1) including a source (10), first and second relays (11, 12) and an addressee (13), the relays being neighbors of the source, the addressee being a neighbor of the relays, the source having useful data to be retransmitted towards a final addressee (15) through a routing path passing through the first relay (11), and then the addressee (13), consist of: computing a first characteristic quantity of an elementary path between the source (10) and the addressee (13), via the first relay (11) and a second characteristic quantity of an elementary path between the source (10) and the addressee (13), via the second relay (11); verifying the observance of a criterion for the first characteristic quantity; and, in case of negative verification, using the second relay (12) for relaying the useful data from the source (10), towards the addressee (13).

Abstract: This node, applying an information broadcasting service of the flooding type, includes a controller for accessing the radio resource able to perform dynamic containment for accessing the radio resource. It is characterized in that it includes a network coder allowing generation of the data packets so that each packet includes, in the payload portion, a message (M) resulting from the combination of a plurality of pieces of information (Info_idi) to be broadcast, and in the header portion, a list (L) of the identifiers (Idk) of the pieces of information combined in the message.

Abstract: This method, executed in a group of nodes of the ad hoc network (1) including a source (10), first and second relays (11, 12) and an addressee (13), the relays being neighbors of the source, the addressee being a neighbor of the relays, the source having useful data to be retransmitted towards a final addressee (15) through a routing path passing through the first relay (11), and then the addressee (13), consist of: computing a first characteristic quantity of an elementary path between the source (10) and the addressee (13), via the first relay (11) and a second characteristic quantity of an elementary path between the source (10) and the addressee (13), via the second relay (11); verifying the observance of a criterion for the first characteristic quantity; and, in case of negative verification, using the second relay (12) for relaying the useful data from the source (10), towards the addressee (13).

Abstract: The transmission method according to the invention includes transmitting a message from a source transmitting node to a final receiving node through a series of hops from a transmitter node to an immediately following receiver node, using: a) a reliability management mechanism including applying a retransmission law of the message on the hop, from the transmitting node to the receiving node, said law including message non-retransmission rules leading to the non-retransmission of the message, b) a mechanism for managing congestion of the nodes providing for a limitation of the throughput (?) for sending from a transmitting node to a receiving node following congestion information from the receiving node sent to the transmitting node, said mechanism being applied only hop-by-hop, the congestion information only being transmitted from a receiving node to a transmitting node over a same hop to limit the throughput of only the transmitting node toward only the receiving node.

Abstract: The invention relates to a method for transmission of messages from a sender node to multiple destination nodes in a network in which: The same message is sent from the sender node to multiple destination nodes, and the destination node of a message returns an acknowledgment message to the sender node after receiving the message it comprises a step of the distribution, by the sender node, of the destination nodes into at least two groups of destination nodes according to a predetermined distribution criterion taking into account the to and fro travel time between the sending of the message and the receiving of the acknowledgment message from the destination node, and a step of sending of messages to destination nodes in the same group with a latency period between the sending of two successive messages to the same destination nodes of the same group, the latency periods, each specific to a group and defining the throughput rate of the group being different from one group to another.

Abstract: This node, applying an information broadcasting service of the flooding type, includes a controller for accessing the radio resource able to perform dynamic containment for accessing the radio resource. It is characterized in that it includes a network coder allowing generation of the data packets so that each packet includes, in the payload portion, a message (M) resulting from the combination of a plurality of pieces of information (Info_idi) to be broadcast, and in the header portion, a list (L) of the identifiers (Idk) of the pieces of information combined in the message.

Abstract: Allocation of communications resources, in a mobile meshed network structured as a plurality of clusters each comprising at least one node, includes: generating a chart of configurations each comprising a different allocation priority index for each time slot of the time window, the indices varying from 0 to n?1; assigning a configuration,—among the generated set of configurations, to each cluster such that a predetermined number Np of priority indices are not assigned to the same slots for the clusters which are mutually adjacent; and allocating the time slots to the intra cluster communications in the order of priorities which are defined in the configuration assigned to the cluster, the priority index associated with a slot increasing with the order of allotting of a slot to a new communication, a new slot being allotted only if all the slots whose priority index is smaller are already allocated to a communication.

Abstract: Method for disseminating messages or information content in a hybrid network including a network scaffold comprising pilot entities, and a mobile network including mobile nodes communicating in an “ad hoc” manner with one another, the method including: at the level of each of the pilot entities of the scaffold of the network, scheduling the transfers of at least one message by: let SC(t) be the set of mobile nodes that have subscribed to the content of type C, let Mi be a message corresponding to the content of type C, for each message Mi, if a mobile user node Ui is present in the neighborhood of a pilot entity, then if Ui is subscribed to the content of type Mi, transfer the message Mi to the mobile user Ui, execute a control loop to disseminate the messages to all the mobile nodes that have subscribed to the receipt of a content Mi as a function of the progress of this dissemination so as to comply with timescales required for the distribution of said message.

Abstract: A routing method in a network with intermittent connectivity, characterized in that it includes, to determine the routing information, for an opportunistically defined routing, for a network comprising a number n of nodes, kmax being the maximum number of relays to be considered in the routing, and M1, a matrix of size n×n, iterative steps of estimating the delay with (k+1) hops and the list of corresponding relays from <?ij> matrix of the inverses of the average inter-contact times and of the estimates of delays with k hops present in Mk, storing the estimated inter-contact delays in the matrix M(k+1)(i,j) and the list of the corresponding relays Vi(d)k+1, (M(k+1)(i,j), Vi(d)k+1), where Vi(d)k+1) corresponds to the list of the relay nodes considered at the node i when a message must be transmitted to the destination d, for a number of relays k+1.

Abstract: The transmission method according to the invention includes transmitting a message from a source transmitting node to a final receiving node through a series of hops from a transmitter node to an immediately following receiver node, using: a) a reliability management mechanism including applying a retransmission law of the message on the hop, from the transmitting node to the receiving node, said law including message non-retransmission rules leading to the non-retransmission of the message, b) a mechanism for managing congestion of the nodes providing for a limitation of the throughput (A) for sending from a transmitting node to a receiving node following congestion information from the receiving node sent to the transmitting node, said mechanism being applied only hop-by-hop, the congestion information only being transmitted from a receiving node to a transmitting node over a same hop to limit the throughput of only the transmitting node toward only the receiving node.

Abstract: The invention relates to a method for transmission of messages from a sender node to multiple destination nodes in a network in which: The same message is sent from the sender node to multiple destination nodes, and the destination node of a message returns an acknowledgment message to the sender node after receiving the message it comprises a step of the distribution, by the sender node, of the destination nodes into at least two groups of destination nodes according to a predetermined distribution criterion taking into account the to and fro travel time between the sending of the message and the receiving of the acknowledgment message from the destination node, and a step of sending of messages to destination nodes in the same group with a latency period between the sending of two successive messages to the same destination nodes of the same group, the latency periods, each specific to a group and defining the throughput rate of the group being different from one group to another.

Abstract: Method for disseminating messages or information content in a hybrid network including a network scaffold comprising pilot entities, and a mobile network including mobile nodes communicating in an “ad hoc” manner with one another, the method including: at the level of each of the pilot entities of the scaffold of the network, scheduling the transfers of at least one message by: let SC(t) be the set of mobile nodes that have subscribed to the content of type C, let Mi be a message corresponding to the content of type C, for each message Mi, if a mobile user node Ui is present in the neighborhood of a pilot entity, then if Ui is subscribed to the content of type Mi, transfer the message Mi to the mobile user Ui, execute a control loop to disseminate the messages to all the mobile nodes that have subscribed to the receipt of a content Mi as a function of the progress of this dissemination so as to comply with timescales required for the distribution of said message.

Abstract: Allocation of communications resources, in a mobile meshed network structured as a plurality of clusters each comprising at least one node, includes: generating a chart of configurations each comprising a different allocation priority index for each time slot of the time window, the indices varying from 0 to n?1; assigning a configuration,—among the generated set of configurations, to each cluster such that a predetermined number Np of priority indices are not assigned to the same slots for the clusters which are mutually adjacent; and allocating the time slots to the intra cluster communications in the order of priorities which are defined in the configuration assigned to the cluster, the priority index associated with a slot increasing with the order of allotting of a slot to a new communication, a new slot being allotted only if all the slots whose priority index is smaller are already allocated to a communication.

Abstract: Device and method for transporting data streams in a network including several nodes in a given configuration at a given instant. The device includes a database storing the message(s) to be transmitted; a congestion control module connected to the database; a scheduler having as inputs the messages stored in the database, the route determined for a message by a routing table and a neighboring node table and information coming from a receiving module; a module comprising an opportunistic transport protocol receiving information from the scheduler and from a measurement module, the opportunistic transport protocol being designed to split a message to be transmitted into N packets Pi, and transmitting said packets to the network layer of the node; and a module designed to decide if the current node is capable of accepting an incoming handover of a message.

Abstract: System enabling the dynamic deployment and/or the creation of tasks within a network comprising at least one master node (0) and several sensor nodes Ni having limited processing capacities, the network supporting a communications software application exposing the functionalities of each sensor node as services on the said network and a mediation mechanism allowing communications between the services of various sensor nodes of the said network to be established characterized in that it comprises at least the following elements: At a low-capacity node Ni of the network: A task or processing operations deployment manager (40), A storage module (41) for the said tasks received via a deployment manager for the tasks (40), A processor module (43) for the said tasks, the said module using basic operations (44) present in the said node, An interface with local sensors (45), A service oriented network communications module (47), A global mediation module (46), the said various sensor nodes within the said network

Abstract: A routing method in a network with intermittent connectivity, characterized in that it includes, to determine the routing information, for an opportunistically defined routing, for a network comprising a number n of nodes, kmax being the maximum number of relays to be considered in the routing, and M1, a matrix of size n×n, iterative steps of estimating the delay with (k+1) hops and the list of corresponding relays from <?ij> matrix of the inverses of the average inter-contact times and of the estimates of delays with k hops present in Mk, storing the estimated inter-contact delays in the matrix M(k+1)(i,j) and the list of the corresponding relays Vi(d)k+1, (M(k+1)(i,j), Vi(d)k+1), where Vi(d)k+1) corresponds to the list of the relay nodes considered at the node i when a message must be transmitted to the destination d, for a number of relays k+1.