S. Ikeda, I. Kubo, and M. Yamashita, The hitting and cover times of random walks on finite graphs using local degree information, Theoretical Computer Science, vol.410, issue.1, pp.94-100, 2009.
DOI : 10.1016/j.tcs.2008.10.020

R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. W. Rackoff, Random walks, universal travelling sequences, and the complexity of maze problems, Proceedings of FOCS'79, pp.218-223, 1979.

H. Tian, H. Shen, and T. Matsuzawa, RandomWalk Routing for Wireless Sensor Networks, Proceedings of PDCAT'05, pp.196-200, 2005.

I. Mabrouki, X. Lagrange, and G. Froc, Random Walk Based Routing Protocol for Wireless Sensor Networks, Proceedings of the 2nd International ICST Conference on Performance Evaluation Methodologies and Tools, pp.1-7110, 2007.
DOI : 10.4108/inter-perf.2007.2112

J. Yick, B. Mukherjee, and D. Ghosal, Wireless sensor network survey, Computer Networks, vol.52, issue.12, pp.2292-2330, 2008.
DOI : 10.1016/j.comnet.2008.04.002

S. Olariu and I. Stojmenovic, Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1-12, 2006.
DOI : 10.1109/INFOCOM.2006.296

K. Altisen, S. Devismes, P. Lafourcade, and C. Ponsonnet, Routage par marche aléatoirè a listes tabous, Proceedings of Algotel'2011, pp.21-24, 2011.

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

J. G. Kemeny and J. L. Snell, Finite Markov chains. Undergraduate Texts in Mathematics, 1976.

S. Karlin and H. M. Taylor, A first course in stochastic processes, 1975.

T. Kamae, U. Krengel, and G. L. O-'brien, Stochastic Inequalities on Partially Ordered Spaces, The Annals of Probability, vol.5, issue.6, pp.899-912, 1977.
DOI : 10.1214/aop/1176995659
URL : http://doi.org/10.1214/aop/1176995659