@conference {jesus2009fault,
	title = {Fault-Tolerant Aggregation by Flow Updating},
	booktitle = {Distributed Applications and Interoperable Systems},
	volume = {5523},
	year = {2009},
	month = {June},
	pages = {73{\textendash}86},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	address = {Lisbon, Portugal},
	abstract = {<p>Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed applications. In the particular case of wireless sensor networks, data collection is often only practicable if aggregation is performed. Several aggregation algorithms have been proposed in the last few years, exhibiting different properties in terms of accuracy, speed and communication tradeoffs. Nonetheless, existing approaches are found lacking in terms of fault tolerance. In this paper, we introduce a novel fault-tolerant averaging based data aggregation algorithm. It tolerates substantial message loss (link failures), while competing algorithms in the same class can be affected by a single lost message. The algorithm is based on manipulating flows (in the graph theoretical sense), that are updated using idempotent messages, providing it with unique robustness capabilities. Furthermore, evaluation results obtained by comparing it with other averaging approaches have revealed that it outperforms them in terms of time and message complexity.</p>
},
	url = {http://dx.doi.org/10.1007/978-3-642-02164-0_6},
	attachments = {https://haslab.uminho.pt/sites/default/files/cbm/files/flow_updating.pdf},
	author = {Paulo Jesus and Carlos Baquero Moreno and Paulo S{\'e}rgio Almeida}
}