Trust correlation of mobile agent nodes with a regular node in a Adhoc network using decision-making strategy

A mobile agent offers discrete advantage both in facilitating better transmission as well as controlling the traffic load in Mobile Adhoc Network (MANET). Hence, such forms of network offers maximized dependencies on mobile agents in terms of its trust worthiness. At present, there are various work being carried out towards resisting security breach in MANET; however approaches using mobile agent based mechanism is few to found. Therefore, the proposed system introduces a novel mathematical model where an extensive decision making system has been constructed for identifying the malicious intention of mobile agents in case they go rogues. By adopting multi-tier communication policy and fairness concept, the proposed system offers the capability to resist any form of malicious activity of mobile agent without even presence of any apriori information of adversary. The outcome shows proposed system outshines existing security scheme in MANET.

Modelling of macrosegregation with mesosegregates in a binary metallic cast by the diffuse approximate meshless method

The solidification of binary metallic alloy (Sn-10%Pb) is simulated in 2D with a diffuse approximate meshless method. The macrosegregation with mesosegregates is described by a coupled set of volume-averaged partial differential equations. The incompressible Newtonian fluid is described by coupled mass and momentum equations and the mushy zone is treated as a Darcy porous media. The energy transport is described with enthalpy formulation and the species transfer is incorporated by considering the Lever rule approximation. The thermo-solutal Boussinesq hypothesis is applied in order to account for the double-diffusive effects in the melt. The mathematical model is solved by a diffusive approximate method on local subdomains with Euler time stepping. Pressure-velocity coupling is incorporated by applying the fractional step method. The instabilities due to the convective terms are smoothed out by applying the upwinding technique. The results are presented on a regular node arrangement and are compared to other benchmark results. The present paper demonstrates that the results calculated with the diffuse approximate meshless method are in good agreement with reference results.

Direct determination of shape functions for isoparametric elements with arbitrary node configuration

Shape functions have been derived to describe different forms of elements, notably triangles and rectangles in 2-D, and tetrahedrons, cuboids, and triangular prisms in 3-D. There are generalised solutions for some regular node configurations, and hierarchical correction algorithms help with more difficult node distributions. But to this point there is no single formula or set of formulae that allows the direct determination of shape functions for any node configuration without restrictions. This paper shows how a general set of formulae can be derived which is applicable to any isoparametric element type with arbitrary node configuration. This formulation is in such a form that it is clear and concise. The approach is based on the Lagrange polynomial considering up to three Cartesian and four volume coordinates. Additionally, the correction procedure that is inherent in the formulation to guarantee an appropriate evaluation of the generalised shape functions and to fulfil all four isoparametric shape function criteria is discussed. The proof of validity illustrates the correctness of the method.

HAMILTONIAN PROPERTIES OF FAULTY RECURSIVE CIRCULANT GRAPHS

We present some results concerning hamiltonian properties of recursive circulant graphs in the presence of faulty vertices and/or edges. The recursive circulant graph G(N, d) with d ≥ 2 has vertex set V(G) = {0, 1, …, N - 1} and the edge set E(G) = {(v, w)| ∃ i, 0 ≤ i ≤ ⌈ log d N⌉ - 1, such that v = w + di (mod N)}. When N = cdk where d ≥ 2 and 2 ≤ c ≤ d, G(cdk, d) is regular, node symmetric and can be recursively constructed. G(cdk, d) is a bipartite graph if and only if c is even and d is odd. Let F, the faulty set, be a subset of V(G(cdk, d)) ∪ E(G(cdk, d)). In this paper, we prove that G(cdk, d) - F remains hamiltonian if |F| ≤ deg (G(cdk, d)) - 2 and G(cdk, d) is not bipartite. Moreover, if |F| ≤ deg (G(cdk, d)) - 3 and G(cdk, d) is not a bipartite graph, we prove a more stronger result that for any two vertices u and v in V(G(cdk, d)) - F, there exists a hamiltonian path of G(cdk, d) - F joining u and v.

Efficient Communication in Folded Petersen Networks

Fast and efficient communication is one of the most important requirements in today's multicomputers. When reaching a larger scale of processors, the probability of faults in the network increases, hence communication must be robust and fault tolerant. The recently introduced family of folded Petersen networks, constructed by iteratively applying the cartesian product operation on the well-known Petersen graph, provides a regular, node– and edge-symmetric architecture with optimal connectivity (hence maximal fault-tolerance), and logarithmic diameter. Compared to the closest sized hypercube, the folded petersen network has a smaller diameter, lower node degree and higher packing density. In this paper, we study fundamental communication primitives like single routing, permutation routing, one-to-all broadcasting, multinode-broadcasting (gossiping), personalized communications like scattering, and total exchange on the folded Petersen networks, considering two communication models, namely single link availability (SLA) and multiple link availability (MLA). We derive lower bounds for these problems and design optimal algorithms in terms of both time and the number of message transmissions. The results are based on the construction of minimal height spanning trees in the fault-free folded Petersen network. We further analyze these communication primitives in faulty networks, where processing nodes and transmission links cease working. This analysis is based on multiple arc-disjoint spanning trees, a construct also useful for analyzing other families of multicomputer networks.