Mobility

Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks

Free registration required

Executive Summary

Network flow models serve as a popular mathematical framework for the analysis and optimization of multi-hop wireless networks. They also serve to provide the understanding necessary to derive effective distributed protocols. However, the high computational complexity of realistic models restricts the translation of theoretical insights into distributed protocols. In this paper, the authors consider an NP-hard, mixed integer linear programming based routing model that computes single-path routes in a wireless network. They propose an efficient, polynomial time algorithm that applies domain specific heuristics to reduce the complexity. They employ a decomposition based approach to break the monolithic problem into several sub-problems that cooperate to find near-optimal routes.

  • Format: PDF
  • Size: 135 KB