## Abstract

We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix whose entries represent the probability that a given node decodes the packet transmitted by any other node. The model lends itself naturally to the formulation of stochastic routing protocols in which packets are randomly routed to neighboring nodes; and routing algorithms search for a matrix of routing probabilities according to properly defined optimality criteria. The goal of the paper is to show that this novel framework offers a useful model to aid in the design of optimal routing algorithms. In particular, it is established that: 1) performance is improved with respect to graph descriptions; and 11) optimal routes can be obtained as the solution of optimization problems, many of which turn out to be convex and can thus be solved in polynomial time using interior point methods.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM 2007 |

Subtitle of host publication | 26th IEEE International Conference on Computer Communications |

Pages | 1748-1756 |

Number of pages | 9 |

DOIs | |

State | Published - Sep 4 2007 |

Event | IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States Duration: May 6 2007 → May 12 2007 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

ISSN (Print) | 0743-166X |

### Other

Other | IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications |
---|---|

Country | United States |

City | Anchorage, AK |

Period | 5/6/07 → 5/12/07 |

## Keywords

- Convex optimization
- Linear programming
- Markov chains
- Routing
- Wireless networks