R. , .. Ochirkhand, M. Minier, F. Valois, and A. Kountouris, Resilient networking in wireless sensor networks, 2010.

C. Ponsonnet, Secure probabilistic routing in wireless sensor networks, 2011.

L. Lovász, Random walks on graphs: A survey, Combinatorics, Paul Erd? os is Eighty, pp.1-46, 1993.

D. J. Aldous and J. A. , Reversible Markov Chains and Random Walks on Graphs. Book in preparation, p.20
DOI : 10.1007/bf01048272

G. Slade, The self-avoiding walk: A brief survey To appear in Surveys in Stochastic Processes, Proceedings of the Thirty-third SPA Conference in Berlin, 2009, to be published in the EMS Series of Congress Reports, 2010.

K. Li, Performance analysis and evaluation of random walk algorithms on wireless networks, IPDPS Workshops, pp.1-8, 2010.

K. Altisen, S. Devismes, P. Lafourcade, and C. Ponsonnet, Routage par marche aléatoirè a listes tabous, 2011.

R. Ortner and W. Woess, Non-backtracking random walks and cogrowth of graphs. Canad, J. Math, vol.59, issue.4, pp.828-844, 2007.

K. Altisen, S. Devismes, A. Gerbaud, and P. Lafourcade, Comparisons of mean hitting times for tabu random walks on finite graphs, 2011.

B. D. Hughes, Random walks and random environments, 1995.

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2009.
DOI : 10.1090/mbk/058