Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning

Abstract

Several policies have recently been proposed for attaining the maximum throughput region, or a guaranteed fraction thereof, through dynamic link scheduling. Among these policies, the ones that attain the maximum throughput region require a computation time which is linear in the network size, and the ones that require constant or logarithmic computation time attain only certain fractions of the maximum throughput region. In contrast, in this paper we propose policies that can attain any desirable fraction of the maximum throughput region using a computation time that is largely independent of the network size. First, using a combination of graph partitioning techniques and Lyapunov arguments, we propose a simple policy for tree topologies under the primary interference model that requires each link to exchange only 1 bit information with its adjacent links and approximates the maximum throughput region using a computation time that depends only on the maximum degree of nodes and the approximation factor. Then we develop a framework for attaining arbitrary close approximations for the maximum throughput region in arbitrary networks, and use this framework to obtain any desired tradeoff between throughput guarantees and computation times for a large class of networks and interference models. Specifically, given any ∊ ≻ 0, the maximum throughput region can be approximated in these networks within a factor of 1-∊ using a computation time that depends only on the maximum node degree and ∊. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Abstract-Several policies have recently been proposed for attaining the maximum throughput region, or a guaranteed fraction thereof, through dynamic link scheduling. Among these policies, the ones that attain the maximum throughput region require a computation time which is linear in the network size, and the ones that require constant or logarithmic computation time attain only certain fractions of the maximum throughput region. In contrast, in this paper we propose policies that can attain any desirable fraction of the maximum throughput region using a computation time that is largely independent of the network size. First, using a combination of graph partitioning techniques and Lyapunov arguments, we propose a simple policy for tree topologies under the primary interference model that requires each link to exchange only 1 bit information with its adjacent links and approximates the maximum throughput region using a computation time that depends onl...

Delay Guarantees for Throughput-Optimal Wireless Link Scheduling

“…Scheduling policies that exploit node mobility as in these works are in general unlikely to attain low delay guarantees for the static network setting that we consider in this paper. Analysis of scheduling algorithms in terms of expected queuing delay or expected queue lengths is considered in [19], [12], [22]. In [19], the author obtains a O(log N ) upper bound on the expected delay, but only for maximal scheduling policies which (depending on network topology and interference relationships) can attain only a small fraction of the overall stability region.…”

“…In [12], [22], the authors show an O(1) upper bound on expected queue length per link for scheduling policies they propose, but their results apply only to the special class of non-expanding graphs (which include random geometric interference graphs). In [12], the authors also show that there exist arrival processes for which Ω(1) queue length is necessary.…”

“…Maximal scheduling however provides poor throughput guarantees, as depending on the network topology, the stability region of maximal scheduling can become arbitrary small as compared to the stability region of throughput-optimal scheduling policies. Shah et al [12] and Sarkar et al [22] have shown that an O(1) expected queue length per link is attainable in special classes of networks. Asymptotic guarantees on queue lengths do not imply similar guarantees on delay, and more importantly, the above guarantees do not apply for arbitrary network topologies.…”

Optimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks

“…For certain forms of "local" interference constraints, it can be implemented or approximated in a distributed manner, with low message complexity. See [17] and references therein for a discussion of low message scheduling algorithms with provable approximation guarantees.…”

Economy of Spectrum Access in Time Varying Multichannel Networks

“…Approximate dynamic scheduling policies that achieve a polynomial complexity have been proposed in [17]- [24] among others. All of these works focus essentially on approximating the stability region and/or fairness outside of the stability region and consider networks whose topologies do not change with time.…”