Research And Implement On Routing Algorithm In Wireless Sensor Networks

With the development of MEMS technique, and the beginning of Post-PC age, many new techniques came out from behind the scenes, including wireless sensor networks, which is a new part of computer science and technique, and a fruit combing sensor technique, embedded computing technique, distributing information processing technique and wireless communication technique, having a bright future of theoretical studies and application.This article searches and discovers the course of the form of wireless sensor net and route.Inspired by city public transit system, this article puts forwards a wireless sensor algorithm based on virtual sink node. It catalogues the digital transit in net into two parts, which are the course that member node explores backbone and the course that data fast transits in backbone. The scientific choice of city public transit line is beneficial to traffic conduction. As a project of line model in wireless sensor networks model, the choice of backbone is meaningful. The algorithm lists and analyzes three possible backbone forms, which are similar Descartes coordinate model, tree model and doughnut model. This article also analyzes three models by mathematical model and computer simulation.On the base of the analysis above, this article applies virtual node theory into member node to simplify topology, and concludes that complete subgraph has a large quantity by the character of that link circuit redundancy in net is large, and poses that put complete subgraph and Hamilton graph into one point by graph theory, matrix analysis and permutations and combinations knowledge.In order to lead out the emphasis, this article categorizes and explains routing agreement before algorithm, and gets a clear clue of routing development, and deeply analyzes and realizes node measuring technique to provide parameter preparation for algorithm.