Design And Implementation Of Route Build And Repair Algorithm For WSN

As the continuously improvement of wireless communication and electronic technology, wireless sensor networks made of low-cost and multifunctional micro-sensors walk into growing concern. It can monitor, apperceive and gather information of various individuals in monitoring field, by the collaboration of sensors. Then process the gathering data and transmit it to data collector. So, wireless sensor network have broad foreground, such as military affairs application, environment monitoring, smart home system and so on. In the report about future technology forecast of American Business Week and MIT technology comment, wireless sensor network is rank in the most influential twenty-one technology of 21 century and one of ten technologies which change the world.Design of wireless sensor network routing protocol is mainly discussed in this paper. With the characteristics of hugeness nodes, limited individual node's resources, data centric and route based on local information in wireless sensor network, the routing protocol of it must be energy efficiency, good robustness and rapid astringency. Aimed at the characteristic of wireless sensor network routing design, a new route build algorithm based on ant algorithm which is a famous heuristic algorithm, in addition, a new route repair algorithm is also proposed based on old route path information. The proposed route build algorithm combines the characteristic of "ant agent" work in collaboration based on local information, and adds energy and deflection angle parameter to increase the astringency of algorithm, use roulette strategy to choose the next node ant will go. Through ant circle time after time, an optimal path from source node to sink node is chose. By the experiments and simulation analysis and set different parameters, we prove the algorithm can build route rapidly and efficiently at last. The proposed route repair algorithm SSRUA is induced based on AODV, QL and ERUP. It use the existed information in network, such as sink node sequence numbers produced in the process of use AODV build route, routing information on old route path and so on, to maintain and repair route. So this algorithm can decrease the query data packets transmitted in the process of route repair when node failure, in order to reduce the whole network energy cost.