On the efficiency of random walk routing in multihop wireless network

Authors:
Yanhua Li;Debin Zou;Yuan-An Liu;Zheng Zhou;Yong Li
Affiliations:
Beijing U. of Posts & Telecommunications, Beijing, China;Beijing U. of Posts & Telecommunications, Beijing, China;Beijing U. of Posts & Telecommunications, Beijing, China;Beijing U. of Posts & Telecommunications, Beijing, China;Beijing U. of Posts & Telecommunications, Beijing, China
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 11
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A framework for opportunistic scheduling in wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
RandomWalk Routing for Wireless Sensor Networks

PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Trading structure for randomness in wireless opportunistic routing

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Dice: a game theoretic framework for wireless multipath network coding

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Symbol-level network coding for wireless mesh networks

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Optimized Multipath Network Coding in Lossy Wireless Networks

ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a novel routing metric, namely biased delivery probability (BDP), for measuring the wireless node's capacity of forwarding data packet to the destination. BDP essentially assigns different weights to the multipaths information associated with different hop counts. An theoretical theory is established to compute the weights for different scenarios. Using BDP routing metric, we design a prioritized random walk routing (PRR) protocol for multihop wireless network, which incorporates random network coding strategy, and can force the coded packet only randomly "walk" through the higher priority node set, instead of randomly encountered nodes. In such a way, it provides a loop-free random walk forwarding and guarantees the packets consequently go through the right "direction" step by step to the destination. Extensive simulation results show that the PRR protocol can dramatically improve the network performance over existing forwarding scheme, in terms of the throughputs, the end to end delay and the number of transmissions.