Efficient and Fair Scheduling of Uplink and Downlink in IEEE 802.16 OFDMA Networks

We develop new scheduling algorithms for the IEEE 802.16d OFDMA/TDD based broadband wireless access system, in which radio resources of both time and frequency slots are dynamically shared by all users. Our objective is to provide a fair and efficient allocation to all the users to satisfy their quality of service.

STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH in UMTS Networks

In Universal Mobile Telecommunication Systems (UMTS), the Downlink Shared Channel (DSCH) can be used for providing streaming services. The traffic model for streaming services is different from the commonly used continuously- backlogged model. Each connection specifies a required service rate over an interval of time, k, called the "control horizon". In this paper, our objective is to determine how k DSCH frames should be shared among a set of I connections. We need a scheduler that is efficient and fair and introduce the notion of discrepancy to balance the conflicting requirements of aggregate throughput and fairness. Our motive is to schedule the mobiles in such a way that the schedule minimizes the discrepancy over the k frames. We propose an optimal and computationally efficient algorithm, called STEM+. The proof of the optimality of STEM+, when applied to the UMTS rate sets is the major contribution of this paper. We also show that STEM+ performs better in terms of both fairness and aggregate throughput compared to other scheduling algorithms. Thus, STEM+ achieves both fairness and efficiency and is therefore an appealing algorithm for scheduling streaming connections.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Providing QoS to Real and Data Applications in WiMAX Mesh Networks

We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. We first obtain an optimal and fair routing and scheduling policy for aggregate demands for different source- destination pairs. We then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are modest. We have verified our algorithms via extensive simulations.

The core and shapley value analysis for cooperative formation of procurement networks

Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged We model the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner We first investigate the stability of such networks by examining the conditions under which the core of the game is non-empty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.

Opportunistic Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles

A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention has been given to the design of efficient and fair scheduling schemes that are centrally controlled by a base station (BS) whose decisions depend on the channel conditions reported by each mobile. The BS is the only entity taking decisions in this framework. The decisions are based on the reports of mobiles on their radio channel conditions. In this paper, we study the scheduling problem from a game-theoretic perspective in which some of the mobiles may be noncooperative or strategic, and may not necessarily report their true channel conditions. We model this situation as a signaling game and study its equilibria. We demonstrate that the only Perfect Bayesian Equilibria (PBE) of the signaling game are of the babbling type: the noncooperative mobiles send signals independent of their channel states, the BS simply ignores them, and allocates channels based only on the prior information on the channel statistics. We then propose various approaches to enforce truthful signaling of the radio channel conditions: a pricing approach, an approach based on some knowledge of the mobiles' policies, and an approach that replaces this knowledge by a stochastic approximations approach that combines estimation and control. We further identify other equilibria that involve non-truthful signaling.

Salan: A microprocessor-based medium speed experimental local area network

In this paper the implementation and application of a microprocessor-based medium speed experimental local area network using a coaxial cable transmission medium are dealt with. A separate unidirectional control wire has been used in order to provide a collision-free and fair medium access arbitration. As an application of the network, the design of a packet voice communication system is discussed.

A critical analysis of the shear difference method

The shear difference method which is commonly used for the separation of normal stresses using photoelastic techniques depends on the step-by-step integration of one of the differential equations of equilibrium. It is assumed that the isoclinic and the isochromatic parameters measured by the conventional methods pertain to the state of stress at the midpoint of the light path. In practice, a slice thin enough for the above assumption to be true and at the same time thick enough to give differences in the shear-stress values over the thickness is necessary. The paper discusses the errors introduced in the isoclinic and isochromatic values by the conventional methods neglecting the variation of stresses along the light path. It is shown that while the error introduced in the measurement of the isochromatic parameter may not be serious, the error caused in the isoclinic measurement may lead to serious errors. Since the shear-difference method involves step-by-step integration the error introduced will be of a cumulative nature.

Medium access control schemes for local area networks with multiple priority function

This paper deals with the development and performance evaluation of three modified versions of a scheme proposed for medium access control in local area networks. The original scheme implements a collision-free and fair medium arbitration by using a control wire in conjunction with a data bus. The modifications suggested in this paper are intended to realize the multiple priority function in local area networks.

N. m. r. and infrared spectroscopic studies of hydrogen bonding in hindered alcohols. An instance of a true hydrogen bonded dimer in an alcohol

Hydrogen bonding in the highly hindered alcohol 2,4-dimethyl-3-ethyl-3-pentanol has been studied by proton n.m.r. and infrared spectroscopy. This alcohol associates to form a dimer but no higher hydrogen bonded species; hence the monomer–dimer equilibrium can be studied without interference from competing processes. Spectral and thermodynamic properties for the hydrogen bonding are reported.

Fracture process zone size and true fracture energy of concrete using acoustic emission

Acoustic emission (AE) energy, instead of amplitude, associated with each of the event is used to estimate the fracture process zone (FPZ) size. A steep increase in the cumulative AE energy of the events with respect to time is correlated with the formation of FPZ. Based on the AE energy released during these events and the locations of the events, FPZ size is obtained. The size-independent fracture energy is computed using the expressions given in the boundary effect model by least squares method since over-determined system of equations are obtained when data from several specimens are used. Instead of least squares method a different method is suggested in which the transition ligament length, measured from the plot of histograms of AE events plotted over the un-cracked ligament, is used directly to obtain size-independent fracture energy. The fracture energy thus calculated seems to be size-independent.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.