 Nodes are then moved (migrated away) based on a random model, using random walk or brownian motion.Different mobility and number of nodes present yield different route length and hence different number of multi-hops.These are graphs consisting of a set of nodes placed according to a point process in some usually bounded subset of the n-dimensional plane, mutually coupled according to a boolean probability mass function of their spatial separation (see e.g.