Random walks on digraphs: A theoretical framework for estimating transmission costs in wireless routing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Li, Yanhua ^a   Zhang, Zhi Li ^a  

^a University of Minnesota   (United States)

Author keywords

Digraph; Random walk; Spectral graph theory; Transmission cost; Wireless routing

Indexed keywords

ANALYTICAL MODEL; DIRECTED GRAPHS; EXISTING METHOD; EXTENSIVE SIMULATIONS; HITTING TIME; OPPORTUNISTIC ROUTING; PACKET FORWARDING; PATH ROUTING; RANDOM WALK; ROUTING PARADIGM; SPECTRAL GRAPH THEORY; STATELESS ROUTING; THEORETICAL FRAMEWORK; TRANSMISSION COSTS; UNDIRECTED GRAPH; WIRELESS ROUTING;

COMPUTER SIMULATION; COSTS; ESTIMATION; LIGHT TRANSMISSION; MATHEMATICAL MODELS; ROUTING PROTOCOLS;

GRAPH THEORY;

EID: 77953301773     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462109     Document Type: Conference Paper

References (22)

1. D. Aldous and J. A. Fill. Reversible markov chains and random walks on graphs. In http://www.stat.berkeley.edu/~Aldous/RWG/book.html.
2. S. Banerjee and A. Misra. Minimum energy paths for reliable communication in multi-hop wireless networks. In Proceedings of MOBIHOC'02, pages 146-156, 2002.
3. S. Biswas and R. Morris. ExOR: Opportunistic routing in multi-hop wireless networks. In Proceedings of SIGCOMM'05. ACM, 2005.
4. S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In Proceedings of SIGCOMM'07. ACM, 2007.
5. J.-H. Chang and L. Tassiulas. Energy conserving routing in wireless ad-hoc networks. In Proceedings of INFOCOM'00, pages 22-31, 2000.
6. J.-H. Chang and L. Tassiulas. Maximum lifetime routing in wireless sensor networks. IEEE/ACM Transaction on Networking, 12(4):609-619, 2004.
7. C.-K. Chau and P. Basu. Exact analysis of latency of stateless opportunistic forwarding. In Proceedings of INFOCOM '09. IEEE, 2009.
8. F. R. K. Chung. Spectral graph theory. http://www.math.ucsd.edu/~fan/ research/revised.html.
9. F. R. K. Chung. Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics, 9:1-19, sep 2005.
10. F. R. K. Chung and S. T. Yau. Discrete green's functions. Journal of Combinatorial Theory, Series A, pages 191-214, July 2000.
11. D. D. Couto, D. Aguayo, J. Bicket, and R. Morris. High-throughput path metric for multi-hop wireless routing. In Proceedings of MobiCom '03. ACM, 2003.
12. P. G. Doyle and L. J. Snell. Random walks and electric networks. Mathematical Association of America, Jan 1984.
13. R. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1st edition, 1985.
14. D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing. Kluwer Academic Publishers, 1996.
15. Y. Li, W. Chen, and Z.-L. Zhang. Optimal forwarder list selection in opportunistic routing. In Proceedings of IEEE MeshTech'09, 2009.
16. Y. Li and Z.-L. Zhang. Random walks and greens function on digraphs, with applications to wireless networks. Technical Report, http://www.cs.umn.edu/ ~yanhua, University of Minnesota, 2009.
17. Y. Lin, B. Li, and B. Liang. CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding. In Proceedings of ICNP '08. IEEE, 2008.
18. L. Lovàsz. Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty, 2:1-46, 1993.
19. I. Mabrouki, X. Lagrange, and G. Froc. Random walk based routing protocol for wireless sensor networks. In Proceedings of ValueTools '07, pages 1-10, 2007.
20. C. Pandana and K. Liu. Robust connectivity-aware energy-efficient routing for wireless sensor networks. IEEE Transactions on Wireless Communications, 7(10):3904-3916, October 2008.
21. C. E. Perkins and E. M. Royer. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90-100, 1999.
22. Roofnet. MIT Roofnet. http://pdos.csail.mit.edu/roofnet.