Data Transmission Method, System, Readable Storage Medium and Computer

Abstract

The present invention provides a data transmission method, system, readable storage medium and computer. The method includes: calculating the number of effective neighbor nodes corresponding to each sensor node according to the node conflict graph of the network structure model and the number of available channels in the network structure model; calculating the priority and trust level of each sensor node according to the node information of each sensor node; constructing a channel allocation strategy for each sensor node by using the priority, trust level and the number of each effective neighbor node, and simulating to obtain the time slot distribution when each sensor node receives channel allocation; and realizing data transmission of each sensor node in the wireless sensor network based on the channel allocation strategy and the time slot distribution. The present invention performs channel allocation for each sensor node by using the channel allocation strategy and the time slot distribution, and improves the efficiency of channel allocation and data transmission by using the strategy of time slot distribution, thereby improving the real-time performance of network data transmission.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and particularly relates to a data transmission method, system, readable storage medium and computer. Background Art

[0002] With the rapid development of wireless communication and electronic technologies, wireless sensor networks are the products of wireless communication technologies, which have advantages such as low cost and low power consumption, and are widely used in various industries.

[0003] In the field of hydrological monitoring, a large number of sensors are arranged to achieve real-time collection of environmental data, and the data is transmitted through communication to the corresponding base station to achieve the monitoring effect of the area. However, with the increase in network scale and data transmission security, the current data transmission method of wireless sensor networks cannot completely avoid interference conflicts between channel allocations, thereby increasing the delay of data transmission and reducing the real-time nature of data. Summary of the Invention

[0004] Based on this, the purpose of the present invention is to provide a data transmission method, system, readable storage medium and computer to at least solve the deficiencies in the above technologies.

[0005] The present invention provides a data transmission method, including:

[0006] Performing channel verification on each sensor node based on the network structure model of the wireless sensor network to obtain the node conflict graph of the network structure model, wherein there are several independent sensor nodes in the wireless sensor network;

[0007] Calculating the number of effective neighbor nodes corresponding to each sensor node according to the node conflict graph and the number of available channels in the network structure model;

[0008] Obtaining the node information of each sensor node, and calculating the priority and trust level of each sensor node according to the node information;

[0009] Constructing a channel allocation strategy for each sensor node by using the priority, the trust level and the number of effective neighbor nodes of each sensor node, and simulating to obtain the time slot distribution when each sensor node accepts channel allocation;

[0010] Performing channel allocation on each sensor node by using the channel allocation strategy and the time slot distribution, and realizing data transmission of each sensor node in the wireless sensor network based on the channel allocation result.

[0011] Further, the step of performing channel verification on each sensor node based on the network structure model of the wireless sensor network to obtain the node conflict graph of the network structure model includes:

[0012] Define an undirected graph that defines the network structure model of the wireless sensor network, and determine whether there is data conflict when each of the sensor nodes performs data transmission;

[0013] Construct a conflict data set according to the signal path corresponding to the sensor nodes with data conflict, and construct a corresponding node conflict graph by using the conflict data set and the undirected graph.

[0014] Further, the steps of calculating the number of effective neighbor nodes corresponding to each of the sensor nodes according to the node conflict graph and the number of available channels in the network structure model include:

[0015] Calculate the number of conflict nodes corresponding to each of the sensor nodes according to the node conflict graph, and determine the number of available channels in the network structure model;

[0016] Allocate the number of conflict nodes corresponding to each of the sensor nodes to all available channels, and use rounding up to obtain the number of effective neighbor nodes corresponding to each of the sensor nodes.

[0017] Further, the steps of calculating the priority of each of the sensor nodes according to the node information include:

[0018] Parse out the node energy information, node parameters and aging data in the node information of each of the sensor nodes, and calculate the node importance information of each of the sensor nodes by using the node parameters;

[0019] Obtain the network hop count of the network structure model, and calculate the priority of each of the sensor nodes based on the node energy information, the node importance information, the aging data and the network hop count.

[0020] Further, the calculation formula for the priority of each of the sensor nodes is:

[0021] ;

[0022] ;

[0023] ;

[0024] In the formula, represents the number of sensor nodes, represents the node energy information, represents the weight coefficient of the node energy, represents the average energy of all sensor nodes, represents the initial total energy of all sensor nodes, represents the sensor node The current energy of indicating the sensor node The initial energy of indicating the non - linear adjustment index, which is a constant set by the user indicating the node importance information indicating the node importance coefficient indicating the sensor node The node importance of indicating the maximum score of the network structure model for the node importance The maximum value of the score indicating the sensor node The aging data of indicating the aging data The weight coefficient of indicating the aging data The attenuation degree of indicating the channel allocation coefficient indicating the sensor node The number of hops from the sensor node to the network center of the network structure model indicating the maximum network hops of the network structure model indicating the occupancy compensation coefficient indicating the sensor node The channel occupancy rate of

[0025] Furthermore, the steps of calculating the trust level of each sensor node according to the node information include:

[0026] Parsing out the data packets in the node information of each sensor node, defining the expected degree of each data packet, and calculating the first trust degree of each sensor node according to the data packet and its corresponding expected degree;

[0027] Respectively determining the common neighbor nodes between any two sensor nodes in each sensor node, and performing node verification on each sensor node according to the common neighbor nodes to obtain the second trust degree of each sensor node;

[0028] Calculating the trust level of each sensor node based on the first trust degree and the second trust degree.

[0029] The present invention also proposes a data transmission system, including:

[0030] A channel verification module, configured to perform channel verification on each sensor node based on the network structure model of the wireless sensor network to obtain the node conflict graph of the network structure model, wherein there are several independent sensor nodes in the wireless sensor network;

[0031] A node calculation module, configured to calculate the number of effective neighbor nodes corresponding to each of the sensor nodes according to the node conflict graph and the number of available channels in the network structure model;

[0032] A node information acquisition module, configured to acquire the node information of each of the sensor nodes, and calculate the priority and trust level of each of the sensor nodes according to the node information;

[0033] A channel allocation module, configured to construct a channel allocation strategy for each of the sensor nodes by using the priority, the trust level, and the number of effective neighbor nodes of each of the sensor nodes, and simulate and obtain the time slot distribution when each of the sensor nodes receives channel allocation;

[0034] A data transmission module, configured to perform channel allocation on each of the sensor nodes by using the channel allocation strategy and the time slot distribution, and implement data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result.

[0035] Further, the channel verification module includes:

[0036] A conflict judgment unit, configured to define an undirected graph of the network structure model of the wireless sensor network, and judge whether there is data conflict when each of the sensor nodes performs data transmission;

[0037] A conflict graph construction unit, configured to construct a conflict data set according to the signal path corresponding to the sensor nodes with data conflict, and construct a corresponding node conflict graph by using the conflict data set and the undirected graph.

[0038] Further, the node calculation module includes:

[0039] A node calculation unit, configured to calculate the number of conflict nodes corresponding to each of the sensor nodes according to the node conflict graph, and determine the number of available channels in the network structure model;

[0040] A node allocation unit, configured to allocate the number of conflict nodes corresponding to each of the sensor nodes to all available channels, and use rounding up to obtain the number of effective neighbor nodes corresponding to each of the sensor nodes.

[0041] Further, the node information acquisition module includes:

[0042] A data analysis unit, configured to analyze the node energy information, node parameters, and aging data in the node information of each of the sensor nodes, and calculate the node importance information of each of the sensor nodes by using the node parameters;

[0043] A priority calculation unit is configured to obtain the network hop count of the network structure model, and calculate the priorities of the sensor nodes based on the node energy information, the node importance information, the aging data, and the network hop count.

[0044] Further, the node information acquisition module includes:

[0045] A first trust degree calculation unit is configured to parse the data packets in the node information of the sensor nodes, define the expected degree of each data packet, and calculate the first trust degree of each sensor node according to the data packet and its corresponding expected degree;

[0046] A second trust degree calculation unit is configured to respectively determine the common neighbor nodes between any two sensor nodes in each sensor node, and perform node verification on each sensor node according to the common neighbor nodes to obtain the second trust degree of each sensor node;

[0047] A trust level calculation unit is configured to calculate the trust level of each sensor node based on the first trust degree and the second trust degree.

[0048] The present invention also provides a readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the above data transmission method is implemented.

[0049] The present invention also provides a computer, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, the above data transmission method is implemented.

[0050] In the data transmission method, system, readable storage medium, and computer of the present invention, by constructing a node conflict graph, calculating the number of effective neighbor nodes of each sensor node by using the node conflict graph and the available channel number of the network structure model, calculating the priority and trust level of the sensor nodes by using the node information, constructing a channel allocation strategy for each sensor node by using the priority, trust level, and the number of neighbor nodes, simulating and obtaining the time slot distribution when each sensor node receives channel allocation, and performing channel allocation on each sensor node by using the channel allocation strategy and the time slot distribution, the total network interference amount is minimized to the greatest extent, and the efficiency of channel allocation and data transmission is improved by using the strategy of time slot distribution, thereby improving the real-time performance of network data transmission. Description of the Drawings

[0051] Figure 1 It is a flowchart of the data transmission method in the first embodiment of the present invention;

[0052] Figure 2 is Figure 1Detailed flowchart of step S101 in

[0053] Figure 3 For Figure 1 Detailed flowchart of step S102 in

[0054] Figure 4 For Figure 1 Detailed flowchart of step S103 in

[0055] Figure 5 For Figure 1 Detailed flowchart of another implementation manner of step S103 in

[0056] Figure 6 Structural block diagram of the data transmission system in the second embodiment of the present invention;

[0057] Figure 7 Structural block diagram of the computer in the third embodiment of the present invention.

[0058] The following specific embodiments will further illustrate the present invention in conjunction with the above-mentioned drawings. Specific Embodiments

[0059] For ease of understanding of the present invention, the present invention will be described more comprehensively below with reference to the relevant drawings. Several embodiments of the present invention are shown in the drawings. However, the present invention can be implemented in many different forms and is not limited to the embodiments described herein. On the contrary, these embodiments are provided so that the disclosure of the present invention is thorough and complete.

[0060] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those of ordinary skill in the technical field to which the present invention belongs. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more of the related listed items.

[0061] Embodiment 1

[0062] Please refer to Figure 1 , which shows the data transmission method in the first embodiment of the present invention. The method specifically includes steps S101 to S105:

[0063] S101, perform channel verification on each sensor node based on the network structure model of the wireless sensor network to obtain the node conflict graph of the network structure model. Among them, there are several independent sensor nodes in the wireless sensor network;

[0064] Further, please refer to Figure 2, the step S101 specifically includes steps S1011 to S1012:

[0065] S1011, define an undirected graph of the network structure model of the wireless sensor network, and determine whether there is data conflict when each sensor node performs data transmission;

[0066] S1012, construct a conflict data set according to the signal path corresponding to the sensor nodes with data conflict, and construct a corresponding node conflict graph by using the conflict data set and the undirected graph.

[0067] In specific implementation, define an undirected graph of the network structure of the wireless sensor network. Among them, the undirected graph consists of all sensor nodes in the network, as well as the communication links and interference links between each sensor node. All sensor nodes have the same transmission range. During data transmission, if adjacent sensor nodes use the same channel and transmit data in the same time slot, it means that there is a conflict between the two sensor nodes, resulting in the receiving node being unable to receive data normally;

[0068] Specifically, when a sensor node uses a channel to send data, the following conditions will determine that the sensor node has data conflict during data transmission, including: 1. The sensor node simultaneously receives data packets from other sensor nodes; 2. The transmission time slot and reception time slot of the sensor node are the same; 3. The sensor node receives data from other sensor nodes and simultaneously receives data sent by another sensor node within the communication range;

[0069] Based on the above method, obtain the signal paths corresponding to all sensor nodes with data conflict to obtain the corresponding interference conflict edges, construct a conflict edge set by using the interference conflict edges, and generate the node conflict graph corresponding to the network structure model by combining the conflict edge set with the undirected graph constructed above.

[0070] S102, calculate the number of effective neighbor nodes corresponding to each sensor node according to the node conflict graph and the number of available channels in the network structure model;

[0071] Further, please refer to Figure 3 , the step S102 specifically includes steps S1021 to S1022:

[0072] S1021, calculate the number of conflict nodes corresponding to each sensor node according to the node conflict graph, and determine the number of available channels in the network structure model;

[0073] S1022, allocate the number of conflicting nodes corresponding to each of the sensor nodes to all available channels, and use rounding up to obtain the number of effective neighbor nodes corresponding to each of the sensor nodes.

[0074] In specific implementation, calculate the number of conflicting nodes corresponding to each sensor node according to the obtained node conflict graph above. Each sensor node will generate a non-increasing sequence, determine the number of available channels in the network structure model, allocate the conflicting nodes to all available channels according to the number of conflicting nodes, and use the rounding-up algorithm to obtain the number of effective neighbor nodes corresponding to each sensor node. It can be understood that different conflicting nodes corresponding to each sensor node are allocated channels based on the number of available channels to ensure that no abnormality occurs in subsequent channel allocation.

[0075] S103, obtain the node information of each of the sensor nodes, and calculate the priority and trust level of each of the sensor nodes according to the node information;

[0076] Further, please refer to Figure 4 The step S103 specifically includes steps S1031 to S1032:

[0077] S1031, parse the node energy information, node parameters, and aging data in the node information of each of the sensor nodes, and calculate the node importance information of each of the sensor nodes by using the node parameters;

[0078] S1032, obtain the network hop count of the network structure model, and calculate the priority of each of the sensor nodes based on the node energy information, the node importance information, the aging data, and the network hop count.

[0079] In specific implementation, parse the node energy information, node parameters, and aging data in the node information of each sensor node. Among them, the node energy information includes the average energy of all sensor nodes, the initial total energy of all sensor nodes, the current energy of all sensor nodes, and the initial energy of all sensor nodes. The aging data includes the time delay after the sensor node generates data, and the attenuation degree during data transmission (for example: the attenuation degree during data transmission is 0.1, which means that the timeliness of the data sent by this sensor node decays by 10% every 10 seconds);

[0080] Specifically, calculate the node importance information of each sensor node by using the node parameters. Among them, the importance information is the index value for the database to judge the importance of the data generated by the sensor node. All judgment rules for importance judgment are stored in this database. The larger the index value, the higher the importance of the data generated by this sensor node.

[0081] Further, obtain the network hop count of the network structure model, which is the number of "hops" that the data generated by each sensor node passes through when transmitted in the network of the network structure model. Calculate the priority of each sensor node according to the following formula based on the above node energy information, node importance information, timeliness data, and network hop count. Take the sensor node as an example:

[0082] ;

[0083] ;

[0084] ;

[0085] In the formula, represents the number of sensor nodes, represents the node energy information, represents the weight coefficient of the node energy, represents the average energy of all sensor nodes, represents the initial total energy of all sensor nodes, represents the sensor node 's current energy, represents the sensor node 's initial energy, represents the non-linear adjustment index, which is a constant set by the user, represents the node importance information, represents the node importance coefficient, represents the sensor node 's node importance, represents the maximum score of the network structure model for the node importance , represents the timeliness data of the sensor node , represents the weight coefficient of the timeliness data , represents the attenuation degree of the timeliness data , represents the channel allocation coefficient, represents the sensor node 's hop count to the network center of the network structure model, represents the maximum network hop count of the network structure model, represents the occupancy compensation coefficient, represents the sensor node 's channel occupancy rate.

[0086] Further, please refer to Figure 5, the step S103 further includes steps S1033 to S1035:

[0087] S1033, parse out the data packets in the node information of each of the sensor nodes, define the expected degree of each of the data packets, and calculate the first trust degree of each of the sensor nodes according to the data packets and their corresponding expected degrees;

[0088] S1034, respectively determine the common neighbor nodes between any two sensor nodes in each of the sensor nodes, and perform node verification on each of the sensor nodes according to the common neighbor nodes to obtain the second trust degree of each of the sensor nodes;

[0089] S1035, calculate the trust level of each of the sensor nodes based on the first trust degree and the second trust degree.

[0090] In specific implementation, parse out the data packets in the node information of the above-mentioned sensor nodes, define the expected degree of the data packet based on the number of data packets and the number of duplicate data in the data packet, and calculate the first trust degree of each sensor node by using the number of data packets, the number of duplicate data, and the expected degree of the data packet:

[0091] ;

[0092] In the formula, represents the number of data packets sent by the sensor node at time represents the sensor node the number of duplicate data in the data packets sent by represents the sensor node the expected degree of the data packets sent by

[0093] Specifically, respectively determine the common neighbor nodes corresponding to each sensor node, and perform node verification on each sensor node according to the common neighbor nodes to calculate the trust degree of each sensor node by its common neighbor nodes, which is the second trust degree of each sensor node:

[0094] ;

[0095] In the formula, represents the trust degree of the common neighbor node to the sensor node and represents the trust degree of the common neighbor node to the sensor node and

[0096] Linearly combine the obtained first confidence level and second confidence level, and calculate the trust level of each sensor node in combination with the corresponding weight coefficients:

[0097] ;

[0098] In the formula, represents the weight of the second confidence level.

[0099] S104. Construct a channel allocation strategy for each sensor node by using the priority, the trust level, and the number of each effective neighbor node, and simulate and obtain the time slot distribution of each sensor node when receiving channel allocation;

[0100] In specific implementation, construct a channel allocation strategy for each sensor node by using the obtained priority, trust level, and the number of each effective neighbor node. Specifically, sort each sensor node according to the priority, trust level, and the number of effective neighbor nodes, construct a channel allocation strategy corresponding to the sensor node according to the sorting table, and simulate and obtain the time slot distribution of each sensor when performing channel allocation under its corresponding channel allocation strategy. During the channel allocation process, two sensor nodes with conflicting edges cannot transmit data concurrently in the same time slot. Therefore, based on the time slot distribution, judge the data flow of the sensor nodes to determine the urgency of the sensor nodes, and thus use the urgency to implement the channel allocation of the sensor nodes.

[0101] S105. Perform channel allocation for each sensor node by using the channel allocation strategy and the time slot distribution, and implement data transmission of each sensor node in the wireless sensor network based on the channel allocation result.

[0102] In summary, for the data transmission method in the above embodiments of the present invention, by constructing a node conflict graph, calculate the number of effective neighbor nodes of each sensor node by using the node conflict graph and the available channel number of the network structure model, calculate the priority and trust level of the sensor node by using the node information, construct a channel allocation strategy for each sensor node by using the priority, trust level, and the number of neighbor nodes, and simulate and obtain the time slot distribution of each sensor node when receiving channel allocation, perform channel allocation for each sensor node by using the channel allocation strategy and the time slot distribution to minimize the total network interference number as much as possible, and use the strategy of the time slot distribution to improve the efficiency of channel allocation and data transmission, thereby improving the real-time performance of network data transmission.

[0103] Embodiment 2

[0104] On the other hand, the present invention also proposes a data transmission system. Please refer to Figure 6 , which shows the data transmission system in the second embodiment of the present invention. The system includes:

[0105] A channel verification module 11, configured to perform channel verification on each sensor node based on the network structure model of a wireless sensor network, so as to obtain a node conflict graph of the network structure model, wherein there are several independent sensor nodes in the wireless sensor network;

[0106] Further, the channel verification module 11 includes:

[0107] A conflict judgment unit, configured to define an undirected graph of the network structure model of the wireless sensor network, and judge whether there is data conflict when each of the sensor nodes performs data transmission;

[0108] A conflict graph construction unit, configured to construct a conflict data set according to the signal path corresponding to the sensor nodes with data conflict, and construct a corresponding node conflict graph by using the conflict data set and the undirected graph.

[0109] A node calculation module 12, configured to calculate the number of effective neighbor nodes corresponding to each of the sensor nodes according to the node conflict graph and the number of available channels in the network structure model;

[0110] Further, the node calculation module 12 includes:

[0111] A node calculation unit, configured to calculate the number of conflict nodes corresponding to each of the sensor nodes according to the node conflict graph, and determine the number of available channels in the network structure model;

[0112] A node allocation unit, configured to allocate the number of conflict nodes corresponding to each of the sensor nodes to all available channels, and use ceiling function to obtain the number of effective neighbor nodes corresponding to each of the sensor nodes.

[0113] A node information acquisition module 13, configured to acquire the node information of each of the sensor nodes, and calculate the priority and trust level of each of the sensor nodes according to the node information;

[0114] Further, the node information acquisition module 13 includes:

[0115] A data parsing unit, configured to parse the node energy information, node parameters and aging data in the node information of each of the sensor nodes, and calculate the node importance information of each of the sensor nodes by using the node parameters;

[0116] A priority calculation unit, configured to obtain the network hop count of the network structure model, and calculate the priority of each of the sensor nodes based on the node energy information, the node importance information, the aging data and the network hop count.

[0117] Further, the node information acquisition module 13 includes:

[0118] A first trust degree calculation unit, configured to parse out data packets in the node information of each of the sensor nodes, define the expected degree of each of the data packets, and calculate the first trust degree of each of the sensor nodes according to the data packets and their corresponding expected degrees;

[0119] A second trust degree calculation unit, configured to respectively determine common neighbor nodes between any two sensor nodes in each of the sensor nodes, and perform node verification on each of the sensor nodes according to the common neighbor nodes to obtain the second trust degree of each of the sensor nodes;

[0120] A trust level calculation unit, configured to calculate the trust level of each of the sensor nodes based on the first trust degree and the second trust degree.

[0121] A channel allocation module 14, configured to construct a channel allocation strategy for each of the sensor nodes by using the priority, the trust level, and the number of each effective neighborhood node, and simulate and obtain the time slot distribution when each of the sensor nodes accepts channel allocation;

[0122] A data transmission module 15, configured to perform channel allocation on each of the sensor nodes by using the channel allocation strategy and the time slot distribution, and implement data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result.

[0123] The functions or operation steps implemented when the above-mentioned modules and units are executed are substantially the same as those in the above method embodiment, and will not be described in detail here.

[0124] The data transmission system provided by the embodiment of the present invention has the same implementation principle and the same technical effects as those in the foregoing method embodiment. For a brief description, for the parts not mentioned in the system embodiment, reference may be made to the corresponding content in the foregoing method embodiment.

[0125] Embodiment III

[0126] The present invention also provides a computer. Please refer to Figure 7 , which shows the computer in the third embodiment of the present invention, including a memory 10, a processor 20, and a computer program 30 stored on the memory 10 and executable on the processor 20. When the processor 20 executes the computer program 30, the above data transmission method is implemented.

[0127] Among them, the memory 10 at least includes one type of readable storage medium, and the readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (such as SD or DX memory, etc.), magnetic memory, magnetic disk, optical disc, etc. The memory 10 can be an internal storage unit of a computer in some embodiments, such as the hard disk of the computer. The memory 10 can also be an external storage device in other embodiments, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, etc. Further, the memory 10 can also include both an internal storage unit of a computer and an external storage device. The memory 10 can be used not only to store application software installed in the computer and various types of data, but also to temporarily store data that has been output or will be output.

[0128] Among them, the processor 20 can be an Electronic Control Unit (ECU, also known as a vehicle computer), a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor, or other data processing chips in some embodiments, and is used to run the program code stored in the memory 10 or process data, such as executing an access restriction program, etc.

[0129] It should be noted that Figure 7 The structure shown does not constitute a limitation on the computer. In other embodiments, the computer may include fewer or more components than shown in the figure, or combine certain components, or have a different component layout.

[0130] An embodiment of the present invention also provides a readable storage medium, on which a computer program is stored, and when the program is executed by a processor, it implements the data transmission method as described above.

[0131] Those skilled in the art can understand that the logic and / or steps represented in the flowchart or described in other ways herein, for example, can be considered as a definite sequence list of executable instructions for implementing logical functions, and can be specifically implemented in any computer-readable medium for use by an instruction execution system, apparatus, or device (such as a computer-based system, a system including a processor, or other systems that can fetch and execute instructions from the instruction execution system, apparatus, or device), or in combination with these instruction execution systems, apparatus, or devices. For the purposes of this specification, a "computer-readable medium" can be any device that can contain, store, communicate, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device.

[0132] More specific examples (a non-exhaustive list) of computer-readable media include the following: electrical connections (electronic devices) having one or more wirings, portable computer diskettes (magnetic devices), random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber devices, and portable compact disc read-only memory (CDROM). Additionally, the computer-readable media can even be paper or other suitable media on which the program can be printed, because the program can be obtained electronically, for example, by optically scanning the paper or other media, then editing, interpreting or otherwise processing it as appropriate, and then storing it in a computer memory.

[0133] It should be understood that various parts of the present invention can be implemented by hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, any one or a combination of the following techniques well known in the art can be used: discrete logic circuits having logic gate circuits for implementing logical functions on data signals, application specific integrated circuits having appropriate combinational logic gate circuits, programmable gate arrays (PGA), field programmable gate arrays (FPGA), etc.

[0134] The technical features of the above-described embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered to be within the scope described in this specification.

[0135] The above-described embodiments merely represent several implementation manners of the present application. The description is relatively specific and detailed, but it should not be construed as a limitation on the scope of the invention patent. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application should be subject to the appended claims.

Claims

1. A data transmission method, characterized in that: include: Performing channel verification on each sensor node based on a network structure model of a wireless sensor network to obtain a node conflict graph of the network structure model, wherein there are a number of independent sensor nodes in the wireless sensor network; Calculate the number of valid neighboring nodes corresponding to each of the sensor nodes according to the node conflict graph and the number of available channels in the network structure model; Acquire node information of each of the sensor nodes, and calculate the priority and trust level of each of the sensor nodes according to the node information; Constructing a channel allocation strategy for each of the sensor nodes using the priority, the trust level, and the number of each of the valid neighboring nodes, and simulating and obtaining the time slot distribution of each of the sensor nodes when receiving channel allocation; Performing channel allocation for each of the sensor nodes using the channel allocation strategy and the time slot distribution, and realizing data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result; The step of calculating the number of valid neighboring nodes corresponding to each sensor node according to the node conflict graph and the number of available channels in the network structure model comprises: Calculating the number of conflicting nodes corresponding to each of the sensor nodes according to the node conflict graph, and determining the number of available channels in the network structure model; The number of conflicting nodes corresponding to each of the sensor nodes is distributed to all available channels, and the number of valid neighboring nodes corresponding to each of the sensor nodes is obtained by rounding up; The step of calculating the priority of each sensor node according to the node information includes: Parsing the node energy information, node parameters and time-effectiveness data in the node information of each of the sensor nodes, and calculating the node importance information of each of the sensor nodes using the node parameters; The network hop count of the network structure model is obtained, and the priority of each sensor node is calculated based on the node energy information, the node importance information, the timeliness data and the network hop count. The calculation formula of the priority of each sensor node is: ； ； ； In the formula, represents the number of sensor nodes, Represents node energy information, Represents the weight coefficient of node energy, represents the average energy of all sensor nodes, represents the initial total energy of all sensor nodes, Represents a sensor node The current energy, Represents a sensor node The initial energy, Represents the nonlinear adjustment index, which is a constant set by the user. Indicates the node importance information, represents the node importance coefficient, Represents a sensor node The node importance of Indicates the importance of the network structure model to the node The maximum score of Represents a sensor node Time-sensitive data, Represents time-sensitive data The weight coefficient of Represents time-sensitive data The degree of attenuation, represents the channel allocation coefficient, Represents a sensor node The number of hops to the network center of the network structure model, Indicates the maximum number of network hops in the network structure model. represents the occupancy compensation coefficient, Represents a sensor node Channel occupancy rate; The step of calculating the trust level of each sensor node according to the node information includes: Parse the data packets in the node information of each sensor node, define the expected degree of each data packet, and calculate the first trust degree of each sensor node according to the data packet and its corresponding expected degree: ； In the formula, express Sensor nodes at time The number of packets sent, Represents a sensor node The number of duplicate data in the sent packets, Represents a sensor node the desirability of the data packets being sent; Determine the common neighbor nodes between any two sensor nodes in each of the sensor nodes respectively, and perform node verification on each of the sensor nodes according to the common neighbor nodes to obtain a second trust degree of each of the sensor nodes: ； In the formula, Indicates common neighbor nodes For sensor nodes The degree of trust, Indicates common neighbor nodes For sensor nodes Trustworthiness; The trust level of each sensor node is calculated based on the first trust level and the second trust level: ； In the formula, The weight representing the second trust level.

2. The data transmission method according to claim 1, characterized in that: The steps of performing channel verification on each sensor node based on the network structure model of the wireless sensor network to obtain a node conflict graph of the network structure model include: Defining an undirected graph of a network structure model of the wireless sensor network, and determining whether there is a data conflict when each of the sensor nodes is transmitting data; A conflict data set is constructed according to the channel paths corresponding to the sensor nodes with data conflicts, and a corresponding node conflict graph is constructed using the conflict data set and the undirected graph.

3. A data transmission system, characterized in that: include: A channel verification module is used to perform channel verification on each sensor node based on a network structure model of a wireless sensor network to obtain a node conflict graph of the network structure model, wherein there are several independent sensor nodes in the wireless sensor network; A node calculation module, used to calculate the number of valid neighboring nodes corresponding to each of the sensor nodes according to the node conflict graph and the number of available channels in the network structure model; A node information acquisition module, used to acquire node information of each of the sensor nodes, and calculate the priority and trust level of each of the sensor nodes according to the node information; A channel allocation module, used to construct a channel allocation strategy for each of the sensor nodes using the priority, the trust level and the number of each of the valid neighboring nodes, and simulate and obtain the time slot distribution of each of the sensor nodes when receiving channel allocation; A data transmission module, used to perform channel allocation for each of the sensor nodes using the channel allocation strategy and the time slot distribution, and to achieve data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result; Wherein, the node calculation module includes: A node calculation unit, used to calculate the number of conflicting nodes corresponding to each of the sensor nodes according to the node conflict graph, and determine the number of available channels in the network structure model; A node allocation unit, used to allocate the number of conflicting nodes corresponding to each of the sensor nodes to all available channels, and obtain the number of valid neighboring nodes corresponding to each of the sensor nodes by rounding up; Wherein, the node information acquisition module includes: A data parsing unit, used to parse out the node energy information, node parameters and time-effectiveness data in the node information of each of the sensor nodes, and calculate the node importance information of each of the sensor nodes using the node parameters; The priority calculation unit is used to obtain the network hop count of the network structure model, and calculate the priority of each sensor node based on the node energy information, the node importance information, the timeliness data and the network hop count. The calculation formula of the priority of each sensor node is: ； ； ； In the formula, represents the number of sensor nodes, Represents node energy information, Represents the weight coefficient of node energy, represents the average energy of all sensor nodes, represents the initial total energy of all sensor nodes, Represents a sensor node The current energy, Represents a sensor node The initial energy, Represents the nonlinear adjustment index, which is a constant set by the user. Indicates the node importance information, represents the node importance coefficient, Represents a sensor node The node importance of Indicates the importance of the network structure model to the node The maximum score of Represents a sensor node Time-sensitive data, Represents time-sensitive data The weight coefficient of Represents time-sensitive data The degree of attenuation, represents the channel allocation coefficient, Represents a sensor node The number of hops to the network center of the network structure model, Indicates the maximum number of network hops in the network structure model. represents the occupancy compensation coefficient, Represents a sensor node Channel occupancy rate; Wherein, the node information acquisition module also includes: The first trust calculation unit is used to parse the data packets in the node information of each sensor node, define the expected degree of each data packet, and calculate the first trust degree of each sensor node according to the data packet and its corresponding expected degree: ； In the formula, express Sensor nodes at time The number of packets sent, Represents a sensor node The number of duplicate data in the sent packets, Represents a sensor node the desirability of the data packets being sent; The second trust calculation unit is used to respectively determine the common neighbor nodes between any two sensor nodes in each of the sensor nodes, and perform node verification on each of the sensor nodes according to the common neighbor nodes to obtain the second trust of each of the sensor nodes: ； In the formula, Indicates common neighbor nodes For sensor nodes The degree of trust, Indicates common neighbor nodes For sensor nodes Trustworthiness; A trust level calculation unit, configured to calculate the trust level of each of the sensor nodes based on the first trust level and the second trust level: ； In the formula, The weight representing the second trust level.

4. The data transmission system according to claim 3, characterized in that: The channel verification module comprises: A conflict judgment unit, used to define an undirected graph of a network structure model of the wireless sensor network, and to judge whether there is a data conflict when each of the sensor nodes is transmitting data; The conflict graph construction unit is used to construct a conflict data set according to the channel paths corresponding to the sensor nodes with data conflicts, and to construct a corresponding node conflict graph using the conflict data set and the undirected graph.

5. A readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the data transmission method according to any one of claims 1 to 2 is implemented.

6. A computer comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the data transmission method according to any one of claims 1 to 2 is implemented.

Images