Abstract: In wireless sensor networks, locality and positioning information can be captured using Global Positioning System (GPS). This message can be congregated initially from spot to identify the system. Users can retrieve information of interest from a wireless sensor network (WSN) by injecting queries and gathering results from the mobile sink nodes. Routing is the progression of choosing optimal path in a mobile network. Intermediate node employs permutation of device nodes into teams and generating cluster heads that gather the data from entity cluster’s node and encourage the collective data to base station. WSNs are widely used for gathering data. Since sensors are power-constrained devices, it is quite vital for them to reduce the power utilization. A tree-based data fusion clustering routing algorithm (TBDFC) is used to reduce energy consumption in wireless device networks. Here, the nodes in a tree use the cluster formation, whereas the elevation of the tree is decided based on the distance of the member nodes to the cluster-head. Network simulation shows that this scheme improves the power utilization by the nodes, and thus considerably improves the lifetime.
Abstract: This paper presents a new control scheme to control a brushless doubly fed induction generator (BDFIG) using back-to-back PWM converters for wind power generation. The proposed control scheme is a New Self-Tuning Fuzzy Proportional-Derivative Controller (NSTFPDC). The goal of BDFIG control is to achieve a similar dynamic performance to the doubly fed induction generator (DFIG), exploiting the well-known induction machine vector control philosophy. The performance of NSTFPDC controller has been investigated and compared with the two controllers, called Proportional–Integral (PI) and PD-like Fuzzy Logic controller (PD-like FLC) based BDFIG. The simulation results demonstrate the effectiveness and the robustness of the NSTFPDC controller.
Abstract: A block backward differentiation formula of uniform
order eight is proposed for solving first order stiff initial value
problems (IVPs). The conventional 8-step Backward Differentiation
Formula (BDF) and additional methods are obtained from the same
continuous scheme and assembled into a block matrix equation which
is applied to provide the solutions of IVPs on non-overlapping
intervals. The stability analysis of the method indicates that the
method is L0-stable. Numerical results obtained using the proposed
new block form show that it is attractive for solutions of stiff problems
and compares favourably with existing ones.
Abstract: Solving Ordinary Differential Equations (ODEs) by
using Partitioning Block Intervalwise (PBI) technique is our aim in
this paper. The PBI technique is based on Block Adams Method and
Backward Differentiation Formula (BDF). Block Adams Method
only use the simple iteration for solving while BDF requires Newtonlike
iteration involving Jacobian matrix of ODEs which consumes a
considerable amount of computational effort. Therefore, PBI is
developed in order to reduce the cost of iteration within acceptable
maximum error
Abstract: In this paper, a direct method based on variable step
size Block Backward Differentiation Formula which is referred as
BBDF2 for solving second order Ordinary Differential Equations
(ODEs) is developed. The advantages of the BBDF2 method over the
corresponding sequential variable step variable order Backward
Differentiation Formula (BDFVS) when used to solve the same
problem as a first order system are pointed out. Numerical results are
given to validate the method.
Abstract: A parallel block method based on Backward
Differentiation Formulas (BDF) is developed for the parallel solution
of stiff Ordinary Differential Equations (ODEs). Most common
methods for solving stiff systems of ODEs are based on implicit
formulae and solved using Newton iteration which requires repeated
solution of systems of linear equations with coefficient matrix, I -
hβJ . Here, J is the Jacobian matrix of the problem. In this paper,
the matrix operations is paralleled in order to reduce the cost of the
iterations. Numerical results are given to compare the speedup and
efficiency of parallel algorithm and that of sequential algorithm.
Abstract: The implicit block methods based on the backward
differentiation formulae (BDF) for the solution of stiff initial value
problems (IVPs) using variable step size is derived. We construct a
variable step size block methods which will store all the coefficients
of the method with a simplified strategy in controlling the step size
with the intention of optimizing the performance in terms of
precision and computation time. The strategy involves constant,
halving or increasing the step size by 1.9 times the previous step size.
Decision of changing the step size is determined by the local
truncation error (LTE). Numerical results are provided to support the
enhancement of method applied.
Abstract: In this paper, parallelism in the solution of Ordinary
Differential Equations (ODEs) to increase the computational speed is
studied. The focus is the development of parallel algorithm of the two
point Block Backward Differentiation Formulas (PBBDF) that can
take advantage of the parallel architecture in computer technology.
Parallelism is obtained by using Message Passing Interface (MPI).
Numerical results are given to validate the efficiency of the PBBDF
implementation as compared to the sequential implementation.