A general optimization framework for stochastic routing in wireless multi-hop networks

Quan Luo Zhi, Nikos D. Sidiropoulos, Georgios B. Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

We introduce a novel approach to routing based on the so called pairwise packet delivery ratio matrix whose entries represent the probability that a given user decodes the packet transmitted by any other user. We show that this leads naturally to a model in which routing algorithms are described by the evolution of a Markov chain enabling the definition of deliverability criteria in terms of absorbing states. We further introduce optimal routing protocols by selecting the routing matrix from a convex polygon containing all feasible routing matrices. The criteria of optimality include minimization of the packet error probability for a given delay bound and the minimization of the average packet delay. These metrics are correspondingly meaningful in the context of real time transmissions - e.g., voice and/or video - and delay insensitive data - e.g., file transfers.

Original languageEnglish (US)
Title of host publicationConference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06
Pages1367-1371
Number of pages5
DOIs
StatePublished - Dec 1 2006
Event40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06 - Pacific Grove, CA, United States
Duration: Oct 29 2006Nov 1 2006

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06
CountryUnited States
CityPacific Grove, CA
Period10/29/0611/1/06

Keywords

  • Markov chains
  • Optimization
  • Routing
  • Wireless networks

Fingerprint Dive into the research topics of 'A general optimization framework for stochastic routing in wireless multi-hop networks'. Together they form a unique fingerprint.

Cite this