Title: Delay-bounded Data Aggregation in Wireless Sensor Networks.

Abstract
Data aggregation is a very important task in sensor networks. In order to save energy and satisfy delay requirement, we need to design good protocols to collect data into the actor(sink). In my presentation, I will introduce a delay-bounded and energy-efficient scheme which is based on localized minimal spanning tree(LMST). It constructs a data aggregation tree using edges in LMST if delay is acceptable. Otherwise it will use other edges in original networks instead based on DHP value. This scheme is further extended with area coverage protocol and connected dominating set(CDS). Finally, I will compare the performance of all these algorithms with Multiple States algorithm which is the only comparable delay-bounded algorithm. You will see that the average energy consumed and network life time are largely improved.