Dissertation
Dissertation > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > General issues > Theories, methods > Algorithm Theory

Design and Implementation of Route Build and Repair Algorithm for WSN

Author ZhuHaiYan
Tutor LiuYuHua
School Central China Normal University
Course Computer Applications
Keywords WSN Route generation Ant Algorithm Route repair Old routing path sink node numbers
CLC TP301.6
Type Master's thesis
Year 2007
Downloads 115
Quotes 1
Download Dissertation

With the continuous progress of wireless communication and electronic technologies , low-power , multifunctional miniature sensor nodes WSN gaining attention . By sensor nodes collaborate with each other in real-time monitoring , perception , and collect information from a variety of monitoring objects , and processed and then transmitted to the data collectors . Therefore , WSN have broad application prospects , such as military applications , environmental monitoring , smart home , etc. . U.S. Business Week and the MIT Technology Review report predict future technology development , respectively, as the 21 most influential technology of the 21st century and change one of the world 's top ten technology . This paper discusses the design of the WSN routing protocol . Because of the large number of sensor network node , a single node with limited resources , data center, based on local information and features , which determines the WSN routing protocol must meet energy efficiency , robustness and fast convergence requirements . WSN routing protocol design characteristics , the introduction of the famous heuristic algorithm - ant algorithm sensor network routing generation algorithm , devised a novel route generation algorithm . In addition , based on the old route path information , is proposed based on the existing routing information to repair algorithm SSRUA . , The proposed route generation algorithm , fully integrated \The algorithm uses a roulette strategy to select the ants to reach next node , and select the optimal path of the path from the source node to the sink node by ants multiple cycles eventually . By experimental simulation analysis, and set different parameters , and finally proved that the algorithm can quickly and efficiently generate new routes . The proposed another route repair algorithm SSRUA is the foundation on in the of AODV, QL, ERUP agreement arising out of the algorithm is the effective use of the network have access to the information , such as the the AODV routing generation process sink node numbers , the old routing path on the routing information, etc., to perform the maintenance and repair of the route , in order to effectively reduce the node failures when routing the repair process the query packet transmitted , so as to achieve the purpose of reducing network energy consumption .

Related Dissertations
More Dissertations