Exploring mesh and tree-based multicast. Routing protocols for MANETs

Recently, it became apparent that group-oriented services are one of the primary application classes targeted by MANETs. As a result, several MANET-specific multicast routing protocols have been proposed. Although these protocols perform well under specific mobility scenarios, traffic loads, and network conditions, no single protocol has been shown to be optimal in all scenarios. The goal of this paper is to characterize the performance of multicast protocols over a wide range of MANET scenarios. To this end, we evaluate the performance of mesh and tree-based multicast routing schemes relative to flooding and recommend protocols most suitable for specific MANET scenarios. Based on the analysis and simulation results, we also propose two variations of flooding, scoped flooding and hyper flooding, as a means to reduce overhead and increase reliability, respectively. Another contribution of the paper is a simulation-based comparative study of the proposed flooding variations against plain flooding, mesh, and tree-based MANET routing. In our simulations, in addition to "synthetic" scenarios, we also used more realistic MANET settings, such as conferencing and emergency response.     

Overlap pattern synthesis with an efficient nearest neighbor classifier

Nearest neighbor (NN) classifier is the most popular non-parametric classifier. It is a simple classifier with no design phase and shows good performance. Important factors affecting the efficiency and performance of NN classifier are (i) memory required to store the training set, (ii) classification time required to search the nearest neighbor of a given test pattern, and (iii) due to the curse of dimensionality the number of training patterns needed by it to achieve a given classification accuracy becomes prohibitively large when the dimensionality of the data is high. In this paper, we propose novel techniques to improve the performance of NN classifier and at the same time to reduce its computational burden. These techniques are broadly based on: (i) overlap based pattern synthesis which can generate a larger number of artificial patterns than the number of input patterns and thus can reduce the curse of dimensionality effect, (ii) a compact representation of the given set of training patterns called overlap pattern graph (OLP-graph) which can be incrementally built by scanning the training set only once and (iii) an efficient NN classifier called OLP-NNC which directly works with OLP-graph and does implicit overlap based pattern synthesis. A comparison based on experimental results is given between some of the relevant classifiers. The proposed schemes are suitable for applications dealing with large and high dimensional datasets like those in data mining.     

Investigations on an Axial Flow Fan Stage subjected to Circumferential Inlet Flow Distortion and Swirl

INTRODUCTIONInletfiowdistortionisatermusedtodenotethewriationofflowpropertiesasafunctionofthespa-tialcoordinatesandtime.Thenonuniformityoc-cursinconunonflowpropertiessuchastotalpressure,staticpressure'velocity,temperature,flowangleandgasconstituency.Swirlisthetermusedtodescribetherotationoffiowinrelationtotherotationoftheforor.Swirlmaybegeneratedasaconsequenceofsec-ondaryflowsinducedduetoflowcurvaturesorduetothepresenceofInletGuideVanes(IGV).DistortionandSwirl(inducedduetocurvatureoffl…     

Optimal sequences for CDMA under colored noise: a Schur-saddlefunction property

We consider direct sequence code division multiple access (DS-CDMA), modeling interference from users communicating with neighboring base stations by additive colored noise. We consider two types of receiver structures: first we consider the information-theoretically optimal receiver and use the sum capacity of the channel as our performance measure. Second, we consider the linear minimum mean square error (LMMSE) receiver and use the signal-to-interference ratio (SIR) of the estimate of the symbol transmitted as our performance measure. Our main result is a constructive characterization of the possible performance in both these scenarios. A central contribution of this characterization is the derivation of a qualitative feature of the optimal performance measure in both the scenarios studied. We show that the sum capacity is a saddle function: it is convex in the additive noise covariances and concave in the user received powers. In the linear receiver case, we show that the mini average power required to meet a set of target performance requirements of the users is a saddle function: it is convex in the additive noise covariances and concave in the set of performance requirements     

Vartalaap: A distributed multicast communication system

With the increasing proliferation of computer networks and distributed systems, there is a growing number of applications using multicast communication. This paper presents the Vartalaap system developed at IIT, Bombay. Vartalaap is an hierarchical distributed system for multicast communication over a network, implemented in a hardware-independent fashion. The multicast is achieved without resorting to unnecessary broadcasting of messages over the network. Issues covered in this paper include the primitives for multicast, the multicast model and the system architecture. We discuss the implementation of Vartalaap and compare it with some other systems. We conclude with a discussion on the limitations of the current implementation and directions for future work.     

On the stability of fuzzy systems

Studies the global asymptotic stability of a class of fuzzy systems. It demonstrates the equivalence of stability properties of fuzzy systems and linear time invariant (LTI) switching systems. A necessary and sufficient condition for the stability of such systems are given, and it is shown that under the sufficient condition, a common Lyapunov function exists for the LTI subsystems. A particular case when the system matrices can be simultaneously transformed to normal matrices is shown to correspond to the existence of a common quadratic Lyapunov function. A constructive procedure to check the possibility of simultaneous transformation to normal matrices is provided     

Kinetics of oxidation of pseudocumene in the vapor phase

The kinetics of pseudocumene oxidation in the vapor phase with tin vanadate as catalyst have been studied over the following ranges of the variables: Oxygen concentration, 0.909 to 2.857 mole/m³; pseudocumene concentration, 0.071 to 0.125 mole/m³; temperature, 260 to 320°C; space time, 22.5 to 90 × 10⁴ g. catalyst/mole sec. Oxidation-reduction models have been found to describe the kinetics adequately. The mechanism is found to remain the same throughout the temperature range covered.