EP1999900A1 - Procédé pour déterminer une voie dans un réseau ainsi qu'une valeur qualitative de la voie - Google Patents

Procédé pour déterminer une voie dans un réseau ainsi qu'une valeur qualitative de la voie

Info

Publication number
EP1999900A1
EP1999900A1 EP07704187A EP07704187A EP1999900A1 EP 1999900 A1 EP1999900 A1 EP 1999900A1 EP 07704187 A EP07704187 A EP 07704187A EP 07704187 A EP07704187 A EP 07704187A EP 1999900 A1 EP1999900 A1 EP 1999900A1
Authority
EP
European Patent Office
Prior art keywords
path
routing
network node
network
data packet
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.)
Withdrawn
Application number
EP07704187A
Other languages
German (de)
English (en)
Inventor
Matthias Kutschenreuter
Christian SCHWINGENSCHLÖGL
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.)
Siemens AG
Original Assignee
Siemens AG
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 Siemens AG filed Critical Siemens AG
Publication of EP1999900A1 publication Critical patent/EP1999900A1/fr
Withdrawn legal-status Critical Current

Links

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
    • 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/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/26—Route discovery packet
    • 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
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • 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/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing

Definitions

  • the invention relates to a method for determining a path in a network and a quality value for the path as well as a network node.
  • a network allows the transmission of messages between its network nodes. In a network, however, not all network nodes of the network are directly connected to all other network nodes. Therefore, a message from a sending network node to a receiving network node must, in most cases, be forwarded through one or more intermediate nodes in order to get from the sending network node to the receiving network node.
  • the path from the sending network node via the intermediate nodes to the receiving network node is referred to as path or route.
  • a routing method is used in conjunction with a routing metric.
  • the routing method first determines at least one, but expediently a plurality of path candidates along which the message could be transmitted.
  • the routing metric assigns the path candidates a path distance value, a so-called route metric.
  • the path distance value is data a measure of the quality of a Pfadkandi ⁇ .
  • the path distance value in turn can be determined, for example, from link distance values, which in turn are a measure of the quality of individual links of the respective path candidate.
  • the link here is the direct connection of two network node of the network.
  • a known routing method is, for example, AODV (ad hoc on demand distance vector).
  • path distance value for example, use costs for a link of the path and / or the number of links of a path can be included. Furthermore, it is possible that additionally or alternatively, values for a transmission quality along the path candidate or a link of the path candidate and / or values for the transmission speed of the path candidate or a link of the path candidate are received. The path candidate with the optimal path distance value is selected as the path in the sequence. The message can now be transmitted along this path.
  • routing metrics The methods for determining the path distance value are referred to as routing metrics.
  • a known routing metric is ETX (Expected Transmission Count). With the routing metric ETX one path is selected in which the number is expected to ⁇ transmissions at the lowest. Under both transmissions Warübertragungen (transmission) and repeated transmissions (retransmission) are hereby hen ⁇ To Hide. A first transmission is the transmission of a packet via a link. A repeated transmission takes place if the first transmission was unsuccessful.
  • ETX uses data packet arrival rates, which are determined by the two network nodes belonging to the respective link.
  • metric messages so-called beacons, are sent out at regular intervals.
  • the object underlying the invention is to provide a ver ⁇ improved method for determining a path in a network and a quality value for the path and a Specify a network node that requires a smaller number of messages for its implementation or for its operation.
  • the inventive method for determining a path in a network and a quality value for the path comprising to a routing method for the determination of the path and a routing metric for determining the quality value-nodes as part of the routing method of at least one network ⁇ of Network routing test messages, in particular so-called routing helios, sent in a definable time interval. Furthermore, in order to determine the quality value of the path, a determination of at least one data packet arrival rate for at least one link of the path is carried out and the data packet arrival rate is determined based on at least one of the routing test messages.
  • the routing test messages can be, for example, so-called AODV hellos. For example, they may be used to discover or announce to neighboring network nodes.
  • the data packet arrival rate indicates essentially achieved with wel ⁇ cher probability a packet its destination.
  • the data packet arrival rate may, for example, be the quotient of a number of routing test messages received within a time period for routing test messages actually sent within the time period.
  • the procedure makes the transmission of beacon
  • the load on the network with messages is reduced.
  • the network node is designed to carry out a
  • Method for determining a path in a network by means of a routing method and a quality value for the path by means of a routing metric has a transmitting / receiving device for receiving routing test messages of the routing method and a processing device.
  • the processing device is configured in such a way that a determination of at least one data packet arrival rate for a link between the network node and the further network node is carried out to determine the quality value based on at least one routing test message originating from a further network node.
  • routing test messages are sent by the network node at a definable time interval.
  • the network has network nodes according to the invention.
  • Figure 1 shows a network section
  • FIG. 1 shows an exemplary network section, consisting of a first to fifth network node K1. Furthermore, FIG. 1 shows a first link L1 between the first network node K1 and the second network node K2, a second link L2 between the second network node K2 and the third network node K3 and a third link L3 between the third network node K3 and the fourth network node K4.
  • the three links L1 ... 3 form a path from the first network node K1 to the fourth network node K4.
  • the links Ll ... 3 shown as arrows indicate the respective transmission direction used for the path.
  • To the delegation ⁇ are supply devices from the first network node Kl to the second network node K2 for the first link Ll, from the second network node K2 for the third network node K3 of the second link L2 and the third network node K3 to the fourth network node K4 for the third link L3.
  • the AODV (ad hoc on-demand distance vector) routing protocol is used as a basis.
  • AODV provides that the network nodes kl ... 5 at regular intervals, here 1 second, so-called Hello messages send.
  • the data packet arrival rates for the two directions of transmission may differ.
  • the values for this, which should be 80% for the first link L1, 90% for the second link L2 and 70% for the third link L3, are referred to below as data packet arrival rates in the other transmission direction.
  • the first network node K1 intends to send a message to the fourth network node K4. It is assumed that the first network node K1 does not yet know the path to the fourth network node K4 and therefore has to determine it. For this purpose, RREQ messages are sent, which reach the fourth network node K4 via the second and third network nodes K2, K3. This in turn responds with an RREP message which is returned to the first network node K1.
  • the data packet arrival rates for the three links Ll ... 3 with the RREP- message now gen to the first network node Kl intimidtra ⁇ can be a route metric determined from the Sun co-transmitted data packet arrival rates for the path and if he has determined other paths to the fourth network node K4, select a suitable path.
  • the determination of the route metric can be carried out, for example, by one of the following formulas:
  • R 3.7.
  • the path with the largest route metric is the optimal path.
  • the path with the lowest route metric is the best path.
  • a second embodiment of the invention results when the link metrics are already propagated with the RREQ messages.
  • the fourth network node K4 can already decide on the path to be used based on the link metrics transmitted with the RREQ messages.
  • RREQ messages unlike RREP messages, are broadcast.
  • the ⁇ be indicated that each sending network node Kl ... 5 is not known which one or ones of the other network nodes Kl ... 5 will receive the RREQ message. This means that the link metric for a link bridged by the RREQ message can only be specified by the network node receiving this RREQ message.
  • the network nodes Kl ... 5 in the beacon messages each transmit their respective data packet arrival rates to their neighboring network nodes Kl ... 5 so that each network node K1 ... 5 does not only provide the data packet arrival rates for a transmission direction the links to its neighbors, but for both transmission direction knows.
  • the network node Kl ... 5 is only aware of the respective data packet arrival rate in the direction of it.

Landscapes

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

Abstract

L'invention concerne un procédé de routage pour un réseau permettant de moins encombrer le réseau d'informations de routage. A cet effet, des informations Hello de routage sont utilisées de manière à calculer une métrique de liaisons. De ce fait, l'utilisation de balises de métrique peut être évitée.
EP07704187A 2006-03-30 2007-01-26 Procédé pour déterminer une voie dans un réseau ainsi qu'une valeur qualitative de la voie Withdrawn EP1999900A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102006014911A DE102006014911A1 (de) 2006-03-30 2006-03-30 Verfahren zur Ermittlung eines Pfades in einem Netzwerk und eines Qualitätswerts für den Pfad
PCT/EP2007/050798 WO2007113023A1 (fr) 2006-03-30 2007-01-26 Procédé pour déterminer une voie dans un réseau ainsi qu'une valeur qualitative de la voie

Publications (1)

Publication Number Publication Date
EP1999900A1 true EP1999900A1 (fr) 2008-12-10

Family

ID=37865862

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07704187A Withdrawn EP1999900A1 (fr) 2006-03-30 2007-01-26 Procédé pour déterminer une voie dans un réseau ainsi qu'une valeur qualitative de la voie

Country Status (5)

Country Link
US (1) US20090274055A1 (fr)
EP (1) EP1999900A1 (fr)
CN (2) CN101416454A (fr)
DE (1) DE102006014911A1 (fr)
WO (1) WO2007113023A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102007017515B3 (de) * 2007-04-13 2008-09-11 Siemens Ag Verfahren zur Ermittlung eines Pfaddistanzwertes sowie Netzwerkknoten
US8001365B2 (en) * 2007-12-13 2011-08-16 Telefonaktiebolaget L M Ericsson (Publ) Exchange of processing metric information between nodes
JP5228951B2 (ja) * 2009-01-30 2013-07-03 沖電気工業株式会社 パケット中継システム及び無線ノード
CN102036130B (zh) * 2009-09-24 2013-04-17 中国电信股份有限公司 为ason网络中电路寻找最优路径的一种量化方法
MX2014006020A (es) 2011-11-18 2015-01-12 Cooper Technologies Co Cálculo de costos de enlace en banda no instrusivo en redes de multisalto.

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6643706B1 (en) * 1999-06-29 2003-11-04 Cisco Technology, Inc. Scaleable route redistribution mechanism
KR100791802B1 (ko) * 2003-06-05 2008-01-04 메시네트웍스, 인코포레이티드 애드혹 무선통신 네트워크에서의 최적 라우팅
EP1631916A1 (fr) * 2003-06-06 2006-03-08 Meshnetworks, Inc. Procede permettant de mesurer la fiabilite de liaison vers un protocole de routage dans un reseau ad hoc sans fil
US7376122B2 (en) * 2004-02-23 2008-05-20 Microsoft Corporation System and method for link quality source routing
US7616575B2 (en) * 2004-06-23 2009-11-10 Microsoft Corporation System and method for link quality routing using a weighted cumulative expected transmission time metric

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2007113023A1 *

Also Published As

Publication number Publication date
CN101416454A (zh) 2009-04-22
WO2007113023A1 (fr) 2007-10-11
CN102739528A (zh) 2012-10-17
DE102006014911A1 (de) 2007-10-04
US20090274055A1 (en) 2009-11-05

Similar Documents

Publication Publication Date Title
DE602005000118T2 (de) Paketübertragungssystem, drahtlose Basisstation und Verfahren zur Routen-Optimierung für die Paketübertragung
DE60126963T2 (de) Kooperative diversität in einem selbstorganisierenden netz
DE69432883T2 (de) System und verfahren zur automatischen auflösung eines segments in einem localen netz
DE102007017515B3 (de) Verfahren zur Ermittlung eines Pfaddistanzwertes sowie Netzwerkknoten
DE102006041569A1 (de) Fahrzeug-zu-Fahrzeug-Kommunikation
EP1999900A1 (fr) Procédé pour déterminer une voie dans un réseau ainsi qu'une valeur qualitative de la voie
CH677300A5 (fr)
EP1999899B1 (fr) Procédé pour déterminer une valeur de distance d'une voie
DE202010018491U1 (de) System zur Identifizierung mehrerer Leitwege zwischen Netzwerkknoten
DE102020007525A1 (de) Verfahren zur Datenübertragung und technische Anlage
DE60307692T2 (de) Verfahren zur Beurteilung von Funkverbindungen in einem Kommunikationsnetz
DE112016007108B4 (de) Funkkommunikations-Endgerät, Funkkommunikationssystem und Leitwegprogramm
EP0915625A1 (fr) Point de transfert de signalisation d'un réseau de signalisation
EP1597864B1 (fr) Procede d'acheminement pour reseaux adhoc
DE10354943B4 (de) Verfahren zum Betrieb einer Kommunikationsstrecke zwischen zumindest zwei Kommunikatonsendgeräten
DE202006003832U1 (de) Vorrichtung zum Anfordern, Melden und Sammeln von zielknoten-basierten Messungen und leitweg-basierten Messungen
EP1421752A2 (fr) Procede pour conserver et/ou ameliorer la qualite d'un chemin de communication dans un systeme de relais
DE10317962A1 (de) Verfahren zur Anmeldung eines neuen Teilnehmers in einem Funksystem einer Gefahrenmeldeanlage
EP2008403A1 (fr) Procédé d'installation d'un système radio dans un édifice
WO2007113174A1 (fr) Procédé de routage
DE102016011182A1 (de) Drahtlosvorrichtung, Netzwerksystem und Steuerungsverfahren
DE102006045904B4 (de) Verfahren zum Bereitstellen einer Information über die erwartete Empfangsqualität bei einem mobilen Funkempfangsgerät
DE102006014311A1 (de) Verfahren zur Identifizierung von versteckten Knoten in einem ad-hoc-Netz
DE10318156B4 (de) Verfahren zur Bekanntgabe eines Gerätes in einem System
EP2494765A2 (fr) Procédé, dispositif et système d'utilisation commune de données de position dans des terminaux mobiles

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20080903

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

17Q First examination report despatched

Effective date: 20090604

APBK Appeal reference recorded

Free format text: ORIGINAL CODE: EPIDOSNREFNE

APBN Date of receipt of notice of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA2E

APBR Date of receipt of statement of grounds of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA3E

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE

DAX Request for extension of the european patent (deleted)
RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

APBT Appeal procedure closed

Free format text: ORIGINAL CODE: EPIDOSNNOA9E

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20140801

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Free format text: PREVIOUS MAIN CLASS: H04L0012560000

Ipc: H04L0012721000

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Free format text: PREVIOUS MAIN CLASS: H04L0012560000

Ipc: H04L0012721000

Effective date: 20150114