By Topic

A Flexible Framework for Polynomial-Time Resource Allocation in Streaming Multiflow Wireless Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Middleton, G. ; Center for Multimedia Commun., Rice Univ., Houston, TX, USA ; Aazhang, B. ; Lilleberg, J.

We present a wide-area, multiflow ad-hoc network model leveraging information-theoretic rate control, emphasizing interfering rather than colliding transmissions. We seek to allocate resources in this network by optimizing scheduling, routing and power control to solve the max-min throughput problem for all flows involved. In general, our time-slotted, fully-interfering model leads to an NP-hard problem. Further, the rate-control element of the mixed-integer program results in a non-convex problem in the continuous domain. The complexity of the joint problem makes an optimal solution prohibitively difficult to find, leading us to propose a two-pronged approach to determine a near-optimal resource allocation. First, we propose a novel decomposition technique, breaking the joint problem into a sequence of more tractable subproblems. Second, we present a data structure serving multiple purposes: it compactly represents network conditions as they evolve with time, and also serves as the basis for our cubic-time dynamic programming algorithms used to solve and catalog the subproblems. The result is a schedule, route, and power allocation for all data frames involved. We demonstrate the performance of our techniques on the max-min throughput problem, while also showing that they are sufficiently general to apply to a wide variety of optimality criteria in which decisions over transmission schedules and packet routing must be made.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:11 ,  Issue: 3 )