Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
IEEE Communications Magazine
Hi-index | 0.00 |
Wireless sensor networks (WSNs) have cost-effective, easy deployment, and ad-hoc function. Sensor nodes have the characteristics of low-power, small sensors with limited computation capabilities, and low-cost. In this paper, a dual-tree-based data aggregation (DTDA) scheme for grid-based WSNs is proposed. The proposed DTDA is based on dual-tree structure. The goal is to establish dual trees (a dual-tree) that have an approximate number of nodes for data aggregation. DTDA provides two paths between roots and sinks. It minimizes energy consumption and evenly distributes load to prolong network lifetime. Simulation results show that the proposed DTDA outperforms CODE and DARQ.