CN115314504A - Data transmission method and firmware upgrading method - Google Patents

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 lines between other nodes and the central node according to the communication success rate between adjacent nodes weight; the line weight is negatively correlated with the communication success rate; the nodes include a central node and other nodes; S200, select other nodes whose line weights between the central node and the central node are greater than the preset weight as nodes to be transmitted; S300, adopt a point-to-point method , transmit the data packet from the central node to the node to be transmitted; S400 , transmit the data packet from the node that has received the data packet to the node that has not received the data packet by means of broadcasting. Using this solution, the global optimal and local optimal methods are fully combined, which improves the data transmission efficiency. In the case of a complex network topology, the data reception of each node in the entire topology can also be quickly completed, effectively improving the number of nodes. communication efficiency between them.

Description

A data transmission method and a firmware upgrade method

technical field

The invention relates to the technical field of data transmission, in particular to a data transmission method and a firmware upgrade method.

Background technique

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

In the existing technology, point-to-point routing and forwarding is usually used to upgrade in turn. Although this method has a high success rate, in the case of a large number of nodes and a complex topology, it is necessary for each node to send its own sub- Nodes complete the transmission of data packets, so there are problems of long time consumption and high waste rate of network efficiency; in addition, the existing technology also transmits data packets through a distributed file distribution mechanism, which often uses flooding The method is broadcast upgrade. Compared with the point-to-point data transmission method, this method can make the data quickly reach the nodes with good communication, but because of the collision and interference caused by flooding, most of the communication links are good. All the nodes have already completed the transmission, but it is still necessary to wait for the nodes with the worst communication to complete the transmission to complete the entire network upgrade; when the collision and interference are too large, it may even cause some important data packets to fail to reach the most needed places, thus As a result, the network-wide upgrade cannot be performed.

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 node communication efficiency in the station area is low, which leads to the low efficiency of firmware upgrade in the station area. Therefore, it is urgent to provide a This method of data transmission can improve the efficiency of data transmission, thereby improving the communication efficiency of nodes. In the case of complex network topology, it can also quickly complete the data reception of each node in the entire topology.

Contents of the invention

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

Basic scheme one provided by the present invention:

A data transmission method, comprising the steps of:

S100, according to the communication success rate between adjacent nodes, wherein the nodes include the central node and other nodes, analyze the line weight between other nodes and the central node; the line weight is negatively correlated with the communication success rate;

S200, screening other nodes with a line weight greater than a preset weight between the central node and the central node as nodes to be transmitted;

S300 uses point-to-point mode to transmit data packets from the central node to the node to be transmitted;

S400: Transmitting the data packets from the nodes that have received the data packets to the nodes that have not received the data packets in a broadcast manner.

Beneficial effect of basic scheme 1: According to the communication success rate between adjacent nodes, analyze the line weight between other nodes and the central node, and the line weight is negatively correlated with the communication success rate, that is, the line between other nodes and the central node The greater the weight, the more difficult it is for the central node to transmit data to other nodes.

In this scheme, the data transmission in the entire topology structure is divided into two stages. In the first stage, the data packet is first transmitted from the central node to other nodes (nodes to be transmitted) with a larger line weight between the central node and the central node. Compared with the method of data transmission using flooding, this method can avoid the collision and interference caused by flooding, which is conducive to improving the data receiving efficiency of nodes with difficult data reception, thus making the nodes with difficult data transmission complete first data reception. In the data transmission process of 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, thus providing a basis for the second stage of data transmission. Foundation. In the second stage of data transmission, the data packet is transmitted from the node that has received the data packet to the node that has not received the data packet by broadcasting, thereby realizing the data reception of each node in the entire topology. Since the first stage has completed the data transmission of nodes with larger line weights, and the nodes with larger line weights often have a large number of nodes with the central node, it is beneficial for further data transmission through these nodes.

Since the data transmission of the node with difficulty in data reception is completed in the first stage, it is avoided that the nodes on the link with difficulty in data transmission cannot receive the data packet, resulting in delaying the time for the entire topology to complete the reception of the data packet; and, In the data transmission process of the first stage, the foundation is laid for the broadcast of data packets, and the number of nodes capable of broadcasting data packets at the same time is increased, thereby effectively shortening the time to complete the data packet reception of each node in the entire topology.

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

Further, S100 includes:

S101, acquiring transmission paths between other nodes and the central node;

S102. Analyze the weights of lines between other nodes and the central node according to transmission paths and communication success rates between adjacent nodes.

Beneficial effects: 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 weight of the line between other nodes and the central node can be analyzed, so that it can be analyzed that each node is in the receiving center How easy it is for a node to transmit data.

Further, S300 includes:

S301. Transmit the data packet from the central node to the node to be transmitted step by step, and the data packet includes a feedback instruction;

S302. After receiving the data packet, the node sends a feedback signal to its parent node;

S303, judging whether the parent node successfully receives the feedback signal; if not, execute S304;

S304, the parent node retransmits the data packet.

Beneficial effects: 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, and retransmit the data packet when the feedback signal is not successfully received, so that Make sure that the nodes on the transmission path successfully received the packet.

Furthermore, S300 also includes:

S305. Obtain the network topology, and adjust the communication success rate between adjacent nodes according to the network topology;

S100, analyzing the weights of lines between other nodes and the central node according to the adjusted communication success rate between adjacent nodes.

Beneficial effects: during the data packet transmission process, each node is disconnected, or the topology of the network changes due to the change of routing selection. Therefore, in this solution, the network topology is obtained, and the connection between adjacent nodes is adjusted according to the network topology. The communication success rate is high, so that the communication success rate is updated with the change of the network topology, which is beneficial to adjust and update the weight of the line when the topology changes due to the change of the node itself, so as to ensure that even if the network topology changes, all lines Nodes with weights greater than the weight threshold are also able to receive packets.

Further, in S303, it is judged whether the parent node successfully receives the feedback signal; if not, execute S305.

Beneficial effects: When the parent node fails to receive the feedback signal, it means that the data transmission between the parent and child nodes is abnormal, so the network topology structure is obtained at this time. Compared with obtaining the network topology structure in real time, using this solution, the system consumes less power and is more efficient. higher.

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

Beneficial effects: the node that has received the data packet sends the data packet to its child nodes in a broadcast manner, and in the process, the surrounding nodes can receive the data packet, thereby maximizing the use of bandwidth and improving transmission efficiency.

Further, S400 includes:

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

S402, the parent node receives the request signal, and judges whether to accept a data packet; if yes, execute S403; if not, execute S404;

S403, broadcast the data packet;

S404, the parent node continues to send the request signal to its parent node until some node has received the data packet; each node broadcasts the data packet sequentially from top to bottom.

Beneficial effects: the child node sends a request signal to the parent node, so that the corresponding parent node broadcasts the data packet. Compared with directly making each node that has received the data packet broadcast the data packet, the power consumption of this scheme is lower. And because the number of nodes sending out broadcasts is reduced, collisions and interferences during data transmission are effectively reduced.

Further, in S300, the adopting a point-to-point manner includes adopting a time division multiple access technology.

Beneficial effects: the time division multiple access technology is adopted, the transmission rate is high, self-adaptive equalization, and the interference between cells is small.

Further, in S400, the broadcasting method includes adopting a carrier sense multiple access technology.

Beneficial effects: the data conflict in the network can be effectively avoided by adopting the carrier sense multiple access technology.

Basic scheme two that the present invention provides:

A firmware upgrade method uses the above data transmission method to transmit firmware data, and performs firmware upgrade after completing the firmware data transmission.

Beneficial effect of basic scheme 2: According to the communication success rate between adjacent nodes, analyze the line weight between other nodes and the central node, and the line weight is negatively correlated with the communication success rate, that is, the line between other nodes and the central node The greater the weight, the more difficult it is for the central node to transmit data to other nodes.

In this scheme, the data transmission in the entire topology structure is divided into two stages. In the first stage, the data packet is first transmitted from the central node to other nodes (nodes to be transmitted) with a larger line weight between the central node and the central node. Thus, the node that makes data transmission difficult completes data reception first. In the data transmission process of 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, thus providing a basis for the second stage of data transmission. Foundation. In the second stage of data transmission, the data packet is transmitted from the node that has received the data packet to the node that has not received the data packet by broadcasting, thereby realizing the data reception of each node in the entire topology.

Since the data transmission of the node with difficulty in data reception is completed in the first stage, it is avoided that the nodes on the link with difficulty in data transmission cannot receive the data packet, resulting in delaying the time for the entire topology to complete the reception of the data packet; and, In the data transmission process of the first stage, the foundation is laid for the broadcast of data packets, and the number of nodes capable of broadcasting data packets at the same time is increased, thereby effectively shortening the time to complete the data packet reception of each node in the entire topology.

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

Description of drawings

FIG. 1 is a block flow diagram of a data transmission method according to an embodiment of the present invention.

FIG. 2 is a schematic diagram of a network topology in a data transmission method according to an embodiment of the present invention.

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

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

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

FIG. 6 is a schematic diagram of point-to-point data transmission in a data transmission method according to an embodiment of the present invention.

FIG. 7 is a schematic diagram of data transmission in broadcast mode in a data transmission method according to an embodiment of the present invention.

Detailed ways

The following is further described in detail through specific implementation methods:

Example 1:

A data transmission method, as shown in Figure 1, comprises the following steps:

S100, according to the communication success rate between adjacent nodes, wherein the nodes include the central node and other nodes, analyze the line weight between other nodes and the central node; the line weight is negatively correlated with the communication success rate, that is, other nodes and the central node The greater the weight of the line between, the more difficult it is for the central node to transmit data to the other node. S100 includes:

S101, acquiring transmission paths between other nodes and the central node;

S102. Analyze the weights of lines between other nodes and the central node according to transmission paths and communication success rates between adjacent nodes. In this example:

W(i,j)=1-SUC(i,j);

Among them, i, j is the number of the node, that is, the terminal device identifier; W(i, j) represents the line weight between node i and node j; SUC(i, j) represents the line weight between node i and node j communication success rate.

When the transmission path between two nodes is not direct, but needs to be forwarded through an intermediate node, for example, node x forwards between node i and node j, then W(i,j)=W(i,x)+W(x ,j); because considering that the route has uplink and downlink, 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 node i and node j, it can be expanded into WT(i,j)=WT(j,i)=W(i,x)+W(x,j)+W(x,i)+ W(j,x).

S200, screening other nodes with a line weight greater than a preset weight between the central node and the central node as nodes to be transmitted;

S300 adopts a point-to-point method to transmit data packets from the central node to the node to be transmitted; in this embodiment, time division multiple access technology is adopted. All nodes can receive data packets, but the broadcast is broadcast with address, 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, the first stage During the data transmission process, the nodes around the data link can also receive some data packets, which improves the data transmission efficiency. S300 includes:

S301. Transmit the data packet from the central node to the node to be transmitted step by step, and the data packet includes a feedback instruction;

S302, after the node receives the data packet, it sends a feedback signal to its parent node; when the node has multiple parent nodes, it sends a feedback signal to the parent node that sent the data packet, and the parent nodes described in S303 and S304 are the same reason;

S303, judging whether the parent node successfully receives the feedback signal; if not, execute S304 and S305; if yes, execute S400;

S304, the parent node retransmits the data packet;

S305. Obtain the network topology, and adjust the communication success rate between adjacent nodes according to the network topology;

So far, the data transmission of the node with difficulty in data reception is completed, therefore, it is avoided that the nodes on the link with difficulty in data transmission cannot receive the data packet, resulting in delaying the time for the entire topology to complete the data packet reception; and, in the first stage In the process of data transmission, it lays the foundation for the broadcast of data packets and increases the number of nodes that can broadcast data packets at the same time, thereby effectively shortening the time to complete the reception of data packets of each node in the entire topology.

S100, analyzing the weights of lines between other nodes and the central node according to the adjusted communication success rate between adjacent nodes.

S400. Transmit the data packet from the node that has received the data packet to the node that has not received the data packet by broadcasting. In this embodiment, a carrier sense multiple access technology is used. Specifically, the node that has received the data packet sends the data packet to its child nodes. S400 includes:

S401, the node that has not received the data packet sends a request signal to its parent node; when the node has multiple parent nodes, a feedback signal is sent to all parent nodes here, and the parent nodes described in S402 and S404 are the same;

S402, the parent node receives the request signal, and judges whether to accept a data packet; if yes, execute S403; if not, execute S404;

S403, broadcast the data packet;

S404, the parent node continues to send the request signal to its parent node until some node has received the data packet; each node broadcasts the data packet sequentially from top to bottom.

So far, the second stage of data transmission has been completed. Using this scheme, the global optimal and local optimal methods can be fully combined to improve the efficiency of data transmission. In the case of complex network topology, the entire topology can also be quickly completed. The data reception of each node in the network effectively improves the communication efficiency between nodes. Taking the field of power line carrier as an example, it improves the communication efficiency between nodes in the station area, thereby improving the firmware upgrade efficiency of the station area. In the case of a complex structure in the station area, the firmware upgrade of the entire station area can also be quickly completed.

Here, take the firmware upgrade of the broadband carrier communication network topology as an example: (in this embodiment, other nodes include relay nodes and terminal nodes)

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

The following model assumptions are made, as shown in Figure 5, the layering of the firmware upgrade from the software should be at the APPLICATION layer, then it is assumed that the complete data packet is initially stored on the central node, and all nodes in the network (including relay nodes and End nodes) do not have any part of the packet. After the networking is completed, the time it takes from the center node to transmit the data packet to the end of the last node having the entire complete data packet is the overall data transmission time. Assuming that the entire data packet is divided into N blocks, each block can be transmitted in a fragment-free information protocol data unit.

Specific steps are as follows:

Obtain the transmission path between other nodes (including relay nodes and terminal nodes) and the central node; analyze the line weight between other nodes and the central node according to the transmission path and the communication success rate between adjacent nodes. As shown in Figure 2, the communication success rate SUC(0,2)=0.8 from the center node CCO to the end node STA2, then the line weight W(0,2)=1-0.8=0.2 between the center node CCO and the end node STA2 .

Select other nodes with a link weight greater than the preset weight between the central node and the central node as nodes to be transmitted. In this embodiment, the preset weight is 0.4; and time division multiple access technology is used to transmit data packets from the central node to the node to be transmitted. As shown in Figure 3, in this data transmission stage, there is a time division multiple access time slot, and the central node sends a data packet including a feedback command to the child node in its own time division multiple access time slot step by step, that is, the data packet The packet needs to specify a child node to reply, so as to ensure that the nodes on the transmission path have successfully received the data packet. During this process, if the parent node does not receive the feedback signal from the child node, it will retransmit the data packet and reacquire the network topology, and update the communication success rate between nodes according to the new network topology to ensure All nodes whose line weights with the central node are greater than the weight threshold obtain the data packets.

As shown in Figure 6, the figure shows that the central node CCO has a data packet of 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. The path uses broadcast , but not all STAs will successfully obtain the data of block0. So far, the first phase of data transmission has been completed. All nodes with difficulty in data transmission and nodes on the transmission path have received the data packet. At this time, some nearby nodes on the transmission path will also receive the data packet. Partial file blocks.

As shown in Figure 7, the time division multiple access technology used 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 shown in Figure 4, local broadcasting is used for mutual transmission. Specifically Yes, the node that has not received the data packet sends a request signal to its parent node; the parent node receives the request signal and judges whether to accept the data packet; if it is, then broadcasts the data packet; Send the request signal until a node has received the data packet. Selective broadcast is used in the process of getting the reply, so that the surrounding nodes can receive the data packet, so that the bandwidth can be maximized and the transmission efficiency can be improved. So far, the data transmission of the second stage ends.

Using this solution, the global optimal and local optimal methods are fully combined, which improves the efficiency of data transmission. In the case of complex network topology, it can also quickly complete the data reception of each node in the entire topology, effectively improving the node communication efficiency between them. Taking the field of power line carrier as an example, it improves the communication efficiency between nodes in the station area, thereby improving the firmware upgrade efficiency of the station area. In the case of a complex structure in the station area, the firmware upgrade of the entire station area can also be quickly completed.

A firmware upgrade method uses the above data transmission method to transmit firmware data, and performs firmware upgrade after completing the firmware data transmission.

The above is only an embodiment of the present invention, and the common knowledge such as the specific structure and characteristics known in the scheme is not described here too much. Those of ordinary skill in the art know all the common technical knowledge in the technical field to which the invention belongs before the filing date or the priority date , can know all the existing technologies in this field, and have the ability to apply conventional experimental methods before this date. Those of ordinary skill in the art can improve and implement this scheme based on their own abilities under the inspiration given by this application. Some typical The known structures or known methods should not be an obstacle for those of ordinary skill in the art to implement the present application. It should be pointed out that for those skilled in the art, under the premise of not departing from the structure of the present invention, several modifications and improvements can also be made, and these should also be regarded as the protection scope of the present invention, and these will not affect the implementation of the present invention. Effects and utility of patents. The scope of protection required by this application shall be based on the content of the claims, and the specific implementation methods and other records in the specification may be used to interpret the content of the claims.

Claims (10)

1. A data transmission method, characterized in that: comprising the following steps: S100, according to the communication success rate between adjacent nodes, wherein the nodes include the central node and other nodes, analyze the line weight between other nodes and the central node; the line weight is negatively correlated with the communication success rate; S200, screening other nodes with a line weight greater than a preset weight between the central node and the central node as nodes to be transmitted; S300 uses point-to-point mode to transmit data packets from the central node to the node to be transmitted; S400: Transmitting the data packets from the nodes that have received the data packets to the nodes that have not received the data packets in a broadcast manner. 2. The data transmission method according to claim 1, characterized in that: S100 comprises: S101, acquiring transmission paths between other nodes and the central node; S102. Analyze the weights of lines between other nodes and the central node according to transmission paths and communication success rates between adjacent nodes. 3. The data transmission method according to claim 2, characterized in that: S300 comprises: S301. Transmit the data packet from the central node to the node to be transmitted step by step, and the data packet includes a feedback instruction; S302. After receiving the data packet, the node sends a feedback signal to its parent node; S303, judging whether the parent node successfully receives the feedback signal; if not, execute S304; S304, the parent node retransmits the data packet. 4. The data transmission method according to claim 3, characterized in that: S300 also includes: S305. Obtain the network topology, and adjust the communication success rate between adjacent nodes according to the network topology; S100, analyzing the weights of lines between other nodes and the central node according to the adjusted communication success rate between adjacent nodes. 5. The data transmission method according to claim 4, characterized in that: in S303, it is judged whether the parent node successfully receives the feedback signal; if not, then execute S305. 6. The data transmission method according to claim 1, characterized in that: in S400, the node that has received the data packet sends the data packet to its child nodes. 7. The data transmission method according to claim 1, characterized in that: S400 comprises: S401, the node that has not received the data packet sends a request signal to its parent node; S402, the parent node receives the request signal, and judges whether to accept a data packet; if yes, execute S403; if not, execute S404; S403, broadcast the data packet; S404, the parent node continues to send the request signal to its parent node until some node has received the data packet; each node broadcasts the data packet sequentially from top to bottom. 8. The data transmission method according to claim 1, characterized in that: in S300, said adopting a point-to-point manner includes adopting time division multiple access technology. 9. The data transmission method according to claim 1, characterized in that: in S400, the broadcasting method includes adopting carrier sense multiple access technology. 10. A firmware upgrade method, characterized in that: the data transmission method according to any one of claims 1-9 is used for firmware data transmission, and the firmware upgrade is performed after the firmware data transmission is completed.

Images