Research On Localization Algorithm And Clustering Routing Algorithm In Wireless Sensor Networks

Wireless sensor networks (WSNs) are distributed self-organizing networks which areformed by a large number of sensor nodes of low power dissipation and low cost. Thesenodes can collect the information about the monitored area cooperatively, and send it tothe observer. WSNs have been widely used in building control, environment monitoring,military surveillance and other fields recently, the premise of all these applications is thelocation information of sensor nodes, which makes node localization studies to become animportant issue. Meanwhile, as sensor nodes are usually powered by energy limitedbatteries, so in order to prolong the network lifetime to design energy efficient routingprotocol is another key issue in the field of sensor network research.First, analyzing the DV-Hop localization algorithm which is widely used recently, inview of the insufficient in the hop estimation and position calculation, we proposedBFA-HC (Bacterial Foraging Algorithm and Hop Correction) localization algorithm. Thealgorithm corrects the number of hops between adjacent nodes according to the settedthreshold values of received signal strength indicator, then each anchor node calculates itsaverage hop distance based on the minimum mean square error criterion, and finally whenthe unknown node obtains Euclidean distance to three or more anchor nodes, it runsbacterial foraging algorithm to calculate its own position.Secondly, studies the classic clustering routing protocol LEACH, in view of itsdeficiencies in aspects of cluster heads selection and inter-cluster routing, proposes aclustering routing algorithm MHRBK (Multi-Hop Routing Based on K-means). Thealgorithm firstly divides the sensor network into a number of concentric rings of equalwidth, and then calculates the optimal number of cluster heads of each ring based on theideas of energy balance, in the process of inter-cluster multi-hop routing, according to thelink cost, remaining energy and load status dynamically selects the relay cluster head forrouting.Finally, we carry out simulation in MATLAB platform, to verify the effectiveness ofthe BFA-HC algorithm under the condition of different anchor node ratio, different communication radius and different number of nodes respectively. At the same time, toshow the superiority of MHRBK algorithm in the aspects of prolonging the networklifetime, reducing energy consumption of the network and balancing nodes energyconsumption.