Electric energy meter capable of enhancing communication efficiency and concentrator
By applying particle swarm optimization algorithm and fitness function to screen the electric energy meter in the electric energy meter communication, the problem of long convergence time of traditional algorithms is solved, and the communication efficiency and intelligence level are improved.
Patent Information
- Application Number
- CN202510607971.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-13
- Publication Date
- 2025-06-13
- Estimated Expiration
- 2045-05-13
AI Technical Summary
The traditional particle swarm algorithm converges for too long in the power meter communication, resulting in a decrease in communication efficiency and being unable to respond to dynamically changing communication environments in a timely manner.
By constructing a fitness function, the electrical energy table used to upload data is selected and particles are randomly removed during the iteration process to accelerate particle aggregation and find the optimal solution.
It improves the communication efficiency of power meter, achieves faster data transmission and higher intelligence, and can respond to dynamic changes in the communication environment in a timely manner.
Smart Images

Figure CN120151690A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of data processing. More specifically, the present invention relates to an electric energy meter and a concentrator for enhancing communication efficiency. Background Art
[0002] In modern power systems, the electric energy metering system adopts a three-level architecture of "terminal - concentrator - master station". As a terminal sensing layer device, the electric energy meter is responsible for collecting user power consumption data. The concentrator realizes regional data aggregation through multimode communication modules such as power line carrier and micro-power wireless. The master station relies on high-speed channels such as optical fiber / 4G to complete global data integration. This architecture is the underlying core of the power Internet of Things and directly supports key services such as electricity bill settlement, load forecasting, and power grid regulation. However, with the development of smart grids towards high concurrency and low latency, traditional communication mechanisms have gradually exposed significant bottlenecks in aspects such as dynamic scheduling, anti-interference, and real-time performance. For example, the Chinese patent application document with the publication number CN118280094A discloses an electric energy meter and a concentrator for enhancing carrier communication efficiency. The electric energy meter includes: a power quality monitoring module, a circuit signal processing module, a filter parameter selection module, a filter adjustment module, and a Web database. By setting each monitoring period, monitoring the circuit quality data in the power line in real time, and analyzing the state of the power line within the monitoring period, the working parameters of the filter are determined, and then the filter is adjusted.
[0003] However, when the existing technology uses the particle swarm optimization algorithm to find an intelligent scheduling scheme for uploading electric energy meter data, due to the relatively small amount of data uploaded by a single electric energy meter, the goal of the traditional particle swarm optimization algorithm is to find the global optimal solution, resulting in too long a convergence time. The obtained intelligent scheduling scheme cannot respond in time to the dynamic changes in the communication environment, leading to a reduction in the communication efficiency of the electric energy meter. Enhancing the communication efficiency of the electric energy meter and the concentrator can significantly improve the data processing speed and accuracy, and contribute to enhancing the intelligent level of the power grid. Summary of the Invention
[0004] To solve the technical problem that the long convergence time of the above-mentioned traditional particle swarm optimization algorithm leads to a reduction in the communication efficiency of the electric energy meter, the present invention provides solutions in the following aspects.
[0005] In a first aspect, a watt-hour meter for enhancing communication efficiency includes: a data acquisition unit configured to acquire the operation data of multiple watt-hour meters at the current moment, where the operation data includes: the size of the data to be uploaded by the watt-hour meter, the communication delay, and the load sizes of the nodes of the channel where the watt-hour meter is located; a data processing unit configured to receive the operation data output by the acquisition unit and screen out the watt-hour meters for uploading data, including: constructing a fitness function and a predetermined number of particles; calculating the fitness of each particle, where the fitness of the particle is related to the values of each dimension of the position of the particle; performing iterations through a particle swarm optimization algorithm, and randomly removing particles in each round of iteration, where randomly removing particles includes: calculating the approach degree between two particles and grouping the particles according to the approach degree between each pair of particles to obtain multiple groups of approaching particles, selecting the midpoint of each group of approaching particles as a monitoring particle, and randomly removing the particles that do not belong to the group of approaching particles when the fitness of the monitoring particle in a group of approaching particles is greater than a predetermined multiple of the fitness of all particles in the group of approaching particles; obtaining the particle with the highest fitness after completing a predetermined number of iterations, denoted as the optimal particle; using the i dimension of the position of the optimal particle as the i upload probability of the
[0006] ith watt-hour meter, and selecting the data of the watt-hour meters with the upload probability greater than a preset probability threshold for uploading, where i is a positive integer.
[0007] Advantageous effects: The present invention searches for an intelligent scheduling scheme for a group of watt-hour meters with relatively high communication efficiency through a particle swarm optimization (PSO) algorithm. Specifically, the present invention constructs a fitness function based on the size of the data to be uploaded by each watt-hour meter at the current moment, the communication delay at the current moment, and the load sizes of each communication node, and selects the most suitable particle (i.e., the optimal particle) according to the fitness of multiple particles with random positions, thereby obtaining a data transmission scheme for watt-hour meters with high communication efficiency. When the present invention searches for the optimal solution through the particle swarm algorithm, it accelerates the aggregation of particles and discards some of the remaining particles to quickly find the possible optimal solution, thereby achieving the effect of accelerating the convergence of particles and finding the best intelligent scheduling scheme faster.
[0008] Preferably, obtaining the position of the particle includes: randomly selecting a predetermined number of particles in the solution space, where the value range of each dimension of the position of the particle is [0, 1], and the velocity of the particle is a random number within a preset value range; performing iterations through the particle swarm optimization algorithm includes: updating the velocity of each particle according to a preset velocity update formula; updating the position of each particle according to a preset position update formula.
[0008] Preferably, obtaining the fitness of each particle includes: using the i dimension of the position of the particle as the iThe upload probability of each electricity meter is obtained by inputting the upload probability of each electricity meter corresponding to the particle and the operation data into the fitness function, and the function value output by the fitness function is recorded as the fitness of the particle.
[0009] Preferably, the fitness function is: , where L The value of is the fitness, is the linearly normalized value of the upload probability of the i th electricity meter at the current moment, , is the linearly normalized value of the data volume to be uploaded of the i th electricity meter, is the linearly normalized value of the communication delay of the i th electricity meter at the current moment, is the linearly normalized value of the load size of the a th node in the transmission line of all electricity meters with upload probabilities greater than the preset threshold at the current moment, D () is the variance function.
[0010] The fitness function constructed by the present invention can output the fitness according to the upload probability and operation data of each electricity meter, so that the output fitness can more accurately evaluate the communication efficiency of data upload for multiple electricity meters.
[0011] Preferably, randomly removing the particles that do not belong to this group of approaching particles includes: after sorting the particles that do not belong to this group of approaching particles, removing the particles with serial numbers that are multiples of the preset number.
[0012] Preferably, the calculation formula for the change stability of the i th particle and the j th particle in the k rd iteration is: ; where is the change stability of the i th particle and the j th particle in the k rd iteration, is the distance between the i th particle and the j th particle in the k -2nd iteration, is the distance between the i th particle and the j th particle in the k rd iteration, norm () is the standard normalization function, i ,j , k is a positive integer.
[0013] Preferably, the formula for calculating the change stability of the i th particle and the j th particle at the k -th iteration is: ; where is the distance between the i th particle and the j th particle at the k -1-th iteration, is the change stability of the i th particle and the j th particle at the k -th iteration.
[0014] Preferably, at the k -th iteration, the formula for calculating the approach degree between the i-th particle and the j-th particle is: , where is the approach degree between the i th particle and the j th particle at the k -th iteration.
[0015] The present invention can flexibly adjust the search direction of particles, reduce dilemmas, and promote the global search of the particle swarm by judging the stability and change amplitude between pairs of particles.
[0016] Preferably, the distance between two particles is the Manhattan distance between the two particles, where in the k-th iteration, the Manhattan distance between the i-th particle and the j-th particle is calculated by the formula: ; where is the value of the first dimension corresponding to the i th particle, is the value of the second dimension corresponding to the i th particle, is the value of the i -1-th dimension corresponding to the N th particle, is the value of the i th dimension corresponding to the N th particle, is the value of the first dimension corresponding to the j th particle, is the value of the jThe value of the second dimension corresponding to a particle is the j value of the N -1th dimension corresponding to a particle is the j value of the N th dimension corresponding to a particle
[0017] In the present invention, the Manhattan distance between the two particles is used as the distance between the two particles, making the process of calculating the distance between particles more concise, thereby reducing the operation cost
[0018] In a second aspect, a concentrator includes an electronic device and a computer-readable storage medium; the electronic computer device includes a processor and a memory, and a computer-readable program executable by the processor is stored on the memory; when the processor executes the computer program, it implements a unit of an electric energy meter for enhancing communication efficiency as described in any one of the above-mentioned invention contents
[0019] The beneficial effects of the present invention are as follows Through the particle swarm optimization (PSO) algorithm, the present invention optimizes the intelligent scheduling scheme of the electric energy meter group, thereby improving the communication efficiency of data transmission. By constructing an accurate fitness function and comprehensively considering the upload probability, data size, communication delay, and load conditions of the electric energy meter, the transmission efficiency can be more accurately evaluated and optimized. This method accelerates the aggregation of particles and quickly finds the optimal solution, realizing efficient intelligent scheduling BRIEF DESCRIPTION OF THE DRAWINGS
[0020] Figure 1 is a structural block diagram of an electric energy meter for enhancing communication efficiency according to an embodiment of the present invention Figure 2 is a step flow chart of a method for screening out electric energy meters for uploading data according to an embodiment of the present invention Figure 3 is a structural block diagram schematically showing an electronic device according to this embodiment DETAILED DESCRIPTION OF THE EMBODIMENTS
[0021] The following will describe in detail the specific embodiments of the present invention with reference to the accompanying drawings
[0022] Figure 1 is a structural block diagram of an electric energy meter for enhancing communication efficiency according to an embodiment of the present invention
[0023] As Figure 1 shown, an electric energy meter for enhancing communication efficiency includes m electric energy meters, a data acquisition unit, and a data processing unit. m is a positive integer
[0024] Among them, the data acquisition unit is used to acquire the operation data of each electric energy meter at the current moment. The operation data includes: the size of the data to be uploaded by the electric energy meter, the communication delay, and the load size of each node in the channel where each electric energy meter is located. The data processing unit is used to receive the operation data output by the acquisition unit and screen out the electric energy meters for uploading data.
[0025] Figure 2 is a flowchart of the steps of the method for screening out the electric energy meters for uploading data according to an embodiment of the present invention.
[0026] As Figure 2 shown, the method for screening out the electric energy meters for uploading data includes steps S1 to S5.
[0027] Step S1: Construct a fitness function and a predetermined number of particles.
[0028] Among them, the fitness function is used to obtain an adaptive fitness according to the upload probability of each electric energy meter and the operation data. The number of position dimensions of the particle is equal to the number of electric energy meters. The position of the particle has multiple dimensions and the number of dimensions is equal to the number of electric energy meters. The value range of each dimension is [0, 1], and the speed of the particle is a random number within a preset value range.
[0029] In one embodiment, a predetermined number of particles are randomly selected in the solution space. The value range of the upload probability of each dimension and each electric energy meter is [0, 1], and the minimum unit value is 0.01. 300 initial particles are randomly selected in the solution space, and the initial speed magnitudes of all initial particles in each dimension are randomly generated within the range [0, 0.1].
[0030] It should be noted that generating multiple particles with random positions means generating multiple sets of electric energy meter scheduling schemes. For any particle, since its position is random, the upload probabilities of the electric energy meters corresponding to the particle are random.
[0031] In one embodiment, the fitness function is: .
[0032] Among them, L the value of is the fitness, is the linearly normalized value of the upload probability of the i th electric energy meter at the current moment, , is the linearly normalized value of the data volume to be uploaded by the i th electric energy meter, is the linearly normalized value of the communication delay of the i th electric energy meter at the current moment, is thea The value obtained by linearly normalizing the load size of a node D () is the variance function.
[0033] It should be noted that represents the unevenness of the communication network load; represents the urgency of the i th smart meter to upload at the current moment. If the difference between the current moment and the last upload time of the i th smart meter is higher, the current moment requires more urgent upload, and the fitness function value (i.e., the value of L ) is higher; when the unevenness of the communication network load is lower, and the upload probabilities of all smart meters with high urgency, large data volume, and low latency are higher, the fitness function value is higher.
[0034] Step S2: Calculate the fitness of each particle.
[0035] Among them, the fitness of a particle is related to the values of each dimension of the particle's position. Each particle inputs its position and the operation data of the corresponding smart meter into the fitness function, and the obtained value is the fitness of the particle.
[0036] In one embodiment, obtaining the fitness of each particle includes: using the i th dimension of the particle's position as the upload probability of the i th smart meter, inputting the upload probabilities and operation data of the smart meters corresponding to the particle into the fitness function, and obtaining the function value output by the fitness function, which is recorded as the fitness of the particle.
[0037] Step S3: Iterate through the particle swarm optimization algorithm and randomly remove particles in each round of iteration.
[0038] Among them, randomly removing particles includes: calculating the proximity between two particles and grouping the particles according to the proximity between each pair of particles to obtain multiple groups of proximate particles, selecting the midpoint of each group of proximate particles as the monitoring particle, and randomly removing the particles that do not belong to the group of proximate particles when the fitness of the monitoring particle in a group of proximate particles is greater than a predetermined multiple of the fitness of all particles in that group of proximate particles.
[0039] Considering that the amount of data uploaded by a single electricity meter is relatively small, the goal of the traditional particle swarm algorithm is to find the global optimal solution, but the convergence time is too long. The obtained intelligent scheduling scheme cannot respond to the dynamic changes of the communication environment in a timely manner, resulting in a reduction in the communication efficiency of the electricity meter. To solve the above problems, the data processing unit in the present invention randomly removes particles in each round of iteration of the particles, including: calculating the reduction amplitude and the spacing change stability between two particles, wherein in each round of iteration, the reduction amplitude between two particles is related to the spacing between the two particles in this round and the historical rounds of iteration, and the spacing change stability between two particles is related to the amplitude of the spacing change in this round and the historical rounds of iteration; taking the product of the reduction amplitude and the spacing change stability between two particles as the approach degree of the two particles, determining multiple groups of approaching particles, wherein the approach degree of any two particles in a group of approaching particles is greater than a preset approach threshold; determining the midpoint of each group of approaching particles as the monitoring particle; for a group of approaching particles, when the fitness of the monitoring particle is greater than a predetermined multiple of the maximum fitness of all particles in the group of approaching particles, randomly removing the particles that do not belong to the group of approaching particles.
[0040] It should be noted that since the amount of data uploaded by a single electricity meter is relatively small and the overall amount of data uploaded by all electricity meters is close, and the intelligent scheduling scheme for electricity meter data upload has high requirements for real-time performance. Therefore, when searching for the optimal solution through the particle swarm algorithm, it has a high tolerance for local optimal solutions. Thus, it can accelerate the aggregation of particles and discard some of the remaining particles to quickly find the possible optimal solution, thereby achieving the effect of accelerating particle convergence and finding the best intelligent scheduling scheme faster.
[0041] In one embodiment, the i th particle and the j th particle at the k th round of iteration, the calculation formula for the change stability is: ; Among them, is the change stability of the i th particle and the j th particle at the k th round of iteration, is the spacing between the i th particle and the j th particle at the k -2th round of iteration, is the spacing between the i th particle and the j th particle at the k th round of iteration, norm () is the standard normalization function.
[0042] It should be noted that when the distance between two particles in the current round of iteration is smaller than the distance between the two particles in the iteration two rounds ago, the reduction amplitude of the two particles is higher.
[0043] ; Among them, is the distance between the i th particle and the j th particle in the k -1 round of iteration, is the change stability of the i th particle and the j th particle in the k nd round of iteration.
[0044] It should be noted that when the absolute difference between the reduction degree of the distance between two particles in the iteration one round ago and the distance between the two particles in the iteration two rounds ago, and the reduction degree of the distance between the two particles in the current iteration and the distance between the two particles in the iteration one round ago is higher, the change of the distance between the two particles is more unstable.
[0045] In one embodiment, in the k th round of iteration, the formula for calculating the approach degree between the i-th particle and the j-th particle is: , where is the approach degree between the i th particle and the j th particle in the k th round of iteration.
[0046] It should be noted that since the particle pair with a high approach degree represents that the particles are gradually approaching, in order to effectively find the particle combinations that may be aggregating, it is necessary to first screen out the particle pairs with a high approach degree. The present invention selects all particle pairs with an approach degree higher than the approach threshold as the approaching particle pairs. For any approaching particle pair, when there is any particle that can form an approaching particle pair with both particles in the approaching particle pair, that particle is included in the combination of the two particles in the approaching particle pair, that is, the approach degree between any two particles in a group of approaching particles is greater than the preset approach threshold. Traverse to obtain all particle combinations that can be formed by all approaching particle pairs. The empirical value of the approach threshold is 0.7.
[0047] It should be noted that when the average value of the approach degrees between any two particles in all particles in the particle combination is higher, the possibility of aggregation of the particle combination is higher.
[0048] In one embodiment, randomly removing the particles that do not belong to the group of approaching particles includes: after sorting the particles that do not belong to the group of approaching particles, removing the particles with serial numbers that are multiples of the preset number. For example, after sorting the particles that do not belong to the group of approaching particles according to the generation time, removing the particles with serial numbers that are multiples of 2.
[0049] In another implementation, an empirical removal rate is set α , where , all particle combinations are sorted in descending order of the degree of aggregation possibility, the midpoints of all particles in all particle combinations are sequentially selected to generate monitoring particles, and the fitness values of the monitoring particles are obtained. If the fitness value of the monitoring particle is higher than 0.8 times (empirical coefficient) of the highest fitness value of all current particles except itself, other particles that do not belong to the current particle combination are randomly removed. If the remaining number of particles is less than or equal to 1 before the subsequent particle combination generates monitoring particles due to the influence of removing particles from the particle combination with a high degree of aggregation possibility, the above steps of generating monitoring particles and removing other particles are skipped to further reduce the calculation amount and accelerate the particle convergence. It should be noted that since the possibility of the existence of local optimal solutions near the midpoint of the particle combination with a higher degree of aggregation possibility is higher, and the importance of other particles is lower in comparison, to accelerate the particle convergence, the midpoint of the particle combination with a high degree of aggregation possibility should be preferentially selected to generate monitoring particles. If the fitness value of the monitoring particle is relatively high, the possibility of the existence of the optimal solution is high. At this time, the importance of other particles is reduced, and some of the remaining particles can be randomly removed to accelerate the convergence of the particle swarm.
[0050] In one embodiment, the distance between two particles is the Manhattan distance between the two particles, where in the k th iteration, the Manhattan distance between the i th particle and the j th particle is calculated The formula is: ; where is the value of the first dimension corresponding to the i th particle, is the value of the second dimension corresponding to the i th particle, is the value of the i th particle corresponding to the N -1th dimension, is the value of the i th particle corresponding to the N th dimension, is the value of the first dimension corresponding to the j th particle, is the value of the second dimension corresponding to the j th particle, is the value of the j th particle corresponding to the N -1th dimension, is the value of the j th particle corresponding to the NThe numerical values of each dimension.
[0051] It should be noted that since the particle combinations that aggregate with each other during the iteration process are specifically manifested as the positions of any two particles approaching each other, it is necessary to first obtain the distance between any two particles in each round of iteration. Since the electric energy meter group contains a large number of electric energy meters, in order to avoid the spatial sparsity caused by the curse of dimensionality, the Manhattan distance should be selected when calculating the distance. The Manhattan Distance is a commonly used method for measuring the distance between two points.
[0052] Step S4: After completing a predetermined number of iterations, obtain the particle with the highest fitness, denoted as the optimal particle.
[0053] It should be noted that by iteratively obtaining the data upload probabilities of each electric energy meter in the electric energy meter group corresponding to the position of the particle with the highest fitness value when the particle swarm converges, the convergence condition of this embodiment is the preset maximum number of iteration rounds.
[0054] Step S5: Use the i dimension of the position of the optimal particle as the upload probability of the i th electric energy meter, and select the data of the electric energy meters with upload probabilities greater than the preset probability threshold for upload. i is a positive integer.
[0055] It should be noted that the electric energy meters with upload probabilities greater than the threshold will be selected for data upload, avoiding network congestion caused by too many electric energy meters uploading data simultaneously.
[0056] Figure 3 is a schematic block diagram showing the structure of an electronic device according to this embodiment.
[0057] The present invention also provides a concentrator. The concentrator includes an electronic device and a computer-readable storage medium. As Figure 3 shown, the electronic device includes a processor and a memory, and the memory stores computer program instructions. When the computer program instructions are executed by the processor, the unit of an electric energy meter for enhancing communication efficiency is implemented.
[0058] In the present invention, the foregoing memory may be any tangible medium that contains or stores a program, which can be used by or in conjunction with an instruction execution system, apparatus, or device. For example, the computer-readable storage medium may be any suitable magnetic storage medium or magneto-optical storage medium, such as resistive random access memory (RRAM), dynamic random access memory (DRAM), static random access memory (SRAM), enhanced dynamic random access memory (EDRAM), high-bandwidth memory (HBM), hybrid memory cube (HMC), etc., or any other medium that can be used to store the required information and can be accessed by an application, module, or both. Any such computer storage medium may be part of the device or accessible or connectable to the device. Any application or module described in the present invention may be implemented using computer-readable / executable instructions that can be stored or otherwise held by such a computer-readable medium.
Claims
1. An electric energy meter with enhanced communication efficiency, characterized in that: include: A data collection unit, which is used to collect the operating data of multiple electric energy meters at the current moment, wherein the operating data includes: the size of the data to be uploaded by the electric energy meter, the communication delay, and the load size of each node of the channel where the electric energy meter is located; A data processing unit, which is used to receive the operating data output by the acquisition unit and filter out the electric energy meter for uploading the data, including: constructing a fitness function and a predetermined number of particles; Calculate the fitness of each particle, wherein the fitness of the particle is related to the value of each dimension of the particle's position; iterate through the particle swarm optimization algorithm, and randomly remove particles in each round of iteration, wherein the random removal of particles includes: calculating the closeness between two particles and grouping the particles according to the closeness between each pair of particles to obtain multiple groups of close particles, selecting the midpoint of each group of close particles as the monitoring particle, and when the fitness of the monitoring particle in a group of close particles is greater than a predetermined multiple of the fitness of all particles in the group of close particles, randomly remove the particles that do not belong to the group of close particles; after completing the predetermined number of iterations, obtain the particle with the highest fitness, which is recorded as the optimal particle; The optimal particle position i The dimension is i The upload probability of each electric energy meter is selected, and the data of the electric energy meter whose upload probability is greater than the preset probability threshold is selected for uploading, where i is a positive integer.
2. The electric energy meter with enhanced communication efficiency according to claim 1, characterized in that: Obtaining the position of the particle includes: randomly selecting a predetermined number of particles in the solution space, wherein the value range of each dimension of the position of the particle is [0,1], and the speed of the particle is a random number within a preset value range; iterating through the particle swarm optimization algorithm includes: updating the speed of each particle according to a preset speed update formula; updating the position of each particle according to a preset position update formula.
3. The electric energy meter with enhanced communication efficiency according to claim 1, characterized in that: Obtaining the fitness of each particle includes: taking the position of the particle as i The dimension is i The upload probability of each electric energy meter corresponding to the particle and the operation data are input into the fitness function, and the function value output by the fitness function is obtained, which is recorded as the fitness of the particle.
4. The electric energy meter with enhanced communication efficiency according to claim 2, characterized in that: The fitness function is: ,in, L The value of is fitness, For the i The linearly normalized value of the upload probability of each electric energy meter at the current moment, , For the i The linear normalized value of the amount of data to be uploaded by each electric energy meter, For the i The value of the linear normalization of the communication delay of the electric energy meter at the current moment, The transmission line of all electric energy meters whose upload probability is greater than the preset threshold at the current moment a The value of linear normalization of the load size of each node, D () is the variance function.
5. The electric energy meter with enhanced communication efficiency according to claim 1, characterized in that: Randomly removing particles that do not belong to the group of approaching particles includes: after sorting the particles that do not belong to the group of approaching particles, removing particles whose sequence numbers are multiples of a preset number.
6. The electric energy meter with enhanced communication efficiency according to claim 1, characterized in that: No. i Particles and j The particle in k The calculation formula for the stability of changes during round iterations is: ; in, For the i Particles and j The particle in k The stability of changes during round iterations, For the i Particles and j The particle in k - The spacing between 2 iterations, For the i Particles and j The particle in k The spacing between round iterations, norm () is the standard normalization function, i , j , k Is a positive integer.
7. The electric energy meter with enhanced communication efficiency according to claim 6, characterized in that: No. i Particles and j The particle in k The calculation formula for the stability of changes during round iterations is: ; in, For the i Particles and j The particle in k -1 The spacing between iterations, For the i Particles and j The particle in k The stability of changes during round iterations.
8. The electric energy meter with enhanced communication efficiency according to claim 7, characterized in that: In the k During round iterations, the formula for calculating the closeness between the i-th particle and the j-th particle is: ,in For the i Particles and j The particle in k The approximation during round iterations.
9. The electric energy meter with enhanced communication efficiency according to claim 1, characterized in that: The distance between two particles is the Manhattan distance between the two particles, where in the kth iteration, the Manhattan distance between the i-th particle and the j-th particle is calculated The formula is: ; in, For the i The value of the first dimension corresponding to the number of particles, For the i The value of the second dimension corresponding to the number of particles, For the i The particle corresponding to N -1 dimension value, For the i The particle corresponding to N The value of the dimension, For the j The value of the first dimension corresponding to the number of particles, For the j The value of the second dimension corresponding to the number of particles, For the j The particle corresponding to N -1 dimension value, For the j The particle corresponding to N The value of a dimension.
10. A concentrator, characterized in that: including an electronic device and a computer-readable storage medium; The electronic device includes a processor and a memory, wherein the memory stores a computer-readable program executed by the processor; when the processor executes the computer program, it implements a data processing unit of an electric energy meter with enhanced communication efficiency as described in any one of claims 1 to 9.
Citation Information
Patent Citations
Electric energy meter capable of enhancing carrier communication efficiency and concentrator
CN118280094A
Power market equilibrium solution method based on two-layer particle swarm optimization algorithm
CN108280544A
System and method for realizing electric energy meter abnormity diagnosis by applying quantum particle swarm algorithm
CN111722174A
Method for high-reliability optimization of power grid reconstruction of distribution network and related equipment
CN113505530A
Power grid intelligent scheduling and operation and maintenance system and method and storage medium
CN116826961A
