EP2119138A1 - Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants - Google Patents

Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants

Info

Publication number
EP2119138A1
EP2119138A1 EP07802943A EP07802943A EP2119138A1 EP 2119138 A1 EP2119138 A1 EP 2119138A1 EP 07802943 A EP07802943 A EP 07802943A EP 07802943 A EP07802943 A EP 07802943A EP 2119138 A1 EP2119138 A1 EP 2119138A1
Authority
EP
European Patent Office
Prior art keywords
network node
network
data
node
request message
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
EP07802943A
Other languages
German (de)
English (en)
Inventor
Michael Bahr
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.)
Unify GmbH and Co KG
Original Assignee
Siemens Enterprise Communications GmbH and Co KG
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 Enterprise Communications GmbH and Co KG filed Critical Siemens Enterprise Communications GmbH and Co KG
Priority to EP07802943A priority Critical patent/EP2119138A1/fr
Publication of EP2119138A1 publication Critical patent/EP2119138A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • 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
    • 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/48—Routing tree calculation
    • 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/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing

Definitions

  • a method of operating a wireless, meshed data network having a plurality of network nodes and network nodes
  • the invention relates to a method for operating a wireless mesh data network having a plurality of network nodes, between which at least partly consist Kommunikati ⁇ onstagenen, wherein at least some of the network nodes at least forward received data frames to a network node and wherein at least one of the network node as a predetermined, Data frame is formed of non-forwarding network node.
  • the invention further relates to a network node for operation in a wireless, meshed data network having a plurality of network nodes, between which at least partially communication links exist, wherein at least some of the network nodes forward received data frames to at least one of the network nodes.
  • the transfer of data frames between one, known as source node, network node and a designated as the destination node, network node can in wireless mesh data networks principally via different routes, also called Pfa ⁇ de or data paths, take place.
  • a route comprising a number of network nodes which are adjacent and arranged in a series with one another, which have a data or Kommunikati ⁇ onstress each other and enable a data connection between the source node and the destination node.
  • Pfa ⁇ de or data paths take place.
  • a route comprising a number of network nodes which are adjacent and arranged in a series with one another, which have a data or Kommunikati ⁇ onstress each other and enable a data connection between the source node and the destination node. In order not to leave the transmission of the data frames from the source node to the destination node to chance, is of the
  • Source node a so-called route request message (so-called route request or route request message) sent to all adjacent network nodes (so-called broadcast), which also forward the route request message in the context of a broadcast to the adjacent network nodes to the way - Request message finally reached the destination node.
  • the destination node initiates a route reply message (so-called route reply or route reply message).
  • route reply message In the transmission
  • routing tables In the route request message and in the purposeful return transmission of the way-response message (so-called unicast) to the source node, entries are created in so-called routing tables on each network node (so-called routing tables). This results in a defined path for the transmission of data frames between the source node and the destination node.
  • a path or data path (English: route) is meant the Sprinttra ⁇ gungsweg of data frames via one or more intermediate nodes as a designated network nodes between the source node and the destination node.
  • a non-forwarding network node in this case is a network node, which participates in the creation of the data path, but does not forward data frames to other network nodes of the data network. This means that a non-forwarding network node has only one endpoint, i. may represent a source node or a destination node of a data path of the wireless mesh data network.
  • Network nodes which do not support the forwarding of data frames which they have received from other network nodes, are reluctant to tolerate in a wireless, meshed data network because they do not cooperate and reduce the connectivity of the data network.
  • Routing protocols for wireless, meshed data networks usually assume that a network node forwards the data frames or data packets it receives.
  • Mechanical- ⁇ men which take into account such network nodes, which are part of the data network, but not forward data frames are missing in many routing protocols. This also applies, for example, to the Hybrid Wireless Mesh routing protocol
  • HWMP HyperText Transfer Protocol
  • Stub nodes wireless terminals (STAs)
  • STAs wireless terminals
  • MAP Access Point
  • Forwarding network nodes they can not process routing messages nor participate in the definition of the data path.
  • the object of the present invention is therefore to enable the integration of non-forwarding (mesh) network nodes in existing routing protocols, so that sol ⁇ che network nodes can participate on the one hand in the definition of the data path and on the other hand, a source node or destination node of data transfers could be. It is a further object of the present invention to provide a network node which can participate as a non-forwarding network node in a wireless, meshed data network with a plurality of network nodes using existing routing protocols.
  • the inventive method for operating a wireless mesh data network having a plurality of network nodes, between which at least partly consist Kommunikati ⁇ onstagenen, wherein at least some of the data frames Netzkno ⁇ th received to forward at least one of the network nodes and wherein at least one of the network node as a predetermined, Data frame is formed of non-forwarding network node, the predetermined network node suppresses the forwarding of the data frame and the forwarding and / or answering the data frames to the network nodes, which are transmitted in connection with the creation of a data path in the data network and are not addressed to the predetermined network node ,
  • the method according to the invention thus describes a possibility of how data frames, eg of the protocol HWMP, are handled by the predetermined, ie non-forwarding network nodes.
  • a corresponding procedure is not provided in the draft IEEE 802.11s Dl .0 so far.
  • the idea underlying the method is that routing messages, ie messages which are transmitted in connection with the creation of a data path in the data network, which are usually answered, forwarded or returned by the network nodes, are not forwarded by non-forwarding network nodes and only be answered under certain conditions.
  • this routing messages are also called "management frames."
  • the term of the data frame is basically to be understood broadly in the vorlie ⁇ constricting application.
  • a data frame is to include those data frames in the present description, the user data and / or routing data This means that the propagation of routing messages as well as data broadcast messages stops at the predetermined, non- forwarding network node.
  • the method according to the invention does not require any changes to existing routing protocols with respect to normal network nodes. All changes only concern the at least one predetermined, ie not forwarding, network node.
  • one or more of the subsequent messages comprising at least one of the data frames are processed by the predetermined network node:
  • Such a way-response message is processed as usual in the standard IEEE 802.11s, for example. Because the route reply message is addressed to the predetermined node, it is not erfor ⁇ sary, therefore, that an updated route reply message is sent.
  • the resulting entries in the routing tables show that the predetermined network node knows a path to the network node (so-called root network node) which sends out the proactive route request message, but no network node NEN path to which the proactive route request message from ⁇ sending network node created including the predetermined network node, since the predetermined network node does not forward the proactive route request message. It follows that the predetermined network node does not have to transfer data frames to the network node which sends out the proactive route request message for other network nodes. The predetermined network node therefore becomes a leaf node of the root tree. For example, the predetermined network node generates a proactive route response message when a proactive route response message flag is set.
  • a point-to-point route request message in which the predetermined network node is not addressed as a destination node will be processed according to HWMP, but no updated point-to-point route request message will be forwarded.
  • a point-to-point ⁇ route request message a skilled worker understands what is known. Unicast route request, that is, a path request message that was sent to just one network node.
  • a path response message not intended for the predetermined network node is relevant if the predetermined network node receives a non-addressed to him way-response message, which may be the case only by way of exception. In this case, the information contained in the message is still processed, e.g. to update the routing table of the predetermined node. However, no updated route response message will be sent.
  • a path error message signaling a failure of an existing data path. This ge ⁇ schieht to appropriate measures for the treatment of erroneous data path to make, which may be initiated by the predetermined network node, for example.
  • a further embodiment of the invention addresses and sends the predetermined network node a path response message to one of a route request message initiie ⁇ leaders network node when the predetermined node of the addressee of the route request message, said path request message and the route reply message in each case at least ⁇ comprise a data frame. That is, if the predetermined network node is the addressee of a route request message (ie, the predetermined network node is the requested destination), then the predetermined network node replies as usual with a route reply message.
  • the predetermined network node suppresses addressing and transmission of a route-response message to a network node initiating a route request message, if included in the route request message
  • the predetermined network node expediently suppresses ei ⁇ ne transmission of an updated proactive route request message to its neighboring network nodes.
  • the briefly ⁇ agreed network node knows, as already explained, the path to the originator of the route request message. By not forwarding the proactive route request message, no path is created by one of the network nodes that includes the predetermined network node in the determined data path. As a result, the non-forwarding or predetermined network node becomes a leaf node of the tree structure.
  • the predetermined network node upon receipt of a point-to-point route request message from one of the network nodes in which the predetermined network node is not addressed as the destination node, the predetermined network node suppresses the sending of an updated point-to-point route request message.
  • the predetermined network node suppresses forwarding of a non-addressed to him route response message, i. an updated route reply message is not sent.
  • the predetermined network node takes when receiving a path error message that sondere particular one he initiated route request message be ⁇ true, action to build the desired path again. It may be provided that the predetermined Netzkno ⁇ th suppressing a forwarding of the route error message and / or a reply to the path error message. This implies that there is no need to reply or forward the route error message because there is no path through the predetermined network node, as explained above.
  • the predetermined network node processes a so-called "Root Announcement” message (RANN) and suppresses a forwarding to other network nodes.
  • RANN Root Announcement
  • a root announcement message does not generate a path
  • the predetermined network node is hereby merely a leaf node of the tree, so that no network node data frame is transmitted to the route network node by the predetermined network node For this reason, the predetermined network node processes the RANN as stipulated in the standard, but does not transfer updated RANN.
  • the predetermined network node discards data frames received from it which are not addressed to it. If the routing protocol HWMP works with the extension for the predetermined network node as described above, a predetermined network node will never receive a data frame that is not intended for itself. Nonetheless, this can happen. The non-forwarding network node could then, for example, have a valid path to the addressee of a received data frame. If the data frame were not discarded, this would result in normal forwarding, which according to the above definition is not intended for the predetermined network node. For this reason, a predetermined network node discards all data frames that are not intended for itself. Whether a data frame is intended for the predetermined network node can be determined, for example, from the destination address (destination address / address 3), which in this case is the MAC address of the predetermined network node.
  • the predetermined network node processes the data frames broadcast by one of the network nodes.
  • the predetermined network node suppresses forwarding of the data frames which were broadcast by one of the network nodes.
  • Broadcast data frames are usually transmitted in the draft standard IEEE 802.11s by the ⁇ receiving network node once by broadcast to its neighboring network nodes.
  • a predetermined network node according to the invention performs processing of the broadcasted data frames, it does not forward to its neighboring network nodes.
  • the predetermined network node is a "Portal Annoucement" message (PANN) verar ⁇ beitet and suppresses forwarding of an updated PANN to other network nodes.
  • PANN Portal Annoucement
  • a portal Annoucement- message is not defined in HWMP message. It is Part of a separate protocol which the existence and He ⁇ reichiana a network provision (. So-called mesh portal, which is a node with the connection to an external network, such as a gateway), announcing, and is similar in basic features of a RANN. Since network nodes can not reach network access through a predetermined network node due to the unscheduled forwarding of data frames, a predetermined network node processes a PANN as usual, but suppresses updating and forwarding of the PANN.
  • the invention further relates to a network node for operation in a wireless, meshed data network having a plurality of network nodes, between which at least partially communication links exist, wherein at least some of the network nodes forward received data frames to at least one of the network nodes.
  • the network node according to the invention includes fully means for suppressing a forwarding of the data frame to the network node, and for suppressing a transmission and / or a reply to the data frame having a routing message transmitted in connection with the preparation ei ⁇ nes data path in the data network and are not addressed to the network node.
  • the network node according to the invention ⁇ corresponds to the predetermined non Tenden forward each network node of the inventive method described above and has the same advantages as have been described already be ⁇ .
  • the network node according to the invention may further comprise further means to carry out all Ausgestal ⁇ obligations of the described method.
  • 1 shows a data network with a plurality of network nodes, one of which is designed as a non-forwarding network node, 2 is a logical representation of the data network of FIG. 1,
  • FIG. 3 shows an embodiment in which two data paths are shown in the data network according to FIG. 1,
  • FIG. 4 shows a logical representation of the data network shown in FIG. 3 with the two data paths
  • FIG. 5 is a further illustration of the data network, as compared to FIG. 3, an additional, third data path is ⁇ is characterized in the exclusion of the non-forwarding mesh node,
  • FIG. 6 shows a logical representation of the data network shown in FIG. 5,
  • FIG. 1 shows an exemplary data network with a plurality of network nodes MP 1, MP 2, MP 3, MP 4, MP S, MP D, NF MP. Between each two of the network nodes MP 1, ..., NF MP at least partially exists a communication link KV.
  • the communication link KV is wireless nature.
  • the data network shown in Fig. 1 is therefore also referred to as a wireless, meshed data network.
  • Each of the network nodes has an address which corresponds to the reference symbols MP S, MP 1, MP 2, MP 3, MP 4, MP D, NF MP and in the following Description used to distinguish the network nodes.
  • the network node NF MP represents a so-called non-forwarding network node, which is also called a "non-forwarding mesh point.”
  • a non-forwarding network node is a network node that suppresses data frames received from neighboring network nodes and does not forward them to its neighboring network nodes However, this does not mean that a non-forwarding network node such as the network node NF MP represents a leaf node in a meshed data network An actual leaf node has only a single communication link to an adjacent network node As can be readily appreciated from FIG but, the non-forwarding network node NF MP communications ⁇ connections to the network nodes MP 1, MP 2 and MP 3. non-forwarding network node therefore represent "multiple" leaf node.
  • NF MP ' in the form of three network nodes NF MP ', NF MP' and NF MP ''shown
  • Each of these real leaf nodes NF MP ', NF MP''and NF MP''' has in each case a single communication connection to the network nodes MP 1 or MP 2 or MP 3.
  • FIG. 3 illustrates a situation in which the network node NF MP has set up a data path Pl to the network node MP 4 and a data path P2 to the network node MP D.
  • the data path P1 includes the network node MP2 as septkno ⁇ th.
  • the data path P2 includes the network node MP 3 as an intermediate node. While FIG. 3 shows the real communication links
  • FIG. 4 shows the logical communication connections, which mainly relate to the non-forwarding network node NF MP.
  • the illustration in FIG. 4 corresponds to the illustration already described in FIG. 2.
  • FIG. 7 shows the routing tables generated after creation of the data paths P1 and P2 for the network nodes MP.sub.S, NF.sub.MP, MP.sub.D, MP.sub.1, MP.sub.2, MP.sub.3 and MP.sub.4 of the data network.
  • the respective routing tables comprise three table entries: "dest” (destination) denotes the destination, i.e. the destination node, of a message, "next" (next node) identifies the next network node in the data path. "Hops" indicates the number of hops or the number of network nodes to be bridged up to the destination node.
  • the network node NF MP has two entries: The first line of the routing table relates to the data path Pl to the network node MP4 as the destination. From the point of view of the network node NF MP, the next network node is the network node MP 2. Furthermore, two hops are needed to reach the destination node, the network node MP 4. The second line relates to the second data path P2 for reaching the destination node MP D. From the point of view of the non-forwarding network node NF MP, the next network node is the network node MP 3. Again, two hops are required to reach the destination node MP D.
  • the routing table for the network node MP D includes an entry. This concerns the reverse route from the Netzkno ⁇ th MP D to the non-forwarding network node NF MP as the destination node. From the point of view of MP D, the next network node is to the destination node of network node MP 3, two hops being required to reach the destination node NF MP. In a corresponding manner, the routing tables for the network nodes MP 2, MP 3 and MP 4 are constructed.
  • the network node MP S wishes to establish a data path to the network node MP D.
  • MP S represents a source node
  • MP D represents a destination node of the data path to be created.
  • the impression could arise that the shortest path from MP S to MP D through the non-forwarding network node NF MP. If the network node NF MP were included in the data path, this would require passing the data frames from MP S to MP D, and vice versa, through NF MP.
  • NF MP is a non-forwarding network node, e.g. a communication terminal, such forwarding is not provided.
  • NF MP must be omitted from the data path between MP S to MP D, so that a forwarding of data frames by the network node NF MP is not required.
  • the omission of NF MP takes place in that the network node NF MP processes messages that are transmitted in connection with the creation of the data path in the data network, but suppresses a response and / or forwarding of such messages or data frames. This procedure is explained in more detail below with reference to FIG. 8, in which the routing tables for the network nodes of the data network of the exemplary embodiment are shown.
  • the network node MP S transmits a route request message (so-called route request RREQ) to the destination node MP D.
  • the route request message is broadcast here to all those connected to MP S via a data connection Network node of the data network (here: MP 1) sent out.
  • MP 1 a data connection Network node of the data network
  • the Request message creates a table entry in the routing table of the network node MP 1.
  • the table entry does not affect the forward route towards the destination node MP D, but rather the backward route to the source node MP S, since this is initially the only information which the network node MP 1 can obtain from the Route Request message. For this reason, the destination of the network node MP S, registered as the next network node of the network node MP S, wherein the distance between the network node MP 1 and the destination node (destination) MP S is a hop.
  • an updated route request message or route request message is sent by the network node MP 1 in response to the route request message of the source node MP S, that of all network nodes connected to MP 1 is received (MP S, MP 2, NF MP).
  • the non-forwarding network node NF MP suppresses the sending of an updated version of this route request message and leaves it unanswered. Furthermore, the non-forwarding network node NF MP does not respond with a route reply message (RREP) in a possible function as an intermediate node between the source node MP S and the destination node MP D.
  • RREP route reply message
  • This updated route request message is from the network nodes NF MP, MP 3 and MP 4 as well as MP 1 received.
  • the non-forwarding network node NF MP suppresses such transmission of an updated version of this route request message.
  • NF MP also does not respond with a Route Reply message in its function as a potential intermediate node. This shall also apply is if the "Destination only flag" not ge ⁇ sets, although NF MP already knows a valid path to the destination node MP D.
  • the updated route request message transmitted by the network node MP 2 is received by the network nodes MP 1, MP 3, MP 4 and the non-forwarding network node NF MP.
  • table entries are generated in the routing tables of these network nodes.
  • the network node NF MP obtains information relating to a path to the network node MP 2.
  • the network node MP 1 also gains information about a path to the network node MP 2.
  • the network node MP 3 also gains information in addition to the information about the network node MP 2 via a path to the source node MP S. The same applies to the network node MP 4.
  • an updated route request message is sent out by the network node MP 4, the network node MP D being designated as the destination. This merely leads to a change in the routing table of the
  • Network node MP 2 since this is the only one, which receives the ak ⁇ tualinstrumente route request message from MP 4.
  • an updated route request message is sent out by the network node MP 3, in which MPD is again designated as the destination. This is received by the network node MP 2, the destination node MP D and the non-forwarding network node NF MP. According to the procedure described above, NF MP does not send an updated version of this Route Request message. NF MP ant ⁇ wortet even with a route reply message in his role as intermediate nodes. This is also valid, if a "destination only flag" is not set, even though NF MP knows a valid path to MP D.
  • the updated route request message receiving network node MP 2, MP D and NF MP update their routing tables in response to the approach entspre ⁇ accordingly the previous stated.
  • Step 4 and step 5 of the described method can also be done in a twisted order.
  • MP D transmits a route reply message (RREP) to the source node MP S initiating the route request message via the established reverse path MP D-MP 3-MP 2-MP 1-MP S.
  • RREP route reply message
  • This path is indicated in Figs. 5 and 6 with P3 and a thick solid line. 5 shows the data network with the real communication connections, while FIG. 6 shows the logical communication connections of the non-forwarding network node NF MP.
  • the routing tables of the network nodes MP S, MP 1, MP 2 and MP 3 are updated. This is done in accordance with the previously be ⁇ written procedure.
  • the structure of the data path between the source node MP S and the destination node MP D is terminated, wherein the non-forwarding network node NF MP is not included in the data path P3 due to its behavior.
  • the network node MP 2 will forward data frames intended for the network node MP D to the network node MP 3.
  • NF MP could forward it to destination node MP D because it knows a valid path to MP D.
  • NF MP basically does not forward such data frames, but rejects them.

Landscapes

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

Abstract

L'invention concerne un procédé permettant de faire fonctionner un réseau de données maillé sans fil, présentant une pluralité de noeuds de réseau (MP1, MP2, MP 3, MP 4, MP S, MP D, NF MP) entre lesquels se présentent, au moins partiellement, des liaisons de communication (KV). Au moins plusieurs noeuds de réseau (KV) (MP1, MP2, MP 3, MP 4, MP S, MP D) transmettent des trames de données reçues à au moins l'un des noeuds de réseau (MP1, MP2, MP 3, MP 4, MP S, MP D, NF MP). Au moins l'un des noeuds de réseau (NF MP) est réalisé sous la forme d'un noeud de réseau prédéterminé. Le noeud de réseau prédéterminé (NF MP) supprime la transmission des trames de données, et la transmission et/ou la réponse des trames de données aux noeuds de réseau (MP1, MP2, MP 3, MP 4, MP S, MP D),qui sont transférés en liaison avec l'établissement d'un parcours de données dans le réseau de données, et qui ne sont pas adressés aux noeuds de réseau prédéterminés (NF MP).
EP07802943A 2007-01-29 2007-08-28 Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants Withdrawn EP2119138A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP07802943A EP2119138A1 (fr) 2007-01-29 2007-08-28 Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP07001913 2007-01-29
PCT/EP2007/058918 WO2008092513A1 (fr) 2007-01-29 2007-08-28 Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants
EP07802943A EP2119138A1 (fr) 2007-01-29 2007-08-28 Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants

Publications (1)

Publication Number Publication Date
EP2119138A1 true EP2119138A1 (fr) 2009-11-18

Family

ID=38736092

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07802943A Withdrawn EP2119138A1 (fr) 2007-01-29 2007-08-28 Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants

Country Status (4)

Country Link
US (1) US20100124190A1 (fr)
EP (1) EP2119138A1 (fr)
CN (1) CN101636980A (fr)
WO (1) WO2008092513A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8855030B2 (en) 2010-12-01 2014-10-07 Empire Technology Development Llc Suppression of discovery of mobile devices in a wireless network
CN103229468B (zh) * 2012-11-19 2016-05-25 华为技术有限公司 分组交换资源分配方法及设备
DE102014222662A1 (de) 2014-11-06 2016-05-12 Siemens Ag Österreich Verfahren zur Datenanreicherung von Messdatensätzen eines Niederspannungsnetzes
CN104394076B (zh) * 2014-12-01 2018-06-22 苏州市欧博锐自动化科技有限公司 一种多节点间消息传递方法
CN107770832B (zh) * 2017-10-11 2021-02-19 崔吉洲 具有抗干扰性能无线中继自组网方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MX2007010937A (es) * 2005-03-10 2008-02-20 Thomson Licensing Protocolo de enrutamiento de malla hibrida.
US20070070959A1 (en) * 2005-09-23 2007-03-29 Almeroth Kevin C Infrastructure mesh networks
US20070195728A1 (en) * 2006-02-17 2007-08-23 Shiwen Chen Automated method for constructing a routing infrastructure in an ad-hoc network

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
US20100124190A1 (en) 2010-05-20
CN101636980A (zh) 2010-01-27
WO2008092513A1 (fr) 2008-08-07

Similar Documents

Publication Publication Date Title
EP2090037B1 (fr) Procédé d'implantation de chemins bidirectionnels de transmission de données dans un réseau maillé de communication sans fil
DE3888818T2 (de) Aufgeteilte Lastverteilung.
EP2171935B1 (fr) Procédé, réseaux et noeuds de réseau pour la sélection d'un itinéraire
DE69215659T2 (de) Verfahren und einrichtung für transparente brückenbildung für den verkehr über fernbereichsnetze
DE102009043403B4 (de) Verfahren zum Aufbau eines bidirektionalen Kommunikationspfads in einem drahtlosen Netzwerk
EP2160874B1 (fr) Procédé d'exploitation d'un réseau maillé sans fil comportant plusieurs noeuds de réseau
EP2274935B1 (fr) Procédé et dispositif de production d'au moins une extension d'un message d'attribution pour des réseaux maillés sans fil
EP2135404B1 (fr) Procédé d'exploitation d'un réseau de type maillé, notamment selon la norme ieee 802.11s, constitué d'une pluralité de noeuds de réseau
DE10001608A1 (de) Verfahren zum Betreiben eines Mobilfunknetzes
WO1996010308A1 (fr) Procede et dispositif d'adressage d'utilisateurs dans un reseau comprenant au moins deux segments
WO2008031698A1 (fr) Procédé et noeud de réseau permettant d'acheminer des paquets de données dans des réseaux de communication
WO2008092513A1 (fr) Procédé permettant de faire fonctionner un réseau de données maillé sans fil présentant une pluralité de noeuds de réseau, et noeuds de réseau correspondants
EP1992127B1 (fr) Système de communication, ordinateur et procédé de détermination d'un protocole de communication à employer dans un système de communication
WO2008106907A1 (fr) Recherche de port cible dans des réseaux constitués de sous-réseaux reliés
DE102010027687B4 (de) Vermaschtes Funknetz, Netzknoten, Netzwerkkoordinator und Verfahren zum Routing von Datenpaketen in einem vermaschten Funknetz
DE602005000724T2 (de) Wegleitung in einem Kommunikationsnetzwerk
EP1800457B1 (fr) Procede de determination d'un abonne conducteur dans un reseau
DE112017003386B4 (de) Kommunikationssystem und Kommunikationsverfahren
EP1623559B1 (fr) Procede d'echange de donnees entre des elements de reseau dans des reseaux a differentes zones d'adresse
EP2321997B1 (fr) Procédé d'échange d'informations de routage dans un réseau de communication sans fil maillé
EP3609143A1 (fr) Procédé de configuration automatique de routes, procédé de communication de données, procédé de commande, routeur, programme informatique et support lisible par ordinateur
EP1994676B1 (fr) Procédé de création d'un champ d'adresse, procédé et dispositif de transmission d'un message électronique et paquet de données
WO2006133669A1 (fr) Procede et element de reseau de communication independant destines a determiner des routes etiquetees dans un tel element de reseau de communication
DE102004040305B3 (de) Verfahren zur Übertragung von Datenströmen
EP2536106A1 (fr) Procédé de transmission d'adresses

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: 20090828

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 MT NL PL PT RO SE SI SK TR

17Q First examination report despatched

Effective date: 20091204

DAX Request for extension of the european patent (deleted)
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: 20130323