A data transmission method and a firmware upgrade method

Abstract

The present invention relates to the technical field of data transmission, in particular to a data transmission method and a firmware upgrade method. The data transmission method includes the following steps: S100, analyzing the line weights between other nodes and the central node according to the communication success rate between adjacent nodes; the line weight is negatively correlated with the communication success rate; the nodes include a central node and other nodes; S200, screening other nodes with line weights greater than a preset weight between them and the central node as nodes to be transmitted; S300, using a point-to-point method to transmit data packets from the central node to the nodes to be transmitted; S400, using a broadcast method to transmit data packets from the nodes that have received the data packets to the nodes that have not received the data packets. By adopting this solution, the global optimal and local optimal methods are fully combined, improving the data transmission efficiency. In the case of a complex network topology structure, the data reception of each node in the entire topology structure can also be quickly completed, effectively improving the communication efficiency between nodes.

Description

Technical Field

[0001] The present invention relates to the technical field of data transmission, and particularly to a data transmission method and a firmware upgrade method. Background Art

[0002] A network topology refers to the physical layout of interconnecting various devices with transmission media. A network topology usually includes a central node and several other nodes. With the continuous development of the Internet, the network scale is constantly expanding, and the complexity of the network is also continuously increasing. Under this trend, how to complete data reception of each node in the entire topology in a network topology with numerous nodes and complex lines has become a major problem.

[0003] In the prior art, the method of point-to-point routing and forwarding is usually adopted for round-robin upgrades. Although this method has a relatively high success rate, in the case of a large number of nodes and a complex topology, since each node needs to sequentially and one by one complete the transmission of data packets to its child nodes, there are problems of long time consumption and high waste rate of network efficiency. In addition, the prior art also uses a distributed file distribution mechanism for data packet transmission. This method often uses the flooding method for broadcast upgrades. Compared with the point-to-point data transmission method, using this method can make data quickly reach nodes with good communication. However, due to the large collisions and interferences caused by flooding, most nodes with good communication links have already completed transmission, but still need to wait for the nodes with the worst communication to complete transmission to complete the network-wide upgrade. When the collisions and interferences are too large, it may even cause some important data packets not to reach the places where they are most needed, resulting in the inability to perform network-wide upgrades.

[0004] It can be seen from this that in the existing network topology, the communication efficiency between nodes is low. For example, in the field of power line carrier, the communication efficiency of substation area nodes is low, resulting in a relatively low firmware upgrade efficiency of the substation area. Therefore, there is an urgent need to provide a data transmission method that can improve the data transmission efficiency, thereby improving the communication efficiency of nodes, and can quickly complete data reception of each node in the entire topology even in the case of a complex network topology. Summary of the Invention

[0005] The present invention provides a data transmission method and a firmware upgrade method, which can improve the data transmission efficiency, thereby improving the communication efficiency of nodes, and can quickly complete data reception of each node in the entire topology even in the case of a complex network topology.

[0006] The first basic solution provided by the present invention:

[0007] A data transmission method includes the following steps:

[0008] S100. Analyze the line weights between other nodes and the central node according to the communication success rate between adjacent nodes, where the nodes include the central node and other nodes; the line weights are negatively correlated with the communication success rate.

[0009] S200. Screen out other nodes with line weights greater than the preset weight from the central node as nodes to be transmitted.

[0010] S300. Transmit the data packet from the central node to the nodes to be transmitted in a point-to-point manner.

[0011] S400. Transmit the data packet from the node that has received the data packet to the node that has not received the data packet in a broadcast manner.

[0012] Beneficial effects of Basic Solution 1: According to the communication success rate between adjacent nodes, analyze the line weights between other nodes and the central node, and the line weights are negatively correlated with the communication success rate. That is, the greater the line weight between other nodes and the central node, the more difficult it is for the central node to transmit data to this other node.

[0013] In this solution, the data transmission in the entire topology is divided into two stages. In the first stage, first transmit the data packet from the central node to other nodes (nodes to be transmitted) with larger line weights between them and the central node. Compared with the method of using flooding for data transmission, using this method can avoid collisions and interference caused by flooding, which is beneficial to improving the data reception efficiency of nodes with difficult data reception. Thus, the nodes with difficult data transmission complete data reception first. During the data transmission in the first stage, the central node needs to transmit the data packet to the nodes to be transmitted in a point-to-point manner, which will surely make the nodes on its transmission path also receive the data packet, thus laying a foundation for the data transmission in the second stage. In the second stage of data transmission, then use the broadcast method to transmit the data packet from the node that has received the data packet to the node that has not received the data packet, thereby realizing the data reception of each node in the entire topology. Since the data transmission of nodes with larger line weights has been completed in the first stage, and the nodes with larger line weights often have a larger number of nodes between them and the central node, it is beneficial to further transmit data through these nodes.

[0014] Since the data transmission of nodes with difficult data reception is completed in the first stage, therefore, it is avoided that the nodes on the link with difficult data transmission cannot receive the data packet for a long time, resulting in delaying the time for the entire topology to complete the data packet reception; and during the data transmission in the first stage, a foundation for the broadcast of the data packet is laid, increasing the number of nodes that can broadcast the data packet simultaneously, thereby effectively shortening the time for each node in the entire topology to complete the data packet reception.

[0015] In summary, adopting this solution fully combines the global optimal and local optimal methods, improving the data transmission efficiency. Even in the case of a complex network topology structure, it can quickly complete the data reception of each node in the entire topology structure, effectively improving the communication efficiency between nodes. Taking the power line carrier field as an example, it improves the communication efficiency between nodes in the substation area, thereby improving the firmware upgrade efficiency of the substation area. Even in the case of a complex substation area structure, it can quickly complete the firmware upgrade of the entire substation area.

[0016] Further, S100 includes:

[0017] S101, obtaining the transmission path between other nodes and the central node;

[0018] S102, analyzing the line weight between other nodes and the central node according to the transmission path and the communication success rate between adjacent nodes.

[0019] Beneficial effect: According to the transmission path between other nodes and the central node, combined with the communication success rate between adjacent nodes on the transmission path, the line weight between other nodes and the central node is analyzed, so that the difficulty of each node in receiving data transmitted by the central node can be analyzed.

[0020] Further, S300 includes:

[0021] S301, transmitting the data packet from the central node to the node to be transmitted step by step, and the data packet includes a feedback instruction;

[0022] S302, after the node receives the data packet, sending a feedback signal to its parent node;

[0023] S303, determining whether the parent node successfully receives the feedback signal; if not, execute S304;

[0024] S304, the parent node retransmits the data packet.

[0025] Beneficial effect: During the transmission of the data packet, the child node sends a feedback signal to the parent node, so that the parent node can analyze whether the child node successfully receives the data packet according to the feedback signal. When the feedback signal is not successfully received, the data packet is retransmitted, so that the nodes on the transmission path can ensure that the data packet is successfully received.

[0026] Further, S300 further includes:

[0027] S305, obtaining the network topology structure and adjusting the communication success rate between adjacent nodes according to the network topology structure;

[0028] Analyzing the line weight between other nodes and the central node according to the adjusted communication success rate between adjacent nodes.

[0029] Beneficial effects: During the data packet transmission process, there may be situations where nodes drop out of the network, or the topology of the network changes due to changes in routing selection. Therefore, in this solution, the network topology is obtained, and the communication success rate between adjacent nodes is adjusted according to the network topology, so that the communication success rate is updated following the change of the network topology. This is beneficial for adjusting and updating the line weights when the topology changes due to changes in the nodes themselves, so as to ensure that even when the network topology changes, all nodes with line weights greater than the weight threshold can receive data packets.

[0030] Further, in S303, it is determined whether the parent node successfully receives the feedback signal; if not, then S305 is executed.

[0031] Beneficial effects: When the parent node fails to successfully receive the feedback signal, it indicates that there is an abnormality in the data transmission between the parent and child nodes. Therefore, at this time, obtaining the network topology, compared with obtaining the network topology in real time, adopting this solution, the system power consumption is lower and the efficiency is higher.

[0032] Further, in S400, the node that has received the data packet sends the data packet to its child nodes.

[0033] Beneficial effects: The node that has received the data packet sends the data packet to its child nodes in a broadcast manner. During this process, the surrounding nodes can all receive the data packet, thereby maximizing the utilization of the bandwidth and improving the transmission efficiency.

[0034] Further, S400 includes:

[0035] S401, the node that has not received the data packet sends a request signal to its parent node;

[0036] S402, the parent node receives the request signal and determines whether it has received a data packet; if so, then S403 is executed; if not, then S404 is executed;

[0037] S403, broadcast the data packet;

[0038] S404, the parent node continues to send a request signal to its parent node until a node has received the data packet; each node broadcasts the data packet from top to bottom in turn.

[0039] Beneficial effects: By the method of the child node sending a request signal to the parent node, the corresponding parent node broadcasts the data packet. Compared with directly making each node that has received the data packet broadcast the data packet, adopting this solution, its power consumption is lower, and because the number of nodes sending broadcasts is reduced, the collision and interference during the data transmission process are effectively reduced.

[0040] Further, in S300, the use of the point-to-point method includes using time division multiple access technology.

[0041] Beneficial effects: By using the time division multiple access technology, it has a high transmission rate, adaptive equalization, and less interference between cells.

[0042] Further, in S400, the method of using broadcasting includes using the carrier sense multiple access technology.

[0043] Beneficial effects: By using the carrier sense multiple access technology, data conflicts in the network can be effectively avoided.

[0044] The second basic solution provided by the present invention:

[0045] A firmware upgrade method uses the above data transmission method to transmit firmware data and performs firmware upgrade after the firmware data transmission is completed.

[0046] Beneficial effects of the second basic solution: According to the communication success rate between adjacent nodes, analyze the line weights between other nodes and the central node, and the line weights are negatively correlated with the communication success rate, that is, the greater the line weight between other nodes and the central node, the more difficult it is for the central node to transmit data to the other node.

[0047] In this solution, the data transmission in the entire topology is divided into two stages. In the first stage, first transmit the data packet from the central node to other nodes (nodes to be transmitted) with a larger line weight between them and the central node. Thus, the nodes with difficult data transmission complete data reception first. During the data transmission in the first stage, the central node needs to transmit the data packet to the node to be transmitted in a point-to-point manner, which will surely make each node on its transmission path also receive the data packet, thereby laying a foundation for the data transmission in the second stage. In the second stage of data transmission, then use the broadcasting method to transmit the data packet from the nodes that have received the data packet to the nodes that have not received the data packet, thereby realizing the data reception of each node in the entire topology.

[0048] Since the data transmission of the nodes with difficult data reception is completed in the first stage, therefore, it is avoided that the nodes on the link with difficult data transmission cannot receive the data packet for a long time, resulting in delaying the time for the entire topology to complete the data packet reception; and, during the data transmission in the first stage, a foundation for the broadcasting of the data packet is laid, increasing the number of nodes that can simultaneously perform data packet broadcasting, thereby effectively shortening the time for each node in the entire topology to complete the data packet reception.

[0049] In summary, adopting this solution enables the full combination of the global optimal and local optimal methods, improving the data transmission efficiency. Even in the case of a complex network topology structure, it can quickly complete the data reception of each node in the entire topology structure, effectively improving the communication efficiency between nodes. Taking the power line carrier field as an example, it improves the communication efficiency between the nodes in the substation area, thereby improving the firmware upgrade efficiency of the substation area. Even in the case of a complex substation area structure, it can quickly complete the firmware upgrade of the entire substation area. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] Figure 1 is a flowchart of a data transmission method according to an embodiment of the present invention.

[0051] Figure 2 is a schematic diagram of a network topology structure in a data transmission method according to an embodiment of the present invention.

[0052] Figure 3 is a schematic diagram of time division multiple access time slot allocation in a data transmission method according to an embodiment of the present invention.

[0053] Figure 4 is a schematic diagram of carrier sense multiple access time slot allocation in a data transmission method according to an embodiment of the present invention.

[0054] Figure 5 is a schematic diagram of a data link layer service architecture in a data transmission method according to an embodiment of the present invention.

[0055] Figure 6 is a schematic diagram of data transmission in a point-to-point manner in a data transmission method according to an embodiment of the present invention.

[0056] Figure 7 is a schematic diagram of data transmission in a broadcast manner in a data transmission method according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0057] The following is a further detailed description through specific embodiments:

[0058] Embodiment 1:

[0059] A data transmission method, as Figure 1 shown, includes the following steps:

[0060] S100. Analyze the line weight between other nodes and the central node according to the communication success rate between adjacent nodes, where the nodes include the central node and other nodes; the line weight is negatively correlated with the communication success rate, that is, the greater the line weight between other nodes and the central node, the more difficult it is for the central node to transmit data to the other node. S100 includes:

[0061] S101. Obtain the transmission path between other nodes and the central node;

[0062] S102, analyzing the line weights between other nodes and the central node based on the transmission path and the communication success rate between adjacent nodes. In this embodiment:

[0063] W(i, j) = 1 - SUC(i, j);

[0064] Where i, j are the node numbers, i.e., the terminal device identifiers; W(i, j) represents the line weight between node i and node j; SUC(i, j) represents the communication success rate between node i and node j.

[0065] When the transmission path between two nodes is not direct but needs to be forwarded through an intermediate node, for example, node x is forwarded between nodes i and j, then W(i, j) = W(i, x) + W(x, j); because the routing has upstream and downstream, the total WT(i, j) = W(i, j) + W(j, i), so it can be known that WT(i, j) = WT(j, i). If node x is between nodes i and j, then it can be expanded to WT(i, j) = WT(j, i) = W(i, x) + W(x, j) +W(x, i) + W(j, x).

[0066] S200, selecting other nodes whose line weights with the central node are greater than a preset weight as nodes to be transmitted;

[0067] S300, using point-to-point mode, transmits the data packet from the central node to the node to be transmitted; in this embodiment, time division multiple access technology is used, the so-called point-to-point is not point-to-point, but still uses broadcasting for transmission, and the surrounding nodes can receive the data packet, but its broadcast is an address broadcast, that is, the data packet contains the target address, and the node with the target address needs to reply whether it has received the data packet. Therefore, during the first stage of data transmission, the nodes around the data link can also receive some data packets, which improves the data transmission efficiency. S300 includes:

[0068] S301, transmitting a data packet from a central node to a node to be transmitted step by step, wherein the data packet includes a feedback instruction;

[0069] S302, after receiving the data packet, the node sends a feedback signal to its parent node; when the node has multiple parent nodes, the feedback signal is sent to the parent node that sent the data packet, and the same applies to the parent nodes described in S303 and S304;

[0070] S303. Determine whether the parent node has successfully received the feedback signal. If not, execute S304 and S305; if so, execute S400.

[0071] S304. The parent node retransmits the data packet.

[0072] S305. Obtain the network topology structure and adjust the communication success rate between adjacent nodes according to the network topology structure.

[0073] Thus, the data transmission of the nodes with difficult data reception is completed. Therefore, it is avoided that the nodes on the data transmission difficult link cannot receive the data packet for a long time, resulting in delaying the time for the entire topology structure to complete the data packet reception. And, in the data transmission process of the first stage, it lays a foundation for the broadcast of the data packet, increases the number of nodes that can simultaneously perform the data packet broadcast, thereby effectively shortening the time for each node in the entire topology structure to complete the data packet reception.

[0074] Analyze the line weights between other nodes and the central node according to the adjusted communication success rate between adjacent nodes.

[0075] S400. In a broadcast manner, transmit the data packet from the node that has received the data packet to the node that has not received the data packet. In this embodiment, the carrier sense multiple access technology is adopted. Specifically, the node that has received the data packet sends the data packet to its child nodes. S400 includes:

[0076] S401. The node that has not received the data packet sends a request signal to its parent node. When there are multiple parent nodes for this node, a feedback signal is sent to all parent nodes here. The same applies to the parent nodes in S402 and S404.

[0077] S402. The parent node receives the request signal and determines whether it has received a data packet. If so, execute S403; if not, execute S404.

[0078] S403. Broadcast the data packet.

[0079] S404. The parent node continues to send a request signal to its parent node until a node has received the data packet. Each node broadcasts the data packet from top to bottom in turn.

[0080] Thus, the data transmission of the second stage is completed. By adopting this solution, the global optimal and local optimal methods are fully combined, the data transmission efficiency is improved, and in the case of a complex network topology structure, the data reception of each node in the entire topology structure can also be quickly completed, effectively improving the communication efficiency between nodes. Taking the power line carrier field as an example, the communication efficiency between the nodes in the substation area is improved, thereby improving the firmware upgrade efficiency of the substation area. In the case of a complex substation area structure, the firmware upgrade of the entire substation area can also be quickly completed.

[0081] Here, the firmware upgrade of the broadband carrier communication network topology is taken as an example for illustration: (in this embodiment, other nodes include relay nodes and end nodes).

[0082] As Figure 2 shown, the broadband carrier communication network topology is a multi-level associated tree network centered around a central node (denoted as CCO in the figure), with relay nodes (denoted as PCO in the figure, including smart meters or communication units of type I collectors, broadband carrier type II collectors) as relay agents, connecting all end nodes (denoted as STA in the figure, including smart meters or communication units of type I collectors, broadband carrier type II collectors).

[0083] The following model assumptions are made. As Figure 5 shown, the firmware upgrade should be at the APPLICATION layer in terms of software layering. Then, it is assumed that the complete data packet is initially saved above the central node, and none of the nodes in the network (including relay nodes and end nodes) have any part of the data packet. After the network is formed, the time consumed from the start of transmitting the data packet from the central node to the end when the last node has the entire complete data packet is the overall data transmission time. It is assumed that the entire data packet is divided into N blocks, and each block can be transmitted in an information protocol data unit without fragmentation (fragmentation).

[0084] The specific steps are as follows:

[0085] Obtain the transmission paths between other nodes (including relay nodes and end nodes) and the central node; analyze the line weights between other nodes and the central node according to the transmission paths and the communication success rates between adjacent nodes. As Figure 2 shown, the communication success rate SUC(0, 2) from the central node CCO to the end node STA2 is 0.8. Then, the line weight W(0, 2) between the central node CCO and the end node STA2 is 1 - 0.8 = 0.2.

[0086] Select other nodes with line weights greater than the preset weight from the central node as nodes to be transmitted. In this embodiment, the preset weight is 0.4; and the time division multiple access technology is used to transmit the data packet from the central node to the nodes to be transmitted. As Figure 3As shown, in this data transmission phase, there are time division multiple access (TDMA) time slots. Starting from the central node, data packets including feedback instructions are sent to child nodes in their respective TDMA time slots one by one. That is, the data packets need to specify that the child nodes should reply, so as to ensure that the nodes on the transmission path have successfully received the data packets. During this process, if the parent node does not receive the feedback signal replied by the child node, the data packet will be retransmitted, and the network topology structure will be retrieved again. The communication success rate between nodes will be updated according to the new network topology structure to ensure that all nodes with the line weight greater than the weight threshold between them and the central node have received the data packets.

[0087] As Figure 6 shown, the figure exemplifies that the central node CCO has a data packet with 3 blocks. In the first stage, block0 is transmitted to the end node STA whose line weight with the central node is greater than the weight threshold. Broadcasting is used on the path, but not all STAs will successfully obtain the data of block0. Thus, the data transmission in the first stage is completed. All nodes with difficult data transmission and the nodes on their transmission paths have received the data packets. At this time, some nearby nodes on the transmission path have also received some file blocks in the data packets.

[0088] As Figure 7 shown, the time division multiple access technology adopted in the first transmission stage is cancelled, and the carrier sense multiple access technology is used to complete the data transmission of the remaining nodes. As Figure 4 shown, local broadcasting is used for mutual transmission. Specifically, the nodes that have not received the data packets send request signals to their parent nodes; the parent nodes receive the request signals and judge whether they have received the data packets; if so, the data packets are broadcast; if not, the parent nodes continue to send request signals to their parent nodes until some nodes have received the data packets. Selective broadcasting is used during the process of getting replies, so that the surrounding nodes can all receive the data packets, thereby maximizing the utilization of the bandwidth and improving the transmission efficiency. Thus, the data transmission in the second stage ends.

[0089] Adopting this solution fully combines the global optimal and local optimal methods, improves the data transmission efficiency, and can quickly complete the data reception of each node in the entire topology even in the case of a complex network topology structure, effectively improving the communication efficiency between nodes. Taking the power line carrier field as an example, it improves the communication efficiency between the nodes in the substation area, thereby improving the firmware upgrade efficiency of the substation area. Even in the case of a complex substation area structure, it can quickly complete the firmware upgrade of the entire substation area.

[0090] A firmware upgrade method uses the above data transmission method for firmware data transmission and performs firmware upgrade after completing the firmware data transmission.

[0091] The above are only embodiments of the present invention. Common general knowledge such as specific structures and characteristics known in the art are not described in detail herein. Those of ordinary skill in the art know all the general technical knowledge in the technical field to which the invention pertains before the filing date or the priority date, can learn about all the prior art in this field, and have the ability to apply the conventional experimental means before this date. Those of ordinary skill in the art can, under the inspiration given in this application, perfect and implement this solution in combination with their own abilities. Some typical well-known structures or well-known methods should not become an obstacle for those of ordinary skill in the art to implement this application. It should be noted that for those skilled in the art, without departing from the structure of the present invention, several deformations and improvements can still be made, and these should also be regarded as the protection scope of the present invention, and these will not affect the implementation effect of the present invention and the practicality of the patent. The protection scope required by this application should be based on the content of its claims, and the specific implementation manners and the like recorded in the specification can be used to interpret the content of the claims.

Claims

1. A data transmission method, characterized in that: The following steps are involved: S100, analyzing line weights between other nodes and the central node according to a communication success rate between adjacent nodes, wherein the nodes include a central node and other nodes; the line weights are negatively correlated with the communication success rate; S200, selecting other nodes whose line weights with the central node are greater than a preset weight as nodes to be transmitted; S300, using a point-to-point method to transmit the data packet from the central node to the node to be transmitted; The point-to-point method includes the use of time division multiple access technology, point-to-point transmission in the form of selective broadcasting, and all nodes can receive data packets, but the broadcast is an address-broadcast, and the node with the target address needs to reply whether it has received the data packet; S400, using a broadcasting method, the data packet is transmitted from the node that has received the data packet to the node that has not received the data packet, and the node that has completed the transmission becomes the parent node; The S300 includes: S301, transmitting a data packet from a central node to a node to be transmitted step by step, wherein the data packet includes a feedback instruction; S302, after receiving the data packet, the node sends a feedback signal to its parent node; when the node has multiple parent nodes, the feedback signal is sent to the parent node that sent the data packet; S303, determining whether the parent node successfully receives the feedback signal; if not, executing S304 and S305; S304, the parent node retransmits the data packet; S305, obtaining a network topology structure, and adjusting the communication success rate between adjacent nodes according to the network topology structure; wherein the network topology structure is a broadband carrier communication network topology structure; the broadband carrier communication network topology structure is a tree-shaped network with a central node as the center, relay nodes as relay agents, and connecting all terminal nodes in a multi-level associated manner; according to the adjusted communication success rate between adjacent nodes, analyzing the line weights between other nodes and the central node.

2. The data transmission method according to claim 1, wherein: S100 includes: S101, obtaining the transmission path between other nodes and the central node; S102, analyzing the line weights between other nodes and the central node according to the transmission path and the communication success rate between adjacent nodes.

3. The data transmission method according to claim 1, wherein: In S400, the node that has received the data packet sends the data packet to its child node.

4. The data transmission method according to claim 1, wherein: S400 includes: S401, a node that has not received a data packet sends a request signal to its parent node; S402, the parent node receives the request signal and determines whether to accept the data packet; if so, execute S403; if not, execute S404; S403, broadcasting the data packet; S404, the parent node continues to send a request signal to its parent node until a node has received the data packet; each node broadcasts the data packet in sequence from top to bottom.

5. The data transmission method according to claim 1, wherein: In S400, the broadcast method is adopted. Including, using carrier sense multiple access technology.

6. A firmware upgrade method, characterized in that: The data transmission method described in any one of claims 1 to 5 is used to transmit firmware data, and firmware upgrade is performed after the firmware data transmission is completed.

Images