Searching with mobile agents in networks with liars

Abstract We present deterministic algorithms to search for an item s contained in a node of a network, without prior knowledge of its exact location. Each node of the network has a database that will answer queries of the form “how do I get to s ?” by responding with the first edge on a shortest path to the node containing s . It may happen that some nodes, called liars , give bad advice. If the number of liars k is bounded, we show different strategies to find the item depending on the topology of the network. In particular we consider the complete graph, ring, torus, hypercube and bounded degree trees.

[1]  Boaz Patt-Shamir,et al.  Self-stabilizing end-to-end communication , 1996, J. High Speed Networks.

[2]  Eyal Kushilevitz,et al.  Computation in noisy radio networks , 2005, SODA '98.

[3]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  Yannis C. Stamatiou,et al.  Locating Information with Uncertainty in Fully Interconnected Networks , 2000, DISC.

[5]  Richard Cole,et al.  Routing on butterfly networks with random faults , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[6]  Christos H. Papadimitriou,et al.  Interval graphs and seatching , 1985, Discret. Math..

[7]  Bruce M. Maggs,et al.  Expanders might be practical: fast algorithms for routing around faults on multibutterflies , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Evangelos Kranakis,et al.  Searching with Mobile Agents in Networks with Liars , 2000, Euro-Par.

[9]  Andrzej Pelc,et al.  Exploring unknown undirected graphs , 1999, SODA '98.

[10]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[11]  Susanne Albers,et al.  Exploring unknown environments , 1997, STOC '97.

[12]  David Peleg,et al.  Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks , 1999, SIAM J. Comput..

[13]  Yehuda Afek,et al.  Upper and lower bounds for routing schemes in dynamic networks , 1989, 30th Annual Symposium on Foundations of Computer Science.

[14]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..