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.
Offering throughput guarantees for cellular wireless networks, carrying real-time traffic, is of interest to both the network operators and the customers. Furthermore, to be able to quantify the soft throughput guarantees for a certain scheduling algorithm without conducting experimental investigations, is valuable for network providers. In this paper, we develop an expression for the approximate...
In this paper, we study the performance of opportunistic scheduling in wireless networks from the perspective of information and entropy. In opportunistic scheduling, we allocate a limited number of channels to a certain number of nodes so as to maximize the network performance. Due to the inherent uncertainty of the system input represented by random variables with certain probability distributions,...
In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a large-deviation setting, we are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity. We first derive an upper bound on the decay rate...
In this paper, we study the channel-aware minimum-latency broadcast scheduling problem using the probabilistic model. We establish an explicit relationship between the tolerated transmission-failure probability and the latency of the corresponding broadcast schedule. Such a tolerated transmission-failure probability is calculated in the strict sense that the failure to receive the message at any single...
Real-time applications in wireless networks are emerging in multimedia product and design. However, conventional real-time message scheduling algorithms generally do not take energy efficiency into account when making scheduling decisions. In this paper, I address the issue of scheduling real-time messages in wireless networks subject to timing and power constraints. A novel message scheduling scheme,...
We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access...
In this paper opportunistic scheduling to achieve high throughput, while at the same time satisfy both long-term and short-term users' QoS constraints in wireless networks supporting multimedia services is adopted. This is achieved via the transformation of the corresponding QoS constraints into appropriate probabilities of accessing the systems' recourses. The users' scheduling procedure considering...
In this paper userspsila short-term delay and throughput fundamental properties under basic opportunistic scheduling policies, required to support high throughput wireless communication systems with integrated multimedia services, are studied. Among the objectives of this work is to determine at what extent opportunistic scheduling policies can be used to support real-time services in addition to...
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.