Industrial wireless communication system and method

Through directional antenna wireless routers and group optimization algorithms, router layout parameters in industrial wireless communication networks are monitored and planned in real time, network stability and channel interference problems are solved, computing resource requirements and iterations are reduced, and network coverage efficiency is improved.

CN117979303BActive Publication Date: 2024-11-15ZHEJIANG KABAL ELECTRIC CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202311860712.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-12-31
Publication Date
2024-11-15
Estimated Expiration
2043-12-31

AI Technical Summary

Technical Problem

Adjustment of terminals and routers in industrial wireless communication networks is likely to destroy network stability, leading to coverage problems and channel interference. The existing technology has a large amount of computing and many iterations of group optimization algorithms.

Method used

The directional antenna wireless router and coverage and interference detection module are adopted to monitor and plan router layout parameters in real time through the group optimization algorithm, including location, coverage radius and deflection angle, to reduce duplicate coverage and channel interference.

Benefits of technology

It realizes network stability monitoring and real-time planning, avoids signal interference, reduces the computing resource requirements for coverage judgment, and improves the iteration speed of the group optimization algorithm.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117979303B_ABST
    Figure CN117979303B_ABST
Patent Text Reader

Abstract

The present application discloses an industrial wireless communication system and method, which specifically includes: an industrial wireless communication network composed of a terminal, a directional antenna wireless router, and a gateway; a coverage and interference detection module, which determines whether there is a coverage problem or a channel interference problem through the data fed back by the terminal, the router, and the gateway; a router planning module, when the interference detection module determines that there is a coverage problem or a channel interference problem, the router layout parameters of the router are planned by the router planning method, and the router layout parameters include the location, coverage radius, and deflection angle of each router; a reminder module, when the interference detection module determines that there is a coverage problem or a channel interference problem, the staff is reminded and the optimal router planning parameters obtained by the router planning module are displayed. The industrial wireless communication system of the present application can remind and generate optimized router layout parameters when channel coverage and interference problems occur.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of wireless communications, and in particular to an industrial wireless communication system and method. Background Art

[0002] Industrial wireless communication networks often have a large number of terminals and routers covering the terminals. The number and location of these terminals and routers are not fixed. Usually, the number and location of terminals and routers are adjusted during production operations. Such adjustments may undermine the stability of the original network, causing coverage problems where terminals are not covered by routers, or channel interference problems caused by multiple wireless router signals sharing the same channel due to repeated coverage by routers. At the same time, the routers of existing networks generally use omnidirectional antennas, which are more likely to cause repeated coverage problems. The existing methods for determining whether coverage exists have a large amount of calculations, and the existing elephant group optimization algorithm also has the problem of requiring a large number of iterations. Summary of the invention

[0003] The purpose of the present application is to provide an industrial wireless communication system and method to better solve the problems in the background technology.

[0004] To achieve the above objectives, this application provides the following technical solutions:

[0005] An industrial wireless communication system, comprising:

[0006] An industrial wireless communication network consisting of terminals, routers, and gateways. The routers are directional antenna wireless routers. The directional antenna wireless routers cover the terminals in a directional manner through wireless connections and connect to the gateways through wired connections.

[0007] The coverage and interference detection module determines whether there is a coverage problem or channel interference problem through the data fed back by the terminal, router, and gateway;

[0008] A router planning module, when the interference detection module determines that there is a coverage problem or a channel interference problem, plans the router layout parameters of the router through a router planning method, and the router layout parameters include the position, coverage radius and deflection angle of each router;

[0009] The reminder module, when the interference detection module determines that there is a coverage problem or a channel interference problem, reminds the staff accordingly and shows the staff the optimal router planning parameters obtained by the router planning module;

[0010] The router planning method specifically includes the following steps:

[0011] Step S1, obtaining the terminal location information of the industrial wireless communication network and establishing an industrial wireless communication network model; wherein the industrial wireless communication network is composed of a terminal, a router, and a gateway, and the router is a directional antenna wireless router, which covers the terminal in a directional manner through a wireless connection and connects to the gateway through a wired connection;

[0012] Step S2, according to the preset constraints, with the goal of maximizing coverage and minimizing interference, construct a fitness function, and obtain the optimal router planning parameters according to the elephant swarm optimization algorithm;

[0013] In step S1, the number of terminals is defined as n, and the position of the i-th terminal Ti is represented as (xi, yi), where the terminal number i = 1, 2, ..., n; the number of planned routers is defined as m, and the position of the j-th router Rj is represented as (xj, yj), the coverage radius is represented as rj, the coverage angle of the antenna is represented as aj, the deflection angle of the antenna is represented as bj, and the coverage area is represented as cj, where the router number j = 1, 2, ..., m;

[0014] The steps of the elephant group optimization algorithm in step S2 are:

[0015] Step S2.1: Set the population size and the maximum number of iterations; initialize the population randomly in the space that satisfies the constraints;

[0016] Step S2.2: Calculate the fitness value of each elephant individual through the fitness function, and set the individual with the lowest fitness value as the current optimal individual position;

[0017] Step S2.3: Update the position of each elephant individual in the population according to the clan update formula, and update the position of the current optimal individual according to the clan leader update formula;

[0018] Step S2.4: Calculate the fitness value of each updated elephant individual, evaluate the population, and obtain the updated optimal and worst elephant individual positions;

[0019] Step S2.5: Update the current worst individual elephant position according to the clan separation formula and retain the best individual elephant position;

[0020] Step S2.6: Determine whether the maximum number of iterations has been reached, if not, return to step S2.2; if so, output the current optimal individual elephant position, which is the optimal router planning parameter.

[0021] And a router planning method for an industrial wireless communication system, characterized by comprising the following steps:

[0022] Step S1, obtaining terminal location information of the industrial wireless communication network and establishing an industrial wireless communication network model;

[0023] Step S2, according to the preset constraints, with the goal of maximizing coverage and minimizing interference, construct a fitness function, and obtain the optimal router planning parameters according to the elephant swarm optimization algorithm;

[0024] In step S1, the number of terminals is defined as n, and the position of the i-th terminal Ti is represented as (xi, yi), where the terminal number i = 1, 2, ..., n; the number of planned routers is defined as m, and the position of the j-th router Rj is represented as (xj, yj), the coverage radius is represented as rj, the coverage angle of the antenna is represented as aj, the deflection angle of the antenna is represented as bj, and the coverage area is represented as cj, where the router number j = 1, 2, ..., m;

[0025] The steps of the elephant group optimization algorithm in step S2 are:

[0026] Step S2.1: Set the population size and the maximum number of iterations; initialize the population randomly in the space that satisfies the constraints;

[0027] Step S2.2: Calculate the fitness value of each elephant individual through the fitness function, and set the individual with the lowest fitness value as the current optimal individual position;

[0028] Step S2.3: Update the position of each elephant individual in the population according to the clan update formula, and update the position of the current optimal individual according to the clan leader update formula;

[0029] Step S2.4: Calculate the fitness value of each updated elephant individual, evaluate the population, and obtain the updated optimal and worst elephant individual positions;

[0030] Step S2.5: Update the current worst individual elephant position according to the clan separation formula and retain the best individual elephant position;

[0031] Step S2.6: Determine whether the maximum number of iterations has been reached, if not, return to step S2.2; if so, output the current optimal individual elephant position, which is the optimal router planning parameter.

[0032] Furthermore, the constraint condition preset in step S2 is: the coverage radius rj of each router is not greater than the maximum coverage radius rjmax of the router;

[0033] The fitness function in step S2 is: λ is the aggregation coefficient that reflects the relative importance of each indicator, 0<λ<1;

[0034] If terminal Ti is covered by at least one router, then p i =0; otherwise, At this time, j is the router number closest to terminal Ti;

[0035] If router Rj does not overlap with other routers in coverage area, then q j =0; otherwise, where cc j Indicates c j The area where there is repeated coverage.

[0036] Further, the following steps are performed to determine whether the terminal is covered by the router and whether there is an overlapping coverage area between the routers:

[0037] Step T1, dividing the wireless communication network area into grids with a side length of d;

[0038] Step T2: for each router Rj, define its rectangular coverage area as a rectangular grid range consisting of vertices (K1j, K3j), (K2j, K3j), (K1j, K4j) (K2j, K4j); wherein,

[0039]

[0040]

[0041]

[0042] Step T3, when judging whether the decision point is covered by router Rj, if the position of the decision point is (xt, yt), firstly judge whether the position of the decision point (xt, yt) does not fall into the rectangular grid range of Rj. If not, the judgment result is that the decision point is not covered by router Rj; if so, calculate (xt, yt). t -x j ) 2 +(y t -y j ) 2 Is it greater than If yes, then the result is that the decision point is not covered by router Rj; if no, then calculate equation Is it true? If not, the judgment result is that the decision point is not covered by router Rj, otherwise the judgment result is that the decision point is covered by router Rj;

[0043] Step T4.1, when determining whether terminal Ti is covered by router Rj, substitute the position (xi, yi) of terminal Ti into the determination point in step T3 to obtain the coverage determination result;

[0044] Step T4.2, when judging whether router Rj overlaps with router Rj', first judge whether there is any overlapping part in the rectangular grid range of router Rj and router Rj'. If not, it is judged that there is no overlapping. If so, for each grid of the overlapping part, take the center point of each grid and substitute it into the judgment point in step T3, and obtain the coverage judgment results of the judgment point relative to router Rj and router Rj' respectively. If the judgment results are not all overlapping, it is judged that there is no overlapping. Otherwise, count the number of grids that are all overlapping, and add the value of the number of grids × d2 to the area cc of the overlapping coverage area of ​​router Rj and router Rj'. j ,cc j 'middle.

[0045] Furthermore, after the population is initialized randomly in the space satisfying the constraint conditions in step S2.1, the following steps are also included:

[0046] Step U1: Randomly select m terminals Ti as group centers and form m covering groups;

[0047] Step U2: assign each terminal Ti to the coverage group where the nearest cluster center is located;

[0048] Step U3: recalculate the center point of each coverage group; the center point can be calculated by the average position of all terminals in the coverage group;

[0049] Step U4: Repeat steps U2 and U3 until the cluster center point no longer changes or the maximum number of iterations is reached.

[0050] Step U5: For each coverage group, a circle is drawn with the group center as the center and the distance between the terminal farthest from the group center and the group center as the radius, forming m coverage circles; a router is assigned to each coverage circle, and the point on the circumference of the coverage circle closest to the coverage circle is used as the position of the router, and the horizontal angle from the point to the coverage circle group center is used as the deflection angle of the router antenna, and the coverage radius of the router is the maximum coverage radius of the router, forming the initial intervention router planning parameters;

[0051] In step U6, an elephant individual of a clan is replaced randomly using the initial intervention router planning parameters.

[0052] Compared with the prior art, the innovations and beneficial effects of this application are:

[0053] 1. The coverage and interference detection module monitors the current network coverage or channel interference problems in real time, and the router planning module provides real-time planning and reminders to ensure network stability.

[0054] 2. Use directional antenna wireless routers to cover the terminals of the industrial wireless communication network, thereby providing targeted wireless coverage of the terminals and avoiding signal interference caused by repeated coverage of the routers.

[0055] 3. The use of directional antenna wireless routers increases the difficulty of optimizing the router planning location, because its network coverage method is significantly different from that of omnidirectional antenna routers. This application uses an elephant swarm optimization algorithm to optimize and solve the router planning parameters.

[0056] 4. The coverage judgment method is improved according to the coverage characteristics of directional antennas, thereby reducing the computing resources required for coverage judgment.

[0057] 5. According to the coverage characteristics of directional antennas, a step of intervening in the initial population is proposed, which can improve the iteration speed of the elephant swarm optimization algorithm. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] Figure 1 Schematic diagram of the router model in the industrial wireless communication network model.

[0059] Figure 2 Schematic diagram of allocating routers according to coverage circles. DETAILED DESCRIPTION

[0060] The present invention is described in detail below with reference to the accompanying drawings:

[0061] For industrial wireless communication networks, there are often a large number of terminals distributed in different locations that need to be covered by wireless networks. These terminals are usually covered by networks such as 802.11 and 802.15.4, but these networks are mostly concentrated in the 2.4GHz frequency band and interfere with each other. At the same time, a large number of wireless routers are usually required to cover a large number of terminals. When there are many wireless router signals nearby, the probability of multiple routers sharing the same channel is greatly increased, further generating signal crosstalk and seriously interfering with normal communication. Therefore, by optimizing the number of routers and planning locations, constraining the signals of each router, reducing the repeated coverage areas between routers, and avoiding channel interference caused by multiple wireless router signals in the same area, it has become a feasible optimization method for building an interference-resistant wireless communication network.

[0062] At the same time, reducing the overlapping coverage areas between routers also brings convenience to the subsequent addition of terminals in the industrial wireless communication network. As long as the location of the new terminal has been covered by the existing router, there is no need to consider whether it will be interfered by the signals of other routers.

[0063] To this end, the present application provides an industrial wireless communication system, comprising:

[0064] An industrial wireless communication network consisting of terminals, routers, and gateways. The router is a directional antenna wireless router. The directional antenna wireless router covers the terminal in a directionally manner through a wireless connection and connects to the gateway through a wired connection.

[0065] The applicant has noticed that wireless routers in the prior art often use omnidirectional antenna coverage. This coverage method is simple to plan and has a large coverage range. However, it is precisely because of its large coverage range that it is more likely to cause duplicate coverage problems. Therefore, in the industrial wireless communication network constructed by this application, a directional antenna wireless router is used to provide targeted wireless coverage for the terminal. At the same time, in order to avoid the problem of repeated coverage of routers, it is preferred to use wired connections between routers and between routers and gateways.

[0066] The industrial wireless communication system also includes a coverage and interference detection module, which determines whether there is a coverage problem or a channel interference problem through data fed back by the terminal, router, and gateway. There are many mature ways to detect and judge signal coverage and channel interference in the prior art, and this application does not limit this. In a preferred embodiment, a detection threshold can be set. When the coverage or interference problem detected by the coverage and interference detection module is higher than the threshold, the router planning module and the reminder module execute the corresponding steps and functions. The detection threshold can be flexibly set according to the method of detecting and judging signal coverage and channel interference and the actual communication needs.

[0067] The industrial wireless communication system also includes a router planning module. When the interference detection module determines that there is a channel interference problem, the router layout parameters of the router are planned through a router planning method. The router layout parameters include the location, coverage radius and deflection angle of each router. The specific content of the router planning method is described in detail below.

[0068] The industrial wireless communication system also includes a reminder module. When the interference detection module determines that there is a coverage problem or a channel interference problem, the staff is reminded accordingly and the optimal router planning parameters obtained by the router planning module are displayed to the staff.

[0069] The router planning method specifically includes the following steps:

[0070] Step S1, obtaining the terminal location information of the industrial wireless communication network and establishing an industrial wireless communication network model; wherein the industrial wireless communication network is composed of a terminal, a router, and a gateway, and the router is a directional antenna wireless router, which covers the terminal in a directional manner through a wireless connection and connects to the gateway through a wired connection;

[0071] Step S2, according to the preset constraints, with the goal of maximizing coverage and minimizing interference, construct a fitness function, and obtain the optimal router planning parameters according to the elephant swarm optimization algorithm.

[0072] However, the use of directional antenna wireless routers increases the difficulty of optimizing the planning location of routers, because its network coverage method is significantly different from that of omnidirectional antenna routers, with two additional parameters, the coverage angle and deflection angle of directional antennas, and the planning location optimization method of omnidirectional antenna routers cannot be directly applied. To this end, the applicant established an industrial wireless communication network model and performed optimization calculations based on the improved elephant group optimization algorithm.

[0073] First, in step S1, the terminal location information is obtained and an industrial wireless communication network model is established. Figure 1 As shown, the number of terminals is defined as n, and the position of the i-th terminal Ti is represented as (xi, yi), where the terminal number i = 1, 2, ..., n. Figure 2 As shown, the number of planned routers is defined as m, the position of the jth router Rj is represented as (xj, yj), the coverage radius is represented as rj, the coverage angle of the antenna is represented as aj, the deflection angle of the antenna (i.e., the horizontal angle of the angular bisector of the antenna coverage angle) is represented as bj, and the coverage area is represented as cj, where the router number j = 1, 2, ..., m. The coverage angle of the router antenna is represented as aj, which is generally a known parameter and is set according to the parameters of the existing inventory directional antennas, but the parameter aj can also be set to be selected by the elephant group optimization algorithm, and then the corresponding directional antenna can be purchased according to the aj value obtained by the algorithm. The number of routers m is also a known parameter, which can be set or adjusted or pre-set by the staff, or obtained from the industrial wireless communication network.

[0074] In step S2, the preset constraint condition is: the coverage radius rj of each router is not greater than the maximum coverage radius rjmax of the router. With the goal of maximizing coverage and minimizing interference, the fitness function constructed is:

[0075] λ is the aggregation coefficient that reflects the relative importance of each indicator, 0<λ<1, and its value can be flexibly adjusted according to actual needs;

[0076] In the fitness function, if at least one router covers terminal Ti, then p i =0; otherwise, At this time, j is the router number closest to terminal Ti. If router Rj does not overlap with other routers, then q j =0; otherwise, where cc j Indicates c jThe area where there is repeated coverage.

[0077] In an optional embodiment, when there is no coverage and repeated areas, the objective function corresponding to p i and q i Can also be modified to and To avoid the influence of individual discrete extreme values.

[0078] According to the improved elephant herd optimization algorithm, the optimal router planning parameters are obtained. The elephant herd optimization algorithm is an existing intelligent optimization algorithm based on elephant herding behavior. By setting constraints and constructing fitness functions, the optimal router planning parameters can be obtained through the standard elephant herd optimization algorithm. The main steps of the elephant herd optimization algorithm are as follows. Those skilled in the art know the specific functions and definitions in the steps, which will not be repeated in this article:

[0079] Step S2.1: Set the population size and the maximum number of iterations; initialize the population randomly in the space that satisfies the constraints;

[0080] Step S2.2: Calculate the fitness value of each elephant individual through the fitness function, and set the individual with the lowest fitness value as the current optimal individual position;

[0081] Step S2.3: Update the position of each elephant individual in the population according to the clan update formula, and update the position of the current optimal individual according to the clan leader update formula;

[0082] Step S2.4: Calculate the fitness value of each updated elephant individual, evaluate the population, and obtain the updated optimal and worst elephant individual positions;

[0083] Step S2.5: Update the current worst individual elephant position according to the clan separation formula and retain the best individual elephant position;

[0084] Step S2.6: Determine whether the maximum number of iterations has been reached, if not, return to step S2.2; if so, output the current optimal individual elephant position, which is the optimal router planning parameter.

[0085] In the initialization population, the elephants are divided into multiple clans. Each clan has multiple elephant individuals. The initial position of each elephant individual is randomly generated. The position of each elephant individual can include multiple dimensions such as the position of each router, coverage radius, and deflection angle.

[0086] The clan update formula is:

[0087]

[0088] in, and are the updated and pre-updated positions of the jth elephant in clan c, t represents the number of iterations, and α∈[0,1] represents the optimal individual position in the clan (i.e., the matriarch) p c,best For individual elephants The impact scaling factor.

[0089] The patriarch update formula is:

[0090]

[0091] Among them, p c,bested represents the updated position of the clan leader, β∈[0,1] represents the influence scaling factor of the clan center, and nc is the number of elephants in clan c.

[0092] The clan separation formula is:

[0093]

[0094] Among them, p max,c and p min,c Represent the lower and upper bounds of the search space.

[0095] After receiving the optimal router planning parameters obtained by the router planning module displayed by the reminder module, the staff can adjust the layout of the routers according to the optimal router planning parameters. In a preferred embodiment, the staff can let the router planning module execute step S2 for different values ​​of the number of routers m to seek a combination of the number of routers m and planning parameters with the best cost performance, so as to purchase new routers in time to meet the anti-interference requirements when the number of routers m is more than the number of existing routers.

[0096] After receiving the optimal router planning parameters, the staff can plan and adjust the location, coverage angle and deflection angle of the router accordingly according to the optimal router planning parameters, and the coverage radius of the router is adjusted by adjusting the transmission and / or receiving power of the router. After the router is arranged, there may be other background interference channels at the location of the router, such as wireless networks used by staff or external wireless networks, so it is necessary to adjust the channel parameters of each router according to the interference channel situation at each router location to avoid conflicts between the channels used by the router and the background interference channels.

[0097] The applicant noticed that in the elephant group optimization algorithm of step S2 above, the fitness function needs to be calculated frequently, so it is necessary to judge whether the terminal is covered by the router and whether there are repeated coverage areas between routers. At the same time, the introduction of directional antennas further increases the complexity of the calculation. The usual way to judge whether the terminal Ti is covered by the router Rj is to calculate whether the distance between the terminal Ti and the router Rj is less than the coverage radius rj of the router, and to calculate whether the angle between the terminal Ti and the router Rj falls within the coverage angle of the router. It is more complicated to calculate whether there is repeated coverage between two routers using algebra or matrix methods. Obviously, this requires a large amount of computing resources. Because in actual working conditions, the coverage radius of the router is not strictly limited to rj, a larger distance can still meet the communication needs. Therefore, the applicant proposes an improved method for coverage judgment that can reduce computing resources based on the coverage characteristics of directional antennas, as follows:

[0098] Step T1, dividing the wireless communication network area into grids with a side length of d; the side length d can be flexibly adjusted according to the required accuracy;

[0099] Step T2: For each router Rj, define its rectangular coverage area as a rectangular grid range consisting of vertices (K1j, K3j), (K2j, K3j), (K1j, K4j), and (K2j, K4j).

[0100]

[0101]

[0102]

[0103]

[0104] Step T3, when judging whether the decision point is covered by router Rj, if the position of the decision point is (xt, yt), firstly judge whether the position of the decision point (xt, yt) does not fall into the rectangular grid range of Rj. If not, the judgment result is that the decision point is not covered by router Rj; if so, calculate (xt, yt). t -x j ) 2 +(y t -y j ) 2 Is it greater than If yes, then the result is that the decision point is not covered by router Rj; if no, then calculate equation Is it true? If not, the judgment result is that the decision point is not covered by router Rj, otherwise the judgment result is that the decision point is covered by router Rj.

[0105] Step T4.1, when determining whether terminal Ti is covered by router Rj, substitute the position (xi, yi) of terminal Ti into the determination point in step T3 to obtain the coverage determination result;

[0106] Step T4.2, when judging whether router Rj overlaps with router Rj', first judge whether there is any overlapping part in the rectangular grid range of router Rj and router Rj'. If not, it is judged that there is no overlapping. If so, for each grid of the overlapping part, take the center point of each grid and substitute it into the judgment point in step T3, and obtain the coverage judgment results of the judgment point relative to router Rj and router Rj' respectively. If the judgment results are not all overlapping, it is judged that there is no overlapping. Otherwise, count the number of grids that are all overlapping, and add the value of the number of grids × d2 to the area cc of the overlapping coverage area of ​​router Rj and router Rj'. j ,cc j 'middle.

[0107] Through the above coverage judgment method, for each router Rj, it is only necessary to calculate the rectangular grid range in step T2 once and store it in the cache for use in the subsequent steps T3-T4. Therefore, compared with the usual calculation method, the coverage judgment method can reduce the amount of calculation for frequent coverage judgment when the fitness function is calculated, and it is the cc in the fitness function. j Parameters provide an easy way to calculate.

[0108] The applicant also noted that in the elephant swarm optimization algorithm of step S2 above, the introduction of directional antennas increases the spatial dimension, resulting in the elephant swarm optimization algorithm requiring more iterations. Since the initial population of the elephant swarm optimization algorithm is initialized in a random manner, it further increases the number of iterations required. The applicant proposed a step that can intervene in the initial population based on the coverage characteristics of directional antennas. This step can be inserted in step S2.1 after the population is initialized in a random manner in the space that meets the constraints, so as to intervene in the initial population. The specific steps for intervening in the initial population are as follows:

[0109] Step U1: Randomly select m terminals Ti as group centers and form m covering groups;

[0110] Step U2: assign each terminal Ti to the coverage group where the nearest cluster center is located;

[0111] Step U3: recalculate the center point of each coverage group; the center point can be calculated by the average position of all terminals in the coverage group;

[0112] Step U4: Repeat steps U2 and U3 until the cluster center point no longer changes or the maximum number of iterations is reached.

[0113] Step U5: Figure 2 As shown, for each coverage group, a circle is drawn with the group center as the center and the distance between the terminal farthest from the group center and the group center as the radius, forming m coverage circles; a router is assigned to each coverage circle, and the point on the circumference of the coverage circle closest to the coverage circle is taken as the position of the router, and the horizontal angle from the point to the coverage circle group center is taken as the deflection angle of the router antenna, and the coverage radius of the router is the maximum coverage radius of the router, finally forming the initial intervention router planning parameters.

[0114] Step U6, since the number of initial clans in the elephant group optimization algorithm is N, the initial intervention router planning parameters are used to randomly replace the initial population. One initial elephant individual of a clan can be replaced, or one initial elephant individual of a clan multiplied by the number of clans can be replaced. The preset ratio should not be too high to avoid falling into the situation of local optimization, and the optional value is 1%-10%.

[0115] The present application also provides a computer-readable storage medium, which stores instructions. When the computer-readable storage medium is run on a computer, the computer executes methods such as steps S1-S2, steps T1-T4, and steps U1-U6 mentioned above. By executing these methods, the optimal router planning parameters can be obtained according to the terminal location information of the industrial wireless communication network.

[0116] It can be understood that in the embodiments of the present application, the size of the serial numbers of the above-mentioned steps does not mean the order of execution. At the same time, the above-mentioned steps can be combined arbitrarily. The execution order and combination of each step should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

Claims

1. An industrial wireless communication system, comprising: An industrial wireless communication network consisting of terminals, routers, and gateways. The routers are directional antenna wireless routers. The directional antenna wireless routers cover the terminals in a directional manner through wireless connections and connect to the gateways through wired connections. The coverage and interference detection module determines whether there is a coverage problem or channel interference problem through the data fed back by the terminal, router, and gateway; A router planning module, when the interference detection module determines that there is a coverage problem or a channel interference problem, plans the router layout parameters of the router through a router planning method, and the router layout parameters include the position, coverage radius and deflection angle of each router; The reminder module, when the interference detection module determines that there is a coverage problem or a channel interference problem, reminds the staff accordingly and shows the staff the optimal router planning parameters obtained by the router planning module; The router planning method specifically includes the following steps: Step S1, obtaining terminal location information of the industrial wireless communication network and establishing an industrial wireless communication network model; Step S2, according to the preset constraints, with the goal of maximizing coverage and minimizing interference, construct a fitness function, and obtain the optimal router planning parameters according to the elephant swarm optimization algorithm; In step S1, the number of terminals is defined as n, and the i-th terminal T i The position is represented by (x i ,y i ), where the terminal number i = 1, 2, ..., n; define the number of planned routers as m, and set the jth router R j The position is represented by (x j ,y j ), the coverage radius is represented by r j , the coverage angle of the antenna is represented by a j , the deflection angle of the antenna is represented by b j , the coverage area is denoted as c j , where router number j = 1, 2, ..., m; The steps of the elephant group optimization algorithm in step S2 are: Step S2.1: Set the population size and the maximum number of iterations; initialize the population randomly in the space that satisfies the constraints; Step S2.2: Calculate the fitness value of each elephant individual through the fitness function, and set the individual with the lowest fitness value as the current optimal individual position; Step S2.3: Update the position of each individual elephant in the population according to the clan update formula: in, and are the updated and pre-updated positions of the jth elephant in clan c, t represents the number of iterations, and α∈[0,1] represents the position p of the best individual in the clan. c,best For individual elephants The impact scale factor of Update the position of the current optimal individual according to the clan leader update formula: Among them, p c,bested represents the position of the updated optimal individual, β∈[0,1] represents the influence proportional factor of the clan center, and nc is the number of elephants in clan c; Step S2.4: Calculate the fitness value of each updated elephant individual, evaluate the population, and obtain the updated optimal and worst elephant individual positions; Step S2.5: Update the current worst individual elephant position according to the clan separation formula: Among them, p max and p min Represents the upper and lower bounds of the search space; Keep the best individual elephant positions; Step S2.6: Determine whether the maximum number of iterations has been reached, if not, return to step S2.2; if so, output the current optimal individual elephant position, which is the optimal router planning parameter; in, The preset constraint condition in step S2 is: the coverage radius r of each router j Not greater than the maximum coverage radius r of the router jmax ; The fitness function in step S2 is: λ is the aggregation coefficient that reflects the relative importance of each indicator, 0<λ<1; If the terminal T i is covered by at least one router, then p i =0; otherwise, At this time, j is the distance from the terminal T i The nearest router number; If router R j If there is no overlapping coverage area with other routers, then q j =0; otherwise, where cc j Indicates c j The area where there is repeated coverage.

2. A router planning method for an industrial wireless communication system, characterized in that: The following steps are involved: Step S1, obtaining the terminal location information of the industrial wireless communication network and establishing an industrial wireless communication network model; wherein the industrial wireless communication network is composed of a terminal, a router, and a gateway, and the router is a directional antenna wireless router, which covers the terminal in a directional manner through a wireless connection and connects to the gateway through a wired connection; Step S2, according to the preset constraints, with the goal of maximizing coverage and minimizing interference, construct a fitness function, and obtain the optimal router planning parameters according to the elephant swarm optimization algorithm; In step S1, the number of terminals is defined as n, and the i-th terminal T i The position is represented by (x i ,y i ), where the terminal number i = 1, 2, ..., n; define the number of planned routers as m, and set the jth router R j The position is represented by (x j ,y j ), the coverage radius is represented by r j , the coverage angle of the antenna is represented by a j , the deflection angle of the antenna is represented by b j , the coverage area is denoted as c j , where router number j = 1, 2, ..., m; The steps of the elephant group optimization algorithm in step S2 are: Step S2.1: Set the population size and the maximum number of iterations; initialize the population randomly in the space that satisfies the constraints; Step S2.2: Calculate the fitness value of each elephant individual through the fitness function, and set the individual with the lowest fitness value as the current optimal individual position; Step S2.3: Update the position of each individual elephant in the population according to the clan update formula: in, and are the updated and pre-updated positions of the jth elephant in clan c, t represents the number of iterations, and α∈[0,1] represents the position p of the best individual in the clan. c,best For individual elephants The impact scale factor of Update the position of the current optimal individual according to the clan leader update formula: Among them, p c,bested represents the position of the updated optimal individual, β∈[0,1] represents the influence proportional factor of the clan center, and nc is the number of elephants in clan c; Step S2.4: Calculate the fitness value of each updated elephant individual, evaluate the population, and obtain the updated optimal and worst elephant individual positions; Step S2.5: Update the current worst individual elephant position according to the clan separation formula: Among them, p max and p min Represents the upper and lower bounds of the search space; Keep the best individual elephant positions; Step S2.6: Determine whether the maximum number of iterations has been reached, if not, return to step S2.2; if so, output the current optimal individual elephant position, which is the optimal router planning parameter; in, The preset constraint condition in step S2 is: the coverage radius r of each router j Not greater than the maximum coverage radius r of the router jmax ; The fitness function in step S2 is: λ is the aggregation coefficient that reflects the relative importance of each indicator, 0<λ<1; If the terminal T i is covered by at least one router, then p i =0; otherwise, At this time, j is the distance from the terminal T i The nearest router number; If router R j If there is no overlapping coverage area with other routers, then q j =0; otherwise, where cc j Indicates c j The area where there is repeated coverage.

3. The router planning method of the industrial wireless communication system according to claim 2, characterized in that: After the population is initialized randomly in the space satisfying the constraint conditions in step S2.1, the following steps are also included: Step U1: Randomly select m terminals Ti as group centers and form m covering groups; Step U2: assign each terminal Ti to the coverage group where the nearest cluster center is located; Step U3: recalculate the center point of each coverage group; the center point can be calculated by the average position of all terminals in the coverage group; Step U4: Repeat steps U2 and U3 until the cluster center point no longer changes or the maximum number of iterations is reached; Step U5: For each coverage group, a circle is drawn with the group center as the center and the distance between the terminal farthest from the group center and the group center as the radius, forming m coverage circles; a router is assigned to each coverage circle, and the point on the circumference of the coverage circle closest to the coverage circle is used as the position of the router, and the horizontal angle from the point to the coverage circle group center is used as the deflection angle of the router antenna, and the coverage radius of the router is the maximum coverage radius of the router, forming the initial intervention router planning parameters; In step U6, an elephant individual of a clan is replaced randomly using the initial intervention router planning parameters.