Information Data Transmission Method and System Based on Computer Network

Abstract

The present invention relates to the technical field of data transmission, and particularly to an information data transmission method and system based on a computer network, including: obtaining the passing points and a number of interference regions for each transmission; obtaining the obstacle regions, the propagable regions and the power increase demand coefficient of the propagable regions; obtaining the end node sequence of the current information propagation; obtaining the sequence of the number of available hop points for the current information propagation, and obtaining the initial conflict probability of the current transmission end node according to the convergence of the sequence of the number of hop points; correcting the end node sequence to obtain the propagation path of the current information propagation; and performing power allocation according to the propagable regions passed by the propagation path and their power increase demand coefficients to achieve information data transmission. The present invention solves the influence of fixed interference sources in the self-organizing network transmission environment on the transmission path, achieves the purpose of planning the transmission path to avoid the interference source region, and improves the security of data transmission.

Description

Technical Field

[0001] The present invention relates to the technical field of data transmission, and particularly to an information data transmission method and system based on a computer network. Background Art

[0002] A self-organizing network (Self-Organizing Network, abbreviated as SON) is a network architecture that can be automatically configured, managed, optimized, and repaired. Without manual intervention, it can provide stable communication services through the automatic cooperation between network devices. Self-organizing networks are mainly used in wireless communication systems and have extensive applications especially in the fields of mobile communication and industrial Internet of Things (IoT).

[0003] When used in the industrial Internet of Things, the mobile self-organizing network usually has an open network structure, making it vulnerable to external interference, resulting in the inability to guarantee the transmission reliability of the end-to-end path between the source node and the destination node. In the industrial environment, there are often electromagnetic and radio frequency interferences, as well as power supply noise when industrial equipment is turned on and off, and common-mode interference during operation, all of which will affect the transmission of the self-organizing network in the industrial Internet of Things. The characteristic of the transmission in the self-organizing network is multi-hop transmission within a limited range, that is, the data is transmitted from the transmitting end to the receiving end through the path of other devices in the self-organizing network as the hopping points. If the nodes transmit at the same frequency, co-channel interference will occur, resulting in data transmission failure. Summary of the Invention

[0004] The present invention provides an information data transmission method and system based on a computer network to solve existing problems.

[0005] The information data transmission method and system based on a computer network of the present invention adopt the following technical solutions:

[0006] An embodiment of the present invention provides an information data transmission method based on a computer network, and the method includes the following steps:

[0007] Obtain the passing points and signal information of each transmission in the regional map of the industrial park;

[0008] Merge the interfered passing points screened by using the signal information to obtain several interference regions in the regional map;

[0009] Divide the interference regions by using the attenuation of the signal strength in the signal information of each transmission in each interference region to obtain an obstacle region, a propagable region, and a power increase demand coefficient of the propagable region;

[0010] Perform path planning to avoid the obstacle region for the current information propagation to obtain the end node sequence of the current information propagation;

[0011] Obtain the sequence of the number of hop points for the current information dissemination according to the sequence of end nodes of the current information dissemination, and obtain the initial collision probability of the current transmission end node according to the convergence of the sequence of the number of hop points;

[0012] Use the initial collision probability of the current information dissemination to correct the sequence of end nodes to obtain the dissemination path of the current information dissemination;

[0013] According to the propagable regions passed by the dissemination path of the current information dissemination and their power increase demand coefficients, perform power allocation for each end node in the dissemination path of the current information dissemination to achieve information data transmission.

[0014] Preferably, obtaining the passing points and signal information for each transmission in the regional map of the industrial park includes:

[0015] Take the building blueprint of the industrial park as the regional map of the industrial park;

[0016] Read the data transmission log of the industrial park, record the positions of the sending end node and the receiving end node in the regional map of the industrial park during each transmission in the historical information dissemination process, and mark the midpoint of the line connecting the positions of the sending end node and the receiving end node in the regional map of the industrial park as the passing point of this transmission;

[0017] Obtain the transmission power of the sending end node during each transmission and the signal strength and signal-to-noise ratio when the receiving end node receives the signal from the data transmission log, and form the signal information of each transmission with the transmission power of the sending end node, the signal strength when the receiving end node receives the signal, and the signal-to-noise ratio during each transmission.

[0018] Preferably, the specific steps for obtaining the interference region include:

[0019] According to the transmission power of the sending end node, the signal strength when the receiving end node receives the signal, and the signal-to-noise ratio in the signal information of each transmission, obtain the degree of interference of the passing point of each transmission; the degree of interference is proportional to the ratio of the transmission power of the sending end node and the signal strength when the receiving end node receives the signal, and inversely proportional to the signal-to-noise ratio when the receiving end node receives the signal;

[0020] Filter the degrees of interference of the passing points of all transmissions to obtain several passing points with interference;

[0021] Perform regional construction on the clusters obtained by clustering all the passing points with interference in the regional map to obtain several interference regions in the regional map.

[0022] Preferably, the step of dividing the interference regions by using the attenuation of the signal strength in the signal information of each transmission in each interference region to obtain the obstacle region, the propagable region, and the power increase demand coefficient of the propagable region includes:

[0023] In the signal information of each transmission in each interference region, the ratio of the transmission power of the sending end node to the signal strength when the receiving end node receives the signal is denoted as the signal attenuation amplitude of each transmission in each interference region.

[0024] The mean value of the signal attenuation amplitudes of all transmissions in each interference region is denoted as the signal obstruction degree of each interference region.

[0025] A preset obstruction threshold is set. The interference region with a signal obstruction degree greater than the obstruction threshold is denoted as the obstacle region, and the interference region with a signal obstruction degree less than or equal to the obstruction threshold is denoted as the propagable region.

[0026] The inverse proportional normalization value of the signal obstruction degree of the propagable region is denoted as the power increase demand coefficient of the propagable region.

[0027] Preferably, the specific steps for obtaining the end node sequence of the current information transmission include:

[0028] In the regional map, each device is used as an end node, and the position of each device during the current information transmission is used as the position of each end node.

[0029] If there is a direct connection in the topology network between two end nodes, the degree of the two end nodes is denoted as 1; otherwise, it is denoted as 0.

[0030] According to the position of each end node and the degree between every two end nodes, a propagation network for the current information transmission is constructed.

[0031] The starting point and the ending point of the current information transmission are mapped into the propagation network of the current information transmission. After performing the shortest path planning, the sequence of end nodes passed from the starting point to the ending point is denoted as the end node sequence of the current information transmission.

[0032] The conditions that the connection of the shortest path needs to meet are: the degree between every two end nodes in the end node sequence of the current information transmission is 1, and the passing point of a single transmission formed by these two end nodes is not in the obstacle region.

[0033] Preferably, the specific steps for obtaining the sequence of hop points of the current information transmission according to the end node sequence of the current information transmission and obtaining the initial conflict probability of the current transmission end node according to the convergence of the sequence of hop points include:

[0034] Obtain the number of hop points of each end node in the end node sequence of the current information dissemination;

[0035] Arrange the number of hop points of all end nodes in the end node sequence of the current information dissemination in the order in the end node sequence of the current information dissemination to obtain the hop point number sequence of the current information dissemination;

[0036] Record the normalization result of the ratio of the maximum hop point number to the minimum hop point number in the hop point number sequence of the current information dissemination as the initial conflict probability of the current transmission end node.

[0037] Preferably, the specific steps for obtaining the hop points include:

[0038] Denote any end node in the end node sequence of the current information dissemination as the target end node;

[0039] In the propagation network of the current information dissemination, except for all end nodes in the end node sequence of the current information dissemination, other end nodes with a degree less than 2 when connected to the target end node are denoted as the hop points of the target end node.

[0040] Preferably, the specific steps for correcting the end node sequence using the initial conflict probability of the current information dissemination to obtain the propagation path of the current information dissemination include:

[0041] Preset a conflict threshold. If the initial conflict probability of the current information dissemination is greater than or equal to the conflict threshold, denote the end node corresponding to the minimum hop point number in the hop point number sequence of the current information dissemination in the end node sequence of the current information dissemination as the conflict point in the end node sequence of the current information dissemination;

[0042] In the propagation network of the current information dissemination, after changing the degree between the conflict point and the next end node in the end node sequence of the current information dissemination to 0, perform path planning for the shortest path, which is denoted as the corrected end node sequence of the current information dissemination;

[0043] Obtain the corrected conflict probability of the current information dissemination according to the corrected end node sequence of the current information dissemination;

[0044] Use the conflict threshold to judge the corrected conflict probability of the current information dissemination until the corrected conflict probability of the current information dissemination is less than the conflict threshold, and denote the corrected end node sequence of the current information dissemination as the propagation path of the current information dissemination.

[0045] Preferably, the specific steps for performing power allocation for each end node in the propagation path of the current information dissemination according to the propagable area passed by the propagation path of the current information dissemination and its power increase demand coefficient to realize information data transmission include:

[0046] Denote the combination formed by each end node and the next end node in the propagation path of the current information propagation as an end node pair;

[0047] In the area graph, denote the connection line of the end node pair passing through all the end nodes in the propagable area as the interfered end node pair; obtain several interfered end node pairs in the propagation path of the current information propagation;

[0048] Generate the prior power of each end node pair in the propagation path of the current information propagation through the self-organizing network;

[0049] Denote the product of the prior power of each interfered end node pair in the propagation path of the current information propagation and the sum of the power increase demand coefficient of the propagable area passed by the interfered end node pair and 1 as the transmission power of each interfered end node pair in the propagation path of the current information propagation;

[0050] Denote the prior power of each end node pair in the propagation path of the current information propagation except the interfered end node pair as the transmission power of each end node pair in the propagation path of the current information propagation;

[0051] Implement the transmission of information data using the self-organizing network according to the transmission power of each end node pair and the transmission power of each interfered end node pair in the propagation path of the current information propagation;

[0052] The present invention also proposes an information data transmission system based on a computer network. The system includes a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, the steps of the above method are implemented.

[0053] The beneficial effects of the technical solution of the present invention are as follows: The present invention obtains the passing points and signal information of each transmission from the regional map of the industrial park; combines and utilizes the interfered passing points screened by the signal information to obtain several interference regions in the regional map; screens the interfered passing points through historical signal information to obtain the interference regions for dividing the regions that can be affected by fixed interference sources in the regional map; divides the interference regions by using the attenuation of the signal intensity in the signal information of each transmission in each interference region to obtain the obstacle regions, the propagable regions and the power increase demand coefficient of the propagable regions; classifies the interference regions by analyzing the interference intensities of different interference sources to obtain the propagable regions and the non-propagable regions, and obtains the prior weight power increase demand coefficient during power allocation according to the attenuation of the signal intensity caused by interference; conducts path planning to avoid the obstacle regions for the current information transmission to obtain the end node sequence of the current information transmission; obtains the sequence of the number of hop points of the current information transmission according to the end node sequence of the current information transmission, and obtains the initial conflict probability of the current transmission end node according to the convergence of the sequence of the number of hop points; conducts path planning to avoid the obstacle regions for the current information transmission, and analyzes the number of adjustable points of each end node in the end node sequence to reflect the response of the current end node sequence to conflicts, thereby judging the feasibility of the propagation path formed by the current end nodes; corrects the end node sequence by using the initial conflict probability of the current information transmission to obtain the propagation path of the current information transmission; conducts power allocation for each end node in the propagation path of the current information transmission according to the propagable regions passed by the propagation path of the current information transmission and their power increase demand coefficients to achieve information data transmission; analyzes the feasibility of the current propagation path to obtain the initial conflict probability, and adjusts the propagation path according to the initial conflict probability, finally obtains the propagation path of the current information transmission, and conducts power adaptive allocation for each end node in the propagation path of the current information transmission, improving the information transmission quality in the face of different interference sources during information transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the following drawings are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0055] Figure 1 It is the step flowchart of the information data transmission method and system based on computer network of the present invention. DETAILED DESCRIPTION OF THE INVENTION

[0056] To further elaborate on the technical means and effects adopted by the present invention to achieve the intended invention purpose, the following specifically describes, in conjunction with the accompanying drawings and preferred embodiments, the specific implementation manner, structure, features and effects of the information data transmission method and system based on a computer network according to the present invention. In the following description, different "one embodiment" or "another embodiment" do not necessarily refer to the same embodiment. In addition, the specific features, structures or characteristics in one or more embodiments can be combined in any suitable form.

[0057] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the technical field to which the present invention belongs.

[0058] The following specifically describes the specific solutions of the information data transmission method and system based on a computer network provided by the present invention in conjunction with the accompanying drawings.

[0059] Please refer to Figure 1 , which shows a flowchart of the steps of an information data transmission method based on a computer network provided by an embodiment of the present invention. The method includes the following steps:

[0060] Step S001: Obtain the passing points and signal information of each transmission in the regional map of the industrial park.

[0061] It should be noted that the installation positions of the devices that need to be connected to the Internet of Things in the industrial park are not fixed. And because some common industrial devices in the park often need to be relocated, and some devices need to be connected to the monitoring system through the Internet of Things to achieve safety supervision of the devices. Therefore, in a complex industrial park, an ad hoc network is more suitable for computers to transmit information to each device. And there are often inductive loads such as motors in the industrial park. Inductive loads will generate electromagnetic interference when starting and running, thus reducing the information transmission between devices in the ad hoc network.

[0062] Furthermore, it should be noted that the inductive loads that generate interference in the industrial park usually have the characteristics of affecting a specific area and having a fixed range. When two devices, as end nodes in the ad hoc network, achieve data transmission, if they pass through the interference areas generated by these inductive loads, it will cause the attenuation and instability of the data signal intensity received by the receiving end. Therefore, in this embodiment, first, by collecting and analyzing the signal transmission paths and signal characteristics of the devices as end nodes in the historical signal transmission, the passing points and signal information of each transmission of the end nodes are obtained in the regional map of the industrial park.

[0063] Preferably, the specific steps of obtaining the passing points and signal information of each transmission in the regional map of the industrial park include:

[0064] Use the building blueprint of the industrial park as the regional map of the industrial park;

[0065] Read the data transmission logs of the industrial park, record the positions of the sending end node and the receiving end node in the regional map of the industrial park during each transmission in the process of historical information dissemination, and mark the midpoint of the line connecting the positions of the sending end node and the receiving end node in the regional map of the industrial park as the passing point of this transmission;

[0066] It should be noted that in one information dissemination, the information to be transmitted needs to be transmitted from the starting point to the ending point. Based on the characteristics of devices as end nodes in the ad hoc network, there are multiple transmissions between end nodes during one information dissemination process, and the receiving end node of each transmission serves as the sending end node of the next transmission.

[0067] Obtain the transmission power of the sending end node during each transmission, as well as the signal strength and signal-to-noise ratio when the receiving end node receives the signal, from the data transmission logs. The transmission power of the sending end node, the signal strength when the receiving end node receives the signal, and the signal-to-noise ratio during each transmission constitute the signal information of each transmission.

[0068] It should be noted that most of the devices incorporated into the Internet of Things in the industrial park are mobile devices. Therefore, the positions of the same device in the regional map are different when it serves as an end node to send or receive data during different transmissions.

[0069] Step S002: Combine the interfered passing points screened by using the signal information to obtain several interference regions in the regional map; divide the interference regions by using the attenuation situation of the signal strength in the signal information of each transmission in each interference region to obtain the obstacle regions, the propagable regions, and the power increase demand coefficient of the propagable regions.

[0070] It should be noted that the signal propagation in the industrial park will be interfered by fixed interference sources, resulting in abnormal signal information of the passing points during each transmission if the passing points are within the interference range of the fixed interference sources. Therefore, the fixed interference sources cause the signal information of the passing points to show obvious regional characteristics in the regional map of the industrial park. Therefore, in this embodiment, the interfered passing points are screened by using the signal information, and the interfered passing points are combined to obtain several interference regions in the regional map.

[0071] Preferably, the specific steps of combining the interfered passing points screened by using the signal information to obtain several interference regions in the regional map include:

[0072] According to the transmission power of the sending end node, the signal strength when the receiving end node receives the signal, and the signal-to-noise ratio in the signal information of each transmission, obtain the degree of interference of the passing point of each transmission;

[0073] Screen the degrees of interference of the passing points of all transmissions to obtain several interfered passing points;

[0074] After clustering all the interfered waypoints, regional construction is carried out on the clusters in the regional map to obtain several interference regions in the regional map.

[0075] Specifically, according to the transmission power of the sending end node, the signal strength and the signal-to-noise ratio when the receiving end node receives the signal in the signal information of each transmission, the specific method for obtaining the interference degree of the waypoints of each transmission is as follows:

[0076] It should be noted that the self-organizing network will allocate the transmission power according to factors such as the distance between the end nodes. The stronger the transmission power, the stronger the received signal strength. However, if the transmission power is stronger, the signal strength received by the receiving end node is lower, and the signal-to-noise ratio is higher, it indicates that this transmission is more likely to be interfered.

[0077] Obtain the interference degree of the waypoints of each transmission. The interference degree is directly proportional to the ratio of the transmission power of the sending end node to the signal strength when the receiving end node receives the signal, and inversely proportional to the signal-to-noise ratio when the receiving end node receives the signal.

[0078] Among them, the ratio of the transmission power of the sending end node to the signal strength when the receiving end node receives the signal represents the adaptive adjustment situation and the receiving situation of the self-organizing network for the transmission power of the sending end node during this transmission. The greater the transmission power, the more the self-organizing network judges that this transmission requires anti-interference, so a larger transmission power is allocated. And the smaller the received signal strength, the greater the interference situation. And the signal-to-noise ratio is used to measure the signal quality. The smaller the signal-to-noise ratio, the more noise and the stronger the interference.

[0079] Further, the specific method for screening the interference degree of the waypoints of all transmissions to obtain several interfered waypoints is as follows:

[0080] After normalizing the maximum and minimum values of the interference degree of the waypoints of all transmissions, a preset interference threshold is set. The waypoints corresponding to the normalized results greater than the interference threshold among all the normalized results of the interference degree are recorded as interfered waypoints.

[0081] Among them, the maximum and minimum value normalization is a well-known prior art and will not be elaborated in this embodiment. In this embodiment, the interference threshold is described by taking 0.68 as an example. Other embodiments can adopt other values, and this embodiment does not make specific limitations.

[0082] Further, the specific method for carrying out regional construction on the clusters obtained after clustering all the interfered waypoints in the regional map to obtain several interference regions in the regional map is as follows:

[0083] In the area graph, the K-means algorithm is used to cluster all the interfered passing points to obtain several clusters. The convex hull area formed by all the interfered passing points in each cluster is denoted as an interference area in the area graph. Similarly, several interference areas in the area graph are obtained.

[0084] It should be noted that the interference intensities of the interference sources in the interference areas are different. Some interference areas can transmit data by increasing the transmission power, that is, the propagable areas, while some interference areas have too high interference intensity, resulting in information loss even when the transmission power is increased, that is, the obstacle areas. Therefore, in this embodiment, all the interference areas are divided according to the attenuation of the signal intensity in the signal information transmitted each time in the interference areas, and the obstacle areas, propagable areas and the power increase demand coefficient of the propagable areas are obtained.

[0085] Preferably, the specific steps of using the attenuation of the signal intensity in the signal information transmitted each time in each interference area to divide the interference area and obtain the obstacle area, propagable area and the power increase demand coefficient of the propagable area are as follows:

[0086] According to the attenuation of the signal intensity in the signal information transmitted all times in each interference area, the signal obstruction degree of each interference area is obtained;

[0087] The obstacle area and the propagable area are divided by using the signal obstruction degree, and the power increase demand coefficient of the propagable area is obtained.

[0088] Specifically, the specific method for obtaining the signal obstruction degree of each interference area according to the attenuation of the signal intensity in the signal information transmitted all times in each interference area is as follows:

[0089] In the signal information transmitted each time in each interference area, the ratio of the transmission power of the sending end node to the signal intensity when the receiving end node receives the signal is denoted as the signal attenuation amplitude of each transmission in each interference area;

[0090] The mean value of the signal attenuation amplitudes of all transmissions in each interference area is denoted as the signal obstruction degree of each interference area.

[0091] Further, the specific method for dividing the obstacle area and the propagable area by using the signal obstruction degree and obtaining the power increase demand coefficient of the propagable area is as follows:

[0092] A preset obstruction threshold is set. The interference area with a signal obstruction degree greater than the obstruction threshold is denoted as the obstacle area, and the interference area with a signal obstruction degree less than or equal to the obstruction threshold is denoted as the propagable area;

[0093] The inverse proportional normalization value of the signal obstruction degree of the propagable area is denoted as the power increase demand coefficient of the propagable area.

[0094] It should be noted that, in this embodiment, the obstacle threshold is taken as 0.5 for description. Other embodiments may adopt other values, and this embodiment does not make specific limitations.

[0095] Step S003: Perform path planning for the current information propagation to avoid obstacle areas to obtain the end-node sequence of the current information propagation; obtain the number-of-hop-points sequence of the current information propagation according to the end-node sequence of the current information propagation, and obtain the initial conflict probability of the current transmission end-node according to the convergence of the number-of-hop-points sequence.

[0096] It should be noted that the ad hoc network is a topology-structured network. Therefore, during an information propagation process, multiple transmissions between end-nodes are required, and each transmission needs to pass through several topology-structured networks composed of devices. Therefore, for a known origin and destination of the current information propagation, path planning is usually performed based on the shortest propagation path to realize the propagation of signals in the ad hoc network.

[0097] Preferably, the specific method for performing path planning for the current information propagation to avoid obstacle areas to obtain the end-node sequence of the current information propagation is as follows:

[0098] Obtain the positions and connection conditions of each end-node in the current area map to form the propagation network of the current information propagation;

[0099] Perform path planning for the current information propagation to avoid obstacle areas to obtain the end-node sequence of the current information propagation.

[0100] Specifically, the specific method for obtaining the positions and connection conditions of each end-node in the current area map to form the propagation network of the current information propagation is as follows:

[0101] In the area map, regard each device as an end-node, and regard the position of each device during the current information propagation as the position of each end-node;

[0102] If there is a direct connection in the topology-structured network between two end-nodes, record the degree of the two end-nodes as 1, otherwise record it as 0;

[0103] Construct the propagation network of the current information propagation according to the position of each end-node and the degree between every two end-nodes.

[0104] Furthermore, the specific method for performing path planning for the current information propagation to avoid obstacle areas to obtain the end-node sequence of the current information propagation is as follows:

[0105] Map the start point and end point of the current information dissemination to the dissemination network of the current information dissemination. After performing the path planning of the shortest path, record the sequence of end nodes passed from the start point to the end point as the end node sequence of the current information dissemination;

[0106] The conditions that the connection of the shortest path needs to satisfy are: the degree between every two end nodes in the end node sequence of the current information dissemination is 1, and the passing points of a single transmission formed by these two end nodes are not in the obstacle area.

[0107] It should be noted that in this implementation, when performing the path planning of the shortest path, the sum of the degrees between every two end nodes is used as the length of the path.

[0108] It should be noted that in the ad hoc network, multiple information disseminations often occur simultaneously. At this time, the end node sequences of multiple information disseminations may share the same end node, resulting in information conflicts in the ad hoc network. Therefore, the ad hoc network usually applies, for example, a time division multiple access system (TDMA) to divide the transmission time slots for different information disseminations to avoid conflicts. When the transmission time slots divided when multiple information disseminations simultaneously share the same end node are not sufficient to complete the dissemination of all data in a short time, it will lead to conflicts and transmission delays in the ad hoc network. At this time, the ad hoc network needs to reconstruct the transmission path according to the available hop points in the dissemination path. Then, if the number of available hop points of a certain end node in the dissemination path is insufficient, it will cause the ad hoc network to be unable to reconstruct the transmission path, resulting in the ad hoc network being unable to solve the problems of conflicts and transmission delays. Therefore, in this embodiment, the available hop points of each end node in the end node sequence of the current information dissemination are analyzed to obtain the available hop point number sequence of the current information dissemination, and then the initial conflict probability of the current transmission end node is analyzed by obtaining the available hop point number sequence of the current information dissemination.

[0109] Preferably, the specific steps of obtaining the initial conflict probability of the current transmission end node according to the available hop point number sequence of the current information dissemination based on the convergence of the available hop point number sequence include:

[0110] Obtain the number of available hop points of each end node in the end node sequence of the current information dissemination;

[0111] According to the number of available hop points of each end node in the end node sequence of the current information dissemination, obtain the available hop point number sequence of the current information dissemination;

[0112] Obtain the initial conflict probability of the current transmission end node according to the convergence of the available hop point number sequence.

[0113] Specifically, the specific way to obtain the number of available hop points of each end node in the end node sequence of the current information dissemination is:

[0114] Denote any end node in the end node sequence of the current information propagation as the target end node;

[0115] In the propagation network of the current information propagation, except for all the end nodes in the end node sequence of the current information propagation, other end nodes with a degree less than 2 when connected to the target end node are denoted as the jumpable points of the target end node;

[0116] Obtain the number of jumpable points of each end node in the end node sequence of the current information propagation;

[0117] Arrange the number of jumpable points of all the end nodes in the end node sequence of the current information propagation in the order in the end node sequence of the current information propagation to obtain the jumpable point number sequence of the current information propagation.

[0118] Further, the specific manner of obtaining the initial conflict probability of the current transmission end node according to the convergence of the jumpable point number sequence is:

[0119] It should be noted that the number of jumpable points in the jumpable point number sequence of the current information propagation indicates the number of optional end nodes during path reconstruction when a conflict occurs. Therefore, when the number of optional end nodes is smaller, the convergence of the propagation path is greater, and the probability of a conflict is greater. Therefore, in this embodiment, based on the decrease of the minimum jumpable point number compared to the maximum jumpable point in the jumpable point number sequence, the convergence of the jumpable point number sequence is reflected.

[0120] Denote the normalization result of the ratio of the maximum jumpable point number to the minimum jumpable point number in the jumpable point number sequence of the current information propagation as the initial conflict probability of the current transmission end node.

[0121] It should be noted that in this embodiment, the sigmoid function is used to normalize the ratio of the maximum jumpable point number to the minimum jumpable point number. Other embodiments may use other methods to achieve normalization, and this embodiment does not make specific limitations.

[0122] Step S004: Correct the end node sequence using the initial conflict probability of the current information propagation to obtain the propagation path of the current information propagation; according to the propagable area passed by the propagation path of the current information propagation and its power increase demand coefficient, perform power allocation for each end node in the propagation path of the current information propagation to implement information data transmission.

[0123] Specifically, the specific manner of correcting the end node sequence using the initial conflict probability of the current information propagation to obtain the propagation path of the current information propagation is:

[0124] Preset a conflict threshold. If the initial conflict probability of the current information dissemination is greater than or equal to the conflict threshold, in the sequence of the number of hop points of the current information dissemination, the minimum number of hop points corresponds to the end node in the end node sequence of the current information dissemination, which is denoted as the conflict point in the end node sequence of the current information dissemination.

[0125] In the propagation network of the current information dissemination, after changing the degree between the conflict point and the next end node in the end node sequence of the current information dissemination to 0, perform path planning for the shortest path, which is denoted as the corrected end node sequence of the current information dissemination.

[0126] Obtain the corrected conflict probability of the current information dissemination according to the corrected end node sequence of the current information dissemination.

[0127] Use the conflict threshold to judge the corrected conflict probability of the current information dissemination. Until the corrected conflict probability of the current information dissemination is less than the conflict threshold, record the corrected end node sequence of the current information dissemination as the propagation path of the current information dissemination.

[0128] It should be noted that in this embodiment, the conflict threshold is described by taking 0.7 as an example. Other embodiments can adopt other values, and this embodiment does not make specific limitations.

[0129] It should be noted that when performing the current information dissemination, the propagation path will pass through the propagable area. When performing power allocation, it is necessary to pre-enhance the power of this transmission passing through the propagable area.

[0130] Furthermore, according to the propagable area passed by the propagation path of the current information dissemination and its power increase demand coefficient, perform power allocation for each end node in the propagation path of the current information dissemination. The specific steps to realize information data transmission are as follows:

[0131] Screen the end nodes in the propagable area passed by the propagation path of the current information dissemination to obtain several pairs of interfered end nodes in the propagation path of the current information dissemination.

[0132] According to the power increase demand coefficient of the propagable area passed by each pair of interfered end nodes, adjust the prior power of the pair of interfered end nodes to realize power allocation for each end node in the propagation path of the current information dissemination.

[0133] Specifically, the specific method for screening the end nodes in the propagable area passed by the propagation path of the current information dissemination to obtain several pairs of interfered end nodes in the propagation path of the current information dissemination is as follows:

[0134] Denote the combination of each end node and the next end node in the propagation path of the current information dissemination as a pair of end nodes.

[0135] In the area diagram, the connection line of the end-node pair passing through all the end nodes in the propagable area is recorded as the interfered end-node pair; several interfered end-node pairs in the propagation path of the current information propagation are obtained.

[0136] Further, according to the power increase demand coefficient of the propagable area passed by each interfered end-node pair, the preset power of the interfered end-node pair is adjusted. The specific method for realizing the power distribution of each end node in the propagation path of the current information propagation is as follows:

[0137] Generate the prior power of each end-node pair in the propagation path of the current information propagation through the self-organizing network;

[0138] The product of the prior power of each interfered end-node pair in the propagation path of the current information propagation and the sum of the power increase demand coefficient of the propagable area passed by the interfered end-node pair and 1 is recorded as the transmission power of each interfered end-node pair in the propagation path of the current information propagation;

[0139] The prior power of each end-node pair in the propagation path of the current information propagation except the interfered end-node pair is recorded as the transmission power of each end-node pair in the propagation path of the current information propagation;

[0140] According to the transmission power of each end-node pair and the transmission power of each interfered end-node pair in the propagation path of the current information propagation, use the self-organizing network to realize the transmission of information data.

[0141] Another embodiment of the present invention provides an information data transmission system based on a computer network. The system includes a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, the above method steps S001 to step S004 are implemented.

[0142] The above are only the preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent replacements, improvements, etc. made within the principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. An information data transmission method based on a computer network, characterized in that The method includes the following steps: Obtain the passing points and signal information of each transmission in the regional map of the industrial park; Merge the interfered passing points screened by using the signal information to obtain several interference regions in the regional map; Divide the interference regions by using the attenuation of the signal strength in the signal information of each transmission in each interference region to obtain the obstacle regions, the propagable regions and the power increase demand coefficient of the propagable regions; Perform path planning to avoid the obstacle regions for the current information transmission to obtain the end node sequence of the current information transmission; Obtain the sequence of the number of hop points of the current information transmission according to the end node sequence of the current information transmission, and obtain the initial collision probability of the current transmission end node according to the convergence of the sequence of the number of hop points; Correct the end node sequence by using the initial collision probability of the current information transmission to obtain the propagation path of the current information transmission; Perform power allocation for each end node in the propagation path of the current information transmission according to the propagable regions passed by the propagation path of the current information transmission and their power increase demand coefficients to realize information data transmission.

2. The information data transmission method based on a computer network according to claim 1, wherein The obtaining of the passing points and signal information of each transmission in the regional map of the industrial park includes: Take the building blueprint of the industrial park as the regional map of the industrial park; Read the data transmission log of the industrial park, record the positions of the sending end node and the receiving end node in the regional map of the industrial park during each transmission in the historical information transmission process, and record the midpoint of the line connecting the positions of the sending end node and the receiving end node in the regional map of the industrial park as the passing point of this transmission; Obtain the transmission power of the sending end node during each transmission from the data transmission log, as well as the signal strength and signal-to-noise ratio when the receiving end node receives the signal, and form the signal information of each transmission with the transmission power of the sending end node, the signal strength when the receiving end node receives the signal and the signal-to-noise ratio during each transmission.

3. The information data transmission method based on a computer network according to claim 1, characterized in that, The specific steps for obtaining the interference regions include: According to the transmission power of the sending end node, the signal strength when the receiving end node receives the signal and the signal-to-noise ratio in the signal information of each transmission, obtain the interference degree of the passing point of each transmission; the interference degree is proportional to the ratio of the transmission power of the sending end node and the signal strength when the receiving end node receives the signal, and is inversely proportional to the signal-to-noise ratio when the receiving end node receives the signal; Screen the interference degrees of the passing points of all transmissions to obtain several interfered passing points; Perform regional construction in the regional map for the clusters obtained after clustering all the interfered passing points to obtain several interference regions in the regional map.

4. The information data transmission method based on a computer network according to claim 1, characterized in that, The dividing of the interference regions by using the attenuation of the signal strength in the signal information of each transmission in each interference region to obtain the obstacle regions, the propagable regions and the power increase demand coefficient of the propagable regions includes: Record the ratio of the transmission power of the sending end node and the signal strength when the receiving end node receives the signal in the signal information of each transmission in each interference region as the signal attenuation amplitude of each transmission in each interference region; Record the mean value of the signal attenuation amplitudes of all transmissions in each interference region as the signal obstruction degree of each interference region; Preset an obstruction threshold. Mark the interference area where the signal obstruction degree is greater than the obstruction threshold as the obstacle area, and mark the interference area where the signal obstruction degree is less than or equal to the obstruction threshold as the propagable area; Denote the inverse normalization value of the signal obstruction degree in the propagable area as the power increase demand coefficient of the propagable area.

5. The information data transmission method based on a computer network according to claim 1, characterized in that The specific steps for obtaining the end node sequence of the current information transmission include: In the area graph, regard each device as an end node, and regard the position of each device during the current information transmission as the position of each end node; If there is a direct connection in the topological structure network between two end nodes, denote the degree of the two end nodes as 1, otherwise denote it as 0; Construct the propagation network of the current information transmission according to the position of each end node and the degree between every two end nodes; Map the starting point and the ending point during the current information transmission into the propagation network of the current information transmission, and after performing the shortest path planning, denote the sequence of end nodes passed from the starting point to the ending point as the end node sequence of the current information transmission; The condition that the connection of the shortest path needs to satisfy is: the degree between every two end nodes in the end node sequence of the current information transmission is 1, and the passing point of a single transmission formed by these two end nodes is not in the obstacle area.

6. The information data transmission method based on a computer network according to claim 1, wherein The specific steps for obtaining the sequence of hop points of the current information transmission according to the end node sequence of the current information transmission, and obtaining the initial conflict probability of the current transmission end node according to the convergence of the sequence of hop points include: Obtain the number of hop points of each end node in the end node sequence of the current information transmission; Arrange the number of hop points of all end nodes in the end node sequence of the current information transmission in the order in the end node sequence of the current information transmission to obtain the sequence of hop points of the current information transmission; Denote the normalized result of the ratio of the maximum number of hop points to the minimum number of hop points in the sequence of hop points of the current information transmission as the initial conflict probability of the current transmission end node.

7. The information data transmission method based on a computer network according to claim 6, wherein The specific steps for obtaining the hop points include: Regard any end node in the end node sequence of the current information transmission as the target end node; In the propagation network of the current information transmission, regard the other end nodes with a degree less than 2 when connecting to the target end node, except for all end nodes in the end node sequence of the current information transmission, as the hop points of the target end node.

8. The information data transmission method based on a computer network according to claim 1, characterized in that The specific steps for correcting the end node sequence by using the initial conflict probability of the current information transmission to obtain the propagation path of the current information transmission include: Preset a conflict threshold. If the initial conflict probability of the current information transmission is greater than or equal to the conflict threshold, regard the end node corresponding to the minimum number of hop points in the sequence of hop points of the current information transmission in the end node sequence of the current information transmission as the conflict point in the end node sequence of the current information transmission; In the propagation network of the current information transmission, change the degree between the conflict point and the next end node in the end node sequence of the current information transmission to 0, and then perform the shortest path planning, which is denoted as the corrected end node sequence of the current information transmission; Obtain the correction conflict probability of the current information propagation according to the corrected end node sequence of the current information propagation; Use the conflict threshold to judge the correction conflict probability of the current information propagation. Until the correction conflict probability of the current information propagation is less than the conflict threshold, record the corrected end node sequence of the current information propagation as the propagation path of the current information propagation.

9. The information data transmission method based on a computer network according to claim 1, characterized in that The specific acquisition steps for implementing information data transmission by performing power allocation for each end node in the propagation path of the current information propagation according to the propagable area passed by the propagation path of the current information propagation and its power increase demand coefficient include: Record the combination formed by each end node and the next end node in the propagation path of the current information propagation as an end node pair; In the area graph, record all the end nodes through which the connection of the end node pair passes through the propagable area as the interfered end node pair; obtain several interfered end node pairs in the propagation path of the current information propagation; Generate the prior power of each end node pair in the propagation path of the current information propagation through the self-organizing network; Record the product of the prior power of each interfered end node pair in the propagation path of the current information propagation and the sum of the power increase demand coefficient of the propagable area passed by the interfered end node pair and 1 as the transmission power of each interfered end node pair in the propagation path of the current information propagation; Record the prior power of each end node pair except the interfered end node pairs in the propagation path of the current information propagation as the transmission power of each end node pair in the propagation path of the current information propagation; Implement the transmission of information data using the self-organizing network according to the transmission power of each end node pair and the transmission power of each interfered end node pair in the propagation path of the current information propagation.

10. An information data transmission system based on a computer network, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the information data transmission method based on the computer network as described in any one of claims 1-9.

Images