CN114928870A - Data transmission method and device, electronic equipment and storage medium - Google Patents
Data transmission method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114928870A CN114928870A CN202210648847.5A CN202210648847A CN114928870A CN 114928870 A CN114928870 A CN 114928870A CN 202210648847 A CN202210648847 A CN 202210648847A CN 114928870 A CN114928870 A CN 114928870A
- Authority
- CN
- China
- Prior art keywords
- data transmission
- data
- node
- transmission paths
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 301
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000012937 correction Methods 0.000 claims description 14
- 230000006870 function Effects 0.000 claims description 11
- 239000000872 buffer Substances 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 4
- 230000004069 differentiation Effects 0.000 claims description 4
- 238000012546 transfer Methods 0.000 claims description 3
- 238000005265 energy consumption Methods 0.000 abstract description 12
- 230000002035 prolonged effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 10
- 230000009467 reduction Effects 0.000 description 5
- 230000009471 action Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a data transmission method, a data transmission device, an electronic device and a storage medium, wherein the data transmission method comprises the following steps: determining N data transmission paths from an initial node to a destination node, wherein N is an integer greater than or equal to 2, and a transmission node in one data transmission path is not intersected with a transmission node in another data transmission path in the N data transmission paths; determining K data transmission paths required by transmitting a target data packet from the N data transmission paths based on the data transmission rate of each transmission node in the N data transmission paths, wherein K is less than or equal to N, is a positive integer and is greater than or equal to 2; based on K data transmission paths, the energy consumption of each sensor node in the industrial Internet of things can be at least reduced, and therefore the overall service life of the industrial Internet of things is prolonged.
Description
Technical Field
The application relates to the field of industrial internet of things, in particular to a data transmission method and device, electronic equipment and a storage medium.
Background
At present, thousands of sensing nodes are usually needed to realize an intelligent unmanned factory, but because the batteries of the sensing nodes are limited, the batteries are difficult to charge or replace in large-scale deployment, so that reducing the energy consumption of the sensing nodes to prolong the service life of the sensing nodes becomes one of the main targets of the application design of the industrial internet of things
Disclosure of Invention
An object of the embodiments of the present application is to provide a data transmission method, an apparatus, an electronic device, and a storage medium, which are used to reduce energy consumption of each sensor node in an industrial internet of things, so as to improve and reduce the overall life of the industrial internet of things.
To this end, a first aspect of the present application discloses a data transmission method, which is applied to an industrial internet of things, where the industrial internet of things includes a plurality of transmission nodes, and the method includes:
when one of the transmission nodes serves as an initial node and another of the transmission nodes serves as a destination node, determining N data transmission paths from the initial node to the destination node, wherein N is an integer greater than or equal to 2, and the transmission node in one of the data transmission paths in the N data transmission paths is not intersected with the transmission node in the other data transmission path;
determining K data transmission paths required by transmission of target data packets from the N data transmission paths based on the data transmission rate of each transmission node in the N data transmission paths, wherein K is less than or equal to N, is a positive integer, and is greater than or equal to 2;
and transmitting the target data packet based on the K data transmission paths.
In the first aspect of the present application, as an optional implementation manner, the determining N data transmission paths from the starting node to the destination node includes:
acquiring state data of adjacent nodes of each transmission node;
calculating a data transmission cost of the neighboring node based on a data transmission cost function and the state data of the neighboring node;
determining a most preferred neighbor node of the transmitting node based on the data transmission cost of the neighboring node;
determining the N data transmission paths based on a most preferred neighbor node of a plurality of the transmission nodes.
In the first aspect of the present application, as an optional implementation manner, the status data includes remaining energy of the neighboring node, available buffer, and link quality;
and, the data transfer cost function is:
where Cost represents the data transmission Cost of the neighboring node, E r,y Representing the remaining energy of said neighboring nodes, B b,y Available buffer, I, representing said neighboring node i,xy Representing link quality of the neighboring node, a representing weight of a remaining energy value of the neighboring node, β representing weight of an available buffer of the neighboring node, γ representing weight of link quality of the neighboring node, x representing the transmission node, y representing the neighboring node of the transmission node, and Nx representing a node set composed of a plurality of the neighboring nodes.
In the first aspect of the present application, as an optional implementation manner, the calculation formula of the K data transmission paths required for transmitting the target data packet, which is determined from the N data transmission paths based on the data transmission rate of each of the transmission nodes in the N data transmission paths, is:
where K denotes the value of the data transmission path, and α is the weight factor of the energy factor, p i Representing data transmissions for each of said transmission nodesRate of delivery, x α Representing the corresponding bounds for different levels alpha in a standard normal distribution.
In the first aspect of the present application, as an optional implementation manner, the transmitting a destination data packet based on the K data transmission paths includes:
dividing the target data packet into a plurality of data sub-packets with equal data volume;
calculating the end-to-end delay of each data transmission path in the K data transmission paths based on the available bandwidth of each data transmission path in the K data transmission paths and a preset bandwidth delay product;
distributing the plurality of data sub-packets to the K data transmission paths based on an end-to-end delay of each of the data transmission paths to transmit the plurality of data sub-packets through the K data transmission paths.
In the first aspect of the present application, as an optional implementation manner, dividing the target data packet into a plurality of data sub-packets with equal data size includes:
identifying the sensitive type of the data and the priority of a target data packet;
and putting the target data packet into a queuing model based on the priority of the target data packet and the sensitive type of the target data packet, so as to divide the target data packet into the plurality of data sub-packets with equal data volume through differentiation of a first queue and a second queue in the queuing model.
In the first aspect of the present application, as an optional implementation manner, in the allocating, based on an end-to-end delay of each of the data transmission paths, the number of data sub-packets to the K data transmission paths, the method further includes:
calculating an error correction code of each data sub-packet based on the plurality of data sub-packets;
adding an error correction code for each of the data subpackets to the data subpacket.
The second aspect of this application discloses a data transmission device, the industry thing networking is applied to the device, industry thing networking includes a plurality of transmission node, the device includes:
a first determining module, configured to determine N data transmission paths from an originating node to a destination node when one of the transmission nodes serves as the originating node and another one of the transmission nodes serves as the destination node, where N is an integer greater than or equal to 2, and the transmission node in one of the data transmission paths is disjoint from the transmission node in another one of the data transmission paths;
a second determining module, configured to determine, based on a data transmission rate of each transmission node in the N data transmission paths, K data transmission paths required for transmitting a target data packet from the N data transmission paths, where K is smaller than or equal to N, K is a positive integer, and K is greater than or equal to 2;
and the transmission control module is used for transmitting the target data packet based on the K data transmission paths.
A third aspect of the present application discloses an electronic device, including:
a processor; and
a memory configured to store machine readable instructions which, when executed by the processor, perform the data transmission method of the first aspect of the application.
A fourth aspect of the present application discloses a storage medium storing a computer program for executing the data transmission method of the first aspect of the present application by a processor.
Compared with the prior art, the embodiment of the application can select at least two data transmission paths from N data transmission paths capable of transmitting data from the starting node to the destination node, and transmits the target flow based on the at least two data transmission paths, so that the target flow is transmitted through the plurality of data transmission paths, the data transmission quantity of each data transmission node in each data transmission path can be reduced, the energy consumption of the data transmission nodes is further reduced, the load balance among the data transmission nodes is further realized, and finally the reduction of the whole service life of the industrial internet of things caused by the fact that a certain data transmission node is damaged in advance is avoided.
Drawings
To more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments of the present application will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and that those skilled in the art can also obtain other related drawings based on the drawings without inventive efforts.
Fig. 1 is a schematic flow chart of a data transmission method disclosed in an embodiment of the present application;
FIG. 2 is a schematic diagram of a data propagation path disclosed in an embodiment of the present application;
FIG. 3 is a schematic diagram of an error correction code calculation disclosed in an embodiment of the present application;
FIG. 4 is a schematic diagram of a data transmission format between nodes disclosed in an embodiment of the present application;
fig. 5 is a schematic structural diagram of a data transmission device disclosed in an embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device disclosed in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
Example one
Referring to fig. 1, fig. 1 is a schematic flow chart of a data transmission method disclosed in an embodiment of the present application, where the method disclosed in the embodiment of the present application is applied to an industrial internet of things, and the industrial internet of things includes a plurality of transmission nodes. As shown in fig. 1, the method of the embodiment of the present application includes the following steps:
101. when one transmission node in the plurality of transmission nodes is used as an initial node and another transmission node in the plurality of transmission nodes is used as a destination node, N data transmission paths from the initial node to the destination node are determined, wherein N is an integer greater than or equal to 2, and the transmission node in one data transmission path in the N data transmission paths is not intersected with the transmission node in the other data transmission path;
102. determining K data transmission paths required by transmission of a target data packet from the N data transmission paths based on the data transmission rate of each transmission node in the N data transmission paths, wherein K is less than or equal to N, is a positive integer and is greater than or equal to 2;
103. and transmitting the target data packet based on the K data transmission paths.
In the embodiment of the present application, since the embodiment of the present application can select at least two data transmission paths from N data transmission paths capable of transmitting data from an origin node to a destination node, and transmit a target traffic based on the at least two data transmission paths, so that transmitting the target traffic through multiple data transmission paths can reduce the data transmission amount of each data transmission node in each data transmission path, and further reduce the energy consumption of the data transmission nodes, and further achieve load balancing between the data transmission nodes, and finally avoid the reduction of the overall life of the industrial internet of things due to the early damage of a certain data transmission node, for example, if a data transmission path is adopted, each node in the path needs 1S of time, whereas the embodiment of the present application can transmit 6MB of data through 2 or more than 2 data transmission paths, each node in each path only needs 0.5S at most for transmitting data, and the work of each node is continuously reduced, so that the energy consumption of each node can be reduced.
In the embodiment of the application, the industrial internet of things is composed of a plurality of sensors, wherein each sensor is used as a data transmission node, and the plurality of data transmission nodes form a data propagation path. Further, a data propagation path composed of a plurality of data transmission nodes includes an initial node and a destination node, wherein the initial node represents a starting point in the data propagation path, and the destination node represents an end point in the data propagation path.
In the embodiment of the present application, in order to avoid a path of a shared node in multiple data transmission paths, each node in the embodiment of the present application only accepts one message, that is, only accepts a first message and rejects the rest of messages for a node that receives multiple messages, so that a transmission node in one data transmission path in N data transmission paths is disjoint from a transmission node in another data transmission path.
In this embodiment of the present application, as an optional implementation manner, the determining N data transmission paths from the starting node to the destination node in step 201 includes the following sub-steps:
acquiring state data of adjacent nodes of each transmission node;
calculating the data transmission cost of the adjacent node based on the data transmission cost function and the state data of the adjacent node;
determining the most preferable neighbor node of the transmission node based on the data transmission cost of the neighbor node;
n data transmission paths are determined based on the most preferred neighbor nodes of the plurality of transmitting nodes.
In the embodiment of the present application, specifically, each node of the industrial internet of things broadcasts a HELLO message to its neighboring node to obtain state data of the neighboring node, that is, the obtained state data of the neighboring node includes remaining energy, available buffer and link quality, and further, the link quality is expressed as a link SNR (SIGNAL-to-NOISE RATIO) between any node and its neighbor. On the other hand, each node calculates a data transmission cost according to the state data obtained from the neighboring nodes, and calculates the most preferable neighboring node in the direction of the start node through the data transmission cost until the start node, for example, please refer to fig. 2, fig. 2 is a schematic diagram of a data propagation path disclosed in the embodiment of the present application, and as shown in fig. 2, there are two data propagation paths from the SinK node to the Source node.
In this embodiment, it should be noted that the SinK node is a SinK node, and the Source node is an origin node, where when data is transmitted from the SinK node to the Source node, the SinK node is the origin node, and the Source node is a destination node, and when data is transmitted from the Source node to the SinK node, the SinK node is the destination node, and the Source node is the origin node.
Therefore, in the optional embodiment, by acquiring the state data of the adjacent node of each transmission node, the data transmission cost of the adjacent node can be calculated based on the data transmission cost function and the state data of the adjacent node, the most preferable neighbor node of the transmission node can be determined based on the data transmission cost of the adjacent node, and then the N data transmission paths can be determined based on the most preferable neighbor node of the plurality of transmission nodes.
In this embodiment, as an optional implementation manner, the state data includes remaining energy of the neighboring node, an available buffer, and link quality, and the data transmission cost function is:
where Cost represents the data transmission Cost of the neighboring node, E r,y Representing the residual energy of the neighbouring nodes, B b,y Representing available buffers of neighbouring nodes, I i,xy Represents link quality of a neighboring node, α represents weight of a residual energy value of the neighboring node, β represents weight of an available buffer of the neighboring node, γ represents weight of link quality of the neighboring node, x represents a transmission node, y represents a neighboring node of the transmission node, and Nx represents a node set composed of a plurality of neighboring nodes.
In this alternative embodiment, the most preferred neighbor node of the transmitting node can be determined by the data transmission cost function.
In this embodiment, as an optional implementation manner, based on the data transmission rate of each transmission node in the N data transmission paths, the calculation formula of K data transmission paths required for transmitting the target data packet is determined from the N data transmission paths as follows:
where K denotes the value of the data transmission path, and α is the weight factor of the energy factor, p i Representing the data transmission rate, x, of each transmitting node α Representing the corresponding limits of different levels alpha in a standard normal distribution.
In the embodiment of the present application, as an optional implementation manner, the steps of: transmitting a target data packet based on K data transmission paths, comprising the following substeps:
dividing a target data packet into a plurality of data sub-packets with equal data volume;
calculating the end-to-end delay of each data transmission path in the K data transmission paths based on the available bandwidth of each data transmission path in the K data transmission paths and a preset bandwidth delay product;
distributing the plurality of data sub-packets to the K data transmission paths based on the end-to-end delay of each data transmission path to transmit the plurality of data sub-packets through the K data transmission paths.
In this alternative embodiment, the end-to-end delay can be minimized by slicing the data. In this alternative embodiment, the predetermined bandwidth-delay product is a constant.
In the optional embodiment, the target data packet is divided into a plurality of data sub-packets with equal data volume, so that the end-to-end delay of each data transmission path in the K data transmission paths can be calculated based on the available bandwidth of each data transmission path in the K data transmission paths and the preset bandwidth delay product, and then the plurality of data sub-packets are distributed to the K data transmission paths based on the end-to-end delay of each data transmission path, so as to transmit the plurality of data sub-packets through the K data transmission paths.
In the embodiment of the present application, as an optional implementation manner, dividing a target data packet into a plurality of data sub-packets with equal data size includes the following sub-steps:
identifying the sensitive type of the data and the priority of a target data packet;
and putting the target data packet into a queuing model based on the priority of the target data packet and the sensitive type of the target data packet, and dividing the target data packet into a plurality of data sub-packets with equal data volume through differentiation of a first queue and a second queue in the queuing model.
In this alternative embodiment, the sensitive type of data characterizes the sensitivity of the data to delay, for example, the data can be divided into delay sensitive data and non-delay sensitive data, where delay sensitive data refers to data that has a high requirement for delay, for example, if a piece of data requires a delay within 0.02ms to reach a destination node, such data is delay sensitive data, and if a piece of data is delayed by more than 0.02ms, such data is non-delay sensitive data.
In this optional embodiment, further optionally, K data propagation paths may be allocated based on the amount of late-sensitive data and non-delay-sensitive data, e.g., assuming T s Representing the size of the delay sensitive data, T is Representing the size of the non-delay sensitive data, then:
where l represents the number of paths for transmitting delay sensitive data and m represents the number of paths for transmitting non-delay sensitive data.
The optional implementation method can identify the sensitive type of the data and the priority of the target data packet, and then can put the target data packet into the queuing model based on the priority of the target data packet and the sensitive type of the target data packet, so that the target data packet is divided into a plurality of data sub-packets with equal data volume through differentiation of a first queue and a second queue in the queuing model.
In the embodiment of the present application, as an optional implementation manner, in the step: distributing a plurality of data sub-packets to K data transmission paths based on the end-to-end delay of each data transmission path, wherein the method of the embodiment of the application further comprises the following steps:
calculating an error correcting code of each data sub-packet based on a plurality of data sub-packets;
the error correction code for each data sub-packet is added to the data sub-packet.
In this alternative embodiment, as an example, the destination packet may be divided into N equal-sized segments (S) 0 ,S 1 ,S 2 ,...,S N-1 ) And M +1 of the header portion (where M < N) is added with an error correction code (C) 0 ,C 1 ,C 2 ,C 3 ,...,C M )。
In this optional implementation manner, further optionally, the error correction code is calculated by an XOR-based encoding algorithm, for example, as shown in fig. 3, fig. 3 is a schematic diagram of calculating an error correction code disclosed in this embodiment of the present application.
In this optional implementation, further, the data sub-packet and the error correction code are associated with the data field, so that the destination node can obtain the data sub-packet and the error correction code by parsing the data field, for example, as shown in fig. 4, fig. 4 is a schematic diagram of a data transmission format between nodes disclosed in this embodiment of the present application, and in fig. 4, the MS field corresponds to the data sub-packet and the error correction code.
In this optional embodiment, specifically, if the data sub-packet is lost during the data transmission process, the original data sub-packet may be recovered by using an error correction code, for example:
it follows that by adding error correction codes, it is possible to improve data transmission reliability, increase resilience to path failures, and ensure that a significant portion of a data packet is received by a destination without any delay.
Example two
Referring to fig. 5, fig. 5 is a schematic structural diagram of a data transmission device disclosed in an embodiment of the present application, where the device in the embodiment of the present application is applied to an industrial internet of things, and the industrial internet of things includes a plurality of transmission nodes. As shown in fig. 5, the apparatus of the embodiment of the present application includes the following functional modules:
a first determining module 201, configured to determine N data transmission paths from an origin node to a destination node when one of a plurality of transmission nodes serves as the origin node and another of the plurality of transmission nodes serves as the destination node, where N is an integer greater than or equal to 2, and a transmission node in one of the N data transmission paths is not intersected with a transmission node in another data transmission path;
a second determining module 202, configured to determine, based on a data transmission rate of each transmission node in the N data transmission paths, K data transmission paths required for transmitting the target data packet from the N data transmission paths, where K is less than or equal to N, K is a positive integer, and K is greater than or equal to 2;
and a transmission control module 203 for transmitting the destination data packet based on the K data transmission paths.
Because the embodiment of the application can select at least two data transmission paths from the N data transmission paths capable of transmitting data from the starting node to the destination node, and transmit the target traffic based on the at least two data transmission paths, so that the target traffic is transmitted through the multiple data transmission paths, the data transmission amount of each data transmission node in each data transmission path can be reduced, and further, the energy consumption of the data transmission nodes is reduced, and further, the load balance among the data transmission nodes is realized, and finally, the reduction of the overall service life of the industrial internet of things caused by the early damage of a certain data transmission node is avoided, for example, if one data transmission path is adopted, each node in the path needs 1S of time, but the embodiment of the application can adopt 2 or more than 2 data transmission paths to transmit 6MB of data, each node in each path only needs 0.5S at most for transmitting data, and further the work of each node is continuously reduced, so that the energy consumption of each node can be reduced.
EXAMPLE III
Referring to fig. 6, fig. 6 is a schematic structural diagram of an electronic device disclosed in the embodiment of the present application. As shown in fig. 6, the electronic device of the embodiment of the present application includes:
a processor 301; and
the memory 302 is configured to store machine readable instructions, and when the instructions are executed by the processor 301, the data transmission method according to the first embodiment of the present application is performed.
The electronic device of the embodiment of the present application, by executing the data transmission method of the first embodiment of the present application, can select at least two data transmission paths from N data transmission paths capable of transmitting data from an origin node to a destination node, and transmit a target traffic based on the at least two data transmission paths, so that transmitting the target traffic through the multiple data transmission paths can reduce the data transmission amount of each data transmission node in each data transmission path, further reduce the energy consumption of the data transmission nodes, further implement load balancing between the data transmission nodes, and finally avoid the reduction of the overall lifetime of the industrial internet of things due to the early damage of a certain data transmission node, for example, if the data amount of the target traffic is 6MB, if one data transmission path is adopted, each node in the path needs 1S of time, in the embodiment of the application, 2 or more than 2 data transmission paths can be adopted to transmit 6MB of data, so that each node in each path only needs 0.5S at most to transmit data, the work of each node is continuously reduced, and the energy consumption of each node can be reduced.
Example four
The embodiment of the application discloses a storage medium, wherein a computer program is stored in the storage medium, and the computer program is executed by a processor to execute the data transmission method in the first embodiment of the application.
The storage medium of the embodiment of the present application, by executing the data transmission method of the first embodiment of the present application, can select at least two data transmission paths from N data transmission paths capable of transmitting data from a starting node to a destination node, and transmit a target traffic based on the at least two data transmission paths, so that transmitting the target traffic through the multiple data transmission paths can reduce the data transmission amount of each data transmission node in each data transmission path, further reduce the energy consumption of the data transmission nodes, further implement load balancing between the data transmission nodes, and finally avoid the reduction of the overall lifetime of the industrial internet of things due to the early damage of a certain data transmission node, for example, if the data amount of the target traffic is 6MB, if one data transmission path is adopted, each node in the path needs 1S of time, in the embodiment of the application, 2 or more than 2 data transmission paths can be adopted to transmit 6MB of data, so that each node in each path only needs 0.5S at most to transmit data, the work of each node is continuously reduced, and the energy consumption of each node can be reduced.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described apparatus embodiments are merely illustrative, and for example, the division of the units into only one type of logical function may be implemented in other ways, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed coupling or direct coupling or communication connection between each other may be through some communication interfaces, indirect coupling or communication connection between devices or units, and may be in an electrical, mechanical or other form.
In addition, units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
Furthermore, the functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
It should be noted that, if the functions are implemented in the form of software functional modules and sold or used as independent products, the functions may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing an electronic device (which may be a personal computer, a server, or a network device) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, an optical disk, or other various media capable of storing program codes.
In this document, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.
The above description is only an example of the present application and is not intended to limit the scope of the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (10)
1. A data transmission method is applied to an industrial Internet of things, the industrial Internet of things comprises a plurality of transmission nodes, and the method comprises the following steps:
when one of the transmission nodes serves as an initial node and another of the transmission nodes serves as a destination node, determining N data transmission paths from the initial node to the destination node, wherein N is an integer greater than or equal to 2, and the transmission node in one of the data transmission paths in the N data transmission paths is not intersected with the transmission node in the other data transmission path;
determining K data transmission paths required by transmission of target data packets from the N data transmission paths based on the data transmission rate of each transmission node in the N data transmission paths, wherein K is less than or equal to N, is a positive integer, and is greater than or equal to 2;
and transmitting the target data packet based on the K data transmission paths.
2. The method of claim 1, wherein the determining N data transmission paths from the originating node to the destination node comprises:
acquiring state data of adjacent nodes of each transmission node;
calculating a data transmission cost of the neighboring node based on a data transmission cost function and the state data of the neighboring node;
determining a most preferred neighbor node for the transmitting node based on the data transmission costs of the neighboring nodes;
determining the N data transmission paths based on a most preferred neighbor node of the plurality of transmission nodes.
3. The method of claim 1, wherein the status data includes remaining energy of the neighboring node, available buffers, link quality;
and, the data transfer cost function is:
wherein Cost represents a data transmission Cost of the neighboring node, E r,y Representing the remaining energy of said neighboring nodes, B b,y Representing available buffers of said neighboring nodes, I i,xy Representing link quality of the neighboring node, a representing weight of a remaining energy value of the neighboring node, β representing weight of an available buffer of the neighboring node, γ representing weight of link quality of the neighboring node, x representing the transmission node, y representing the neighboring node of the transmission node, and Nx representing a node set composed of a plurality of the neighboring nodes.
4. The method according to claim 3, wherein the K data transmission paths required for transmitting the destination data packet are determined from the N data transmission paths based on the data transmission rate of each of the transmission nodes in the N data transmission paths by:
where K denotes the value of the data transmission path, and α is the weight factor of the energy factor, p i Representing the data transmission rate, x, of each of said transmission nodes α Representing the corresponding limits of different levels alpha in a standard normal distribution.
5. The method of claim 4, wherein said transmitting a destination data packet based on said K data transmission paths comprises:
dividing the target data packet into a plurality of data sub-packets with equal data volume;
calculating the end-to-end delay of each data transmission path in the K data transmission paths based on the available bandwidth of each data transmission path in the K data transmission paths and a preset bandwidth delay product;
distributing the plurality of data sub-packets to the K data transmission paths based on an end-to-end delay of each of the data transmission paths to transmit the plurality of data sub-packets through the K data transmission paths.
6. The method of claim 5, wherein dividing the target data packet into a number of data sub-packets having an equal amount of data comprises:
identifying the sensitive type of the data and the priority of a target data packet;
putting the target data packet into a queuing model based on the priority of the target data packet and the sensitive type of the target data packet, and dividing the target data packet into a plurality of data sub-packets with equal data volume through differentiation of a first queue and a second queue in the queuing model.
7. The method of claim 5, wherein said number of data sub-packets are allocated to said K data transmission paths based on an end-to-end delay of said each of said data transmission paths, said method further comprising:
calculating an error correction code of each data sub-packet based on the plurality of data sub-packets;
adding an error correction code for each of the data subpackets to the data subpacket.
8. A data transmission device, characterized in that the device is applied to the industrial internet of things, which comprises a plurality of transmission nodes, the device comprises:
a first determining module, configured to determine N data transmission paths from an originating node to a destination node when one of the plurality of transmission nodes serves as the originating node and another one of the plurality of transmission nodes serves as the destination node, where N is an integer greater than or equal to 2, and the transmission node in one of the N data transmission paths is disjoint from the transmission node in another one of the data transmission paths;
a second determining module, configured to determine, based on a data transmission rate of each transmission node in the N data transmission paths, K data transmission paths required for transmitting a target data packet from the N data transmission paths, where K is less than or equal to N, K is a positive integer, and K is greater than or equal to 2;
and the transmission control module is used for transmitting the target data packet based on the K data transmission paths.
9. An electronic device, characterized in that the electronic device comprises:
a processor; and
a memory configured to store machine readable instructions that, when executed by the processor, perform a data transfer method as claimed in any one of claims 1-7.
10. A storage medium, characterized in that the storage medium stores a computer program which is executed by a processor to perform the data transmission method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210648847.5A CN114928870A (en) | 2022-06-09 | 2022-06-09 | Data transmission method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210648847.5A CN114928870A (en) | 2022-06-09 | 2022-06-09 | Data transmission method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114928870A true CN114928870A (en) | 2022-08-19 |
Family
ID=82811908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210648847.5A Pending CN114928870A (en) | 2022-06-09 | 2022-06-09 | Data transmission method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114928870A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117041186A (en) * | 2023-10-07 | 2023-11-10 | 苏州仰思坪半导体有限公司 | Data transmission method, chip system, computing device and storage medium |
| CN117478680A (en) * | 2023-12-26 | 2024-01-30 | 国网四川省电力公司信息通信公司 | Terminal data stream transmission remote control method and system based on Internet of things management platform |
| CN117914775A (en) * | 2024-03-20 | 2024-04-19 | 苏州元脑智能科技有限公司 | Heterogeneous computing-oriented high-bandwidth data transmission method, CPU and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030031234A1 (en) * | 2001-05-17 | 2003-02-13 | Smee John Edward | System and method for received signal prediction in wireless communications systems |
| CN102025611A (en) * | 2010-10-30 | 2011-04-20 | 华南理工大学 | Data transmission method of wireless sensor network |
| CN106686659A (en) * | 2017-02-14 | 2017-05-17 | 重庆邮电大学 | AOMDV-based energy aware node-disjoint multipath routing algorithm |
| WO2018120423A1 (en) * | 2016-12-29 | 2018-07-05 | 平安科技（深圳）有限公司 | Network topology adaptive data visualization method, device, apparatus and storage medium |
| CN111770478A (en) * | 2020-06-29 | 2020-10-13 | 吴义魁 | Data transmission control method based on wireless Internet of things and related device |
-
2022
- 2022-06-09 CN CN202210648847.5A patent/CN114928870A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030031234A1 (en) * | 2001-05-17 | 2003-02-13 | Smee John Edward | System and method for received signal prediction in wireless communications systems |
| CN102025611A (en) * | 2010-10-30 | 2011-04-20 | 华南理工大学 | Data transmission method of wireless sensor network |
| WO2018120423A1 (en) * | 2016-12-29 | 2018-07-05 | 平安科技（深圳）有限公司 | Network topology adaptive data visualization method, device, apparatus and storage medium |
| CN106686659A (en) * | 2017-02-14 | 2017-05-17 | 重庆邮电大学 | AOMDV-based energy aware node-disjoint multipath routing algorithm |
| CN111770478A (en) * | 2020-06-29 | 2020-10-13 | 吴义魁 | Data transmission control method based on wireless Internet of things and related device |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117041186A (en) * | 2023-10-07 | 2023-11-10 | 苏州仰思坪半导体有限公司 | Data transmission method, chip system, computing device and storage medium |
| CN117041186B (en) * | 2023-10-07 | 2024-01-30 | 苏州仰思坪半导体有限公司 | Data transmission method, chip system, computing device and storage medium |
| CN117478680A (en) * | 2023-12-26 | 2024-01-30 | 国网四川省电力公司信息通信公司 | Terminal data stream transmission remote control method and system based on Internet of things management platform |
| CN117478680B (en) * | 2023-12-26 | 2024-03-15 | 国网四川省电力公司信息通信公司 | Terminal data stream transmission remote control method and system based on Internet of things management platform |
| CN117914775A (en) * | 2024-03-20 | 2024-04-19 | 苏州元脑智能科技有限公司 | Heterogeneous computing-oriented high-bandwidth data transmission method, CPU and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114928870A (en) | Data transmission method and device, electronic equipment and storage medium | |
| US20200236052A1 (en) | Improving end-to-end congestion reaction using adaptive routing and congestion-hint based throttling for ip-routed datacenter networks | |
| CN107634912B (en) | Load balancing method, device and equipment | |
| CN102263697B (en) | Method and device for sharing aggregated link traffic | |
| EP2978171B1 (en) | Communication method, communication device, and communication program | |
| JP2015165716A (en) | Progressive adaptive routing in dragonfly processor interconnect network | |
| CN106922008B (en) | IPv6 wireless sensor network multi-path transmission method based on RPL routing protocol | |
| US7801145B2 (en) | Method for transmitting network packets | |
| CN105812287A (en) | Effective circuits in packet-switched networks | |
| CN108234320B (en) | Message transmission method and switch | |
| WO2008007859A1 (en) | Method for transmitting wireless data and recording medium storing program for executing the method | |
| CN104320809A (en) | Wireless multi-hop network congestion control method and system based on RTT | |
| US10601722B2 (en) | Method and device for dynamically managing the message retransmission delay on an interconnection network | |
| CN111224888A (en) | Method for sending message and message forwarding equipment | |
| JP2018061141A (en) | Communication apparatus and communication method | |
| US7474613B2 (en) | Methods and apparatus for credit-based flow control | |
| EP4037272A1 (en) | Data processing method and device | |
| US20230027376A1 (en) | Regulating enqueueing and dequeuing border gateway protocol (bgp) update messages | |
| US7414991B2 (en) | Computing system and method to select data packet | |
| JP2017147583A (en) | Network repeater | |
| CN113438271B (en) | Memory, and method, device and equipment for data transmission management of Internet of things | |
| US11375434B2 (en) | Method and mesh node for enabling communication in a wireless mesh network | |
| CN114124833A (en) | Method, network equipment and system for controlling message sending | |
| CN107592269B (en) | Method and network node for transmitting load information of path | |
| CN114158069B (en) | Method and device for data transmission in private network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |