LORA: Robust and simple routing algorithms for ad hoc mobile wireless networks

Mung Chiang, Gunnar Carlsson

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations

Abstract

We present two novel Locally Optimal Routing Algorithms (LORA) for ad hoc mobile wireless networks with fast changing topology. Instead of modifying globally optimal shortest path routing algorithms, we propose two new algorithms that are designed to match the characteristics of wireless physical channels in a network with dynamic ad hoc topology and mobile users. Motivated by practical constraints, we design LORA to be simple to implement at each node, requiring very low computational load and a small amount of memory, and can provide fast rerouting under distributed control when nodes or links fail. The first algorithm, LORA1, is designed for networks with slowly moving users, using a new random graphical model and randomized algorithms. The second algorithm, LORA2, is designed for fast moving users, building upon LORA1 with an additional mobility diversity feature. Various properties of the algorithms are tested by simulations. Analytic results bound the performances of LORA. We also outline several extensions of LORA.

Original languageEnglish (US)
Pages2793-2797
Number of pages5
StatePublished - Dec 1 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Other

OtherIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'LORA: Robust and simple routing algorithms for ad hoc mobile wireless networks'. Together they form a unique fingerprint.

Cite this