Based On Gis Study Sensor Network Topology Control And The Research Of Routing Algorithm

The paper applies GIS spatial analysis function to the selectionprocess of aggregation nodes and feature nodes of wireless sensornetwork, applies the dynamic Geographic routing algorithm to theroute selection process of data transmission from ordinary wirelesssensor nodes to aggregation nodes, optimizes the data compressionprocess of PDT algorithm so as to reduce the amount of the transmitteddata from the aggregation nodes to the base station.Applying the GISspatial analysis function to wireless aggregation nodes selectionprocess, the GIS merit of positioning accuracy and map displayfunction is used, so that the aggregation node selection process is moreaccurate, fast and intuitive, the workload is reduced apparently.Applying sight analysis and buffer analysis of GIS to the emplacementprocess of wireless sensor network, the actual three-dimensional modeland real impact factor is uesd,so that the emplacement process ismore close to reality situation, the results of actual hardware verificationshows that the wireless sensor networks emplacement based on GIS ismore intuitive and with greater accuracy. Aiming at the situation of thewireless sensor network topology is changing frequently, the paperoptimizes the PDT algorithm, so that the PDT algorithm can update theMST tree with the procedure of the aggregation nodes topology ischanging continuously and keep the best routing selection. In view ofthe optimal routing problem under the spatial topology changingcontinuously, the paper proposes distributed dynamic Geographicrouting algorithm based on Bellman-Ford algorithm. Experiments andsimulations results show that the algorithm can quickly complete thecalculation of the dynamic optimal path, And when dealing withcomplex transportation network and unexpected network congestion,distributed dynamic Geographic routing algorithm has excellent performan-ce. Experimental results show that in the calculation of the optimalpath of a complex network which contains a large number of nodes,distributed dynamic Geographic routing algorithm can save thepercentage of calculation time approximately by50%to70%comparing with the traditional calculation only in one computer, andeven the more nodes existing in the transportation network,the greaterpercentage of time will be saved; In dealing with the unexpectednetwork jam situation, distributed dynamic Geographic routingalgorithm can save travel weight percentage by45%to50%comparingwith the traditional static Shortest Path algorithm.