Abstract — We consider a multi-hop 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 one-third of the throughput supportable by any other algorithm, including centralized algorithms
In this work, we describe and analyze a joint scheduling, routing and congestion control mechanism f...
This paper considers optimal cross-layer rate control, scheduling design and power control for multi...
Sharing the locally common spectrum among the links of the same vicinity is a fundamental problem in...
Abstract — We consider a multi-hop wireless network shared by many users. For an interference model ...
Abstract — We consider a multi-hop wireless network shared by many users. For an interference model ...
Abstract — We consider a multi-hop wireless network shared by many users. For an interference model ...
Abstract—We consider a multi-hop wireless network shared by many users. For an interference model th...
We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a ...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.We then consider the problem ...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.We then consider the problem ...
Abstract — We consider the problem of throughput-optimal cross-layer design of wireless networks. We...
Abstract—This paper proposes a new class of simple, dis-tributed algorithms for scheduling in multi-...
Abstract—This paper proposes a new class of simple, dis-tributed algorithms for scheduling in multi-...
Abstract—A joint congestion control, channel allocation and scheduling algorithm for multi-channel m...
This brief proposes that the keys to internet cross-layer optimization are the development of non-st...
In this work, we describe and analyze a joint scheduling, routing and congestion control mechanism f...
This paper considers optimal cross-layer rate control, scheduling design and power control for multi...
Sharing the locally common spectrum among the links of the same vicinity is a fundamental problem in...
Abstract — We consider a multi-hop wireless network shared by many users. For an interference model ...
Abstract — We consider a multi-hop wireless network shared by many users. For an interference model ...
Abstract — We consider a multi-hop wireless network shared by many users. For an interference model ...
Abstract—We consider a multi-hop wireless network shared by many users. For an interference model th...
We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a ...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.We then consider the problem ...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.We then consider the problem ...
Abstract — We consider the problem of throughput-optimal cross-layer design of wireless networks. We...
Abstract—This paper proposes a new class of simple, dis-tributed algorithms for scheduling in multi-...
Abstract—This paper proposes a new class of simple, dis-tributed algorithms for scheduling in multi-...
Abstract—A joint congestion control, channel allocation and scheduling algorithm for multi-channel m...
This brief proposes that the keys to internet cross-layer optimization are the development of non-st...
In this work, we describe and analyze a joint scheduling, routing and congestion control mechanism f...
This paper considers optimal cross-layer rate control, scheduling design and power control for multi...
Sharing the locally common spectrum among the links of the same vicinity is a fundamental problem in...