Earticle

The user authentication process is an important task in mobile networks. With the development of new standard Universal Mobile Telecommunication System (UMTS), the security weaknesses of previous standards are removed. However one security weakness has been found by researchers in UMTS, which is the sending of user's International Mobile Subscriber Identity (IMSI) in plain text over the air interface during authentication process. In order to address this issue, a novel security algorithm named as Airam is presented in this research work. Airam algorithm uses hybrid cryptography technique to resolve the problem of sending user's IMSI is plain text over the air interface during authentication process. Simulation results show that the proposed Airam algorithm also provides adequate security against replay and imposition attacks.

Each Internet communication leaves trails here or there, that can be followed back to the user. Notably, anonymous communication schemes are purposed to hide users’' identity as to personal, source and destination location and content information. Notably, no network capability is in existence to completely negate anonymity leakage in network latency, thus, the minimization of anonymity leakage in network latency becomes critically salient. The purpose of this paper is to investigate network latency anonymity leaks, and propose practical techniques for their reduction. In this direction, we investigate the following technical question: what implementation techniques can be configured to truly reduce anonymity leaks using deployable systems. Here, an extension of the popular Tor security strategies and unique configuration of the popular network anonymity techniques (algorithms) for future implementation are presented.

OSGi is a middleware standard for home gateways, designed for smart home applications. OSGi models services as separate components, called bundles. Smart home applications might differ in their importance. For example, home security system is more important than Internet game. Bundles collaborate to provide the required service. This paper proposes a bundle replacement algorithm that takes into account the priority of the bundle and the interdependence between different bundles. Thus, given a home gateway that hosts several applications with different priorities and arbitrary dependencies among them. When the home gateway runs out of memory, which bundles will be stopped or kicked out of memory to start a new service. Because of the bundle dependencies, traditional memory management algorithms might not be efficient. Efficient replacement algorithm should stop the least important and a small number of bundles. The proposed algorithm takes into consideration the priority of the bundle or application and dependencies between different bundles, in addition to the amount of memory occupied by each service. We implement the proposed algorithms and performed many experiments to evaluate its performance and execution time. We used best fit and worst fit as yardstick to show the effectiveness of the proposed algorithms. The proposed algorithms are implemented as a part of the OSGi framework(Open Service Gateway initiative).

This paper presents experiences and results obtained in optimizing parallelization of the mass transfer simulation in the High Gradient Magnetic Separation (HGMS) of nanoparticles using nonblocking communication techniques in the point-to-point and collective model. We study the dynamics of mass transfer statistically in terms of particle volume concentration and the continuity equation, which is solved numerically by using the finite-difference method to compute concentration distribution in the simulation domain at a given time. In the parallel simulation, total concentration data in the simulation domain are divided row-wise and distributed equally to a group of processes. We propose two parallel algorithms based on the row-wise partitioning: algorithms with nonblocking send/receive and nonblocking scatter/gather using the NBC library. We compare the performance of both versions by measuring their parallel speedup and efficiency. We also investigate the communication overhead in both versions. Our results show that the nonblocking collective communication can improve the performance of the simulation when the number of processes is large.

A new feature set derived from the fractal geometry, called the random threshold vector (RTV) is proposed for texture analysis. The RTV is computed for different run length entropy dimensions. The run length entropy dimensions are calculated based on different thresholds. To test the rotationally invariant feature, the run length entropies are calculated in different directions. The experimental results show that the RTV contains great discriminatory information needed for a successful classification.