Abstract: To support user mobility for a wireless network new mechanisms are needed and are fundamental, such as paging, location updating, routing, and handover. Also an important key feature is mobile QoS offered by the WATM. Several ATM network protocols should be updated to implement mobility management and to maintain the already ATM QoS over wireless ATM networks. A survey of the various schemes and types of handover is provided. Handover procedure allows guarantee the terminal connection reestablishment when it moves between areas covered by different base stations. It is useful to satisfy user radio link transfer without interrupting a connection. However, failure to offer efficient solutions will result in handover important packet loss, severe delays and degradation of QoS offered to the applications. This paper reviews the requirements, characteristics and open issues of wireless ATM, particularly with regard to handover. It introduces key aspects of WATM and mobility extensions, which are added in the fixed ATM network. We propose a flexible approach for handover management that will minimize the QoS deterioration. Functional entities of this flexible approach are discussed in order to achieve minimum impact on the connection quality when a MT crosses the BS.
Abstract: Small signal stability causes small perturbations in the
generator that can cause instability in the power network. It is
generally known that small signal stability are directly related to the
generator and load properties. This paper examines the effects of
generator input variations on power system oscillations for a small
signal stability study. Eigenvaules and eigenvectors are used to
examine the stability of the power system. The dynamic power
system's mathematical model is constructed and thus calculated using
load flow and small signal stability toolbox on MATLAB. The power
system model is based on a 3-machine 9-bus system that was
modified to suit this study. In this paper, Participation Factors are a
means to gauge the effects of variation in generation with other
parameters on the network are also incorporated.
Abstract: The objective of this paper is to a design of pattern
classification model based on the back-propagation (BP) algorithm for
decision support system. Standard BP model has done full connection
of each node in the layers from input to output layers. Therefore, it
takes a lot of computing time and iteration computing for good
performance and less accepted error rate when we are doing some
pattern generation or training the network.
However, this model is using exclusive connection in between
hidden layer nodes and output nodes. The advantage of this model is
less number of iteration and better performance compare with standard
back-propagation model. We simulated some cases of classification
data and different setting of network factors (e.g. hidden layer number
and nodes, number of classification and iteration). During our
simulation, we found that most of simulations cases were satisfied by
BP based using exclusive connection network model compared to
standard BP. We expect that this algorithm can be available to
identification of user face, analysis of data, mapping data in between
environment data and information.
Abstract: It is important to provide possibility of so called
“handover" for the mobile subscriber from GSM network to Wi-Fi
network and back. To solve specified problem it is necessary to
estimate connection time between base station and wireless access
point. Difficulty to estimate this parameter is that it doesn-t described
in specifications of the standard and, hence, no recommended value
is given.
In this paper, the analytical model is presented that allows the
estimating connection time between base station and IEEE 802.11
access point.
Abstract: Avoidable unscheduled maintenance events and unnecessary
spare parts deliveries are mostly caused by an incorrect choice
of the underlying maintenance strategy. For a faster and more efficient
supply of spare parts for aircrafts of an airline we examine options for
improving the underlying logistics network integrated in an existing
aviation industry network. This paper presents a dynamic prediction
model as decision support for maintenance method selection considering
requirements of an entire flight network. The objective is
to guarantee a high supply of spare parts by an optimal interaction
of various network levels and thus to reduce unscheduled maintenance
events and minimize total costs. By using a prognostics-based
preventive maintenance strategy unscheduled component failures are
avoided for an increase in availability and reliability of the entire
system. The model is intended for use in an aviation company that
utilizes a structured planning process based on collected failures data
of components.
Abstract: Bond Graph as a unified multidisciplinary tool is widely
used not only for dynamic modelling but also for Fault Detection and
Isolation because of its structural and causal proprieties. A binary
Fault Signature Matrix is systematically generated but to make the
final binary decision is not always feasible because of the problems
revealed by such method. The purpose of this paper is introducing a
methodology for the improvement of the classical binary method of
decision-making, so that the unknown and identical failure signatures
can be treated to improve the robustness. This approach consists of
associating the evaluated residuals and the components reliability data
to build a Hybrid Bayesian Network. This network is used in two
distinct inference procedures: one for the continuous part and the
other for the discrete part. The continuous nodes of the network are
the prior probabilities of the components failures, which are used by
the inference procedure on the discrete part to compute the posterior
probabilities of the failures. The developed methodology is applied
to a real steam generator pilot process.
Abstract: This paper focuses on reducing the power consumption
of wireless sensor networks. Therefore, a communication protocol
named LEACH (Low-Energy Adaptive Clustering Hierarchy) is modified.
We extend LEACHs stochastic cluster-head selection algorithm
by a modifying the probability of each node to become cluster-head
based on its required energy to transmit to the sink. We present
an efficient energy aware routing algorithm for the wireless sensor
networks. Our contribution consists in rotation selection of clusterheads
considering the remoteness of the nodes to the sink, and then,
the network nodes residual energy. This choice allows a best distribution
of the transmission energy in the network. The cluster-heads
selection algorithm is completely decentralized. Simulation results
show that the energy is significantly reduced compared with the
previous clustering based routing algorithm for the sensor networks.
Abstract: Proprietary sensor network systems are typically expensive, rigid and difficult to incorporate technologies from other vendors. When using competing and incompatible technologies, a non-proprietary system is complex to create because it requires significant technical expertise and effort, which can be more expensive than a proprietary product. This paper presents the Sensor Abstraction Layer (SAL) that provides middleware architectures with a consistent and uniform view of heterogeneous sensor networks, regardless of the technologies involved. SAL abstracts and hides the hardware disparities and specificities related to accessing, controlling, probing and piloting heterogeneous sensors. SAL is a single software library containing a stable hardware-independent interface with consistent access and control functions to remotely manage the network. The end-user has near-real-time access to the collected data via the network, which results in a cost-effective, flexible and simplified system suitable for novice users. SAL has been used for successfully implementing several low-cost sensor network systems.
Abstract: The overlay approach has been widely used by many service providers for Traffic Engineering (TE) in large Internet backbones. In the overlay approach, logical connections are set up between edge nodes to form a full mesh virtual network on top of the physical topology. IP routing is then run over the virtual network. Traffic engineering objectives are achieved through carefully routing logical connections over the physical links. Although the overlay approach has been implemented in many operational networks, it has a number of well-known scaling issues. This paper proposes a new approach to achieve traffic engineering without full-mesh overlaying with the help of integrated approach and equal subset split method. Traffic engineering needs to determine the optimal routing of traffic over the existing network infrastructure by efficiently allocating resource in order to optimize traffic performance on an IP network. Even though constraint-based routing [1] of Multi-Protocol Label Switching (MPLS) is developed to address this need, since it is not widely tested or debugged, Internet Service Providers (ISPs) resort to TE methods under Open Shortest Path First (OSPF), which is the most commonly used intra-domain routing protocol. Determining OSPF link weights for optimal network performance is an NP-hard problem. As it is not possible to solve this problem, we present a subset split method to improve the efficiency and performance by minimizing the maximum link utilization in the network via a small number of link weight modifications. The results of this method are compared against results of MPLS architecture [9] and other heuristic methods.
Abstract: The major challenge faced by wireless sensor networks is security. Because of dynamic and collaborative nature of sensor networks the connected sensor devices makes the network unusable. To solve this issue, a trust model is required to find malicious, selfish and compromised insiders by evaluating trust worthiness sensors from the network. It supports the decision making processes in wireless sensor networks such as pre key-distribution, cluster head selection, data aggregation, routing and self reconfiguration of sensor nodes. This paper discussed the kinds of trust model, trust metrics used to address attacks by monitoring certain behavior of network. It describes the major design issues and their countermeasures of building trust model. It also discusses existing trust models used in various decision making process of wireless sensor networks.
Abstract: In this paper, we evaluate the performance of the
Hybrid-MIMO Receiver Scheme (HMRS) in Cognitive Radio
network (CR-network). We investigate the efficiency of the proposed
scheme which the energy level and user number of primary user are
varied according to the characteristic of CR-network. HMRS can
allow users to transmit either Space-Time Block Code (STBC) or
Spatial-Multiplexing (SM) streams simultaneously by using
Successive Interference Cancellation (SIC) and Maximum Likelihood
Detection (MLD). From simulation, the results indicate that the
interference level effects to the performance of HMRS. Moreover,
the exact closed-form capacity of the proposed scheme is derived and
compared with STBC scheme.
Abstract: Sensor networks are often deployed in unattended
environments, thus leaving these networks vulnerable to false data
injection attacks in which an adversary injects forged reports into the
network through compromised nodes, with the goal of deceiving the
base station or depleting the resources of forwarding nodes. Several
research solutions have been recently proposed to detect and drop such
forged reports during the forwarding process. Each design can provide
the equivalent resilience in terms of node compromising. However,
their energy consumption characteristics differ from each other. Thus,
employing only a single filtering scheme for a network is not a
recommendable strategy in terms of energy saving. It's very important
the threshold determination for message authentication to identify. We
propose the recursive contract net protocols which less energy level of
terminal node in wireless sensor network.
Abstract: We introduce an algorithm based on the
morphological shared-weight neural network. Being nonlinear and
translation-invariant, the MSNN can be used to create better
generalization during face recognition. Feature extraction is
performed on grayscale images using hit-miss transforms that are
independent of gray-level shifts. The output is then learned by
interacting with the classification process. The feature extraction and
classification networks are trained together, allowing the MSNN to
simultaneously learn feature extraction and classification for a face.
For evaluation, we test for robustness under variations in gray levels
and noise while varying the network-s configuration to optimize
recognition efficiency and processing time. Results show that the
MSNN performs better for grayscale image pattern classification
than ordinary neural networks.
Abstract: We have developed a distributed asynchronous Web
based training system. In order to improve the scalability and robustness
of this system, all contents and functions are realized on mobile
agents. These agents are distributed to computers, and they can use
a Peer to Peer network that modified Content-Addressable Network.
In the proposed system, only text data can be included in a exercise.
To make our proposed system more useful, the mechanism that it not
only adapts to multimedia data but also it doesn-t influence the user-s
learning even if the size of exercise becomes large is necessary.
Abstract: RC4 was used as an encryption algorithm in WEP(Wired Equivalent Privacy) protocol that is a standardized for 802.11 wireless network. A few attacks followed, indicating certain weakness in the design. In this paper, we proposed a new variant of RC4 stream cipher. The new version of the cipher does not only appear to be more secure, but its keystream also has large period, large complexity and good statistical properties.
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: This paper proposes a way to track persons by making use of multiple non-overlapping cameras. Tracking persons on multiple non-overlapping cameras enables data communication among cameras through the network connection between a camera and a computer, while at the same time transferring human feature data captured by a camera to another camera that is connected via the network. To track persons with a camera and send the tracking data to another camera, the proposed system uses a hierarchical human model that comprises a head, a torso, and legs. The feature data of the person being modeled are transferred to the server, after which the server sends the feature data of the human model to the cameras connected over the network. This enables a camera that captures a person's movement entering its vision to keep tracking the recognized person with the use of the feature data transferred from the server.
Abstract: QoS routing is an important component of Traffic
Engineering in networks that provide QoS guarantees. QoS routing is dependent on the link state information which is typically flooded across the network. This affects both the quality
of the routing and the utilization of the network resources. In
this paper, we examine establishing QoS routes with partial state
updates in wired sensor networks.
Abstract: In this paper we study the resource allocation problem
for an OFDMA based cooperative two-way relaying (TWR) network.
We focus on amplify and forward (AF) analog network coding
(ANC) protocol. An optimization problem for two basic resources
namely, sub-carrier and power is formulated for multi-user TWR
networks. A joint optimal optimization problem is investigated and
two-step low complexity sub-optimal resource allocation algorithm is
proposed for multi-user TWR networks with ANC protocol. The
proposed algorithm has been evaluated in term of total achievable
system sum-rate and achievable individual sum-rate for each userpair.
The good tradeoff between system sum-rate and fairness is
observed in the two-step proportional resource allocation scheme.
Abstract: The survey and classification of the different security
attacks in structured peer-to-peer (P2P) overlay networks can be
useful to computer system designers, programmers, administrators,
and users. In this paper, we attempt to provide a taxonomy of
structured P2P overlay networks security attacks. We have specially
focused on the way these attacks can arise at each level of the
network. Moreover, we observed that most of the existing systems
such as Content Addressable Network (CAN), Chord, Pastry,
Tapestry, Kademlia, and Viceroy suffer from threats and vulnerability
which lead to disrupt and corrupt their functioning. We hope that our
survey constitutes a good help for who-s working on this area of
research.