A flexible framework for polynomial-time resource allocation in multiflow wireless networks

Gareth B Middleton, Behnaam Aazhang, Jorma Lilleberg
2009 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
We introduce the problem of joint routing, scheduling and power control for multiple information flows in halfduplex, interference limited ad-hoc networks. The joint problem of optimizing for throughput is NP-Hard, and so we present an approximation of the problem and a general framework for solving it in O(N 3 ) time. We attack the problem in two ways, first by presenting a reformulation and decomposition of the joint optimization, and second by providing a framework and data structure to
more » ... a structure to manage the decomposition and its associated complexity. The generality of our approach permits its application to a wide variety of optimality criteria, including delay-constrained routing and minimum-cost routing. Simulation results demonstrate the execution of our algorithms on large networks, where we see significant gains in both throughput and power savings.
doi:10.1109/allerton.2009.5394868 fatcat:a57gdqakpvhypflbzoddqehc3q