Research On Reliable And Energy Efficient Routing Algorithm For Wireless Sensor Networks

Energy efficiency and event detection reliability are crucial performance indexes for wireless sensor networks(WSNs).Related researches show that event detection reliability is positively related to the numbers of active reporting notes(ARNs).However,large numbers of ARNs consume substantial amounts of energy,which decreases network lifetime.At present,the routing algorithms that provide not only high detection reliability but also high energy efficiency are few.In order to improve detection reliability and energy efficiency,this thesis proposes an Energy-Balanced Reliability and Multipath Aggregation Routing(EBRMAR)algorithm for non-uniformly distributed large scale WSNs on the basis of the existing energy efficient routing algorithms and detection reliability technologys.The main work of this thesis is as follows:Firstly,this thesis analyzes the characteristics of data transmission in WSN and designs energy consumption rate estimation model of multi-hop convergence network.According to the energy consumption rate,the algorithm assigns the number of ARNs rationally in different areas of the network,makes full use of energy of slow energy consumption area and reduces energy consumption of fast energy consumption area,thus improving the event detection reliability while balancing the network energy consumption and prolonging the network lifetime.Secondly,this thesis designs the ARNs selection algorithm based on the dynamic correlation radius.According to the location relationship and residual energy of the nodes in the event area,the corresponding number of ARNs is selected by adjusting the length of the correlation radius,so that the ARNs can not only meet the requirements of the quantity allocation but also have a reasonable position distribution and more residual energy,thus improving the event detection reliability and balance energy consumption.Thirdly,this thesis designs optimal path search algorithm based on forwarding candidate set(FCS)with residual energy of nodes,energy consumption of paths and hops of paths as the performance indexes,and uses the algorithm to plan the energy balanced multipath convergence routing,including an optimal main path of data collection and the optimal convergence paths of each ARNs,all convergence paths encounter on the aggregation node of the main path.The monitoring data is sent to aggregation node by the optimal convergence paths and aggregated,then is sent to Sink by the optimal main path,thus reducing the energy consumption of the hotspots and prolonging the network lifetime.Finally,this thesis tests the performance of EBRMAR algorithm,SCMR algorithm and RMER algorithm in the same network model and simulation environment.The simulation results show that,compared with the SCMR algorithm and the RMER algorithm,the average detection distortion of EBRMAR algorithm is decreased by 23% and 6.38% respectively,the network lifetime is increased by 4.42 times and 91% respectively,and the average energy utilization of nodes is increased by 7.54 times and 1.11 times respectively.In addition,the energy consumption of EBRMAR algorithm is more balanced.