Random walk with jumps in large-scale random geometric graphs

Abstract

a b s t r a c tThe information dissemination problem in large-scale networking environments like wireless sensor networks and ad hoc networks is studied here considering random geometric graphs and random walk based approaches. A new type of random walk based agent is proposed in this paper and an analytical expression with respect to coverage (i.e., the proportion of the network nodes visited by the random walk agent) as a function of the number of the agent movements is derived. It is observed that the cover time of many of already existing random walk based variants is large in random geometric graphs of low degree (as it is commonly the case is wireless environments). As this inefficiency is attributed (as discussed in the paper) to the inability of existing random walk based solutions to move away from already likely covered areas, a mechanism for directional movement (i.e., jumping) of the random walk based agent is proposed and studied, that allows the agent to jump to different network areas, most likely not covered yet. The proposed mechanism (Jumping Random Walk) is studied analytically and via simulations and the parameters (of the network topology and the mechanism) under which the proposed scheme outperforms existing random walk based variations are determined.

Random Walker Coverage Analysis for Information Dissemination in Wireless Sensor Networks

“…Tzevelekas et al in [16] present the same problem addressed in this work with the technique of a random walker with jumps. Oikonomou et al in [25] investigate the use of multiple random walkers and related replication mechanisms.…”

“…The choice of the model of a geometric random graph to represent WSN and ad hoc networks is quite common in the literature, e.g., [16,[23][24][25][26][27][28][29]. One of the most most comprehensive studies on geometric random graphs can be found in [18] by Penrose.…”

“…The stochastic nature of these modern networks challenges the application of the most widely-used methods for the dissemination (and similarly the collection) of information (e.g., flooding). New mechanisms have been developed and used for this purpose [13], one being the random walker [14][15][16][17].…”

Coverage maximization under resource constraints using proliferating random walks

“…Either variants of flooding [15][16][17] or single random walk [18][19][20] or their combinations (e.g., hybrid probabilistic schemes [21]) were used for this purpose. Different approaches have been adopted to minimize the redundant node visits by the message packet, e.g., use of topological features of the network [22,23] and entropy information measurement based cost effective path selection [24,25].…”

Ego network models for Future Internet social networking environments

“…Exploiting the store-carry-and-forward paradigm [32,33], messages are locally stored at intermediate nodes that are deemed most suitable to bring them closer to the eventual destination(s), until a new node appears (e.g., thanks to mobility), which is an even better candidate for reaching the destinations. A number of research topics are been addressed in the area of opportunistic networking, including forwarding protocols [34][35][36][37], privacy-preserving solutions [38,39], resource management and service-oriented systems [40,41], support for participatory sensing [42][43][44], and characterisation of foundational theoretical properties [45][46][47]. Some of the solutions investigated in this area exploit information about human social relationships, e.g.…”