Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
International Journal of Sensor Networks
Systematic selection of cluster heads for data collection
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Data aggregation has been proposed as one method for reducing energy consumption in sensor networks. One critical factor in data aggregation is routing. In this paper, we generalize the present routing schemes and find that they are all static and thus cannot change when data packets flowing to sink. To make data aggregation more efficient, we design data aggregation protocol based on dynamic routing (DABDR). The dynamic routing in DABDR is based on two potential field: Depth potential field is to make packets flowing to sink and DA queue length potential field is to make packets more concentrated in spate and thus data aggregation will be more efficient. Simulations in network show that DABDR is 10 times better than protocol without data aggregation and 2 times better than data aggregation protocols based on shortest past tree in terms of energy consumption.