The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The paper characterizes the class of all concave resource allocation problems in interference coupled wireless systems. An axiomatic framework for interference functions proposed by Yates in 1995 is used to model interference coupling in our paper. The paper shows that there exists no transformation, which ensures concavity for all linear interference functions for all functions of SINR. The paper...
This paper investigates the properties of social choice functions, that represent resource allocation strategies in interference coupled wireless systems. The resources can be physical layer parameters such as power vectors or antenna weights. The paper investigates the permissible social choice functions, which can be implemented by a mechanism in either Nash equilibria or dominant strategy - for...
We utilize axiomatic bargaining theory to depict certain implications of continuity properties of resource allocation strategies in wireless systems. Feasible utility sets are characterized as sub-level sets of interference functions. The collective choice function is used to represent resource allocation strategies. We use an axiomatic framework to emulate certain desirable properties of resource...
We propose an individual guarantees approach for comparing resource allocation strategies at the physical layer in wireless systems. For this purpose we utilize the collective choice function to represent resource allocation strategies. We utilize an axiomatic framework to emulate certain desirable and undesirable properties of resource allocation strategies. We utilize basic bargaining sets as a...
In this paper we analyze the structure of certain power-constrained utility sets, based on the axiomatic framework of log-convex interference functions. Log-convex interference functions contain convex and linear interference functions as a special case. We analyze the boundary of the set. It is shown how Pareto optimality of boundary points depends on the interference coupling between the users....
A relay node establishes bidirectional communication between two nodes using a two-phase decode-and-forward protocol. In the first phase nodes 1 and 2 transmit their messages to the relay node, which decodes the messages. In the succeeding phase the relay broadcasts a re-encoded message using the network coding idea so that each node can decode the other's message using its own message as side information...
This paper addresses the problem of incorporating soft and hard QoS support into the traditional utility-based power control problem. We present some novel problem formulations, prove relevant properties of optimal solutions and propose decentralized recursive algorithms with global convergence. Finally, the convergence behavior and the throughput performance are verified numerically.
For comprehensive convex compact positive utility sets, the Nash bargaining solution (NBS) is obtained by maximizing a product of utilities, a strategy which is also known as "proportional fairness". However, the standard assumption of convexity may not be fulfilled. This is especially true for wireless communication systems, where interference and adaptive techniques can lead to complicated...
An iterative algorithm for the multiuser fair scheduling problem of adaptive OFDMA systems is presented. It uses iterative local search with k-opt switches in the combinatorial solution space. The algorithm can be used with different scheduling criteria like proportional fairness and max-min fairness, both for constant and adaptive allocation of power to subcarriers/resource blocks. The algorithm...
The resource allocation problem in wireless systems with full cooperation will be characterized using collective choice functions and an axiomatic framework. The axiomatic framework will be used to characterize different properties of the operating point of resource allocation strategies (e.g. efficiency, robustness). A new axiom of comparability will be introduced and the conditions under which it...
Collective choice functions and an axiomatic framework will be used to characterize the structure of solutions of resource allocation problems on feasible utility sets. Feasible utility sets will be characterized as level sets of general interference functions. General fairness constraints will be introduced and solution outcomes satisfying the properties of efficiency, robustness and fairness will...
Collective choice functions and an axiomatic framework will be utilized to show that, if a wireless operator wants it's resource allocation strategy to satisfy the axioms emulating the properties of efficiency, robustness and stability to varying number of users, then it can only opt for the max-min balancing solution or more specifically the egalitarian solution. For this purpose, feasible utility...
This paper addresses the problem of resource allocation in an interference-coupled wireless network. The Nash bargaining theory is an established framework for analyzing resource allocation problems. But in a wireless context, interference between users can result in a complicated structure of the quality-of-service region, depending on many aspects, like power allocation, signal processing etc. For...
We address the problem of maximizing the minimum signal-to-interference ratio (SIR) in a multiuser system. In the context of resource allocation, this is referred to as max-min fairness. Moreover, the balanced SIR margin is an indicator for feasibility, so the problem also plays a fundamental role for the characterization of the SIR achievable region and related regions. In this paper, we propose...
We consider a multiuser wireless network, where users are coupled by interference. Thus, transmission powers should be optimized jointly with the receive strategy, like beamforming, CDMA, base station assignment, etc. We study the problem of minimizing the total transmission power while maintaining individual QoS values for all users. This problem can be solved by the fixed-point iteration proposed...
We study the quality-of-service (QoS) feasible region of a multiuser system, under the assumption that the QoS is a bijective function of the signal-to-interference ratio (SIR). The inverse function is assumed to be log-convex (e.g. log-SIR). We derive a necessary and sufficient condition for strict convexity of the QoS region. This property holds for the class of log-convex interference functions,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.