US9392482B2 - Method for optimizing the capabilities of an ad hoc telecommunication network - Google Patents

Method for optimizing the capabilities of an ad hoc telecommunication network Download PDF

Info

Publication number
US9392482B2
US9392482B2 US14/110,421 US201214110421A US9392482B2 US 9392482 B2 US9392482 B2 US 9392482B2 US 201214110421 A US201214110421 A US 201214110421A US 9392482 B2 US9392482 B2 US 9392482B2
Authority
US
United States
Prior art keywords
nodes
node
flows
network
flow
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US14/110,421
Other languages
English (en)
Other versions
US20140293787A1 (en
Inventor
Michel BOURDELLES
Stéphane Pega
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Thales SA
Original Assignee
Thales SA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Thales SA filed Critical Thales SA
Assigned to THALES reassignment THALES ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: Bourdelles, Michel, PEGA, STEPHANE
Publication of US20140293787A1 publication Critical patent/US20140293787A1/en
Application granted granted Critical
Publication of US9392482B2 publication Critical patent/US9392482B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15521—Ground-based stations combining by calculations packets received from different stations before transmitting the combined packets as part of network coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/38—Flow based routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the invention relates to a method for optimizing the adaptation of communication routes in a telecommunications network consisting of wireless communication nodes, with transfer of information between nodes by relays.
  • This optimization notably enables the communications capabilities to be increased within a self-organized MANET-type network (“Mobile Ad Hoc Network”) which is present notably in radio networks. It involves data rate optimization by reduction of the number of stream packets sent, without any increase in the data size of these packets.
  • the proposed method makes it possible to identify route modifications for existing flows to be applied in order to perform optimizations by network coding. It can also be used for networks having a mobile node infrastructure.
  • the technical problem posed in the present invention is the problem encountered in the use/adaptation of the network coding in ad hoc network topologies, on multi-flows with a routing modification for existing flows, these flows establishing themselves in a temporally synchronized or non-synchronized manner.
  • FIG. 1 presents an example of routing without use of optimization by network coding in the same butterfly topology as that of FIG. 2 .
  • the flow X 1 transits by means of the transmissions of tagged packets 1 , 2 , 3
  • the flow X 2 transits by means of the transmissions of tagged packets 4 , 5 , 6 .
  • the example given in FIG. 2 makes it possible, by transmitting the combination of a flow X 1 and of a flow X 2 transmitted respectively by two different sources, to reduce the number of packets to be relayed.
  • the source nodes S 1 and S 2 communicate data to the destination nodes D and F, either directly for the communication from S 1 to D and S 2 to F, or using the links C and E as relays for the communications from S 1 to F and S 2 to D.
  • the general principle of network coding consists in linearly combining the stream packets relayed by C and E, in order to reduce the communication data rate on these nodes.
  • the linear combination proposed in the example in FIG. 2 is achieved by application of the bitwise XOR binary function, leading to Nc(X 1 , X 2 ), and thus without increasing the size of the packets transmitted, knowing that each of the nodes D and F have already received the data directly, from the flows X 1 and X 2 respectively. These nodes will therefore be able to extract the information from these flows X 1 and X 2 respectively.
  • the communication is achieved by broadcast. Sending the same packet to several neighbors has the same data rate cost as sending to a single neighbor.
  • One of the aims of the method according to the invention is to propose a protocol which makes it possible to determine the best routes for transmissions of data flows in various topological situations in a communications network.
  • Patent application EP 2 141 865 discloses a method making it possible to combine routing with network coding.
  • the method consists in counting the number of links shared with other flows by enriching the route request information RREQ with reactive routing.
  • RREQ route request information
  • the method according to the invention transfers the information for making decisions about network coding and re-routing of existing flows to origin nodes for these streams, allowing the application of network coding, for example of Networkcoding type, by way of illustration and in by no means limiting fashion.
  • the principle implemented consists notably in mixing the network coding and ad hoc network routing approaches in order to adapt the choice of routing according to the potential for gains by using network coding, by identifying topological situations where it can be used.
  • the invention relates to a method for optimizing the adaptation of communication routes in a wireless network consisting of communication nodes, said network comprising several nodes Ni, the transmission of stream data being carried out in the form of flows Xi and between at least two source nodes Ns and at least two destination nodes Nd, having at least the following steps:
  • a message Mtopo contains, for example, at least the following elements:
  • the collected information contains, for example, at least the following elements:
  • said method has, for example, a step involving storage of the packets transmitted for coding and decoding on the relay nodes.
  • the method has phases of storage, coding and decoding of stream packets on a network topology of bidirectional flows between 2 nodes of the network, during the setup of communications with optimization by network coding.
  • a source node or initial node S 2 for the flow X 2 can delegate its capability to annotate the list Lft of the flows crossed to another node.
  • a final or destination node F delegates, for example, to another node F 1 , from which several flows can transit, its capability to transmit messages.
  • the method has, for example, the possibility of choosing between several pivot paths by using a deterministic choice or by taking advantage of an opportunity in 2 pivot paths in order to transfer two flows.
  • a source node transmits resource allocation optimization directives to each of the nodes in the network.
  • the invention also relates to a network architecture making it possible to optimize the adaptation of communication routes in a network consisting of wireless communication nodes, said network implementing a routing algorithm, said network comprising several nodes Ni, the transmission of data being carried out between at least two source nodes Ns and at least two destination nodes Nd, said nodes Ns, Nd, Ni having access to means for sending and receiving and means for processing the information implementing the steps of the method described above.
  • FIG. 1 shows an example of routing according to the prior art
  • FIG. 2 shows an example of implementation of network coding according to the prior art
  • FIG. 3 presents a network having the same connection topology as that in FIG. 1 , in which the flow X 1 is established with a route (S1-D-E-F) without different network coding but with the same cost as the tree of routes in FIG. 1 (S1-C-E; E-D; E-F) from the node S 1 to the destination nodes D and F, the node S 2 wishing to establish a flow X 2 to the destination nodes D and F,
  • FIG. 4 shows a representation of the first step according to the invention
  • FIG. 5 shows a representation of the second step of the method
  • FIG. 6 shows a representation of the third step of the method
  • FIG. 7 shows a representation of the fourth step of the method
  • FIG. 8 shows a representation of the fifth step of the method
  • FIG. 9 presents a so-called bidirectional stream topology, with routing of the streams without network coding
  • FIG. 10 presents the topology in FIG. 9 , with application of the optimization by network coding
  • FIGS. 11 a , 11 b and 11 c present the steps of the protocol in order to transmit to the origin nodes the information making it possible to decide if optimization by network coding is applicable,
  • FIGS. 12, 13 and 14 describe the establishment of network coding with storage of data packets on the relay nodes in a bidirectional stream topology
  • FIG. 15 presents a topology in which 2 paths for network coding optimization are possible
  • FIG. 16 illustrates the concept of final node by delegation
  • FIG. 17 illustrates the concept of initial node by delegation.
  • FIG. 3 is a first representation of an ad hoc network in which a first established flow X 1 , shown in solid lines, which circulates from a first source node S 1 to a destination node D, then goes to a second destination node F via an intermediate node E.
  • the problem that occurs is that of optimizing the choice of routes when there is another flow request shown in FIG. 3 by a second flow X 2 in dashed lines, initiated by a second source node S 2 to the destination nodes D and F, in order to obtain the optimized situation in FIG. 2 .
  • a destination node Nd has means for decoding the coded flows it receives, as well as the pivot nodes of so-called bidirectional flows.
  • An intermediate node when it will be denoted pivot node, will have means for coding the information.
  • Step 1 Detection of the Distance of an Origin Node in a Broadcast-Type Traversal— FIG. 4
  • FIG. 4 shows the implementation of the first step of the method according to the invention by considering two established flows X 1 and X 2 .
  • the source nodes broadcast the flows to all the nodes in the network using the flooding technique, for example.
  • the flooding technique for example.
  • a Dijkstra-type algorithm [described by way of example in the article Numewitz Mathematik 1, 269-271-1959 ⁇ A note on two problems in connexion with graphs>> by E. W. Dijkstra, published] which can be limited to a number expressed by a number of “hops” via relay nodes.
  • the technique of routing by flooding is based on a simple principle consisting in each node retransmitting the received packet on all the exit paths from the node, except for the arrival path.
  • This step is also performed by the routing protocols (notably AODV) during the search for a route.
  • each node Ni will store in a table Tf, for each path traversal Ci initiated by the source node Ns for each flow Xi coming from its neighbor nodes, the distance NN of the node Ni in relation to the source node and the identifier Id of the neighbor node as well as all the destination nodes for the flow.
  • the shortest distance value will be, for example, stored.
  • An optional timeout value TTL (time to live) can be transmitted in the traversal by flooding the flows, to delete the information after a timeout of TTL time units.
  • the part of the network comprises a first source node S 1 for the flow X 1 , and a second source node S 2 for the flow X 2 and a first destination node D and a second destination node F for the two flows X 1 and X 2 .
  • Node S 1 Flow X 2 2-C means that the node S 1 is at a distance of 2 hops from the source node for the Flow X 2 , and that the neighbor node enabling access to the initial node for this flow is node C.
  • This information (identifier of a node, distance from this node to the source node for a given flow), can be limited to storage of distances less than a limit by configuration of the flooding algorithm; in FIG. 4 , this value is 3. This configuration can depend on the characteristics of the flow in terms of compliance with Quality of Service constraints. This information is stored and kept with a given timeout in keeping with the execution time of the flow.
  • Step 2 ( FIGS. 5, 6 and 7 )
  • Each destination node for flows will, periodically or by user request, transmit messages Mtopo to each of the neighbors that are candidates to be relay nodes for several flows. These messages contain the flows that are able to transit through nodes. This information is obtained by making use of the information from the storage table Tf for the information collected in the preceding step. These messages are transferred to the other neighbor nodes present that are marked as preceding nodes for the flows, the nodes being identified by their unique identifier.
  • the collected elements are the distances of the paths Ld and of the paths Ldp that can be coded by network coding.
  • the latter can be enriched or replaced by other criteria (Quality of Service information known to those skilled in the art, for example),
  • the node E can wait for all the packets from the flows it has received before returning all the flows to the preceding node at the same time. For example, in FIG. 5 , the node E receives a message from D and a message from F.
  • E, S 1 receive from D two messages, a first message from D and a second message from F respectively:
  • the node receiving information can transmit them as they arrive.
  • the node E On receipt of the second received message, the node E transmits to the nodes associated with the flows in Tf (node C in the example) a message Mp with the information that E is pivot node Np.
  • the neighbor nodes not yet traversed for the signaling return if they are identified by the first initial step as preceding nodes for these flows, they are determined to be pivot nodes (Ld value incremented, number of nodes on the path for the flows from Lf with network coding) in the message transmitted via the node E to the node C.
  • FIGS. 6 and 7 schematically show the return of the information to the source nodes S 1 , S 2 .
  • a node is defined as pivot node if it receives from at least 2 different neighbors a message identifying it as being able to send several flows shared by these two neighbors. This information will be transmitted to all the nodes in the neighborhood.
  • the node E which receives information from the separate nodes D and F that it is able to send the two flows X 2 and X 1 on these nodes, is a pivot node Np for these two nodes. It is a node where either network coding of these flows can potentially be carried out, or a flow originating from the coding of these flows can be sent by this node.
  • Step 3 ( FIG. 6 )
  • the flow transmission messages received from a neighbor are transmitted to the other neighbors for which an association has been stored in the table Tf.
  • a node that has been determined to be a flow pivot returns this information in the message in the field Lp to each node contained in the list of one of these flows in the table Tf.
  • Each of the nodes No receiving the flows Xk will transmit to the neighbor nodes the information contained in the message Mtopo which is transmitted by mutual agreement by identifying the paths Ci on which network coding will potentially be able to be applied.
  • C receives C receives C receives from E: from S 1 : from S 2 Lf: X 1 , X 2 Lf: X 1 , X 2 Lf: X 2 Lf: X 1 Lp: void Lp: ⁇ X 1 , X 2 ⁇ Lp: void, Lp: void, FirstCod: void FirstCod: C FirstCod: void FirstCod: void Ld: 2 Ld: 2 Ld: 2 Ld: 2 Ldp: void Ldp: 2 Ldp: void Ldp: 2 Ldp: void Ldp: void Nd: D Nd: D, F Nd: D Nd: F Ln: D Nd: F Ln: E Ln: E Ln: S 1 Ln: S 2 Lft: void Lft: X 1 Lft: X 2
  • the second message transmitted from C via E results from the receipt of the two messages from D and F to E, which make it possible to determine at node E that it is pivot node for the streams X 1 and X 2 .
  • the identifiers corresponding to the nodes that have identified themselves as pivot nodes are returned to the source nodes Ns. These source nodes will alert the destination nodes of the receipt of this information using the routing protocol. Then the source nodes make the decision to effect a change of flows or of stream 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 transmission to the destination node.
  • S 1 (and S 2 ) can determine that C, E may potentially be pivot nodes for the flow X 1 (when they are initiated by S 1 ) and the flow X 2 (when they are initiated by S 2 ), since D and F are shared destinations for X 1 and X 2 and there is a separate path for S 1 (and S 2 ) accessing one of the destination nodes D (and F).
  • the decision to carry out network coding will be able to be taken by taking into account, for example, the constraint required for the stream (latency, resource allocation capability, stability of the links in the network).
  • a coding decision can potentially be made from the moment that, at a node, in the case where 2 flows are being managed, there are a path C 1 for routing the flow with a potential for network coding by one flow and a path C 2 for routing the flow with transfer of the flow from the origin node separate from the route C 2 .
  • the coding decision effective at the first pivot node will be made if the pivot node receives a request for coding via the two initial nodes.
  • the initial nodes have reciprocal knowledge of a path C 2 , via the information from the lists Lft (of the flows traversed, flows from the terminal node to the origin node in the path).
  • Step 5 ( FIG. 8 )
  • the fifth step relates to the application of the network coding on a shared path and the decoding of the information at the destination nodes, which will have received firstly an initial uncoded flow and secondly a coded flow comprising a coding of the set of at least two flows; in our example this corresponds to the flows X 1 and X 2 .
  • the latter stores this information in such a way as to code the packets of these 2 flows. It transmits the message MFlowEstab, assigning the value True to the field ApplyCoding.
  • S 1 and S 2 If the initial nodes for the streams (here S 1 and S 2 ) authorize the stream and the access through destination nodes by the initial nodes allows network decoding at the destination nodes, S 1 (or S 2 ) transmits to the node D (or F) the flow establishment information X 1 (or X 2 ) with decoding with the information transmitted by the node E.
  • the streams When the streams are established, for the nodes identified as first nodes on the path performing network coding between several flows, if the packets of a single flow are received, the latter are transmitted as they are. If the packets of several flows are received, the latter are transmitted coded by network coding; if one stream flow terminates, the packets of the other flow will be transmitted without coding.
  • the receipt of 2 flows is understood to be the receipt of packets from 2 flows in a time period, making it possible to then transmit the coded message of the 2 streams without distorting the real-time constraints associated with these flows.
  • the identifier of the flow or flows In the header of the data packet are indicated the identifier of the flow or flows, the identifiers of packets from the flows in the case where there are several flows, and the type of coding, when the latter is not known to the destination nodes.
  • Nodes other than the nodes initiating coding relay the packets without modifying their content.
  • the destination nodes decode the packets received from several paths.
  • X i P j denotes the packet j from the data flow X i .
  • Memo X i P j for a node NN denotes the storage of the packet j from the data flow X i in the node NN.
  • Suppress X i P j for a node NN denotes its deletion.
  • Decode X i P j denotes its decoding.
  • NC(X i P j , X k P l ) denotes the network coding of the flow data packet j from the data flow X i with the flow data packet I from the data flow X k .
  • the definition of the initial and final nodes is extended to the initial and final nodes of bidirectional flows, letter b in the figures; in this case the transmitted messages M incorporate the flows X 1 and X 2 into the list Lf.
  • the nodes A and F are considered to be initial and final nodes; in this case the transmitted messages MTopo incorporate X 1 and X 2 into the list Lf. These packets are transmitted from A to F and from F to A.
  • the relay nodes receiving packets from two separate nodes are pivot nodes for these two flows. These nodes exchanged from these 2 flows being bidirectional, the pivot nodes will code and decode the packets received as indicated in FIG. 10 .
  • Phase 1 applied to this topology makes it possible to store the information on each of the nodes as presented in FIG. 11 a .
  • the initial nodes A and F transmit the messages MTopo, indicating that it is a bidirectional flow (field LBidir to True for the flows ⁇ X 1 ,X 2 ⁇ in Lp.)
  • the relay nodes allocate memory in order to store the 2 preceding packets from the 2 flows.
  • messages MFlowEstab from the two flows code the received packets and transmit them. Subsequently, any node that receives an coded packet decodes it in order to have the value of the packets from the flows to be stored to replace the corresponding flow packet that has been stored for the longest amount of time. This phase is described in the example in FIG. 13 .
  • Each of the nodes defined as pivot store the last 2 packets received from the 2 flows.
  • the neighbor nodes of the initial nodes initiate the coding phase.
  • FIGS. 12 and 13 describe the initialization of the procedures of storage of the packets on the nodes and decoding from the nodes that are closest to the initial nodes for the streams.
  • each relay codes and decodes the received packets.
  • FIG. 15 illustrates the capability to choose between several pivot paths.
  • the first choice is the capability of deterministic choice of one of the two paths (for example based on a comparison order relation for the identifier of the first node, in the case where no other criterion such as the size of the pivot path, or a metric based on Quality of Service parameters, makes it possible to distinguish them.)
  • Another alternative is to take advantage of the opportunity in 2 pivot paths in order to transfer 2 flows (or to divide one flow into two) to fully use the network coding capabilities on the 2 flows.
  • FIGS. 16 and 17 illustrate the extension of the concept of initial and final nodes, as defined initially. These extensions in relation to the initial definition make it possible to extend the topological situations in which the invention can be applied.
  • FIG. 16 repeats the topology of FIGS. 4 to 8 used to illustrate the invention with the following modification: the initial node S 2 for the flow X 2 delegates the capability to annotate the list Lft to the node S 21 .
  • the distance to the initial node may be a criterion for choice of these nodes by delegation. This delegation of annotation of the list Lft makes it possible to extend the topologies in which the network coding can be applied.
  • FIG. 17 repeats the topology in FIGS. 4 to 8 used to illustrate the invention with the following modification: the final node F, which may be the destination for a single flow, delegates to a node F 1 , from which several flows can transit, the capability to transmit messages by delegation.
  • the protocol proposed by the invention makes it possible to predict the communications of several flows in a given topology, and thus the resource allocation needs in terms of data rate, passband, connectivity to be optimized etc.
  • the initial node can transmit directives to each of the nodes, so that they optimize their resource allocations.
  • topology does not make it possible to perform network coding, notably in the event of an absence of separate access paths to the destination nodes.
  • Other types of optimization can be applied, for example by concatenating several packets from several flows into one single flow.
  • the proposed protocol makes it possible to determine these situations, which is equivalent to determining the pivot paths.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Radio Relay Systems (AREA)
US14/110,421 2011-04-08 2012-04-10 Method for optimizing the capabilities of an ad hoc telecommunication network Expired - Fee Related US9392482B2 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
FR1101090 2011-04-08
FR1101090A FR2973981B1 (fr) 2011-04-08 2011-04-08 Procede pour optimiser les capacites d"un reseau de telecommunication de type ad-hoc
PCT/EP2012/056406 WO2012136840A1 (fr) 2011-04-08 2012-04-10 Procede pour optimiser les capacites d'un reseau de telecommunication de type ad- hoc

Publications (2)

Publication Number Publication Date
US20140293787A1 US20140293787A1 (en) 2014-10-02
US9392482B2 true US9392482B2 (en) 2016-07-12

Family

ID=44168326

Family Applications (1)

Application Number Title Priority Date Filing Date
US14/110,421 Expired - Fee Related US9392482B2 (en) 2011-04-08 2012-04-10 Method for optimizing the capabilities of an ad hoc telecommunication network

Country Status (4)

Country Link
US (1) US9392482B2 (fr)
EP (1) EP2695443B1 (fr)
FR (1) FR2973981B1 (fr)
WO (1) WO2012136840A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10517092B1 (en) 2018-06-04 2019-12-24 SparkMeter, Inc. Wireless mesh data network with increased transmission capacity
US11811642B2 (en) 2018-07-27 2023-11-07 GoTenna, Inc. Vine™: zero-control routing using data packet inspection for wireless mesh networks

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10230679B1 (en) 2011-08-22 2019-03-12 Star2Star Communications, LLC Systems and methods for optimizing application data delivery over third party networks
US9043453B1 (en) * 2011-08-22 2015-05-26 Star2Star Communications, LLC Systems and methods for optimizing application data delivery over third party networks
US10116709B1 (en) 2011-08-22 2018-10-30 Star2Star Communications, LLC Systems and methods for optimizing application data delivery over third party networks
US10027586B2 (en) * 2013-03-15 2018-07-17 Star2Star Communications, LLC Network address family translation method and system
US10462156B2 (en) * 2014-09-24 2019-10-29 Mcafee, Llc Determining a reputation of data using a data visa
FR3031857B1 (fr) * 2015-01-16 2017-01-27 Thales Sa Procede de collecte d'informations de routage dans un reseau ad-hoc et procede de selection de route a partir des informations collectees
US20170171344A1 (en) * 2015-12-15 2017-06-15 Le Holdings (Beijing) Co., Ltd. Scheduling method and server for content delivery network service node
US10177985B2 (en) 2016-04-25 2019-01-08 Google Llc Systems and methods for routing and topology management of computer networks with steerable beam antennas
US10263951B2 (en) * 2017-01-09 2019-04-16 Star2Star Communications, LLC Network address family translation method and system
US10374695B2 (en) 2017-05-26 2019-08-06 Loon Llc Temporospatial software-defined networking for NGSO satellite networks
US10581523B2 (en) 2017-04-26 2020-03-03 Loon Llc Temporospatial software-defined networking for NGSO satellite networks
US11218981B2 (en) * 2018-09-20 2022-01-04 Kabushiki Kaisha Toshiba Wireless mesh network and data transmission method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020122410A1 (en) * 2001-02-13 2002-09-05 Cybiko Inc. Method of wireless data exchange amongst devices of limited range
US20080170518A1 (en) * 2007-01-12 2008-07-17 Samsung Electronics Co., Ltd. Mobile ad-hoc network routing based upon hardware address
EP2141865A1 (fr) 2008-07-02 2010-01-06 Siemens Aktiengesellschaft Procédé pour déterminer un itinéraire pour la transmission d'une séquence de paquets de données et réseau maillé ad-hoc
US20150249587A1 (en) * 2012-09-20 2015-09-03 Ntt Docomo, Inc. Method and apparatus for topology and path verification in networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020122410A1 (en) * 2001-02-13 2002-09-05 Cybiko Inc. Method of wireless data exchange amongst devices of limited range
US20080170518A1 (en) * 2007-01-12 2008-07-17 Samsung Electronics Co., Ltd. Mobile ad-hoc network routing based upon hardware address
EP2141865A1 (fr) 2008-07-02 2010-01-06 Siemens Aktiengesellschaft Procédé pour déterminer un itinéraire pour la transmission d'une séquence de paquets de données et réseau maillé ad-hoc
US20150249587A1 (en) * 2012-09-20 2015-09-03 Ntt Docomo, Inc. Method and apparatus for topology and path verification in networks

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
E. W. Dijkstra, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik 1, 1959, pp. 269-271.
Kano S et al., "Route Switching Protocol for Network Coding in Ad Hoc Networks", Communications and Electronics (ICCE), 2010, Third International Conference on, Aug. 11, 2010, pp. 55-60, IEEE, Piscataway, NJ, USA.
Katti S et al., "XORs in the Air: Practical Wireless Network Coding", IEEE/ACM Transactions on Networking, Jun. 1, 2008, pp. 497-510, vol. 14, No. 3, IEEE/ACM, New York, NY, US.
Royer E M et al., "A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks", IEEE Personal Communications, Apr. 1, 1999, pp. 46-55, vol. 6, No. 2, IEEE Communications Society, US.
Song Han et al., "Coding-Aware Multi-path Routing in Multi-Hop Wireless Networks", Performance, Computing and Communications Conference, IEE International, Dec. 7, 2008, pp. 93-100, IEEE, Piscataway, NJ, USA.
Xin Wei et al., "Network Coding Aware Routing Protocol for Lossy Wirless Networks", Wireless Communications, Networking and Mobile Computing, 2009. WICOM '09. 5th International Conference on, Sep. 24, 2009, pp. 1-4, IEEE, Piscataway, NJ, USA.

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10517092B1 (en) 2018-06-04 2019-12-24 SparkMeter, Inc. Wireless mesh data network with increased transmission capacity
US11811642B2 (en) 2018-07-27 2023-11-07 GoTenna, Inc. Vine™: zero-control routing using data packet inspection for wireless mesh networks

Also Published As

Publication number Publication date
US20140293787A1 (en) 2014-10-02
EP2695443A1 (fr) 2014-02-12
FR2973981A1 (fr) 2012-10-12
EP2695443B1 (fr) 2017-10-18
WO2012136840A1 (fr) 2012-10-11
FR2973981B1 (fr) 2013-09-27

Similar Documents

Publication Publication Date Title
US9392482B2 (en) Method for optimizing the capabilities of an ad hoc telecommunication network
CN101124568B (zh) 通过计算机网络的单向链路路由isis流量的***和方法
Guo et al. Analysis of general network coding conditions and design of a free-ride-oriented routing metric
CN102377666B (zh) 具有平均速率和突发速率控制的基于泛洪的路由协议
AU2010202493B2 (en) Route selection in wireless networks
US20110305167A1 (en) Communication system, and method of collecting port information
US20080159144A1 (en) Quality of service aware routing over mobile ad hoc networks (manets)
WO2009043256A1 (fr) Procédé, système et dispositif d'obtention de trajets à commutation par étiquette
US9686733B2 (en) Communication method in a wireless telecommunications network, associated computer program and wireless communication node
US20110292940A1 (en) System and method for establishing a communication path using labels
US20110085546A1 (en) Method and devices for multicast distribution optimization
EP3200404A1 (fr) Procédé de routage à vecteur de distance à la demande dans un réseau centré sur le contenu
CN107846706A (zh) 一种拥塞避免的编码感知无线mesh网络多路径路由方法
CN110943918A (zh) 无中心多路并发传输***的组网方法
CN104883304A (zh) 用于部分纠缠量子对桥接通信网络的路由方法
US8018953B1 (en) Adaptive, deterministic ant routing approach for updating network routing information
CN100496023C (zh) 一种传输链路状态信息的方法
KR20070020531A (ko) 무선 메쉬 네트워크에서 홉 수와 대역폭에 기반한 라우팅기법
JP4951695B2 (ja) 無線ネットワークにおける経路選択
Jeong et al. A network coding-aware routing mechanism for time-sensitive data delivery in multi-hop wireless networks
JP4939579B2 (ja) 無線ネットワークにおける経路選択
Temar et al. A new way of achieving multi-path routing in wireless networks
KR101381807B1 (ko) 무선 애드혹 네트워크 시스템 및 다중 경로 설정 방법
US20240195727A1 (en) System and method for distance vector routing in partitioned networks
CN114268577B (zh) 网络连接的建立方法、装置、设备及存储介质

Legal Events

Date Code Title Description
AS Assignment

Owner name: THALES, FRANCE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BOURDELLES, MICHEL;PEGA, STEPHANE;REEL/FRAME:032230/0267

Effective date: 20140124

STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20200712