Abstract: This paper focuses on wormhole attacks detection in wireless sensor networks. The wormhole attack is particularly challenging to deal with since the adversary does not need to compromise any nodes and can use laptops or other wireless devices to send the packets on a low latency channel. This paper introduces an easy and effective method to detect and locate the wormholes: Since beacon nodes are assumed to know their coordinates, the straight line distance between each pair of them can be calculated and then compared with the corresponding hop distance, which in this paper equals hop counts × node-s transmission range R. Dramatic difference may emerge because of an existing wormhole. Our detection mechanism is based on this. The approximate location of the wormhole can also be derived in further steps based on this information. To the best of our knowledge, our method is much easier than other wormhole detecting schemes which also use beacon nodes, and to those have special requirements on each nodes (e.g., GPS receivers or tightly synchronized clocks or directional antennas), ours is more economical. Simulation results show that the algorithm is successful in detecting and locating wormholes when the density of beacon nodes reaches 0.008 per m2.
Abstract: Ventricular fibrillation is a very important health
problem as is the cause of most of the sudden deaths in the world.
Waves of electrical activity are sent by the SA node, propagate
through the cardiac tissue and activate the mechanisms of cell
contraction, and therefore are responsible to pump blood to the body
harmonically. A spiral wave is an abnormal auto sustainable wave
that is responsible of certain types of arrhythmias. When these waves
break up, give rise to the fibrillation regime, in which there is a
complete loss in the coordination of the contraction of the heart
muscle. Interaction of spiral waves and obstacles is also of great
importance as it is believed that the attachment of a spiral wave to an
obstacle can provide with a transition of two different arrhythmias.
An obstacle can be partially excitable or non excitable. In this talk,
we present a numerical study of the interaction of meandering spiral
waves with partially and non excitable obstacles and focus on the
problem where the obstacle plays a fundamental role in the switch
between different spiral regimes, which represent different
arrhythmic regimes. Particularly, we study the phenomenon of
destabilization of spiral waves due to the presence of obstacles, a
phenomenon not completely understood (This work will appear as a
Chapter in a Book named Cardiac Arrhytmias by INTECH under the
name "Spiral Waves, Obstacles and Cardiac Arrhythmias", ISBN
979-953-307-050-5.).
Abstract: The previous proposed evacuation routing approaches usually divide the space into multiple interlinked zones. However, it may be harder to clearly and objectively define the margins of each zone. This paper proposes an approach that connects locations of necessary guidance into a spatial network. In doing so, evacuation routes can be constructed based on the links between starting points, turning nodes, and terminal points. This approach more conforms to the real-life evacuation behavior. The feasibility of the proposed approach is evaluated through a case of one floor in a hospital building. Results indicate that the proposed approach provides valuable suggestions for evacuation planning.
Abstract: This study focuses on examining why the range of
experience with respect to HIV infection is so diverse, especially in
regard to the latency period. An agent-based approach in modelling
the infection is used to extract high-level behaviour which cannot be
obtained analytically from the set of interaction rules at the cellular
level. A prototype model encompasses local variation in baseline
properties, contributing to the individual disease experience, and is
included in a network which mimics the chain of lymph nodes. The
model also accounts for stochastic events such as viral mutations.
The size and complexity of the model require major computational
effort and parallelisation methods are used.
Abstract: We study a long-range percolation model in the hierarchical
lattice ΩN of order N where probability of connection between
two nodes separated by distance k is of the form min{αβ−k, 1},
α ≥ 0 and β > 0. The parameter α is the percolation parameter,
while β describes the long-range nature of the model. The ΩN is
an example of so called ultrametric space, which has remarkable
qualitative difference between Euclidean-type lattices. In this paper,
we characterize the sizes of large clusters for this model along the
line of some prior work. The proof involves a stationary embedding
of ΩN into Z. The phase diagram of this long-range percolation is
well understood.
Abstract: Social learning network analysis has drawn attention
for most researcher on e-learning research domain. This is due to the
fact that it has the capability to identify the behavior of student
during their social interaction inside e-learning. Normally, the social
network analysis (SNA) is treating the students' interaction merely as
node and edge with less meaning. This paper focuses on providing an
ontology structure of e-learning Moodle that can enrich the
relationships among students, as well as between the students and the
teacher. This ontology structure brings great benefit to the future
development of e-learning system.
Abstract: This paper presents a CFD analysis of the flow field
around a thin flat plate of infinite span inclined at 90° to a fluid
stream of infinite extent. Numerical predictions have been compared
to experimental measurements, in order to assess the potential of the
finite volume code of determining the aerodynamic forces acting on a
bluff body invested by a fluid stream of infinite extent.
Several turbulence models and spatial node distributions have
been tested. Flow field characteristics in the neighborhood of the flat
plate have been investigated, allowing the development of a
preliminary procedure to be used as guidance in selecting the
appropriate grid configuration and the corresponding turbulence
model for the prediction of the flow field over a two-dimensional
vertical flat plate.
Abstract: The reliability of distributed systems and computer
networks have been modeled by a probabilistic network or a graph G.
Computing the residual connectedness reliability (RCR), denoted by
R(G), under the node fault model is very useful, but is an NP-hard
problem. Since it may need exponential time of the network size to
compute the exact value of R(G), it is important to calculate its tight
approximate value, especially its lower bound, at a moderate
calculation time. In this paper, we propose an efficient algorithm for
reliability lower bound of distributed systems with unreliable nodes.
We also applied our algorithm to several typical classes of networks
to evaluate the lower bounds and show the effectiveness of our
algorithm.
Abstract: The integral form of equations of motion of composite
beams subjected to varying time loads are discretized using a
developed finite element model. The model consists of a straight five
node twenty-two degrees of freedom beam element. The stability
analysis of the beams is studied by solving the matrix form
characteristic equations of the system. The principle of virtual work
and the first order shear deformation theory are employed to analyze
the beams with large deformation and small strains. The regions of
dynamic instability of the beam are determined by solving the
obtained Mathieu form of differential equations. The effects of nonconservative
loads, shear stiffness, and damping parameters on
stability and response of the beams are examined. Several numerical
calculations are presented to compare the results with data reported
by other researchers.
Abstract: The structure of retinal vessels is a prominent feature,
that reveals information on the state of disease that are reflected in
the form of measurable abnormalities in thickness and colour.
Vascular structures of retina, for implementation of clinical diabetic
retinopathy decision making system is presented in this paper.
Retinal Vascular structure is with thin blood vessel, whose accuracy
is highly dependent upon the vessel segmentation. In this paper the
blood vessel thickness is automatically detected using preprocessing
techniques and vessel segmentation algorithm. First the capture
image is binarized to get the blood vessel structure clearly, then it is
skeletonised to get the overall structure of all the terminal and
branching nodes of the blood vessels. By identifying the terminal
node and the branching points automatically, the main and branching
blood vessel thickness is estimated. Results are presented and
compared with those provided by clinical classification on 50 vessels
collected from Bejan Singh Eye hospital..
Abstract: Recently global concerns for the energy security have
steadily been on the increase and are expected to become a major
issue over the next few decades. Energy security refers to a resilient
energy system. This resilient system would be capable of
withstanding threats through a combination of active, direct security
measures and passive or more indirect measures such as redundancy,
duplication of critical equipment, diversity in fuel, other sources of
energy, and reliance on less vulnerable infrastructure. Threats and
disruptions (disturbances) to one part of the energy system affect
another. The paper presents methodology in theoretical background
about energy system as an interconnected network and energy supply
disturbances impact to the network. The proposed methodology uses
a network flow approach to develop mathematical model of the
energy system network as the system of nodes and arcs with energy
flowing from node to node along paths in the network.
Abstract: Grid networks provide the ability to perform higher throughput computing by taking advantage of many networked computer-s resources to solve large-scale computation problems. As the popularity of the Grid networks has increased, there is a need to efficiently distribute the load among the resources accessible on the network. In this paper, we present a stochastic network system that gives a distributed load-balancing scheme by generating almost regular networks. This network system is self-organized and depends only on local information for load distribution and resource discovery. The in-degree of each node is refers to its free resources, and job assignment and resource discovery processes required for load balancing is accomplished by using fitted random sampling. Simulation results show that the generated network system provides an effective, scalable, and reliable load-balancing scheme for the distributed resources accessible on Grid networks.
Abstract: This paper proposes a new decision making approch
based on quantitative possibilistic influence diagrams which are
extension of standard influence diagrams in the possibilistic framework.
We will in particular treat the case where several expert
opinions relative to value nodes are available. An initial expert assigns
confidence degrees to other experts and fixes a similarity threshold
that provided possibility distributions should respect. To illustrate our
approach an evaluation algorithm for these multi-source possibilistic
influence diagrams will also be proposed.
Abstract: Fabrication and efficiency enhancement of non-mercury, high efficiency and green field emission lamps using carbon nano-materials such as carbon nanotubes as cathode field emitters was studied. Phosphor was coated on the ITO glass or metal substrates as the anode. The luminescence efficiency enhancement was carried out by upgrading the uniform of the emitters, improving electron and thermal conductivity of the phosphor and the optimization of the design of different cathode/anode configurations. After evaluation of the aforementioned parameters, the luminescence efficiency of the field emission lamps was raised.
Abstract: Wireless ad hoc nodes are freely and dynamically
self-organize in communicating with others. Each node can act as
host or router. However it actually depends on the capability of
nodes in terms of its current power level, signal strength, number
of hops, routing protocol, interference and others. In this research,
a study was conducted to observe the effect of hops count over
different network topologies that contribute to TCP Congestion
Control performance degradation. To achieve this objective, a
simulation using NS-2 with different topologies have been
evaluated. The comparative analysis has been discussed based on
standard observation metrics: throughput, delay and packet loss
ratio. As a result, there is a relationship between types of topology
and hops counts towards the performance of ad hoc network. In
future, the extension study will be carried out to investigate the
effect of different error rate and background traffic over same
topologies.
Abstract: As wireless sensor networks are energy constraint networks
so energy efficiency of sensor nodes is the main design issue.
Clustering of nodes is an energy efficient approach. It prolongs the
lifetime of wireless sensor networks by avoiding long distance communication.
Clustering algorithms operate in rounds. Performance of
clustering algorithm depends upon the round time. A large round
time consumes more energy of cluster heads while a small round
time causes frequent re-clustering. So existing clustering algorithms
apply a trade off to round time and calculate it from the initial
parameters of networks. But it is not appropriate to use initial
parameters based round time value throughout the network lifetime
because wireless sensor networks are dynamic in nature (nodes can be
added to the network or some nodes go out of energy). In this paper
a variable round time approach is proposed that calculates round
time depending upon the number of active nodes remaining in the
field. The proposed approach makes the clustering algorithm adaptive
to network dynamics. For simulation the approach is implemented
with LEACH in NS-2 and the results show that there is 6% increase
in network lifetime, 7% increase in 50% node death time and 5%
improvement over the data units gathered at the base station.
Abstract: In this paper, we focus on the problem of driving and
herding a collection of autonomous actors to a given area. Then, a
new method based on multi-agent coordination is proposed for
solving the problem.
In our proposed method, we assume that the environment is
covered by sensors. When an event is occurred, sensors forward
information to a sink node. Based on received information, the sink
node will estimate the direction and the speed of movement of actors
and announce the obtained value to the actors. The actors coordinate
to reach the target location.
Abstract: With the advantage of wireless network technology,
there are a variety of mobile applications which make the issue of
wireless sensor networks as a popular research area in recent years.
As the wireless sensor network nodes move arbitrarily with the
topology fast change feature, mobile nodes are often confronted with
the void issue which will initiate packet losing, retransmitting,
rerouting, additional transmission cost and power consumption.
When transmitting packets, we would not predict void problem
occurring in advance. Thus, how to improve geographic routing with
void avoidance in wireless networks becomes an important issue. In
this paper, we proposed a greedy geographical void routing algorithm
to solve the void problem for wireless sensor networks. We use the
information of source node and void area to draw two tangents to
form a fan range of the existence void which can announce voidavoiding
message. Then we use source and destination nodes to draw
a line with an angle of the fan range to select the next forwarding
neighbor node for routing. In a dynamic wireless sensor network
environment, the proposed greedy void avoiding algorithm can be
more time-saving and more efficient to forward packets, and improve
current geographical void problem of wireless sensor networks.
Abstract: Connected dominating set (CDS) problem in unit disk
graph has signi£cant impact on an ef£cient design of routing protocols
in wireless sensor networks, where the searching space for a
route is reduced to nodes in the set. A set is dominating if all the
nodes in the system are either in the set or neighbors of nodes in the
set. In this paper, a simple and ef£cient heuristic method is proposed
for £nding a minimum connected dominating set (MCDS) in ad hoc
wireless networks based on the new parameter support of vertices.
With this parameter the proposed heuristic approach effectively
£nds the MCDS of a graph. Extensive computational experiments
show that the proposed approach outperforms the recently proposed
heuristics found in the literature for the MCD
Abstract: Nonlinear finite element method with eight noded
isoparametric quadrilateral element is used for prediction of loaddeformation
behavior including bearing capacity of foundations.
Modified generalized plasticity model with non-associated flow rule
is applied for analysis of soil-footing system. Also Von Mises and
Tresca criterions are used for simulation of soil behavior. Modified
generalized plasticity model is able to simulate load-deformation
including softening behavior. Localization phenomena are considered
by different meshes. Localization phenomena have not been seen in
the examples. Predictions by modified generalized plasticity model
show good agreement with laboratory data and theoretical prediction
in comparison the other models.