ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A reliable and data aggregation aware routing protocol for wireless sensor networks
Full text PdfPdf (643 KB)
Source
International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems table of contents
Tenerife, Canary Islands, Spain
SESSION: Dissemination, multicast, routing table of contents
Pages: 245-252  
Year of Publication: 2009
ISBN:978-1-60558-616-8
Authors
Leandro A. Villas  Federal University of Minas Gerais, Belo Horizonte, Brazil
Azzedine Boukerche  University of Ottawa, Ottawa, ON, Canada
Regina B. Araujo  Federal University of Sao Carlos, Sao Carlos, Brazil
Antonio A.F. Loureiro  Federal University of Minas Gerais, Belo Horizonte, Brazil
Sponsor
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 70,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1641804.1641846
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. Baddeley. Spatial point processes and their application. In W. Weil, editor, Stochastic Geometry, volume 1892 of Lecture Notes in Mathematics, pages 1--75. Springer, Berlin, 2006.
 
3
4
5
6
 
7
8
 
9
 
10
11
 
12
 
13
K. Romer and F. Mattern. The design space of wireless sensor networks. IEEE Wireless Communications, 11(6):54--61, December 2004.
 
14
Sinalgo. Simulator for network algorithms, 2008. Distributed Computing Group - ETH-Zurich, last visited in October, 2008.
 
15
O. Younis, M. Krunz, and S. Ramasubramanina. Node clustering in wireless sensor networks: Recent developments and deployment challenges. IEEE Network, 20(3):20--25, December 2006.

Collaborative Colleagues:
Leandro A. Villas: colleagues
Azzedine Boukerche: colleagues
Regina B. Araujo: colleagues
Antonio A.F. Loureiro: colleagues