An adaptive opportunistic routing scheme for wireless ad-hoc networks

Authors:
A. A. Bhorkar;M. Naghshvar;T. Javidi;B. D. Rao
Affiliations:
Department of Electrical Engineering, University of California San Diego, CA;Department of Electrical Engineering, University of California San Diego, CA;Department of Electrical Engineering, University of California San Diego, CA;Department of Electrical Engineering, University of California San Diego, CA
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 6
Cited 0

Selection diversity forwarding in a multihop packet radio network with fading channel and capture

ACM SIGMOBILE Mobile Computing and Communications Review
Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
Parallel and Distributed Computation: Numerical Methods

Parallel and Distributed Computation: Numerical Methods
Exploiting Path Diversity in the Link Layer in Wireless Ad Hoc Networks

WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an adaptive opportunistic routing scheme for multi-hop wireless ad-hoc networks is proposed. The proposed scheme utilizes a reinforcement learning framework to achieve the optimal performance even in the absence of reliable knowledge about channel statistics and network model. This scheme is shown to be optimal with respect to an expected average per packet cost criterion. The proposed routing scheme jointly addresses the issues of learning and routing in an opportunistic context, where the network structure is characterized by the transmission success probabilities. In particular, this learning framework leads to a stochastic routing scheme which optimally "explores" and "exploits" the opportunities in the network.