Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ACM SIGPLAN Notices
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
On Demand Role Assignment for Event-Detection in Sensor Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Information fusion for wireless sensor networks: Methods, models, and classifications
ACM Computing Surveys (CSUR)
Optimal route selection for highly dynamic wireless sensor and actor networks environment
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Error estimation in wireless sensor networks
Proceedings of the 2008 ACM symposium on Applied computing
The design space of wireless sensor networks
IEEE Wireless Communications
Node clustering in wireless sensor networks: recent developments and deployment challenges
IEEE Network: The Magazine of Global Internetworking
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
Hi-index | 0.01 |
This paper presents the Data-Aggregation Aware Routing Protocol, DAARP, for wireless sensor networks. This novel protocol reduces the number of messages necessary to set up a routing tree, maximizes the number of overlapping routes, selects routes with the highest aggregation rate, and performs reliable data aggregation transmission. DAARP was compared to three existing solutions reported in the literature regarding communication costs, delivery efficiency, aggregation rate and aggregated data delivery rate. The results show that DAARP outperforms these solutions for different scenarios in all evaluations performed.