MULTI-HOP ROUTING PROTOCOL

• US 20140233398A1
• Filed: 09/25/2012
• Published: 08/21/2014
• Est. Priority Date: 09/30/2011
• Status: Abandoned Application

• Current Assignee: L'Institut National Des Sciences Appliques (Insa), Orange S.A.
• Original Assignee: Orange S.A.
• Inventors: Kountouris, Apostolos, Valois, Fabrice, Erdene-Ochir, Ochikhand, Minier, Marine
• Application Number:
  US14/348,586
• Publication Number:
  US 20140233398A1
• Time in Patent Office: Days
• US Class Current: 370/242
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04W 12/12 Detection or prevention of fraud
• CPC Class Codes: H04W 12/63 Location-dependent; Proximity-dependent
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• CPC Class Codes: H04W 40/246 Connectivity information discovery

Abstract

Disclosed is a method for calculating a route for a transfer of data between a source node and a destination node via at least one intermediate node in a network comprising a plurality of nodes, which, for a current node of said route, comprises a set of nodes adjacent to said current node. The method is suitable for selecting a selection law from a set of selection laws and for choosing an intermediate node according to the current node, by applying the selected law to all or a portion of the nodes of the predetermined set for the current node. Also disclosed is a node-forming device which implements the route calculation method.

Claims

1. A method for calculating a route for a transfer of data between a source node and a destination node D in a network comprising a plurality of nodes, the method comprising, for a current node of said route, a step of determining from among the plurality of nodes a set of neighbor nodes of said current node,

wherein the method further comprises:

selecting a selection law from among a set of selection laws; and

choosing a node following said current node in said route by applying the selected law to all or some of the nodes of the set determined for said current node.

2. The method for calculating a route as claimed in claim 1, wherein the selection law is selected in a random manner.

3. The method for calculating a route as claimed in claim 1, wherein the set of laws comprises at least one random selection law and at least one deterministic selection law.

4. The method for calculating a route as claimed in claim 1, wherein the selection law is selected as a function of at least one value representative of the probability of presence of a malicious node in said set.

5. The method for calculating a route as claimed in claim 1, wherein the method further comprises:

determining a first and a second subset of nodes, said first subset consisting of nodes of said set and the second subset consisting of nodes of said first subset,

verifying a first confidence criterion relating to said first subset;

wherein the selected law is applied to said first subset or to said second subset as a function of the result of the verification of the first confidence criterion.

6. The method for calculating a route as claimed in claim 5, wherein the first confidence criterion is satisfied if the absolute value of the difference between on the one hand a median distance between the nodes of said first subset and the destination node and on the other hand a mean distance between said nodes of said first subset and the destination node is greater than a predetermined threshold value.

7. The method for calculating a route as claimed in claim 1, wherein the method further comprises:

determining a first and a second subset of nodes, said first subset consisting of nodes of said set and the second subset consisting of nodes of said first subset,

verifying a second confidence criterion relating to a said subset;

wherein the law is selected as a function of the result of the verification of a second confidence criterion.

8. The method for calculating a route as claimed in claim 7, wherein the selected law is weighted by at least one weighting coefficient if the second confidence criterion is satisfied and the selected law is equiprobable if said second criterion is not satisfied.

9. A device forming a node of a network comprising a plurality of nodes, comprising a component configured to determine a set of neighbor nodes of said node from among the plurality of nodes, wherein the device comprises:

a component configured to select a selection law from among a set of selection laws;

a component configured to choose a node following said node in a route by applying the selected law to all or some of the nodes of the set determined for said node.

10. A sensor able to collect data and to retransmit them to a collection device wherein the sensor comprises a device as claimed in claim 9.