Latency of opportunistic forwarding in finite regular wireless networks

In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node continues this process until the packet arrives at its destination. This is particularly attractive in certain types of wireless ad hoc and sensor networks where obtaining accurate knowledge of global topology may be infeasible. However, opportunistic forwarding is hampered by the difficulty to control its performance, particularly, the end-to-end latency. This paper presents new analytical results that shed light on the latency of "random walk", the simplest type of opportunistic forwarding, for several useful regular network topologies, such as r-nearest cycle that can model variable wireless transmission distance in one dimensional scenario, and a 2D regular torus-type graph that can approximate grid-like deployments. We give new exact and approximation formulas for the maximum expected hitting tim...

• Type: Conference
• Year: 2008
• Where: DIALM
• Authors: Prithwish Basu, Chi-Kin Chau
• Keywords: Algorithms, DIALM 2008, Global Topology, Opportunistic Forwarding, Random Walk