Wireless Personal Communications: An International Journal
Reducing data aggregation latency by using partially overlapped channels in sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Structure-free real-time data aggregation in wireless sensor networks
Computer Communications
An optimized in-network aggregation scheme for data collection in periodic sensor networks
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Robust and dynamic data aggregation in wireless sensor networks: A cross-layer approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreover, structured approaches are sensitive to the waiting-time which is used by nodes to wait for packets from their children before forwarding the packet to the sink. Although structure-less approaches can address these issues, the performance does not scale well with the network size. We propose ToD, a semi-structured approach that uses Dynamic Forwarding on an implicitly constructed structure composed of multiple shortest path trees to support network scalability. The key principle behind ToD is that adjacent nodes in a graph will have low stretch in one of these trees in ToD, thus resulting in early aggregation of packets. Based on simulations on a $2000$ nodes network and real experiments on a $105$ nodes Mica2-based network, we conclude that efficient aggregation in large scale networks can be achieved by our semi-structured approach.