Search

Your search keyword '"Ghaderi, Javad"' showing total 2 results
Start Over Author "Ghaderi, Javad" Search Limiters Full Text
2 results on '"Ghaderi, Javad"'

1. Flow-Level Stability of Wireless Networks: Separation of Congestion Control and Scheduling.

Author

Ghaderi, Javad, Ji, Tianxiong, and Srikant, R.

Subjects
*STABILITY theory, *WIRELESS communications, *COMPUTER scheduling, *CARRIER sense multiple access, *ALGORITHMS
Abstract

It is by now well-known that wireless networks with file arrivals and departures are stable if one uses $\alpha$-fair congestion control and back-pressure based scheduling and routing. In this paper, we examine whether $\alpha$-fair congestion control is necessary for flow-level stability. We show that stability can be ensured even with very simple congestion control mechanisms, such as a fixed window size scheme which limits the maximum number of packets that are allowed into the ingress queue of a flow. A key ingredient of our result is the use of the difference between the logarithms of queue lengths as the link weights. This result is reminiscent of results in the context of CSMA algorithms, but for entirely different reasons. [ABSTRACT FROM AUTHOR]

Published
2014
Full Text
View/download PDF

2. Hierarchical Cooperation in Ad Hoc Networks: Optimal Clustering and Achievable Throughput.

Author

Ghaderi, Javad, Liang-Liang Xie, and Xuemin (Sherman) Shen

Subjects
*WIRELESS communications, *AD hoc computer networks, *SCALING laws (Statistical physics), *COMMUNICATION, *ATTENUATION (Physics), *MIMO systems
Abstract

For a wireless network with n nodes distributed in an area A, and with n source-destination pairs communicating with each other at some common rate, the hierarchical cooperation scheme proposed in (Ozgur, Leveque, and Tse, 2007) is analyzed and optimized by choosing the number of hierarchical stages and the corresponding cluster sizes that maximize the total throughput. It turns out that increasing the number of stages does not necessarily improve the throughput, and the closed-form solutions for the optimization problem can be explicitly obtained. Based on the expression of the maximum achievable throughput, it is found that the hierarchical scheme achieves a scaling with the exponent depending on n. In addition, to apply the hierarchical cooperation scheme to random networks, a clustering algorithm is developed, which divides the whole network into quadrilateral clusters, each with exactly the number of nodes required. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results