Optimization of Sensor Network Layout Based on I-Greedy Solution CVaR Model
In order to solve the problem that traditional stochastic optimization method is not suitable for some complex field sen-sor network layout,an I-Greedysolution CVaR model is proposed.The method of lazy assignment is used to complete the simplifi-cation of the algorithm,and the corresponding search interval Δ and search interval(0,Γ)are set for τ to prevent the occurrence of local optimal solution in the algorithm.You can realize the function of fast search by means of lazy assignment.The results show that when Γ of τ search upper bound is set to 50 and confidence level α =0.9,the global optimal solution can be obtained by searching each confidence level.After increasing the number of sensor nodes gradually,the layout benefit is improved continuous-ly.The calculated mutual information increased by 69% compared with the random deployment method and 14.1% compared with the traditional greedy algorithm.Compared with the traditional layout model,CVaR layout model can achieve a lower loss degree,obtain better layout results,and improve the robustness of the model.The algorithm can significantly reduce the time com-plexity,especially for large-scale sensor layout.
Sensor NetworkLayout OptimizationGreedy AlgorithmLayout Loss
NETL
NSTL
万方数据
维普
