CN114916033B - Data transmission method, system, electronic equipment and storage medium - Google Patents
Data transmission method, system, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114916033B CN114916033B CN202210526934.3A CN202210526934A CN114916033B CN 114916033 B CN114916033 B CN 114916033B CN 202210526934 A CN202210526934 A CN 202210526934A CN 114916033 B CN114916033 B CN 114916033B
- Authority
- CN
- China
- Prior art keywords
- data
- addressing
- repeater
- data transmission
- data repeater
- 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.)
- Active
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 115
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000008569 process Effects 0.000 claims abstract description 12
- 230000006870 function Effects 0.000 claims description 27
- 238000004590 computer program Methods 0.000 claims description 10
- 239000011159 matrix material Substances 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 abstract description 5
- 238000004891 communication Methods 0.000 description 14
- 238000012545 processing Methods 0.000 description 3
- 238000013480 data collection Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of data transmission, and relates to a data transmission method, a data transmission system, electronic equipment and a storage medium. The invention provides a data transmission method, and the data transmission method can select the repeater which has the best working state and is most suitable for the data transmission from a plurality of repeaters in the whole wireless sensor network, so that the working efficiency of the data repeater is improved, and the stability and the data transmission efficiency of the data transmission are further improved. The method can determine the optimal data repeater for data transmission according to the function optimal solution, has simple steps and clear logic in the whole selection process, does not occupy too much computer calculation power, has stronger selection accuracy, stability and higher convergence, can accurately determine the proper data repeater, and greatly improves the efficiency and stability of data transmission of the wireless sensor network.
Description
Technical Field
The invention belongs to the technical field of data transmission, and relates to a data transmission method, a data transmission system, electronic equipment and a storage medium.
Background
With the development of wireless communication, micro-electromechanical systems and embedded technologies, wireless sensor networks have emerged, which are composed of a large number of very low-cost miniature sensor nodes distributed in a monitoring area. The network is characterized by low cost, distribution, low power consumption and multi-hop self-organization formed by means of wireless transmission. The importance of wireless sensor networks is comparable to the internet. The internet can access digital information regardless of where they are stored using a computer, and remote interaction with the real world is facilitated by the presence of a wireless sensor network.
The wireless sensor network is a distributed self-organizing network integrating data collection, processing and communication functions, and consists of a plurality of sensor nodes with sensing, data transmission and wireless communication functions in a certain area range. The sensor is responsible for collecting, processing, compressing data, transferring data packets of other nodes and sending out the data packets, and in different applications, the sensor network nodes have different structures and generally comprise a data collection unit sensor, a converter, a data transmission and control unit, a wireless communication unit, a power supply unit and the like. The wireless sensor network has the characteristics of large number of network nodes, limited storage capacity and limited communication capacity, the communication bandwidth of the wireless sensor network is narrow, and how to design a network communication mechanism under the limited communication capacity to meet the requirement that the communication of the sensor network is a problem which needs to be considered when the wireless sensor network is established.
Chinese patent 201210378796.5 discloses a wireless data transmission system and a method thereof, wherein the wireless data transmission system comprises: the data acquisition device, the base station and the at least one data relay arranged between the data acquisition device and the base station form a chain type skip transmission structure, and the data acquisition device, the data relay and the base station are transmitted step by adopting a wireless network to finish the uploading and the issuing of the data. The Zigbee protocol is adopted for wireless transmission, a special low-power-consumption design is adopted, a built-in battery is used for power supply, and the sustainable time is long.
Chinese patent 201210379911.0 discloses a computing node cluster system and a data relay, the computing node cluster system comprising: a plurality of compute nodes, wherein each compute node includes a respective FPGA and a general purpose processor; wherein, the general processors of each computing node are connected with each other through a network; and, in each compute node, the FPGA is connected to a general purpose processor; each FPGA is provided with a data repeater; moreover, the FPGAs of all the computing nodes are connected in sequence through the data repeater. In a continuous sending process, the dynamic self-adaptive path selector firstly forwards all messages from the general processors of the current computing node and then forwards all messages from other FPGAs. The dynamic adaptive path selector dynamically adjusts the ratio between the amount of data from the general purpose processor and the amount of data from the other FPGAs to be transmitted in the next successive transmission process after each successive transmission process is completed. An extra data path is formed by sequentially connecting the data relays of the FPGAs, so that the data bandwidth is actually increased; and the data repeater realizes dynamic self-adaptive channel balance selection, on one hand, the bandwidth of data transmission is enhanced, on the other hand, the reusability of the data repeater is provided, and the data repeater can be applied to each position in the whole heterogeneous FPGA array.
Chinese patent 201880060533.5 discloses a vital data relay system for collecting vital data of an actor moving in an environment where electric waves from a mobile phone base station cannot reach or cannot easily reach, comprising: a sensor carried by the actor for measuring vital data of the actor; a relay which is carried by the actor, acquires vital data of the actor measured by the sensor, and transmits the acquired vital data by low-power-consumption long-distance wireless communication; and a collection server that collects the vital data transmitted from the relay via a network.
The above patent application document and the related prior art document mention that the data transmission needs to be assisted by the provision of the repeater in the wireless sensor network, and thus it can be seen that the repeater is a more critical component in the wireless sensor network, but the above patent application document and the related prior art document only mention the need of using the repeater, how to use the repeater, how to arrange the repeater at a proper position, and how to select a proper repeater from a plurality of repeaters contained in the wireless sensor network for data transmission, and these problems are mentioned in the prior art. However, as an important part of the wireless sensor network networking, the selection and the use of the repeater directly affect the transmission efficiency of data in the wireless sensor network, so the inventor of the present invention proposes the technical solution of the present invention in combination with the actual products of the company, in order to solve the problems of the repeater selection and the data transmission efficiency improvement in the wireless sensor network.
Disclosure of Invention
In order to solve the technical problems, the invention provides a data transmission method, and by adopting the processing method, the repeater which has the best working state and is most suitable for the data transmission can be selected from a plurality of repeaters in the whole wireless sensor network, so that the working efficiency of the data repeater is improved, and the stability and the data transmission efficiency of the data transmission are further improved.
In order to achieve the purpose, the technical scheme of the invention is as follows:
a data transmission method, comprising the steps of:
step 1) determining a reference point parameter phi 0 Determining an addressing interval, determining the maximum number of addressing cycles, and determining the maximum number of accumulated addressing values in the addressing cycles;
step 2) calculating the reference point parameter phi 0 Setting as a reference initial optimal solution, and determining a reference initial optimal solution function;
step 3) from the reference point parameter phi 0 Firstly, addressing in an addressing space at the addressing interval determined in the step 1) to find a proper data repeater; the addressing space is a data repeater combination consisting of a plurality of data repeaters; adding the searched data repeater meeting the working requirement into an available data repeater group of the data transmission link through addressing;
step 4), in the available data repeater group, calculating the work index K of each data repeater, establishing a work index probability matrix in the data interval of [0, K ], automatically generating a random number in the data interval of [0, K ], and if the random number appears in the work index probability matrix, taking the data repeater corresponding to the random number as the starting point of a new data repeater for next round of addressing;
step 5), judging whether the number of addressing cycles reaches the maximum number of addressing cycles, judging whether the accumulated number of addressing values in the addressing cycles reaches the maximum number, if so, stopping addressing, and forming a data transmission link by the currently searched data repeater; if not, returning to continue the step 3).
Further, the reference initial optimal solution in the step 2) is phi min ＝φ 0 The reference initial optimal solution function is F min ＝f(φ 0 )。
Go to oneStep (a), the initial optimal solution function of the benchmark is
Where i =1,2,3,4.. N, i represents the number of data packets that need to be transmitted; wherein j =1,2,3,4.. M, j represents the number of data repeaters used to transmit the data packet; t is a unit of ij Indicating the time required for the jth data repeater to complete the transmission of the ith data packet. />
Further, the data repeater meeting the working requirement in the step 3) means that the working index of the data repeater meets the data transmission requirement; the data repeater comprises a primary data repeater group and a secondary data repeater group, and the work index of the primary data repeater group is
The working index of the secondary data repeater group is ^ greater than or equal to>
Wherein K is Mi Indicating the operating index, S, of a primary data repeater group Mi Indicating that there are k primary data repeaters, S in the primary data repeater group Mi ＝(S M1 ，S M2 ，......S Mk ) (ii) a Wherein K is mj Indicating the operating index, S, of a set of secondary data repeaters Mj Indicating that there are 7 primary data repeaters, S in the secondary data repeater group mj ＝(S m1 ，S m2 ，......S ml ) (ii) a The data repeater has an operating index of
Further, the specific operations of addressing in step 3) are: addressing in an addressing space at the addressing interval determined in the step 1), deleting a data repeater from a data transmission link when the data repeater searched in the addressing process exceeds the addressing space or the working index of the data repeater does not meet the requirement, and restarting addressing by taking the data repeater as a starting point; and when the data repeater searched in the addressing process meets the work index requirement, comparing the work index value of the data repeater with the optimal solution function value, if the work index value of the data repeater is larger than the optimal solution function value, deleting the data repeater from the data transmission link, otherwise, adding the data repeater into the data transmission link.
Further, the addressing interval is an integer greater than or equal to 2; the operating index of the repeater is
The invention further provides an electronic device, which includes a memory, a processor and a computer program stored in the memory and capable of running on the processor, and when the processor executes the computer program, the data transmission method described above is implemented, or the data transmission system described above is applied to perform data transmission.
The present invention also provides a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the data transmission method described above or performs data transmission using the data transmission system described above.
The invention has the following beneficial effects:
(1) The data transmission method is applied to the wireless sensor network, and the repeater which has the best working state and is most suitable for the data transmission can be selected from a plurality of repeaters in the whole wireless sensor network, so that the working efficiency of the data repeater is improved, and the stability of data transmission and the data transmission efficiency are further improved.
(2) By the method, the optimal data relay can be determined to perform data transmission according to the function optimal solution, the whole selection process is simple in step and clear in logic, excessive computer computing power is not occupied, and the method has high selection accuracy, stability and convergence, can accurately determine the appropriate data relay, and greatly improves the efficiency and stability of data transmission of the wireless sensor network.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flow chart illustrating a data transmission method according to the present invention.
Detailed Description
In order to make the technical means, the creation characteristics, the achievement purposes and the effects of the invention easy to understand, the invention is further explained below by combining the specific drawings.
The invention relates to a data transmission method, which can select the relay with the best working state and most suitable for the data transmission from a plurality of relays in the whole wireless sensor network by adopting the processing method of the invention, thereby improving the working efficiency of the data relay and further improving the stability and the efficiency of the data transmission.
As mentioned in the background of the invention, a wireless sensor network generally comprises a data acquisition unit, a sensor, a converter, a data processing and control unit, a wireless communication unit, a power supply unit, etc., and has the characteristics of large number of network nodes, limited storage capacity, and limited communication capacity, and the wireless sensor network has a narrow communication bandwidth, and needs to use a huge number of data repeaters to participate in networking in order to ensure stable and effective data transmission. In the data transmission process, data packets in a data stream are stably transmitted through a plurality of repeaters, generally, each data packet can only be transmitted through one data repeater within one time, each data repeater can only transmit one data packet within one time, the number of times that one data repeater transmits the same data packet cannot be greater than one, and the transmission of the data packet cannot be interrupted. Specifically, as shown in fig. 1, the data transmission method of the present invention includes the following steps:
step 1) determining a reference point parameter phi 0 Determining an addressing interval, determining a maximum number of addressing cycles, determining a maximum number of accumulated occurrences of an addressing value in an addressing cycle. In order to improve the addressing speed and the addressing efficiency, the addressing interval used by the invention is an integer greater than or equal to 2, preferably 2, and of course, the addressing interval can also be an integer greater than 2, but the addressing accuracy is reduced due to the excessively large addressing interval, partial calculation power of a computing system is consumed, and the addressing interval is preferably 2 in order to balance efficiency and power consumption.
Step 2) calculating the reference point parameter phi 0 Setting a reference initial optimal solution, and determining a reference initial optimal solution function; the baseline initial optimal solution is phi min ＝φ 0 The reference initial optimal solution function is F min ＝f(φ 0 )。
The baseline initial optimal solution function is
Where i =1,2,3,4.. N, i represents the number of data packets that need to be transmitted; wherein j =1,2,3,4.. M, j represents the number of data repeaters used to transmit the data packet; t is ij Indicating the time required for the jth data repeater to complete the transmission of the ith data packet. The reference initial optimal solution function used by the invention is a mathematical model obtained by performing limit calculation, which represents the time required by a group of data repeaters to finish the transmission work of a group of data packets, and the optimal solution of the reference initial optimal solution function is the shortest data transmission time in use.
Step 3) from the reference point parameter phi 0 Firstly, addressing in an addressing space at the addressing interval determined in the step 1) to find a proper data repeater; the addressingThe space is a data repeater combination consisting of a plurality of data repeaters; and adding the searched data repeater meeting the working requirement into an available data repeater group of the data transmission link through addressing.
The data repeater meeting the working requirement in the step 3) means that the working index of the data repeater meets the data transmission requirement; the data repeater comprises a primary data repeater group and a secondary data repeater group, and the work index of the primary data repeater group is
The working index of the secondary data repeater group is ^ greater than or equal to>
Wherein K is Mi Indicating the operating index, S, of a primary data repeater group Mi Indicating that there are k primary data repeaters, S in the primary data repeater group Mi ＝(S M1 ，S M2 ，......S Mk ) (ii) a Wherein K is mj Indicating the operating index, S, of the set of secondary data repeaters Mj Indicating that there are 1 primary data repeaters, S in the secondary data repeater group mj ＝(S m1 ，S m2 ，......S ml ) (ii) a The data relay has a work index of ≥>
According to the method provided by the invention, in the process of data transmission of the wireless sensor network, a data packet to be transmitted needs to be selected and allocated by the data repeaters before transmission is started, namely, the data repeaters needing to be passed are determined before the data packet is transmitted, and the most suitable data repeaters are combined into a data transmission link, wherein the data transmission link is an optimal link for realizing data transmission. In practical operation, a wireless sensor network is provided with a plurality of data repeaters, the data repeaters form a plurality of network nodes, and data packets need to pass through the network nodes and the whole networkIn the network, transmission is realized, theoretically, a finished network has more wireless links for data packet transmission, but the links are not all optimal links, and the optimal data transmission links generally have only limited links. The working index of the data repeater can be expressed by adopting a function, wherein the working index of the primary data repeater group is
The working index of the secondary data repeater group is
The first-level repeater group can be understood as a main repeater in the data repeater, the second-level repeater group can be understood as a branch repeater in the data repeater, the main repeater and the branch repeaters are mutually connected and interleaved to form a data repeater network, and according to the method, the data packet can be stably and quickly transmitted by selecting the optimal transmission link in the data repeater network. In fact, the above-mentioned work index function of the present invention is derived from a reference initial optimal solution function of the data repeaters, which is a calculation formula converted from a reference initial optimal solution function of each data repeater in the data repeater network, and the optimal link for transmitting the data packet is obtained by operating the optimal solution of the reference initial optimal solution function.
Specifically, the specific operations of addressing in step 3) are as follows: addressing in an addressing space at the addressing interval determined in the step 1), deleting a data relay from a data transmission link when the data relay searched in the addressing process exceeds the addressing space or the working index of the data relay does not meet the requirement, and restarting addressing by taking the data relay as a starting point; and when the data repeater searched in the addressing process meets the work index requirement, comparing the work index value of the data repeater with the optimal solution function value, if the work index value of the data repeater is larger than the optimal solution function value, deleting the data repeater from the data transmission link, otherwise, adding the data repeater into the data transmission link.
Step 4), in the available data repeater group, calculating the work index K of each data repeater, wherein the work index of each data repeater is
In the [0,K ]]In the data interval of (2), setting up a working index probability matrix at [0, K ]]If the random number appears in the work exponential probability matrix, the data repeater corresponding to the random number is used as the starting point of a new data repeater for next round of addressing.
According to the formula
It is calculated that the repeater defined by the present invention has an operation index of
The wireless sensor network comprises K +1 primary repeaters and secondary repeaters, each repeater can be used as a data link node, namely, K +1 data link nodes exist, and K is respectively calculated according to the two formulas Mi And K mj Then generating a value in [0,1 ] according to the method of step 4)]If the random number appears in the working exponential probability matrix, the data repeater corresponding to the random number is used as the starting point of a new data repeater for next round of addressing. That is, if the random number generated as described above falls within [0,1 ]]In the data interval, the data relay corresponding to the random number is a node selected as the data link, and is also a numberA new starting point in the transmission process of the data packet on the link (actually, the transmission process of the data packet in the data link is from one repeater to another repeater, that is, it is a leap-type transmission, each repeater which the data packet passes through can be regarded as a new starting point, the data packet is jumped from the starting point to the next repeater, and then the next repeater jumps to the new repeater, and so on, the whole data link is completed, that is, the transmission of the data packet is completed), meanwhile, k +1 also changes along with the jump of the data packet, at this time, it is necessary to delete the old repeater node which has jumped the whole data packet in the data transmission link, add the repeater node on the new link, and repeat this step until the data packet finishes the whole data transmission link.
Step 5), judging whether the number of addressing cycles reaches the maximum number of addressing cycles, judging whether the accumulated number of addressing values in the addressing cycles reaches the maximum number, if so, stopping addressing, and forming a data transmission link by the currently searched data repeater; if not, returning to continue the step 3). Because the appropriate repeaters in the data transmission link change all the time, the addressing operation of the invention also presents a dynamic characteristic, in the repeated addressing process, if the accumulated times of the addressing value reach the maximum times, namely the optimal solution repeatedly appears to the maximum times without finding a new optimal solution, the current repeater is the optimal solution, and the addressing operation can be stopped; or, the addressing cycle also reaches the maximum number of times, which indicates that no new optimal solution is found in the addressing cycle with the maximum number of times, and also indicates that the repeater at this time is the optimal solution, and at this time, the addressing also needs to be stopped; otherwise, the previous addressing step needs to be returned, and the addressing is continued until the situation is generated, and the addressing can not be stopped. The dynamic setting realizes the balance of addressing precision and addressing efficiency, ensures that the optimal repeater can be found to form a data transmission link, and simultaneously ensures better addressing efficiency and avoids the waste of computing power.
The data transmission method is applied to the wireless sensor network, and the repeater which has the best working state and is most suitable for the data transmission can be selected from a plurality of repeaters in the whole wireless sensor network, so that the working efficiency of the data repeater is improved, and the stability and the efficiency of the data transmission are further improved. The method can determine the optimal data repeater for data transmission according to the function optimal solution, has simple steps and clear logic in the whole selection process, does not occupy too much computer calculation power, has stronger selection accuracy, stability and higher convergence, can accurately determine the proper data repeater, and greatly improves the efficiency and stability of data transmission of the wireless sensor network.
The invention further provides an electronic device, which includes a memory, a processor and a computer program stored in the memory and capable of running on the processor, and when the processor executes the computer program, the data transmission method described above is implemented, or the data transmission system described above is applied to perform data transmission.
The electronic device may be embodied in the form of a general purpose computing device, which may be a server device, for example. Components of the electronic device may include, but are not limited to: at least one processor, at least one memory, and a bus connecting different system components (including the memory and the processor). The buses include a data bus, an address bus, and a control bus. The memory may include volatile memory, such as Random Access Memory (RAM) and/or cache memory, and may further include read-only memory (ROM). The memory may also include program means having a set of (at least one) program modules including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination thereof may comprise an implementation of a network environment. The processor executes various functional applications and data transmission by executing computer programs stored in the memory.
Furthermore, the electronic device may also communicate with one or more external devices (e.g., keyboard, pointing device, etc.). Such communication may be through an input/output (I/O) interface. Also, the electronic device may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via a network adapter. The network adapter communicates with other modules of the electronic device over the bus. It should be appreciated that other hardware and/or software modules may be used in conjunction with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID (disk array) systems, tape drives, and data backup storage systems, etc.
Although in the above detailed description several units/modules or sub-units/modules of the electronic device are mentioned, such a division is merely exemplary and not mandatory. Indeed, the features and functionality of two or more of the units/modules described above may be embodied in one unit/module, according to embodiments of the application. Conversely, the features and functions of one unit/module described above may be further divided into embodiments by a plurality of units/modules.
The present invention also provides a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the data transmission method described above or performs data transmission using the data transmission system described above.
More specific examples, among others, that the readable storage medium may employ may include, but are not limited to: a portable disk, a hard disk, random access memory, read only memory, erasable programmable read only memory, optical storage device, magnetic storage device, or any suitable combination of the foregoing.
The present invention can also be implemented in the form of a program product, which includes program code for causing a terminal device to execute a method for implementing the above-mentioned data transmission, or to perform data transmission using the above-mentioned data transmission system, when the program product runs on the terminal device.
Where program code for carrying out the invention is written in any combination of one or more programming languages, the program code may be executed entirely on the user device, partly on the user device, as a stand-alone software package, partly on the user device and partly on a remote device or entirely on the remote device.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (6)
1. A data transmission method, comprising the steps of:
step 1) determining a reference point parameter phi 0 Determining an addressing interval, determining the maximum number of addressing cycles, and determining the maximum number of accumulated addressing values in the addressing cycles;
step 2) calculating the reference point parameter phi 0 Setting a reference initial optimal solution, and determining a reference initial optimal solution function; the baseline initial optimal solution is phi min ＝φ 0 The reference initial optimal solution function is F min ＝f(φ 0 ) Wherein the reference initial optimal solution function is specifically
Wherein i =1,2,3,4 \ 8230n, i represents the number of data packets to be transmitted; wherein j =1,2,3,4 \ 8230m, j represents the number of data repeaters used for transmitting data packets; t is ij The time required for the jth data repeater to finish the transmission of the ith data packet is represented;
step 3) from the reference point parameter phi 0 Firstly, addressing in an addressing space at the addressing interval determined in the step 1) to find a data repeater meeting the working requirement; the addressing space is a data repeater combination consisting of a plurality of data repeaters; adding the searched data repeater meeting the working requirement into an available data repeater group of the data transmission link through addressing; in the available data repeater group, the work index K of each data repeater is calculated, and is in [0]Within the data interval ofSetting up a working index probability matrix at [0, K]If the random number appears in the work exponential probability matrix, the data repeater corresponding to the random number is used as the starting point of a new data repeater for next round of addressing;
step 4), judging whether the number of addressing cycles reaches the maximum number of addressing cycles, judging whether the accumulated occurrence number of addressing values in the addressing cycles reaches the maximum number, if the number of addressing cycles reaches the maximum number of addressing cycles and the accumulated occurrence number of addressing values in the addressing cycles also reaches the maximum number, stopping addressing, and forming a data transmission link by the currently searched data repeater; and if the number of the addressing cycles does not reach the maximum number of the addressing cycles and the accumulated number of the addressing values in the addressing cycles does not reach the maximum number, returning to continue the step 3).
2. A data transmission method according to claim 1, wherein the data repeater meeting the working requirement in step 3) means that the working index of the data repeater meets the data transmission requirement; the data repeater comprises a primary data repeater group and a secondary data repeater group, and the work index of the primary data repeater group is
The working index of the secondary data repeater group is
Wherein K is Mi Indicating the operating index, S, of a primary data repeater group Mi Indicating that there are k primary data repeaters, S in the primary data repeater group Mi ＝(S M1 ，S M2 ，......S Mk ) (ii) a Wherein K is mj Indicating the operating index, S, of a set of secondary data repeaters Mi Indicating that there are l primary data repeaters, S in the secondary data repeater group mj ＝(S m1 ,S n2 ，......S mi }; operation of the data repeaterIndex of
3. A data transmission method according to claim 2, wherein the specific operations of addressing in step 3) are: addressing in an addressing space at the addressing interval determined in the step 1), deleting a data repeater from a data transmission link when the data repeater searched in the addressing process exceeds the addressing space or the working index of the data repeater does not meet the requirement, and restarting addressing by taking the data repeater as a starting point; and when the data repeater searched in the addressing process meets the work index requirement, comparing the work index value of the data repeater with the optimal solution function value, if the work index value of the data repeater is larger than the optimal solution function value, deleting the data repeater from the data transmission link, otherwise, adding the data repeater into the data transmission link.
4. A data transmission method according to claim 3, wherein the addressing interval is an integer greater than or equal to 2; the data repeater has an operating index of
5. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the data transmission method of any one of claims 1 to 4 when executing the computer program.
6. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the data transmission method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210526934.3A CN114916033B (en) | 2022-05-16 | 2022-05-16 | Data transmission method, system, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210526934.3A CN114916033B (en) | 2022-05-16 | 2022-05-16 | Data transmission method, system, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114916033A CN114916033A (en) | 2022-08-16 |
| CN114916033B true CN114916033B (en) | 2023-03-24 |
Family
ID=82766658
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210526934.3A Active CN114916033B (en) | 2022-05-16 | 2022-05-16 | Data transmission method, system, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114916033B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116074225B (en) * | 2023-03-28 | 2023-06-23 | 浙江大丰数艺科技有限公司 | Cross-media multidimensional sensor signal data interaction method, system and medium |
| CN116489666B (en) * | 2023-05-29 | 2024-06-18 | 河南鑫安利安全科技股份有限公司 | Wireless sensor network construction method and system for safety monitoring |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5978364A (en) * | 1996-02-29 | 1999-11-02 | Philips Electronics North America Corporation | Method for routing data packets within a wireless, packet-hopping network and a wireless network for implementing the same |
| CN113965973A (en) * | 2021-10-21 | 2022-01-21 | 中国电力科学研究院有限公司 | Heterogeneous network wireless communication technology selection method, system, device and storage medium |
| CN114222344A (en) * | 2021-12-09 | 2022-03-22 | 国网江苏省电力有限公司电力科学研究院 | Wireless sensor network data transmission method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11861275B2 (en) * | 2020-02-28 | 2024-01-02 | Morgan State University | Digital signal processing using recursive hierarchical particle swarm optimization |
-
2022
- 2022-05-16 CN CN202210526934.3A patent/CN114916033B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5978364A (en) * | 1996-02-29 | 1999-11-02 | Philips Electronics North America Corporation | Method for routing data packets within a wireless, packet-hopping network and a wireless network for implementing the same |
| CN113965973A (en) * | 2021-10-21 | 2022-01-21 | 中国电力科学研究院有限公司 | Heterogeneous network wireless communication technology selection method, system, device and storage medium |
| CN114222344A (en) * | 2021-12-09 | 2022-03-22 | 国网江苏省电力有限公司电力科学研究院 | Wireless sensor network data transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114916033A (en) | 2022-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114916033B (en) | Data transmission method, system, electronic equipment and storage medium | |
| Guo et al. | Big data acquisition under failures in FiWi enhanced smart grid | |
| CN103227806B (en) | For the method and apparatus for the agreement for reconfiguring application program | |
| CN101873005A (en) | Method for realizing balanced acquisition of electric energy | |
| WO2014101441A1 (en) | Method and system for cognitive cooperative relaying/forwarding | |
| CN103368910A (en) | Virtual wireless communication network system and establishment method thereof | |
| CN101087304B (en) | Connection device and method between wireless sensor network and Internet | |
| CN111865326B (en) | Data compression method, device, equipment and storage medium | |
| CN114548416A (en) | Data model training method and device | |
| Blondia | A queueing model for a wireless sensor node using energy harvesting | |
| CN102882979A (en) | System and method for collecting, gathering and distributing data on basis of cloud computing system | |
| Silva et al. | Restful web of things for ubiquitous smart home energy management | |
| CN102946443B (en) | Multitask scheduling method for realizing large-scale data transmission | |
| CN116828510B (en) | Power distribution method and device based on Internet of things | |
| Radenkovic et al. | Towards low cost prototyping of mobile opportunistic disconnection tolerant networks and systems | |
| CN102427420A (en) | Virtual network mapping method and device based on graph pattern matching | |
| CN111092779A (en) | Network resource configuration method and device, computer equipment and readable storage medium | |
| Rikos et al. | Finite time exact quantized average consensus with limited resources and transmission stopping for energy-aware networks | |
| CN112954638A (en) | Micropower wireless sensor access method and system | |
| Elwy et al. | Role of Fog Computing in Smart Spaces | |
| CN108334424B (en) | Method for filtering redundant data of network communication management platform based on LPWAN technology | |
| CN118449557B (en) | Power line carrier aggregation method and device, storage medium and electronic equipment | |
| Yatsenko et al. | Methods and tools for minimizing the power consumption of wireless sensor network | |
| CN114900441B (en) | Network performance prediction method, performance prediction model training method and related devices | |
| WO2017196616A1 (en) | Active probing for troubleshooting links and devices |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |