Authors: Mikel Larrea, Cristian Martin, Jose Javier Astrain
Addresses: Computer Architecture and Technology Department, The University of the Basque Country, Paseo Manuel de Lardizabal 1, 20018 San Sebastian, Spain. ' Software Technologies Department, Ikerlan-IK4 Research Centre, J.M. Arizmendiarrieta 2, 20500 Arrasate-Mondragon, Spain. ' Mathematic and Computer Engineering Department, Universidad Publica de Navarra, Campus de Arrosadia s/n, 31006 Pamplona, Spain
Abstract: This paper presents three algorithms for aggregator election and data aggregation in wireless sensor networks where sensors can crash and recover. The network is divided in several regions. The algorithms ensure the election of a common data aggregator sensor within each region, in charge of the collection of local data and the election of a unique super-aggregator sensor, in charge of the collection of global data, among all the aggregators. Both elections are achieved by implementing the Omega failure detector, which provides a self-organising and fault-tolerant leader election service. Each algorithm is based on a different connectivity assumption. The first algorithm assumes that every pair of sensors in a region can communicate directly. The second algorithm only requires some correct sensor to communicate directly with the rest of sensors. Finally, the third algorithm only requires the existence of a multi-hop bidirectional path from some correct sensor to the rest of sensors. We also introduce a battery depletion threshold to enhance the quality of service of the wireless sensor network.
Keywords: wireless sensor networks; WSNs; fault-tolerant aggregator election; data aggregation; Omega failure detector; wireless networks; battery depletion threshold; quality of service; QoS.
International Journal of Communication Networks and Distributed Systems, 2009 Vol.3 No.2, pp.93 - 115
Published online: 26 Jun 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article