The Complexity of the Routing Problem in POR

Abstract

We have designed and implemented a new protocol for wireless mesh networks called Practical Opportunistic Routing (POR). In this report, we document our finding about the complexity of the routing problem in POR. We prove that the routing problem is NP-hard by reducing a slightly modified version of the MAX-2-SAT problem to the optimal routing problem in… (More)

Topics

1 Figure or Table

Slides referencing similar topics