Distributed optimal routing in wireless ad hoc networks

Abstract

In this thesis, optimal routing problems in wireless ad hoc networks are investigated. The majority of existing routing algorithms follow a selfish strategy, where routing decisions are based on individual communication flows. The performance of these algorithms may suffer from the competition between multiple communication flows, also known as the tragedy of the commons. This issue worsens in wireless ad hoc networks because communications in these networks experiences more mutual interference between flows in comparison to communication in wired networks.