Results 1  10
of
350
Multiaccess Fading Channels  Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities
 IEEE Trans. Inform. Theory
"... In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the timevarying nature of the environment. In this twopart paper, we consider the problem of optimal resource allocation from an informationtheoretic p ..."
Abstract

Cited by 224 (10 self)
 Add to MetaCart
In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the timevarying nature of the environment. In this twopart paper, we consider the problem of optimal resource allocation from an informationtheoretic point of view. We focus on the multiaccess fading channel with Gaussian noise, and define two notions of capacity depending on whether the traffic is delaysensitive or not. In part I, we characterize the throughput capacity region which contains the longterm achievable rates through the timevarying channel. We show that each point on the boundary of the region can be achieved by successive decoding. Moreover, the optimal rate and power allocations in each fading state can be explicitly obtained in a greedy manner. The solution can be viewed as the generalization of the waterfilling construction for singleuser channels to multiaccess channels with arbitrary number of users, and exploits the underlying polymatroid structure of the capacity region. In part II, we characterize a delaylimited capacity region and obtain analogous results.
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
, 1999
"... We give a strongly polynomialtime algorithm minimizing a submodular function f given by a valuegiving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle ..."
Abstract

Cited by 201 (0 self)
 Add to MetaCart
We give a strongly polynomialtime algorithm minimizing a submodular function f given by a valuegiving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle calls is bounded by a polynomial in the size of the underlying set.
Algorithms in Discrete Convex Analysis
 Math. Programming
, 2000
"... this paper is to describe the f#eA damental results on M and Lconvex f#24L2A+ with special emphasis on algorithmic aspects. ..."
Abstract

Cited by 158 (36 self)
 Add to MetaCart
(Show Context)
this paper is to describe the f#eA damental results on M and Lconvex f#24L2A+ with special emphasis on algorithmic aspects.
Multiaccess Fading Channels  Part II: DelayLimited Capacities
 IEEE Trans. Inform. Theory
"... In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the timevarying nature of the environment. In this twopart paper, we consider the problem of optimal resource allocation from an informationtheoretic p ..."
Abstract

Cited by 89 (3 self)
 Add to MetaCart
In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the timevarying nature of the environment. In this twopart paper, we consider the problem of optimal resource allocation from an informationtheoretic point of view. We focus on the multiaccess fading channel with Gaussian noise, and define two notions of capacity depending on whether the traffic is delaysensitive or not. In Part I, we have analyzed the throughput capacity region which characterizes the longterm achievable rates through the timevarying channel. However, the delay experienced depends on how fast the channel varies. In the present paper, Part II, we introduce a notion of delaylimited capacity which is the maximum rate achievable with delay independent of how slow the fading is. We characterize the delaylimited capacity region of the multiaccess fading channel and the associated optimal resource allocation schemes. We show that successive decoding is optimal, and the optimal decoding order and power allocation can be found explicitly as a function of the fading states; this is a consequence of an underlying polymatroid structure that we exploit.
Balanced Matroids
"... We introduce the notion of "balance", and say that a matroid is balanced if the matroid and all its minors satisfy the property that, for a randomly chosen basis, the presence of an element can only make any other element less likely. We establish strong expansion properties for ..."
Abstract

Cited by 85 (3 self)
 Add to MetaCart
We introduce the notion of &quot;balance&quot;, and say that a matroid is balanced if the matroid and all its minors satisfy the property that, for a randomly chosen basis, the presence of an element can only make any other element less likely. We establish strong expansion properties for the basesexchange graph of balanced matroids; consequently, the set of bases of a balanced matroid can be sampled and approximately counted using rapidly mixing Markov chains. Thus, the general problem of approximately counting bases (known to be #Pcomplete) is reduced to that of showing balance. Specific classes for which balance is known to hold include graphic and regular matroids.
Power Control and Capacity of Spread Spectrum Wireless Networks
 Automatica
, 1999
"... Transmit power control is a central technique for resource allocation and interference management in spreadspectrum wireless networks. With the increasing popularity of spreadspectrum as a multiple access technique, there has been significant research in the area in recent years. While power contr ..."
Abstract

Cited by 77 (5 self)
 Add to MetaCart
(Show Context)
Transmit power control is a central technique for resource allocation and interference management in spreadspectrum wireless networks. With the increasing popularity of spreadspectrum as a multiple access technique, there has been significant research in the area in recent years. While power control has been considered traditionally as a means to counteract the harmful effect of channel fading, the more general emerging view is that it is a flexible mechanism to provide QualityofService to individual users. In this paper, we will review the main threads of ideas and results in the recent development of this area, with a bias towards issues that have been the focus of our own research. For different receivers of varying complexity, we study both questions about optimal power control as well as the problem of characterizing the resulting network capacity. Although spreadspectrum communications has been traditionally viewed as a physicallayer subject, we argue that by suitable abstr...
Classical deterministic complexity of Edmonds’ problem and quantum entanglement
 In Proceedings of the thirtyfifth ACM symposium on Theory of computing
, 2003
"... ..."
A Combinatorial, Strongly PolynomialTime Algorithm for Minimizing Submodular Functions
, 2000
"... algorithm for minimizing submodular functions, answering an open question posed in 1981 by GrStschel, Lovsz, and Schrijver. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
algorithm for minimizing submodular functions, answering an open question posed in 1981 by GrStschel, Lovsz, and Schrijver. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting algorithm runs in time bounded by a polynomial in the size of the underlying set and the largest length of the function value. The paper also presents a strongly polynomialtime version that runs in time bounded by a polynomial in the size of the underlying set independent of the function value.
Minimal EdgeCoverings of Pairs of Sets
, 1995
"... A new minmax theorem concerning bisupermodular functions on pairs of sets is proved. As a special case, we derive an extension of (A. Lubiw's extension of) E. Györi's theorem on intervals, W. Mader's theorem on splitting off edges in directed graphs, J. Edmonds' theorem on matr ..."
Abstract

Cited by 68 (15 self)
 Add to MetaCart
A new minmax theorem concerning bisupermodular functions on pairs of sets is proved. As a special case, we derive an extension of (A. Lubiw's extension of) E. Györi's theorem on intervals, W. Mader's theorem on splitting off edges in directed graphs, J. Edmonds' theorem on matroid partitions, and an earlier result of the first author on the minimum number of new directed edges whose addition makes a digraph kedgeconnected. As another consequence, we solve the corresponding nodeconnectivity augmentation problem in directed graphs.