On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Hydrogen-bond dynamics near a micellar surface: Origin of the universal slow relaxation at complex aqueous interfaces

The dynamics of hydrogen bonds among water molecules themselves and with the polar head groups (PHG) at a micellar surface have been investigated by long molecular dynamics simulations. The lifetime of the hydrogen bond between a PHG and a water molecule is found to be much longer than that between any two water molecules, and is likely to be a general feature of hydrophilic surfaces of organized assemblies. Analyses of individual water trajectories suggest that water molecules can remain bound to the micellar surface for more than 100 ps. The activation energy for such a transition from the bound to a free state for the water molecules is estimated to be about 3.5 kcal/mol.

An extended Cahn-Hilliard model for interfaces with cubic anisotropy

For studying systems with a cubic anisotropy in interfacial energy sigma, we extend the Cahn-Hilliard model by including in it a fourth-rank term, namely, gamma (ijlm) [partial derivative (2) c/(partial derivativex(i) partial derivativex(j))] [partial derivative (2) c/(partial derivativex(l) partial derivativex(m))]. This term leads to an additional linear term in the evolution equation for the composition parameter field. It also leads to an orientation-dependent effective fourth-rank coefficient gamma ([hkl]) in the governing equation for the one-dimensional composition profile across a planar interface. The main effect of a non-negative gamma ([hkl]) is to increase both sigma and interfacial width w, each of which, upon suitable scaling, is related to gamma ([hkl]) through a universal scaling function. In this model, sigma is a differentiable function of interface orientation (n) over cap, and does not exhibit cusps; therefore, the equilibrium particle shapes (Wulff shapes) do not contain planar facets. However, the anisotropy in the interfacial energy can be large enough to give rise to corners in the Wulff shapes in two dimensions. In particles of finite sizes, the corners become rounded, and their shapes tend towards the Wulff shape with increasing particle size.

Ellipsometry as a Sensitive Technique to Probe film -Substrate Interfaces: Al2O3 on Si(100)

An attempt has been made to study the film-substrate interface by using a sensitive, non- conventional tool. Because of the prospective use of gate oxide in MOSFET devices, we have chosen to study alumina films grown on silicon. Film-substrate interface of alumina grown by MOCVD on Si(100) was studied systematically using spectroscopic ellipsometry in the range 1.5-5.0 eV, supported by cross-sectional SEM, and SIMS. The (ε1,ε2) versus energy data obtained for films grown at 600°C, 700°C, and 750°C were modeled to fit a substrate/interface/film “sandwich”. The experimental results reveal (as may be expected) that the nature of the substrate -film interface depends strongly on the growth temperature. The simulated (ε1,ε2) patterns are in excellent agreement with observed ellipsometric data. The MOCVD precursors results the presence of carbon in the films. Theoretical simulation was able to account for the ellipsometry data by invoking the presence of “free” carbon in the alumina films.

Interfaces In Quasicrystalline Systems

Structural relations between quasicrystalline and related crystalline rational approximant phases have been of interest for some time now. Such relations are now being used to understand interface structures. Interfaces between structural motif - wise related, but dissimilarly periodic phases are expected to show a degree of lattice match in certain directions. Our earlier studies in the Al-Cu-Fe system using the HREM technique has shown this to be true. The structural difference leads to well defined structural ledges in the interface between the icosahedral Al-Cu-Fe phase and the monoclinic Al13Fe4 type phase. In the present paper we report our results on the HREM study of interfaces in Al-Cu-Fe and Al-Pd-Mn systems. The emphasis will be on heterophase interfaces between quasiperiodic and periodic phases, where the two are structurally related. An attempt will be made to correlate the results with calculated lattice projections of the two structures on the grain boundary plane.

Interfaces In Quasicrystalline Systems

Structural relations between quasicrystalline and related crystalline rational approximant phases have been of interest for some time now. Such relations are now being used to understand interface structures. Interfaces between structural motif - wise related, but dissimilarly periodic phases are expected to show a degree of lattice match in certain directions. Our earlier studies in the Al-Cu-Fe system using the HREM technique has shown this to be true. The structural difference leads to well defined structural ledges in the interface between the icosahedral Al-Cu-Fe phase and the monoclinic Al13Fe4 type phase. In the present paper we report our results on the HREM study of interfaces in Al-Cu-Fe and Al-Pd-Mn systems. The emphasis will be on heterophase interfaces between quasiperiodic and periodic phases, where the two are structurally related. An attempt will be made to correlate the results with calculated lattice projections of the two structures on the grain boundary plane.

An Effective Seamless Connectivity Scheme for Ubiquitous Applications

The idea of ubiquity and seamless connectivity in networks is gaining more importance in recent times because of the emergence of mobile devices with added capabilities like multiple interfaces and more processing abilities. The success of ubiquitous applications depends on how effectively the user is provided with seamless connectivity. In a ubiquitous application, seamless connectivity encompasses the smooth migration of a user between networks and providing him/her with context based information automatically at all times. In this work, we propose a seamless connectivity scheme in the true sense of ubiquitous networks by providing smooth migration to a user along with providing information based on his/her contexts automatically without re-registration with the foreign network. The scheme uses Ubi-SubSystems(USS) and Soft-Switches(SS) for maintaining the ubiquitous application resources and the users. The scheme has been tested by considering the ubiquitous touring system with several sets of tourist spots and users.

Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel

The capacity region of a two-user Gaussian Multiple Access Channel (GMAC) with complex finite input alphabets and continuous output alphabet is studied. When both the users are equipped with the same code alphabet, it is shown that, rotation of one of the user’s alphabets by an appropriate angle can make the new pair of alphabets not only uniquely decodable, but will result in enlargement of the capacity region. For this set-up, we identify the primary problem to be finding appropriate angle(s) of rotation between the alphabets such that the capacity region is maximally enlarged. It is shown that the angle of rotation which provides maximum enlargement of the capacity region also minimizes the union bound on the probability of error of the sumalphabet and vice-verse. The optimum angle(s) of rotation varies with the SNR. Through simulations, optimal angle(s) of rotation that gives maximum enlargement of the capacity region of GMAC with some well known alphabets such as M-QAM and M-PSK for some M are presented for several values of SNR. It is shown that for large number of points in the alphabets, capacity gains due to rotations progressively reduce. As the number of points N tends to infinity, our results match the results in the literature wherein the capacity region of the Gaussian code alphabet doesn’t change with rotation for any SNR.

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.

Exploiting Programmable Network Interfaces for Parallel Query Execution in Workstation Clusters

Workstation clusters equipped with high performance interconnect having programmable network processors facilitate interesting opportunities to enhance the performance of parallel application run on them. In this paper, we propose schemes where certain application level processing in parallel database query execution is performed on the network processor. We evaluate the performance of TPC-H queries executing on a high end cluster where all tuple processing is done on the host processor, using a timed Petri net model, and find that tuple processing costs on the host processor dominate the execution time. These results are validated using a small cluster. We therefore propose 4 schemes where certain tuple processing activity is offloaded to the network processor. The first 2 schemes offload the tuple splitting activity - computation to identify the node on which to process the tuples, resulting in an execution time speedup of 1.09 relative to the base scheme, but with I/O bus becoming the bottleneck resource. In the 3rd scheme in addition to offloading tuple processing activity, the disk and network interface are combined to avoid the I/O bus bottleneck, which results in speedups up to 1.16, but with high host processor utilization. Our 4th scheme where the network processor also performs apart of join operation along with the host processor, gives a speedup of 1.47 along with balanced system resource utilizations. Further we observe that the proposed schemes perform equally well even in a scaled architecture i.e., when the number of processors is increased from 2 to 64