Data transmission method and system, readable storage medium and computer
By building node conflict graphs and channel allocation strategies in wireless sensor networks, the problem of channel allocation interference conflicts is solved, and the real-time and efficiency of data transmission are improved.
Patent Information
- Application Number
- CN202510353335.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-03-25
- Publication Date
- 2025-04-25
- Estimated Expiration
- 2045-03-25
AI Technical Summary
In the process of data transmission, existing wireless sensor networks are difficult to avoid interference conflicts between channel allocations, resulting in increased data transmission delay and reduced real-time performance.
By constructing a node conflict graph, the number of effective neighborhood nodes of the sensor nodes is calculated, priority and trust level are calculated based on node information, channel allocation strategy is constructed, and time slot distribution is simulated, and channel allocation is realized to reduce network interference.
It effectively reduces the number of network interference, improves the efficiency of channel allocation and data transmission, and thus improves the real-time nature of network data transmission.
Smart Images

Figure CN119892495A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of data processing technology, and in particular to a data transmission method, system, readable storage medium and computer. Background Art
[0002] With the rapid development of wireless communication and electronic technology, wireless sensor networks are the product of wireless communication technology. They have the advantages of 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 deployed to realize real-time collection of environmental data, and transmit them to the corresponding base stations through communication to achieve regional monitoring effects. However, with the increase in network scale and the security of data transmission, 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 performance of data. Summary of the invention
[0004] Based on this, an object 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-mentioned technology.
[0005] The present invention provides a data transmission method, comprising: 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; Channel allocation is performed on each of the sensor nodes using the channel allocation strategy and the time slot distribution, and data transmission of each of the sensor nodes in the wireless sensor network is achieved based on the channel allocation result.
[0006] Furthermore, the step 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 includes: 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.
[0007] Furthermore, the step of calculating 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 includes: 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.
[0008] Furthermore, 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 number of network hops 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 number of network hops.
[0009] Furthermore, 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 The channel occupancy rate.
[0010] Furthermore, the step of calculating the trust level of each sensor node according to the node information includes: Parsing the data packets in the node information of each of the sensor nodes, defining the expected degree of each of the data packets, and calculating the first trust degree of each of the sensor nodes according to the data packets and their corresponding expected degrees; Determine respectively 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 a second trust degree of each of the sensor nodes; The trust level of each of the sensor nodes is calculated based on the first trust level and the second trust level.
[0011] The present invention also provides a data transmission system, comprising: 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; The data transmission module is used to perform channel allocation for each of the sensor nodes using the channel allocation strategy and the time slot distribution, and realize data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result.
[0012] Furthermore, the channel verification module includes: 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.
[0013] Furthermore, 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; The node allocation unit is 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.
[0014] Furthermore, 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.
[0015] Furthermore, the node information acquisition module includes: A first trust calculation unit, used 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 of each of the sensor nodes according to the data packets and their corresponding expected degrees; A second trust calculation unit is used 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 a second trust of each of the sensor nodes; The trust level calculation unit is used to calculate the trust level of each sensor node based on the first trust level and the second trust level.
[0016] The present invention also provides a readable storage medium on which a computer program is stored. When the program is executed by a processor, the above-mentioned data transmission method is implemented.
[0017] The present invention further provides a computer, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned data transmission method when executing the computer program.
[0018] The data transmission method, system, readable storage medium and computer of the present invention construct a node conflict graph, calculate the number of effective neighboring nodes of each sensor node using the node conflict graph and the number of available channels of the network structure model, calculate the priority and trust level of the sensor node using the node information, construct a channel allocation strategy for each sensor node according to the priority, trust level and the number of neighboring nodes, simulate and obtain the time slot distribution of each sensor node when receiving channel allocation, use the channel allocation strategy and time slot distribution to allocate channels to each sensor node, so as to minimize the total network interference, and use the time slot distribution strategy to improve the efficiency of channel allocation and data transmission, thereby improving the real-time performance of network data transmission. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] Figure 1 is a flow chart of a data transmission method in a first embodiment of the present invention; Figure 2 for Figure 1 Detailed flow chart of step S101; Figure 3 for Figure 1 Detailed flowchart of step S102; Figure 4 for Figure 1 Detailed flow chart of step S103; Figure 5 for Figure 1 A detailed flow chart of another implementation of step S103; Figure 6 is a structural block diagram of a data transmission system in a second embodiment of the present invention; Figure 7 FIG. 4 is a structural block diagram of a computer in a third embodiment of the present invention.
[0020] The following specific implementation manner will further illustrate the present invention in conjunction with the above-mentioned drawings. DETAILED DESCRIPTION
[0021] In order to facilitate the understanding of the present invention, the present invention will be described more fully below with reference to the relevant drawings. Several embodiments of the present invention are given 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, the purpose of providing these embodiments is to make the disclosure of the present invention more thorough and comprehensive.
[0022] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art 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.
[0023] Embodiment 1 See also Figure 1 , which shows a data transmission method in a first embodiment of the present invention, and the method specifically includes steps S101 to S105: S101, 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; For further information, see Figure 2 , the step S101 specifically includes steps S1011~S1012: S1011, 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; S1012: construct a conflict data set according to the channel paths corresponding to the sensor nodes with data conflicts, and construct a corresponding node conflict graph using the conflict data set and the undirected graph.
[0024] In the specific implementation, an undirected graph of the network structure of the wireless sensor network is defined, wherein the undirected graph is composed of all sensor nodes in the network and the communication links and interference links between the sensor nodes. All sensor nodes have the same transmission range. During the data transmission process, 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. Specifically, when the sensor node When using a channel to send data, the sensor node will be judged to be There are data conflicts during data transmission, including: 1. Sensor nodes At the same time, it receives data packets from other sensor nodes; 2. Sensor nodes The time slots of sending data and receiving data are the same; 3. Sensor nodes Receive data from other sensor nodes and simultaneously receive data sent by other sensor nodes within the communication range; Based on the above method, the channel paths corresponding to all sensor nodes with data conflicts are obtained to obtain the corresponding interference conflict edges, and the conflict edge set is constructed using the interference conflict edges. The conflict edge set and the undirected graph constructed above are combined to generate a node conflict graph corresponding to the network structure model.
[0025] S102, calculating 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; For further information, see Figure 3 , the step S102 specifically includes steps S1021~S1022: S1021, 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; S1022, distributing the number of conflicting nodes corresponding to each of the sensor nodes to all available channels, and obtaining the number of valid neighboring nodes corresponding to each of the sensor nodes by rounding up.
[0026] In the specific implementation, the number of conflicting nodes corresponding to each sensor node is calculated according to the node conflict graph obtained above, each sensor node will generate a non-increasing sequence, the number of available channels in the network structure model is determined, and the conflicting nodes are allocated to all available channels according to the number of conflicting nodes. The rounding-up algorithm is used to obtain the corresponding number of valid neighborhood nodes of each sensor node. It can be understood that channels are allocated to different conflicting nodes corresponding to each sensor node based on the number of available channels to ensure that there will be no abnormalities in subsequent channel allocation.
[0027] S103, acquiring node information of each of the sensor nodes, and calculating the priority and trust level of each of the sensor nodes according to the node information; For further information, see Figure 4 , the step S103 specifically includes steps S1031~S1032: S1031, parsing the node energy information, node parameters and timeliness 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; S1032, obtaining the number of network hops of the network structure model, and calculating the priority of each of the sensor nodes based on the node energy information, the node importance information, the timeliness data and the number of network hops.
[0028] In the specific implementation, the node energy information, node parameters and timeliness data in the node information of each sensor node are parsed, wherein 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, and the timeliness data includes the time delay after the sensor node generates data and the attenuation degree when the data is sent (for example, the attenuation degree when the data is sent is 0.1, which means that the timeliness of the data sent by the sensor node decays by 10% every 10 seconds); Specifically, the node importance information of each sensor node is calculated using the node parameters, wherein the importance information is an indicator value used by the database to judge the importance of the data generated by the sensor node. All judgment rules for importance judgment are stored in the database. The larger the indicator value, the higher the importance of the data generated by the sensor node.
[0029] Furthermore, the network hop count of the network structure model is obtained, that is, the number of "hops" that the data generated by each sensor node undergoes when it is transmitted in the network of the network structure model. Based on the above node energy information, node importance information, timeliness data and network hop count, the priority of each sensor node is calculated according to the following formula. For example: ; ; ; 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 The channel occupancy rate.
[0030] For further information, see Figure 5 , the step S103 further includes steps S1033 to S1035: S1033, parsing the data packets in the node information of each of the sensor nodes, defining the expectation level of each of the data packets, and calculating the first trust level of each of the sensor nodes according to the data packets and their corresponding expectation levels; S1034, respectively determining common neighbor nodes between any two sensor nodes in each of the sensor nodes, and performing 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; S1035: Calculate the trust level of each of the sensor nodes based on the first trust level and the second trust level.
[0031] In the specific implementation, the data packets in the node information of each sensor node are parsed, the expected degree of the data packet is defined based on the number of data packets and the number of repeated data in the data packet, and the first trust degree of each sensor node is calculated using the number of data packets, the number of repeated data and the expected degree of the data packet: ; 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 expected degree of the data packet being sent.
[0032] Specifically, the common neighbor nodes corresponding to each sensor node are determined respectively, and node verification is performed on each sensor node according to the common neighbor nodes to calculate the trust degree of each sensor node by the common neighbor nodes, which is the second trust degree of each sensor node: ; In the formula, Indicates common neighbor nodes For sensor nodes The degree of trust, Indicates common neighbor nodes For sensor nodes degree of trust.
[0033] The obtained first trust degree and second trust degree are linearly combined, and the trust level of each sensor node is calculated by combining the corresponding weight coefficient: ; In the formula, The weight representing the second trust level.
[0034] S104, 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 a time slot distribution of each of the sensor nodes when receiving channel allocation; In the specific implementation, the priority and trust level obtained above and the number of valid neighboring nodes are used to construct the channel allocation strategy of each sensor node. Specifically, each sensor node is sorted according to the priority, trust level and the number of valid neighboring nodes, and the channel allocation strategy corresponding to the sensor node is constructed according to the sorting table, and the time slot distribution of each sensor when the channel is allocated under its corresponding channel allocation strategy is simulated. In the channel allocation process, two sensor nodes with conflicting edges cannot transmit data concurrently in the same time slot. Therefore, the data flow of the sensor node is judged based on the time slot distribution to determine the urgency of the sensor node, so as to use the urgency to realize the channel allocation of the sensor node.
[0035] S105, performing channel allocation for each of the sensor nodes using the channel allocation strategy and the time slot distribution, and implementing data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result.
[0036] In summary, the data transmission method in the above-mentioned embodiment of the present invention constructs a node conflict graph, calculates the number of effective neighboring nodes of each sensor node using the node conflict graph and the number of available channels of the network structure model, calculates the priority and trust level of the sensor node using the node information, constructs the channel allocation strategy of each sensor node according to the priority, trust level and the number of neighboring nodes, and simulates and obtains the time slot distribution of each sensor node when receiving channel allocation, and allocates channels to each sensor node using the channel allocation strategy and time slot distribution to minimize the total number of network interferences, and uses the time slot distribution strategy to improve the efficiency of channel allocation and data transmission, thereby improving the real-time performance of network data transmission.
[0037] Embodiment 2 Another aspect of the present invention also provides a data transmission system, please refer to Figure 6 , which shows a data transmission system in a second embodiment of the present invention, the system comprises: A channel verification module 11 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; Furthermore, the channel verification module 11 includes: 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.
[0038] A node calculation module 12, 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; Furthermore, the node calculation module 12 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; The node allocation unit is 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.
[0039] A node information acquisition module 13 is 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; Furthermore, the node information acquisition module 13 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.
[0040] Furthermore, the node information acquisition module 13 includes: A first trust calculation unit, used 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 of each of the sensor nodes according to the data packets and their corresponding expected degrees; A second trust calculation unit is used 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 a second trust of each of the sensor nodes; The trust level calculation unit is used to calculate the trust level of each sensor node based on the first trust level and the second trust level.
[0041] A channel allocation module 14 is 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; The data transmission module 15 is used to perform channel allocation for each of the sensor nodes using the channel allocation strategy and the time slot distribution, and to implement data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result.
[0042] The functions or operation steps implemented when the above modules and units are executed are generally the same as those in the above method embodiments, and will not be repeated here.
[0043] The data transmission system provided in the embodiment of the present invention has the same implementation principle and technical effects as those of the aforementioned method embodiment. For the sake of brief description, for matters not mentioned in the system embodiment, reference may be made to the corresponding contents in the aforementioned method embodiment.
[0044] Embodiment 3 The present invention also provides a computer, see Figure 7, shown is a computer in the third embodiment of the present invention, including a memory 10, a processor 20, and a computer program 30 stored in the memory 10 and executable on the processor 20, and the processor 20 implements the above-mentioned data transmission method when executing the computer program 30.
[0045] The memory 10 includes at least one type of readable storage medium, which includes a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., an SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the memory 10 may be an internal storage unit of a computer, such as a hard disk of the computer. In other embodiments, the memory 10 may also be an external storage device, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card, etc. Further, the memory 10 may also include both an internal storage unit of the computer and an external storage device. The memory 10 may be used not only to store application software and various types of data installed in the computer, but also to temporarily store data that has been output or is to be output.
[0046] Among them, in some embodiments, the processor 20 can be an electronic control unit (Electronic Control Unit, abbreviated as ECU, also known as a vehicle computer), a central processing unit (Central Processing Unit, CPU), a controller, a microcontroller, a microprocessor or other data processing chip, used to run the program code stored in the memory 10 or process data, such as executing access restriction programs, etc.
[0047] It should be pointed out 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 arrange the components differently.
[0048] The embodiment of the present invention further provides a readable storage medium on which a computer program is stored. When the program is executed by a processor, the data transmission method as described above is implemented.
[0049] Those skilled in the art will appreciate that the logic and / or steps represented in the flowchart or otherwise described herein, for example, may be considered as an ordered list of executable instructions for implementing logical functions, and may be specifically implemented in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in conjunction with such instruction execution systems, devices or apparatuses. For purposes of this specification, "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in conjunction with such instruction execution systems, devices or apparatuses.
[0050] More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk case (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be a paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, deciphering or, if necessary, processing in another suitable manner, and then stored in a computer memory.
[0051] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned 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, it can be implemented by any one of the following technologies known in the art or a combination thereof: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.
[0052] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0053] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached 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; Channel allocation is performed on each of the sensor nodes using the channel allocation strategy and the time slot distribution, and data transmission of each of the sensor nodes in the wireless sensor network is achieved based on the channel allocation result.
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. The data transmission method according to claim 1, characterized in that: The step of calculating 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 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.
4. The data transmission method according to claim 1, characterized in that: 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 number of network hops 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 number of network hops.
5. The data transmission method according to claim 4, characterized in that: 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 The channel occupancy rate.
6. The data transmission method according to claim 1, characterized in that: The step of calculating the trust level of each sensor node according to the node information comprises: Parsing the data packets in the node information of each of the sensor nodes, defining the expected degree of each of the data packets, and calculating the first trust degree of each of the sensor nodes according to the data packets and their corresponding expected degrees; Determine respectively 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 a second trust degree of each of the sensor nodes; The trust level of each of the sensor nodes is calculated based on the first trust level and the second trust level.
7. 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; The data transmission module is used to perform channel allocation for each of the sensor nodes using the channel allocation strategy and the time slot distribution, and realize data transmission of each of the sensor nodes in the wireless sensor network based on the channel allocation result.
8. The data transmission system according to claim 7, 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.
9. 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 6 is implemented.
10. 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 6 is implemented.
Citation Information
Patent Citations
Method for dynamically adjusting priority of WMBAN sensor node, method for allocating channel, superframe and system
CN106067152A
Multi-channel time slot reuse scheduling method for time optimization
CN114025429A
Big data transmission method of wireless sensor network
CN115696254A
Wireless body area network transmission rate optimization method based on cooperative game
CN119628767A
Apparatus and method for recommending game based on player situation
KR1020230061148A
Cited By
Intelligent safety helmet management system
CN121888288A
An intelligent safety helmet management system
CN121888288B