CN117675961A - Communication transmission data management method and system - Google Patents
Communication transmission data management method and system Download PDFInfo
- Publication number
- CN117675961A CN117675961A CN202311600141.2A CN202311600141A CN117675961A CN 117675961 A CN117675961 A CN 117675961A CN 202311600141 A CN202311600141 A CN 202311600141A CN 117675961 A CN117675961 A CN 117675961A
- Authority
- CN
- China
- Prior art keywords
- data
- individual
- representing
- data packet
- monitoring
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 125
- 238000004891 communication Methods 0.000 title claims abstract description 46
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000013523 data management Methods 0.000 title claims abstract description 21
- 238000012544 monitoring process Methods 0.000 claims abstract description 97
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims abstract description 16
- 239000000779 smoke Substances 0.000 claims abstract description 14
- 238000004806 packaging method and process Methods 0.000 claims abstract description 6
- 230000006870 function Effects 0.000 claims description 53
- 230000006978 adaptation Effects 0.000 claims description 18
- 238000012545 processing Methods 0.000 claims description 16
- 230000035772 mutation Effects 0.000 claims description 15
- 238000004364 calculation method Methods 0.000 claims description 13
- 230000008602 contraction Effects 0.000 claims description 9
- 230000002068 genetic effect Effects 0.000 claims description 6
- 230000033001 locomotion Effects 0.000 claims description 6
- 238000013507 mapping Methods 0.000 claims description 6
- 108090000623 proteins and genes Proteins 0.000 claims description 6
- 238000012549 training Methods 0.000 claims description 5
- 238000005457 optimization Methods 0.000 claims description 3
- 230000005856 abnormality Effects 0.000 claims description 2
- 230000014759 maintenance of location Effects 0.000 claims description 2
- 230000007614 genetic variation Effects 0.000 claims 1
- 230000002159 abnormal effect Effects 0.000 description 12
- 230000009286 beneficial effect Effects 0.000 description 9
- 230000000694 effects Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000001514 detection method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000002028 premature Effects 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a communication transmission data management method and a system, which belong to the technical field of data transmission, wherein the method comprises the following steps: acquiring sensor data acquired by each sensor node, wherein the sensor data comprises: combustible gas monitoring sensor data, smoke monitoring sensor data, water logging monitoring sensor data and illegal intrusion monitoring sensor data; determining the dependency relationship among the sensor data according to the spatial relationship and the functional relationship; packaging the sensor data according to the dependency relationship among the sensor data to obtain a data packet; constructing a communication transmission model by taking the shortest total transmission duration and the smallest load imbalance as targets, and determining a data packet transmission sequence; transmitting the data packet according to the data packet transmission sequence; extracting sensor data in the data packet, and performing anomaly monitoring, wherein the anomaly monitoring comprises: combustible gas monitoring, smoke monitoring, water logging monitoring and illegal intrusion monitoring.
Description
Technical Field
The invention belongs to the technical field of data transmission, and particularly relates to a communication transmission data management method and system.
Background
The intelligent community is a community construction mode which aims at improving community management efficiency, providing more convenient resident service and enhancing community safety by utilizing advanced information technology and Internet of things technology. The smart community integrates a variety of technical and innovative solutions to create a more intelligent, efficient, sustainable living environment.
When the current intelligent community system collects sensor data, a current relatively idle channel is often selected to transmit according to the sequence of data generation time, load imbalance is easy to cause, delay of data transmission is increased, and data transmission efficiency is reduced. In addition, the current data transmission mode ignores the relativity between data, when a certain abnormal monitoring is executed, multiple aspects of data are often needed, if one item of data is transmitted in place, the monitoring function can be executed only by waiting for another item of data for a long time, extra waiting time is generated, the data processing efficiency is reduced, the monitoring function cannot respond in time, and the real-time performance of monitoring is affected.
Disclosure of Invention
In order to solve the technical problems that load imbalance is easy to cause, data transmission delay is increased, data transmission efficiency is reduced, the current data transmission mode ignores the relativity between data, multiple aspects of data are often needed when a certain abnormal monitoring is executed, if one item of data is transmitted in place, the monitoring function can be executed only after waiting for another item of data for a long time, extra waiting time is generated, data processing efficiency is reduced, the monitoring function cannot respond in time, and real-time monitoring is affected.
First aspect
The invention provides a communication transmission data management method, which comprises the following steps:
s1: acquiring sensor data acquired by each sensor node, wherein the sensor data comprises: combustible gas monitoring sensor data, smoke monitoring sensor data, water logging monitoring sensor data and illegal intrusion monitoring sensor data;
s2: determining the dependency relationship among the sensor data according to the spatial relationship and the functional relationship;
s3: packaging the sensor data according to the dependency relationship among the sensor data to obtain a data packet;
s4: constructing a communication transmission model by taking the shortest total transmission duration and the smallest load imbalance as targets, and determining a data packet transmission sequence;
s5: transmitting the data packet according to the data packet transmission sequence;
s6: extracting sensor data in a data packet, and performing anomaly monitoring, wherein the anomaly monitoring comprises: combustible gas monitoring, smoke monitoring, water logging monitoring and illegal intrusion monitoring.
Second aspect
The invention provides a communication transmission data management system, which comprises a processor and a memory for storing executable instructions of the processor; the processor is configured to invoke the instructions stored in the memory to perform the communication transmission data management method of the first aspect.
Compared with the prior art, the invention has at least the following beneficial technical effects:
(1) In the invention, the communication transmission model is constructed with the aim of shortest total transmission duration and minimum load unbalance, the data packet transmission sequence is optimized, and then the data packet transmission is carried out according to the data packet transmission sequence, so that the system load unbalance can be reduced, the transmission time is shortened, the transmission delay is reduced, and the data transmission efficiency is improved.
(2) According to the invention, the dependency relationship among the sensor data is determined according to the spatial relationship and the functional relationship, the sensor data is packed according to the dependency relationship among the sensor data to obtain the data packet, and the data packet is taken as a unit for data transmission, so that the situation that multiple aspects of data are often needed when a certain abnormal monitoring is executed is avoided, and if one item of data is already transmitted in place, the monitoring function can be executed only after waiting for another item of data for a long time is needed, the waiting time of data processing is reduced, the data processing efficiency is improved, the monitoring function can respond in time, and the real-time performance of abnormal monitoring is improved.
Drawings
The above features, technical features, advantages and implementation of the present invention will be further described in the following description of preferred embodiments with reference to the accompanying drawings in a clear and easily understood manner.
Fig. 1 is a flow chart of a communication transmission data management method provided by the invention.
Fig. 2 is a schematic structural diagram of a communication transmission data management system according to the present invention.
Detailed Description
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description will explain the specific embodiments of the present invention with reference to the accompanying drawings. It is evident that the drawings in the following description are only examples of the invention, from which other drawings and other embodiments can be obtained by a person skilled in the art without inventive effort.
For simplicity of the drawing, only the parts relevant to the invention are schematically shown in each drawing, and they do not represent the actual structure thereof as a product. Additionally, in order to simplify the drawing for ease of understanding, components having the same structure or function in some of the drawings are shown schematically with only one of them, or only one of them is labeled. Herein, "a" means not only "only this one" but also "more than one" case.
It should be further understood that the term "and/or" as used in the present specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes such combinations.
In this context, it should be noted that the terms "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected, unless otherwise explicitly stated and defined. Either mechanically or electrically. Can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.
In addition, in the description of the present invention, the terms "first," "second," and the like are used merely to distinguish between descriptions and are not to be construed as indicating or implying relative importance.
Example 1
In one embodiment, referring to fig. 1 of the specification, a flow chart of a communication transmission data management method provided by the invention is shown.
The invention provides a communication transmission data management method, which comprises the following steps:
s1: sensor data acquired by each sensor node is acquired.
Wherein the sensor data comprises: combustible gas monitoring sensor data, smoke monitoring sensor data, water logging monitoring sensor data, and intrusion monitoring sensor data.
Accordingly, a combustible gas monitoring sensor, a smoke monitoring sensor, a water logging monitoring sensor and an illegal intrusion monitoring sensor can be installed at proper positions.
S2: and determining the dependency relationship among the sensor data according to the spatial relationship and the functional relationship.
In one possible embodiment, S2 specifically includes:
s201: and determining the dependency relationship between the sensor data in the same house space according to the spatial relationship indicated by house numbers.
According to the invention, the dependency relationship between the sensor data in the same house space is determined according to the spatial relationship indicated by house number, so that the sensor data in adjacent houses or the same house can be better captured, the relevance of the data is improved, and the system can more accurately understand and analyze the conditions in the house.
S202: and determining the dependency relationship between the sensor data required by the same monitoring function according to the functional relationship indicated by the monitoring function.
Wherein the dependency relationship may include: the same-layer dependency relationship, the same-room dependency relationship, the same-function monitoring relationship and the like.
According to the invention, the dependency relationship between the sensor data required by the same monitoring function is determined according to the functional relationship indicated by the monitoring function, thereby being beneficial to optimizing the execution of the monitoring function. The system can coordinate and integrate the needed sensor data more effectively to meet the requirements of specific monitoring functions, thereby improving the accuracy and practicability of monitoring.
S3: and packaging the sensor data according to the dependency relationship among the sensor data to obtain a data packet.
In one possible embodiment, S3 is specifically: and packaging the sensor data according to house numbers and monitoring functions according to the dependency relationship among the sensor data.
According to the invention, the dependency relationship among the sensor data is determined according to the spatial relationship and the functional relationship, the sensor data is packed according to the dependency relationship among the sensor data to obtain the data packet, and the data packet is taken as a unit for data transmission, so that the situation that multiple aspects of data are often needed when a certain abnormal monitoring is executed is avoided, and if one item of data is already transmitted in place, the monitoring function can be executed only after waiting for another item of data for a long time is needed, the waiting time of data processing is reduced, the data processing efficiency is improved, the monitoring function can respond in time, and the real-time performance of abnormal monitoring is improved.
S4: and constructing a communication transmission model by taking the shortest total transmission duration and the smallest load imbalance as targets, and determining a data packet transmission sequence.
In one possible implementation manner, the training manner of the communication transmission model specifically includes:
s401: and constructing an objective function of a communication transmission model by taking the shortest total transmission duration and the smallest load imbalance as targets:
where min () represents a minimum function,F() Representing the objective function of the communication transmission model,Xa sequence of data packet transmissions is indicated,，x ij is shown in the firstiTransmission of the first channeljThe number of packets of data that are to be transmitted,Tindicating the total duration of the data transmission,α 1 a weight coefficient representing the total duration of the data transmission,σindicating the degree of load imbalance and,α 2 a weight coefficient representing the degree of load imbalance,，nrepresents the total number of channels>，mRepresenting the total number of packets.
Wherein the total duration of data transmissionTThe calculation mode of (a) is as follows:
wherein,t ij is shown in the firstiTransmission of the first channeljThe transmission time of each data packet.
In the invention, by aiming at the shortest total transmission duration, the system can more effectively arrange the transmission sequence of the data packets and reduce the transmission time, thereby reducing the overall transmission delay. This is particularly important for application scenarios with high real-time requirements, such as security monitoring and emergency alert systems.
Wherein the load imbalance degreeσThe calculation mode of (a) is as follows:
wherein,s i represent the firstiThe total amount of data transmitted by the individual channels,representing the average amount of data transmitted by each channel.
In the invention, the aim of minimizing the load unbalance can lead the system to more uniformly utilize each channel, and avoid the performance degradation caused by overload of some channels. By optimizing the load distribution, the overall efficiency of the system can be improved, and the more full utilization of resources is ensured.
S402: and setting constraint conditions of a communication transmission model.
S403: under the constraint of constraint conditions, training a communication transmission model by taking the minimum function value of an objective function as a target, and determining an optimal data packet transmission sequence.
According to the intelligent community system, through the constraint condition setting and training process, the system can be better adapted to different working environments and network states, the stability and the robustness of the system are improved, and the intelligent community system has important significance for stable operation in complex and dynamic environments.
In one possible implementation, the constraints include:
number of channels constraint:
。
it should be noted that the channel number constraint may ensure that each data is transmitted in only one channel.
Packet number constraint:
。
it should be noted that the packet number constraint may ensure that each data is transmitted only once.
Data commonality constraint: when the data packet is simultaneously required by a plurality of abnormality monitoring functions, the data packet is preferentially transmitted.
It should be noted that, through the constraint of data sharing, the system can transmit the data packet required by multiple abnormal monitoring functions at the same time preferentially, which is helpful for improving the stability of the system, and ensures that the abnormal monitoring functions are supported by timely and accurate data, thereby reducing the possibility of false alarm and missing alarm of the system.
Result dependency constraints: when the processing of the first data packet is needed by the processing result of the second data packet, the second data packet is transmitted before the first data packet.
It should be noted that, the result dependency constraint ensures that when executing a certain monitoring function, the system can transmit the required data packet in advance to meet the requirement of the result dependency, thereby being beneficial to optimizing the data processing flow, reducing the waiting time and improving the real-time performance and efficiency of the monitoring function.
The result dependency constraint ensures that when a monitoring function is performed, the system can transmit the required data packets in advance to meet the requirement of the result dependency. This helps to optimize the data processing flow, reduce latency, and improve the real-time and efficiency of the monitoring function.
In one possible implementation manner, the present invention proposes a completely new genetic algorithm to perform global search, and S403 specifically includes:
s4031: and performing global search through an improved genetic algorithm to determine a set of preferred data packet transmission sequences.
In one possible embodiment, S4031 specifically includes:
the initialization is carried out, wherein the population comprises a plurality of individuals, and each individual represents a data packet transmission sequence.
According to the objective function, determining the fitness function of the optimizing algorithm:
wherein,τ() The fitness function is represented as a function of the fitness,τthe value of the fitness is indicated as such,F() The function of the object is represented by a function of the object,Xrepresenting a sequence of packet transmissions.
And calculating the fitness value of each individual.
Individuals with the lowest fitness value were removed by elite retention strategy.
In the invention, by removing a part of individuals with the lowest fitness value, the algorithm can keep individuals with higher fitness, thereby being beneficial to preventing losing excellent gene information in the evolution process and ensuring that the excellent individuals can continue to play a role in the subsequent evolution.
Randomly selecting two individuals to generate a random number, comparing the random number with the crossover probability, and performing gene crossover operation when the random number is larger than the crossover probability to generate a new individual:
wherein,A 1 、A 2 representing a new individual to be treated,a 1 、a 2 representing the old individual and the old individual,βrepresenting the crossover coefficient.
In the invention, a new individual is generated by using a linear interpolation mode, so that discontinuity caused by mutation type cross is avoided, smooth transition is helpful for keeping certain continuity between the new individual and a parent individual, convergence and searching effects are facilitated, and excessive damage to the characteristics of the parent individual is avoided.
Alternatively, the crossover probability may be a pre-configured constant.
Wherein the cross coefficientβThe calculation mode of (a) is as follows:
wherein,r 1 representing a random number between 0 and 1,η 1 indicating the crossover index.
The cross coefficient is thatβThe calculation mode of (a) considers random numbersr 1 And cross indexη 1 By adjusting the crossing indexη 1 Can be used forTo control the magnitude of the crossover to affect the manner in which new individuals are generated.
In the invention, by combining the excellent features of the two parent individuals, the crossover operation can lead the offspring individuals to converge to a better solution more quickly, which is helpful for the algorithm to find the potential excellent solution more quickly and accelerates the global search process of the algorithm. Meanwhile, the cross operation is helpful to avoid premature, namely the algorithm falls into a local optimal solution and cannot continue to explore a better solution, and the cross operation enables the algorithm to have global searching capability through introducing diversity.
And (3) randomly generating a random number by part of individuals, comparing the random number with the mutation probability, and performing genetic mutation operation when the random number is larger than the mutation probability to generate a new individual:
wherein,A 3 representing a new individual to be treated,a 3 representing the old individual and the old individual,a max representing the individual with the greatest current fitness value,a min representing the individual with the smallest current fitness value,λrepresenting the coefficient of variation.
In the present invention, polynomial variation achieves a smooth transition to individual genes by introducing a small perturbation to each gene of the old individual. Compared with the existing mutant mutation, the polynomial mutation is more likely to retain the information of the original gene, and helps to avoid instability caused by excessive mutation.
Wherein the coefficient of variationλThe calculation mode of (a) is as follows:
wherein,r 2 representing a random number between 0 and 1,η 2 indicating the mutation index.
The coefficient of variationλThe calculation mode of (a) considers random numbersr 2 Index of variationη 2 By adjustingIndex of variationη 2 The magnitude of the variation can be controlled to affect the manner in which new individuals are generated.
In one possible embodiment, the mutation probability is specifically:
wherein,Prepresenting the probability of variation of the current individual,P max the probability of the maximum variation is indicated,P min the probability of a minimum variation is indicated,τindicating the fitness of the current individual,τ avg indicating the average fitness of the population,τ max representing the maximum fitness in the individual.
It should be noted that, the individual having the fitness higher than the average level has a lower mutation probability, whereas the individual having the fitness lower than the average level has a higher mutation probability. This adaptation helps to maintain diversity of the population and allows for the introduction of greater variation on individuals with lower fitness to facilitate exploration space. Meanwhile, the method helps to avoid the population from converging to the local optimal solution in early stage by dynamically adjusting the variation probability according to the individual fitness. In the early stage, as fewer individuals with high fitness and larger mutation probability are adopted, global searching is facilitated; in the later period, the number of individuals with high fitness is relatively large, the mutation probability is reduced, and local search and convergence are facilitated.
And judging whether the maximum iteration times are reached. If yes, outputting the currently reserved individual as a preferred data packet transmission sequence set. Otherwise, the iteration is continued.
In the invention, the traditional genetic algorithm may be in a local optimal solution in global search, and more intelligent selection, crossing and mutation strategies are introduced through the improved genetic algorithm, so that the global search capacity of the algorithm is improved, and the method is beneficial to more effectively searching a better data packet transmission sequence in the whole search space.
S4032: and carrying out local optimization in the set of the optimal data packet transmission sequences by an improved simplex method to determine the optimal data packet transmission sequence.
In one possible implementation, the present invention proposes a completely new simplex algorithm to perform global search, and S4032 specifically includes:
selecting top-ranked fitness from a set of preferred data packet transmission sequenceskIndividuals form vertices of simplex, where the most adaptable individualM B For the optimal mapping scheme, the individual with the second highest fitnessM G For sub-optimal mapping schemes, the individuals with the lowest fitnessM W Is the worst mapping scheme.
Determination of the reflection center of simplexM C Reflection centerM C The method meets the following conditions:
wherein,M C indicating the center of reflection,τ(M C ) Indicating the degree of conformity of the centre of reflection,τ avg the average degree of adaptation is indicated as such,εrepresenting centroid offset values.
By adjusting the centroid deviation valueεThe degree of guidance of the selection of the reflection center for the search can be controlled. Smaller centroid offset valueεWill bring the reflection center closer to the average fitness, with larger centroid bias valuesεIndividuals that may be farther from the average fitness are selected to help find a balance between global and local searches.
The average fitness is calculated by the following steps:
wherein,M i represent the firstiThe number of vertices of the graph is,τ(M i ) Represent the firstiThe degree of adaptation of the individual vertices,，mrepresenting the total number of vertices of the simplex.
In the present invention, by controlling the selection of the reflection center, the algorithm can be directed to search toward a direction that is more likely to contain a globally optimal solution.
When the current vertex satisfiesWhen it is, then calculate the current vertexM i Through the reflection centerM C Reflection point after reflectionM R ：
Wherein,M R indicating the point of reflection and,θrepresenting the reflection coefficient of the light,，τ(M W ) Representation ofM W Is used for the degree of adaptation of the system,τ(M C ) Representation ofM C Is used for the adaptation degree of the device.
The reflection coefficient is thatθThe adjustment of (2) can control the degree of reflection, i.e. the amplitude of movement in the current search direction, the search step can be adjusted according to the characteristics of the problem, so that the search is more accurate.
When (when)At the time, to reflection pointM R Performing expansion operation to obtain new individualM E ：
Wherein,M E representing a new individual after expansion of the patient,γthe coefficient of expansion is represented by the coefficient of expansion,，F(M R ) Representation ofM R Is used for the degree of adaptation of the system,τ(M B ) Representation ofM B Is used for the adaptation degree of the device.
Wherein the expansion coefficientγThe expansion degree can be controlled, so that the algorithm has more diversity in the search space, the phenomenon of falling into the same search path is avoided, and the global exploration of the search space is increased.
When (when)When using new individualsM E Replacing the current individual, otherwise, using reflection pointsM R In place of the current individual,τ(M E ) Representation ofM E Is used for the adaptation degree of the device.
When (when)When using reflection pointsM R Replacing the current individual.
When (when)At the time, to reflection pointM R Performing contraction operation to obtain new individualM T ：
Wherein,M T representing a new individual after the contraction of the individual,μthe coefficient of contraction is indicated as being the coefficient of contraction,。
the shrinkage factor is thatμThe degree of contraction can be controlled, so that the algorithm can be more specifically adjusted in the searching process, and the method is beneficial to meeting the requirements of different problems and searching states.
When (when)When using new individualsM T Replacing the current individual, otherwise, removing the optimal individualM B All but the individuals are along themselves to the optimal individualM B Is moved half the distance, the simplex configuration is reconstructed, iteration is performed,τ(M T ) Representation ofM T Is used for the adaptation degree of the device.
And judging whether the maximum iteration times are reached. If so, taking the optimal simplex vertex as an optimal data packet transmission sequence, and outputting the optimal data packet transmission sequence. Otherwise, the iteration is continued.
In the invention, the genetic algorithm is good at global search, and can be widely explored in a search space to find a global optimal solution through the evolution process of the population. The simplex algorithm is more suitable for local optimization, and fine search of a local optimal solution is realized by gradually adjusting the shape of the simplex. Combining the two can find a balance between global and local, avoiding premature convergence to a locally optimal solution.
S5: and transmitting the data packets according to the data packet transmission sequence.
S6: and extracting sensor data in the data packet, and performing anomaly monitoring.
Wherein, anomaly monitoring includes: combustible gas monitoring, smoke monitoring, water logging monitoring and illegal intrusion monitoring.
In one possible implementation, S6 specifically includes:
s601: and extracting the combustible gas monitoring sensor data in the data packet, and sending out an alarm when the concentration of the combustible gas is higher than a first preset concentration value.
The size of the first preset concentration value can be set by a person skilled in the art according to practical situations, and the invention is not limited.
In the present invention, an alarm is raised when the flammable gas concentration is above a first predetermined concentration value, helping to avoid a potential fire or explosion hazard.
S602: and extracting smoke monitoring sensor data in the data packet, and sending out an alarm when the smoke concentration is higher than a second preset concentration value.
The size of the second preset concentration value can be set by a person skilled in the art according to practical situations, and the invention is not limited.
In the invention, when the smoke concentration is higher than the second preset concentration value, an alarm is sent out, and the alarm can be sent out at an early stage before smoke or fire outbreak, thereby being beneficial to improving the safety and reducing the damage caused by the fire.
S603: and extracting the data of the water logging monitoring sensor in the data packet, and sending out an alarm when the conductivity of the water logging monitoring sensor is higher than the preset conductivity.
The size of the preset conductivity can be set by a person skilled in the art according to practical situations, and the invention is not limited.
In the present invention, when the conductivity of the water logging sensor is higher than the preset conductivity, it may indicate that water logging is occurring, giving an alarm, which is very useful for waterproof and water leakage proof scenarios, such as around a basement or a water source.
S604: and extracting illegal intrusion monitoring sensor data in the data packet, and sending out an alarm when the movement of the suspicious object is detected.
Specifically, an infrared sensor may be employed for monitoring, and then based on the infrared data, an object detection algorithm (e.g., YOLO, SSD, fast R-CNN, etc.) may be used to detect objects within the monitored area, and motion changes within the sensor field of view may be detected by the motion detection algorithm. The object detection algorithm and the motion detection algorithm are already very mature prior art, and the present invention is not repeated for avoiding repetition.
Compared with the prior art, the invention has at least the following beneficial technical effects:
(1) In the invention, the communication transmission model is constructed with the aim of shortest total transmission duration and minimum load unbalance, the data packet transmission sequence is optimized, and then the data packet transmission is carried out according to the data packet transmission sequence, so that the system load unbalance can be reduced, the transmission time is shortened, the transmission delay is reduced, and the data transmission efficiency is improved.
(2) According to the invention, the dependency relationship among the sensor data is determined according to the spatial relationship and the functional relationship, the sensor data is packed according to the dependency relationship among the sensor data to obtain the data packet, and the data packet is taken as a unit for data transmission, so that the situation that multiple aspects of data are often needed when a certain abnormal monitoring is executed is avoided, and if one item of data is already transmitted in place, the monitoring function can be executed only after waiting for another item of data for a long time is needed, the waiting time of data processing is reduced, the data processing efficiency is improved, the monitoring function can respond in time, and the real-time performance of abnormal monitoring is improved.
In one possible embodiment, the communication transmission data management method further includes:
s7: according to the disconnection rate, the packet loss rate, the packet error rate and the throughput of each sensor node, working state parameters of each sensor node are calculated:
wherein,hthe parameter indicative of the operational state is provided,a 1 the packet loss rate is indicated by the number of packets,ρ 1 a weight coefficient representing the packet loss rate,a 2 indicating the rate of the error packets,ρ 2 a weight coefficient representing the error packet rate,a 3 the throughput is indicated by the term "throughput",ρ 3 a weight coefficient representing throughput.
Wherein, the person skilled in the art can set the weight coefficient of the packet loss rate according to the actual situationρ 1 Weight coefficient of error packet rateρ 2 And weight coefficient of throughputρ 3 The size of (3) is not limited in the present invention.
Packet loss ratea 1 The calculation mode of (a) is as follows:
wherein,B dis indicating lossThe number of the packets is equal to the number of the packets,B t indicating the total number of packets issued.
Error packet ratea 2 The calculation mode of (a) is as follows:
wherein,B err the number of erroneous packets is indicated and,B t indicating the total number of packets issued.
Throughput ofa 3 The calculation mode of (a) is as follows:
wherein,S in representing the total amount of data received within a preset time period,S out indicating the amount of data transmitted during a preset time period,t 0 indicating a preset time period.
S8: and when the working state parameter of the sensor node is smaller than the preset parameter value, an alarm is sent out.
In the invention, by monitoring indexes such as the wire-loss rate, the packet error rate, the throughput and the like, the system can know the working condition of each sensor node in real time, and when the working condition of the sensor node deviates from the expected or is lower than the set reasonable threshold value, the system can give an alarm in time, so that an operator or the system can quickly take action, and maintain and repair the node with the problem.
Example 2
In one embodiment, referring to fig. 2 of the specification, a schematic structural diagram of a communication transmission data management system provided by the present invention is shown.
The invention provides a communication transmission data management system, which comprises a processor 201 and a memory 202 for storing executable instructions of the processor 201. The processor 201 is configured to call the instructions stored in the memory 202 to execute the communication transmission data management method in embodiment 1.
The communication transmission data management system provided by the present invention can realize the steps and effects of the communication transmission data management method in the above embodiment 1, and in order to avoid repetition, the present invention is not repeated.
Compared with the prior art, the invention has at least the following beneficial technical effects:
(1) In the invention, the communication transmission model is constructed with the aim of shortest total transmission duration and minimum load unbalance, the data packet transmission sequence is optimized, and then the data packet transmission is carried out according to the data packet transmission sequence, so that the system load unbalance can be reduced, the transmission time is shortened, the transmission delay is reduced, and the data transmission efficiency is improved.
(2) According to the invention, the dependency relationship among the sensor data is determined according to the spatial relationship and the functional relationship, the sensor data is packed according to the dependency relationship among the sensor data to obtain the data packet, and the data packet is taken as a unit for data transmission, so that the situation that multiple aspects of data are often needed when a certain abnormal monitoring is executed is avoided, and if one item of data is already transmitted in place, the monitoring function can be executed only after waiting for another item of data for a long time is needed, the waiting time of data processing is reduced, the data processing efficiency is improved, the monitoring function can respond in time, and the real-time performance of abnormal monitoring is improved.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples illustrate only a few embodiments of the invention, which are described in detail and are not to be construed as limiting the scope of the invention. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the invention, which are all within the scope of the invention. Accordingly, the scope of protection of the present invention is to be determined by the appended claims.
Claims (10)
1. A method for managing communication transmission data, comprising:
s1: acquiring sensor data acquired by each sensor node;
s2: determining the dependency relationship among the sensor data according to the spatial relationship and the functional relationship;
s3: packaging the sensor data according to the dependency relationship among the sensor data to obtain a data packet;
s4: constructing a communication transmission model by taking the shortest total transmission duration and the smallest load imbalance as targets, and determining a data packet transmission sequence;
s5: transmitting the data packet according to the data packet transmission sequence;
s6: extracting sensor data in a data packet, and performing anomaly monitoring, wherein the anomaly monitoring comprises: combustible gas monitoring, smoke monitoring, water logging monitoring and illegal intrusion monitoring.
2. The method for managing communication transmission data according to claim 1, wherein S2 specifically comprises:
s201: determining the dependency relationship between sensor data in the same house space according to the space relationship indicated by house numbers;
s202: and determining the dependency relationship between the sensor data required by the same monitoring function according to the functional relationship indicated by the monitoring function.
The step S3 is specifically as follows:
and packaging the sensor data according to house numbers and monitoring functions according to the dependency relationship among the sensor data.
3. The method for managing communication transmission data according to claim 1, wherein the training mode of the communication transmission model specifically comprises:
s401: and constructing an objective function of the communication transmission model by taking the shortest total transmission duration and the smallest load imbalance as targets:
where min () represents a minimum function,F() Representing the objective function of the communication transmission model,Xa sequence of data packet transmissions is indicated,，x ij is shown in the firstiTransmission of the first channeljThe number of packets of data that are to be transmitted,Tindicating the total duration of the data transmission,α 1 a weight coefficient representing the total duration of the data transmission,σindicating the degree of load imbalance and,α 2 weight coefficient representing load imbalance, +.>，nRepresents the total number of channels>，mRepresenting the total number of data packets;
wherein the total duration of data transmissionTThe calculation mode of (a) is as follows:
wherein,t ij is shown in the firstiTransmission of the first channeljThe transmission time length of each data packet;
wherein the load imbalance degreeσThe calculation mode of (a) is as follows:
wherein,s i represent the firstiThe total amount of data transmitted by the individual channels,representing each ofAverage data amount transmitted by the channel;
s402: setting constraint conditions of the communication transmission model;
s403: under the constraint of the constraint condition, training the communication transmission model by taking the minimum function value of the objective function as the objective, and determining the optimal data packet transmission sequence.
4. A communication transmission data management method according to claim 3, wherein said constraint condition comprises:
number of channels constraint:
；
packet number constraint:
；
data commonality constraint: when the data packet is simultaneously required by a plurality of abnormality monitoring functions, the data packet is preferentially transmitted;
result dependency constraints: when the processing of a first data packet needs to be carried out by means of the processing result of a second data packet, the second data packet is transmitted before the first data packet.
5. The method for managing communication transmission data according to claim 3, wherein S403 specifically comprises:
s4031: performing global search through an improved genetic algorithm to determine a set of transmission sequences of the preferred data packets;
s4032: and carrying out local optimization in the set of the optimal data packet transmission sequences by an improved simplex method to determine the optimal data packet transmission sequence.
6. The method for managing communication transmission data according to claim 5, wherein S4031 specifically comprises:
initializing, wherein the population comprises a plurality of individuals, and each individual represents a data packet transmission sequence;
according to the objective function, determining an adaptability function of the optimizing algorithm:
wherein,τ() The fitness function is represented as a function of the fitness,τthe value of the fitness is indicated as such,F() The function of the object is represented by a function of the object,Xrepresenting a data packet transmission sequence;
calculating the fitness value of each individual;
removing 20% of individuals with the lowest fitness value through elite retention strategies;
randomly selecting two individuals to generate a random number, comparing the random number with the crossover probability, and performing gene crossover operation when the random number is larger than the crossover probability to generate a new individual:
wherein,A 1 、A 2 representing a new individual to be treated,a 1 、a 2 representing the old individual and the old individual,βrepresenting the crossover coefficient;
wherein the cross coefficientβThe calculation mode of (a) is as follows:
wherein,r 1 representing a random number between 0 and 1,η 1 represents a crossover index;
and (3) randomly generating a random number by part of individuals, comparing the random number with variation probability, and performing genetic variation operation when the random number is larger than the variation probability to generate a new individual:
wherein,A 3 representing a new individual to be treated,a 3 representing the old individual and the old individual,a max representing the individual with the greatest current fitness value,a min representing the individual with the smallest current fitness value,λrepresenting the coefficient of variation;
wherein the coefficient of variationλThe calculation mode of (a) is as follows:
wherein,r 2 representing a random number between 0 and 1,η 2 representing a mutation index;
judging whether the maximum iteration times are reached; if yes, outputting the currently reserved individual as a preferred data packet transmission sequence set; otherwise, the iteration is continued.
7. The method for managing communication transmission data according to claim 5, wherein S4032 specifically comprises:
selecting a top-ranked adaptation from the set of preferred packet transmission sequenceskIndividuals form vertices of simplex, where the most adaptable individualM B For the optimal mapping scheme, the individual with the second highest fitnessM G For sub-optimal mapping schemes, the individuals with the lowest fitnessM W Is the worst mapping scheme;
determination of the reflection center of simplexM C The reflection centerM C The method meets the following conditions:
wherein,M C indicating the center of reflection,τ(M C ) Watch (watch)Showing the degree of conformity of the centre of reflection,τ avg the average degree of adaptation is indicated as such,εrepresenting centroid offset values;
the average fitness is calculated by the following steps:
wherein,M i represent the firstiThe number of vertices of the graph is,τ(M i ) Represent the firstiThe degree of adaptation of the individual vertices,，mrepresenting the total number of vertices of the simplex;
when the current vertex satisfiesWhen it is, then calculate the current vertexM i Through the reflection centerM C Reflection point after reflectionM R ：
Wherein,M R indicating the point of reflection and,θrepresenting the reflection coefficient of the light,，τ(M W ) Representation ofM W Is used for the degree of adaptation of the system,τ(M C ) Representation ofM C Is adapted to the degree of adaptation of (a);
when (when)At the time, to reflection pointM R Performing expansion operation to obtain new individualM E ：
Wherein,M E representing a new individual after expansion of the patient,γthe coefficient of expansion is represented by the coefficient of expansion,，F(M R ) Representation ofM R Is used for the degree of adaptation of the system,τ(M B ) Representation ofM B Is adapted to the degree of adaptation of (a);
when (when)When using new individualsM E Replacing the current individual, otherwise, using reflection pointsM R In place of the current individual,τ(M E ) Representation ofM E Is adapted to the degree of adaptation of (a);
when (when)When using reflection pointsM R Replacing the current individual;
when (when)At the time, to reflection pointM R Performing contraction operation to obtain new individualM T ：
Wherein,M T representing a new individual after the contraction of the individual,μthe coefficient of contraction is indicated as being the coefficient of contraction,；
when (when)When using new individualsM T Replacing the current individual, otherwise, removing the optimal individualM B All but the individuals are along themselves to the optimal individualM B Is moved half the distance, the simplex configuration is reconstructed, iteration is performed,τ(M T ) Representation ofM T Is adapted to the degree of adaptation of (a);
judging whether the maximum iteration times are reached; if so, taking the optimal simplex vertex as an optimal data packet transmission sequence, and outputting the optimal data packet transmission sequence; otherwise, the iteration is continued.
8. The method for managing communication transmission data according to claim 1, wherein S6 specifically comprises:
s601: extracting the data of a combustible gas monitoring sensor in the data packet, and sending out an alarm when the concentration of the combustible gas is higher than a first preset concentration value;
s602: extracting smoke monitoring sensor data in the data packet, and sending out an alarm when the smoke concentration is higher than a second preset concentration value;
s603: extracting data of a water logging monitoring sensor in the data packet, and sending out an alarm when the conductivity of the water logging monitoring sensor is higher than a preset conductivity;
s604: and extracting illegal intrusion monitoring sensor data in the data packet, and sending out an alarm when the movement of the suspicious object is detected.
9. The communication transmission data management method according to claim 1, further comprising:
s7: according to the disconnection rate, the packet loss rate, the packet error rate and the throughput of each sensor node, working state parameters of each sensor node are calculated:
wherein,hthe parameter indicative of the operational state is provided,a 1 the packet loss rate is indicated by the number of packets,ρ 1 a weight coefficient representing the packet loss rate,a 2 indicating the rate of the error packets,ρ 2 a weight coefficient representing the error packet rate,a 3 the throughput is indicated by the term "throughput",ρ 3 a weight coefficient representing throughput;
s8: and when the working state parameter of the sensor node is smaller than the preset parameter value, an alarm is sent out.
10. A communication transmission data management system comprising a processor and a memory for storing processor-executable instructions; the processor is configured to invoke the instructions stored in the memory to perform the communication transmission data management method of any of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311600141.2A CN117675961B (en) | 2023-11-28 | Communication transmission data management method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311600141.2A CN117675961B (en) | 2023-11-28 | Communication transmission data management method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117675961A true CN117675961A (en) | 2024-03-08 |
| CN117675961B CN117675961B (en) | 2024-06-25 |
Family
ID=
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102547776A (en) * | 2012-01-10 | 2012-07-04 | 南京邮电大学 | Wireless sensor network model conversion method based on model driving and evolutionary algorithm |
| CN109919376A (en) * | 2019-03-01 | 2019-06-21 | 浙江工业大学 | Multi-field model and multi-vehicle-type vehicle route dispatch control method |
| CN110276101A (en) * | 2019-05-17 | 2019-09-24 | 杭州电子科技大学 | Articulated coordinate machine scaling method based on differential evolution simplex algorithm |
| CN113573322A (en) * | 2021-07-23 | 2021-10-29 | 杭州电子科技大学 | Multi-target area sensor network coverage optimization method based on improved genetic algorithm |
| CN113822584A (en) * | 2021-09-26 | 2021-12-21 | 深圳市叁立智汇科技有限公司 | Automatic industrial management system of wisdom community based on thing networking |
| CN114386659A (en) * | 2021-12-06 | 2022-04-22 | 西安交通大学 | Pump pipe optimization method for water system of nuclear power plant |
| CN115098285A (en) * | 2022-05-23 | 2022-09-23 | 广州晶石传感技术有限公司 | Sensor detection data analysis system and method based on big data |
| CN115373374A (en) * | 2022-10-26 | 2022-11-22 | 山东省计算中心（国家超级计算济南中心） | Industrial control abnormity detection method and system based on graph nerve and gated loop network |
| CN115618196A (en) * | 2022-10-18 | 2023-01-17 | 湖北工业大学 | Transformer anomaly detection method based on space-time characteristics |
| CN116629075A (en) * | 2023-06-19 | 2023-08-22 | 重庆邮电大学 | Irreversible electroporation tissue ablation finite element model optimization method and system based on Nelder-Mead algorithm |
| CN116866218A (en) * | 2023-08-29 | 2023-10-10 | 无锡安鑫卓越智能科技有限公司 | Network performance detection method and system |
| CN117072891A (en) * | 2023-10-13 | 2023-11-17 | 中国石油大学(华东) | Real-time intelligent leakage monitoring and positioning method for hydrogen conveying pipe network under abnormal sample-free condition |
| CN117762515A (en) * | 2023-11-24 | 2024-03-26 | 天翼云科技有限公司 | Page loading method and system based on hybrid genetic algorithm |
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102547776A (en) * | 2012-01-10 | 2012-07-04 | 南京邮电大学 | Wireless sensor network model conversion method based on model driving and evolutionary algorithm |
| CN109919376A (en) * | 2019-03-01 | 2019-06-21 | 浙江工业大学 | Multi-field model and multi-vehicle-type vehicle route dispatch control method |
| CN110276101A (en) * | 2019-05-17 | 2019-09-24 | 杭州电子科技大学 | Articulated coordinate machine scaling method based on differential evolution simplex algorithm |
| CN113573322A (en) * | 2021-07-23 | 2021-10-29 | 杭州电子科技大学 | Multi-target area sensor network coverage optimization method based on improved genetic algorithm |
| CN113822584A (en) * | 2021-09-26 | 2021-12-21 | 深圳市叁立智汇科技有限公司 | Automatic industrial management system of wisdom community based on thing networking |
| CN114386659A (en) * | 2021-12-06 | 2022-04-22 | 西安交通大学 | Pump pipe optimization method for water system of nuclear power plant |
| CN115098285A (en) * | 2022-05-23 | 2022-09-23 | 广州晶石传感技术有限公司 | Sensor detection data analysis system and method based on big data |
| CN115618196A (en) * | 2022-10-18 | 2023-01-17 | 湖北工业大学 | Transformer anomaly detection method based on space-time characteristics |
| CN115373374A (en) * | 2022-10-26 | 2022-11-22 | 山东省计算中心（国家超级计算济南中心） | Industrial control abnormity detection method and system based on graph nerve and gated loop network |
| CN116629075A (en) * | 2023-06-19 | 2023-08-22 | 重庆邮电大学 | Irreversible electroporation tissue ablation finite element model optimization method and system based on Nelder-Mead algorithm |
| CN116866218A (en) * | 2023-08-29 | 2023-10-10 | 无锡安鑫卓越智能科技有限公司 | Network performance detection method and system |
| CN117072891A (en) * | 2023-10-13 | 2023-11-17 | 中国石油大学(华东) | Real-time intelligent leakage monitoring and positioning method for hydrogen conveying pipe network under abnormal sample-free condition |
| CN117762515A (en) * | 2023-11-24 | 2024-03-26 | 天翼云科技有限公司 | Page loading method and system based on hybrid genetic algorithm |
Non-Patent Citations (7)
| Title |
|---|
| 何伟娜;胡海峰;: "一种改进型的遗传算法在配料系统中的应用", 数字技术与应用, no. 08, 15 August 2010 (2010-08-15) * |
| 刘佳;宋涛;胡颖;庄雷;: "基于混合遗传算法的虚拟网络映射方法研究", 小型微型计算机系统, no. 04, 15 April 2016 (2016-04-15) * |
| 曹义亲;陈宁霞;黄晓生;: "一种带混合联盟的无线传感器网络任务分配策略", 计算机科学, no. 03, 15 March 2017 (2017-03-15) * |
| 李鹏;彭嘉潮;黄培炜;刘根柱;杜艺博;: "基于双目标传感器分布优化的转向架构架状态监测", 中国测试, no. 09, 30 September 2020 (2020-09-30) * |
| 程春玲;李阳;张登银;: "基于遗传算法的层次化云资源监测方法", 南京大学学报(自然科学版), no. 04, 30 July 2013 (2013-07-30) * |
| 赖文星;邓忠民;: "基于支配强度的NSGA2改进算法", 计算机科学, no. 06, 15 June 2018 (2018-06-15) * |
| 金叶;孙越泓;王加翠;王丹;: "基于单纯形的改进精英人工蜂群算法", 郑州大学学报(工学版), no. 06, 4 September 2018 (2018-09-04) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Maleh et al. | A global hybrid intrusion detection system for wireless sensor networks | |
| CN112653682B (en) | Method and device for detecting block chain eclipse attack | |
| CN107733877B (en) | Management method and system for wireless communication architecture of Internet of things | |
| CN113573322B (en) | Multi-target area sensor network coverage optimization method based on improved genetic algorithm | |
| CN110225478B (en) | Inter-cluster data transmission method for wireless sensor network | |
| Kaur et al. | An intelligent fault tolerant data routing scheme for wireless sensor network-assisted industrial internet of things | |
| Correia et al. | Energy-based acoustic localization by improved elephant herding optimization | |
| CN111065108B (en) | Low-power-consumption self-adaptive clustering routing method based on energy and trust model | |
| Pasikhani et al. | Reinforcement-Learning-based IDS for 6LoWPAN | |
| CN117675961B (en) | Communication transmission data management method and system | |
| CN117675961A (en) | Communication transmission data management method and system | |
| Yang et al. | A mobile sensors dispatch scheme based on improved SOM algorithm for coverage hole healing | |
| Su et al. | A trust model for underwater acoustic sensor networks based on fast link quality assessment | |
| Zhang | WSN Network Node Malicious Intrusion Detection Method Based on Reputation Score | |
| Tian et al. | Network intrusion detection method based on high speed and precise genetic algorithm neural network | |
| WO2023159812A1 (en) | Method and apparatus for detecting ami network intrusion, and medium | |
| Kun et al. | Network security situation evaluation method based on attack intention recognition | |
| Karthik et al. | Data trustworthiness in wireless sensor networks | |
| Rao et al. | A novel optimization based energy efficient and secured routing scheme using SRFIS-CWOSRR for wireless sensor networks | |
| CN113923541A (en) | Hazardous chemical substance monitoring system | |
| CN107612916B (en) | Distributed intrusion detection method based on ant colony fusion algorithm | |
| Reddy et al. | Agent-based trust calculation in wireless sensor networks | |
| Khalil et al. | CDS based reliable topology control in WSNs | |
| Bhavadharini et al. | An obstacle aware efficient MANET routing with optimized Bi-LSTM and multi-objective constraints on improved heuristic algorithm | |
| Ren et al. | Multi-feature fusion energy-saving routing in internet of things based on hybrid ant colony algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |