Abstract: A method, an apparatus and a non-transitory computer-readable storage medium for determining multiple disjoint constrained paths in a communications network are disclosed. The method includes selecting upper bounds QoS metrics for each path in a disjoint combination of paths having two or more disjoint paths between a source node and a destination node; determining a minimum-cost disjoint path combination, and a minimum-QoS metric disjoint path combination; computing a maximum QoS metric by summing the QoS metrics of each minimum-cost path in the minimum-cost disjoint path combination, and computing a minimum QoS metric by summing the QoS metrics of each minimum-QoS metric path in the minimum-QoS metric disjoint path combination.

Abstract: A method, an apparatus and a non-transitory computer-readable storage medium for determining multiple disjoint constrained paths in a communications network are disclosed. The method includes selecting upper bounds QoS metrics for each path in a disjoint combination of paths having two or more disjoint paths between a source node and a destination node; determining a minimum-cost disjoint path combination, and a minimum-QoS metric disjoint path combination; computing a maximum QoS metric by summing the QoS metrics of each minimum-cost path in the minimum-cost disjoint path combination, and computing a minimum QoS metric by summing the QoS metrics of each minimum-QoS metric path in the minimum-QoS metric disjoint path combination.

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: 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 method for configuring a network of deposited wireless sensors. In certain aspects, these methods include defining performance criteria forming constraints, with associated threshold values, and at least one performance criterion to be optimized, for at least one zone to be equipped with nodes, each performance criterion being defined by a model; defining for said or each zone; the allocation to said or each zone to be equipped, a number of nodes; applying an optimization process per zone on said or each zone; increasing the number of nodes or modifying the performance criteria defined in said or each zone where the performance criteria are not met and reproducing in these zones the optimization process per zone with the new number of nodes or the new performance criteria, and applying the configuration determined at each node in said or each zone.

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: The method for configuring a network of deposited wireless sensors. In certain aspects, these methods include defining performance criteria forming constraints, with associated threshold values, and at least one performance criterion to be optimized, for at least one zone to be equipped with nodes, each performance criterion being defined by a model; defining for said or each zone; the allocation to said or each zone to be equipped, a number of nodes; applying an optimization process per zone on said or each zone; increasing the number of nodes or modifying the performance criteria defined in said or each zone where the performance criteria are not met and reproducing in these zones the optimization process per zone with the new number of nodes or the new performance criteria, and applying the configuration determined at each node in said or each zone.

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.