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.
We introduce the problem of joint routing, scheduling and power control for multiple information flows in half-duplex, interference limited ad-hoc networks. The joint problem of optimizing for throughput is NP-Hard, and so we present an approximation of the problem and a general framework for solving it in O(N3) time. We attack the problem in two ways, first by presenting a reformulation and decomposition...
DSA (dynamic spectrum allocation) techniques are very challenging when the quality of service has to be guaranteed in a flexible spectrum situation. In this paper, we present and analyze DSA policies for packet services in cellular context. A centralized model, where a meta-operator shares a common spectrum among different operators, is considered. We focus on two criteria for the policies design:...
All opportunistic scheduling algorithms solve simpler optimization problems at each scheduling instance in order to achieve good long-term performance. The analysis of these algorithms assumes that the simpler optimization problems are solved exactly. However, in contrast, real-life implementations only approximately solve these problems but still yield close to optimal performance. We formalize this...
In this paper, we study the problem of optimizing the throughput for micro-factories subject to failures. The challenge consists in mapping several tasks onto a set of machines. The originality of our approach is the failure model for such applications in which tasks are subject to failures rather than machines. If there is exactly one task per machine in the mapping, then we prove that the optimal...
We consider the problem of maximizing the weighted sum data rate in multi-cell and multi-carrier wireless data systems in the presence of interference. We present a scheme that jointly considers load balancing, user scheduling, and interference mitigation to improve the system performance. Our proposed scheme iteratively applies two processes. The first process solves the sub-problem of load balancing...
This paper proposes a rate allocation scheme for throughput maximization considering rate fairness in wireless relay systems. The throughput maximization problem is formulated to two link data rate balancing problems: global balancing and local balancing. And the rate fairness is converted to data rate balancing of each destinations. Based on this, we construct a feasible rate region (FRR) which is...
Orthogonal frequency division multiple access (OFDMA) is the access technique adopted in the new generation wireless networks such as WiMAX. In this paper, we consider resource allocation of OFDMA in time division duplex (TDD) mode in which the new transmission frame with multiple time slots is popped up on every pre-specified period. Frame resource is divided into chunks that are composed of a group...
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.