WO2016019527A1 - Procédé de communication point-à-multipoint et nœud de communication sur la base de structure maillée - Google Patents

Procédé de communication point-à-multipoint et nœud de communication sur la base de structure maillée Download PDF

Info

Publication number
WO2016019527A1
WO2016019527A1 PCT/CN2014/083807 CN2014083807W WO2016019527A1 WO 2016019527 A1 WO2016019527 A1 WO 2016019527A1 CN 2014083807 W CN2014083807 W CN 2014083807W WO 2016019527 A1 WO2016019527 A1 WO 2016019527A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
source node
coordinate
new
region
Prior art date
Application number
PCT/CN2014/083807
Other languages
English (en)
Chinese (zh)
Inventor
袁泉
郑礼炳
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to PCT/CN2014/083807 priority Critical patent/WO2016019527A1/fr
Priority to CN201480034143.2A priority patent/CN105637936B/zh
Publication of WO2016019527A1 publication Critical patent/WO2016019527A1/fr

Links

Classifications

    • 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

Definitions

  • the present invention relates to the field of communications, and in particular, to a point-to-multipoint communication method and a communication node based on a Mesh structure. Background technique
  • NoC Networks On Chip
  • Current on-chip many-core systems such as the Teraflop 80 core and the Tilera 64 core are interconnected via a wired mesh network (eg, 2D-mesh).
  • NoC which supports single-point to multi-point information transmission, has great potential in diverse application areas and program modeling.
  • the point-to-multipoint transmission method based on Mesh structure in the prior art is a recursive slice single point pair.
  • RPM Recursive Partitioning Multicast
  • the node is hop-by-hop to the corresponding destination node through the node directly connected to the source node.
  • the data can be transmitted from the source node a first.
  • the node b to which the node a is connected is then hop-by-hop to the destination node c.
  • the node that has received the data connected to the source node in the area 1 is the new source node, and the area 0 and the area 1 are used as the new area range to divide the area and perform data transmission.
  • the data transmission path of the destination node of the area 0 necessarily passes through the node in the area 1, and the same operation of the area 0 and the area 1 is sequentially performed for the area 2 and the area 3, the area 4, and the area 5, the area 6, and the area 7. It can be known from the prior art that the RPM method needs to divide the nodes in the Mesh structure into eight regions, and the algorithm is too complicated, and the prior art does not consider how to reduce the transmission delay. Summary of the invention
  • the present invention provides a point-to-multipoint communication method and a communication node based on a Mesh structure, which is simple in implementation, can reduce a data transmission link, save system resources, and can reduce transmission delay.
  • a first aspect of the present invention provides a point-to-multipoint communication method based on a Mesh wireless mesh network structure, which may include:
  • Other nodes except the source node in the predetermined node range are divided into four independent regions by the boundary node, and the boundary node is divided into one of two regions bounded by the boundary node.
  • the horizontal distance and the vertical distance of the boundary node to the source node are equal;
  • the region when the region includes a destination node, data is transmitted from the source node to the region, and the first node is directly connected to the source node, and the current node is a node that needs to receive data from the source node;
  • the axis of the source node and the first node is a Y axis, and an axis passing through the origin and perpendicular to the Y axis is an X axis, and Y of the first node If the coordinates are positive, perform the following operations with the first node as the new source node: A, when the new source node is only one destination node in the area, ending data transmission to the area;
  • step D when the destination node exists in the remaining nodes in the area after being processed by B and C, transmitting data from the new source node to a node whose Y coordinate is positive and directly connected to the new source node Dividing the remaining nodes into a new area, and in the range of the new area, the node whose Y coordinate is positive and directly connected to the new source node is used as a new source node, and jumps to step A. .
  • the demarcation node When one of the two regions bounded by the demarcation node includes a destination node that needs to receive data from the source node, other nodes except the source node in the predetermined node range are bounded by the demarcation node.
  • the boundary node When divided into four independent regions, the boundary node is divided into the demarcation node Among the two regions of the boundary are included in the region of the destination node that needs to receive data from the source node.
  • the boundary node When two regions bounded by the boundary node include a destination node that needs to receive data from the source node, the other nodes except the source node in the predetermined node range are bounded by the boundary node as In the case of four independent regions, the boundary node is divided into any one of two regions bounded by the boundary node.
  • the source node When other nodes except the source node in the predetermined node range are divided into four independent regions by the boundary node, when the two regions bounded by the boundary node are not included, the source is not included.
  • the node receives the destination node of the data, and then divides the demarcation node into an area in which two other nodes are already included in the two areas bounded by the demarcation node.
  • a second aspect of the present invention provides a communication node, which is a node in a Mesh wireless mesh network structure, which may include:
  • a region dividing module configured to divide other nodes except the local node in the predetermined node range by a boundary node, into four independent regions, where the boundary node is divided into two regions bounded by the boundary node In one of the regions, the horizontal distance and the vertical distance of the boundary node to the node are equal;
  • a transmission module configured to target each of the four independent regions, when the region includes a destination a node, the data is transmitted from the source node to the area, and the source node is directly connected to the first node, where the current node is a node that needs to receive data from the source node;
  • the axis of the source node and the first node is the Y axis, and the axis passing through the origin and perpendicular to the Y axis is the X axis, and the Y coordinate of the first node is positive
  • the first node performs the following operations for the new source node: A, when the new source node is only one destination node in the area, ending data transmission to the area; B, when When there is a destination node in the region that has the same Y coordinate and the X coordinate is positive, the data is transmitted from the new source node to the X coordinate is positive and directly connected to the new source node.
  • Step A when there is a Y with the new source node in the region
  • the destination node has the same coordinates and the X coordinate is negative, data is transmitted from the new source node to a node whose X coordinate is negative and directly connected to the new source node, and then the Y axis is bounded, and the All nodes in the region whose X coordinate is negative are divided into a new region, and within the new region, the node whose X coordinate is negative and directly connected to the new source node is used as a new source node, and jumps Go to step A;
  • the area division module is specifically configured to:
  • the other nodes are divided into four independent regions by a boundary node, and the boundary node is divided into two destinations that are bounded by the boundary node and includes a destination node that needs to receive data from the source node. In the area.
  • the region dividing module is specifically configured to: A node, bounded by a boundary node, is divided into four independent regions, and the boundary node is divided into any one of two regions bounded by the boundary node.
  • a destination node that needs to receive data from the source node is not included in the two areas bounded by the boundary node, and the area dividing module is specifically configured to: A node, bounded by a boundary node, is divided into four independent regions, and the boundary node is divided into regions in the two regions bounded by the boundary node that have already included other boundary nodes.
  • a third aspect of the present invention provides a communication node, which is a node in a Mesh wireless mesh network structure, which may include: an input device, an output device, a communication link, a transceiver device, a memory, and a processor, where:
  • the input device is configured to receive input data externally input to the communication node
  • the output device is configured to output output data of the communication node to the outside;
  • the communication link is configured to establish a communication link between the communication node and other nodes of the Mesh wireless mesh network structure
  • the transceiver device is configured to communicate with other nodes of the Mesh wireless mesh network structure through the communication link;
  • the memory is configured to store program or non-program data with various functions
  • the processor is configured to invoke program data stored in the memory, and perform the following operations: dividing other nodes in the predetermined node range except the source node by the boundary node into four independent regions. Demarcation nodes are divided into one of two regions bounded by the boundary node, and the horizontal distance and the vertical distance of the boundary node to the source node are equal;
  • the region when the region includes a destination node, data is transmitted from the source node to the region, and the first node is directly connected to the source node, and the current node is a node that needs to receive data from the source node;
  • the axis of the source node and the first node is a Y axis, and an axis passing through the origin and perpendicular to the Y axis is an X axis, and Y of the first node
  • the coordinates are positive, and the first node is the new source node to perform the following operations:
  • A when the new source node is only one destination node in the area, ending data transmission to the area;
  • B when there is a destination node in the region that is the same as the Y coordinate of the new source node and the X coordinate is positive, transmitting data from the new source node to the X coordinate is positive and the new a node directly connected to the source node, and then dividing the nodes whose X coordinate is positive in the region into a new region with the Y axis as a boundary, and within the new region, the X coordinate is positive and The node directly connected to the new source node acts as a new source node, and jumps to step A; otherwise, does not perform any node in the region that has the same Y coordinate and the X coordinate is positive with the new source node. operating;
  • step D when the destination node exists in the remaining nodes in the area after being processed by B and C, transmitting data from the new source node to a node whose Y coordinate is positive and directly connected to the new source node Dividing the remaining nodes into a new area, and in the range of the new area, the node whose Y coordinate is positive and directly connected to the new source node is used as a new source node, and jumps to step A. .
  • the processor invokes program data in the memory to divide the source node within a predetermined node range
  • Other nodes other than the boundary node are divided into four independent regions, and the boundary node is divided into two regions in which the boundary node is bounded by the source node In the area of the destination node that receives the data.
  • both areas bounded by the demarcation node include a destination node that needs to receive data from the source node
  • the processor invokes program data in the memory to exclude a source node from a predetermined node range.
  • the other nodes are divided into four independent regions by the boundary nodes, and the boundary nodes are divided into any one of two regions bounded by the boundary nodes.
  • both areas bounded by the demarcation node include a destination node that needs to receive data from the source node
  • the processor invokes program data in the memory to exclude a source node from a predetermined node range.
  • the other nodes, divided by the boundary node are divided into four independent regions, and the boundary nodes are divided into regions in the two regions bounded by the boundary nodes that have already included other boundary nodes.
  • the processor does not invoke program data in the memory to perform the region data transmission.
  • a fourth aspect of the invention provides a computer storage medium, characterized in that the computer storage medium can store a program, which can include some or all of the steps of the method of the invention when executed by the program.
  • other nodes except the source node in the predetermined node range are divided into four independent regions by the boundary node, and the boundary node is divided into In one of the two regions in which the boundary node is bounded, the horizontal distance and the vertical distance of the boundary node to the source node are equal; for each of the four independent regions, when the region includes When the destination node transmits data from the source node to the region directly with the source node The point is connected to the first node, the current node is a node that needs to receive data from the source node; the source node is set as the origin, and the axis of the source node and the first node is the Y axis.
  • the following operation is performed with the first node as the new source node: A, when the new When the source node is only one destination node in the area, end data transmission to the area; B, when there is a Y coordinate with the new source node and the X coordinate is positive in the area At the destination node, data is transmitted from the new source node to a node whose X coordinate is positive and directly connected to the new source node, and then the X coordinate is positive in the region with the Y axis as the boundary.
  • the node is divided into a new area, and within the new area, the node whose X coordinate is positive and directly connected to the new source node is used as a new source node, and jumps to step A; otherwise, The Y coordinate of the new source node in the region is the same and X The node marked as positive does not perform any operation; C, when there is a destination node in the area that has the same Y coordinate of the new source node and the X coordinate is negative, data is transmitted from the new source node to a node whose X coordinate is negative and directly connected to the new source node, and then divides all nodes in the region whose X coordinate is negative into a new region with the Y axis as a boundary, and within the new region And the node whose X coordinate is negative and directly connected to the new source node is used as a new source node, and jumps to step A; otherwise, the Y coordinate of the new source node in the area is the same And the node whose X coordinate
  • Node as a new source node jump to step A. Since the embodiment of the present invention divides only the nodes other than the source node into four independent regions, the implementation manner of the partitioning with respect to the eight regions of the prior art is simpler. Single. At the same time, in the embodiment of the present invention, when four regions are divided, the boundary node is used as the boundary of the region, the source node is updated in real time during the data transmission process, and the region is re-divided based on the new source node. Such a communication method naturally forms. Long-edge priority transmission principle, which can reduce the transmission delay during data transmission, reduce the data transmission link, and save system resources. DRAWINGS
  • FIG. 1 is a schematic diagram of area division centered on a source node in a Mesh structure in the prior art
  • FIG. 2 is a schematic flow diagram of an embodiment of a point-to-multipoint communication method based on a Mesh structure according to the present invention
  • FIG. 3 is a schematic diagram showing the principle of region division centered on a source node in the next embodiment of the Mesh structure in the present invention.
  • FIG. 4 is a schematic diagram showing the result of region division centered on a source node in the next embodiment of the Mesh structure in the present invention.
  • FIG. 5 is a schematic diagram showing the result of region division centered on a source node according to another embodiment of the Mesh structure in the present invention.
  • FIG. 6 is a schematic diagram of a process transmission path of data transmission in the present invention.
  • FIG. 7 is a schematic diagram of another process transmission path of data transmission in the present invention.
  • FIG. 8 is a schematic diagram of another process transmission path of data transmission in the present invention.
  • FIG. 9 is a schematic diagram of a complete data transmission path according to an embodiment of a communication method according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of a complete data transmission path of an embodiment of a prior art RMP communication method;
  • FIG. 11 is a schematic structural diagram of an embodiment of a communication node according to the present invention
  • FIG. 12 is a schematic structural diagram of another embodiment of a communication node according to the present invention. Specific embodiment
  • other nodes except the source node in the predetermined node range are divided into four independent regions by using the boundary node, and the boundary node is divided into the demarcation node.
  • the horizontal distance and the vertical distance of the boundary node to the source node are equal; for each of the four independent regions, when the region includes the destination node, Transmitting data from the source node to the area and directly connecting the first node to the source node, where the current node is a node that needs to receive data from the source node; setting the source node as an origin, The axis of the source node and the first node is a Y axis, and an axis passing through the origin and perpendicular to the Y axis is an X axis, and a Y coordinate of the first node is positive, and the first The node performs the following operations for the new source node: A, when the new source node is only a destination node
  • step A when the region exists and When the new source node has the same Y coordinate and the X coordinate is negative, the data is transmitted from the new source node to the node whose X coordinate is negative and directly connected to the new source node, and then the Y axis
  • all nodes in the region whose X coordinate is negative are divided into a new region, and within the new region, a node whose X coordinate is negative and directly connected to the new source node is used as a new source node, and jumps to step A; otherwise, the Y coordinate of the new source node in the region is the same and the
  • the embodiment of the present invention divides only the nodes other than the source node into four independent regions, the implementation manner of the partitioning with respect to the eight regions of the prior art is simpler.
  • the boundary node is used as the boundary of the region, the source node is updated in real time during the data transmission process, and the region is re-divided based on the new source node.
  • Such a communication method naturally forms. Long-edge priority transmission principle, which can reduce the transmission delay during data transmission, reduce the data transmission link, and save system resources.
  • FIG. 2 is a flow chart showing an embodiment of a point-to-multipoint communication method based on a Mesh wireless mesh network structure according to the present invention. As shown in FIG. 2, it may include:
  • Step S110 dividing other nodes except the source node in the predetermined node range by the boundary node into four independent regions, where the boundary node is divided into two regions bounded by the boundary node. In one area, the horizontal distance and the vertical distance of the boundary node to the source node are equal.
  • the outermost rectangular area is a predetermined node range based on the Mesh structure of the present invention, and in the outermost rectangular area, the black circle is the source node, that is, the node a in FIG. 3, which has a diagonal line.
  • the circle is the destination node, including node 1), node d, node n, node h, node i, node 1, node p, and the circle through which the dotted line passes is a demarcation node, including node 6, node g, node j,
  • the node o, the node t, and the node m in the embodiment of the present invention, the node other than the source node in the predetermined node range by the cross line formed by the node 6, the node g, the node j, the node o, the node t, and the node m Divided into four independent regions, namely, region 1, region 2, region 3, and region 4, wherein the boundary node 6, node g, node j, node o, node t, and node m can be divided into the boundaries
  • the node is in one of the two regions bounded by the node.
  • the node e can be divided into the area 1 or the area 2
  • the node g can be divided into the area 2 or the area 3
  • the node o can be divided into the area 3 or the area 4
  • the node m can be divided into In area 4 or area 1.
  • the boundary node is divided into the The boundary node is a region of the two regions that are bounded by a destination node that needs to receive data from the source node.
  • the node m is a boundary node of the area 1 and the area 4, wherein the area 1 includes the destination node b, and the area 4 does not include the destination node. Therefore, as an implementation manner, In the embodiment of the invention, when the area is divided for the node m, the node m can be divided into the area 1. Based on the same division rule, node 0 and node t are divided into area 3.
  • the boundary node when two regions bounded by the boundary node include a destination node that needs to receive data from the source node, the boundary node is divided into the boundary The node is in any of the two regions bounded by the node.
  • the node c is a boundary node of the area 1 and the area 2, wherein the area 1 includes the destination node b, and the area 2 includes the destination node d and the destination node h. Therefore, as an embodiment, in the embodiment of the present invention, when the area is divided for the node c, the node c can be divided into any one of the area 1 and the area 2 (in FIG.
  • the area is divided into the area 2 as a legend).
  • the node g and the node j can also be divided into any one of the area 2 or the area 3 (in FIG. 4, the division into the area 3 is a legend;).
  • the boundary node is divided into The boundary nodes are bounded by two regions in the region that already have other demarcation nodes. For example, referring to FIG.
  • the destination node is not included in the region 3 and the region 4 in which the node 0 and the node t are demarcation nodes, and the node 0 has been divided into the region 3, and the node t is also divided into the region 3. To maintain the unity of the two.
  • Step S111 for each area of the four independent areas, when the area includes a destination node, transmitting data from the source node to the area and directly connecting the first node to the source node,
  • the node is currently a node that needs to receive data from the source node.
  • the destination node b is included in the area 1, and in step Sill, the data can be transmitted from the source node a to the first node b in the area 1 directly connected to the source node a.
  • the destination nodes d and h are included in the area 2, and therefore, in step S111, data can be transmitted from the source node a to the first node e in the area 2 directly connected to the source node a.
  • the area 3 includes the destination node, the destination node 1 and the destination node i, and in step Sill, data can be transmitted from the source node a to the first directly connected to the source node a in the area 3. Node k.
  • Step S112 setting the source node as an origin, the axis of the source node and the first node is a Y axis, and an axis passing through the origin and perpendicular to the Y axis is an X axis, the first If the Y coordinate of the node is positive, then the first node is the new source node.
  • the source node a is set as the origin
  • the axis of the source node a and the first node b is the Y axis
  • the axis passing through the origin a and perpendicular to the Y axis is the X axis.
  • the coordinate system is as shown in FIG. 6, wherein the Y coordinate of the first node b is positive.
  • the source node a is set as the origin, the source node a and the first
  • the axis of the node e is the Y axis
  • the axis passing through the origin a and perpendicular to the ⁇ axis is the X axis
  • the coordinate system presented is as shown in FIG. 7 , wherein the ⁇ coordinate of the first node e is positive. .
  • the source node a is set as the origin
  • the axis of the source node a and the first node k is the Y axis
  • the axis passing through the origin a and perpendicular to the Y axis is the X axis.
  • the coordinate system presented is as shown in Fig. 8, wherein the Y coordinate of the first node k is positive.
  • Step S113 When the new source node is only one destination node in the area, end data transmission to the area, otherwise, perform step S114 or S115.
  • Step S114 when there is a destination node in the area that is the same as the Y coordinate of the new source node and the X coordinate is positive, transmitting data from the new source node to the X coordinate is positive and the new a node directly connected to the source node, and then dividing all nodes in the region whose X coordinate is positive into a new region with the Y axis as a boundary, and within the new region, the X coordinate is positive and The node directly connected to the new source node is used as a new source node, and the process proceeds to step S113; otherwise, the node with the same Y coordinate and the positive X coordinate of the new source node in the region is not performed. Any operation.
  • step S115 when there is a destination node in the region that is the same as the Y coordinate of the new source node and the X coordinate is negative, transmitting data from the new source node to the X coordinate is negative and the new a node directly connected to the source node, and then dividing the nodes whose X coordinate is negative in the region into a new region with the Y axis as a boundary, and within the new region, the X coordinate is negative and The node directly connected to the new source node is used as a new source node, and the process proceeds to step S113; otherwise, the node with the same Y coordinate and negative X coordinate in the region as the new source node does not perform any operating.
  • Step S116 after being processed by steps S114 and S115, the remaining nodes in the area are stored.
  • data is transmitted from the new source node to a node whose Y coordinate is positive and directly connected to the new source node, and the remaining nodes are divided into a new area, and in the new area range Then, the node whose Y coordinate is positive and directly connected to the new source node is used as a new source node, and the process proceeds to step S113.
  • the data is transmitted from the source node a to the area and directly connected to the source node by the first node b (the transmission path is as shown in the figure In the step S112, with the origin of the source node a, the axis of the source node and the first node b is the Y axis, and the axis passing through the origin a and perpendicular to the Y axis is X.
  • the axis, and setting the Y coordinate of the first node b to be positive (Y+ direction in FIG.
  • step S113 is executed to end the data transmission to the area 1.
  • step S112 step S113 is executed to end the data transmission to the area 1.
  • step S111 data is transmitted from the source node a to the area 2 and directly connected to the source node a.
  • a node e (the transmission path is as shown by the arrow pointing to the node e in the node a ); and the source node a is taken as the origin, and the axis of the source node a and the first node e is the Y axis.
  • the axis passing through the origin and perpendicular to the Y axis is the X axis, and the Y coordinate of the first node is set to be positive (Y+ direction in Fig.
  • step S113 the node e is the new source node because the node e It is not the destination node in the area 2 that receives the data, and therefore step S113 is not performed.
  • step S113 there is no destination node in the region 2 that has the same Y coordinate of the new source node e and the X coordinate is positive, and actually, the region 2 is fundamental.
  • step S114 There is no node having the same Y coordinate as the new source point e and the X coordinate is positive, and therefore, no processing can be performed in step S114.
  • step S115 the new source node e in the region 2 is The node c having the same Y coordinate and the negative X coordinate does not perform any operation, so the node c is not divided into any of the area blocks in FIG.
  • step S116 is performed to The new source node e is transmitted to the node f whose positive Y coordinate is directly connected to the new source node e, and the remaining nodes (node d, node f, and node h) are divided into a new area 22, and The node f whose positive Y coordinate is positive and directly connected to the new source node e is regarded as a new source node, and within the range of the region 22, the process proceeds to step S113.
  • Step S115 is performed to transfer data from the new source node f to the node d whose X coordinate is negative and directly connected to the new source node f, and then bordered by the Y axis (the node e and in FIG.
  • f is the axis
  • all nodes in the region whose X coordinate is negative are divided into a new region 222 (which may also not include the boundary node), and within the range of the new region 222, the X coordinate is negative and
  • the node d directly connected to the new source node f serves as a new source node, and the process proceeds to step S113.
  • the new source node d is the only destination node in the area 222. Therefore, the method is in the area 222. The transfer can end. Therefore, it can be seen that the data is successfully transmitted from the source node a to the destination node d.
  • step S111 After determining in step S111 that there is a destination node p and a destination node 1 and a destination node i in the region 3, data is transmitted from the source node a to the region 3 directly to the source.
  • the node a is connected to the first node k (the transmission path is as indicated by the arrow of the node a pointing to the node k in the figure); the source node a is taken as the origin in the step S112, the source node a and the first node k
  • the axis is the Y axis, the axis passing through the origin and perpendicular to the Y axis is the X axis, and the Y coordinate of the first node is set to be positive (Y+ direction in FIG. 8), and then the node k is new.
  • the source node since the node k is not the only destination node in the area 2 that receives data, step S113 is not performed.
  • the Y coordinate of the new source node e in the region 3 is the same in step S114.
  • Node 0 with positive X coordinate does not perform any operation.
  • the new source node e in the region 3 is The node g having the same Y coordinate and the negative X coordinate does not perform any operation, and therefore, in Fig. 8, the node 0 and the node g are not divided into any of the area blocks.
  • step S116 transferring data from the new source node k to node 1 whose Y coordinate is positive and directly connected to the new source node k, and the remaining nodes (node t, node p , node 1, node i, node j) is divided into a new area 32, and the node 1 whose positive Y coordinate is positive and directly connected to the new source node k is used as a new source node, and jumps within the range of area 32. Go to step S113.
  • Step S115 transmitting data from the new source node 1 to a node i whose X coordinate is negative and directly connected to the new source node 1, and then bordered with the Y axis (node a, node k in Fig.
  • the axis where node 1 is located divides all nodes in the region whose X coordinate is negative into a new region 322, and within the range of the new region 322, the X coordinate is negative and the new source
  • the node i directly connected to the node k as a new source node jumps to step S113; still referring to FIG. 8, the new source node i is the only destination node in the area 322, and therefore, the transmission of the method in the area 322 can end. therefore, It can be seen that the data is successfully transmitted from the source node a to the destination node.
  • FIG. 9 shows a complete path diagram of data transmission using the Mesh structure-based point-to-multipoint communication method according to the embodiment of the present invention
  • FIG. 10 shows data transmission using the RPM algorithm in the prior art.
  • the path passed is node a-node b-node c-node X, and the current use is
  • the path through which the technical RPM algorithm passes is the node a-node t-node V-node X, which is one more hop than the present invention.
  • the path passed It is: node a-node t-node u-node s
  • the path that the prior art RPM algorithm passes is node a-node n-node r-node s.
  • the method may further include: when, for each of the four independent areas, when the area does not include a destination node that needs to receive data from the source node, Data transmission is performed to the area (for example, area 4 in Fig. 4, area 3 and area 4 in Fig. 5).
  • other nodes except the source node in the predetermined node range are divided into four independent regions by the boundary node, and the boundary node is divided into Wherein the boundary node is one of two regions bounded by the boundary, the horizontal distance and the vertical distance of the boundary node to the source node are equal; for each region of the four independent regions, when the region When the destination node is included, data is transmitted from the source node to the area directly
  • the source node is connected to the first node, and the current node is a node that needs to receive data from the source node; the source node is set as an origin, and the axis of the source node and the first node is Y.
  • An axis, an axis passing through the origin and perpendicular to the Y axis is an X axis, and a Y coordinate of the first node is positive, and the first node is a new source node to perform the following operations: A, When the new source node is only a destination node in the area, end the data transmission to the area; B, when the area has the same Y coordinate as the new source node and the X coordinate is a positive destination node, transmitting data from the new source node to a node whose X coordinate is positive and directly connected to the new source node, and then taking the Y axis as a boundary, and the X coordinate in the region is positive All nodes are divided into a new area, and within the new area, the node whose X coordinate is positive and directly connected to the new source node is used as a new source node, and jumps to step A; otherwise , the Y coordinate of the new source node in the region The node with the same X
  • the node transmits to a node whose X coordinate is negative and directly connected to the new source node, and then divides all nodes in the region whose X coordinate is negative into a new region by using the Y axis as a boundary, and in the new Within the region, the node whose X coordinate is negative and directly connected to the new source node is used as a new source node, and jumps to step A; otherwise, to the new source node in the region A node having the same Y coordinate and a negative X coordinate does not perform any operation; D, when the destination node exists in the remaining nodes in the region after being processed by B and C, data is transmitted from the new source node to Y a node whose coordinates are positive and directly connected to the new source node, divides the remaining nodes into a new area, and within the new area, the Y coordinate is positive and the new source node Directly connected nodes as new source nodes, jump Go to step A.
  • the embodiment of the present invention divides only the nodes other than the source node into four independent regions, the implementation manner of the partitioning with respect to the eight regions of the prior art is more For the sake of simplicity.
  • the boundary node is used as the boundary of the region, the source node is updated in real time during the data transmission process, and the region is re-divided based on the new source node.
  • Such a communication method naturally forms. Long-edge priority transmission principle, which can reduce the transmission delay during data transmission, reduce the data transmission link, and save system resources. Schematic diagram of functional structure and hardware structure.
  • FIG. 11 is a schematic diagram showing the functional structure of an embodiment of a communication node according to the present invention.
  • the communication node in the embodiment of the present invention may include a region dividing module 10 and a transmission module 20, where: the region dividing module 10 is configured to divide other nodes in the predetermined node range except the local node to demarcate nodes. For the boundary, it is divided into four independent regions, and the boundary node is divided into one of two regions bounded by the boundary node, and the horizontal distance and the vertical distance of the boundary node to the local node are equal.
  • the transmission module 20 is configured to, for each area of the four independent areas divided by the area dividing module 10, when the area includes the destination node, transfer data from the source node to the area directly to the source
  • the node is connected to the first node, and the current node is a node that needs to receive data from the source node; the source node is set as the origin, and the axis of the source node and the first node is the Y axis.
  • the following operation is performed with the first node as a new source node: A, when the new When the source node is only one destination node in the area, end data transmission to the area; B, when there is a Y coordinate with the new source node and the X coordinate is positive in the area At the destination node, data is transmitted from the new source node to a node whose X coordinate is positive and directly connected to the new source node, and then the X coordinate is positive in the region with the Y axis as the boundary.
  • the node is divided into a new area, And in the range of the new area, the node whose X coordinate is positive and directly connected to the new source node is used as a new source node, and jumps to step A; otherwise, the area is
  • the nodes of the new source node having the same Y coordinate and the positive X coordinate do not perform any operation; C, when there is a destination node in the region that has the same Y coordinate and the X coordinate is negative, Data is transmitted from the new source node to a node whose X coordinate is negative and directly connected to the new source node, and then the Y-axis is bounded, and all nodes in the region whose X coordinate is negative are divided into a new one.
  • the node whose X coordinate is negative and directly connected to the new source node is used as a new source node, and jumps to step A; otherwise, The nodes of the new source node having the same Y coordinate and the negative X coordinate do not perform any operation; D, when the destination node exists in the remaining nodes in the region after being processed by B and C, the data is from the The new source node is transmitted to the Y coordinate is positive and with the new a node directly connected to the source node, dividing the remaining node into a new area, and in the range of the new area, using the node whose Y coordinate is positive and directly connected to the new source node as a new source Node, jump to step A.
  • the outermost rectangular area is a predetermined node range based on the Mesh structure of the present invention, and in the outermost rectangular area, the black circle is the source node, that is, the node a in FIG. 3, which has a diagonal line.
  • the circle is the destination node, including node 1), node d, node n, node h, node i, node 1, node p, and the circle through which the dotted line passes is a demarcation node, including node 6, node g, node j, node o , the node t, and the node m
  • the area dividing module 10 of the node a of the embodiment of the present invention may first set the predetermined node range by the cross line formed by the node e, the node g, the node j, the node o, the node t, and the node m
  • Nodes other than the source node are divided into four independent regions, namely, region 1, region 2, region 3, and region 4, where demarcation node 6, node g, node j, node o, node t, and node m may be divided into one of two regions bounded by the boundary node In the domain.
  • the node e can be divided into the area 1 or the area 2
  • the node g can be divided into the area 2 or the area 3
  • the node o can be divided into the area 3 or the area 4
  • the node m can be divided into In area 4 or area 1.
  • the region dividing module 10 divides the boundary.
  • the node is partitioned into an area of the two areas bounded by the demarcation node that includes a destination node that needs to receive data from the source node.
  • the node m is a boundary node of the area 1 and the area 4, wherein the area 1 includes the destination node b, and the area 4 does not include the destination node.
  • the area dividing module 10 of the node a of the embodiment of the present invention divides the area for the node m
  • the node m can be divided into the area 1.
  • node 0 and node t are divided into area 3.
  • node c is a boundary node of area 1 and area 2, wherein area 1 includes a destination node b, and area 2 includes a destination node d and a destination node h. Therefore, as an embodiment, when the area dividing module 10 of the node a of the embodiment of the present invention divides the area for the node c, the node c can be divided into any one of the area 1 and the area 2 (in FIG. 4 to divide into In the area 2 is the legend ;). Based on the same division rule, the node g and the node j can also be divided into any one of the area 2 or the area 3 (in FIG. 4, the division into the area 3 is a legend).
  • the region dividing module 10 when two destinations bounded by the boundary node do not include a destination node that needs to receive data from the source node, the region dividing module 10 The demarcation node is divided into regions in the two regions bounded by the demarcation node that have already included other demarcation nodes. For example, referring to FIG. 5, the destination node is not included in the region 3 and the region 4 in which the node 0 and the node t are demarcation nodes, and the node 0 has been divided into the region 3, and the node t is also divided into the region 3. In order to maintain the unity of the two.
  • the transmission module 20 determines that there is the destination node b
  • the data is transmitted from the source node a to the area and directly connected to the source node by the first node b (the transmission path is as shown in the figure And the origin of the source node a, the axis of the source node and the first node b is the Y axis, and the axis passing through the origin a and perpendicular to the Y axis is the X axis, and After setting the Y coordinate of the first node b to be positive (Y+ direction in FIG.
  • b is a new source node, and since node b is only one of the regions 1, it needs to receive from the source node a.
  • the transmission module performs step A to end the data transmission to the area 1. Referring to Figure 6, it has been shown that data has been successfully transmitted to the destination node in Area 1 by embodiments of the present invention.
  • a node e (the transmission path is as shown by the arrow pointing to the node e in the node a ); and the source node a is taken as the origin, and the axis of the source node a and the first node e is the Y axis.
  • the axis passing through the origin and perpendicular to the Y axis is the X axis, and the Y coordinate of the first node is set to be positive (Y+ direction in Fig.
  • Step 8 is not performed.
  • the transmission module 20 pairs the new source in the region 2.
  • step D Data is transmitted from the new source node e to a node f having a positive Y coordinate and directly connected to the new source node e, dividing the remaining nodes (node d, node f, and node h) into a new region 22
  • the transmission module 20 jumps to step A.
  • Step 20 is performed to transfer data from the new source node f to a node h whose X coordinate is positive and directly connected to the new source node f, and then bounded by the Y axis (node e in FIG.
  • f is the axis
  • all nodes in the region whose X coordinate is positive are divided into a new region 221 (excluding the boundary node), and within the range of the new region 221, the X coordinate is positive and
  • the new source node f is directly connected to the node h as a new source node, and the transmission module 20 jumps to step A; further, since the new source node h is the only destination node in the area 221, the method is in the area 221 The transfer can end. Therefore, it can be seen that the data is successfully transmitted from the source node a to the destination node h.
  • step C transferring data from the new source node f to a negative X coordinate
  • the node d directly connected to the new source node f is then bounded by the Y axis (the axis where the nodes e and f are located in FIG. 7), and all nodes in the region whose X coordinate is negative are divided into a new one.
  • the area 222 (which may also not include the boundary node), and within the range of the new area 222, the node d which is negative in the X coordinate and directly connected to the new source node f is used as a new source node, and jumps to Step A; Still referring to FIG. 7, the new source node d is the only destination node in region 222, so the transmission of the method in region 222 can end. Therefore, it can be seen that the data is successfully transmitted from the source node a to the destination node d.
  • the node a is connected to the first node k (the transmission path is as indicated by the arrow of the node a pointing to the node k in the figure); and the source node a is taken as the origin, and the axis of the source node a and the first node k are located
  • the axis passing through the origin and perpendicular to the Y axis is the X axis
  • the Y coordinate of the first node is set to be positive (Y+ direction in Fig. 8)
  • the node k is the new source node. Since the node k is not the only destination node in the area 2 that receives data, the transmission module 20 does not perform step A.
  • the transmission module 20 in step B is in the region 3 with the new source node e. Node 0 with the same Y coordinate and positive X coordinate does not perform any operation.
  • the transmission module 20 in step C the new source is in the region 3
  • the node g whose node Y has the same Y coordinate and the X coordinate is negative does not perform any operation, and therefore node 0 and node g are not divided into any area block in FIG.
  • the transmission module 20 performs step D, transmitting data from the new source node k to the Y coordinate being positive and with the new
  • the node 1 directly connected to the source node k divides the remaining nodes (node t, node p, node 1, node i, node j) into a new region 32, and the Y coordinate is positive and the new source node Node 1 directly connected to k acts as a new source node, and within the range of area 32, jumps to step A.
  • Step C transmitting data from the new source node 1 to a node i whose X coordinate is negative and directly connected to the new source node 1, and then bordered with the Y axis (node a, node k in Fig.
  • the axis where node 1 is located divides all nodes in the region whose X coordinate is negative into a new region 322, and within the range of the new region 322, the X coordinate is negative and the new source
  • the node i directly connected to the node k as a new source node jumps to step A; still referring to FIG. 8, the new source node i is the only destination node in the area 322, and therefore, the transmission of the method in the area 322 can end. Therefore, it can be seen that the data is successfully transmitted from the source node a to the destination node.
  • the transmission module 20 of each source node is further configured to: when each area of the four independent areas is received, when the area does not include receiving from the source node When the destination node of the data is not transmitted to the area.
  • the region dividing module 10 divides other nodes except the source node in the predetermined node range by the boundary node, and divides into four independent regions, and the boundary is divided.
  • the node is divided into one of two regions bounded by the boundary node, the horizontal distance and the vertical distance of the boundary node to the source node being equal; the transmission module 20 is for each of the four independent regions
  • the area includes the destination node, the data is transmitted from the source node to the area, and the first node is directly connected to the source node, where the current node needs to receive data from the source node.
  • a node is set to take the source node as an origin, the axis of the source node and the first node is a Y axis, and an axis passing through the origin and perpendicular to the Y axis is an X axis, the first node If the Y coordinate is positive, the following operation is performed by using the first node as a new source node: A, when the new source node is only a destination node in the area, ending the area Data transmission; B, when there is a destination node in the area that has the same Y coordinate as the new source node and the X coordinate is positive, the data is transmitted from the new source node to the X coordinate is positive and Describe the nodes directly connected to the new source node, and then divide all nodes in the region whose X coordinate is positive into a new region with the Y axis as the boundary, and within the new region, the X coordinate is The node directly connected to the new source node acts as a new source node, and
  • the data is transmitted from the new source node to the X coordinate is negative and Directly with the new source node Connected nodes, then with the Y-axis as a boundary, divide all nodes in the region whose X coordinate is negative into a new region, and within the new region, the X coordinate is negative and the new
  • the node directly connected to the source node acts as a new source node, and jumps to step ⁇ ; otherwise, no operation is performed on the node in the region that has the same ⁇ coordinate and negative X coordinate as the new source node;
  • the destination node exists in the remaining nodes in the area after being processed by ⁇ and C, data is transmitted from the new source node to a node whose ⁇ coordinate is positive and directly connected to the new source node, The remaining nodes are divided into a new area, and within the new area, the node whose coordinates are positive and directly connected to the new source node
  • the embodiment of the present invention divides only the nodes other than the source node into four independent regions, the implementation manner of the partitioning with respect to the eight regions of the prior art is simpler.
  • the boundary node is used as the boundary of the region, the source node is updated in real time during the data transmission process, and the region is re-divided based on the new source node.
  • Such a communication method naturally forms. Long-edge priority transmission principle, which can reduce the transmission delay during data transmission, reduce the data transmission link, and save system resources.
  • the embodiment of the present invention further discloses a communication node, and the specific structure thereof is shown in FIG. 12.
  • the communication node in this embodiment may be a node in the Mesh wireless mesh network structure.
  • the structural embodiment of the communication node in the embodiment of the present invention is exemplified in the following with reference to the accompanying drawings.
  • the communication node in this embodiment may include an input device 121, an output device 122, a communication link 123, a transceiver device 124, a memory 125, and a processor 126, where: the input device 121 is used.
  • the input data of the communication node is externally received.
  • the input device 81 according to the embodiment of the present invention may include a keyboard, a mouse, a photoelectric input device, a sound input device, a touch input device, a scanner, and the like.
  • the output device 122 is configured to output output data of the communication node to the outside.
  • the output device 82 described in the embodiments of the present invention may include a display, a speaker, a printer, and the like.
  • the communication link 123 is configured to establish a communication connection between the communication node and other nodes of the Mesh wireless mesh network structure.
  • the communication link 83 described in the embodiment of the present invention may be an example of a propagation medium.
  • the propagation medium can generally embody computer readable instructions, data structures, program modules or other data in the form of a modulated data signal (such as a carrier wave or other transport mechanism).
  • the propagation medium can include wired media, such as a priority network or In a straight line connection, the propagation medium may also include a wireless medium such as sound waves, radio frequency, infrared light, and the like.
  • the transceiver device 124 is configured to communicate with other nodes in the Mesh network through the communication link 123, for example, to send and receive data.
  • the transceiver device 84 can be a transceiver device such as an antenna.
  • the memory 125 is configured to store program data with various functions.
  • the memory 84 of an embodiment of the present invention may be a system memory, such as volatile (such as RAM), non-volatile (such as ROM, flash memory, etc.), or a combination of both.
  • the memory 125 of the embodiment of the present invention may also be an external memory outside the system, such as a magnetic disk, an optical disk, a magnetic tape, or the like.
  • the processor 126 is configured to invoke program data stored in the memory 125, and perform the following operations:
  • Other nodes except the source node in the predetermined node range are divided into four independent regions by the boundary node, and the boundary node is divided into one of two regions bounded by the boundary node.
  • the horizontal distance and the vertical distance of the boundary node to the source node are equal;
  • the region when the region includes a destination node, data is transmitted from the source node to the region, and the first node is directly connected to the source node, and the current node is a node that needs to receive data from the source node;
  • Setting the source node as an origin, the axis of the source node and the first node is a Y axis, and an axis passing through the origin and perpendicular to the Y axis is an X axis, and Y of the first node
  • the coordinates are positive, and the first node is the new source node to perform the following operations:
  • step D when the destination node exists in the remaining nodes in the area after being processed by B and C, transmitting data from the new source node to a node whose Y coordinate is positive and directly connected to the new source node Dividing the remaining nodes into a new area, and in the range of the new area, the node whose Y coordinate is positive and directly connected to the new source node is used as a new source node, and jumps to step A. .
  • the processor 126 invokes program data in the memory 125 to divide other nodes in the predetermined node range except the source node by a boundary node.
  • the demarcation node is divided into regions of the two regions bounded by the demarcation node including destination nodes that need to receive data from the source node.
  • the processor 126 invokes program data in the memory 125.
  • the boundary node is divided into any two regions bounded by the boundary node. In the area.
  • the processor 126 invokes program data in the memory 125.
  • the boundary node is divided into two regions including the boundary node and other boundaries are included. In the area of the node.
  • the processor 126 does not invoke the memory 125 when the region does not include a destination node that needs to receive data from the source node. Program data in to transfer data to the area.
  • an embodiment of the present invention further provides a computer storage medium, where the computer storage medium can store a program, and the program can execute some or all of the steps of the method according to the embodiment of the present invention.
  • the computer storage medium of the embodiment of the present invention includes: RAM, ROM, EEPROM, flash memory, CD-ROM, DVD or other optical storage, magnetic tape, magnetic disk or other magnetic storage, or any other information that can be used for storing information.
  • RAM random access memory
  • ROM read only memory
  • EEPROM electrically erasable programmable read-only memory
  • CD-ROM Compact Disk Read Only Memory
  • DVD digital versatile discs
  • magnetic tape magnetic tape
  • magnetic disk or other magnetic storage or any other information that can be used for storing information.
  • a medium that can be accessed by a computer device It is apparent that the f-port variants do not depart from the spirit and scope of the invention. Therefore, it is intended that the present invention cover the modifications and variations of the invention, and the modifications and variations of the invention are intended to be included.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé de communication et un nœud de communication. Le procédé consiste en ce que : d'autres nœuds dans une plage de nœuds prédéfinie à l'exception d'un nœud source sont divisés en quatre zones indépendantes avec un nœud extrême servant d'extrémité; pour chacune des quatre zones indépendantes, quand un nœud de destination qui doit recevoir des données du nœud source est inclus, les données sont transmises saut par saut en fonction d'un principe de priorité du côté long. Des ressources de système peuvent être économisées au moyen des modes de réalisation selon la présente invention.
PCT/CN2014/083807 2014-08-06 2014-08-06 Procédé de communication point-à-multipoint et nœud de communication sur la base de structure maillée WO2016019527A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2014/083807 WO2016019527A1 (fr) 2014-08-06 2014-08-06 Procédé de communication point-à-multipoint et nœud de communication sur la base de structure maillée
CN201480034143.2A CN105637936B (zh) 2014-08-06 2014-08-06 基于Mesh结构的点对多点通信方法及通信节点

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/083807 WO2016019527A1 (fr) 2014-08-06 2014-08-06 Procédé de communication point-à-multipoint et nœud de communication sur la base de structure maillée

Publications (1)

Publication Number Publication Date
WO2016019527A1 true WO2016019527A1 (fr) 2016-02-11

Family

ID=55263008

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/083807 WO2016019527A1 (fr) 2014-08-06 2014-08-06 Procédé de communication point-à-multipoint et nœud de communication sur la base de structure maillée

Country Status (2)

Country Link
CN (1) CN105637936B (fr)
WO (1) WO2016019527A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10560359B2 (en) 2016-12-23 2020-02-11 Cisco Technology, Inc. Method and device for reducing multicast flow joint latency

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101102272A (zh) * 2007-07-13 2008-01-09 北京航空航天大学 一种路由更新方法
CN101572726A (zh) * 2008-05-01 2009-11-04 英特尔公司 在基于多处理器网格的系统中用于分层路由的方法和装置
US20120002570A1 (en) * 2010-06-30 2012-01-05 Brother Kogyo Kabushiki Kaisha Coordinating and Establishing Communication Networks Between Communication Devices

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101102272A (zh) * 2007-07-13 2008-01-09 北京航空航天大学 一种路由更新方法
CN101572726A (zh) * 2008-05-01 2009-11-04 英特尔公司 在基于多处理器网格的系统中用于分层路由的方法和装置
US20120002570A1 (en) * 2010-06-30 2012-01-05 Brother Kogyo Kabushiki Kaisha Coordinating and Establishing Communication Networks Between Communication Devices

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10560359B2 (en) 2016-12-23 2020-02-11 Cisco Technology, Inc. Method and device for reducing multicast flow joint latency

Also Published As

Publication number Publication date
CN105637936B (zh) 2019-05-28
CN105637936A (zh) 2016-06-01

Similar Documents

Publication Publication Date Title
WO2020156591A1 (fr) Procédé et dispositif de transmission de données multi-liaison, et support d'informations
JP6892445B2 (ja) Ｍ２ｍサービス層のためのクロスリソースサブスクリプション
US9166880B2 (en) Dynamic address assignment for address aggregation in low power and lossy networks
WO2020062959A1 (fr) Procédé et appareil de configuration de données
WO2019062596A1 (fr) Dispositif et procédé de traitement de service basés sur une architecture de service
WO2020093887A1 (fr) Procédé de transmission de données et dispositif pour réseau sur puce (noc) et dispositif électronique
WO2020119523A1 (fr) Procédé et appareil de commutation de canal de réseau, dispositif et support de stockage
TWI721264B (zh) 建立在路由始發節點和路由目的節點之間的雙向路由的方法
WO2018219148A1 (fr) Procédé, dispositif et système de gestion de tranches de réseau de transmission
US9954775B2 (en) Software-defined network (SDN) system using host abstraction, and method for implementing the same
JP7246379B2 (ja) 通信ネットワークにおけるサービス層メッセージテンプレート
WO2020134827A1 (fr) Procédé et appareil de création de voies pour réseau sur puce et dispositif électronique
US20240064611A1 (en) Federated learning method and apparatus applied to mobile communication system, and terminal and medium
WO2016019527A1 (fr) Procédé de communication point-à-multipoint et nœud de communication sur la base de structure maillée
US9036465B2 (en) Hierarchical network with active redundant links
CN107211236B (zh) 服务层的资源链路管理设备及方法
WO2020167738A1 (fr) Réseau maillé étendu
WO2016033809A1 (fr) Procede de communication point a multipoint base sur une structure de maille et nœud de communication
Dolev et al. Empire of colonies self-stabilizing and self-organizing distributed algorithms
CN103595631A (zh) 一种路径建立的方法和装置
US9807203B2 (en) Method and apparatus for content transmission and content reception
WO2020119824A1 (fr) Procédé et appareil de commande de dispositif, nœud de commande, dispositif de réseau, et centre de données
WO2016062071A1 (fr) Procédé, appareil et système de traitement de simultanéité pour une création de service et une découverte par incrément
CN108632824B (zh) 信息传输方法及信息传输装置
WO2015157953A1 (fr) Procédé de communication point vers multi-point à base de structure de maille et nœuds de communication

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14899433

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14899433

Country of ref document: EP

Kind code of ref document: A1