Classifications

• • 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
• • 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
  • H04L45/123—Evaluation of link metrics
• • 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/302—Route determination based on requested QoS
• • 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/56—Routing software
  • H04L45/566—Routing instructions carried by the data packet, e.g. active networks
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/10—Flow control; Congestion control
• • 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
  • H04W8/00—Network data management
  • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
  • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
• • 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
  • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
• • 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

Definitions

• Ad hoc networks are communication networks, using the radio medium. They consist of mobile and / or fixed nodes having the property of constituting automatically and dynamically a network capable of conveying packets from one point of the network to another when a radio communication is established between a node and his neighbors.
• packets are transmitted directly between the source node and the destination node if the destination node is in the connectivity area of the source node or through neighboring intermediate nodes if the destination node is out of range of the source node.
• ad hoc networks enable the instant deployment of communication networks without pre-existing infrastructure or centralized management.
• the formation of the network is done dynamically, the set of management tasks being distributed among all the nodes of the network.
• ad hoc networks The main characteristic of ad hoc networks is that the nodes belonging to this network play, or can play, the role of routers. The nodes are therefore themselves responsible for establishing and maintaining network connectivity in a continuous manner. This is achieved through the use of specific routing protocols that allow the nodes to exchange routing information between neighboring nodes and calculate communication paths to all other nodes in the network. These routing protocols issue messages periodically to update the topology of the ad hoc network (i.e. to identify nodes and links between nodes).
• routing protocols There are two families of routing protocols: proactive protocols and reactive protocols.
• proactive protocols For the family of proactive protocols, each node has a vision over the entire network through a periodic exchange of routing tables. All paths are available directly through the routing table.
• paths are only available on demand. Indeed, if a path to a destination is not available via the routing table, it launches a path search request, the result of this query to retrieve a path, if there is one.
• OLSR Optimized Link State Routing
• FIG. 1 shows the components of the OLSR proactive routing protocol.
• two main components can be distinguished: a maintenance component of the topology 10 comprising a topology control module 11 in conjunction with a routing node selection module 12 and a path selection component 20 comprising a module or path calculation algorithm 21.
• the maintenance component of the topology 10 ensures, through a periodic exchange of control messages, the construction of the topology graph of the network which will subsequently be used for calculating the paths. This mechanism also minimizes the overhead in network traffic by using a mechanism for selecting the router nodes, called Multipoint Relay Nodes (MPRs).
• MPRs Multipoint Relay Nodes
• the path selection component 20 calculates, based on the information collected on the topology, the best routes between the nodes of the network using a path calculation algorithm on a graph (for example: Dijkstra algorithm), the criterion of choice. paths being the number of jumps.
• a path calculation algorithm on a graph for example: Dijkstra algorithm
• Ad-hoc proactive routing protocols have been designed with no explicit consideration of QoS for path computation.
• the number of jumps is generally the criterion adopted by these protocols. It is clear that such a criterion is inadequate for real-time applications such as videoconferencing or telephony.
• the path selection component 20 also comprises a quality of service metrics management module 22 associated with the path calculation algorithm.
• metrics are the metrics of delay, bandwidth, jitter, etc.
• Information about QoS metrics is injected into the topology graph. A new graph enriched by this quality of service information is therefore reconstructed and the computation of the paths is done taking these metrics into account.
• the decision concerning the choice of quality of service metrics which serves as a criterion for selecting paths, is programmed statically. As a result, it is impossible to change these criteria once the routing protocol is implemented.
• NP-Complete problem in theory of the complexity of the problems of decision in computer science (a problem is said NP-Complete if it is in the class of the problems of decision for which the answer yes can be decided by a non-deterministic algorithm in a polynomial time by relative to the size of the instance, and if any NP-Complete problem can be rewritten using a polynomial algorithm as an instance subset of this problem).
• Calculation approximation techniques exist, but they are limited to a predefined number of metrics and their implementation is otherwise static. Consequently, the same limitations as those mentioned in the first situation will be present.
• the present invention aims to remedy the aforementioned drawbacks and to propose a technical solution for adapting a particularly proactive routing protocol (such as OLSR) so as to allow a dynamic change and implementation of the quality of service metrics used to the calculation of paths in ad hoc networks, taking into account the characteristics of the network and / or the resources required for the applications used.
• OLSR a particularly proactive routing protocol
• This goal is achieved through a method of dynamically adapting the quality of service metric that includes the following steps: a) determining at least one quality of service metric to be applied at a given time based on the quality of service available on the network and / or on the quality of service required by one or more applications, b) transmitting to at least a portion of the network nodes of the instantaneous quality of service metrics to be applied, which includes the calculation modules and inserting quality of service metrics at the routing protocol control packet level, and c) updating the node routing table based on the instantaneous quality of service quality metrics to be applied received.
• this method makes it possible to dynamically apply, at the level of the routing protocol, the quality of service metric that best corresponds at the same time to the constraints of the environment (number of nodes, density, degree of mobility, etc.) and / or the state of the network (available resources and / or running applications).
• the implementation of the mechanisms described in the present invention makes it possible to respond effectively to the inherently dynamic behavior of the ad hoc networks.
• step a two alternatives are possible.
• each node analyzes the exchanges with its neighbors and decides by itself the choice of metrics, in the manner of self-organized networks.
• a network manager is used which supervises the state of the resources of each node and / or the resources requested by the current applications on the network. It decides and implements the necessary modules for the management of adequate quality of service metrics.
• step b) the quality of service metrics to be applied are inserted into control messages of the routing protocol.
• any new quality of service metrics to be applied is propagated in the network via generic control messages, the data relating to this metric being extracted at each node through a metric manager. This avoids having to rewrite the routing protocol at each change in quality of service metrics.
• step c) the computation of the path and the update of the routing table according to the quality of service metrics received can be done directly from the routing protocol calculation module or from the routing protocol module. a path calculation module external to the protocol. In the latter case, the method further comprises a dynamic deployment step, for example by downloading, a path calculation module. The module is then said to be re-programmable.
• the invention also relates to a computer program or software module for storage in or transmitted by a data carrier comprising software instructions for executing the method by a computing device.
• the data carrier may be a hardware storage medium, for example a CD-ROM, a magnetic diskette or a hard disk, or a transmissible medium such as an electrical signal, optical or radio.
• the invention also relates to a system for dynamic management of the quality of service metric in an ad hoc network, the system comprising a plurality of nodes for forming a routing infrastructure for the routing of data packets, characterized in that it further comprises a network manager for determining the quality of service metrics to be applied at a given time based on the quality of service available on the network and the quality of service requested by one or more applications, and means to broadcast the quality of service metric to be applied to the nodes of the network and that each node includes a metrics manager for updating the routing table of the nodes according to the quality of service quality metric to be applied received.
• the system of the invention comprises means to ensure the supervision (monitoring) of the network to have at all times a consistent view of its state, namely the rate of available resources and the resources required by applications that are running. From this data, the quality of service metric to be applied is determined and deployed at the routing protocol level through a periodic exchange of information concerning quality of service metrics between the nodes of the network. This periodic exchange is achieved by means of control messages of the routing protocol in which the metric to be taken into account.
• the network manager can be integrated with one or more nodes of the network, or be implemented in a specific mobile or wired terminal having a connection to the network.
• the computation of the routes at the nodes according to the broadcast quality of service metrics can be carried out by the path calculation module specific to the routing protocol or be managed externally by a re-programmable external module for calculating the routing.
• the subject of the invention is also a mobile or fixed terminal intended to form a node in an ad hoc network, characterized in that it comprises a metric manager for updating the routing table of said node as a function of a metric instant quality of service to apply.
• Such a terminal may also comprise means for periodically taking into account any change in quality of service metrics determined as a function of events occurring in the network and at the level of the applications.
• FIG. 1 schematically represents the components of the OLSR proactive routing protocol
• FIG. 2 represents an embodiment of an architecture according to the invention
• FIG. 3 illustrates an example of an ad hoc network topology used to test the method of the invention
• the present invention is intended to allow the extemalization of the management of quality of service metrics to the routing protocol in an ad hoc network and, moreover, the determination, the diffusion and the taking into account of any type of quality of service metrics.
• the invention proposes a technical solution that implements two main components, one at the network level (network manager) and the other at the node level (metric manager), as well as an extension of the Routing protocol control packets.
• the invention uses and adapts (ie addition of extension) a proactive routing protocol and in particular one of the most well-known proactive routing protocols; the OLSR protocol.
• This protocol is notably referenced and described under the name OLSR RFC3626 (Request for Comments) (see in particular the "Optimized Link State Routing Protocol (OLSR)", Network Working Group, T. Clausen et al., October 2003) of the Manet Working Group (for Mobile Ad hoc Networks) of the Internet Engineering Task Force (FIET).
• OLSR Optimized Link State Routing Protocol
• FIET Internet Engineering Task Force
• the present invention proposes to reuse the existing messages of the routing protocol and not to define new messages.
• the messages used are preferably messages exchanged periodically between the nodes of the network such as the Topology Control (TC) control messages in the OLSR protocol.
• TC Topology Control
• new messages can also be used for transporting quality of service metrics.
• generic control messages are used to carry any quality of service metrics as well as a processing function which constructs at each node a graph on the network topology; each element of the graph is represented by an n-tuplet of the form ⁇ source-address, destination-addresses, metric, metric2, ..., metric N>.
• This topology will be used later by the route calculation. Broadcasting any quality of service metrics to network nodes is done through such messages.
• a metric manager specific to the invention is connected to the routing protocol. More specifically, as illustrated in FIG. 2, a node 100 comprises a first layer 110 which, in a known manner, corresponds to the layer of the routing protocol 110 which notably uses a routing table 1121 and a path calculation module or algorithm 1122.
• the routing table 1121 is maintained (ie updated) locally in each node using the path calculation module 1122. It is the routing table that gives the address of the neighboring node to which it must be transmitted. the packets or the frame so that they reach their destination according to the defined quality of service metrics.
• a metric manager 111 is added to the layer 110 which transmits the metric (or the combination of metrics) to be applied to the network to the routing protocol 112.
• the path calculation is then carried out from this metric using a path search algorithm in a graph, such as, for example, the Dijkstra algorithm where the values (or weights) associated with the edges are then given by the values of the metrics selected.
• the metric manager is a component distributed to all nodes of the network. It implements, at the node level, the quality of service metric chosen by the network manager. For this purpose, the metric manager installs into a layer 120 the components 121 necessary for the insertion of the quality of service metric in the path calculation process.
• the metric manager 111 also makes it possible to indicate the existence of the external computation modules of path 131 to the routing protocol 112. The routing protocol can thus transfer to the external modules of path calculation a topological view of the network containing the metrics on which will carry the specific path calculation to the plugin.
• the routing protocol periodically sends a topology view to the modules concerned.
• quality of service metrics components which can be dynamically deployed or deployed on each node as it enters the network, are used by the metrics manager to adapt the value of the instantaneous metric for the direct neighborhood.
• the system of the invention comprises means for determining the quality of service metric (s) that must be taken into account by the nodes for the routing.
• the network manager 200 is an entity that can be integrated with one or more nodes of the network, or be implemented in a specific mobile or wired terminal having a connection to the network.
• a network manager 200 includes a quality of service metrics determination module 210 in connection with a supervision module 220 whose function is to supervise the state of the resources of the network vis-à-vis events that occur (disappearance / occurrence node, decrease / increase bandwidth capacity, power, etc.) and resources required by current applications.
• a supervision module 220 whose function is to supervise the state of the resources of the network vis-à-vis events that occur (disappearance / occurrence node, decrease / increase bandwidth capacity, power, etc.) and resources required by current applications.
• any new application must register with the network manager with its QoS requirement (eg an IP voice application registers with a maximum delay of 250 msec).
• the manager thus has a vision on all the application requirements.
• the information concerning the state of the network resources is reported to the module 220 through probes installed at each node (i.e. each user terminal).
• An information exchange rule base can be defined at the supervision module level to enable it to process the events being reported.
• the determination module 210 integrates the decision logic of the metric to be applied in the network according to the state of the resources of the network and / or the requirements of the applications indicated by the supervision module 220. Indeed, on receipt of a new notification of the supervision module, the determination module is invoked, and quality of service metrics to be deployed will be determined.
• the QoS metrics decision once taken, will be communicated by the network manager to the metrics managers of all nodes in the network for implementation.
• an exchange protocol ensuring the transmission of configuration orders from the network manager to the metric manager is defined. This exchange is done through mechanisms of reliable and atomic transmission. This protocol includes the following functions:
• - DeployerMetriqueQoS (metric): it makes it possible to deploy a quality of service (QoS) metrics given on the network, namely the modules of calculation and insertion at the level of the control packets.
• QoS quality of service
• tolerance thresholds can be fixed at the level of the nodes of the network (minimum energy level, level maximum charge, etc.).
• the existing routing protocol 112 uses the module path calculation 131 instead of its internal module 1122.
• the routing protocol 112 transmits to the module 131 the topology graph enriched by the quality of service information provided by the metrics calculation module 132 at each node.
• Applications must be modified to take into account this new module, which can be either specific to each application or shared by several applications.
• the module is transparent to the application since the result of the calculation of metrics is reinjected into the routing protocol with which the application communicates. In both cases, this new route calculation does not impose or very little modification on the initial routing protocol.
• this plug-in is re-programmable at any time, which allows it to integrate new metrics dynamically on initiative of the metrics manager. External management of service quality and calculation metrics is achieved. path. This makes it possible to manage the routing topology with QoS metrics at the application level so that they can apply the most optimal path calculation to their service quality requirements.
• FIG. 2 the interactions between the components of FIG. 2 are first described by a fictitious example.
• a second example is then described which illustrates a possible implementation of the present invention.
• the topology discovery protocol included in the routing protocol 130 does not include any specific quality of service metrics.
• VoIP Voice over IP
• CBR constant bit rate
• a new metric must be exchanged between the nodes and a specific path calculation based on this metric set up to define an optimized path for the VoIP application.
• a first step is to choose the metric available in the network that is closest to that expected by the application. This can be for example jitter, delay or default the number of jumps.
• This decision may be local to the node that will propagate it to the other nodes (according to the well-known approach of "self-organized" networks) or global by the network manager 200 which will transmit it to the nodes via a control message specific as previously described.
• the external computation module 131 associated with the chosen metric for example the delay, is then activated on each node or possibly deployed dynamically from the network manager.
• the chosen metric here the delay, is then also added in the control messages exchanged between the nodes by the routing protocol to discover and maintain the topology.
• the VoIP application tries to establish a call, it invokes the external path computation module specific to the chosen metric, in this case the delay. This module can be present on all nodes or dynamically deployed.
• This module retrieves from the routing protocol the topology graph having the delay metric (the metric information is computed by the metric calculation module at each node and carried by the routing protocol control packets) .
• the other applications use the default path calculation module, namely the number of jumps.
• the VoIP application then has routes adapted to its delay constraint, while other applications have paths that may be shorter but may also be more loaded. This is not a problem for example for a data exchange application.
• FIG. 3 presents an example of an ad hoc network topology with a configuration that makes it possible to show the limitations of the current solutions based on fixed metrics and the advantages of the invention in terms of dynamic adaptation to changes in quality of service conditions in the network environment (network state and applications).
• the network illustrated in FIG. 3 presents an example of an ad hoc network topology with a configuration that makes it possible to show the limitations of the current solutions based on fixed metrics and the advantages of the invention in terms of dynamic adaptation to changes in quality of service conditions in the network environment (network state and applications).
• 3 comprises seven nodes formed by seven terminals of two types: three high-capacity terminals (PC computers) Tm, T H2 and T H3 , on the one hand, forming a first route R1 and on the other hand , four terminals with low capacity (PDA assistant) Ts, TFi, TF 2 , T D , terminals TFi and TF 2 forming a second route R2 between a source node and a destination node respectively formed by the terminals T s and T 0 .
• PC computers three high-capacity terminals (PC computers) Tm, T H2 and T H3 , on the one hand, forming a first route R1 and on the other hand , four terminals with low capacity (PDA assistant) Ts, TFi, TF 2 , T D , terminals TFi and TF 2 forming a second route R2 between a source node and a destination node respectively formed by the terminals T s and T 0 .
• PDA assistant terminals with low capacity
• All nodes use 802.11b wireless interfaces with a bit rate of 11 Mb / s.
• the Rl route is made up of three PCs, which promotes better routing if the "delay" metric is used while the R2 route consisting of two PDAs helps a routing based on the "bandwidth” metric.
• metric default metric of applications. / * same metric for all applications * /
• This data makes it possible to choose the metric to be applied in the network according to the rules defined in the network manager. Depending on the decision, the data will be routed either via route Rl (metric delay) or route R2 (metric bandwidth).
• the following table shows the behavior of the approach according to the invention. Specifically, it describes the metrics to be applied in the network based on events that arise in the network.
• the application of the bandwidth metric makes it possible to obtain good performance at the bandwidth level, to the detriment of the delay which increases very significantly. This is advantageous for applications that require significant bandwidth, however time-sensitive applications are heavily penalized.
• the delay metric the delay is lower but the bandwidth is lower than that obtained with the metric of the bandwidth.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Databases & Information Systems (AREA)
• Mobile Radio Communication Systems (AREA)
• Data Exchanges In Wide-Area Networks (AREA)
• Small-Scale Networks (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=34952869

Family Applications (1)

Country Status (5)

Families Citing this family (19)

Family Cites Families (10)

• 2004
  • 2004-12-01 FR FR0412733A patent/FR2878674A1/fr active Pending
• 2005
  • 2005-11-30 US US11/792,016 patent/US20090122748A1/en not_active Abandoned
  • 2005-11-30 WO PCT/FR2005/051010 patent/WO2006059040A1/fr active Application Filing
  • 2005-11-30 EP EP05818916A patent/EP1817880A1/de not_active Withdrawn
  • 2005-11-30 CN CN2005800414434A patent/CN101069392B/zh not_active Expired - Fee Related

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events