Why does it pay to be selfish in a MANET?

Routing protocols for a mobile ad hoc network have assumed that all mobile nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all MNs in a MANET belonged to a single authority. In the near future, however, a MANET may consist of MNs that belong to many different organizations since numerous civilian applications are expected to crop up. In this situation, some MNs may run independently and purposely decide not to forward packets so as to save their own energy. This could potentially lead to network partitioning and corresponding performance degradation. To minimize such situations in MANETs, many studies have explored the use of both the carrot and the stick approaches by having reputation-based, credit-payment, and game theory schemes. This article summarizes existing schemes, identifies their relative advantages, and projects future directions     

Characterization of Mixed Neodymium Lanthanum Heptamolybdate Crystals Grown by Gel Encapsulation Technique

Crystals of mixed NdLa heptamolybdates (max. size0.75×0.75×0.75 mm3) grown by silica gel technique were characterized using EDAX, IR, optical and scanning electron micrscopies.X-ray as well as electrn diffraction. The composition of the crystals was determined as (Nd1/2 La1/2 )2 Mo7O24·35H2O.The crystals exhibit varied morpholgies including square and octagonal platelets, cuboids, multifaceted crystal in coalesced and aggregated forms and spherulites.The XRD results indicate crystallinity of the grown material. Electron diffraction results suggest thermal instability of the material. IR results show the presence of peaks due to water and metal-oxygen bonds     

ROLE OF COMPOSITION ON THE VISCOSITY AND SHEAR STRESS TEMPERATURE BEHAVIOUR OF SOME LUBE OIL BASE STOCKS

Lubricating oil base stocks differ greatly in their chemical composition and consequently in their physical properties and applications. Influence of waxes and various hydrocarbon type constituents viz saturates and aromatic components on the viscosity and shear stress as a function of temperature in different lube oil base stocks has been studied in the present paper.     

Multishell Carrier Transport in Multiwalled Carbon Nanotubes

Understanding carrier transport in carbon nanotubes (CNTs) and their networks is important for harnessing CNTs for device applications. Here, we report multishell carrier transport in individual multiwalled CNTs, and films of randomly dispersed multiwalled CNTs, as a function of electric field and temperature. Electrical measurements and first-principles density functional theory calculations indicate transport across CNT shells. Intershell conduction occurs across an energy barrier range of 60-250 meV in individual CNTs, and ~ 60 meV in CNT networks. In both cases, the conductance behavior can be explained based upon field-enhanced carrier injection and defect-enhanced transport, as described by the Poole-Frenkel model.     

Feedback-based flow control of B-ISDN/ATM networks

We consider a system comprising of a single bottleneck switch/node that is fed by N independent Markov-modulated fluid sources. There is a fixed propagation delay incurred by the traffic between these sources and the switch. We assume that the switch sends periodic feedback in the form of a single congestion indicator bit. This feedback also incurs a fixed propagation delay in reaching the sources. Upon reaching the sources (or the access controllers associated with the sources), this congestion indicator bit is used to choose between two rates for the excess traffic, high or low, possibly depending on the state of that source. The switch employs a threshold mechanism based on its buffer level to discard excess traffic. We show that the stationary distribution of this system satisfies a set of first-order linear differential equations along with a set of split boundary conditions. We obtain an explicit solution to these using spectral decomposition. To this end we investigate the related eigenvalue problem. Based on these results we investigate the role of delayed feedback vis-a-vis various time-constants and traffic parameters associated with the system. In particular, we identify conditions under which the feedback scheme offers significant improvement over the open-loop scheme     

Modular synchronization in distributed, multiversion databases:version control and concurrency control

A version control mechanism is proposed that enhances the modularity and extensibility of multiversion concurrency control algorithms. The multiversion algorithms are decoupled into two components: version control and concurrency control. This permits modular development of multiversion protocols and simplifies the task of proving the correctness of these protocols. A set of procedures for version control is described that defines the interface with the version control component. It is shown that the same interface can be used by the database actions of both two-phase locking and time-stamp concurrency control protocols to access multiversion data. An interesting feature of the framework is that the execution of read-only transactions becomes completely independent of the underlying concurrency control implementation. Unlike other multiversion algorithms, read-only transactions in this scheme do not modify any version-related information, and therefore do not interfere with the execution of read-write transactions. The extension of the multiversion algorithms to a distributed environment becomes very simple     

Energy minimization and design for testability

The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.     

Joint noncoherent demodulation and decoding for the block fading channel: a practical framework for approaching Shannon capacity

The paper contains a systematic investigation of practical coding strategies for noncoherent communication over fading channels, guided by explicit comparisons with information-theoretic benchmarks. Noncoherent reception is interpreted as joint data and channel estimation, assuming that the channel is time varying and a priori unknown. We consider iterative decoding for a serial concatenation of a standard binary outer channel code with an inner modulation code amenable to noncoherent detection. For an information rate of about 1/2 bit per channel use, the proposed scheme, using a quaternary phase-shift keying (QPSK) alphabet, provides performance within 1.6-1.7 dB of Shannon capacity for the block fading channel, and is about 2.5-3 dB superior to standard differential demodulation in conjunction with an outer channel code. We also provide capacity computations for noncoherent communication using standard phase-shift keying (PSK) and quadrature amplitude modulation (QAM) alphabets; comparing these with the capacity with unconstrained input provides guidance as to the choice of constellation as a function of the signal-to-noise ratio. These results imply that QPSK suffices to approach the unconstrained capacity for the relatively low information and fading rates considered in our performance evaluations, but that QAM is superior to PSK for higher information or fading rates, motivating further research into efficient noncoherent coded modulation with QAM alphabets.     

Designing circuits with partial scan

In this scan design methodology, only selected faults are targeted for detection. These faults are those not detected by the designer's functional vectors. The test generator decides exactly which flip-flops should be scanned using one of two methods. In the first method, all possible tests are generated for each target fault, and the set of tests requiring the fewest flip-flops is selected. In the second method, only one test is generated for each fault, and the use of flip-flops is avoided as much as possible during test generation. Examples of actual VLSI circuits show a savings of at least a 40% in full-scan overhead