Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Opportunistic splitting for scheduling via stochastic approximation

We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Effect of contact at the interface on the compressive properties of fly ash-epoxy composites

Particulate composites based on polymer matrices generally contain fillers, especially those that are abundantly available and are cheaper. The inclusion of these, besides improving the properties, makes the system costwise viable, In the present study, fly ash was tried as a filler in epoxy. The filler particle surfaces were modified using three chemical surface treatment techniques in order to elicit the effect of adhesion at the interface on the mechanical properties of these composites. The compatibilizing of the filler with the use of a silane coupling agent yielded the best compression strength values. Scanning Electron Microscopy (SEM) has been used to characterize and supplement the mechanical test data.

Multipath routing to provide quality of service in mobile ad hoc networks

Because of frequent topology changes and node failures, providing quality of service routing in mobile ad hoc networks becomes a very critical issue. The quality of service can be provided by routing the data along multiple paths. Such selection of multiple paths helps to improve reliability and load balancing, reduce delay introduced due to route rediscovery in presence of path failures. There are basically two issues in such a multipath routing Firstly, the sender node needs to obtain the exact topology information. Since the nodes are continuously roaming, obtaining the exact topology information is a tough task. Here, we propose an algorithm which constructs highly accurate network topology with minimum overhead. The second issue is that the paths in the path set should offer best reliability and network throughput. This is achieved in two ways 1) by choice of a proper metric which is a function of residual power, traffic load on the node and in the surrounding medium 2) by allowing the reliable links to be shared between different paths.

Neural network based optimal routing algorithm for communication networks

This paper presents the capability of the neural networks as a computational tool for solving constrained optimization problem, arising in routing algorithms for the present day communication networks. The application of neural networks in the optimum routing problem, in case of packet switched computer networks, where the goal is to minimize the average delays in the communication have been addressed. The effectiveness of neural network is shown by the results of simulation of a neural design to solve the shortest path problem. Simulation model of neural network is shown to be utilized in an optimum routing algorithm known as flow deviation algorithm. It is also shown that the model will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology. (C) 2002 Elsevier Science Ltd. All rights reserved.

Performance of monolithic and TiB2 reinforced MoSi2 in dry sliding contact with steel

MoSi2 and its composite with TiB2 (10 and 20 wt.%) particulates were synthesized by the hot pressing technique. Dry sliding wear experiments were done on these samples by pin-on-disc method on an EN-24 steel disc. It was observed that the densification and the reinforcement of the matrix are beneficial in reducing the friction and wear Of MoSi2. The tribofilm that was formed during sliding contained both the disc and the pin material. (C) 2002 Elsevier Science B.V. All rights reserved.

Estimation of surface free energy of pyrites by contact angle measurements

The surface properties of coal-pyrite play a major role in determining its separation from coal in processes such as flotation. The solution pH is an important parameter in determining the surface properties of both coal and coal-pyrite such as surface free energy and zeta-potential. In the present investigation, the effect of pH on the surface free energy of pyrites from different sources was studied. The surface free energy of solids is made up of two components, i.e. the dispersive surface free energy and the acid-base interaction energy. Various methods have been used by previous researchers to evaluate these two components for different solids. In the present study, a new approach was developed and used to study the surface free energy of pyrite surfaces. Results indicate that the dispersion surface free energy of various pyrites is independent of pH while the acid-base interaction energy is strongly dependent on the pH. The acid-base interaction energy is different for each pyrite sample and also the change with pH varies with the type of pyrite. Coal-pyrite was found to be more hydrophobic than ore-pyrite which may be attributed to the presence of carbon in coal-pyrites. The acid-base interaction energy varied little with pH for coal pyrites than ore-pyrite. Comparison of acid-base interaction energy with zeta-potential measurements shows a good correlation between the minimum in acid-base interaction energy and the pHpzc.

Reliable Routing in Sensor Networks

In sensor networks, routing algorithms should be designed such that packet losses due to wireless links are reduced.In this paper, we present a ”potential”-based routing scheme to find routes with high packet delivery ratios. The basic idea is to define a scalar potential value at each node in the network and forward data to the neighbour with the highest potential.For a simple 2-relay network, we propose a potential function that takes into account wireless channel state. Markov-chain based analysis provides analytical expressions for packet delivery ratio. Considerable improvement can be observed compared to a channel-state-oblivious policy. This motivates us to define a channel-state-dependent potential function in a general network context. Simulations show that for a relatively slowly changing wireless network, our approach can provide up to 20% better performance than the commonly- used shortest-hop-count-based routing.

Cojoined Irregular Topology and Routing Table Generation for Network-on-Chip

Scalable Networks on Chips (NoCs) are needed to match the ever-increasing communication demands of large-scale Multi-Processor Systems-on-chip (MPSoCs) for multi media communication applications. The heterogeneous nature of application specific on-chip cores along with the specific communication requirements among the cores calls for the design of application-specific NoCs for improved performance in terms of communication energy, latency, and throughput. In this work, we propose a methodology for the design of customized irregular networks-on-chip. The proposed method exploits a priori knowledge of the applications communication characteristic to generate an optimized network topology and corresponding routing tables.

Connectivity-aware Routing in Sensor Networks

Sensor network applications such as environmental monitoring demand that the data collection process be carried out for the longest possible time. Our paper addresses this problem by presenting a routing scheme that ensures that the monitoring network remains connected and hence the live sensor nodes deliver data for a longer duration. We analyze the role of relay nodes (neighbours of the base-station) in maintaining network connectivity and present a routing strategy that, for a particular class of networks, approaches the optimal as the set of relay nodes becomes larger. We then use these findings to develop an appropriate distributed routing protocol using potential-based routing. The basic idea of potential-based routing is to define a (scalar) potential value at each node in the network and forward data to the neighbor with the highest potential. We propose a potential function and evaluate its performance through simulations. The results show that our approach performs better than the well known lifetime maximization policy proposed by Chang and Tassiulas (2004), as well as AODV [Adhoc on demand distance vector routing] proposed by Perkins (1997).

Dynamic contact angle beating from drops impacting onto solid surfaces exhibiting anisotropic wetting

This paper reports an experimental investigation of low Weber number water drops impacting onto solid surfaces exhibiting anisotropic wetting. The wetting anisotropy is created by patterning the solid surfaces with unidirectional parallel grooves. Temporal measurements of impacting drop parameters such as drop base contact diameter, apparent contact angle of drop, and drop height at the center are obtained from high-speed video recordings of drop impacts. The study shows that the impact of low Weber number water drops on the grooved surface exhibits beating phenomenon in the temporal variations of the dynamic contact angle anisotropy and drop height at the center of the impacting drop. It is observed that the beating phenomenon of impacting drop parameters is caused by the frequency difference between the dynamic contact angle oscillations of impacting drop liquid oriented perpendicular and parallel to the direction of grooves on the grooved surface. The primary trigger for the phenomenon is the existence of non-axisymmetric drop flow on the grooved surface featuring pinned and free motions of drop liquid in the directions perpendicular and parallel to the grooves, respectively. The beat frequency is almost independent of the impact drop Weber number. Further experimental measurements with solid surfaces of different groove textures show that the grooved surface with larger wetting anisotropy may be expected to show a dominant beating phenomenon. The phenomenon is gradually damped out with time and is fully unrecognizable at higher drop impact Weber numbers. (C) 2011 Elsevier B.V. All rights reserved.

Opportunistic scheduling of wireless links

We consider the problem of scheduling of a wireless channel (server) to several queues. Each queue has its own link (transmission) rate. The link rate of a queue can vary randomly from slot to slot. The queue lengths and channel states of all users are known at the beginning of each slot. We show the existence of an optimal policy that minimizes the long term (discounted) average sum of queue lengths. The optimal policy, in general needs to be computed numerically. Then we identify a greedy (one step optimal) policy, MAX-TRANS which is easy to implement and does not require the channel and traffic statistics. The cost of this policy is close to optimal and better than other well-known policies (when stable) although it is not throughput optimal for asymmetric systems. We (approximately) identify its stability region and obtain approximations for its mean queue lengths and mean delays. We also modify this policy to make it throughput optimal while retaining good performance.