Performance of data aggregation for wireless sensor networks
This thesis focuses on three fundamental issues that concern data aggregation protocols for periodic data collection in sensor networks: which sensor nodes should report their data, when should they report it, and should they use unicast or broadcast based protocols for this purpose. The issue of when nodes should report their data is considered in the context of real-time monitoring applications. The first part of this thesis shows that asynchronous aggregation, in which the time of each node’s transmission is determined adaptively based on its local history of past packet receptions from its children, outperforms synchronous aggregation by providing lower delay for a given end-to-end loss rate. Second, new broadcast-based aggregation protocols that minimize the number of packet transmissions, relying on multipath delivery rather than automatic repeat request for reliability, are designed and evaluated. The performance of broadcast-based aggregation is compared to that of unicast-based aggregation, in the context of both real-time and delay-tolerant data collection. Finally, this thesis investigates the potential benefits of dynamically, rather than semi-statically, determining the set of nodes reporting their data, in the context of applications in which coverage of some monitored region is to be maintained. Unicast and broadcast-based coverage-preserving data aggregation protocols are designed and evaluated. The performance of the proposed protocols is compared to that of data collection protocols relying on node scheduling.
wireless sensor networks, data aggregation, performance evaluation
Doctor of Philosophy (Ph.D.)