Joint Scheduling & Jamming for Data Secrecy in Wireless Networks

The broadcast nature of the wireless medium jeopardizes secure transmissions. Cryptographic measures fail to ensure security when eavesdroppers have superior computational capability; however, it can be assured from information theoretic security approaches. We use physical layer security to guarantee non-zero secrecy rate in single source, single destination multi-hop networks with eavesdroppers for two cases: when eavesdropper locations and channel gains are known and when their positions are unknown. We propose a two-phase solution which consists of finding activation sets and then obtaining transmit powers subject to SINR constraints for the case when eavesdropper locations are known. We introduce methods to find activation sets and compare their performance. Necessary but reasonable approximations are made in power minimization formulations for tractability reasons. For scenarios with no eavesdropper location information, we suggest vulnerability region (the area having zero secrecy rate) minimization over the network. Our results show that in the absence of location information average number of eavesdroppers who have access to data is reduced.

Molecular dynamic simulations of elastomer structure and its influence on anisotropic stress under time-varying strain

We investigate the evolution of polymer structure and its influence on uniaxial anisotropic stress under time-varying uniaxial strain, and the role of external control variables such as temperature, strain rate, chain length, and density, using molecular dynamics simulation. At temperatures higher than glass transition, stress anisotropy in the system is reduced even though the bond stretch is greater at higher temperatures. There is a significant increase in the stress level with increasing density. At higher densities, the uncoiling of the chains is suppressed and the major contribution to the deformation is by internal deformation of the chains. At faster rates of loading stress anisotropy increases. The deformation mechanism is mostly due to bond stretch and bond bending rather than overall shape and size. Stress levels increase with longer chain length. There is a critical value of the functionality of the cross-linkers beyond which the uniaxial stress developed increases caused primarily by bond stretching due to increased constraint on the motion of the monomers. Stacking of the chains in the system also plays a dominant role in the behaviour in terms of excluded volume interactions. Low density, high temperature, low values of functionality of cross-linkers, and short chain length facilitate chain uncoiling and chain slipping in cross-linked polymers.

Concentration Fluctuations and Segmental Dynamics in Weakly Dynamic Asymmetric Blends in the Presence of Surface-Functionalized Multiwall Carbon Nanotubes

Surface-functionalized multiwall carbon nanotubes (MWCNTs) are incorporated in poly(methyl methacrylate)/styrene acrylonitrile (PMMA/SAN) blends and the pretransitional regime is monitored in situ by melt rheology and dielectric spectroscopy. As the blends exhibit weak dynamic asymmetry, the obvious transitions in the melt rheology due to thermal concentration fluctuations are weak. This is further supported by the weak temperature dependence of the correlation length ( approximate to 10-12 angstrom) in the vicinity of demixing. Hence, various rheological techniques in both the temperature and frequency domains are adopted to evaluate the demixing temperature. The spinodal decomposition temperature is manifested in an increase in the miscibility gap in the presence of MWCNTs. Furthermore, MWCNTs lead to a significant slowdown of the segmental dynamics in the blends. Thermally induced phase separation in the PMMA/SAN blends lead to selective localization of MWCNTs in the PMMA phase. This further manifests itself in a significant increase in the melt conductivity.

A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs

In wireless sensor networks (WSNs) the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting at the same time. Such a situation is known as spatially correlated contention. The random access methods to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration and therefore generating an optimal or sub-optimal schedule is not very useful. On the other hand, if the algorithm takes very large time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. To efficiently handle the spatially correlated contention in WSNs, we present a distributed TDMA slot scheduling algorithm, called DTSS algorithm. The DTSS algorithm is designed with the primary objective of reducing the time required to perform scheduling, while restricting the schedule length to maximum degree of interference graph. The algorithm uses randomized TDMA channel access as the mechanism to transmit protocol messages, which bounds the message delay and therefore reduces the time required to get a feasible schedule. The DTSS algorithm supports unicast, multicast and broadcast scheduling, simultaneously without any modification in the protocol. The protocol has been simulated using Castalia simulator to evaluate the run time performance. Simulation results show that our protocol is able to considerably reduce the time required to schedule.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Study of dynamic behaviour of recession curves

Since Brutsaert and Neiber (1977), recession curves are widely used to analyse subsurface systems of river basins by expressing -dQ/dt as a function of Q, which typically take a power law form: -dQ/dt=kQ, where Q is the discharge at a basin outlet at time t. Traditionally recession flows are modelled by single reservoir models that assume a unique relationship between -dQ/dt and Q for a basin. However, recent observations indicate that -dQ/dt-Q relationship of a basin varies greatly across recession events, indicating the limitation of such models. In this study, the dynamic relationship between -dQ/dt and Q of a basin is investigated through the geomorphological recession flow model which models recession flows by considering the temporal evolution of its active drainage network (the part of the stream network of the basin draining water at time t). Two primary factors responsible for the dynamic relationship are identified: (i) degree of aquifer recharge (ii) spatial variation of rainfall. Degree of aquifer recharge, which is likely to be controlled by (effective) rainfall patterns, influences the power law coefficient, k. It is found that k has correlation with past average streamflow, which confirms the notion that dynamic -dQ/dt-Q relationship is caused by the degree of aquifer recharge. Spatial variation of rainfall is found to have control on both the exponent, , and the power law coefficient, k. It is noticed that that even with same and k, recession curves can be different, possibly due to their different (recession) peak values. This may also happen due to spatial variation of rainfall. Copyright (c) 2012 John Wiley & Sons, Ltd.

Iterated gain-based stochastic filters for dynamic system identification

We propose a novel form of nonlinear stochastic filtering based on an iterative evaluation of a Kalman-like gain matrix computed within a Monte Carlo scheme as suggested by the form of the parent equation of nonlinear filtering (Kushner-Stratonovich equation) and retains the simplicity of implementation of an ensemble Kalman filter (EnKF). The numerical results, presently obtained via EnKF-like simulations with or without a reduced-rank unscented transformation, clearly indicate remarkably superior filter convergence and accuracy vis-a-vis most available filtering schemes and eminent applicability of the methods to higher dimensional dynamic system identification problems of engineering interest. (C) 2013 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Effect of choice of basis functions in neural network for capturing unknown function for dynamic inversion control

The basic requirement for an autopilot is fast response and minimum steady state error for better guidance performance. The highly nonlinear nature of the missile dynamics due to the severe kinematic and inertial coupling of the missile airframe as well as the aerodynamics has been a challenge for an autopilot that is required to have satisfactory performance for all flight conditions in probable engagements. Dynamic inversion is very popular nonlinear controller for this kind of scenario. But the drawback of this controller is that it is sensitive to parameter perturbation. To overcome this problem, neural network has been used to capture the parameter uncertainty on line. The choice of basis function plays the major role in capturing the unknown dynamics. Here in this paper, many basis function has been studied for approximation of unknown dynamics. Cosine basis function has yield the best response compared to any other basis function for capturing the unknown dynamics. Neural network with Cosine basis function has improved the autopilot performance as well as robustness compared to Dynamic inversion without Neural network.

Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels

We model communication of bursty sources: 1) over multiaccess channels, with either independent decoding or joint decoding and 2) over degraded broadcast channels, by a discrete-time multiclass processor sharing queue. We utilize error exponents to give a characterization of the processor sharing queue. We analyze the processor sharing queue model for the stable region of message arrival rates, and show the existence of scheduling policies for which the stability region converges to the information-theoretic capacity region in an appropriate limiting sense.

Minimizing total weighted tardiness on heterogeneous batch processors with incompatible job families

In this paper, we address a scheduling problem for minimizing total weighted tardiness. The background for the paper is derived from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real-life scenarios like unequal release times, incompatible job families, nonidentical job sizes, heterogeneous batch processors, and allowance for job splitting have been considered. We have developed a mathematical model which takes into account dynamic starting conditions. The problem considered in this study is NP-hard in nature, and hence heuristic algorithms have been proposed to address it. For real-life large-size problems, the performance of the proposed heuristic algorithms is evaluated using the method of estimated optimal solution available in literature. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal statistically estimated solutions in very reasonable computational time.

Threshold-Independent QRS Detection Using the Dynamic Plosion Index

Detection of QRS serves as a first step in many automated ECG analysis techniques. Motivated by the strong similarities between the signal structures of an ECG signal and the integrated linear prediction residual (ILPR) of voiced speech, an algorithm proposed earlier for epoch detection from ILPR is extended to the problem of QRS detection. The ECG signal is pre-processed by high-pass filtering to remove the baseline wandering and by half-wave rectification to reduce the ambiguities. The initial estimates of the QRS are iteratively obtained using a non-linear temporal feature, named the dynamic plosion index suitable for detection of transients in a signal. These estimates are further refined to obtain a higher temporal accuracy. Unlike most of the high performance algorithms, this technique does not make use of any threshold or differencing operation. The proposed algorithm is validated on the MIT-BIH database using the standard metrics and its performance is found to be comparable to the state-of-the-art algorithms, despite its threshold independence and simple decision logic.

Enhanced superplasticity for (alpha plus beta)-hot rolled Ti-6Al-4V-0.1B alloy by means of dynamic globularization

Thermo-mechanically processed Ti-6Al-4V alloy, with (0.1 wt.%) and without boron addition, has been subjected to tensile test under superplastic deformation conditions (Temperature, T = 850 degrees C and initial strain rate, (epsilon) over dot = 3 x 10(-4) s(-1)). The boron added alloy exhibited higher elongation (similar to 430%) in comparison to the base alloy without boron (similar to 365%). Superior ductility of the boron added alloy has been attributed to an enhanced alpha/beta interfacial boundary sliding. This was caused by riotous dynamic globularization leading to the abundant presence of equiaxed primary alpha grains with refined sizes and narrow distribution in the deforming microstructure. Cavities do occur around TiB particles during deformation; the cavities are, however, extremely localized and do not cause macroscopic cracking. (C) 2014 Elsevier Ltd. All rights reserved.

Automatic Data Allocation and Buffer Management for Multi-GPU Machines

Multi-GPU machines are being increasingly used in high-performance computing. Each GPU in such a machine has its own memory and does not share the address space either with the host CPU or other GPUs. Hence, applications utilizing multiple GPUs have to manually allocate and manage data on each GPU. Existing works that propose to automate data allocations for GPUs have limitations and inefficiencies in terms of allocation sizes, exploiting reuse, transfer costs, and scalability. We propose a scalable and fully automatic data allocation and buffer management scheme for affine loop nests on multi-GPU machines. We call it the Bounding-Box-based Memory Manager (BBMM). BBMM can perform at runtime, during standard set operations like union, intersection, and difference, finding subset and superset relations on hyperrectangular regions of array data (bounding boxes). It uses these operations along with some compiler assistance to identify, allocate, and manage data required by applications in terms of disjoint bounding boxes. This allows it to (1) allocate exactly or nearly as much data as is required by computations running on each GPU, (2) efficiently track buffer allocations and hence maximize data reuse across tiles and minimize data transfer overhead, and (3) and as a result, maximize utilization of the combined memory on multi-GPU machines. BBMM can work with any choice of parallelizing transformations, computation placement, and scheduling schemes, whether static or dynamic. Experiments run on a four-GPU machine with various scientific programs showed that BBMM reduces data allocations on each GPU by up to 75% compared to current allocation schemes, yields performance of at least 88% of manually written code, and allows excellent weak scaling.