Research On WSN Node Deployment In Landslide Monitoring System Along High-speed Railway

In recent years,China's high-speed rail has made remarkable achievements.The "four horizontal and four vertical" high-speed rail network has improved travel efficiency and developed the economy along the line.At the same time,environmental safety along the high-speed rail has become a new problem.Most of the high-speed railways in China are built in mountainous areas,so the monitoring of landslides along the high-speed railways is very important.Compared with traditional sensor networks,wireless sensor networks(WSNs)have more advantages,so they are more suitable for landslide monitoring along high-speed railway.Node deployment is one of the most critical issues in WSNs.It is necessary to determine the appropriate node location,improve the coverage time of sensor nodes,enhance network connection,improve data accuracy and increase network lifetime.At the same time,the deployment strategy must be carefully planned in order to monitor a certain area comprehensively and effectively.Therefore,the design and research of node deployment are of great significance.Because Shanxi has many mountains and large landslide area,this paper chooses Xinzhou section of Datong-Xi'an high-speed railway to carry out relevant research.Aiming at landslide monitoring along Daxi High-speed Railway,the deployment strategy of regional coverage nodes is studied.The deployment strategies of triangle,square and hexagon nodes are mainly studied.The coverage and number of deployed nodes of three deployment strategies are calculated and compared.Through experiments,three deployment strategies are compared,and the coverage and the number of sensors are evaluated.Aiming at landslide monitoring along Daxi High-speed Railway,the Po Is coverage node deployment algorithm is studied.Three kinds of node deployment algorithms based on ant colony algorithm(ACO),namely Easi Design,ACO-TCAT and ACO-Greddy,are studied in this paper.TheEasi Design algorithm consists of two steps: probability selection and pheromone updating.ACO-TCAT algorithm is mainly composed of three ant transfer types.ACO-Greddy algorithm consists of four steps: target selection,pheromone constraints,non-uniform sensing/communication radius design and greedy migration.Finally,a simulation experiment is done to evaluate the deployment cost,network delay and network lifetime.A new node deployment algorithm,HS-ACO-Greddy(Harmony Search-Greedy Ant Colony Algorithm),is proposed for Po Is overlay node deployment algorithm.The algorithm consists of Harmony Search(HS)and Greedy Ant Colony algorithm(ACO-Greddy).The main idea of HS-ACO-Greddy algorithm is to use the harmony search algorithm(HS)to re-optimize the solution of ACO-Greddy algorithm to further improve network performance.Finally,a large number of simulation experiments prove the effectiveness and superiority of HS-ACO-Greddy algorithm.