The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed Algorithms
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
SIA: secure information aggregation in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Optimized Scheduling for Data Aggregation in Wireless Sensor Networks
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks
Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Communication-Efficient Probabilistic Quorum Systems for Sensor Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Asynchronous Leader Election in Mobile Ad Hoc Networks
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Implementing unreliable failure detectors with unknown membership
Information Processing Letters
Hi-index | 0.00 |
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.