An Adaptive Opportunistic Routing Scheme for Wireless Ad-hoc Networks

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2009
Accession Number
ADA515878

Entities

People

  • A. A. Bhorkar
  • Bhaskar D. Rao
  • M. Naghshvar
  • Tara Javidi

Organizations

  • University of California, San Diego

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Channel Models
  • Computations
  • Convergence
  • Electrical Engineering
  • Engineering
  • Mesh Networks
  • Models
  • Network Topology
  • Networks
  • Probabilistic Models
  • Probability
  • Probability Distributions
  • Random Variables
  • Sequences
  • Wireless Communications

Fields of Study

  • Computer science

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Computer Networking
  • Statistical inference.

Technology Areas

  • AI & ML
  • AI & ML - Bayesian Inference
  • AI & ML - Machine Learning Algorithms