A method, system, computer storage medium and program for deploying a heterogeneous directional sensor network

Through improved genetic algorithms, the redundancy and improper use of deployment tuples in heterodirected sensor network deployment is solved, and efficient network deployment is achieved, reducing the cost and improving the solution quality.

CN120321131BActive Publication Date: 2025-08-26CHANGSHU INSTITUTE OF TECHNOLOGY
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202510797243.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-06-16
Publication Date
2025-08-26
Estimated Expiration
2045-06-16

AI Technical Summary

Technical Problem

The prior art has problems of redundant deployment tuples and improper use in heterogeneous directional sensor network deployment, resulting in high cost of network deployment and low solution quality, making it difficult to find the optimal solution in polynomial time.

Method used

Using an improved genetic algorithm, using efficient individual coding and cross-mutation operations through initialization, population evolution and output stages, ensure that there is at most one deployment tuple in the same deployment location, and improve the quality of the solution through local optimization.

Benefits of technology

It improves the scalability and solution quality of network deployment, reduces the cost of network deployment, and enhances the probability of finding feasible solutions. It obtains lower network deployment costs compared to variable-length genetic algorithms.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120321131B_ABST
    Figure CN120321131B_ABST
Patent Text Reader

Abstract

The present invention discloses a method for deploying a heterogeneous directional sensor network, which includes an initialization phase, wherein each element of each individual in the population is first randomly initialized, the length of the individual code is the number of target points, each element corresponds to each target point, and each element indicates which deployment position of the directional sensor covers the corresponding target point. The fitness of each individual and the corresponding network deployment are calculated. In the population evolution phase, each iteration calculates the mutation and crossover individual of the current individual, calculates the fitness of the crossover individual and the network deployment, and replaces the individual if it is smaller than the current individual. The mutated individual is obtained by weighted summation of the other three individuals, and the crossover individual is obtained by replacing the current individual element with the element selected by the mutated individual. In the output phase, after the iteration is completed, the network deployment of the individual with the smallest fitness is selected as the final deployment. The present invention also discloses a system, a computer storage medium, and a program for implementing the method. The present invention can improve the probability of finding a feasible solution and reduce the cost of network deployment.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to a method, system, computer storage medium and program for deploying a heterogeneous directional sensor network, and belongs to the technical field of network planning. Background Art

[0002] The deployment of a heterogeneous directional sensor network for target coverage requires not only selecting the deployment location and working direction of the directional sensors, but also selecting the type of directional sensors. This is a relatively complex NP-hard problem and cannot be optimally solved in polynomial time. Therefore, it is necessary to design a heuristic algorithm to obtain a high-quality approximate solution.

[0003] The existing technology uses microbial genetic algorithms to solve the minimum cost deployment problem of heterogeneous directional sensor networks, using 0-1 vectors to represent chromosomes. Due to the large number of candidate deployment tuples and the very long chromosome encoding, this method has low scalability. In addition, this encoding is prone to improper use of deployment tuples, redundant deployment tuples, and missing deployment tuples, resulting in low solution quality.

[0004] Another approach uses a variable-length genetic algorithm to solve the problem, encoding the directional sensor deployment using a subset of candidate deployment tuple identification numbers. However, the results of crossover and mutation operations cannot guarantee that there can be at most one deployment tuple at a given location. This means that multiple deployment tuples may appear at the same location, violating the constraint that only one directional sensor can be deployed at each location. Both the initialization results and the crossover and mutation operations suffer from redundant deployment tuples and improper use of deployment tuples, resulting in high network deployment costs and low solution quality. Summary of the Invention

[0005] To address the shortcomings of the prior art, the present invention provides a heterogeneous directional sensor network deployment method that addresses the issues of redundant and improperly used deployment tuples, thereby reducing network deployment costs. The present invention also provides a heterogeneous directional sensor network deployment system, computer storage medium, and program for implementing this method.

[0006] The technical solution of the present invention is a method for deploying a heterogeneous directional sensor network, comprising the following steps:

[0007] In the initialization phase, each element of each individual in the population is randomly initialized. The length of the individual code is the number of target points. Each element corresponds to each target point one by one. Each element indicates which deployment position of the directional sensor covers the corresponding target point. The fitness of each individual and the corresponding network deployment are calculated. The fitness is ,in ndc represents the network deployment cost, w represents the weighting coefficient, tpcrepresents the total number of target points, nct represents the number of target points that can be covered, the network deployment includes the location, type and working direction of all deployed directional sensors, and the network deployment cost is the total price of all deployed directional sensors;

[0008] In the population evolution stage, for each individual, in each iteration, the mutant individual and the crossover individual are calculated, the fitness of the crossover individual and the corresponding network deployment are calculated, and when the fitness of the crossover individual is less than that of the current individual, the current individual is replaced by the crossover individual. The mutant individual is obtained by weighted summation of the other three individuals except the current individual, and the crossover individual is obtained by replacing the elements of the current individual with the elements of the mutant individual.

[0009] In the output stage, after the population evolution iteration is completed, the network deployment corresponding to the individual with the smallest fitness is used as the final network deployment.

[0010] Furthermore, the calculation of the variant individual specifically involves randomly selecting three different individuals within the population, each of which is different from the current individual. The difference between two of these individuals is weighted by an amplification factor and then summed with the difference between the two individuals and the third individual to obtain a variant individual. The variant individual constructs a new individual using the linear representation of the individual, thereby fully utilizing the connections between solutions and facilitating the search for a more optimal feasible solution.

[0011] Furthermore, the calculation of the crossover individual is specifically as follows: the crossover individual is initialized according to the current individual, and a dimension of the crossover individual is randomly selected. j , modify its value to the dimension of the mutant individual j For each other dimension of the cross individual k , and modify its value to the dimension of the mutant individual with the set crossover probability k The crossover individual not only retains some of the excellent characteristics of the current individual, but also introduces new characteristics of the mutant individual, which helps to balance the global search and local search.

[0012] Furthermore, the fitness of the individual and the corresponding network deployment are calculated by iteratively calculating the network deployment until the network deployment cannot be optimized. Each iterative calculation of the network deployment includes:

[0013] Calculate each deployment position based on individual values i Covered target point set T i ;

[0014] Calculate each deployment location i type and direction of operation to enable coverage T i There are the most target points and the price is the smallest if Ti If empty, then at position i No sensors deployed;

[0015] For each target point, traverse each deployed sensor in turn to find a sensor that can cover the target point and has the lowest price. If one can be found, modify the value of the dimension corresponding to the target point in the individual to be the index of the deployment location of the sensor in the set of deployment locations that can cover the target point.

[0016] Another technical solution of the present invention is: a heterogeneous directional sensor network deployment system, comprising:

[0017] The initialization module is used to randomly initialize each element of each individual in the population. The length of the individual code is the number of target points. Each element corresponds to each target point one by one. Each element indicates which deployment position of the directional sensor covers the corresponding target point. The fitness of each individual and the corresponding network deployment are calculated. ,in ndc represents the network deployment cost, w represents the weighting coefficient, tpc represents the total number of target points, nct represents the number of target points that can be covered, the network deployment includes the location, type and working direction of all deployed directional sensors, and the network deployment cost is the total price of all deployed directional sensors;

[0018] The population evolution module is used to calculate the mutant individual and crossover individual for each individual in each iteration, calculate the fitness of the crossover individual and the corresponding network deployment, and replace the current individual with the crossover individual when the fitness of the crossover individual is less than that of the current individual. The mutant individual is obtained by weighted summation of the other three individuals except the current individual, and the crossover individual is obtained by replacing the elements of the current individual with the elements of the mutant individual;

[0019] The output module is used to take the network deployment corresponding to the individual with the smallest fitness as the final network deployment after the population evolution iteration is completed.

[0020] Furthermore, the population evolution module includes a mutant individual calculation module, which is used to randomly select three different individuals in the population, each of which is different from the current individual, and weight the difference between two of the individuals with an amplification factor and sum it with the third individual to obtain a mutant individual.

[0021] Furthermore, the population evolution module includes a crossover individual calculation module, which is used to initialize the crossover individual according to the current individual, randomly select a dimension of the crossover individual j , modify its value to the dimension of the mutant individualj For each other dimension of the cross individual k , and modify its value to the dimension of the mutant individual with the set crossover probability k value.

[0022] Furthermore, a fitness and network deployment calculation module is included, which is used to iteratively calculate the network deployment until the network deployment cannot be optimized. Each iterative calculation of the network deployment includes:

[0023] Calculate each deployment position based on individual values i Covered target point set T i ;

[0024] Calculate each deployment location i type and direction of operation to enable coverage T i There are the most target points and the price is the smallest if T i If empty, then at position i No sensors deployed;

[0025] For each target point, traverse each deployed sensor in turn to find a sensor that can cover the target point and has the lowest price. If one can be found, modify the value of the dimension corresponding to the target point in the individual to be the index of the deployment location of the sensor in the set of deployment locations that can cover the target point.

[0026] Yet another technical solution of the present invention is: a computer storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the aforementioned heterogeneous directional sensor network deployment method is implemented.

[0027] Yet another technical solution of the present invention is: a computer program, which, when executed by a processor, implements the aforementioned method for deploying a heterogeneous directional sensor network.

[0028] Compared with the prior art, the advantages of the technical solution provided by the present invention are:

[0029] This invention utilizes a more efficient and concise individual encoding, improving scalability. Based on this individual encoding, a network deployment calculation method is designed. This method not only rationally utilizes deployment tuples, ensuring that there is at most one deployment tuple at the same deployment location, resolving the issue of violating deployment constraints in VLGA, but also enables local optimization of individuals. Mutating individuals helps explore a broader solution space, increasing the likelihood of finding a more optimal solution. Crossover individuals retain some of the excellent properties of the current individual while introducing new properties of the mutated individual, helping to balance global and local search. Overall, this invention increases the probability of finding a feasible solution and achieves a lower network deployment cost compared to variable-length genetic algorithms. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 Schematic diagram of the process of deploying a heterogeneous directional sensor network according to an embodiment.

[0031] Figure 2 Schematic diagram of the process of calculating individual fitness and corresponding network deployment in the heterogeneous directional sensor network deployment method of the embodiment.

[0032] Figure 3 Graph showing experimental results of the heterogeneous directional sensor network deployment method and the variable-length genetic algorithm of the embodiment. DETAILED DESCRIPTION

[0033] The present invention will be further described below with reference to the following examples. It should be understood that these examples are only used to illustrate the present invention and are not used to limit the scope of the present invention. After reading this description, various equivalent modifications to this description by those skilled in the art fall within the scope defined by the claims appended to this application.

[0034] This embodiment involves a heterogeneous directional sensor network deployment system, including:

[0035] The initialization module is used to randomly initialize each element of each individual in the population. The length of the individual code is the number of target points. Each element corresponds to each target point one by one. Each element indicates which deployment position of the directional sensor covers the corresponding target point. The fitness of each individual and the corresponding network deployment are calculated. The fitness is ,in ndc represents the network deployment cost, w represents the weighting coefficient, tpc represents the total number of target points, nct It represents the number of target points that can be covered. The network deployment includes the location, type and working direction of all deployed directional sensors. The network deployment cost is the total price of all deployed directional sensors.

[0036] The population evolution module calculates mutant and crossover individuals for each individual in each iteration. The fitness of the crossover individual and its corresponding network deployment are calculated, and the current individual is replaced with the crossover individual if its fitness is lower than the current one. The mutant individual calculation module calculates the mutant individual, which is the weighted sum of the three individuals other than the current one. The crossover individual calculation module calculates the crossover individual, which is obtained by replacing the elements of the current individual with the elements of the mutant individual.

[0037] The output module is used to take the network deployment corresponding to the individual with the smallest fitness as the final network deployment after the population evolution iteration is completed.

[0038] The system uses the fitness and network deployment calculation module to iteratively calculate the network deployment until the network deployment cannot be optimized. Each iteration of network deployment calculation includes:

[0039] Calculate each deployment position based on individual values i Covered target point set T i ;

[0040] Calculate each deployment location i type and direction of operation to enable coverage T i There are the most target points and the price is the smallest if T i If empty, then at position i No sensors deployed;

[0041] For each target point, traverse each deployed sensor in turn to find a sensor that can cover the target point and has the lowest price. If one can be found, the value of the dimension corresponding to the target point in the individual is modified to the index of the sensor's deployment location in the set of deployment locations that can cover the target point.

[0042] Assume that the number of target points is tpc , the number of candidate deployment locations for directional sensors is dsc , the number of directional sensor types is tyc , No. i The price of this type of directional sensor is p i , the number of candidate working directions of the directional sensor is wdc In the method of the present invention, the population size is set to ps , use to indicate the i individuals, using the j The termination condition of the method of the present invention is to complete the population evolution T Generation. Use wThe weighting coefficient representing the number of uncovered target points. C i Indicates that the target point can be covered i A collection of deployment locations.

[0043] Use sector-shaped areas to model the sensing range of directional sensors. Target coverage matrix M The size is dsc × tyc × wdc × tpc , whose elements Indicates deployment at location i The type is j Directional sensors use working directions k Whether the target point can be covered l , =1 means yes, =0 means no. Based on M You can create each C l , and .

[0044] The heterogeneous directional sensor network deployment method implemented by the heterogeneous directional sensor network deployment system, please refer to the specific Figure 1 Shown, including:

[0045] Step 101: For each individual , which is encoded as an indication of the deployment position covering each target point. Thus, the length of the individual is tpc , the first j Elements represent the coverage target points j The deployment location is C j Randomly initialize each element of the individual for Then use the CF algorithm to recalculate and its fitness and corresponding network deployment.

[0046] Step 102: t = 1.

[0047] Step 103: i = 1.

[0048] Step 104: Execute mutation operation to generate mutant individuals The specific mutation operation is: Assume that the current individual is i First, randomly select three different individuals j 、 k 、 l , they cannot be individualsi .make af represents the amplification factor, then the mutant individual is Then, Round it off and limit the value of each element to its domain. Step 105: and Perform crossover operation to generate crossover individuals The crossover operation is as follows: Assume that the current individual is i First, randomly select a target point j .make cp represents the crossover probability, let rand represents a random function on the interval [0,1], then the crossover individual is calculated as follows:

[0049] .

[0050] Step 106: Call the CF algorithm to calculate the new and its fitness and corresponding network deployment.

[0051] Step 107: If The fitness is less than The fitness of Updated to , and update The fitness and corresponding network deployment.

[0052] Step 108: i = i +1.

[0053] Step 109: If i ≤ ps , then go to step 104.

[0054] Step 110: t = t +1.

[0055] Step 111: If t ≤ T , then go to step 103.

[0056] Step 112: Find the individual with the minimum fitness, and output its fitness and corresponding network deployment.

[0057] Please combine Figure 2 As shown, the method for calculating fitness and network deployment using the CF algorithm in the above method includes the following steps:

[0058] Step 201: ndc = ∞.

[0059] Step 202: According toZ Calculate each deployment location i Covered target point set T i .

[0060] Step 203: i = 1, c = 0.

[0061] Step 204: SD { i} = [ ].

[0062] Step 205: If T i If it is empty, go to step 218.

[0063] Step 206: mp = ∞, mn = 0.

[0064] Step 207: j = 1.

[0065] Step 208: k = 1.

[0066] Step 209: Calculate the deployment location i The type is j Directional sensor (price is p j ) Use working direction k Able to cover T i The number of target points in n .

[0067] Step 210: If ( n > mn )or( n >0 and n == mn and p j < mp ), go to step 211; otherwise, go to step 213.

[0068] Step 211: mn = n , mp = p j .

[0069] Step 212: SD { i} = [ j , k ].

[0070] Step 213: k = k +1.

[0071] Step 214: If k ≤ wdc , then go to step 209.

[0072] Step 215: j = j +1.

[0073] Step 216: If j ≤ tyc , then go to step 208.

[0074] Step 217: c = c + mp .

[0075] Step 218: i = i +1.

[0076] Step 219: If i ≤ dsc , then go to step 204.

[0077] Step 220: If c < ndc , then go to step 221; otherwise, go to step 234.

[0078] Step 221: ndc = c .

[0079] Step 222: nct = 0.

[0080] Step 223: i = 1.

[0081] Step 224: j = 1, mp = ∞, ms = 0.

[0082] Step 225: If SD { j} ≠ [ ] and deployed at position j The type is SD { j}(1) Sensor working direction SD { j}(2) Able to cover the target point i and p SD{j}(1) < mp , then go to step 226; otherwise, go to step 227.

[0083] Step 226: ms = j , mp = p SD{j}(1) .

[0084] Step 227: j = j +1.

[0085] Step 228: If j ≤ dsc , then go to step 225.

[0086] Step 229: If ms >0, go to step 230; otherwise, go to step 232.

[0087] Step 230: Z ( i ) is set to ms exist C i The index in .

[0088] Step 231: nct = nct +1.

[0089] Step 232: i = i +1.

[0090] Step 233: If i ≤ tpc , then go to step 224; otherwise, go to step 202.

[0091] Step 234: fv = ndc + w ( tpc - nct ).

[0092] Step 235: Return to New Z , Network Deployment SD (location, type, and working direction of all deployed directional sensors), and fitness fv .

[0093] In order to verify the advantages of the method of the present invention, experiments were conducted to compare the network deployment costs obtained by the method of the present invention and the variable length genetic algorithm (VLGA). In the experiment, two types of directional sensors can be deployed. The sensing angle of the first type of directional sensor is p / 2, the sensing radius is 30 meters, and the price is 1,080 yuan. The sensing angle of the second type of directional sensor is p / 3, the sensing radius is 40 meters, and the price is 720 yuan. Each directional sensor has four available working directions, namely 0, p / 2, p, and 3p / 2. The number of candidate deployment positions for directional sensors is fixed at 60, while the number of target points takes different values. For each value of the number of target points, 20 problem instances are randomly generated, and the average results of each algorithm are calculated. For each problem instance, the positions of each target point and each candidate deployment position are randomly generated. The population size of the two algorithms is 100, and the evolutionary generations are 1,000. In the method of the present invention, the crossover probability cp Set to 0.9, the magnification factor af Set to 0.5, the weighted coefficient in the individual fitness calculation formula w Set to 10 8 . The experimental program was developed using MATLAB.

[0094] The following are the experimental process data of representative examples with different numbers of target points:

[0095] For an example with 10 target points, the target points are positioned as follows:

[0096] The position of the first target point is (50.581846, 74.344241).

[0097] The position of the second target point is (105.543168, 105.834707).

[0098] The position of the third target point is (7.064129, 38.995338).

[0099] The position of the fourth target point is (108.722730, 66.574874).

[0100] The position of the fifth target point is (10.328413, 116.448377).

[0101] The position of the sixth target point is (33.072540, 119.880754).

[0102] The position of the 7th target point is (0.724075, 54.068432).

[0103] The position of the 8th target point is (50.836780, 75.989666).

[0104] The position of the 9th target point is (79.128476, 106.817832).

[0105] The position of the 10th target point is (4.993869, 74.149592).

[0106] The candidate deployment locations are as follows:

[0107] The first candidate deployment location is (23.324648, 118.766377).

[0108] The second candidate deployment location is (109.604100, 76.165085).

[0109] The third candidate deployment location is (40.575893, 10.209897).

[0110] The fourth candidate deployment location is (8.042051, 39.503661).

[0111] The fifth candidate deployment location is (17.193248, 86.941745).

[0112] The sixth candidate deployment location is (16.312999, 83.198571).

[0113] The seventh candidate deployment location is (114.167329, 37.451106).

[0114] The 8th candidate deployment location is (51.240810, 59.783708).

[0115] The ninth candidate deployment location is (36.613943, 73.994783).

[0116] The 10th candidate deployment location is (85.109931, 22.569896).

[0117] The 11th candidate deployment location is (80.329451, 102.691739).

[0118] The 12th candidate deployment location is (75.167333, 97.549134).

[0119] The 13th candidate deployment location is (24.945805, 118.058282).

[0120] The 14th candidate deployment location is (118.110714, 74.089031).

[0121] The 15th candidate deployment location is (49.722185, 115.053429).

[0122] The 16th candidate deployment location is (13.181789, 2.689100).

[0123] The 17th candidate deployment location is (43.716762, 62.592640).

[0124] The 18th candidate deployment position is (1.672372, 97.627034).

[0125] The 19th candidate deployment location is (74.453432, 92.173396).

[0126] The 20th candidate deployment location is (24.103424, 7.239394).

[0127] The 21st candidate deployment location is (105.246904, 64.365943).

[0128] The 22nd candidate deployment location is (79.153736, 80.286222).

[0129] The 23rd candidate deployment location is (37.213971, 87.671560).

[0130] The 24th candidate deployment location is (53.251658, 95.533810).

[0131] The 25th candidate deployment position is (3.009749, 59.794381).

[0132] The 26th candidate deployment location is (88.973330, 84.334644).

[0133] The 27th candidate deployment location is (86.144761, 8.317543).

[0134] The 28th candidate deployment position is (0.265587, 87.264743).

[0135] The 29th candidate deployment location is (44.138022, 117.723266).

[0136] The 30th candidate deployment location is (114.032505, 41.120070).

[0137] The 31st candidate deployment location is (39.252430, 63.217146).

[0138] The 32nd candidate deployment location is (11.012343, 75.792877).

[0139] The 33rd candidate deployment location is (73.255241, 11.550385).

[0140] The 34th candidate deployment location is (24.808864, 18.789460).

[0141] The 35th candidate deployment location is (22.668656, 96.621312).

[0142] The 36th candidate deployment location is (90.339925, 63.667566).

[0143] The 37th candidate deployment location is (63.654248, 45.783823).

[0144] The 38th candidate deployment location is (45.474047, 14.063596).

[0145] The 39th candidate deployment location is (18.924416, 14.683620).

[0146] The 40th candidate deployment location is (46.212660, 75.259120).

[0147] The 41st candidate deployment location is (48.955771, 62.465051).

[0148] The 42nd candidate deployment location is (110.233996, 16.276690).

[0149] The 43rd candidate deployment location is (79.852519, 38.897763).

[0150] The 44th candidate deployment location is (72.109974, 1.568237).

[0151] The 45th candidate deployment location is (56.047192, 21.287279).

[0152] The 46th candidate deployment location is (23.694285, 14.290053).

[0153] The 47th candidate deployment location is (58.686425, 9.919034).

[0154] The 48th candidate deployment location is (70.011494, 12.364170).

[0155] The 49th candidate deployment position is (4.103471, 70.474345).

[0156] The 50th candidate deployment location is (11.534674, 97.713143).

[0157] The 51st candidate deployment location is (14.136355, 86.717014).

[0158] The 52nd candidate deployment location is (58.822644, 34.234035).

[0159] The 53rd candidate deployment location is (63.314740, 34.544936).

[0160] The 54th candidate deployment location is (49.671150, 27.383143).

[0161] The 55th candidate deployment location is (65.512514, 10.746609).

[0162] The 56th candidate deployment location is (11.680861, 12.493790).

[0163] The 57th candidate deployment location is (38.201655, 13.210714).

[0164] The 58th candidate deployment location is (53.754569, 1.640301).

[0165] The 59th candidate deployment location is (8.440371, 96.123660).

[0166] The 60th candidate deployment position is (8.912243, 10.140045).

[0167] The network deployment is as follows:

[0168] The second type of directional sensor is deployed at the second position, and its working direction is 3π / 2.

[0169] The second type of directional sensor is deployed at the fourth position, and its working direction is π / 2.

[0170] The second type of directional sensor is deployed at the fifth position, and its working direction is 0.

[0171] The first type of directional sensor is deployed at the 26th position, and its working direction is π / 2.

[0172] The second type of directional sensor is deployed at the 29th position, and its working direction is π.

[0173] The second type of directional sensor is deployed at the 49th position, and its working direction is 3π / 2.

[0174] For an example where the number of target points is 15, the target point positions are as follows:

[0175] The position of the first target point is (97.968168, 55.044879).

[0176] The position of the second target point is (85.227696, 100.203585).

[0177] The position of the third target point is (39.286844, 21.894996).

[0178] The position of the fourth target point is (48.532867, 13.294674).

[0179] The position of the fifth target point is (117.437609, 15.093966).

[0180] The position of the sixth target point is (98.627161, 83.322270).

[0181] The position of the 7th target point is (76.102688, 38.629756).

[0182] The position of the 8th target point is (109.637785, 88.352112).

[0183] The position of the 9th target point is (73.638396, 96.315816).

[0184] The position of the 10th target point is (114.313906, 64.588061).

[0185] The position of the 11th target point is (48.360532, 21.378173).

[0186] The position of the 12th target point is (47.884292, 19.462133).

[0187] The position of the 13th target point is (27.818373, 1.929062).

[0188] The position of the 14th target point is (17.953334, 57.625356).

[0189] The position of the 15th target point is (11.487411, 22.604526).

[0190] The candidate deployment locations are as follows:

[0191] The first candidate deployment location is (30.843607, 90.386706).

[0192] The second candidate deployment location is (78.386634, 24.898029).

[0193] The third candidate deployment location is (45.799114, 111.673376).

[0194] The fourth candidate deployment location is (88.302257, 27.114802).

[0195] The fifth candidate deployment location is (96.679145, 47.905056).

[0196] The sixth candidate deployment location is (2.400180, 14.111981).

[0197] The seventh candidate deployment location is (19.426644, 75.547228).

[0198] The 8th candidate deployment location is (13.481375, 79.137094).

[0199] The ninth candidate deployment location is (50.612737, 11.379330).

[0200] The 10th candidate deployment location is (104.911549, 93.002211).

[0201] The 11th candidate deployment location is (89.966659, 71.624236).

[0202] The 12th candidate deployment location is (60.651636, 70.545910).

[0203] The 13th candidate deployment location is (20.846136, 114.318727).

[0204] The 14th candidate deployment location is (46.559114, 28.409979).

[0205] The 15th candidate deployment location is (101.649653, 23.651955).

[0206] The 16th candidate deployment location is (10.389225, 50.916705).

[0207] The 17th candidate deployment location is (68.722833, 27.028301).

[0208] The 18th candidate deployment location is (106.523098, 29.108886).

[0209] The 19th candidate deployment location is (76.051382, 59.341843).

[0210] The 20th candidate deployment location is (19.440560, 96.408116).

[0211] The 21st candidate deployment location is (69.036598, 69.112840).

[0212] The 22nd candidate deployment location is (113.381009, 19.631306).

[0213] The 23rd candidate deployment location is (55.849288, 49.210851).

[0214] The 24th candidate deployment location is (73.056337, 39.674555).

[0215] The 25th candidate deployment location is (105.235875, 19.289220).

[0216] The 26th candidate deployment position is (95.917545, 3.822508).

[0217] The 27th candidate deployment location is (11.209622, 91.614509).

[0218] The 28th candidate deployment location is (32.968897, 58.279744).

[0219] The 29th candidate deployment location is (42.674952, 82.137684).

[0220] The 30th candidate deployment location is (29.914669, 39.475926).

[0221] The 31st candidate deployment location is (73.598356, 84.467850).

[0222] The 32nd candidate deployment location is (9.245632, 64.685291).

[0223] The 33rd candidate deployment location is (27.303332, 52.497929).

[0224] The 34th candidate deployment location is (102.348125, 77.161242).

[0225] The 35th candidate deployment location is (62.753560, 85.866212).

[0226] The 36th candidate deployment location is (97.945789, 55.620935).

[0227] The 37th candidate deployment location is (90.349101, 35.710494).

[0228] The 38th candidate deployment location is (110.528999, 94.658329).

[0229] The 39th candidate deployment location is (10.954907, 17.270593).

[0230] The 40th candidate deployment position is (7.508458, 28.895913).

[0231] The 41st candidate deployment location is (26.242383, 82.604276).

[0232] The 42nd candidate deployment location is (93.016642, 16.395241).

[0233] The 43rd candidate deployment location is (31.025374, 54.679552).

[0234] The 44th candidate deployment location is (22.415488, 12.669212).

[0235] The 45th candidate deployment location is (118.190551, 68.171296).

[0236] The 46th candidate deployment location is (44.007849, 40.290396).

[0237] The 47th candidate deployment location is (42.187398, 82.979651).

[0238] The 48th candidate deployment location is (54.451938, 97.665446).

[0239] The 49th candidate deployment location is (28.622897, 24.681679).

[0240] The 50th candidate deployment position is (7.612127, 65.823660).

[0241] The 51st candidate deployment location is (45.214707, 23.629977).

[0242] The 52nd candidate deployment location is (26.043268, 14.045114).

[0243] The 53rd candidate deployment location is (8.792032, 91.534679).

[0244] The 54th candidate deployment location is (94.499262, 27.913365).

[0245] The 55th candidate deployment location is (108.083862, 64.452475).

[0246] The 56th candidate deployment location is (98.456069, 73.127097).

[0247] The 57th candidate deployment location is (104.817612, 9.235835).

[0248] The 58th candidate deployment location is (7.255372, 62.798761).

[0249] The 59th candidate deployment location is (99.455735, 113.823327).

[0250] The 60th candidate deployment location is (40.764989, 43.473166).

[0251] The network deployment is as follows:

[0252] The second type of directional sensor is deployed at the first position, and its working direction is 3π / 2.

[0253] The second type of directional sensor is deployed at the second position, and its working direction is π.

[0254] The first type of directional sensor is deployed at the 6th position, and its working direction is 0.

[0255] The second type of directional sensor is deployed at the 10th position, and its working direction is 3π / 2.

[0256] The second type of directional sensor is deployed at the 11th position, and its working direction is 3π / 2.

[0257] The second type of directional sensor is deployed at the 48th position, and its working direction is 0.

[0258] The second type of directional sensor is deployed at the 55th position, and its working direction is π / 2.

[0259] The second type of directional sensor is deployed at the 57th position, and its working direction is 0.

[0260] For an example with 20 target points, the target points are positioned as follows:

[0261] The position of the first target point is (38.018515, 71.434940).

[0262] The position of the second target point is (95.835485, 86.354471).

[0263] The position of the third target point is (7.452923, 109.424365).

[0264] The position of the fourth target point is (118.332870, 43.738895).

[0265] The position of the fifth target point is (75.848457, 62.001871).

[0266] The position of the sixth target point is (12.265926, 40.377809).

[0267] The position of the 7th target point is (77.111208, 40.713268).

[0268] The position of the 8th target point is (32.389847, 39.957915).

[0269] The position of the 9th target point is (111.287812, 51.277612).

[0270] The position of the 10th target point is (59.320742, 13.014407).

[0271] The position of the 11th target point is (117.773754, 41.574063).

[0272] The position of the 12th target point is (31.548208, 38.328124).

[0273] The position of the 13th target point is (89.403885, 46.558096).

[0274] The position of the 14th target point is (81.677401, 49.101681).

[0275] The location of the 15th target point is (118.443527, 96.260930).

[0276] The position of the 16th target point is (119.295470, 93.947698).

[0277] The position of the 17th target point is (33.736969, 89.612784).

[0278] The position of the 18th target point is (106.891955, 21.341350).

[0279] The position of the 19th target point is (30.066939, 91.670411).

[0280] The position of the 20th target point is (9.739861, 82.082157).

[0281] The candidate deployment locations are as follows:

[0282] The first candidate deployment location is (91.738938, 103.771732).

[0283] The second candidate deployment location is (116.686243, 84.386764).

[0284] The third candidate deployment location is (42.588461, 85.025208).

[0285] The fourth candidate deployment location is (45.313961, 34.881407).

[0286] The fifth candidate deployment location is (29.098184, 98.385848).

[0287] The sixth candidate deployment location is (94.687418, 66.335983).

[0288] The seventh candidate deployment location is (18.603387, 59.225838).

[0289] The eighth candidate deployment location is (108.307766, 112.868132).

[0290] The ninth candidate deployment location is (67.022484, 114.989984).

[0291] The 10th candidate deployment location is (57.495778, 104.380268).

[0292] The 11th candidate deployment location is (116.594817, 62.111132).

[0293] The 12th candidate deployment location is (5.064034, 33.787691).

[0294] The 13th candidate deployment location is (76.909907, 11.434865).

[0295] The 14th candidate deployment location is (114.821396, 91.975851).

[0296] The 15th candidate deployment position is (0.747952, 5.326482).

[0297] The 16th candidate deployment location is (30.109079, 76.764217).

[0298] The 17th candidate deployment location is (114.484780, 116.891341).

[0299] The 18th candidate deployment location is (98.198749, 11.217960).

[0300] The 19th candidate deployment position is (1.132873, 107.711715).

[0301] The 20th candidate deployment location is (85.266801, 94.994301).

[0302] The 21st candidate deployment location is (89.037381, 75.394841).

[0303] The 22nd candidate deployment location is (119.830079, 54.972486).

[0304] The 23rd candidate deployment location is (79.884625, 100.772013).

[0305] The 24th candidate deployment location is (103.951486, 68.036708).

[0306] The 25th candidate deployment location is (30.564374, 117.657143).

[0307] The 26th candidate deployment location is (69.944242, 42.679096).

[0308] The 27th candidate deployment location is (115.854344, 88.406991).

[0309] The 28th candidate deployment location is (15.394539, 108.474190).

[0310] The 29th candidate deployment location is (22.177679, 109.467340).

[0311] The 30th candidate deployment location is (13.390725, 51.067213).

[0312] The 31st candidate deployment location is (17.555921, 28.815426).

[0313] The 32nd candidate deployment location is (27.916895, 70.574954).

[0314] The 33rd candidate deployment location is (31.178386, 53.049001).

[0315] The 34th candidate deployment location is (14.191929, 59.833605).

[0316] The 35th candidate deployment location is (30.845756, 60.918740).

[0317] The 36th candidate deployment location is (86.399931, 101.000778).

[0318] The 37th candidate deployment location is (83.486863, 51.209821).

[0319] The 38th candidate deployment location is (110.470164, 66.871365).

[0320] The 39th candidate deployment location is (52.723459, 67.527688).

[0321] The 40th candidate deployment location is (46.710248, 84.455552).

[0322] The 41st candidate deployment location is (57.937307, 78.773411).

[0323] The 42nd candidate deployment location is (25.479887, 74.827126).

[0324] The 43rd candidate deployment location is (67.418908, 83.185399).

[0325] The 44th candidate deployment location is (41.285375, 114.372856).

[0326] The 45th candidate deployment location is (77.359817, 98.599892).

[0327] The 46th candidate deployment location is (105.261421, 74.662168).

[0328] The 47th candidate deployment location is (98.599338, 96.867405).

[0329] The 48th candidate deployment location is (109.878153, 78.031891).

[0330] The 49th candidate deployment location is (10.234853, 101.384399).

[0331] The 50th candidate deployment location is (89.132848, 26.133454).

[0332] The 51st candidate deployment location is (100.386805, 65.876420).

[0333] The 52nd candidate deployment location is (61.168460, 85.576424).

[0334] The 53rd candidate deployment location is (18.921783, 15.586351).

[0335] The 54th candidate deployment location is (53.995482, 74.996764).

[0336] The 55th candidate deployment location is (45.302306, 32.547384).

[0337] The 56th candidate deployment location is (88.475383, 44.314013).

[0338] The 57th candidate deployment location is (103.753018, 36.429727).

[0339] The 58th candidate deployment location is (70.539563, 11.264833).

[0340] The 59th candidate deployment position is (1.414142, 98.625359).

[0341] The 60th candidate deployment location is (59.726902, 19.527124).

[0342] The network deployment is as follows:

[0343] The second type of directional sensor is deployed at the fourth position, and its working direction is π.

[0344] The first type of directional sensor is deployed at the 8th position, and its working direction is 3π / 2.

[0345] The second type of directional sensor is deployed at the 11th position, and its working direction is 3π / 2.

[0346] The second type of directional sensor is deployed at the 13th position, and its working direction is π / 2.

[0347] The second type of directional sensor is deployed at the 19th position, and its working direction is 0.

[0348] The second type of directional sensor is deployed at the 20th position, and its working direction is 3π / 2.

[0349] The second type of directional sensor is deployed at the 22nd position, and its working direction is 3π / 2.

[0350] The second type of directional sensor is deployed at the 26th position, and its working direction is 3π / 2.

[0351] The first type of directional sensor is deployed at the 35th position, and its working direction is π / 2.

[0352] For an instance with 25 target points, the target point positions are as follows:

[0353] The position of the first target point is (24.555753, 109.236806).

[0354] The position of the second target point is (6.721928, 45.071694).

[0355] The position of the third target point is (30.582066, 34.743086).

[0356] The position of the fourth target point is (54.650636, 65.039691).

[0357] The position of the fifth target point is (48.751370, 81.121117).

[0358] The position of the sixth target point is (44.621515, 85.917580).

[0359] The position of the 7th target point is (108.078895, 85.236903).

[0360] The position of the 8th target point is (23.032409, 22.394597).

[0361] The position of the 9th target point is (7.767156, 1.498388).

[0362] The position of the 10th target point is (44.076860, 65.349959).

[0363] The position of the 11th target point is (60.371358, 23.346881).

[0364] The position of the 12th target point is (42.603922, 85.441338).

[0365] The position of the 13th target point is (107.457321, 48.177991).

[0366] The position of the 14th target point is (14.135747, 61.817402).

[0367] The position of the 15th target point is (28.365969, 16.719451).

[0368] The position of the 16th target point is (63.986080, 69.554503).

[0369] The position of the 17th target point is (101.493626, 6.752688).

[0370] The position of the 18th target point is (17.463970, 28.382287).

[0371] The position of the 19th target point is (75.624416, 54.081736).

[0372] The position of the 20th target point is (19.414538, 68.888334).

[0373] The position of the 21st target point is (92.378727, 5.868526).

[0374] The position of the 22nd target point is (110.597263, 108.418789).

[0375] The position of the 23rd target point is (18.369588, 76.189806).

[0376] The position of the 24th target point is (109.652598, 55.303237).

[0377] The position of the 25th target point is (38.659687, 85.658407).

[0378] The candidate deployment locations are as follows:

[0379] The first candidate deployment location is (107.306973, 104.179812).

[0380] The second candidate deployment location is (60.385830, 4.995683).

[0381] The third candidate deployment location is (98.661588, 19.901545).

[0382] The fourth candidate deployment location is (39.759353, 11.221304).

[0383] The fifth candidate deployment location is (111.445250, 56.139870).

[0384] The sixth candidate deployment location is (76.942439, 51.597550).

[0385] The seventh candidate deployment location is (53.425977, 43.535645).

[0386] The eighth candidate deployment location is (87.373628, 44.488650).

[0387] The ninth candidate deployment location is (45.234871, 94.318372).

[0388] The 10th candidate deployment location is (54.750105, 11.792320).

[0389] The 11th candidate deployment location is (106.897667, 102.791671).

[0390] The 12th candidate deployment location is (58.451599, 93.845789).

[0391] The 13th candidate deployment location is (21.828066, 73.329306).

[0392] The 14th candidate deployment location is (77.702207, 14.440683).

[0393] The 15th candidate deployment location is (92.791125, 76.330033).

[0394] The 16th candidate deployment location is (35.886425, 38.485143).

[0395] The 17th candidate deployment location is (27.480891, 38.212753).

[0396] The 18th candidate deployment location is (74.178635, 56.080412).

[0397] The 19th candidate deployment location is (88.501159, 91.509908).

[0398] The 20th candidate deployment location is (29.455749, 107.951200).

[0399] The 21st candidate deployment location is (114.622135, 78.498314).

[0400] The 22nd candidate deployment position is (3.303761, 42.423754).

[0401] The 23rd candidate deployment location is (32.099249, 92.565956).

[0402] The 24th candidate deployment location is (88.444906, 48.117384).

[0403] The 25th candidate deployment location is (92.754713, 50.583692).

[0404] The 26th candidate deployment location is (81.077214, 75.166192).

[0405] The 27th candidate deployment location is (80.971909, 28.484991).

[0406] The 28th candidate deployment location is (64.136621, 12.712055).

[0407] The 29th candidate deployment location is (66.088704, 99.688263).

[0408] The 30th candidate deployment location is (76.342647, 82.099984).

[0409] The 31st candidate deployment location is (14.189050, 90.287443).

[0410] The 32nd candidate deployment location is (62.272842, 47.176305).

[0411] The 33rd candidate deployment location is (39.319671, 46.026980).

[0412] The 34th candidate deployment location is (88.885316, 91.378550).

[0413] The 35th candidate deployment location is (90.335154, 66.116194).

[0414] The 36th candidate deployment position is (102.751010, 3.220750).

[0415] The 37th candidate deployment location is (24.650226, 85.453284).

[0416] The 38th candidate deployment location is (90.625802, 53.901633).

[0417] The 39th candidate deployment location is (81.101033, 82.098773).

[0418] The 40th candidate deployment location is (68.574024, 116.236811).

[0419] The 41st candidate deployment location is (70.542540, 31.442216).

[0420] The 42nd candidate deployment position is (4.263467, 101.537223).

[0421] The 43rd candidate deployment location is (56.034601, 31.626711).

[0422] The 44th candidate deployment location is (45.154605, 29.428665).

[0423] The 45th candidate deployment location is (86.294786, 48.818189).

[0424] The 46th candidate deployment location is (71.425053, 119.476686).

[0425] The 47th candidate deployment location is (7.530062, 108.095146).

[0426] The 48th candidate deployment location is (98.688892, 71.410464).

[0427] The 49th candidate deployment location is (72.494319, 76.395086).

[0428] The 50th candidate deployment location is (115.365723, 16.452592).

[0429] The 51st candidate deployment location is (85.638470, 20.392008).

[0430] The 52nd candidate deployment location is (12.021631, 104.048260).

[0431] The 53rd candidate deployment location is (31.443028, 108.656767).

[0432] The 54th candidate deployment location is (50.460239, 30.385352).

[0433] The 55th candidate deployment location is (63.661976, 63.663444).

[0434] The 56th candidate deployment location is (100.556992, 51.697391).

[0435] The 57th candidate deployment location is (22.779933, 21.208815).

[0436] The 58th candidate deployment location is (66.687593, 114.897513).

[0437] The 59th candidate deployment location is (105.739067, 34.541533).

[0438] The 60th candidate deployment location is (92.071902, 37.904409).

[0439] The network deployment is as follows:

[0440] The second type of directional sensor is deployed at the third position, and its working direction is π / 2.

[0441] The second type of directional sensor is deployed at the fourth position, and its working direction is π.

[0442] The second type of directional sensor is deployed at the fifth position, and its working direction is π.

[0443] The second type of directional sensor is deployed at the 7th position, and its working direction is π / 2.

[0444] The second type of directional sensor is deployed at the 12th position, and its working direction is π.

[0445] The second type of directional sensor is deployed at the 17th position, and its working direction is π / 2.

[0446] The second type of directional sensor is deployed at the 18th position, and its working direction is 3π / 2.

[0447] The first type of directional sensor is deployed at the 34th position, and its working direction is 0.

[0448] The first type of directional sensor is deployed at the 57th position, and its working direction is π / 2.

[0449] The second type of directional sensor is deployed at the 60th position, and its working direction is 3π / 2.

[0450] For an example with 30 target points, the target points are positioned as follows:

[0451] The position of the first target point is (18.376904, 9.897743).

[0452] The position of the second target point is (103.190079, 75.954703).

[0453] The position of the third target point is (64.588081, 60.198634).

[0454] The position of the fourth target point is (116.855904, 45.049117).

[0455] The location of the fifth target point is (117.196528, 24.756293).

[0456] The location of the sixth target point is (62.151285, 42.804387).

[0457] The position of the 7th target point is (110.964033, 101.846702).

[0458] The position of the 8th target point is (96.577165, 22.497259).

[0459] The position of the 9th target point is (1.281868, 74.076790).

[0460] The position of the 10th target point is (27.193903, 83.647649).

[0461] The position of the 11th target point is (108.403576, 7.141976).

[0462] The position of the 12th target point is (37.158307, 13.837463).

[0463] The position of the 13th target point is (15.314776, 109.702648).

[0464] The position of the 14th target point is (49.397980, 103.692912).

[0465] The position of the 15th target point is (80.836456, 62.716096).

[0466] The position of the 16th target point is (112.950152, 93.056813).

[0467] The position of the 17th target point is (98.432433, 84.512712).

[0468] The position of the 18th target point is (112.759649, 35.138137).

[0469] The position of the 19th target point is (52.938903, 85.083846).

[0470] The position of the 20th target point is (27.721716, 11.314251).

[0471] The position of the 21st target point is (105.387162, 46.546644).

[0472] The location of the 22nd target point is (76.896503, 118.163297).

[0473] The position of the 23rd target point is (10.823036, 107.571521).

[0474] The position of the 24th target point is (93.153922, 14.693352).

[0475] The position of the 25th target point is (58.673518, 51.521925).

[0476] The position of the 26th target point is (78.808162, 36.088429).

[0477] The position of the 27th target point is (108.458938, 98.666228).

[0478] The position of the 28th target point is (36.562475, 73.746020).

[0479] The position of the 29th target point is (6.564621, 103.509134).

[0480] The position of the 30th target point is (101.258178, 82.824231).

[0481] The candidate deployment locations are as follows:

[0482] The first candidate deployment location is (51.006889, 4.411468).

[0483] The second candidate deployment location is (23.267179, 54.841236).

[0484] The third candidate deployment location is (21.266499, 94.121057).

[0485] The fourth candidate deployment location is (92.851978, 91.230751).

[0486] The fifth candidate deployment location is (2.863929, 58.177009).

[0487] The sixth candidate deployment location is (97.739885, 82.932582).

[0488] The seventh candidate deployment location is (49.257396, 26.632497).

[0489] The eighth candidate deployment location is (110.891872, 62.289832).

[0490] The ninth candidate deployment location is (92.336959, 101.046056).

[0491] The 10th candidate deployment location is (40.218060, 92.601407).

[0492] The 11th candidate deployment location is (104.577835, 106.379230).

[0493] The 12th candidate deployment location is (112.089388, 28.019836).

[0494] The 13th candidate deployment location is (15.021103, 103.410563).

[0495] The 14th candidate deployment location is (63.759445, 94.372801).

[0496] The 15th candidate deployment location is (67.794746, 54.134252).

[0497] The 16th candidate deployment location is (49.847015, 20.463564).

[0498] The 17th candidate deployment location is (81.065743, 4.944697).

[0499] The 18th candidate deployment position is (99.463962, 0.374649).

[0500] The 19th candidate deployment location is (113.329455, 63.671211).

[0501] The 20th candidate deployment location is (33.307313, 110.224532).

[0502] The 21st candidate deployment location is (115.991071, 37.491989).

[0503] The 22nd candidate deployment location is (20.718538, 54.436445).

[0504] The 23rd candidate deployment location is (107.378978, 28.489737).

[0505] The 24th candidate deployment location is (69.296796, 7.509632).

[0506] The 25th candidate deployment location is (19.431040, 69.228842).

[0507] The 26th candidate deployment location is (110.092367, 44.568265).

[0508] The 27th candidate deployment location is (77.662744, 62.441732).

[0509] The 28th candidate deployment location is (23.231664, 72.497521).

[0510] The 29th candidate deployment location is (91.025077, 43.442299).

[0511] The 30th candidate deployment location is (50.912977, 35.469791).

[0512] The 31st candidate deployment location is (103.152309, 42.893655).

[0513] The 32nd candidate deployment location is (27.083829, 56.519134).

[0514] The 33rd candidate deployment location is (85.360626, 14.878572).

[0515] The 34th candidate deployment location is (11.509461, 107.530922).

[0516] The 35th candidate deployment position is (34.307122, 4.772440).

[0517] The 36th candidate deployment location is (68.576192, 45.799625).

[0518] The 37th candidate deployment location is (70.420322, 25.408026).

[0519] The 38th candidate deployment location is (118.669378, 88.972395).

[0520] The 39th candidate deployment location is (29.599275, 18.583301).

[0521] The 40th candidate deployment location is (79.797088, 25.968383).

[0522] The 41st candidate deployment location is (86.204375, 18.392949).

[0523] The 42nd candidate deployment location is (65.384522, 11.374814).

[0524] The 43rd candidate deployment location is (28.903931, 96.377989).

[0525] The 44th candidate deployment location is (90.663975, 0.043897).

[0526] The 45th candidate deployment location is (64.255549, 85.916684).

[0527] The 46th candidate deployment location is (102.504542, 62.873298).

[0528] The 47th candidate deployment position is (36.050057, 0.573363).

[0529] The 48th candidate deployment location is (27.140317, 113.352606).

[0530] The 49th candidate deployment location is (15.014780, 23.579820).

[0531] The 50th candidate deployment location is (17.925154, 48.675534).

[0532] The 51st candidate deployment location is (11.507777, 95.498319).

[0533] The 52nd candidate deployment position is (46.571002, 2.470885).

[0534] The 53rd candidate deployment location is (85.902546, 48.756826).

[0535] The 54th candidate deployment location is (100.328734, 25.003719).

[0536] The 55th candidate deployment location is (58.157293, 3.392582).

[0537] The 56th candidate deployment location is (102.104513, 55.749718).

[0538] The 57th candidate deployment location is (36.103157, 5.937940).

[0539] The 58th candidate deployment location is (119.421532, 49.388349).

[0540] The 59th candidate deployment location is (97.041678, 76.017876).

[0541] The 60th candidate deployment location is (119.367721, 11.352891).

[0542] The network deployment is as follows:

[0543] The second type of directional sensor is deployed at the third position, and its working direction is 0.

[0544] The second type of directional sensor is deployed at the 8th position, and its working direction is π / 2.

[0545] The second type of directional sensor is deployed at the 16th position, and its working direction is π.

[0546] The second type of directional sensor is deployed at the 19th position, and its working direction is 3π / 2.

[0547] The second type of directional sensor is deployed at the 20th position, and its working direction is π.

[0548] The first type of directional sensor is deployed at the 22nd position, and its working direction is π / 2.

[0549] The second type of directional sensor is deployed at the 24th position, and its working direction is 0.

[0550] The second type of directional sensor is deployed at the 26th position, and its working direction is π.

[0551] The second type of directional sensor is deployed at the 37th position, and its working direction is π / 2.

[0552] The second type of directional sensor is deployed at the 45th position, and its working direction is π / 2.

[0553] The experimental results are as follows Figure 3 From the experimental results, it can be seen that the network deployment cost obtained by the method of the present invention is lower than that obtained by the VLGA algorithm.

[0554] Finally, it should be pointed out that the specific methods of the above embodiments can form a computer program product. Therefore, the computer program product implemented in this application can be stored on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.).

Claims

1. A method for deploying a heterogeneous directional sensor network, characterized in that: The following steps are involved: In the initialization phase, each element of each individual in the population is randomly initialized. The length of the individual code is the number of target points. Each element corresponds to each target point one by one. Each element indicates which deployment position of the directional sensor covers the corresponding target point. The fitness of each individual and the corresponding network deployment are calculated. The fitness is ,in ndc represents the network deployment cost, w represents the weighting coefficient, tpc represents the total number of target points, nct represents the number of target points that can be covered, the network deployment includes the location, type and working direction of all deployed directional sensors, and the network deployment cost is the total price of all deployed directional sensors; In the population evolution stage, for each individual, in each iteration, the mutant individual and the crossover individual are calculated, the fitness of the crossover individual and the corresponding network deployment are calculated, and when the fitness of the crossover individual is less than that of the current individual, the current individual is replaced by the crossover individual. The mutant individual is obtained by weighted summation of the other three individuals except the current individual, and the crossover individual is obtained by replacing the elements of the current individual with the elements of the mutant individual. In the output phase, after the population evolution iteration is completed, the network deployment corresponding to the individual with the smallest fitness is used as the final network deployment. Calculating the fitness of the individual and the corresponding network deployment is an iterative process until the network deployment cannot be optimized. Each iteration of network deployment calculation includes: Calculate each deployment position based on individual values i Covered target point set T i ; Calculate each deployment location i type and direction of operation to enable coverage T i There are the most target points and the price is the smallest if T i If empty, then at position i No sensors deployed; For each target point, traverse each deployed sensor in turn to find a sensor that can cover the target point and has the lowest price. If one can be found, modify the value of the dimension corresponding to the target point in the individual to be the index of the deployment location of the sensor in the set of deployment locations that can cover the target point.

2. A method for deploying a heterogeneous directional sensor network according to claim 1, characterized in that: Specifically, the mutant individual calculation is to randomly select three different individuals in the population, each of which is different from the current individual, weight the difference between two of the individuals with an amplification factor, and then sum the difference with the third individual to obtain a mutant individual.

3. The method for deploying a heterogeneous directional sensor network according to claim 1, wherein: The calculation of the crossover individual is specifically as follows: the crossover individual is initialized according to the current individual, and a dimension of the crossover individual is randomly selected. j , modify its value to the dimension of the mutant individual j For each other dimension of the cross individual k , and modify its value to the dimension of the mutant individual with the set crossover probability k The value of .

4. A heterogeneous directional sensor network deployment system, characterized in that: include: The initialization module is used to randomly initialize each element of each individual in the population. The length of the individual code is the number of target points. Each element corresponds to each target point one by one. Each element indicates which deployment position of the directional sensor covers the corresponding target point. The fitness of each individual and the corresponding network deployment are calculated. The fitness is ,in ndc represents the network deployment cost, w represents the weighting coefficient, tpc represents the total number of target points, nct represents the number of target points that can be covered, the network deployment includes the location, type and working direction of all deployed directional sensors, and the network deployment cost is the total price of all deployed directional sensors; The population evolution module is used to calculate the mutant individual and crossover individual for each individual in each iteration, calculate the fitness of the crossover individual and the corresponding network deployment, and replace the current individual with the crossover individual when the fitness of the crossover individual is less than that of the current individual. The mutant individual is obtained by weighted summation of the other three individuals except the current individual, and the crossover individual is obtained by replacing the elements of the current individual with the elements of the mutant individual; The fitness and network deployment calculation module is used to iteratively calculate the network deployment until the network deployment cannot be optimized. Each iteration of the network deployment calculation includes: Calculate each deployment position based on individual values i Covered target point set T i ; Calculate each deployment location i type and direction of operation to enable coverage T i There are the most target points and the price is the smallest if T i If empty, then at position i No sensors deployed; For each target point, traverse each deployed sensor in turn to find a sensor that can cover the target point and has the lowest price. If one can be found, modify the value of the dimension corresponding to the target point in the individual to be the index of the deployment location of the sensor in the set of deployment locations that can cover the target point. The output module is used to take the network deployment corresponding to the individual with the smallest fitness as the final network deployment after the population evolution iteration is completed.

5. A heterogeneous directional sensor network deployment system according to claim 4, characterized in that: The population evolution module includes a variant individual calculation module, which is used to randomly select three different individuals in the population, each of which is different from the current individual, and weight the difference between two of the individuals with an amplification factor and sum it with the third individual to obtain a variant individual.

6. A heterogeneous directional sensor network deployment system according to claim 4, characterized in that: The population evolution module includes a crossover individual calculation module, which is used to initialize the crossover individual according to the current individual, randomly select a dimension of the crossover individual, j , modify its value to the dimension of the mutant individual j For each other dimension of the cross individual k , and modify its value to the dimension of the mutant individual with the set crossover probability k The value of .

7. A computer storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for deploying a heterogeneous directional sensor network according to any one of claims 1 to 3 is implemented.

8. A computer program, characterized in that When the computer program is executed by a processor, the method for deploying a heterogeneous directional sensor network according to any one of claims 1 to 3 is implemented.

Citation Information

Patent Citations

  • Multi-index network application system deployment method and system based on genetic algorithm and subjective logic

    CN113220310A

  • Hyperspectral image classification method, system and device based on proxy-assisted evolution convolutional attention network architecture search, and medium

    CN118314386A