Results 1 - 10
of
111
Fair Resource Allocation in Wireless Networks using Queue-length-based Scheduling and Congestion Control
"... We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re-ceiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriate ..."
Abstract
-
Cited by 202 (45 self)
- Add to MetaCart
We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re-ceiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriately chosen queue-length based policies are throughput-optimal while other policies based on the estimation of channel statistics can be used to allocate resources fairly (such as proportional fairness) among competing users. In this paper, we show that a combination of queue-length-based scheduling at the base station and congestion control implemented either at the base station or at the end users can lead to fair resource allocation and queue-length stability.
A framework for opportunistic scheduling in wireless networks,”
- Computer Networks,
, 2003
"... Abstract-Scheduling has been extensively studied in various disciplines in operations research and wireline networking. However, the unique characteristics of wireless communication systems -namely, timing-varying channel conditions and multiuser diversity -means that new scheduling solutions need ..."
Abstract
-
Cited by 167 (8 self)
- Add to MetaCart
(Show Context)
Abstract-Scheduling has been extensively studied in various disciplines in operations research and wireline networking. However, the unique characteristics of wireless communication systems -namely, timing-varying channel conditions and multiuser diversity -means that new scheduling solutions need to be developed that are specifically tailored for this environment. In this paper, we summarize various opportunistic scheduling schemes that exploit the time-varying nature of the radio environment to improve the spectrum efficiency while maintaining a certain level of satisfaction for each user. We also discuss the advantages and costs associated with opportunistic scheduling, and identify possible future research directions.
Dominant resource fairness: Fair allocation of multiple resource types
, 2011
"... We consider the problem of fair resource allocation in a system containing different resource types, where each user may have different demands for each resource. To address this problem, we propose Dominant Resource Fairness (DRF), a generalization of max-min fairness to multiple resource types. We ..."
Abstract
-
Cited by 146 (15 self)
- Add to MetaCart
(Show Context)
We consider the problem of fair resource allocation in a system containing different resource types, where each user may have different demands for each resource. To address this problem, we propose Dominant Resource Fairness (DRF), a generalization of max-min fairness to multiple resource types. We show that DRF, unlike other possible policies, satisfies several highly desirable properties. First, DRF incentivizes users to share resources, by ensuring that no user is better off if resources are equally partitioned among them. Second, DRF is strategy-proof, as a user cannot increase her allocation by lying about her requirements. Third, DRF is envyfree, as no user would want to trade her allocation with that of another user. Finally, DRF allocations are Pareto efficient, as it is not possible to improve the allocation of a user without decreasing the allocation of another user. We have implemented DRF in the Mesos cluster resource manager, and show that it leads to better throughput and fairness than the slot-based fair sharing schemes in current cluster schedulers. 1
Opportunistic Splitting Algorithms For Wireless Networks
, 2004
"... In this paper, we develop medium access control protocols to enable users in a wireless network to opportunistically transmit when they have favorable channel conditions, without requiring a centralized scheduler. We consider approaches that use splitting algorithms to resolve collisions over a sequ ..."
Abstract
-
Cited by 88 (2 self)
- Add to MetaCart
In this paper, we develop medium access control protocols to enable users in a wireless network to opportunistically transmit when they have favorable channel conditions, without requiring a centralized scheduler. We consider approaches that use splitting algorithms to resolve collisions over a sequence of mini-slots, and determine the user with the best channel. First, we present a basic algorithm for a system with i.i.d. block fading and a fixed number of backlogged users. We give an analysis of the throughput of this system and show that the average number of mini-slots required to find the user with the best channel is less than 2.5 independent of the number of users or the fading distribution. We then extend this algorithm to a channel with memory and also develop a reservation based scheme that offers improved performance as the channel memory increases. Finally we consider a model with random arrivals and propose a modified algorithm for this case. Simulation results are given to illustrate the performance in each of these settings.
A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad Hoc Wireless Networks
- In Proceedings of IEEE INFOCOM
, 2007
"... Abstract — The capacity of ad hoc wireless networks can be substantially increased by equipping each network node with multiple radio interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channelassignment, and routing algorithms are required to fully utilize the ..."
Abstract
-
Cited by 81 (0 self)
- Add to MetaCart
(Show Context)
Abstract — The capacity of ad hoc wireless networks can be substantially increased by equipping each network node with multiple radio interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channelassignment, and routing algorithms are required to fully utilize the increased bandwidth in multi-channel multi-radio ad hoc networks. In this paper, we develop a fully distributed algorithm that jointly solves the channel-assignment, scheduling and routing problem. Our algorithm is an online algorithm, i.e., it does not require prior information on the offered load to the network, and can adapt automatically to the changes in the network topology and offered load. We show that our algorithm is provably efficient. That is, even compared with the optimal centralized and offline algorithm, our proposed distributed algorithm can achieve a provable fraction of the maximum system capacity. Further, the achievable fraction that we can guarantee is larger than that of some other comparable algorithms in the literature. I.
Cell-Throughput Analysis of the Proportional Fair Scheduler in the Single-Cell Environment
- IEEE Trans. Veh. Technol
, 2007
"... Abstract. The fairness concept has been widely studied in the area of data networks. The most well-known fairness criterion, max-min fairness, gives priority to the minimum rate session. Kelly questioned its appropriateness in his works on the bandwidth sharing among the end-to-end flows and propos ..."
Abstract
-
Cited by 63 (6 self)
- Add to MetaCart
(Show Context)
Abstract. The fairness concept has been widely studied in the area of data networks. The most well-known fairness criterion, max-min fairness, gives priority to the minimum rate session. Kelly questioned its appropriateness in his works on the bandwidth sharing among the end-to-end flows and proposed another fairness criterion preferring short distance flows to enhance the overall throughput, which is called the proportional fairness (PF). A simple scheduler achieving this objective was introduced in wireless access networks and revealed that it can achieve a good compromise between cell throughput and user fairness. Though it has received much attention for some time, research on its performance mainly depended on computer simulations. In this paper, we analyze the PF scheduler to obtain the cell throughput which is a primary performance metric.
Opportunistic spectral usage: Bounds and a multi-band CSMA/CA protocol
- IEEE/ACM Transactions on Networking
, 2006
"... Abstract — In this paper, we study the gains from opportunistic spectrum usage when neither sender or receiver are aware of the current channel conditions in different frequency bands. Hence to select the best band for sending data, nodes first need to measure the channel in different bands which ta ..."
Abstract
-
Cited by 63 (1 self)
- Add to MetaCart
(Show Context)
Abstract — In this paper, we study the gains from opportunistic spectrum usage when neither sender or receiver are aware of the current channel conditions in different frequency bands. Hence to select the best band for sending data, nodes first need to measure the channel in different bands which takes time away from sending actual data. We analyze the gains from opportunistic band selection by deriving an optimal skipping rule, which balances the throughput gain from finding a good quality band with the overhead of measuring multiple bands. We show that opportunistic band skipping is most beneficial in low signal to noise scenarios, which are typically the cases when the node throughput in single-band (no opportunism) system is the minimum. To study the impact of opportunism on network throughput, we devise a CSMA/CA protocol, Multiband Opportunistic Auto Rate (MOAR), which implements the proposed skipping rule on a per node pair basis. The proposed protocol exploits both time and frequency diversity, and is shown to result in typical throughput gains of 20% or more over a protocol which only exploits time diversity, Opportunistic Auto Rate (OAR). I.
MOAR: A Multi-channel Opportunistic Auto-rate Media Access Protocol for Ad Hoc Networks
"... The IEEE 802.11 wireless media standard supports multiple frequency channels as well as multiple data rates at the physical (PHY) layer. Moreover, various auto rate adaptation mechanisms at the medium access layer have been proposed to exploit the multi-rate capabilities of IEEE 802.11. In this pape ..."
Abstract
-
Cited by 39 (1 self)
- Add to MetaCart
The IEEE 802.11 wireless media standard supports multiple frequency channels as well as multiple data rates at the physical (PHY) layer. Moreover, various auto rate adaptation mechanisms at the medium access layer have been proposed to exploit the multi-rate capabilities of IEEE 802.11. In this paper we introduce Multichannel Opportunistic Auto Rate (MOAR), an enhanced MAC protocol for multi-channel and multi-rate IEEE 802.11 enabled wireless ad hoc networks to opportunistically exploit the presence of frequency diversity (in the form of multiple frequency channels). The key mechanism of MOAR is that if the signal to noise ratio on the current channel is not favorable, mobile nodes can opportunistically skip to better quality frequency channels enabling data transmission at a higher rate. As channel separation for IEEE 802.11 is greater than the coherence bandwidth, different channels experience independent fading and hence there is a high probability that the skipping nodes will find better channel conditions on one of the other frequency channels. Consequently MOAR nodes exploit the presence of frequency domain diversity in a distributed manner to transmit packets at a higher rate (on higher quality channels) resulting in an enhanced net system throughput for MOAR. In theory, nodes can skip indefinitely in search of a better channel until the highest possible transmission rate is found, yet, as channel state information is not available a priori, each skip decision incurs an additional overhead due to channel measurement. Thus, in order to maximize the gain in throughput it is critical to balance the tradeoff between additional throughput gain via channel skipping and the time and resource costs of channel measurement and skipping. Consequently, we devise an optimal s...
Distributed approaches for exploiting multiuser diversity in wireless networks
- IEEE Transactions on Information Theory
, 2006
"... In wireless fading channels, multiuser diversity can be exploited by scheduling users so that they transmit when their channel conditions are favorable. This leads to a sum throughput that increases with the number of users and, in certain cases, achieves capacity. However, such scheduling requires ..."
Abstract
-
Cited by 32 (2 self)
- Add to MetaCart
(Show Context)
In wireless fading channels, multiuser diversity can be exploited by scheduling users so that they transmit when their channel conditions are favorable. This leads to a sum throughput that increases with the number of users and, in certain cases, achieves capacity. However, such scheduling requires global knowledge of every user’s channel gain, which may be difficult to obtain in some situations. This paper addresses contention-based protocols for exploiting multiuser diversity with only local channel knowledge. A variation of the classic ALOHA protocol is given in which users attempt to exploit multi-user diversity gains, but suffer contention losses due to the distributed channel knowledge. We characterize the growth rate of the sum throughput for this protocol in a backlogged system under both short-term and long-term average power constraints. A simple “fixed-rate ” system is shown to be asymptotically optimal and to achieve the same growth rate as in a system with a centralized scheduler. Moreover, asymptotically, the fraction of throughput lost due to contention is shown to be 1/e. Also, in a system with random arrivals and an infinite user population, a variation of this ALOHA protocol is shown to be stable for any total arrival rate, given that users can estimate the backlog. I.
Multicast algorithms for multi-channel wireless mesh networks
- in Network Protocols, 2007. ICNP 2007. IEEE International Conference on
, 2007
"... Abstract — Multicast is a key technology that provides efficient data communication among a set of nodes for wireless multi-hop networks. In sensor networks and MANETs, multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, respectively. H ..."
Abstract
-
Cited by 29 (1 self)
- Add to MetaCart
(Show Context)
Abstract — Multicast is a key technology that provides efficient data communication among a set of nodes for wireless multi-hop networks. In sensor networks and MANETs, multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, respectively. However, in wireless mesh networks, which are required to provide high quality service to end users as the “last-mile ” of the Internet, throughput maximization conflicting with scarce bandwidth has the paramount priority. We propose a Level Channel Assign-ment (LCA) algorithm and a Multi-Channel Multicast (MCM) algorithm to optimize throughput for multi-channel and multi-interface mesh networks. The algorithms first build a multicast structure by minimizing the number of relay nodes and hop count distances between the source and destinations, and use dedicated channel assignment strategies to improve the network capacity by reducing interference. We also illustrate that the use of partially overlapping channels can further improve the throughput. Simulations show that our algorithms greatly out-perform the single-channel multicast algorithm. We observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.
