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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, M., Demaine, E.D., Harvey, N.J.A., Pǎtraşcu, M.: Lower bounds for asymmetric communication channels and distributed source coding. In: Proc. 17th Annual ACM-SIAM Symp. on Disc. Alg. (SODA 2006), pp. 251–260 (2006)
Flocchini, P., Lodi, E., Luccio, F., Pagli, L., Santoro, N.: Dynamic monopolies in tori. Disc. Applied Math. 137(2), 197–212 (2004)
Goles, E., Olivos, J.: Periodic behaviour of generalized threshold functions. Disc. Math. 30, 187–189 (1980)
Krishnamachari, B., Iyengar, S.: Distributed bayesian algorithms for fault-tolerant event region detection in wireless sensor networks. IEEE Trans. on Comp. 53(3), 241–250 (2004)
Luccio, F., Pagli, L., Sanossian, H.: Irreversible dynamos in butterflies. In: Proc. 6th Intl. Colloq. on Structural Inf. and Comm. Complex, pp. 204–218 (1999)
Meijer, H., Núñez-Rodríguez, Y., Rappaport, D.: Bounds for point recolouring in geometric graphs. Comp. Geom.: Theory and Apps. 42(6-7), 690–703 (2009)
Núñez-Rodríguez, Y.: Problems on Geometric Graphs with Applications to Wireless Networks. PhD Thesis, School of Computing, Queen’s University (2009), http://qspace.library.queensu.ca/handle/1974/5335
Peleg, D.: Local majority voting, small coalitions and controlling monopolies in graphs: A review. Technical Report CS96-12, Department of Mathematics & Computer Science, Weizmann Institute of Science (1996)
Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Disc. Math. and Apps. (2000)
Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S.B., Snoeyink, J., Wolff, A.: Delineating boundaries for imprecise regions. Algorithmica 50(3), 386–414 (2008)
Slepian, D., Wolf, J.K.: Noiseless encodings of correlated information sources. IEEE Trans. on Inf. Theory 19(4), 471–480 (1973)
Wan, P.J., Yi, C.W.: Asymptotic critical transmission radius and critical neighbour number for k-connectivity in wireless ad hoc networks. In: Proc. of the 5th ACM Intl. Symp. on Mobile Ad Hoc Networking and Comp., pp. 1–8 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meijer, H., Núñez-Rodríguez, Y., Rappaport, D. (2010). Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-13193-6_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13192-9
Online ISBN: 978-3-642-13193-6
eBook Packages: Computer ScienceComputer Science (R0)