High-Efficiency Routing Data Collection of Dual Multicast Tree Based on the Projection Vector
Zejun Li · Chuangan jishu xuebao · 2013
The present node data gathering algorithm is complex,and its routing binding effect is not ideal,and it cannot meet the high energy node data collection of wireless sensor network,whereas compressed sensing theory has the merits of fault tolerance and simple coding.Based on compressed sensing and its merits,the method that high-efficiency routing data collection of dual multicast tree based on the projection vector in sensor networks is proposed.It combines Bayes compressed sensing theory with sensor route that the problem of existing algorithm is solved,that is,the sensor is sensitive to energy consumption.The basic idea of the algorithm is to firstly seek energy efficient and appropriate routing optimal projection according to the initial observation vector,and secondly use the node coefficient of minimum energy consumption and the principal component of generalized vector as the target node and the principle of maximum differential entropy change for node optimal projection coefficient,and lastly use reverse multicast routing structure in the problem of Sink and the target node routing.Theoretical and simulation results indicate that it has obtained better reconstruction effect of simulation under the condition of ensuring energy consumption,which has a certain practical value on wireless sensor communication.