Abstract: Opportunistic network is a kind of Delay Tolerant Networks (DTN) where the nodes in this network come into contact with each other opportunistically and communicate wirelessly and, an end-to-end path between source and destination may have never existed, and disconnection and reconnection is common in the network. In such a network, because of the nature of opportunistic network, perhaps there is no a complete path from source to destination for most of the time and even if there is a path; the path can be very unstable and may change or break quickly. Therefore, routing is one of the main challenges in this environment and, in order to make communication possible in an opportunistic network, the intermediate nodes have to play important role in the opportunistic routing protocols. In this paper we proposed an Adaptive Fuzzy Routing in opportunistic network (AFRON). This protocol is using the simple parameters as input parameters to find the path to the destination node. Using Message Transmission Count, Message Size and Time To Live parameters as input fuzzy to increase delivery ratio and decrease the buffer consumption in the all nodes of network.
Abstract: Use of the Internet and the World-Wide-Web
(WWW) has become widespread in recent years and mobile agent
technology has proliferated at an equally rapid rate. In this scenario
load balancing becomes important for P2P systems. Beside P2P
systems can be highly heterogeneous, i.e., they may consists of peers
that range from old desktops to powerful servers connected to
internet through high-bandwidth lines. There are various loads
balancing policies came into picture. Primitive one is Message
Passing Interface (MPI). Its wide availability and portability make it
an attractive choice; however the communication requirements are
sometimes inefficient when implementing the primitives provided by
MPI. In this scenario we use the concept of mobile agent because
Mobile agent (MA) based approach have the merits of high
flexibility, efficiency, low network traffic, less communication
latency as well as highly asynchronous. In this study we present
decentralized load balancing scheme using mobile agent technology
in which when a node is overloaded, task migrates to less utilized
nodes so as to share the workload. However, the decision of which
nodes receive migrating task is made in real-time by defining certain
load balancing policies. These policies are executed on PMADE (A
Platform for Mobile Agent Distribution and Execution) in
decentralized manner using JuxtaNet and various load balancing
metrics are discussed.
Abstract: Mobile WiMAX is a broadband wireless solution that
enables convergence of mobile and fixed broadband networks
through a common wide area broadband radio access technology and
flexible network architecture. It adopts Orthogonal Frequency
Division Multiple Access (OFDMA) for improved multi-path
performance in Non-Line-Of-Sight (NLOS) environments. Scalable
OFDMA (SOFDMA) is introduced in the IEEE 802e[1]. WIMAX
system uses one of different types of channel coding but The
mandatory channel coding scheme is based on binary nonrecursive
Convolutional Coding (CC). There are other several optional channel
coding schemes such as block turbo codes, convolutional turbo
codes, and low density parity check (LDPC).
In this paper a comparison between the performance of WIMAX
using turbo code and using convolutional product code (CPC) [2] is
made. Also a combination between them had been done. The CPC
gives good results at different SNR values compared to both the
turbo system, and the combination between them. For example, at
BER equal to 10-2 for 128 subcarriers, the amount of improvement
in SNR equals approximately 3 dB higher than turbo code and equals
approximately 2dB higher than the combination respectively. Several
results are obtained at different modulating schemes (16QAM and
64QAM) and different numbers of sub-carriers (128 and 512).
Abstract: In this paper DJess is presented, a novel distributed production system that provides an infrastructure for factual and procedural knowledge sharing. DJess is a Java package that provides programmers with a lightweight middleware by which inference systems implemented in Jess and running on different nodes of a network can communicate. Communication and coordination among inference systems (agents) is achieved through the ability of each agent to transparently and asynchronously reason on inferred knowledge (facts) that might be collected and asserted by other agents on the basis of inference code (rules) that might be either local or transmitted by any node to any other node.
Abstract: The characteristic bending strength (MOR) and mean
modulus of elasticity (MOE) of tropical hardwood red seraya (Shorea
spp.) plywood were determined using European Standard EN310 and
EN789. The thickness of the test specimen was 4.0mm, 7.0mm,
9.0mm, 12.0mm and 15.0mm. The experiment found that the MOR
of red seraya plywood in EN310 is about 12% to 20% and 7% to
24% higher than EN789 whereas MOE were about 28% to 41% and
30% to 36% lower than those obtained from EN 789 for test
specimens parallel and perpendicular to the grain direction. The
linear regression shows that MOR and MOE for EN789 is about 0.8
times less and 1.5 times more than EN310. The experiment also
found that the MOR and MOE of EN310 and EN789 also depend on
the wood species that used in the experiment.
Abstract: K-Modes is an extension of K-Means clustering algorithm, developed to cluster the categorical data, where the mean is replaced by the mode. The similarity measure proposed by Huang is the simple matching or mismatching measure. Weight of attribute values contribute much in clustering; thus in this paper we propose a new weighted dissimilarity measure for K-Modes, based on the ratio of frequency of attribute values in the cluster and in the data set. The new weighted measure is experimented with the data sets obtained from the UCI data repository. The results are compared with K-Modes and K-representative, which show that the new measure generates clusters with high purity.
Abstract: In cryptography, confusion and diffusion are very
important to get confidentiality and privacy of message in block
ciphers and stream ciphers. There are two types of network to provide
confusion and diffusion properties of message in block ciphers. They
are Substitution- Permutation network (S-P network), and Feistel
network. NLFS (Non-Linear feedback stream cipher) is a fast and
secure stream cipher for software application. NLFS have two modes
basic mode that is synchronous mode and self synchronous mode.
Real random numbers are non-deterministic. R-box (random box)
based on the dynamic properties and it performs the stochastic
transformation of data that can be used effectively meet the
challenges of information is protected from international destructive
impacts. In this paper, a new implementation of stochastic
transformation will be proposed.
Abstract: The present study focuses on methods allowing a convenient and quick calculation of the SIFs in order to predict the static adhesive strength of bonded joints. A new SIF calculation method is proposed, based on the stresses obtained from a FE model at a reference point located in the adhesive layer at equal distance of the free-edge and of the two interfaces. It is shown that, even limiting ourselves to the two main modes, i.e. the opening and the shearing modes, and using the values of the stresses resulting from a low detailed FE model, an efficient calculation of the peeling stress at adhesive-substrate corners can be obtained by this way. The proposed method is interesting in that it can be the basis of a prediction tool that will allow the designer to quickly evaluate the SIFs characterizing a particular application without developing a detailed analysis.
Abstract: In this paper, we studied some properties of geodesic on some open surfaces: Hyperboloid, Paraboloid and Funnel Surface. Geodesic equation in the v-Clairaut parameterization was calculated and reduced to definite integral. Some geodesics on some open surfaces as mention above were classified by Clairaut's relation.
Abstract: These days MANET is attracting much attention as
they are expected to gratefully influence communication between
wireless nodes. Along with this great strength, there is much more
chance of leave and being attacked by a malicious node. Due to this
reason much attention is given to the security and the private issue in
MANET. A lot of research in MANET has been doing. In this paper
we present the overview of MANET, the security issues of MANET,
IP configuration in MANET, the solution to puzzle out the security
issues and the simulation of the proposal idea. We add the method to
figure out the malicious nodes so that we can prevent the attack from
them. Nodes exchange the information about nodes to prevent DAD
attack. We can get 30% better performance than the previous
MANETConf.
Abstract: Manufacturing, production and service industries within Libya have struggled with many problems during the past two decades due to many difficulties. These problems have created a negative impact on the productivity and utilization of many industries around the country. This paper studies the implementation levels of the manufacturing control systems known as Manufacturing Resource Planning (MRPII) being adapted within some Libyan industries. A survey methodology has been applied for this research, based on the survey analysis, the results pointed out that the system within these industries has a modest strategy towards most of the areas that are considered as being very crucial in implementing these systems successfully. The findings also show a variation within these implementation levels with a respect to the key-elements that related to MRPII, giving the highest levels in the emphasise on financial data accuracy. The paper has also identified limitations within the investigated manufacturing and managerial areas and has pointed to where senior managers should take immediate actions in order to achieve effective implementation of MRPII within their business area.
Abstract: The nature of wireless ad hoc and sensor networks
make them very attractive to attackers. One of the most popular and
serious attacks in wireless ad hoc networks is wormhole attack and
most proposed protocols to defend against this attack used
positioning devices, synchronized clocks, or directional antennas.
This paper analyzes the nature of wormhole attack and existing
methods of defending mechanism and then proposes round trip time
(RTT) and neighbor numbers based wormhole detection mechanism.
The consideration of proposed mechanism is the RTT between two
successive nodes and those nodes- neighbor number which is needed
to compare those values of other successive nodes. The identification
of wormhole attacks is based on the two faces. The first consideration
is that the transmission time between two wormhole attack affected
nodes is considerable higher than that between two normal neighbor
nodes. The second detection mechanism is based on the fact that by
introducing new links into the network, the adversary increases the
number of neighbors of the nodes within its radius. This system does
not require any specific hardware, has good performance and little
overhead and also does not consume extra energy. The proposed
system is designed in ad hoc on-demand distance vector (AODV)
routing protocol and analysis and simulations of the proposed system
are performed in network simulator (ns-2).
Abstract: Optical Bursts Switching (OBS) is a relatively new
optical switching paradigm. Contention and burst loss in OBS
networks are major concerns. To resolve contentions, an interesting
alternative to discarding the entire data burst is to partially drop the
burst. Partial burst dropping is based on burst segmentation concept
that its implementation is constrained by some technical challenges,
besides the complexity added to the algorithms and protocols on both
edge and core nodes. In this paper, the burst segmentation concept is
investigated, and an implementation scheme is proposed and
evaluated. An appropriate dropping policy that effectively manages
the size of the segmented data bursts is presented. The dropping
policy is further supported by a new control packet format that
provides constant transmission overhead.
Abstract: Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, services and applications designed for ad hoc networks should adapt to this dynamic and distributed environment. In particular, multicast algorithms having reliability and scalability requirements should abstain from centralized approaches. We aspire to define a reliable and scalable multicast protocol for ad hoc networks. Our target is to utilize epidemic techniques for this purpose. In this paper, we present a brief survey of epidemic algorithms for reliable multicasting in ad hoc networks, and describe formulations and analytical results for simple epidemics. Then, P2P anti-entropy algorithm for content distribution and our prototype simulation model are described together with our initial results demonstrating the behavior of the algorithm.
Abstract: The aim of this study was to remove the two principal
noises which disturb the surface electromyography signal
(Diaphragm). These signals are the electrocardiogram ECG artefact
and the power line interference artefact. The algorithm proposed
focuses on a new Lean Mean Square (LMS) Widrow adaptive
structure. These structures require a reference signal that is correlated
with the noise contaminating the signal. The noise references are
then extracted : first with a noise reference mathematically
constructed using two different cosine functions; 50Hz (the
fundamental) function and 150Hz (the first harmonic) function for
the power line interference and second with a matching pursuit
technique combined to an LMS structure for the ECG artefact
estimation. The two removal procedures are attained without the use
of supplementary electrodes. These techniques of filtering are
validated on real records of surface diaphragm electromyography
signal. The performance of the proposed methods was compared with
already conducted research results.
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: High Pressure Raman scattering measurements of KDP:Mn were performed at room temperatures. The X-ray powder diffraction patterns taken at room temperature by Rietveld refinement showed that doped samples of KDP-Mn have the same tetragonal structure of a pure KDP crystal, but with a contraction of the crystalline cell. The behavior of the Raman spectra, in particular the emergence of a new modes at 330 cm-1, indicates that KDP:Mn undergoes a structural phase transition with onset at around 4 GP. First principle density-functional theory (DFT) calculations indicate that tetrahedral rotation with pressure is predominantly around the c crystalline direction. Theoretical results indicates that pressure induced tetrahedral rotations leads to change tetrahedral neighborhood, activating librations/bending modes observed for high pressure phase of KDP:Mn with stronger Raman activity.
Abstract: One of research issues in social network analysis is to
evaluate the position/importance of users in social networks. As the
information diffusion in social network is evolving, it seems difficult
to evaluate the importance of users using traditional approaches. In
this paper, we propose an evaluation approach for user importance
with fractal view in social networks. In this approach, the global importance
(Fractal Importance) and the local importance (Topological
Importance) of nodes are considered. The basic idea is that the bigger
the product of fractal importance and topological importance of a
node is, the more important of the node is. We devise the algorithm
called TFRank corresponding to the proposed approach. Finally, we
evaluate TFRank by experiments. Experimental results demonstrate
our TFRank has the high correlations with PageRank algorithm
and potential ranking algorithm, and it shows the effectiveness and
advantages of our approach.
Abstract: Wireless sensor networks (WSNs) consist of number
of tiny, low cost and low power sensor nodes to monitor some physical phenomenon. The major limitation in these networks is the use of non-rechargeable battery having limited power supply. The
main cause of energy consumption in such networks is
communication subsystem. This paper presents an energy efficient
Cluster Cooperative Caching at Sensor (C3S) based upon grid type clustering. Sensor nodes belonging to the same cluster/grid form a
cooperative cache system for the node since the cost for
communication with them is low both in terms of energy
consumption and message exchanges. The proposed scheme uses
cache admission control and utility based data replacement policy to
ensure that more useful data is retained in the local cache of a node.
Simulation results demonstrate that C3S scheme performs better in
various performance metrics than NICoCa which is existing
cooperative caching protocol for WSNs.
Abstract: Wireless sensor network is formed with the combination of sensor nodes and sink nodes. Recently Wireless sensor network has attracted attention of the research community. The main application of wireless sensor network is security from different attacks both for mass public and military. However securing these networks, by itself is a critical issue due to many constraints like limited energy, computational power and lower memory. Researchers working in this area have proposed a number of security techniques for this purpose. Still, more work needs to be done.In this paper we provide a detailed discussion on security in wireless sensor networks. This paper will help to identify different obstacles and requirements for security of wireless sensor networks as well as highlight weaknesses of existing techniques.