Data Acquisition Algorithm Research In Wireless Sensor Networks Based On MIMO

Wireless sensor networks(WSN)is a multi-hop Ad hoc network deployed in a certain range of a large number of inexpensive,small power consumption and have a certain perception of the sensor nodes.It is considered as one of the Ten New Technology in 21 st century.In recent years,wireless sensor networks has been widely used in many fields,such as environmental prediction and protection,medical cares,military and intelligent home.Wireless sensor network node energy is generally provided by the battery,and the battery storage capacity is relatively small,and the place of WSN node deployment in general is not convenient to reach,making it difficult for the sensor node energy supplement or replace the battery.Therefore,how to solve the problem of energy consumption of WSN,prolong the survival time of the network become the focus of the study of wireless sensor networks.For these problems,researchers have proposed many solutions,including multiple-input multiple-output(MIMO)is one of them,which is the collaborative MIMO.Studies have shown that the MIMO is applied to the WSN can reduce network energy consumption and prolong the lifetime of the network.In this thesis,wireless sensor networks energy issues,in-depth study of the energy model of the network routing and clustering algorithms and clustering algorithms exist some problems routing proposes an improved approach.This thesis has done the following research:1.In this thesis,briefly introduces related basic theory of WSN and MIMO technology provides an overview and analysis of LEACH algorithm and TEEN algorithm.It aims at the weak points of TEEN algorithm,providing a best way combing cluster-head selection and the residual energy in network node to chose the cluster head node.In TEEN algorithm,the cluster head in the selected time has a certain randomness,the result is some of the energy is relatively low when node is selected as the cluster head node,since the cluster head node larger than the average energy consumption of this feature,causing the node to die prematurely.This thesis puts forward an improved TEEN clustering algorithm.2.In TEEN routing algorithms,the cluster head node and aggregation node communicate is a single-hop mode,when the communication distance become longer than usual single-hop mode cost more energy,for this situation,a multi-hop routing algorithm is proposed,this method can effectively balance the network load and reduce energy consumption.By making computer simulation with the help of MATLAB software,we could get the conclusion that compared with the original TEEN algorithm,the new algorithm overcome the random selection of cluster head nodes,the new algorithm is more balance,reduce the energy consumption and could realize a longer network life.In the last part,it proposes applying timer system into the periodicity data collection system can resolve the soft and hard threshold problem in the TEEN settings.