Journal of Combinatorial Theory Series A
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Communicating via fireflies: geographic routing on duty-cycled sensors
Proceedings of the 6th international conference on Information processing in sensor networks
A diffusion model for packet travel time in a random multihop medium
ACM Transactions on Sensor Networks (TOSN)
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
JAVeLEN - An ultra-low energy ad hoc wireless network
Ad Hoc Networks
Diversity of forwarding paths in pocket switched networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Random walk based routing protocol for wireless sensor networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Latency of opportunistic forwarding in finite regular wireless networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Opportunistic forwarding in wireless networks with duty cycling
Proceedings of the third ACM workshop on Challenged networks
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Random walk with long jumps for wireless ad hoc networks
Ad Hoc Networks
Design and performance of wireless data gathering networks based on unicast random walk routing
IEEE/ACM Transactions on Networking (TON)
Lattice green functions and diffusion for modeling traffic routing in ad hoc networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
Pocket switched networking: challenges, feasibility and implementation issues
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
IEEE/ACM Transactions on Networking (TON)
A simulation study of ad hoc networking of UAVs with opportunistic resource utilization networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
Stateless opportunistic forwarding is a simple fault-tolerant distributed scheme for packet delivery, data gathering, and information querying in intermittently connected networks by which packets are forwarded to the next available neighbors in a "random walk" fashion until they reach their intended destinations or expire. It has been employed in diverse situations, for instance, when: 1) the global network topology is not known or is highly dynamic; 2) the availability of the next-hop neighbors is not easily controllable; or 3) the relaying nodes are computationally constrained. Data delivery in sensor networks, ad hoc networks, and delay-tolerant networks are well-known applications besides searching in peer-to-peer networks. A major challenge for stateless opportunistic forwarding is the difficulty to predict the end-to-end latency. To facilitate latency evaluation, we study a simplified model of stateless opportunistic forwarding, namely a "weighted random walk" in a finite graph. This paper makes several contributions toward the analysis of this model. 1) By spectral graph theory we derive a general formula to efficiently compute the exact hitting and commute times of random walks with heterogeneous transition times at relay nodes. Such transition times can model the heterogeneous delivery times and availability periods of the next-hop neighbors. 2) We study a common class of distance-regular networks with a varying number of geographical neighbors and obtain exact and approximation formulas for the hitting time in such networks. 3) Based on these results, we study other sophisticated settings, such as random geographical locations, topology-aware forwarding, and multicopy random-walk forwarding. Our results provide the basic analytical tools for managing and controlling the performance of stateless opportunistic forwarding in finite networks.