Data Aggregation Scheduling with Guaranteed Lifetime and Efficient Latency in Wireless Sensor Networks

摘要

In scenarios of real-time data collection of long-term deployed Wireless Sensor Networks (WSNs),low-latency data collection with long network lifetime becomes a key issue.In this paper,we present a data aggregation scheduling with guaranteed lifetime and efficient latency in WSNs.We first construct a Guaranteed Lifetime Minimum Radius Data Aggregation Tree (GLMRDAT) which is conducive to reduce scheduling latency while providing a guaranteed network lifetime,and then design a Greedy Scheduling algorithM (GSM) based on finding the maximum independent set in conflict graph to schedule the transmission of nodes in the aggregation tree.Finally,simulations show that our proposed approach not only outperforms the state-of-the-art solutions in terms of schedule latency,but also provides longer and guaranteed network lifetime.