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 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...
Recently, interest has arisen in use of realistic interference models for transmission scheduling in wireless multihop networks, particularly in mesh networks where throughput is a major concern. In this work, we use the SINR-based physical interference model and develop a uniform framework for transmission scheduling when diverse wireless resources can be exploited. The factors considered are multiple...
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...
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.