A scalable and dynamic data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
A new solution for the time-space localization problem in wireless sensor network using UAV
Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
| Hi-index | 0.00 |
In wireless sensor networks, data aggregation is critical to network lifetime. It implies that data will be aggregated while flowing from multiple sources to a specific node named sink. The construction of routing trees aware of the data aggregation has a considerable cost and solutions in the literature are not efficient for scenarios where the events are of short duration. This paper presents the Dynamic Data-Aggregation Aware Routing Protocol (DDAARP) for wireless sensor networks. This novel protocol builds dynamic routes, which improve the cost and quality of final routing tree. It also reduces the number of messages necessary to set up a routing tree, maximize the number of overlapping routes, selects routes with the highest aggregation rate, and performs reliable data aggregation transmission. DDAARP was compared with two existing solutions reported in the literature regarding communication costs, delivery efficiency and tree quality created. routing tree built by DDAARP has the best quality of aggregation compared with other algorithms. Results show that DDAARP outperforms these solutions for different scenarios in all evaluations performed. Furthermore, it also shows that the proposed algorithm is a good solution for scenarios with short-term events and for events of long duration.