Abstract: In multi hop wireless systems, such as ad hoc and
sensor networks, mobile ad hoc network applications are deployed,
security emerges as a central requirement. A particularly devastating
attack is known as the wormhole attack, where two or more malicious
colluding nodes create a higher level virtual tunnel in the network,
which is employed to transport packets between the tunnel end points.
These tunnels emulate shorter links in the network. In which
adversary records transmitted packets at one location in the network,
tunnels them to another location, and retransmits them into the
network. The wormhole attack is possible even if the attacker has not
compromised any hosts and even if all communication provides
authenticity and confidentiality. In this paper, we analyze wormhole
attack nature in ad hoc and sensor networks and existing methods of
the defending mechanism to detect wormhole attacks without require
any specialized hardware. This analysis able to provide in
establishing a method to reduce the rate of refresh time and the
response time to become more faster.
Abstract: Due to the limited lifetime of the nodes in ad hoc and sensor networks, energy efficiency needs to be an important design consideration in any routing algorithm. It is known that by employing a virtual backbone in a wireless network, the efficiency of any routing scheme for the network can be improved. One common design for routing protocols in mobile ad hoc networks is to use positioning information; we use the node-s geometric locations to introduce an algorithm that can construct the virtual backbone structure locally in 3D environment. The algorithm construction has a constant time.
Abstract: Among many different methods that are used for
optimizing different engineering problems mathematical (numerical)
optimization techniques are very important because they can easily
be used and are consistent with most of engineering problems. Many
studies and researches are done on stability analysis of three
dimensional (3D) slopes and the relating probable slip surfaces and
determination of factors of safety, but in most of them force
equilibrium equations, as in simplified 2D methods, are considered
only in two directions. In other words for decreasing mathematical
calculations and also for simplifying purposes the force equilibrium
equation in 3rd direction is omitted. This point is considered in just a
few numbers of previous studies and most of them have only given a
factor of safety and they haven-t made enough effort to find the most
probable slip surface. In this study shapes of the slip surfaces are
modeled, and safety factors are calculated considering the force
equilibrium equations in all three directions, and also the moment
equilibrium equation is satisfied in the slip direction, and using
nonlinear programming techniques the shape of the most probable
slip surface is determined. The model which is used in this study is a
3D model that is composed of three upper surfaces which can cover
all defined and probable slip surfaces. In this research the meshing
process is done in a way that all elements are prismatic with
quadrilateral cross sections, and the safety factor is defined on this
quadrilateral surface in the base of the element which is a part of the
whole slip surface. The method that is used in this study to find the
most probable slip surface is the non-linear programming method in
which the objective function that must get optimized is the factor of
safety that is a function of the soil properties and the coordinates of
the nodes on the probable slip surface. The main reason for using
non-linear programming method in this research is its quick
convergence to the desired responses. The final results show a good
compatibility with the previously used classical and 2D methods and
also show a reasonable convergence speed.
Abstract: Sensor Network are emerging as a new tool for
important application in diverse fields like military surveillance,
habitat monitoring, weather, home electrical appliances and others.
Technically, sensor network nodes are limited in respect to energy
supply, computational capacity and communication bandwidth. In
order to prolong the lifetime of the sensor nodes, designing efficient
routing protocol is very critical. In this paper, we illustrate the
existing routing protocol for wireless sensor network using data
centric approach and present performance analysis of these protocols.
The paper focuses in the performance analysis of specific protocol
namely Directed Diffusion and SPIN. This analysis reveals that the
energy usage is important features which need to be taken into
consideration while designing routing protocol for wireless sensor
network.
Abstract: The issue of real-time and reliable report delivery is extremely important for taking effective decision in a real world mission critical Wireless Sensor Network (WSN) based application. The sensor data behaves differently in many ways from the data in traditional databases. WSNs need a mechanism to register, process queries, and disseminate data. In this paper we propose an architectural framework for data placement and management. We propose a reliable and real time approach for data placement and achieving data integrity using self organized sensor clusters. Instead of storing information in individual cluster heads as suggested in some protocols, in our architecture we suggest storing of information of all clusters within a cell in the corresponding base station. For data dissemination and action in the wireless sensor network we propose to use Action and Relay Stations (ARS). To reduce average energy dissipation of sensor nodes, the data is sent to the nearest ARS rather than base station. We have designed our architecture in such a way so as to achieve greater energy savings, enhanced availability and reliability.
Abstract: Wireless Sensor Networks can be used to monitor the
physical phenomenon in such areas where human approach is nearly
impossible. Hence the limited power supply is the major constraint of
the WSNs due to the use of non-rechargeable batteries in sensor
nodes. A lot of researches are going on to reduce the energy
consumption of sensor nodes. Energy map can be used with
clustering, data dissemination and routing techniques to reduce the
power consumption of WSNs. Energy map can also be used to know
which part of the network is going to fail in near future. In this paper,
Energy map is constructed using the prediction based approach.
Adaptive alpha GM(1,1) model is used as the prediction model.
GM(1,1) is being used worldwide in many applications for predicting
future values of time series using some past values due to its high
computational efficiency and accuracy.
Abstract: Wireless sensor networks (WSNs) have gained
tremendous attention in recent years due to their numerous
applications. Due to the limited energy resource, energy efficient
operation of sensor nodes is a key issue in wireless sensor networks.
Cooperative caching which ensures sharing of data among various
nodes reduces the number of communications over the wireless
channels and thus enhances the overall lifetime of a wireless sensor
network. In this paper, we propose a cooperative caching scheme
called ZCS (Zone Cooperation at Sensors) for wireless sensor
networks. In ZCS scheme, one-hop neighbors of a sensor node form a
cooperative cache zone and share the cached data with each other.
Simulation experiments show that the ZCS caching scheme achieves
significant improvements in byte hit ratio and average query latency
in comparison with other caching strategies.
Abstract: The classification of the protein structure is commonly
not performed for the whole protein but for structural domains, i.e.,
compact functional units preserved during evolution. Hence, a first
step to a protein structure classification is the separation of the
protein into its domains. We approach the problem of protein domain
identification by proposing a novel graph theoretical algorithm. We
represent the protein structure as an undirected, unweighted and
unlabeled graph which nodes correspond the secondary structure
elements of the protein. This graph is call the protein graph. The
domains are then identified as partitions of the graph corresponding
to vertices sets obtained by the maximization of an objective function,
which mutually maximizes the cycle distributions found in the
partitions of the graph. Our algorithm does not utilize any other kind
of information besides the cycle-distribution to find the partitions. If
a partition is found, the algorithm is iteratively applied to each of
the resulting subgraphs. As stop criterion, we calculate numerically
a significance level which indicates the stability of the predicted
partition against a random rewiring of the protein graph. Hence,
our algorithm terminates automatically its iterative application. We
present results for one and two domain proteins and compare our
results with the manually assigned domains by the SCOP database
and differences are discussed.
Abstract: A method based on the power series solution is proposed to solve the natural frequency of flapping vibration for the rotating inclined Euler beam with constant angular velocity. The vibration of the rotating beam is measured from the position of the corresponding steady state axial deformation. In this paper the governing equations for linear vibration of a rotating Euler beam are derived by the d'Alembert principle, the virtual work principle and the consistent linearization of the fully geometrically nonlinear beam theory in a rotating coordinate system. The governing equation for flapping vibration of the rotating inclined Euler beam is linear ordinary differential equation with variable coefficients and is solved by a power series with four independent coefficients. Substituting the power series solution into the corresponding boundary conditions at two end nodes of the rotating beam, a set of homogeneous equations can be obtained. The natural frequencies may be determined by solving the homogeneous equations using the bisection method. Numerical examples are studied to investigate the effect of inclination angle on the natural frequency of flapping vibration for rotating inclined Euler beams with different angular velocity and slenderness ratio.
Abstract: The purpose of this study is to suggest energy efficient
routing for ad hoc networks which are composed of nodes with limited
energy. There are diverse problems including limitation of energy
supply of node, and the node energy management problem has been
presented. And a number of protocols have been proposed for energy
conservation and energy efficiency. In this study, the critical point of
the EA-MPDSR, that is the type of energy efficient routing using only
two paths, is improved and developed. The proposed TP-MESR uses
multi-path routing technique and traffic prediction function to increase
number of path more than 2. It also verifies its efficiency compared to
EA-MPDSR using network simulator (NS-2). Also, To give a
academic value and explain protocol systematically, research
guidelines which the Hevner(2004) suggests are applied. This
proposed TP-MESR solved the existing multi-path routing problem
related to overhead, radio interference, packet reassembly and it
confirmed its contribution to effective use of energy in ad hoc
networks.
Abstract: In this paper a PID control strategy using neural
network adaptive RASP1 wavelet for WECS-s control is proposed.
It is based on single layer feedforward neural networks with hidden
nodes of adaptive RASP1 wavelet functions controller and an infinite
impulse response (IIR) recurrent structure. The IIR is combined by
cascading to the network to provide double local structure resulting
in improving speed of learning. This particular neuro PID controller
assumes a certain model structure to approximately identify the
system dynamics of the unknown plant (WECS-s) and generate the
control signal. The results are applied to a typical turbine/generator
pair, showing the feasibility of the proposed solution.
Abstract: The lack of any centralized infrastructure in mobile ad
hoc networks (MANET) is one of the greatest security concerns in
the deployment of wireless networks. Thus communication in
MANET functions properly only if the participating nodes cooperate
in routing without any malicious intention. However, some of the
nodes may be malicious in their behavior, by indulging in flooding
attacks on their neighbors. Some others may act malicious by
launching active security attacks like denial of service. This paper
addresses few related works done on trust evaluation and
establishment in ad hoc networks. Related works on flooding attack
prevention are reviewed. A new trust approach based on the extent of
friendship between the nodes is proposed which makes the nodes to
co-operate and prevent flooding attacks in an ad hoc environment.
The performance of the trust algorithm is tested in an ad hoc network
implementing the Ad hoc On-demand Distance Vector (AODV)
protocol.
Abstract: Routing in mobile ad hoc networks is a challenging task because nodes are free to move randomly. In DSR like all On- Demand routing algorithms, route discovery mechanism is associated with great delay. More Clearly in DSR routing protocol to send route reply packet, when current route breaks, destination seeks a new route. In this paper we try to change route selection mechanism proactively. We also define a link stability parameter in which a stability value is assigned to each link. Given this feature, destination node can estimate stability of routes and can select the best and more stable route. Therefore we can reduce the delay and jitter of sending data packets.
Abstract: FlexRay, as a communication protocol for automotive
control systems, is developed to fulfill the increasing demand on the
electronic control units for implementing systems with higher safety
and more comfort. In this work, we study the impact of
radiation-induced soft errors on FlexRay-based steer-by-wire system.
We injected the soft errors into general purpose register set of FlexRay
nodes to identify the most critical registers, the failure modes of the
steer-by-wire system, and measure the probability distribution of
failure modes when an error occurs in the register file.
Abstract: Like any sentient organism, a smart environment
relies first and foremost on sensory data captured from the real
world. The sensory data come from sensor nodes of different
modalities deployed on different locations forming a Wireless Sensor
Network (WSN). Embedding smart sensors in humans has been a
research challenge due to the limitations imposed by these sensors
from computational capabilities to limited power. In this paper, we
first propose a practical WSN application that will enable blind
people to see what their neighboring partners can see. The challenge
is that the actual mapping between the input images to brain pattern
is too complex and not well understood. We also study the
connectivity problem in 3D/2D wireless sensor networks and propose
distributed efficient algorithms to accomplish the required
connectivity of the system. We provide a new connectivity algorithm
CDCA to connect disconnected parts of a network using cooperative
diversity. Through simulations, we analyze the connectivity gains
and energy savings provided by this novel form of cooperative
diversity in WSNs.
Abstract: This paper investigates the problem of sampling from transactional data streams. We introduce CFISDS as a content based sampling algorithm that works on a landmark window model of data streams and preserve more informed sample in sample space. This algorithm that work based on closed frequent itemset mining tasks, first initiate a concept lattice using initial data, then update lattice structure using an incremental mechanism.Incremental mechanism insert, update and delete nodes in/from concept lattice in batch manner. Presented algorithm extracts the final samples on demand of user. Experimental results show the accuracy of CFISDS on synthetic and real datasets, despite on CFISDS algorithm is not faster than exist sampling algorithms such as Z and DSS.
Abstract: In Virtual organization, Knowledge Discovery (KD)
service contains distributed data resources and computing grid nodes.
Computational grid is integrated with data grid to form Knowledge
Grid, which implements Apriori algorithm for mining association
rule on grid network. This paper describes development of parallel
and distributed version of Apriori algorithm on Globus Toolkit using
Message Passing Interface extended with Grid Services (MPICHG2).
The creation of Knowledge Grid on top of data and
computational grid is to support decision making in real time
applications. In this paper, the case study describes design and
implementation of local and global mining of frequent item sets. The
experiments were conducted on different configurations of grid
network and computation time was recorded for each operation. We
analyzed our result with various grid configurations and it shows
speedup of computation time is almost superlinear.
Abstract: The paper proposes a unified model for multimedia data retrieval which includes data representatives, content representatives, index structure, and search algorithms. The multimedia data are defined as k-dimensional signals indexed in a multidimensional k-tree structure. The benefits of using the k-tree unified model were demonstrated by running the data retrieval application on a six networked nodes test bed cluster. The tests were performed with two retrieval algorithms, one that allows parallel searching using a single feature, the second that performs a weighted cascade search for multiple features querying. The experiments show a significant reduction of retrieval time while maintaining the quality of results.
Abstract: Mobile Ad Hoc Networks (MANETs) are multi-hop
wireless networks in which all nodes cooperatively maintain network
connectivity. In such a multi-hop wireless network, every node may
be required to perform routing in order to achieve end-to-end
communication among nodes. These networks are energy constrained
as most ad hoc mobile nodes today operate with limited battery
power. Hence, it is important to minimize the energy consumption of
the entire network in order to maximize the lifetime of ad hoc
networks. In this paper, a mechanism involving the integration of
load balancing approach and transmission power control approach is
introduced to maximize the life-span of MANETs. The mechanism is
applied on Ad hoc On-demand Vector (AODV) protocol to make it
as energy aware AODV (EA_AODV). The simulation is carried out
using GloMoSim2.03 simulator. The results show that the proposed
mechanism reduces the average required transmission energy per
packet compared to the standard AODV.
Abstract: Wireless Sensor Networks consist of small battery
powered devices with limited energy resources. once deployed, the
small sensor nodes are usually inaccessible to the user, and thus
replacement of the energy source is not feasible. Hence, One of the
most important issues that needs to be enhanced in order to improve
the life span of the network is energy efficiency. to overcome this
demerit many research have been done. The clustering is the one of
the representative approaches. in the clustering, the cluster heads
gather data from nodes and sending them to the base station. In this
paper, we introduce a dynamic clustering algorithm using genetic
algorithm. This algorithm takes different parameters into
consideration to increase the network lifetime. To prove efficiency of
proposed algorithm, we simulated the proposed algorithm compared
with LEACH algorithm using the matlab