Results 11  20
of
202
Joint asynchronous congestion control and distributed scheduling for multihop wireless networks
 in the Proceedings IEEE Infocom
"... Abstract — We consider a multihop wireless network shared by many users. For an interference model that only constrains a node to either transmit or receive at a time, but not both, we propose an architecture for fair resource allocation that consists of a distributed scheduling algorithm operating ..."
Abstract

Cited by 60 (16 self)
 Add to MetaCart
(Show Context)
Abstract — We consider a multihop wireless network shared by many users. For an interference model that only constrains a node to either transmit or receive at a time, but not both, we propose an architecture for fair resource allocation that consists of a distributed scheduling algorithm operating in conjunction with an asynchronous congestion control algorithm. We show that the proposed joint congestion control and scheduling algorithm supports at least onethird of the throughput supportable by any other algorithm, including centralized algorithms. I.
Polynomial complexity algorithms for full utilization of multihop wireless networks
"... In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multihop wireless networks. In particular, we develop a generic randomized routing, scheduling and flow control scheme that is applicable to a large class o ..."
Abstract

Cited by 58 (15 self)
 Add to MetaCart
(Show Context)
In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multihop wireless networks. In particular, we develop a generic randomized routing, scheduling and flow control scheme that is applicable to a large class of interference models. We prove that any algorithm which satisfies the conditions of our generic scheme maximizes network throughput and utilization. Then, we focus on a specific interference model, namely the twohop interference model, and develop distributed algorithms with polynomial communication and computation complexity. This is an important result given that earlier throughputoptimal algorithms developed for such a model relies on the solution to an NPhard problem. To the best of our knowledge, this is the first polynomial complexity algorithm that guarantees full utilization in multihop wireless networks. We further show that our algorithmic approach enables us to efficiently approximate the capacity region of a multihop wireless network.
Novel architectures and algorithms for delay reduction in backpressure scheduling and routing
 Proceedings of IEEE INFOCOM 2009 MiniConference
, 2009
"... The backpressure algorithm is a wellknown throughputoptimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network capacity due to the following two reasons. First, each node has to maintain a separate queue for each commodity in the network ..."
Abstract

Cited by 58 (3 self)
 Add to MetaCart
(Show Context)
The backpressure algorithm is a wellknown throughputoptimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network capacity due to the following two reasons. First, each node has to maintain a separate queue for each commodity in the network, and only one queue is served at a time. Second, the backpressure routing algorithm may route some packets along very long routes. In this paper, we present solutions to address both of the above issues, and hence, improve the delay performance of the backpressure algorithm. One of the suggested solutions also decreases the complexity of the queueing data structures to be maintained at each node. I.
Endtoend bandwidth guarantees through fair local spectrum share in wireless ad hoc networks
 Proc. Control and Decision Conference (CDC) 2003
"... 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 m ..."
Abstract

Cited by 54 (6 self)
 Add to MetaCart
(Show Context)
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 pubspermissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Joint scheduling and congestion control in mobile adhoc networks. http://cm.belllabs.com/who/andrews/pub.html
"... Abstract — In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presen ..."
Abstract

Cited by 51 (4 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differentialbacklog scheduling algorithms with utilitybased congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: • We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. • We describe a wireless Greedy Primal Dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. • We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. • We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program. I.
Order optimal delay for opportunistic scheduling in multiuser wireless uplinks and downlinks
 Proc. of Allerton Conf. on Communication, Control, and Computing (invited paper
, 2006
"... Abstract — We consider a onehop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of scheduling algorithms that do not consider queue backlog necessarily incur average delay that grows at least linearly wi ..."
Abstract

Cited by 45 (6 self)
 Add to MetaCart
Abstract — We consider a onehop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of scheduling algorithms that do not consider queue backlog necessarily incur average delay that grows at least linearly with N. We then construct a dynamic queuelength aware algorithm that stabilizes the system and achieves an average delay that is independent of N. This is the first analytical demonstration that O(1) delay is achievable in such a multiuser wireless setting. The delay bounds are achieved via a technique of queue grouping together with basic Lyapunov stability and statistical multiplexing concepts.
Distributed random access algorithm: Scheduling and congestion control
 IEEE TRANS. INFORM. THEORY
, 2009
"... This paper provides proofs of the rate stability, Harris recurrence, and εoptimality of CSMA algorithms where the backoff parameter of each node is based on its backlog. These algorithms require only local information and are easy to implement. The setup is a network of wireless nodes with a fixed ..."
Abstract

Cited by 43 (13 self)
 Add to MetaCart
(Show Context)
This paper provides proofs of the rate stability, Harris recurrence, and εoptimality of CSMA algorithms where the backoff parameter of each node is based on its backlog. These algorithms require only local information and are easy to implement. The setup is a network of wireless nodes with a fixed conflict graph that identifies pairs of nodes whose simultaneous transmissions conflict. The paper studies two algorithms. The first algorithm schedules transmissions to keep up with given arrival rates of packets. The second algorithm controls the arrivals in addition to the scheduling and attempts to maximize the sum of the utilities of the flows of packets at the different nodes. For the first algorithm, the paper proves rate stability for strictly feasible arrival rates and also Harris recurrence of the queues. For the second algorithm, the paper proves the ǫoptimality. Both algorithms operate with strictly local information in the case of decreasing step sizes, and operate with the additional information of the number of nodes in the network in the case of constant step size.
Efficient algorithms for renewable energy allocation to delay tolerant consumers
 in Proc. IEEE SmartGridComm
, 2010
"... ar ..."
(Show Context)
SuperFast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
, 2006
"... We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data and makes flow control, routing, and resource allocation decisions to maximize a fairness metric based on a concave utilit ..."
Abstract

Cited by 34 (17 self)
 Add to MetaCart
(Show Context)
We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data and makes flow control, routing, and resource allocation decisions to maximize a fairness metric based on a concave utility function of network throughput. A simple set of algorithms are constructed that yield total utility within O(1/V) of the utilityoptimal operating point, for any control parameter V> 0, with a corresponding endtoend network delay that grows only logarithmically in V. This is the first algorithm to achieve such “superfast” performance. Furthermore, we show that this is the best utilitydelay tradeoff possible. This work demonstrates that the problem of maximizing throughput utility in a data network is fundamentally different than related problems of minimizing average power expenditure, as these latter problems cannot achieve such performance tradeoffs.
Predictable Performance Optimization for Wireless Networks
, 2008
"... We present a novel approach to optimize the performance of IEEE 802.11based multihop wireless networks. A unique feature of our approach is that it enables an accurate prediction of the resulting throughput of individual flows. At its heart lies a simple yet realistic model of the network that cap ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
We present a novel approach to optimize the performance of IEEE 802.11based multihop wireless networks. A unique feature of our approach is that it enables an accurate prediction of the resulting throughput of individual flows. At its heart lies a simple yet realistic model of the network that captures interference, traffic, and MACinduced dependencies. Unless properly accounted for, these dependencies lead to unpredictable behaviors. For instance, we show that even a simple network of two links with one flow is vulnerable to severe performance degradation. We design algorithms that build on this model to optimize the network for fairness and throughput. Given traffic demands as input, these algorithms compute rates at which individual flows must send to meet the objective. Evaluation using a multihop wireless testbed as well as simulations show that our approach is very effective. When optimizing for fairness, our methods result in close to perfect fairness. When optimizing for throughput, they lead to 100200 % improvement for UDP traffic and 1050 % for TCP traffic.