The Multi-Constrained Dynamic Programming Problem in View of Routing Strategies in Wireless Mesh Networks

Download Now Free registration required

Executive Summary

The authors address the problem of satisfying multiple constraints in a shortest-path Dijkstra-based Dynamic Programming (DP) framework. They solve this problem considering its applicability to routing in wireless mesh networks. Their work, therefore, relates to Quality-of-Service (QoS) metrics such as bandwidth, delay and the number of hops between network nodes. This paper is based on the optimization of one or more metrics while bounding the other. Specifically, they compute high-capacity paths while simultaneously bounding the end-to-end delay and the number of hops to an upper limit. They prospectively call the resulting algorithm the Comprehensive Mesh Routing Algorithm (CMRA).

  • Format: PDF
  • Size: 554.2 KB