Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

DOI10.1016/J.JPDC.2013.09.011zbMath1327.68052OpenAlexW2072149016MaRDI QIDQ897385

Matthew Bradbury, Sain Saginbekov, Arshad Jhumka

Publication date: 18 December 2015

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/64379/1/WRAP_0921660-cs-271114-jpdc-jbs-das-ft.pdf

zbMATH Keywords

correctnessfault tolerancewireless sensor networksimpossibilitycrashescollision freedomdata aggregation scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Practical Fault-Tolerant Data Aggregation

Uses Software

• TAG

Cites Work

• Unnamed Item
• Unnamed Item
• A distributed fault identification protocol for wireless and mobile ad hoc networks
• Defining liveness
• Stabilization and pseudo-stabilization
• Distributed time-optimal scheduling for convergecast in wireless sensor networks
• Self-stabilizing systems in spite of distributed control
• The weakest failure detector for solving consensus
• Principles of Distributed Systems

This page was built for publication: Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks