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 receiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropri-ately 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.

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

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.

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.

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.

In this paper, we present an opportunistic power scheduling scheme, i.e., a joint time-slot and power allocation scheme for downlink communication in wireless systems. Unlike past works, we allow multiple transmissions in a time-slot that could potentially interfere with each other. These multiple transmissions are allowed to achieve high system efficiency. Hence, it is important to not only select the mobiles to be sched-uled in a time-slot, but also to allocate an appropriate transmission power level to these scheduled mobiles. We model the time-varying wireless channel as a stochastic process and formulate a stochastic optimization problem that attempts to maximize the expected total system utility with general constraints on performance or fairness. The power scheduling algorithm is obtained by using stochastic duality and implemented via stochastic subgradient techniques. I.

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...

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.

Abstract — A cross-layer packet scheduling scheme that streams pre-encoded video over wireless down-link packet access networks to multiple users is presented. The scheme can be used with the emerging wireless standards such as HSDPA and IEEE 802.16. A gradient based scheduling scheme is used in which user data rates are dynamically adjusted based on channel quality as well as the gradients of a utility function. The user utilities are designed as a function of the distortion of the received video. This enables distortion-aware packet scheduling both within and across multiple users. The utility takes into account decoder error concealment, an important component in deciding the received quality of the video. We consider both simple and complex error conceal-ment techniques. Simulation results show that the gradient based scheduling framework combined with This work was supported by the Motorola Center for Seam-

Abstract — In this paper using a utility-based approach, downlink packet transmission in a CDMA/TDMA cellular network is formulated as an optimization problem. A utility function corresponds to each packet served by a base-station that is an increasing function of the packet experienced delay and the channel gain, and a decreasing function of the base-station load. Unlike previous works, in this paper, the optimization objective is to maximize the total network utility instead of the base-station utility. We show that this optimization results in joint base-station assignment and packet scheduling. Therefore, in addition to multi-user diversity, the proposed method also exploits multi-access-point diversity and soft capacity. A polynomial time heuristic algorithm is then proposed to solve the optimization problem. Simulation results indicate a significant performance improvement in terms of packet-drop-ratio and achieved throughput. I.