Research On Coverage And Optimization Of Short-Range Wireless Communication Network

Short-distance wireless communication networks have the advantages of mobile connection,high-speed communication,and low cost,and have huge development potential in the Internet of Things,big data,artificial intelligence and other fields.However,because the network presents the characteristics of random mobility of nodes,instability of the communication environment,and high energy consumption in the area when the infrastructure is deployed,it will lead to problems such as insufficient coverage,redundant node deployment,and local area holes.How to achieve this efficient coverage and rapid optimization of network nodes are problems and challenges to be solved urgently in short-range wireless communication technology.Therefore,this dissertation analyzes the characteristics of short-range wireless communication networks,and proposes methods for node coverage and optimization of short-range wireless communication networks in view of the deficiencies of existing methods.The main research work includes the following three aspects:(1)The regular diamond coverage method is used to solve the problem of inefficient coverage of nodes in the coverage area.Design coverage density and coverage efficiency two indicators to describe the network coverage performance,combined with the node perception probability to establish a network node coverage model;based on coverage intersection rate and polygon coverage theory,select a regular diamond coverage method.The experiment compared the coverage density,coverage efficiency and the number of communication nodes of the four deployment methods:triangular coverage,square coverage,isosceles trapezoidal coverage and regular diamond coverage.The results show that the coverage density of the regular diamond coverage method is less,the coverage efficiency is higher,and the number of communication nodes required is less when covering the same area.(2)To solve the problem of optimal choice of node density and coverage efficiency in the redundancy problem of node layout,a network coverage optimization method based on an improved Antlion optimization algorithm is proposed.The chaotic perturbation operator is introduced into the antlion optimization algorithm,and the antlion position information is updated through the chaotic map to avoid the algorithm from falling into the local optimum;the algorithm is applied to the objective function based on node density and coverage efficiency to achieve rapid solution,and obtain the communication node The best deployment location.The areas to be covered with different benchmark functions and different sensor communication node scales were simulated and verified.The results show that the coverage optimization method based on the improved Antlion algorithm calculates a higher average coverage rate,a more even distribution of communication nodes,and fewer blind spots in network coverage,and it has better coverage optimization performance for short-range wireless communication networks.(3)To make up for the local area void,a triangular inner vertex method void detection is proposed.On the basis of the triangle hole detection algorithm,the RSSI parameter is introduced to judge the perception distance of the node,and the influence of the signal quality is also integrated when the distance is considered for the coverage effect.For the different types of holes detected,corresponding repair strategies were formulated,and the positions of newly added nodes were set.The results of experiment and comparative analysis show that:Compared with the traditional triangle inner optimization algorithm,the method based on the RSSI triangle inner vertex angle has a more accurate hole detection effect while ensuring the detection accuracy.Achieved a more uniform coverage optimization effect and a higher coverage rate.