WO2016033809A1

WO2016033809A1 - Mesh structure-based point-to-multipoint communication method and communication node

Info

Publication number: WO2016033809A1
Application number: PCT/CN2014/086053
Authority: WO
Inventors: 袁泉
Original assignee: 华为技术有限公司
Priority date: 2014-09-05
Filing date: 2014-09-05
Publication date: 2016-03-10
Also published as: CN106464594A; CN106464594B

Abstract

Disclosed in the present invention are a point-to-multipoint communication method and a communication node, said method comprising: dividing the nodes other than a source node within a predetermined node range into four independent regions, boundary nodes acting as the boundaries thereof; for each region of the four independent regions, when comprising a target node that needs to receive data from the source node, implementing the following operations in turn: transmitting the data from the source node to a first node in the region that is directly connected to the source node; when the first node is the only target node in the region, finishing the data transmission to said region; when the target node in the region is a node other than the first node, or when the target nodes in the region comprise the first node but also comprise another node, setting the first node as the source node and the region as the predetermined node range, and returning to the first step to execute each aforementioned process in order and according to requirements. The embodiments of the present invention save system resources.

Description

Point-to-multipoint communication method and communication node based on Mesh structure

Technical field

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

Networks On Chip (NoC) is becoming a trend in many nuclear systems. 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. At present, there are many transmission methods for all pairs of points, and there are few transmission methods for point-to-multipoint. The point-to-multipoint transmission method based on Mesh structure in the prior art is a recursive slice single point pair. Recursive Partitioning Multicast (RPM), the main ideas of this method are as follows:

As shown in Figure 1, starting from the source node (the black circle in Figure 1), it is divided into eight initial regions, which are numbered 0, respectively, in the up, down, right, right, and top left, bottom left, top right, and bottom right. -7 (8 dotted lines in Fig. 1), the above 8 areas are grouped by area 1 and area 0, area 2 and area 3, area 4 and area 5, area 6 and area 7, and the grouped areas are judged. For the distribution of destination nodes, use area 0 and area 1 as an example to determine the distribution of destination nodes in area 0 and area 1. When there is a destination node in area 1, the data is transmitted to area 1 and directly connected to the source node. The node is hop-by-hop to the corresponding destination node through the node directly connected to the source node. For example, for the destination node c in the area 1 (the circle with a slash in the figure), the data can be transmitted from the source node a first. Give area 1 and source Node b to which node a is connected, and then b is hop-by-hop to destination node c. For the destination node in the area 0, 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. Thus, 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

In view of this, 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 wired mesh network structure, which may include:

Nodes other than 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 X and the vertical distance Y of the boundary node to the source node are equal;

For each of the four independent regions, when the region includes a destination node that needs to receive data from the source node, the following operations are sequentially performed:

Passing data from the source node to the area and directly connecting the first node to the source node;

Ending data transmission to the area when the first node is the only one of the areas that needs to receive data from the source node;

When the destination node in the area that needs to receive data from the source node is the first node When the other node outside the node or the destination node in the area that needs to receive data from the source node includes the first node but also includes other nodes, the first node is used as a source node, and the area is used as The predetermined node range is returned to other nodes except the source node within the predetermined node range, and the steps are divided into four independent areas by the boundary node, and the above processes are executed sequentially and on demand.

In combination with the first aspect, in a first possible implementation manner,

When one of the two regions bounded by the boundary 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 boundary node. When divided into four independent regions, 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.

In combination with the first aspect, in a second possible implementation manner,

When two regions bounded by the boundary node include a destination node that needs to receive data from the source node, other nodes except the source node in the predetermined node range are divided 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.

In combination with the first aspect, in a third possible implementation manner,

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.

In combination with the first aspect to any one of the third possible implementation manners of the first aspect, in a fourth possible implementation manner,

For each of the four independent regions, when the region does not include a connection from the source node When the destination node of the data is received, data transmission is not performed to the area.

A second aspect of the present invention provides a communication node, which is a source node in a mesh routing 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 X and the vertical distance Y of the boundary node to the node are equal;

a transmission module, configured to: for each area of the four independent areas, when the area includes a destination node that needs to receive data from the local node, the data is transmitted from the local node to the area and directly connected to the local node. Nodes.

In conjunction with the second aspect, in a first possible implementation manner,

When one of the two regions bounded by the boundary node includes a destination node that needs to receive data from the source node, the region dividing module is specifically configured to: except for the source node in a predetermined node range The other nodes are divided into four independent regions by a boundary node, and the boundary nodes are divided into two destinations that are bounded by the boundary node and include destination nodes that need to receive data from the source node. In the area.

In conjunction with the second aspect, in a second possible implementation manner,

When the two regions bounded by the demarcation node include a destination node that needs to receive data from the source node, the region dividing module is specifically configured to: other than the source node in the predetermined node range. 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.

In combination with the second aspect, in a third possible implementation manner,

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 division module is specifically configured to: except for the source node in a predetermined node range 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.

With reference to any one of the second aspect to the third possible implementation manner of the second aspect, in a fourth possible implementation manner,

The transmission module is further configured to: 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 not performed to the area.

A third aspect of the present invention provides a communication node, which is a source node in a Mesh wired 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 wired mesh network structure;

The transceiver device is configured to communicate with other nodes of the Mesh wired mesh network structure through the communication link;

The memory for storing 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:

When the destination node in the area that needs to receive data from the source node is a node other than the first node or a destination node in the area that needs to receive data from the source node, includes the first one When the node further includes other nodes, the first node is used as a source node, and the area is regarded as a predetermined node range, and is returned to other nodes except the source node within a predetermined node, bounded by the boundary node. The steps of dividing into four separate areas perform the above processes in sequence and on demand.

In combination with the third aspect, in a first possible implementation manner,

When one of the two regions bounded by the demarcation node includes a destination node that needs to receive data from the source node, the processor invokes program data in the memory to divide the source node within a predetermined node range And other nodes other than the boundary node are divided into four independent regions, and the boundary node is divided into the two regions bounded by the boundary node, including the source node from the source node In the area of the destination node that receives the data.

In conjunction with the third aspect, in a second possible implementation manner,

When 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 a boundary node, and the boundary nodes are divided into any one of two regions bounded by the boundary node.

In combination with the third aspect, in a third possible implementation manner,

When 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 regions in the two regions bounded by the boundary nodes that have already included other boundary nodes.

With reference to any one of the third aspect to the third possible implementation manner of the third aspect, in a fourth possible implementation manner,

For each of the four independent regions, when the region does not include a destination node that needs to receive data from the source node, the processor does not invoke program data in the memory to perform the region data transmission.

A fourth aspect of the present invention provides a computer storage medium, which may store a program, which may include some or all of the steps of the method according to the embodiment of the present invention.

It can be seen from the above that in some feasible implementation manners of the present invention, 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 In one of the two regions in which the boundary node is bounded, the horizontal distance X and the vertical distance Y of the boundary node to the source node are equal; for each of the four independent regions, when When the area includes a destination node that needs to receive data from the source node, the following operations are sequentially performed: transferring data from the source node to the area and directly connecting the first node to the source node; when the first node When the node is the only one of the areas that needs to receive data from the source node, the data transmission to the area ends; when the destination node in the area needs to receive data from the source node is the Other nodes other than a node or the area to be received from the source node When the destination node of the data includes the first node but also includes other nodes, the first node is used as a source node, and the area is regarded as a predetermined node range, and is returned to be within a predetermined node range except the source node. The other nodes are divided into four separate areas by the boundary nodes, and the above processes are executed sequentially and on demand. 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. At the same time, in the embodiment of the present invention, when dividing four regions, the boundary node is used as the boundary of the region, the source node is updated in real time during the process of transmitting data, and the four regions are re-divided based on the new source node. Such a communication method is natural. A long-edge priority transmission principle is formed, which can reduce transmission delay in data transmission, reduce data transmission links, and save system resources.

DRAWINGS

1 is a schematic diagram of area division centered on a source node in a Mesh structure in the prior art;

2 is a schematic flow chart of an embodiment of a point-to-multipoint communication method based on a Mesh structure according to the present invention;

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;

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;

5 is a schematic diagram showing a result of region division centered on a source node according to another embodiment of the Mesh structure in the present invention;

6 is a schematic diagram of a process transmission path of data transmission in the present invention;

7 is a schematic diagram of another process transmission path of data transmission in the present invention;

8 is a schematic diagram showing another embodiment of a region division centered on a source node in a Mesh structure according to the present invention;

9 is a schematic diagram of another process transmission path of data transmission in the present invention;

10 is a schematic diagram of another process transmission path of data transmission in the present invention;

11 is a schematic diagram of another process transmission path of data transmission in the present invention;

12 is a schematic diagram showing another embodiment of a region division centered on a source node in a Mesh structure according to the present invention;

13 is a schematic diagram of another process transmission path of data transmission in the present invention;

14 is a schematic diagram of another process transmission path of data transmission in the present invention;

FIG. 15 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.

16 is a schematic diagram of a complete data transmission path of an embodiment of a prior art RMP communication method;

17 is a schematic structural diagram of an embodiment of a communication node according to the present invention;

FIG. 18 is a schematic structural diagram of another embodiment of a communication node according to the present invention.

Specific embodiment

2 is a schematic flow chart of an embodiment of a point-to-multipoint communication method based on a Mesh wired 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, and the boundary node is divided into two regions bounded by the boundary node. The horizontal distance X and the vertical distance of the boundary node to the source node in an area Equal to Y.

Taking FIG. 3 as an example, 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 b, node d, node n, node h, node i, node l, node p. The circle through which the dotted line passes is a demarcation node, including node e, node g, node j, node o, The node t and the node m are divided into four nodes in the predetermined node range except the source node by the intersection line formed by the node e, the node g, the node j, the node o, the node t, and the node m. Independent regions, namely, region 1, region 2, region 3, and region 4, wherein the boundary node e, the node g, the node j, the node o, the node t, and the node m can be divided to be bounded by the boundary node In one of the two regions. For example, the node e can be divided into the area 1 or the area 2, the node g, the node f can be divided into the area 2 or the area 3, the node o, the node t can be divided into the area 3 or the area 4, and the node m can be divided into In area 4 or area 1.

As a possible implementation manner, in a specific implementation, when one of the two regions bounded by the boundary node includes a destination node that needs to receive data from the source node, 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. For example, referring to FIG. 3 and FIG. 4 simultaneously, 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 o and node t are divided into area 3.

As a possible implementation manner, in a specific implementation, 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. Still referring to Figure 3 and referring to Figure 4, section Point 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, 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. 4, the area is divided into the area 2 as a 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).

As a possible implementation manner, in a specific implementation, when two destinations bounded by the boundary node do not include a destination node that needs to receive data from the source node, 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. 5, the destination node is not included in the area 3 and the area 4 in which the node o and the node t are demarcated nodes. If the node o has been divided into the area 3, the node t is also divided into the area 3, In order to maintain the unity of the two.

Step S111, for each of the four independent areas, when the area includes a destination node that needs to receive data from the source node, step S112-step S114 is sequentially performed.

Step S112, transmitting data from the source node to the area and directly connecting the first node to the source node;

Step S113, when the first node is the only one of the areas that needs to receive data from the source node, ending data transmission to the area;

Step S114, when the destination node in the area that needs to receive data from the source node is a node other than the first node or a destination node in the area that needs to receive data from the source node, When the first node but other nodes are included, the first node is taken as the source node, and the area is taken as the predetermined node range, and the process returns to step S110.

Take the area distribution of Figure 4 and the distribution of destination nodes as an example, where area 1, area 2, area Each of the three includes a destination node. Therefore, the embodiment of the present invention may need to perform steps S112-S114 for the area 1, the area 2, and the area 3.

The following describes in detail how the data in Area 1, Area 2, and Area 3 are transmitted to the destination node in detail.

For area 1, referring to FIG. 6, after determining that there is a destination node b in step S111, step S112 is performed to transfer data from the source node a to the area and directly connect the first node b to the source node ( The transmission path is as shown by the arrow in the figure; since the node b is the only destination node in the area 1 that needs to receive data from the source node a, step S113 is performed after step S112, and the data for the area 1 is ended. transmission. 4 and 6, the data has been successfully transmitted to the destination node in the area 1 through the embodiment of the present invention.

For area 2, referring first to FIG. 7, after determining that there is a destination node d and a destination node h in the area 2 in step S111, step S112 is performed, and data is transmitted from the source node a to the area 2 directly to the The source node a is connected to the first node e (the transmission path is as indicated by the arrow of the node a pointing to the node e in the figure); for the area 2, since the destination node included is the node other than the node e, the steps are continued. S114, the first node e is used as a source node, and the area 2 is used as a predetermined node range, and the process returns to step S110. With reference to FIG. 8, after the area 2 is taken as the predetermined node range and the node e is used as the source node, the embodiment of the present invention divides the area 2 into the area 21 and the area 22 again according to the division method required by the embodiment of the present invention, because There are no other nodes on the left and the bottom of the node e. Therefore, after the area 2 is further divided according to the step S110, the area 21 and the area 22 are included. With further reference to FIG. 9, for region 2, it is determined in step S111 that there is a destination node d and a destination node h in the region 22 that need to receive data from the source node e, and therefore, in step S112, data is transmitted from the source node e. Directly connecting the area to the source node e. a node f (the transmission path is as indicated by the arrow of the node e in the figure f); further, since the destination node included in the area 22 is a node other than the node f, the process proceeds to step S114, and the first The node f serves as a source node, and the area 22 is taken as a predetermined node range, and the flow returns to step S110. With further reference to FIG. 10, when the area 22 is taken as the predetermined node range, the node f is taken as the source node, the area 22 is further divided into the area 221 and the area 222, and further, step S111 is continued, when it is determined in the step S111 that the area 221 has After the destination node d, for the region 221, step S112 is performed, and data is transmitted from the source node f to the region 221 to directly connect with the source node f to the first node d (the transmission path is as shown in the figure f to the node As indicated by the arrow of d, since the node d is the only destination node in the area 221 that needs to receive data from the source node f, step S113 is performed after step S112, and data transmission to the area 221 is ended. Referring to FIG. 10, after the embodiment of the present invention, data has been successfully transmitted to the destination node in the area 221. Similarly, after it is determined in step S111 that there is a destination node h in the area 222, step S112 is continued for the area 222, and data is transmitted from the source node f to the area 222 to be directly connected to the source node f. The node h (the transmission path is as shown by the arrow of the node f in the figure h), since the node h is the only one of the areas 222 that needs to receive data from the source node f, therefore, step S113 is performed after step S112. Ending the data transfer to the area 222. Referring to FIG. 10, after the embodiment of the present invention, data has been successfully transmitted to the destination node in the area 222.

For the area 3, referring first to FIG. 11, after determining that there is the destination node p and the destination node 1 and the destination node i in the area 3 in step S111, step S112 is performed to transfer data from the source node a to the area 3. Directly connected to the source node a 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); for the region 3, since the destination node included is a node other than the node k, , proceeding to step S114, using the first node k as a source node, The area 3 is taken as a predetermined node range, and the flow returns to step S110. With reference to FIG. 12, after the area 3 is taken as the predetermined node range and the node k is used as the source node, the embodiment of the present invention divides the area 3 into the area 31 and the area 32 and the area 33 again according to the division method required by the embodiment of the present invention. Because there is no other node on the node k, after the region 3 is further divided according to the step S110, only the region 31 and the region 32 and the region 33 are included, instead of the four regions. With further reference to FIG. 13, for region 3, it is determined in step S111 that there is a destination node p, node 1, and node i in the region 32 that need to receive data from the source node k, and therefore, in step S112, data is taken from the source node. k is transmitted to the area 32 directly to the source node k to be connected to the first node 1 (the transmission path is as indicated by the arrow of the node k pointing to the node 1 in the figure); further, since the destination node included in the area 32 is other than l Further, the node p and the node i are further included. Therefore, the step S114 is continued, the first node 1 is used as the source node, and the area 32 is taken as the predetermined node range, and the process returns to step S110. With further reference to FIG. 14, when the area 32 is taken as the predetermined node range, the node 1 is taken as the source node, the area 32 is further divided into the area 321 and the area 322, and further, the step S111 is continued, when it is determined in the step S111 that the area 321 has After the destination node i, for the region 321 , step S112 is performed, and data is transmitted from the source node 1 to the region 321 and directly connected to the source node 1 to be connected to the first node i (the transmission path is as shown in the figure. As indicated by the arrow of i, since node i is the only one of the areas 321 that needs to receive data from the source node 1, step S113 is performed after step S112, and data transmission to the area 221 is ended. Referring to Figure 14, the data has been successfully transmitted to the destination node in area 321 via the embodiment of the present invention. Similarly, after it is determined in step S111 that there is a destination node p in the area 322, step S112 is continued for the area 322, and data is transmitted from the source node 1 to the area 322 to be directly connected to the source node 1 first. Node p (transport path as indicated by the arrow of node l pointing to node p), due to node p It is the only one of the areas 322 that needs to receive data from the source node 1. Therefore, step S113 is performed after step S112, and the data transmission to the area 322 is ended. Referring to FIG. 14, it can be seen that data has been successfully transmitted to the destination node in area 322 via the embodiment of the present invention.

Further, FIG. 15 and FIG. 16 respectively show schematic diagrams of paths for data transmission using the Mesh structure-based point-to-multipoint communication method according to an embodiment of the present invention, and a data transmission path diagram using the RPM algorithm in the prior art. As shown in FIG. 15 and FIG. 16 , for the same destination node (for example, the destination node x, after the method of the embodiment of the present invention is adopted, the path that passes is node a-node b-node c-node x, and the prior art is adopted. The path through which the RPM algorithm passes is a node a-node t-node v-node x, which is one more hop than the present invention. For example, for the destination node s, after the method of the embodiment of the present invention is adopted, the path that passes is: A-node t-node u-node s, and the path that the prior art RPM algorithm passes is node a-node n-node r-node s. After comparison, although the number of hops of the transmission path is the same, the present invention is adopted. The method then considers the long-edge priority transmission principle and can reduce the delay.)

In a specific implementation, in other embodiments of the present invention, 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.

It can be seen from the above that in some feasible implementation manners of the present invention, 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 In one of the two regions in which the boundary node is bounded, the horizontal distance X and the vertical distance Y of the boundary node to the source node are equal; for each of the four independent regions, when When the area includes a destination node that needs to receive data from the source node, the following operations are sequentially performed: the data is transmitted from the source node to the area, and the first node is directly connected to the source node; When the first node is the only one of the areas that needs to receive data from the source node, end the data transmission to the area; when the area needs to receive data from the source node When the node is a node other than the first node or a destination node in the area that needs to receive data from the source node includes the first node but also includes other nodes, the first node is As the source node, the region is regarded as a predetermined node range, and is returned to other nodes except the source node within the predetermined node range, and the steps of dividing into four independent regions by the boundary node are performed sequentially and on demand. Each process. 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. At the same time, in the embodiment of the present invention, when dividing four regions, the boundary node is used as the boundary of the region, the source node is updated in real time during the process of transmitting data, and the four regions are re-divided based on the new source node. Such a communication method is natural. A long-edge priority transmission principle is formed, which can reduce transmission delay in data transmission, reduce data transmission links, and save system resources.

Correspondingly, the embodiment of the present invention further provides a schematic diagram of a functional structure and a hardware structure of a communication node that can be used to implement the foregoing method of the present invention.

FIG. 17 is a schematic diagram showing the functional structure of an embodiment of a communication node according to the present invention. As shown in FIG. 17, the communication node in the embodiment of the present invention may include a region dividing module 10 and a transmission module 20, where:

The area dividing module 10 is configured to divide other nodes except the local node in the predetermined node range by the boundary node into four independent areas, and the dividing node is divided into two by the boundary node. In one of the regions, the horizontal distance X and the vertical distance Y of the boundary node to the local node are equal.

The transmission module 20 is configured to: for each region of the four independent regions divided by the region dividing module 10, when the region includes a destination node that needs to receive data from the node, the data is transmitted from the node The first node is directly connected to the local area of the node.

Taking FIG. 3 as an example, 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 b, node d, node n, node h, node i, node l, node p. The circle through which the dotted line passes is a demarcation node, including node e, 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 be within a predetermined node by a cross line formed by the node e, the node g, the node j, the node o, the node t, and the node m. The 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 e, node g, node j, node o, node t, and node m It may be divided into one of two regions bounded by the boundary node. For example, the node e can be divided into the area 1 or the area 2, the node g, the node f can be divided into the area 2 or the area 3, the node o, the node t can be divided into the area 3 or the area 4, and the node m can be divided into In area 4 or area 1.

As a possible implementation manner, in a specific implementation, when one of the two regions bounded by the boundary node includes a destination node that needs to receive data from the source node, 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. For example, referring to FIG. 3 and FIG. 4 simultaneously, 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, When 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. Based on the same division rule, node o and node t are divided into area 3.

As a feasible implementation manner, in a specific implementation, when two regions are bounded by the boundary node The domain includes a destination node that needs to receive data from the source node, and the region dividing module 10 divides the boundary node into any one of two regions bounded by the boundary node. Still referring to FIG. 3 and FIG. 4, node c is a demarcation node of region 1 and region 2, wherein region 1 includes a destination node b, and region 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 a 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).

As a possible implementation manner, in a specific implementation, 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 divides the boundary node. To the area where the other boundary nodes are already included in the two areas bounded by the boundary node. For example, referring to FIG. 5, the destination node is not included in the area 3 and the area 4 in which the node o and the node t are demarcated nodes. If the node o has been divided into the area 3, the node t is also divided into the area 3, In order to maintain the unity of the two.

In a specific implementation, for each of the four independent regions that are divided, when the region further includes a destination node that needs to receive data from the source node, the method according to the embodiment of the present invention may be sequentially performed. Step S112 - step S114.

Step S114, when the destination node in the area that needs to receive data from the source node is the When the other node other than one node or the destination node in the area that needs to receive data from the source node includes the first node but also includes other nodes, the first node is used as a source node. The area is referred to as a predetermined node range, and the flow returns to step S110.

Thus, embodiments of the invention may include multiple source nodes.

Taking the area distribution of FIG. 4 and the distribution of the destination node as an example, the destination node is included in the area 1, the area 2, and the area 3. Therefore, the embodiment of the present invention may need to perform steps for the area 1, the area 2, and the area 3. S112-S114, and the source node that may appear in the embodiment of the present invention may include a node e, a node f, a node k, a node l, and the like in addition to the node a. Therefore, the source nodes may include: a region dividing module 10, configured to divide other nodes in the predetermined node range except the local node into four independent regions by using the boundary node as a boundary, and the dividing node is divided into four In one of the two regions bounded by the boundary node, the horizontal distance X and the vertical distance Y of the boundary node to the local node are equal.

The transmission module 20 is configured to transmit, for each region of the four independent regions divided by the region dividing module 10, the data from the local node to the region when the region includes a destination node that needs to receive data from the local node. Connect the first node directly to this node.

For area 1, referring to FIG. 6, after the transmission module 20 of the source node a determines that there is a destination node b in the area 1, the data is transmitted from the source node a to the area and directly connected to the source node. Node b (the transmission path is shown by the arrow in the figure); since node b is the only destination node in area 1 that needs to receive data from the source node a, the data transmission to the area 1 can be ended subsequently. 4 and 6, the data has been successfully transmitted to the destination node in the area 1 through the embodiment of the present invention.

Further, referring to FIG. 7, when the transmission module 20 of the source node a determines the destination node d in the area 2 And after the destination node h, the data is transmitted from the source node a to the area 2 and directly connected to the source node a by the first node e (the transmission path is as indicated by the arrow of the node a pointing to the node e in the figure); For Region 2, since the destination node it includes is a node other than Node e, the first node e in Region 2 will be the new source node. With further reference to FIG. 8, when the area 2 is the predetermined node range and the node e is the source node, the area dividing module 10 of the source node e is used to divide the area 2 into the area 21 and the area 22 because the node e has no left side or below. Other nodes, therefore, after re-zoning the area 2, only the area 21 and the area 22 are included. With further reference to FIG. 9, for the area 2, the transmission module 20 of the node e can determine that there is a destination node d and a destination node h in the area 22 that need to receive data from the source node e, and therefore, the transmission module 20 of the node e takes the data from the location The source node e is transmitted to the area 22 and directly connected to the source node e by the first node f (the transmission path is as indicated by the arrow of the node e pointing to the node f in the figure); further, because the destination node included in the area 22 It is a node other than the node f, and therefore, the first node f will be the new source node, and the area 22 will be the predetermined node range. With further reference to FIG. 10, after the region 22 is taken as the predetermined node range and the node f is used as the source node, the region dividing module 10 of the node f divides the region 22 into the region 221 and the region 222, and further, when the transmission module 20 of the node f determines After the destination node d in the outbound area 221, the data is transmitted from the source node f to the area 221 and directly connected to the source node f by the first node d (the transmission path is as shown by the node f pointing to the node d). As shown, since the node d is the only destination node in the area 221 that needs to receive data from the source node f, the transmission module 20 of the node f ends the data transmission to the area 221. Referring to FIG. 10, after the embodiment of the present invention, data has been successfully transmitted to the destination node in the area 221. Similarly, after the transmission module 20 of the node f determines that there is a destination node h in the area 222, for the area 222, the node f transmits data from the source node f to the area 222 and directly connects with the source node f. Node h The transmission path is as shown by the arrow pointing to the node h in the node f. Since the node h is the only destination node in the area 222 that needs to receive data from the source node f, the node f ends the data on the area 222. transmission. Referring to FIG. 10, after the embodiment of the present invention, data has been successfully transmitted to the destination node in the area 222.

For region 3, first referring to FIG. 11, after the transmission module 20 of the source node a determines 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 connected to the source node a 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); for the region 3, since the destination node included is a node other than the node k, The first node k will act as a new source node, and the region 3 will serve as a predetermined node range. With further reference to FIG. 12, when the region 3 is taken as the predetermined node range and the node k is taken as the source node, the region dividing module 10 of the node k divides the region 3 into the region 31 and the region 32 and the region 33 because there is no other node k The node, therefore, after re-zoning the area 3, only the area 31 and the area 32 and the area 33 are included, instead of the four areas. With further reference to FIG. 13, for region 3, the transmission module 20 of the node k can determine that there is a destination node p, a node l and a node i in the region 32 that need to receive data from the source node k, and therefore, the transmission module 20 of the node k will data. From the source node k to the region 32, the first node 1 is directly connected to the source node k (the transmission path is as indicated by the arrow of the node k pointing to the node 1 in the figure); further, due to the purpose of the region 32 The node, in addition to l, also includes node p and node i, so that the first node 1 will act as a new source node and the region 32 will serve as a new predetermined node range. With further reference to FIG. 14, when the area 32 is used as the predetermined node range and the node 1 is used as the source node, the area dividing module 10 of the node 1 will further divide the area 32 into the area 321 and the area 322, and further, when the node 1 transmits the module 20, after determining that there is a destination node i in the area 321, and for the area 321, the transmission of the node l The transmission module 20 transmits data from the source node 1 to the area 321 and directly connects to the source node 1 with the first node i (the transmission path is as indicated by the arrow of the node 1 pointing to the node i), because the node i It is the only destination node in the area 321 that needs to receive data from the source node 1, and therefore, the node 1 ends the data transmission to the area 221. Referring to Figure 14, the data has been successfully transmitted to the destination node in area 321 via the embodiment of the present invention. Similarly, after the transmission module of the node 1 determines that there is a destination node p in the area 322, for the area 322, the transmission module 20 of the node 1 transmits data from the source node 1 to the area 322 directly to the source node 1 Connected to the first node p (the transmission path is as indicated by the arrow pointing to node p in node 1), since node p is the only destination node in area 322 that needs to receive data from the source node 1, therefore, the data is transmitted. After the node p is given, the node 1 ends the data transfer to the area 322. Referring to FIG. 14, it can be seen that data has been successfully transmitted to the destination node in area 322 via the embodiment of the present invention.

In a specific implementation, in other embodiments of the present invention, the transmission module 20 of each source node is also available. 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 not performed to the area.

It can be seen from the above that in some feasible implementation manners of the present invention, 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 In one of the two regions in which the boundary node is bounded, the horizontal distance X and the vertical distance Y of the boundary node to the source node are equal; for each of the four independent regions, when When the area includes a destination node that needs to receive data from the source node, the following operations are sequentially performed: transferring data from the source node to the area and directly connecting the first node to the source node; when the first node When the node is the only one of the areas that needs to receive data from the source node, the data transmission to the area ends; when the destination node in the area needs to receive data from the source node is the The first section other than a node or a destination node in the area that needs to receive data from the source node includes the first node but also includes other nodes As the source node, the region is regarded as a predetermined node range, and is returned to other nodes except the source node within the predetermined node range, and the steps of dividing into four independent regions by the boundary node are performed sequentially and on demand. Each process. 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. At the same time, in the embodiment of the present invention, when dividing four regions, the boundary node is used as the boundary of the region, the source node is updated in real time during the process of transmitting data, and the four regions are re-divided based on the new source node. Such a communication method is natural. A long-edge priority transmission principle is formed, which can reduce transmission delay in data transmission, reduce data transmission links, and save system resources.

Correspondingly, the embodiment of the present invention further discloses a communication node, and the specific structure thereof is shown in FIG. 18. In a specific implementation, the communication node in this embodiment may be a source node in the Mesh wired mesh network structure. Points, for example, source node a in FIG. 4, source node e in FIG. 8, source node f in FIG. 10, source node k in FIG. 12, and source node 1 in FIG. 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.

Specifically, as shown in FIG. 18, the communication node of this embodiment may include an input device 81, an output device 82, a communication link 83, a transceiver device 84, a memory 85, and a processor 86, where:

The input device 81 is configured to receive input data externally input to the communication node. In a specific implementation, 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 82 is configured to output output data of the communication node to the outside. In a specific implementation, the output device 82 described in the embodiment of the present invention may include a display, a speaker, a printer, and the like.

The communication link 83 is configured to establish a communication connection between the communication node and other nodes of the Mesh wired mesh network structure. In a specific implementation, 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 other modulated data signals, such as a carrier wave or other transport mechanism. For example, the communication medium can include wired media, such as a priority network or In a straight line connection, the propagation medium may also include a wired medium such as sound waves, radio frequency, infrared rays, and the like.

The transceiver device 84 is configured to communicate with other nodes in the Mesh network through the communication link 83, for example, to send and receive data. In a specific implementation, the transceiver device 84 can be a transceiver device such as an antenna.

The memory 85 is configured to store program data with various functions. In a specific implementation, 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. In a specific implementation, the present invention is implemented The memory 85 of the example may also be an external memory other than the system, such as a magnetic disk, an optical disk, a magnetic tape, or the like.

The processor 86 is configured to invoke program data stored in the memory 85 and perform the following operations:

In some possible implementations, when one of the two regions bounded by the demarcation node includes a destination node that needs to receive data from the source node, the processor 86 invokes the memory 85 The program data divides the demarcation node into two regions bounded by the demarcation node when the node other than the source node in the predetermined node range is divided by the boundary node into four independent regions. The inclusion in the area of the destination node that needs to receive data from the source node.

In some possible implementations, when both regions bounded by the boundary node are included A destination node that needs to receive data from the source node, the processor 86 calls the program data in the memory 85 to divide other nodes except the source node within a predetermined node range, and divides into four by the boundary node. In the case of an independent region, the boundary node is divided into any one of two regions bounded by the boundary node.

In some possible implementations, when two regions bounded by the demarcation node include a destination node that needs to receive data from the source node, the processor 86 invokes program data in the memory 85. When other nodes except the source node in the predetermined node range are divided into four independent regions by the boundary node, the boundary node is divided into two regions that are bounded by the boundary node, and other boundaries are already included. In the area of the node.

In some possible implementations, for each of the four independent regions, the processor 86 does not invoke the memory 85 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.

In addition, 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. In a specific implementation, 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. A medium that can be accessed by a computer device.

It is apparent that those skilled in the art can make various modifications and variations to the invention without departing 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.

Claims

A point-to-multipoint communication method based on a Mesh wired mesh network structure, comprising:

Nodes other than 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 X and the vertical distance Y of the boundary node to the source node are equal;

For each of the four independent regions, when the region includes a destination node that needs to receive data from the source node, the following operations are sequentially performed:

Passing data from the source node to the area and directly connecting the first node to the source node;

Ending data transmission to the area when the first node is the only one of the areas that needs to receive data from the source node;

When the destination node in the area that needs to receive data from the source node is a node other than the first node or a destination node in the area that needs to receive data from the source node, includes the first one When the node further includes other nodes, the first node is used as a source node, and the area is regarded as a predetermined node range, and is returned to other nodes except the source node within a predetermined node, bounded by the boundary node. The steps of dividing into four separate areas perform the above processes in sequence and on demand.
A point-to-multipoint communication method based on a Mesh wired mesh network structure according to claim 1, wherein:

When one of the two regions bounded by the boundary node includes a destination node that needs to receive data from the source node, the other nodes except the source node within the predetermined node range are demarcated When a node is bounded and divided into four independent regions, the boundary node is divided into an area of the two regions bounded by the boundary node, including a destination node that needs to receive data from the source node.
A point-to-multipoint communication method based on a Mesh wired mesh network structure according to claim 1, wherein:

When two regions bounded by the boundary node include a destination node that needs to receive data from the source node, other nodes except the source node in the predetermined node range are divided 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.
A point-to-multipoint communication method based on a Mesh wired mesh network structure according to claim 1, wherein:

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 point-to-multipoint communication method based on a Mesh wired mesh network structure according to any one of claims 1 to 4, characterized in that

For each of the four independent regions, when the region does not include a destination node that needs to receive data from the source node, no data transmission is performed to the region.
A communication node, which is a source node in a Mesh wired mesh network structure, and includes:

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 X and the vertical distance Y of the boundary node to the node are equal;

a transmission module, configured to: for each area of the four independent areas, when the area includes a destination node that needs to receive data from the local node, the data is transmitted from the local node to the area and directly connected to the local node. Nodes.
The communication node according to claim 6, wherein one of the two regions bounded by said boundary node includes a destination node that needs to receive data from said source node, said region dividing module being specific For dividing, other nodes except the source node in the predetermined node range, by the boundary node, into four independent regions, and dividing the boundary node into two regions bounded by the boundary node It includes an area of a destination node that needs to receive data from the source node.
The communication node according to claim 6, wherein when the two regions bounded by the boundary node each include a destination node that needs to receive data from the source node, the region dividing module is specifically used. Arranging, in addition to the source node, other nodes in the predetermined node range, divided by the boundary node into four independent regions, and dividing the boundary node into any of the two regions bounded by the boundary node In a region.
The communication node according to claim 6, wherein when the two areas bounded by the boundary node do not include a destination node that needs to receive data from the source node, the area dividing module is specifically used. The 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 two regions bounded by the boundary node. In areas with other demarcation nodes.
The communication node according to any one of claims 6 to 9, wherein the transmission module is further configured to: for each of the four independent areas, when the area does not include the When the source node receives the destination node of the data, it does not perform data transmission to the area.
A communication node is a source node in a Mesh wired mesh network structure, and is characterized by comprising: an input device, an output device, a communication link, a transceiver device, a memory, and a processor, wherein:

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 wired mesh network structure;

The transceiver device is configured to communicate with other nodes of the Mesh wired mesh network structure through the communication link;

The memory for storing 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:

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. In the area, the horizontal distance X and the vertical distance Y of the boundary node to the source node are equal;

For each of the four independent regions, when the region includes a destination node that needs to receive data from the source node, the following operations are sequentially performed:

Passing data from the source node to the area and directly connecting the first node to the source node;

Ending data transmission to the area when the first node is the only one of the areas that needs to receive data from the source node;

When the destination node in the area that needs to receive data from the source node is a node other than the first node or a destination node in the area that needs to receive data from the source node, includes the first one When the node further includes other nodes, the first node is used as a source node, and the area is regarded as a predetermined node range, and is returned to other nodes except the source node within a predetermined node, bounded by the boundary node. The steps of dividing into four separate areas perform the above processes in sequence and on demand.
A communication node according to claim 11 wherein:

When one of the two regions bounded by the demarcation node includes a destination node that needs to receive data from the source node, the processor invokes program data in the memory to divide the source node within a predetermined node range And other nodes other than the boundary node are divided into four independent regions, and the boundary node is divided into the two regions bounded by the boundary node, including the source node from the source node In the area of the destination node that receives the data.
A communication node according to claim 11 wherein:

When 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 within a predetermined node range. When other nodes than the node are divided into four independent regions by the boundary node, the boundary node is divided into any one of two regions bounded by the boundary node.
A communication node according to claim 11 wherein:

When 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 regions in the two regions bounded by the boundary nodes that have already included other boundary nodes.
A communication node according to any of claims 11-14, characterized in that

For each of the four independent regions, when the region does not include a destination node that needs to receive data from the source node, the processor does not invoke program data in the memory to perform the region data transmission.
A computer storage medium, characterized in that the computer storage medium can store a program, which, when executed, can include some or all of the steps of the method of any of claims 1-5.