Results 1 
4 of
4
Joint congestion control, routing and MAC for stability and fairness in wireless networks
 IEEE Journal on Selected Areas in Communications
, 2006
"... In this work, we describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks, that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue lengths serve as common information to different layers of the ne ..."
Abstract

Cited by 126 (23 self)
 Add to MetaCart
(Show Context)
In this work, we describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks, that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue lengths serve as common information to different layers of the network protocol stack. Our main contribution is to prove the asymptotic optimality of a primaldual congestion controller, which is known to model different versions of TCP well.
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 57 (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.
Randomized Algorithms for ThroughputOptimality and Fairness in Wireless Networks
"... Abstract — In this paper, we study multihop wireless networks with general interference models, and describe a practical randomized routingschedulingcongestioncontrol mechanism that is guaranteed to fully utilize the network capacity, and achieve fair allocation of the resources. Using the frame ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper, we study multihop wireless networks with general interference models, and describe a practical randomized routingschedulingcongestioncontrol mechanism that is guaranteed to fully utilize the network capacity, and achieve fair allocation of the resources. Using the framework described in this paper, low complexity distributed algorithms can be developed for a large class of interference models and fairness criteria (such as proportional and maxmin fairness). Earlier distributed algorithms proposed in this context have been highly interference model dependent, and can guarantee at most 50 % utilization of the achievable throughput. This is the first work that assures 100 % utilization and also provides fair allocation in multihop wireless networks. I.
A Queuelengthbased Randomized Scheduler for Wireless Networks
"... Abstract — Dynamic queuelengthbased schedulers have been shown to maximize the throughput performance of data networks. However, for interferencelimited networks, such as wireless and sensor networks, their implementation is computationally intractable. To resolve this, randomized policies with b ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — Dynamic queuelengthbased schedulers have been shown to maximize the throughput performance of data networks. However, for interferencelimited networks, such as wireless and sensor networks, their implementation is computationally intractable. To resolve this, randomized policies with both centralized and distributed implementations have been studied in the literature. In this paper, we propose and analyze a new randomized policy, called the RANDWEIGHT Scheduling Policy, that reduces the complexity of the scheduling component while providing throughput guarantees for the system. For a bipartite network topology, we study the stability region of our policy and show that under sufficiently symmetric loads the policy is guaranteed to stabilize the network. The policy presented here is centralized, however it is amenable to distributed implementation as discussed in the paper. Moreover, rate control can be jointly implemented with this policy using recent methods proposed in the context of crosslayer network control. I.