Multi-hop wireless relay deployment method and system

Abstract

The invention provides a multi-hop wireless relay deployment method and system, and the method comprises the steps: S1, simulating the signal transmission condition in an urban environment through electromagnetic environment simulation software, obtaining the signal intensity between the base station and the relay candidate position, the signal intensity between the relay candidate positions and the signal intensity between the relay candidate position and the grid so as to determine the actual coverage range of each relay; s2, introducing a hop count constraint condition, setting the maximum transit hop count from a grid to a base station, and ensuring that the synchronism and time delay of a communication link are within an acceptable range; and S3, adopting a two-stage deployment strategy, and gradually optimizing a deployment scheme of the relay nodes through a coverage priority principle and hierarchical network expansion.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technologies, and more particularly, to a multi-hop wireless relay deployment method and system, and even more particularly, to a multi-hop wireless relay deployment method and system based on a coverage priority and hierarchical network expansion strategy. Background Art

[0002] With the rapid development of wireless communication technologies, the demand for wireless network coverage in urban areas is increasing day by day. However, due to the dense urban buildings and complex environment, signals are easily blocked and reflected during transmission, resulting in signal coverage blind spots and weak areas. This uneven signal coverage seriously affects the communication experience of users and the quality of network services. Therefore, how to reasonably deploy wireless relay nodes under limited resource conditions to maximize the signal coverage rate in the area has become an important research topic.

[0003] Currently, the solutions to the wireless network coverage problem mainly focus on geometric models and greedy heuristic algorithms. Geometric models usually assume that the coverage range of relay nodes is circular, and based on this, relay nodes are deployed through geometric methods. However, this assumption ignores the complexity of signal propagation in the actual environment, such as building blockage and reflection, resulting in a large deviation between the deployment plan and the actual effect. On the other hand, although the greedy heuristic algorithm can quickly improve the coverage rate during the solution process, in the case of limited relay quantity and hop count, problems such as insufficient coverage or resource waste are likely to occur. In addition, existing methods generally ignore the possible synchronization and delay problems in the multi-hop forwarding process, which affects the reliability of communication links and the quality of service; at the same time, existing methods lack optimization strategies for different regional requirements and cannot optimize the overall utilization of resources while ensuring the coverage of key areas and high-demand areas.

[0004] In view of the deficiencies of existing methods, the present invention proposes a multi-hop wireless relay deployment method based on a coverage priority and hierarchical network expansion strategy. First, an electromagnetic environment simulation software is used to simulate the signal transmission situation in the urban environment, and the signal strength between the base station and relay candidate locations, the signal strength between relay candidate locations, and the signal strength between relay candidate locations and grids are obtained, so as to determine the actual coverage range of each relay. Secondly, a hop count constraint condition is introduced, and the maximum number of transfer hops from the grid to the base station is set to ensure that the synchronization and delay of the communication link are within an acceptable range. Finally, a two-stage deployment strategy is adopted, and through the coverage priority principle and hierarchical network expansion, the deployment plan of relay nodes is gradually optimized, the coverage rate and the number of relays are balanced, and resource consumption is reduced. Summary of the Invention

[0005] Aiming at the defects in the prior art, the purpose of the present invention is to provide a multi-hop wireless relay deployment method and system, which is a relay network planning method that balances the overall network coverage and relay deployment cost while considering the forwarding hop number constraint of the wireless relay network.

[0006] A multi-hop wireless relay deployment method provided by the present invention includes:

[0007] Step S1: Simulate the signal transmission situation in the urban environment through electromagnetic environment simulation software, and obtain the signal strength between the base station and the relay candidate positions, the signal strength between the relay candidate positions, and the signal strength between the relay candidate positions and the grids, so as to determine the actual coverage range of each relay;

[0008] Step S2: Introduce the hop number constraint condition, set the maximum number of transit hops from the grid to the base station to ensure that the synchronization and delay of the communication link are within an acceptable range;

[0009] Step S3: Adopt a two-stage deployment strategy, and gradually optimize the deployment scheme of the relay nodes through the coverage priority principle and hierarchical network expansion.

[0010] Preferably, in step S1, it is adopted: evaluate whether S base stations and M relay candidate positions can communicate bidirectionally through electromagnetic environment simulation software. If the base station s and the relay candidate position m can communicate, record a s,m =1, otherwise record a s,m =0; evaluate whether M relay candidate positions can communicate bidirectionally. If the relay candidate positions m and m' can communicate, record b m,m′ =1, otherwise record b m,m′ =0; evaluate whether M relay candidate positions and N demand grids can communicate. If the relay candidate position m and the grid n can communicate, record c m,n =1, otherwise record c m,n =0.

[0011] Preferably, in step S2, it is adopted:

[0012] Step S2.1: Calculate the minimum communication hop number k s,m from the base station s to the relay candidate position m, and record k m =min s k s,m ;

[0013] Step S2.2: Calculate the coverage gain β of the relay candidate position m according to the weights m of the N demand grids;

[0014]

[0015] Step S2.3: Select the relay candidate position with the largest coverage gain and a communication hop count less than K - 1 from the base station, denoted as m ★ ;

[0016]

[0017] s.t.k m ≤K - 1

[0018] where K represents the maximum number of hops allowed for normal communication from the base station to the grid in the relay network.

[0019] Preferably, the step S3 adopts:[[]]

[0020] Step S3.1: Calculate the set of the minimum relay set all connected to the base station where represents the relay position set;

[0021] Step S3.2: If then update reset the weights of the covered grids to 0, update the coverage gain of each relay candidate position using the updated grid weights trigger the execution of step S3.3; if then trigger the execution of step S3.4; if then the program terminates and outputs the relay set where Q represents the maximum number of relays allowed to be deployed in the problem setting;

[0022] Step S3.3: Determine whether holds. If it holds, the program terminates and outputs the relay position set M; otherwise, re - select the relay candidate position with the largest coverage gain and a communication hop count less than K - 1;

[0023] Step S3.4: Let Q′ represent the remaining number of relays that can be deployed after deploying the relays in the set ;

[0024] Step S3.5: In the sub - network composed of S base stations and the relay set calculate the minimum hop count from each relay position in the relay set to the base station and the previous node on this minimum - hop - count path Take the base station with the least hop count among all base stations, s m = argmin s k s ′ ,m, set

[0025] Step S3.6: Select a relay candidate location that can communicate with the base station or relay set with a communication hop count not exceeding K and the maximum coverage gain

[0026]

[0027] If is not directly connected to the base station, record its previous node

[0028] Step S3.7: If is directly connected to the base station, then Otherwise,

[0029] Step S3.8: For and update

[0030] Step S3.9: Update Q′ = Q′ - 1;

[0031] Step S3.10: If Q′ > 0, repeatedly trigger Step S3.6; otherwise, terminate the program and output the relay location set

[0032] Preferably, the said Step S3.1 includes:

[0033] Step S3.1.1: Initialize

[0034] Step S3.1.2: If then terminate the program and output the set Otherwise, trigger the execution of Step S3.1.3;

[0035] Step S3.1.3: If satisfies c m,m′ = 1 and μ m′ < K, then update μ m = μ m′ + 1, p m = m′;

[0036] Step S3.1.4: If find all nodes on the communication path from the relay m to the base station update Repeat the triggering step S3.1.2.

[0037] A multi-hop wireless relay deployment system provided by the present invention includes:

[0038] Module M1: Simulate the signal transmission situation in the urban environment through electromagnetic environment simulation software, obtain the signal strength between the base station and the relay candidate locations, the signal strength between the relay candidate locations, and the signal strength between the relay candidate locations and the grids, so as to determine the actual coverage range of each relay;

[0039] Module M2: Introduce the hop count constraint condition, set the maximum number of transit hops from the grid to the base station, and ensure that the synchronization and delay of the communication link are within an acceptable range;

[0040] Module M3: Adopt a two-stage deployment strategy, and gradually optimize the relay node deployment plan through the coverage priority principle and hierarchical network expansion.

[0041] Preferably, the module M1 adopts: evaluate whether S base stations and M relay candidate locations can communicate bidirectionally through electromagnetic environment simulation software. If the base station s and the relay candidate location m can communicate, record a s,m = 1, otherwise record a s,m = 0; evaluate whether M relay candidate locations can communicate bidirectionally. If the relay candidate locations m and m' can communicate, record b m,m′ = 1, otherwise record b m,m′ = 0; evaluate whether M relay candidate locations and N demand grids can communicate. If the relay candidate location m and the grid n can communicate, record c m,n = 1, otherwise record c m,n = 0.

[0042] Preferably, the module M2 adopts:

[0043] Module M2.1: Calculate the minimum communication hop count k s,m from the base station s to the relay candidate location m, and record k m = min s k s,m ;

[0044] Module M2.2: Calculate the coverage gain β of the relay candidate location m according to the weights m of the N demand grids;

[0045]

[0046] Module M2.3: Select the relay candidate location with the largest coverage gain and the communication hop count less than K - 1 with the base station, and record it as m ★ ;

[0047]

[0048] s.t.k m ≤K - 1

[0049] Where K represents the maximum number of hops allowed for normal communication from the base station to the grid in the relay network.

[0050] Preferably, the module M3 adopts:

[0051] Module M3.1: Calculate the set of the minimum relay set all connected to the base station Where represents the relay position set;

[0052] Module M3.2: If then update reset the weight of the covered grid to 0, update the coverage gain of each relay candidate position using the updated grid weight trigger the execution of module M3.3; if then trigger the execution of module M3.4; if then terminate the program and output the relay set Where Q represents the maximum number of relays allowed to be deployed in the problem setting;

[0053] Module M3.3: Judge whether it holds. If it holds, then terminate the program and output the relay position set Otherwise, re - select the relay candidate position with the maximum coverage gain and the number of hops to the base station less than K - 1;

[0054] Module M3.4: Let Q′ represent the remaining number of relays that can be deployed after deploying the relays in the set ;

[0055] Module M3.5: In the sub - network composed of S base stations and the relay set calculate the minimum number of hops from each relay position in the relay set to the base station and the previous node on the path of this minimum number of hops Take the base station with the least number of hops among all base stations as the communication base station, s m = argmin s k s ′ ,m , set

[0056] Module M3.6: Select the one that can communicate with the base station or the relay set Communication with a communication hop count not exceeding K and the relay candidate position with the maximum coverage gain

[0057]

[0058] If is not directly connected to the base station, record its previous node

[0059] Module M3.7: If is directly connected to the base station, then Otherwise,

[0060] Module M3.8: For and Update

[0061] Module M3.9: Update Q′ = Q′ - 1;

[0062] Module M3.10: If Q′ > 0, repeatedly trigger Module M3.6; otherwise the program terminates and outputs the relay position set

[0063] Preferably, the said Module M3.1 includes:

[0064] Module M3.1.1: Initialize

[0065] Module M3.1.2: If then the program terminates and outputs the set Otherwise, trigger the execution of Module M3.1.3;

[0066] Module M3.1.3: If satisfies c m,m′ = 1 and μ m′ < K, then update μ m = μ m′ + 1, p m = m′;

[0067] Module M3.1.4: If Find all nodes on the communication path from the relay m to the base station Update Repeatedly trigger Module M3.1.2.

[0068] Compared with the prior art, the present invention has the following beneficial effects:

[0069] 1. The present invention uses a real electromagnetic simulation software to simulate the signal transmission situation in an urban environment, obtains the signal strength between each potential relay node deployment location and each grid, so as to accurately determine the actual coverage range of each relay node; compared with the geometric model, this method is closer to the actual situation and improves the accuracy and practicability of the deployment scheme.

[0070] 2. The present invention introduces a hop count constraint condition, sets the maximum number of relay hops from the grid to the base station, and ensures that the synchronization and time delay of the communication link are within an acceptable range; in this way, the synchronization and time delay problems in multi-hop communication can be effectively solved, and the reliability of the communication link can be ensured.

[0071] 3. The present invention adopts a two-stage deployment strategy. Through the coverage priority principle, it preferentially selects relay nodes that cover key areas and high-demand areas to generate an initial deployment plan; on this basis, it uses a hierarchical network expansion strategy to gradually optimize the relay node deployment plan, balance the coverage rate and the number of relays, reduce resource consumption, and ensure the effective utilization of overall resources; through this method, the resource allocation efficiency can be effectively improved and a higher coverage rate can be achieved.

[0072] 4. The present invention provides a practical and efficient wireless relay deployment method, which provides important technical support for the wireless network coverage in urban areas. BRIEF DESCRIPTION OF THE DRAWINGS

[0073] Other features, objects and advantages of the present invention will become more apparent by reading the following detailed description of non-limiting embodiments with reference to the accompanying drawings:

[0074] Figure 1 It is a flowchart of a multi-hop wireless relay deployment method. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0075] The present invention will be described in detail below with reference to specific embodiments. The following embodiments will help those skilled in the art to further understand the present invention, but do not limit the present invention in any form. It should be noted that those of ordinary skill in the art can make several changes and improvements without departing from the concept of the present invention. These all belong to the protection scope of the present invention.

[0076] According to a multi-hop wireless relay deployment method provided by the present invention, as Figure 1 shown, it includes:

[0077] Step S1: Simulate the signal transmission situation in the urban environment through an electromagnetic environment simulation software, obtain the signal strength between the base station and the relay candidate positions, the signal strength between the relay candidate positions, and the signal strength between the relay candidate positions and the grids, so as to determine the actual coverage range of each relay.

[0078] Step S2: Introduce the hop count constraint condition, set the maximum number of relay hops from the grid to the base station, and ensure that the synchronization and delay of the communication link are within an acceptable range;

[0079] Step S3: Adopt a two-stage deployment strategy, and gradually optimize the deployment plan of relay nodes through the coverage priority principle and hierarchical network expansion.

[0080] Specifically, the step S1 includes: using electromagnetic environment simulation software to evaluate whether S base stations and M relay candidate locations can communicate bidirectionally. If the base station s and the relay candidate location m can communicate, record a s,m = 1, otherwise record a s,m = 0; evaluate whether M relay candidate locations can communicate bidirectionally. If the relay candidate locations m and m' can communicate, record b m,m′ = 1, otherwise record b m,m′ = 0; evaluate whether M relay candidate locations and N demand grids can communicate. If the relay candidate location m and the grid n can communicate, record c m,n = 1, otherwise record c m,n = 0.

[0081] In this embodiment, more specifically, the step S1 includes:

[0082] Using electromagnetic simulation software, deploy a relay device at the relay candidate location m. If the signal strength received by the base station s from the relay device m and the signal strength received by the relay device m from the base station s are both greater than a pre-set threshold Γ, it is determined that the base station s and the relay candidate location m can communicate bidirectionally; using electromagnetic simulation software, deploy relay devices at the relay candidate locations m and m'. If the signal strength received by the relay device m from the relay device m' and the signal strength received by the relay device m' from the relay device m are both greater than the threshold Γ, it is determined that the relay candidate locations m and m' can communicate bidirectionally; using electromagnetic simulation software, deploy a relay device at the relay candidate location m and a receiver at the demand grid n. If the signal strength received by the receiver n from the relay m is greater than the threshold Γ, it is determined that the relay candidate location m and the demand grid n can communicate.

[0083] Specifically, the step S2 includes:

[0084] Step S2.1, calculate the minimum communication hop count k s,m from the base station s to the relay candidate location m, and record k m = min s k s,m .

[0085] Step S2.2, calculate the coverage gain of the relay candidate location m according to the weights Initialize the set of relay positions where φ represents the empty set.

[0086] Step S2.3, select the relay candidate position with the largest coverage gain and the number of communication hops with the base station less than K - 1, denoted as m ＊ , that is

[0087]

[0088] s.t.k m ≤K - 1

[0089] K represents the maximum number of hops allowed for normal communication from the base station to the grid in the relay network.

[0090] More specifically, the step S2.1 includes: for the base station s, find all relays connected to s, and record the distance as 1; then find all relays connected to the relays with a distance of 1 and whose distances have not been calculated, and record the distance as 2; find all relays connected to the relays with a distance of 2 and whose distances have not been calculated, and record the distance as 3;...; and so on;

[0091] Step S2.1.1, initialize n = 1.

[0092] Step S2.1.2, let Suppose

[0093] Step S2.1.3, if then the program terminates and outputs otherwise calculate Execute step S2.3.

[0094] Step S2.1.4, let k s,m = n + 1, n = n + 1, Jump to step S2.1.2.

[0095] Specifically, the step S3 includes:

[0096] Step S3.1, using the hierarchical network expansion strategy, calculate the set The minimum relay set all connected to the base station

[0097] Step S3.2, if then update Reset the weights of the covered grids to 0, that is Update the coverage gain of each relay candidate position using the updated grid weights Execute step S3.3; if Then jump to step S3.4; if the program terminates and outputs the relay set Q represents the maximum number of relays allowed to be deployed in the problem setting;

[0098] Step S3.3, judge whether it holds. If it holds, the program terminates and outputs the relay position set Otherwise, jump to step S2.3.

[0099] Step S3.4, let Q′ represents the number of relays that can still be deployed after deploying relays at the positions in the set ;

[0100] Step S3.5, in the sub-network composed of S base stations and the relay set calculate the minimum hop count from each relay position in the relay set to the base stations and the predecessor nodes on the path of this minimum hop count Take the base station with the least hop count among all base stations as the communication base station, that is, s m = argmin s k′ s,m , set

[0101] Step S3.6, select the relay candidate positions that can communicate with the base station or the relay set , the communication hop count does not exceed K, and the coverage gain is the largest That is

[0102]

[0103] If is not directly connected to the base station, record its predecessor node

[0104] Step S3.7, if is directly connected to the base station, then Otherwise,

[0105] Step S3.8, for and update

[0106] Step S3.9, update Q′ = Q′ - 1.

[0107] Step S3.10, if Q′ > 0, jump to step S3.6; otherwise the program terminates and outputs the relay position set

[0108] Among them, step S3.1 includes the following sub-steps:

[0109] Step S3.1.1, initialization

[0110] Step S3.1.2, if then the program terminates and outputs the set Otherwise, trigger step S3.1.3.

[0111] Step S3.1.3, if satisfies c m,m′ = 1 and μ m′ < K, then update μ m = μ m '+ 1, p m = m'.

[0112] Step S3.1.4, if find all nodes on the communication path from the relay m to the base station update jump to step S3.1.2.

[0113] Among them, step S3.1.4, for any relay candidate position m, includes the following sub-steps:

[0114] Step S3.1.4.1: Initialization l = p m .

[0115] Step S3.1.4.2: If satisfies a s,l = 1, then output Otherwise, execute step S3.1.4.3.

[0116] Step S3.1.4.3, update l = p l , jump to step S3.1.4.2.

[0117] Among them, step S3.5, for any base station s, includes the following sub-steps:

[0118] Step S3.5.1, initialize the set n = 1.

[0119] Step S3.5.2, if satisfies a s,m = 1, then update k's,m = n,, Update n = n + 1.

[0120] Step S3.5.3, if then the program terminates and outputs the set {p m}; Otherwise, if satisfies c m,m′ = 1, then update k' s,m = k' s,m′ + 1, p m = m'; Update n = n + 1.

[0121] The present invention also provides a multi-hop wireless relay deployment system, and the multi-hop wireless relay deployment system can be implemented by executing the process steps of the multi-hop wireless relay deployment method. That is, those skilled in the art can understand the multi-hop wireless relay deployment method as a preferred implementation manner of the multi-hop wireless relay deployment system.

[0122] Those skilled in the art know that in addition to implementing the system and its various devices, modules, and units provided by the present invention in the form of pure computer-readable program code, the method steps can be logically programmed to enable the system and its various devices, modules, and units provided by the present invention to be implemented in the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers, etc. to achieve the same functions. Therefore, the system and its various devices, modules, and units provided by the present invention can be considered as a hardware component, and the devices, modules, and units included therein for implementing various functions can also be regarded as the structures within the hardware component; the devices, modules, and units for implementing various functions can also be regarded as either software modules for implementing the method or structures within the hardware component.

[0123] The specific embodiments of the present invention have been described above. It should be understood that the present invention is not limited to the above specific embodiments, and those skilled in the art can make various changes or modifications within the scope of the claims, which does not affect the essence of the present invention. Without conflict, the embodiments of the present application and the features in the embodiments can be combined arbitrarily with each other.

Claims

1. A multi-hop wireless relay deployment method, characterized in that: include: Step S1: Simulate the signal transmission situation in the urban environment through electromagnetic environment simulation software to obtain the signal strength between the base station and the candidate relay position, the signal strength between the candidate relay positions, and the signal strength between the candidate relay position and the grid, so as to determine the actual coverage range of each relay; Step S2: introduce hop count constraints and set the maximum number of transit hops from the grid to the base station to ensure that the synchronization and delay of the communication link are within an acceptable range; Step S3: adopt a two-stage deployment strategy, and gradually optimize the deployment plan of relay nodes through the coverage priority principle and hierarchical network expansion.

2. The multi-hop wireless relay deployment method according to claim 1, characterized in that: The step S1 adopts: using electromagnetic environment simulation software to evaluate whether S base stations and M relay candidate locations can communicate bidirectionally. If base station s and relay candidate location m can communicate, then record a s,m =1, otherwise record a s,m = 0; evaluate whether the M relay candidate positions can communicate bidirectionally. If the relay candidate positions m and m′ can communicate, record b m,m′ =1, otherwise b m,m′ = 0; evaluate whether the M relay candidate positions and the N demand grids can communicate. If the relay candidate position m can communicate with the grid n, then record c m,n =1, otherwise c m,n =0.

3. The multi-hop wireless relay deployment method according to claim 1, characterized in that: The step S2 adopts: Step S2.1: Calculate the minimum number of hops k from base station s to relay candidate location m s,m , remember k m =min s k s,m ; Step S2.2: Based on the weights of the N required grids Calculate the coverage gain β of the relay candidate position m m ; Step S2.3: Select the candidate relay position with the largest coverage gain and less than K-1 communication hops with the base station, denoted as m ★ ; s.t.k m ≤K-1 Wherein, K represents the maximum number of hops allowed for normal communication from the base station to the grid in the relay network.

4. The multi-hop wireless relay deployment method according to claim 3, characterized in that: The step S3 adopts: Step S3.1: Calculate the set using the hierarchical network expansion strategy The minimum set of relays that are all connected to the base station in, Represents a set of relay locations; Step S3.2: If Update Reset the weight of the grid to be covered to 0, ω n =(1-c m＊,n )ω n , n=1,…,N, update the coverage gain of each relay candidate position using the updated grid weight Trigger execution of step S3.3; if Then trigger the execution of step S3.4; if The program terminates and outputs the relay set Where Q represents the maximum number of relays allowed to be deployed in the problem setting; Step S3.3: Determination Is it true? If true, the program terminates and outputs the relay position set Otherwise, reselect the candidate relay position with the largest coverage gain and less than K-1 communication hops with the base station; Step S3.4: Let Q′ represents the deployment set The number of relays remaining to be deployed after the relays in are deployed; Step S3.5: In the S base stations and relay sets In the sub-network composed of The minimum number of hops from each relay location to the base station and the preceding node on the minimum hop path Take the base station with the least hops among all base stations as the communication base station, s m =argmin s k s ' ,m ,set up Step S3.6: Select a base station or relay Communication, the number of communication hops does not exceed K, and the relay candidate location with the largest coverage gain like Not directly connected to the base station, record its front node Step S3.7: If Directly connected to the base station, otherwise, Step S3.8: and renew Step S3.9: Update Step S3.10: If Q′>0, repeat step S3.6; otherwise, the program terminates and outputs the relay position set 5. The multi-hop wireless relay deployment method according to claim 1, characterized in that: The step S3.1 comprises: Step S3.1.1: Initialization Step S3.1.2: If The program terminates and the output set Otherwise, trigger the execution of step S3.1.3; Step S3.1.3: If it satisfies c m,m′ = 1 and μ m′ < K, then update μ m = μ m′ + 1, p m = m'; Step S3.1.4: like Find all nodes on the communication path from relay m to the base station renew Repeat triggering step S3.1.

2.

6. A multi-hop wireless relay deployment system, characterized in that: include: Module M1: Use electromagnetic environment simulation software to simulate the signal transmission situation in the urban environment, obtain the signal strength between the base station and the candidate relay location, the signal strength between the candidate relay locations, and the signal strength between the candidate relay location and the grid, so as to determine the actual coverage of each relay; Module M2: introduces hop count constraints and sets the maximum number of transit hops from the grid to the base station to ensure that the synchronization and latency of the communication link are within an acceptable range; Module M3: Adopt a two-stage deployment strategy, gradually optimize the deployment plan of relay nodes through the coverage priority principle and hierarchical network expansion.

7. The multi-hop wireless relay deployment system according to claim 6, characterized in that: The module M1 adopts: using electromagnetic environment simulation software to evaluate whether S base stations and M relay candidate locations can communicate bidirectionally. If base station s and relay candidate location m can communicate, then record a s,m =1, otherwise record a s,m = 0; evaluate whether the M relay candidate positions can communicate bidirectionally. If the relay candidate positions m and m′ can communicate, record b m,m′ =1, otherwise b m,m′ = 0; evaluate whether the M relay candidate positions and the N demand grids can communicate. If the relay candidate position m can communicate with the grid n, then record c m,n =1, otherwise c m,n =0.

8. The multi-hop wireless relay deployment system according to claim 6, characterized in that: The module M2 adopts: Module M2.1: Calculate the minimum number of hops k from base station s to relay candidate location m s,m , remember k m =min s k s,m ; Module M2.2: Based on the weights of N demand grids Calculate the coverage gain β of the relay candidate position m m ; Module M2.3: Select the candidate relay position with the largest coverage gain and less than K-1 communication hops with the base station, denoted as m ★ ; s.t.k m ≤K-1 Wherein, K represents the maximum number of hops allowed for normal communication from the base station to the grid in the relay network.

9. The multi-hop wireless relay deployment system according to claim 8, characterized in that: The module M3 adopts: Module M3.1: Using Hierarchical Networks to Extend Strategy Computation Sets The minimum set of relays that are all connected to the base station in, Represents a set of relay locations; Module M3.2: If Update Reset the weight of the grid to be covered to 0, ω n =(1-c m＊,n )ω n , n=1,…,N, update the coverage gain of each relay candidate position using the updated grid weight Trigger execution module M3.3; if Then trigger the execution module M3.4; if The program terminates and outputs the relay set Where Q represents the maximum number of relays allowed to be deployed in the problem setting; Module M3.3: Judgment Is it true? If true, the program terminates and outputs the relay position set Otherwise, reselect the candidate relay position with the largest coverage gain and less than K-1 communication hops with the base station; Module M3.4: Command Q′ represents the deployment set The number of relays remaining to be deployed after the relays in are deployed; Module M3.5: In a set of S base stations and relays In the sub-network composed of The minimum number of hops from each relay location to the base station and the preceding node on the minimum hop path Take the base station with the least hops among all base stations as the communication base station, s m =argmin s k s ' ,m ,set up Module M3.6: Select the module that can be integrated with base station or relay Communication, the number of communication hops does not exceed K, and the relay candidate location with the largest coverage gain like Not directly connected to the base station, record its front node Module M3.7: If Directly connected to the base station, otherwise, Module M3.8: Yes and renew Module M3.9: Update Module M3.10: If Q′>0, repeat the triggering of module M3.6; otherwise, the program terminates and outputs the relay position set 10. The multi-hop wireless relay deployment system according to claim 6, characterized in that: The module M3.1 includes: Module M3.1.1: Initialization Module M3.1.2: If The program terminates and the output set Otherwise, trigger the execution module M3.1.3; Module M3.1.3: If c m,m′ = 1 and μ m′ < K, then update μ m = μ m′ + 1, p m = m'; Module M3.1.4: like Find all nodes on the communication path from relay m to the base station renew Repeat trigger module M3.1.2.

Images