scholarly journals Temporal random walk as a lightweight communication infrastructure for opportunistic networks

2014 ◽  
Author(s):  
Victor Ramiro ◽  
Emmanuel Lochin ◽  
Patrick Senac ◽  
Thierry Rakotoarivelo
Keyword(s):  
Random Walk ◽  
Opportunistic Networks ◽  
Communication Infrastructure

scholarly journals Random Walk Based Key Nodes Discovery in Opportunistic Networks

2016 ◽  
Vol 12 (03) ◽  
pp. 28
Author(s):  
Qin Qin ◽  
Yong-qiang He
Keyword(s):  
Random Walk ◽  
Binary Tree ◽  
Opportunistic Networks ◽  
Communication Cost ◽  
Simulation Experiments ◽  
Efficiency And Effectiveness ◽  
Iteration Number ◽  
Key Nodes

In opportunistic networks, temporary nodes choose neighbor nodes to forward messages while communicating. However, traditional forward mechanisms don’t take the importance of nodes into consideration while forwarding. In this paper, we assume that each node has a status indicating its importance, and temporary nodes choose the most important neighbors to forward messages. While discovering important neighbors, we propose a binary tree random walk based algorithm. We analyze the iteration number and communication cost of the proposed algorithm, and they are much less than related works. The simulation experiments validate the efficiency and effectiveness of the proposed algorithm.

Elements of the Random Walk

2004 ◽  
Author(s):  
Joseph Rudnick ◽  
George Gaspari
Keyword(s):  
Random Walk

CUBIC [001] TWIST CSL GRAIN BOUNDARIES STUDY BY MEANS OF RANDOM WALK

1990 ◽  
Vol 51 (C1) ◽  
pp. C1-67-C1-69
Author(s):  
P. ARGYRAKIS ◽  
E. G. DONI ◽  
TH. SARIKOUDIS ◽  
A. HAIRIE ◽  
G. L. BLERIS
Keyword(s):  
Random Walk ◽  
Grain Boundaries

Random walk to graphene

2011 ◽  
Vol 181 (12) ◽  
pp. 1284 ◽  
Author(s):  
Andrei K. Geim
Keyword(s):  
Random Walk
Sign in / Sign up

Export Citation Format

Share Document