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.
Providing ubiquitous very high data rate coverage in next generation wireless networks is a formidable goal, requiring cost-effective radio access network (RAN) devices, such as multi-user enabled amplify- and-forward (AF) relays, and fair radio resource management (RRM). To further this goal, we investigate multi-user enabled AF relays which multiplex user's data in orthogonal frequency division...
We study the NP-hard problem of scheduling and power control with quality-of-service (QoS) constraints. We consider a generic wireless network comprising K mutually interfering links and N < K orthogonal time or frequency slots. We formulate the joint resource allocation problem as a constrained optimization problem, specifically, as a mixed-integer programming (MIP) problem. This enables us to...
In this paper, we consider joint end-to-end congestion control and multiuser scheduling in multi-hop wireless networks, where orthogonal frequency-division multiple access (OFDMA) is the air interface. Compared to its single-channel counterpart, this problem is significantly more challenging because subchannel assignment and power allocation for all nodes and network traffic need to be jointly optimized...
This paper studies how to design distributed resource allocation in multi-radio multi-channel wireless mesh networks with the objective of maximizing the network utility. We address the problem via a cross-layer approach with a joint consideration of multi-path routing, congestion control, scheduling, radio allocation and channel assignment. The problem is formulated as a mixed-integer non-linear...
Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiprocessor System-on-chip (MPSoC) platforms. In this work we focus on an off-line (design-time) version of this problem, where the target task graph is known before execution time. We address the issue of scheduling robustness, i...
The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the controller synthesis. Evolutionary algorithms have been effectively applied to high level synthesis in presence conflicting design objectives for finding good tradeoffs in the design space. However, so far the design space exploration...
Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the nodes. Among the many reasons behind the importance of efficiently determining the membership of an arbitrary rate vector in the feasibility region, is its high relevance in optimal cross layer design. A key feature in a wireless...
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.