UC San Diego

Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless multi-hop networks, specifically, taking advantage of wireless opportunities and receiver diversity. This thesis first provides an overview of the optimal opportunistic distance metric, then examines the performance of several routing algorithms from the literature, compared to the optimal opportunistic routing algorithm. The performance is examined first in analytical examples, then via simulation to identify the strengths of the optimal opportunist routing algorithm. The performance of a distributed implementation of the optimal opportunistic routing algorithm is also examined via simulation.