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.
In this paper, we propose a new approach for the partitioned Earliest Deadline First (EDF) scheduling of sporadic task systems. We consider the case of constrained task deadlines where the deadlines of the tasks are less than or equal to their periods. We introduce the concept of the EDF norm, for defining the space of WCET values that result in schedulable systems given fixed periods and relative...
In this paper we introduce a cooperative game based on the minimum cut tree problem which is also known as multi-terminal maximum flow problem. In a routing situation a network with capacities induced by vertices of a coalition has to be substituted by a network providing the same capacity for non-simultaneous flows but having a minimum number of edges and minimum total capacity. The solutions to...
This paper addresses the problem of resource allocation for orthogonal frequency division multiple access (OFDMA) downlink that aims at minimizing the total transmission power under data transmission constraints. To accelerate this multiuser resource allocation with small performance loss, an efficient technique is introduced that provides the power variation of single-user water-filling when the...
In this paper, we consider the single frequency network (SFN) operation of broadcast/multicast services, and develop resource allocation schemes to minimize the amount of resource over-provisioning. Over-provisioning is required when SFN areas are overlapping because all the cells in the SFN area should use the same resource to transmit a given MBMS service. We first develop an optimal resource allocation...
In this paper, the problem of path planning for a ground search unit looking for an object of unknown location is considered. As in the classical optimal searcher path problem, the probability of finding the search object is the main criterion of optimality and the search unit is constrained by the environment topology that influences its choices for a navigable path as well as its detection capabilities...
Multi-Robot Task Allocation (MRTA) systems have been thoroughly studied by the robotic community in the last decade, with the purpose of creating systems that can solve real problems with good results. Most MRTA architectures consider non-variable utility measures to value task execution payoff. However, in realistic settings there are problems such as tasks having priority and time lifespan, that...
Distributed resource allocation is an important problem in wireless ad hoc networks, in which there is no centralized scheduler and the resource allocation is carried out in a distributed way. Information exchange in the distributed resource allocation incurs overhead since it does not convey data information. The communication complexity, defined as the minimum number of exchanged messages needed...
Finding the matrix with the maximum singular value amongst a set of matrices is a common problem occurring in transmit signal processing algorithms for multiuser multiple-input multiple-output (MIMO) systems. However, computing the principal singular value of a matrix is a rather numerically complex task. Furthermore, in many practical scenarios, the number of users is large and for each user this...
In this paper, we propose a robust STBC transmission scheme to combat the timing synchronization errors over frequency-selective multiple-access channels. First, the equivalent channel model in the presence of timing synchronization errors is derived and we find that the synchronization errors result in an equivalent channel model with larger number of correlated channel taps. Based on this correlated...
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.