This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
DRINA: A Lightweight and Reliable Routing Approach for In-Network Aggregation in Wireless Sensor Networks
April 2013 (vol. 62 no. 4)
pp. 676-689
L. A. Villas, Dept. of Comput. Sci., Fed. Univ. of Minas Gerais, Belo Horizonte, Brazil
A. Boukerche, Sch. of Inf. Technol. & Eng. (SITE), Univ. of Ottawa, Ottawa, ON, Canada
H. S. Ramos, Dept. of Comput. Sci., Fed. Univ. of Minas Gerais, Belo Horizonte, Brazil
H. A. B. F. de Oliveira, Dept. of Comput. Sci., Fed. Univ. of Amazonas, Manaus, Brazil
R. B. de Araujo, Dept. of Comput. Sci., Fed. Univ. of Sao Carlos, Sao Carlos, Brazil
A. A. F. Loureiro, Dept. of Comput. Sci., Fed. Univ. of Minas Gerais, Belo Horizonte, Brazil
Large scale dense Wireless Sensor Networks (WSNs) will be increasingly deployed in different classes of applications for accurate monitoring. Due to the high density of nodes in these networks, it is likely that redundant data will be detected by nearby nodes when sensing an event. Since energy conservation is a key issue in WSNs, data fusion and aggregation should be exploited in order to save energy. In this case, redundant data can be aggregated at intermediate nodes reducing the size and number of exchanged messages and, thus, decreasing communication costs and energy consumption. In this work, we propose a novel Data Routing for In-Network Aggregation, called DRINA, that has some key aspects such as a reduced number of messages for setting up a routing tree, maximized number of overlapping routes, high aggregation rate, and reliable data aggregation and transmission. The proposed DRINA algorithm was extensively compared to two other known solutions: the Information Fusion-based Role Assignment (InFRA) and Shortest Path Tree (SPT) algorithms. Our results indicate clearly that the routing tree built by DRINA provides the best aggregation quality when compared to these other algorithms. The obtained results show that our proposed solution outperforms these solutions in different scenarios and in different key aspects required by WSNs.
Index Terms:
wireless sensor networks,telecommunication network routing,trees (mathematics),energy conservation,reliable routing approach,lightweight routing approach,DRINA,in-network aggregation,wireless sensor networks,WSN,energy consumption,communication costs,exchanged messages,data routing,data aggregation,shortest path tree algorithm,information fusion-based role assignment algorithm,InFRA algorithm,Routing,Wireless sensor networks,Clustering algorithms,Relays,Protocols,Energy consumption,Reliability,wireless sensor networks,Routing protocol,in-network aggregation
Citation:
L. A. Villas, A. Boukerche, H. S. Ramos, H. A. B. F. de Oliveira, R. B. de Araujo, A. A. F. Loureiro, "DRINA: A Lightweight and Reliable Routing Approach for In-Network Aggregation in Wireless Sensor Networks," IEEE Transactions on Computers, vol. 62, no. 4, pp. 676-689, April 2013, doi:10.1109/TC.2012.31
Usage of this product signifies your acceptance of the Terms of Use.