Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Opportunistic selection in multi-node wireless systems improves system performance by selecting the ``best'' node and by using it for data transmission. In these systems, each node has a real-valued local metric, which is a measure of its ability to improve system performance. Our goal is to identify the best node, which has the largest metric. We propose, analyze, and optimize a new distributed, yet simple, node selection scheme that combines the timer scheme with power control. In it, each node sets a timer and transmit power level as a function of its metric. The power control is designed such that the best node is captured even if. other nodes simultaneously transmit with it. We develop several structural properties about the optimal metric-to-timer-and-power mapping, which maximizes the probability of selecting the best node. These significantly reduce the computational complexity of finding the optimal mapping and yield valuable insights about it. We show that the proposed scheme is scalable and significantly outperforms the conventional timer scheme. We investigate the effect of. and the number of receive power levels. Furthermore, we find that the practical peak power constraint has a negligible impact on the performance of the scheme.

An Implementation of Partitioned Scheduling Scheme for Hard Real-Time Tasks in Multicore Linux with Fair Share for Linux Tasks

The correctness of a hard real-time system depends its ability to meet all its deadlines. Existing real-time systems use either a pure real-time scheduler or a real-time scheduler embedded as a real-time scheduling class in the scheduler of an operating system (OS). Existing implementations of schedulers in multicore systems that support real-time and non-real-time tasks, permit the execution of non-real-time tasks in all the cores with priorities lower than those of real-time tasks, but interrupts and softirqs associated with these non-real-time tasks can execute in any core with priorities higher than those of real-time tasks. As a result, the execution overhead of real-time tasks is quite large in these systems, which, in turn, affects their runtime. In order that the hard real-time tasks can be executed in such systems with minimal interference from other Linux tasks, we propose, in this paper, an integrated scheduler architecture, called SchedISA, which aims to considerably reduce the execution overhead of real-time tasks in these systems. In order to test the efficacy of the proposed scheduler, we implemented partitioned earliest deadline first (P-EDF) scheduling algorithm in SchedISA on Linux kernel, version 3.8, and conducted experiments on Intel core i7 processor with eight logical cores. We compared the execution overhead of real-time tasks in the above implementation of SchedISA with that in SCHED_DEADLINE's P-EDF implementation, which concurrently executes real-time and non-real-time tasks in Linux OS in all the cores. The experimental results show that the execution overhead of real-time tasks in the above implementation of SchedISA is considerably less than that in SCHED_DEADLINE. We believe that, with further refinement of SchedISA, the execution overhead of real-time tasks in SchedISA can be reduced to a predictable maximum, making it suitable for scheduling hard real-time tasks without affecting the CPU share of Linux tasks.

Performance of New Dynamic Benefit-Weighted Scheduling Scheme in DiffServ Networks

In this paper, we design a new dynamic packet scheduling scheme suitable for differentiated service (DiffServ) network. Designed dynamic benefit weighted scheduling (DBWS) uses a dynamic weighted computation scheme loosely based on weighted round robin (WRR) policy. It predicts the weight required by expedited forwarding (EF) service for the current time slot (t) based on two criteria; (i) previous weight allocated to it at time (t-1), and (ii) the average increase in the queue length of EF buffer. This prediction provides smooth bandwidth allocation to all the services by avoiding overbooking of resources for EF service and still providing guaranteed services for it. The performance is analyzed for various scenarios at high, medium and low traffic conditions. The results show that packet loss is minimized, end to end delay is minimized and jitter is reduced and therefore meet quality of service (QoS) requirement of a network.

Implicit scheme for meshless compressible Euler solver

In this paper, an implicit scheme is presented for a meshless compressible Euler solver based on the Least Square Kinetic Upwind Method (LSKUM). The Jameson and Yoon's split flux Jacobians formulation is very popular in finite volume methodology, which leads to a scalar diagonal dominant matrix for an efficient implicit procedure (Jameson & Yoon, 1987). However, this approach leads to a block diagonal matrix when applied to the LSKUM meshless method. The above split flux Jacobian formulation, along with a matrix-free approach, has been adopted to obtain a diagonally dominant, robust and cheap implicit time integration scheme. The efficacy of the scheme is demonstrated by computing 2D flow past a NACA 0012 airfoil under subsonic, transonic and supersonic flow conditions. The results obtained are compared with available experiments and other reliable computational fluid dynamics (CFD) results. The present implicit formulation shows good convergence acceleration over the RK4 explicit procedure. Further, the accuracy and robustness of the scheme in 3D is demonstrated by computing the flow past an ONERA M6 wing and a clipped delta wing with aileron deflection. The computed results show good agreement with wind tunnel experiments and other CFD computations.

Rational molecular dynamics scheme for predicting optimum concentration loading of nano-additive in phase change materials

The present study deals with the diffusion and phase transition behaviour of paraffin reinforced with carbon nano-additives namely graphene oxide (GO) and surface functionalized single walled carbon nanotubes (SWCNT). Bulk disordered systems of paraffin hydrocarbons impregnated with carbon nano-additives have been generated in realistic equilibrium conformations for potential application as latent heat storage systems. Ab initio molecular dynamics(MD) in conjugation with COMPASS forcefield has been implemented using periodic boundary conditions. The proposed scheme allows determination of optimum nano-additive loading for improving thermo-physical properties through analysis of mass, thermal and transport properties; and assists in determination of composite behaviour and related performance from microscopic point of view. It was observed that nanocomposites containing 7.8% surface functionalised SWCNT and 55% GO loading corresponds to best latent heat storage system. The propounded methodology could serve as a by-pass route for economically taxing and iterative experimental procedures required to attain the optimum composition for best performance. The results also hint at the large unexplored potential of ab-initio classical MD techniques for predicting performance of new nanocomposites for potential phase change material applications. (C) 2015 Author(s).

ASYMPTOTIC PRESERVING SCHEME FOR A KINETIC MODEL DESCRIBING IN COMPRESSIBLE FLUIDS

The kinetic theory of fluid turbulence modeling developed by Degond and Lemou in 7] is considered for further study, analysis and simulation. Starting with the Boltzmann like equation representation for turbulence modeling, a relaxation type collision term is introduced for isotropic turbulence. In order to describe some important turbulence phenomenology, the relaxation time incorporates a dependency on the turbulent microscopic energy and this makes difficult the construction of efficient numerical methods. To investigate this problem, we focus here on a multi-dimensional prototype model and first propose an appropriate change of frame that makes the numerical study simpler. Then, a numerical strategy to tackle the stiff relaxation source term is introduced in the spirit of Asymptotic Preserving Schemes. Numerical tests are performed in a one-dimensional framework on the basis of the developed strategy to confirm its efficiency.

Efficient coupled polynomial interpolation scheme for out-of-plane free vibration analysis of curved beams

The performance of two curved beam finite element models based on coupled polynomial displacement fields is investigated for out-of-plane vibration of arches. These two-noded beam models employ curvilinear strain definitions and have three degrees of freedom per node namely, out-of-plane translation (v), out-of-plane bending rotation (theta(z)) and torsion rotation (theta(s)). The coupled polynomial interpolation fields are derived independently for Timoshenko and Euler-Bernoulli beam elements using the force-moment equilibrium equations. Numerical performance of these elements for constrained and unconstrained arches is compared with the conventional curved beam models which are based on independent polynomial fields. The formulation is shown to be free from any spurious constraints in the limit of `flexureless torsion' and `torsionless flexure' and hence devoid of flexure and torsion locking. The resulting stiffness and consistent mass matrices generated from the coupled displacement models show excellent convergence of natural frequencies in locking regimes. The accuracy of the shear flexibility added to the elements is also demonstrated. The coupled polynomial models are shown to perform consistently over a wide range of flexure-to-shear (EI/GA) and flexure-to-torsion (EI/GJ) stiffness ratios and are inherently devoid of flexure, torsion and shear locking phenomena. (C) 2015 Elsevier B.V. All rights reserved.

The time finite element as a robust general scheme for solving nonlinear dynamic equations including chaotic systems

Schemes that can be proven to be unconditionally stable in the linear context can yield unstable solutions when used to solve nonlinear dynamical problems. Hence, the formulation of numerical strategies for nonlinear dynamical problems can be particularly challenging. In this work, we show that time finite element methods because of their inherent energy momentum conserving property (in the case of linear and nonlinear elastodynamics), provide a robust time-stepping method for nonlinear dynamic equations (including chaotic systems). We also show that most of the existing schemes that are known to be robust for parabolic or hyperbolic problems can be derived within the time finite element framework; thus, the time finite element provides a unification of time-stepping schemes used in diverse disciplines. We demonstrate the robust performance of the time finite element method on several challenging examples from the literature where the solution behavior is known to be chaotic. (C) 2015 Elsevier Inc. All rights reserved.

The time finite element as a robust general scheme for solving nonlinear dynamic equations including chaotic systems

Schemes that can be proven to be unconditionally stable in the linear context can yield unstable solutions when used to solve nonlinear dynamical problems. Hence, the formulation of numerical strategies for nonlinear dynamical problems can be particularly challenging. In this work, we show that time finite element methods because of their inherent energy momentum conserving property (in the case of linear and nonlinear elastodynamics), provide a robust time-stepping method for nonlinear dynamic equations (including chaotic systems). We also show that most of the existing schemes that are known to be robust for parabolic or hyperbolic problems can be derived within the time finite element framework; thus, the time finite element provides a unification of time-stepping schemes used in diverse disciplines. We demonstrate the robust performance of the time finite element method on several challenging examples from the literature where the solution behavior is known to be chaotic. (C) 2015 Elsevier Inc. All rights reserved.

Numerical solution of the incompressible Navier-Stokes equations with an upwind compact difference scheme

A new finite difference method for the discretization of the incompressible Navier-Stokes equations is presented. The scheme is constructed on a staggered-mesh grid system. The convection terms are discretized with a fifth-order-accurate upwind compact difference approximation, the viscous terms are discretized with a sixth-order symmetrical compact difference approximation, the continuity equation and the pressure gradient in the momentum equations are discretized with a fourth-order difference approximation on a cell-centered mesh. Time advancement uses a three-stage Runge-Kutta method. The Poisson equation for computing the pressure is solved with preconditioning. Accuracy analysis shows that the new method has high resolving efficiency. Validation of the method by computation of Taylor's vortex array is presented.

Fourth order accurate compact scheme with group velocity control (GVC)

For solving complex flow field with multi-scale structure higher order accurate schemes are preferred. Among high order schemes the compact schemes have higher resolving efficiency. When the compact and upwind compact schemes are used to solve aerodynamic problems there are numerical oscillations near the shocks. The reason of oscillation production is because of non-uniform group velocity of wave packets in numerical solutions. For improvement of resolution of the shock a parameter function is introduced in compact scheme to control the group velocity. The newly developed method is simple. It has higher accuracy and less stencil of grid points.

Scheme Construction with Numerical Flux Residual Correction (NFRC) and Group Velocity Control (GVC)

For simulating multi-scale complex flow fields like turbulent flows, the high order accurate schemes are preferred. In this paper, a scheme construction with numerical flux residual correction (NFRC) is presented. Any order accurate difference approximation can be obtained with the NFRC. To improve the resolution of the shock, the constructed schemes are modified with group velocity control (GVC) and weighted group velocity control (WGVC). The method of scheme construction is simple, and it is used to solve practical problems.

Optimized Group Velocity Control Scheme and DNS of Decaying Compressible Turbulence of Relative High Turbulent Mach Number

To overcome the difficulty in the DNS of compressible turbulence at high turbulent Mach number, a new difference scheme called GVC8 is developed. We have succeeded in the direct numerical simulation of decaying compressible turbulence up to turbulent Mach number 0.95. The statistical quantities thus obtained at lower turbulent Mach number agree well with those from previous authors with the same initial conditions, but they are limited to simulate at lower turbulent Mach numbers due to the so-called start-up problem. The energy spectrum and coherent structure of compressible turbulent flow are analysed. The scaling law of compressible turbulence is studied. The computed results indicate that the extended self-similarity holds in decaying compressible turbulence despite the occurrence of shocklets, and compressibility has little effects on relative scaling exponents when turbulent Mach number is not very high.