We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Lattice Green functions and diffusion for modelling traffic routing in ad hoc networks.

Sigelle, M. and Jermyn, I.H. and Perreau, S. and Jayasuriya, A. (2009) 'Lattice Green functions and diffusion for modelling traffic routing in ad hoc networks.', in Final proceedings of the 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2009). Piscataway, NJ: IEEE, pp. 1-5.


We describe basic properties of Markov chains on finite state spaces and their application to Green functions, partial differential equations, and their (approximate) solution using random walks on a graph. Attention is paid to the influence of boundary conditions (Dirichlet/von Neumann). We apply these ideas to the study of traffic propagation and distribution in ad hoc networks.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:© 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Date accepted:No date available
Date deposited:15 April 2016
Date of first online publication:2009
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar