Fault recovery in wireless networks: the geometric recolouring approach

Authors:
Henk Meijer;Yurai Núñez-Rodríguez;David Rappaport
Affiliations:
Roosevelt Academy, Middelburg, The Netherlands;Queen’s University, Kingston, ON, Canada;Queen’s University, Kingston, ON, Canada
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 8
Cited 0

Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review

Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review
Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks

IEEE Transactions on Computers
Dynamic monopolies in tori

Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Lower bounds for asymmetric communication channels and distributed source coding

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Delineating Boundaries for Imprecise Regions

Algorithmica
Bounds for point recolouring in geometric graphs

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Duplication of information allows distributed systems to recover from data errors, or faults. If faults occur spontaneously, without notification, and disguised incorrect data blends in with correct data, their detection becomes non-trivial. Known solutions for fault recovery use monitoring mechanisms that compare the data in multiple nodes to infer the occurrence of faults. To this end, we propose a localized geometric approach to fault recovery in wireless networks. We compare our approach with a more traditional combinatorial approach that uses a majority rule. Our experiments show that our geometric approach is an improvement over the majority rule in some cases, whereas in the other cases a hybrid method that combines the best of both strategies is superior to each individual method.