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.
A key feature of the Long-Term Evolution (LTE) system is that the packet scheduler can make use of the channel quality information (CQI), which is periodically reported by user equipment either in an aggregate form for the whole downlink channel or distinguished for each available subchannel. This mechanism allows for wide discretion in resource allocation, thus promoting the flourishing of several...
The wide flexibility of LTE resource allocation scheme has led to the definition of various schedulers that attempt to maximize the quality of the service offered to the different users, depending on their channel conditions. Unfortunately, providing service guarantees in dynamic channel conditions typically requires a cost in terms of spectral efficiency of the transmission resource allocation. In...
A number of scheduling algorithms for LTE downlink have been proposed and evaluated leveraging the flexibility of the resource allocation in both the time and the frequency domain. However, the existing literature falls short when it comes to schedulers that provide throughput guarantees. In this paper, we contribute to fill this gap by implementing a scheduling algorithm that provides long-term throughput...
In practical wireless networks, the available transmission power and bandwidth are limited resources. Therefore, joint bandwidth and power allocation for wireless multi-user networks is essential in order to improve the network performance. Most of the research has focused on continuous rate, power, and bandwidth allocations in the presence of perfect channel knowledge. However, this is not the case...
In our earlier work, we described an optimization problem and corresponding scheduling algorithm aimed at obtaining maximum throughput guarantees in wireless networks. To further improve the short-term performance, we also proposed two adaptive versions of the optimal algorithm. Results from the simulations showed that the adaptive algorithms perform significantly better than other well-known scheduling...
Specifying exact throughput guarantees in wireless systems, carrying real-time traffic, is in the interest of both the network operators and the customers. Based on our previous work, we formulate an optimization problem that aims at maximizing the throughput guarantees offered in a MIMO broadcast channel. We also propose two scheduling algorithms that make use of orthonormal random beamforming, and...
Offering throughput guarantees for cellular wireless networks, carrying real-time traffic, is of interest to both the network operators and the customers. In this article, we formulate an optimization problem which aims at maximizing the throughput that can be guaranteed to the mobile users. By building on results obtained by Borst and Whiting and by assuming that the distributions of the users' carrier-to-noise...
Offering throughput guarantees for wireless networks is of interest to both the network operators and the customers. In this paper, an optimization problem is formulated which aims at maximizing the throughput that can be guaranteed to the mobile users. Solution to this problem has already been found for users with different channel quality distributions. However, this solution is suboptimal for time-windows...
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.