WO2016019527A1

WO2016019527A1 - Point-to-multipoint communication method and communication node based on mesh structure

Info

Publication number: WO2016019527A1
Application number: PCT/CN2014/083807
Authority: WO
Inventors: 袁泉; 郑礼炳
Original assignee: 华为技术有限公司
Priority date: 2014-08-06
Filing date: 2014-08-06
Publication date: 2016-02-11
Also published as: CN105637936B; CN105637936A

Abstract

Provided are a Point-to-Multipoint communication method and a communication node. The method includes that: other nodes in a preset node range except a source node are divided into four independent regions with a boundary node as the boundary; for each region of the four independent regions, when a destination node which needs to receive data from the source node is included, the data are transmitted hop-by-hop according to a long-side priority principle. System resources can be saved by the use of the embodiments of present invention.

Description

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

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, but 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), there are 8 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. The distribution of the destination node, with region 0 and region 1 as an example, determine the distribution of the destination node in region 0 and region 1. When there is a destination node in region 1, the data is transmitted to region 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 with source The node b to which the node a is connected is then hop-by-hop to the 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 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;

For each of the four independent regions, 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 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;

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;

C, when there is a destination node in the region that has the same Y coordinate as 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 jumps to step A; otherwise, no node with the same Y coordinate and negative X coordinate in the region as the new source node does not perform any operating;

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

In combination with the first 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, other nodes except the source node in the predetermined node range are bounded by the demarcation 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. 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, 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.

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 of the third possible embodiments of the first aspect, in a fourth possible embodiment,

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 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; For the origin, 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. a node, 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 new source Node directly connected to the node as a new source node, jump to Step A; otherwise, no operation is performed on the node in the region that has the same Y coordinate as the new source node and the X coordinate is positive; C, when there is a Y with the new source node in the region When 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; otherwise, do not perform any operation on the node in the region that has the same Y coordinate as the new source node and the X coordinate is negative; D, after processing by B and C, the remaining in the region When there is a destination node in the node, 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 Within the new area, the Y coordinate is positive and The new source node directly connected as a new source node, proceeds to step A. In conjunction with the second aspect, in a first possible implementation manner,

When the one of the two areas bounded by the demarcation node includes a destination node that needs to receive data from the source node, 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.

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

When the two regions that are 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: 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 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.

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

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 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;

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:

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;

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

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, 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.

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

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

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 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. After the origin and the axis perpendicular to the Y axis is the X axis, and the Y coordinate of the first node is positive, 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 is negative does not perform any operation; D, when the destination node exists in the remaining nodes in the area after being processed by B and C, the data is transmitted from the new source node to the Y coordinate is positive And the node 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 directly connected to the new source node. 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

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;

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;

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;

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

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;

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

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 the demarcation node. In one of the two regions of the boundary, 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 in the area, ending data transmission to the area; B, when the area exists With the new When the source node has the same Y coordinate and the X coordinate is positive, the data is transmitted from the new source node to the node whose X coordinate is positive and directly connected to the new source node, and then is bounded by the Y axis. And dividing all nodes in the region whose X coordinate is positive into a new region, and in the new region, the node with the X coordinate being positive and directly connected to the new source node is regarded as a new The source node, jumps to step A; otherwise, does not perform any operation on the node in the region that has the same Y coordinate as the new source node and the X coordinate is positive; C, 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 For the boundary, 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 X coordinate No operation is performed for the negative node; D, when the destination node exists in the remaining nodes in the area after being processed by B and C, the data is transmitted from the new source node to the Y coordinate is positive and a node directly connected to the new source node, dividing the remaining node into a new area, and in the new area, the node with the Y coordinate being positive and directly connected to the new source node is regarded 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. 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.

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.

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 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. 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, 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.

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 FIG. 3 and FIG. 4, 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. 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 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.

For example, referring to FIG. 4 and FIG. 6, 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. Referring to Figures 4 and 7, 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. Referring to FIG. 4 and FIG. 8, 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.

Referring to FIG. 6, for the region 1, 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, and 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.

Similarly, referring to FIG. 7, for the area 2, 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, and the axis passing through the origin a and perpendicular to the Υ axis is the X axis, and the coordinate system presented is as shown in FIG. 7 , wherein the Υ coordinate of the first node e is positive. .

Similarly, referring to FIG. 8, for the region 3, 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, and 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.

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. At the destination node, 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 following is a detailed description of how the data in area 1, area 2, and area 3 in Fig. 4 is transmitted to the destination node.

For the area 1, referring to FIG. 6, after determining the destination node b in step S111, 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. 6), taking b as the new source node, since node b is the only one in the region 1 from the source The node a receives the destination node of the data, and therefore, after step S112, step S113 is executed 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 via the embodiment of the present invention.

For the area 2, referring to FIG. 7, after determining that there is a destination node d and a destination node h in the area 2 in 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. 7), and then 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. Similarly, 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. 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. Similarly, there is no destination node in the region 2 that has the same Υ coordinate and a negative X coordinate as the new source node e. Therefore, in 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.

Still referring to FIG. 7, after the processing of steps S114 and S115, the destination node d and the destination node h exist in the remaining nodes (node d, node f, node h) in the area 2, and therefore, 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.

Still referring to FIG. 7, when the area 22 is used as the new area range, and after the node f is the new source node, there is a destination node h having the same Y coordinate and the X coordinate is positive as the new source node f, and then the steps are performed. S114, transmitting 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 (the axis of the node e and f in FIG. 7) All the 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 The node h directly connected to the source node f serves as a new source node, and the process proceeds to step S113. Further, since the new source node h is the only destination node in the area 221, the transmission of the method in the area 221 can be ended. Therefore, it can be seen that the data is successfully transmitted from the source node a to the destination node h.

Similarly, referring to FIG. 7, after the area 22 is taken as a new area range and the node f is used as a new source node, there is a destination node d having the same Y coordinate and the X coordinate being negative as the new source node f. 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. 7) 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. Referring still to FIG. 7, 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.

For region 3, referring to FIG. 8, 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. Similarly, in the region 3, there is no destination node having the same Y coordinate of the new source node k and the X coordinate is positive, and therefore, 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. Similarly, in the region 3, there is also no destination node with the same Y coordinate of the new source node e and a negative X coordinate. Therefore, in step S115, 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.

Still referring to FIG. 8, after the processing in steps S114 and S115, the destination node p and the destination node 1 and the destination exist in the remaining nodes (node node p, node 1, node i, node j) in the area 3 Node i, therefore, performing 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.

Still referring to FIG. 8, when the area 32 is taken as a new area range, after the node 1 is the new source node, there is a destination node p having the same Y coordinate of the new source node 1 and the X coordinate is positive, then the steps are performed. S114, transmitting data from the new source node 1 to a node p whose X coordinate is positive and directly connected to the new source node 1, and then bordered by the Y axis (node a, node k, node in FIG. 8) 1 is located in the axis), all nodes in the region whose X coordinate is positive are divided into a new region 321 , and within the range of the new region 321 , the X coordinate is positive and the new source node 1 The directly connected node p acts as a new source node, and the process goes to step S113; further, since the new source node p is the only destination node in the area 321, the transmission of the method in the area 321 can end, if the node p is not The only destination node in area 321 is then continued in accordance with the method of the embodiment of the present invention. Therefore, it can be seen that the data is successfully passed from the source node a to the destination node.

Similarly, referring to FIG. 8, when the area 32 is taken as a new area range, after the node 1 is regarded as a new source node, there is a destination node i having the same Y coordinate of the new source node 1 and the X coordinate is negative, and then execution is performed. 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. 8) , 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.

It can be seen that, through the method of the embodiment of the present invention, data can be successfully transmitted from the source node to all destination nodes in area 1, area 2, and area 3 in FIG.

Further, 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, and FIG. 10 shows data transmission using the RPM algorithm in the prior art. A complete path schematic.

As shown in FIG. 9 and FIG. 10, for the same destination node (for example, the destination node X, after the method of the embodiment of the present invention, 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. For example, for the destination node s, after passing the method of the embodiment of the present invention, the path passed It is: node 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 transmission path hop count is the same, However, the long-edge priority transmission principle is considered after the method of the present invention, and the delay can be reduced.)

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 (for example, area 4 in Fig. 4, area 3 and area 4 in Fig. 5).

It can be seen from the above that in some feasible method embodiments of the present invention, 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 coordinate is not performing any operation; C, when there is a destination node in the region that has the same Y coordinate and the X coordinate is negative, the data is from the new source. 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. 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 more For the sake of simplicity. 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. 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. As shown in FIG. 11, 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. After the origin and the axis perpendicular to the Y axis is the X axis, and the Y coordinate of the first node is positive, 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. a 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 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.

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 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. 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, 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 0 and node t are divided into area 3.

As a possible implementation, 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 region dividing module 10 divides the boundary node. To any of the two regions bounded by the boundary node. Still referring to FIG. 3 and FIG. 4, 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).

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 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 following is a detailed description of how the transmission module transmits data to the destination nodes in Area 1, Area 2, and Area 3 for the result of the area division of Figure 4.

For the area 1, referring to FIG. 6, after 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. 6), 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 destination node of the data, therefore, 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.

For area 2, referring to FIG. 7, after the transmission module 20 determines that there is a destination node d and a destination node h in the area 2, 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. 7), and then the node e is the new source node because the node e It is not the destination node in Area 2 that only receives data, so Step 8 is not performed. Similarly, 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 does not exist in the region 2 at all. At the node which is the same as the Y coordinate of the new source point e and the X coordinate is positive, therefore, no processing can be performed in the UI transmission module 20. Similarly, there is no destination node in the region 2 that has the same Υ coordinate and negative X coordinate as the new source node e. Therefore, in step C, the transmission module 20 pairs the new source in the region 2. The node c whose node Y has the same Y coordinate and whose X coordinate is negative does not perform any operation, and therefore the node c is not divided into any area block in FIG. Still referring to FIG. 7, after the processing of steps B and C, the destination node d and the destination node h exist in the remaining nodes (node d, node f, node h) in the area 2, therefore, the transmission module 20 performs 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 And the node f whose positive Y coordinate is positive and directly connected to the new source node e is taken as a new source node, and within the range of the area 22, the transmission module 20 jumps to step A. Still referring to FIG. 7, when the area 22 is taken as a new area range, and after the node f is a new source node, there is a destination node h having the same Y coordinate and the X coordinate is positive, and the transmission module is 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. 7) 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. Similarly, referring to FIG. 7, after the transmission module 20 regards the area 22 as a new area range and the node f as a new source node, there is a destination node d having the same Y coordinate of the new source node f and a negative X coordinate. Then, performing step C, transferring data from the new source node f to a negative X coordinate And 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.

For region 3, referring to FIG. 8, after the transmission module 20 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 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); 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 For 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 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. Similarly, there is no destination node in the region 3 that has the same Y coordinate of the new source node k and the X coordinate is positive. Therefore, 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. Similarly, in the region 3, there is also no destination node with the same Y coordinate of the new source node e and a negative X coordinate. Therefore, when the transmission module 20 is 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. Still referring to FIG. 8, after processing through steps B and C, the destination node p and the destination node 1 and the destination node i exist in the remaining nodes (node t, node p, node 1, node i, node j) in the region 3, Therefore, 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. Still referring to FIG. 8, when the area 32 is used as the new area range, after the node 1 is the new source node, there is a destination node p having the same Y coordinate and the X coordinate is positive as the new source node 1, and then the steps are performed. B, transmitting data from the new source node 1 to a node p whose X coordinate is positive and directly connected to the new source node 1, and then bordered by the Y axis (node a, node k, node in Fig. 8) 1 is located in the axis), all nodes in the region whose X coordinate is positive are divided into a new region 321 , and within the range of the new region 321 , the X coordinate is positive and the new source node 1 The directly connected node p acts as a new source node and jumps to step A; further, since the new source node p is the only destination node in the region 321, the transmission of the method in the region 321 can end, if the node p is not For the only destination node in the area 321, the area 321 is further executed in accordance with the method of the embodiment of the present invention. Therefore, it can be seen that the data is successfully transmitted from the source node a to the destination node. Similarly, referring to FIG. 8, when the area 32 is taken as a new area range, after the node 1 is regarded as a new source node, there is a destination node i having the same Y coordinate of the new source node 1 and the X coordinate is negative, and then execution is performed. 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. 8) , 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.

It can be seen that the data can be successfully transmitted from the source node to the area through the method of the embodiment of the present invention. 1. All destination nodes in Area 2 and Area 3.

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

It can be seen that, in an implementation manner of some feasible devices of the present invention, 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 And when 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 jumps to step A; otherwise, the node with the same Y coordinate and positive X coordinate in the region as the new source node No operation is performed; C. when there is a destination node in the region that has the same Y coordinate and the X coordinate is negative, 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; When 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 is taken as a new source node, and the process proceeds to step Α. 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 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.

Correspondingly, the embodiment of the present invention further discloses a communication node, and the specific structure thereof is shown in FIG. 12. In a specific implementation, 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.

Specifically, as shown in FIG. 12, 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. 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 122 is configured to output output data of the communication node to the outside. In the specific implementation, 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. 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 a modulated data signal (such as a carrier wave or other transport mechanism). For example, 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. In a specific implementation, 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. 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 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:

For each of the four independent regions, 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:

A, when the new source node is only one destination node in the area, ending data transmission to the area;

In some possible implementations, when one of the two regions bounded by the demarcation node The area includes a destination node that needs to receive data from the source node, and 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. When there are 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 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 126 invokes program data in the memory 125. 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 any two regions bounded by the boundary node. In the area.

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 126 invokes program data in the memory 125. 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 including the boundary node and other boundaries are included. In the area of the node.

In some possible implementations, for each of the four independent regions, 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.

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

Claims

Rights request

A point-to-multipoint communication method based on a Mesh wireless mesh network structure, characterized in that:

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 If the coordinates are positive, perform the following operations with the first node as the new source node:

C, when there is a same in the region that the Y coordinate of the new source node is the same and the X coordinate is negative Node, transferring data from the new source node to a node whose X coordinate is negative and directly connected to the new source node, and then taking the Y axis as a boundary, and the X coordinate of the region is negative. The node is divided into a new area, and within the new area, 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, A node in the region that has the same Y coordinate as the new source node and a negative X coordinate does not perform any operation;

2. The point-to-multipoint communication method based on Mesh wireless mesh network structure according to claim 1, 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, other nodes except the source node in the predetermined node range are bounded by the demarcation node. When divided into four independent regions, the demarcation node is divided into an area of the two regions bounded by the demarcation node including a destination node that needs to receive data from the source node.

3. The point-to-multipoint communication method based on Mesh wireless 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, the other nodes except the source node in the predetermined node range are bounded by the boundary node as When four independent regions are divided, the boundary node is divided into two regions bounded by the boundary node In any of the areas.

4. The point-to-multipoint communication method based on Mesh wireless mesh network structure according to claim 1, wherein:

The point-to-multipoint communication method based on the Mesh wireless mesh network structure according to any one of claims 1 to 4, characterized in that

6. A communication node, which is a node in a Mesh wireless mesh network structure, and is characterized by:

a transmission module, configured to, for each of the four independent areas, when the area includes a destination node, transfer data from the source node to the area and directly connect to the source node. Point, 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 the origin is The axis perpendicular to the Y axis is the X axis, and the Y coordinate of the first node is positive, then the first node is the new source node to perform the following operations: A, when the new source node is When only one destination node is in the region, the data transmission to the region ends; B, when there is a destination node in the region that has the same Y coordinate and the X coordinate is positive, 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 all nodes in the region whose X coordinate is positive are divided into a new one with the Y axis as a boundary. a region, and within the new region, 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 new source node has the same Y coordinate and the X coordinate is positive No operation is performed; C, when there is a destination node in the region that has the same Y coordinate and the X coordinate is negative, the data is transmitted from the new source node to the X coordinate is negative and a node directly connected to the new source node, and then dividing all nodes in the region whose X coordinate is negative into a new region by using the Y-axis as a boundary, and within the new region, the X is a node whose coordinates are negative and directly connected to the new source node as a new source node, jumps to step A; otherwise, the Y coordinate of the new source node in the region is the same and the X coordinate is negative The node does not perform any operation; D, when the destination node exists in the remaining nodes in the area after being processed by B and C, the data is transmitted from the new source node to the Y coordinate is positive and 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.

7. The communication node according to claim 6, wherein one of two areas bounded by said boundary node includes a destination node that needs to receive data from said source node, said area division The module is specifically configured to divide other nodes except the source node in the predetermined node range, and divide the boundary node into four independent regions, and divide the boundary node into two regions bounded by the boundary node. The inclusion in the area of the destination node that needs to receive data from the source node.

8. The communication node according to claim 6, wherein when the two areas bounded by the boundary node each include a destination node that needs to receive data from the source node, the area division module Specifically, the node other than the source node in the predetermined node range is divided into four independent regions by using the boundary node, and the boundary node is divided into two regions bounded by the boundary node. In any of the areas.

9. 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 division module Specifically, the node other than the source node in the predetermined node range is divided into four independent regions by using the boundary node, and the boundary node is divided into two regions bounded by the boundary node. Already included 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 When the source node receives the destination node of the data, the data is not transmitted to the area.

A communication node, which is a node in a Mesh wireless mesh network structure, comprising: an input device, an output device, a communication link, a transceiver device, a memory, and a processor, wherein: the input device, Input data for receiving an external input to the communication node;

B, when the region has the same Y coordinate as the new source node and the X coordinate is positive a 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 coordinate as a boundary, and making the X coordinate of the region positive 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 node in the region that has the same Y coordinate as the new source node and the X coordinate is positive does not perform any operation;

12. The communication node of 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 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.

13. The communication node of claim 11 wherein:

14. The communication node of claim 11 wherein:

The communication node according to any one of claims 11 to 14, characterized in that

A computer storage medium, characterized in that the computer storage medium can store a program, and the program execution can include some or all of the steps of the method of any one of claims 1-5.