Data Aggregation Routing for Rechargeable Wireless Sensor Networks in Forest Monitoring

In rechargeable wireless sensor networks (r-WSNs), higher data transmitted efficiency is required because sensor have to operate in a very low duty cycle owing to sporadic availability of energy. In r-WSNs, Data collected by many sensors is based on common phenomena, and hence there is a high probability that this data has some redundancy. In this work, we address the problem of jointly optimizing data aggregation and routing so that the network workload can be maximized. Establish the relationship model between data aggregation rate and throughput, so that the balanced was set up between the data aggregation rate and maximum network data traffic. Through the use of optimal candidate sample allocation, the algorithm can coverage efficiently and can make the maximum data aggregation rate flow to the network while maximizing network workload. Simulations are carried out to show that the proposed algorithm can significantly improve workload.