Abstract: Many systems in the natural world exhibit chaos or non-linear behavior, the complexity of which is so great that they appear to be random. Identification of chaos in experimental data is essential for characterizing the system and for analyzing the predictability of the data under analysis. The Lyapunov exponents provide a quantitative measure of the sensitivity to initial conditions and are the most useful dynamical diagnostic for chaotic systems. However, it is difficult to accurately estimate the Lyapunov exponents of chaotic signals which are corrupted by a random noise. In this work, a method for estimation of Lyapunov exponents from noisy time series using unscented transformation is proposed. The proposed methodology was validated using time series obtained from known chaotic maps. In this paper, the objective of the work, the proposed methodology and validation results are discussed in detail.
Abstract: In practice, wireless networks has the property that
the signal strength attenuates with respect to the distance from the
base station, it could be better if the nodes at two hop away are
considered for better quality of service. In this paper, we propose a
procedure to identify delay preserving substructures for a given
wireless ad-hoc network using a new graph operation G 2 – E (G) =
G* (Edge difference of square graph of a given graph and the
original graph). This operation helps to analyze some induced
substructures, which preserve delay in communication among them.
This operation G* on a given graph will induce a graph, in which 1-
hop neighbors of any node are at 2-hop distance in the original
network. In this paper, we also identify some delay preserving
substructures in G*, which are (i) set of all nodes, which are mutually
at 2-hop distance in G that will form a clique in G*, (ii) set of nodes
which forms an odd cycle C2k+1 in G, will form an odd cycle in G*
and the set of nodes which form a even cycle C2k in G that will form
two disjoint companion cycles ( of same parity odd/even) of length k
in G*, (iii) every path of length 2k+1 or 2k in G will induce two
disjoint paths of length k in G*, and (iv) set of nodes in G*, which
induces a maximal connected sub graph with radius 1 (which
identifies a substructure with radius equal 2 and diameter at most 4 in
G). The above delay preserving sub structures will behave as good
clusters in the original network.
Abstract: Electronic Systems are the core of everyday lives.
They form an integral part in financial networks, mass transit,
telephone systems, power plants and personal computers. Electronic
systems are increasingly based on complex VLSI (Very Large Scale
Integration) integrated circuits. Initial electronic design automation is
concerned with the design and production of VLSI systems. The next
important step in creating a VLSI circuit is Physical Design. The
input to the physical design is a logical representation of the system
under design. The output of this step is the layout of a physical
package that optimally or near optimally realizes the logical
representation. Physical design problems are combinatorial in nature
and of large problem sizes. Darwin observed that, as variations are
introduced into a population with each new generation, the less-fit
individuals tend to extinct in the competition of basic necessities.
This survival of fittest principle leads to evolution in species. The
objective of the Genetic Algorithms (GA) is to find an optimal
solution to a problem .Since GA-s are heuristic procedures that can
function as optimizers, they are not guaranteed to find the optimum,
but are able to find acceptable solutions for a wide range of
problems. This survey paper aims at a study on Efficient Algorithms
for VLSI Physical design and observes the common traits of the
superior contributions.
Abstract: Security has been an important issue and concern in the
smart home systems. Smart home networks consist of a wide range of
wired or wireless devices, there is possibility that illegal access to
some restricted data or devices may happen. Password-based
authentication is widely used to identify authorize users, because this
method is cheap, easy and quite accurate. In this paper, a neural
network is trained to store the passwords instead of using verification
table. This method is useful in solving security problems that
happened in some authentication system. The conventional way to
train the network using Backpropagation (BPN) requires a long
training time. Hence, a faster training algorithm, Resilient
Backpropagation (RPROP) is embedded to the MLPs Neural
Network to accelerate the training process. For the Data Part, 200
sets of UserID and Passwords were created and encoded into binary
as the input. The simulation had been carried out to evaluate the
performance for different number of hidden neurons and combination
of transfer functions. Mean Square Error (MSE), training time and
number of epochs are used to determine the network performance.
From the results obtained, using Tansig and Purelin in hidden and
output layer and 250 hidden neurons gave the better performance. As
a result, a password-based user authentication system for smart home
by using neural network had been developed successfully.
Abstract: Mobile Ad hoc Network (MANET) is a wireless ad hoc self-configuring network of mobile routers (and associated hosts) connected by wireless links, the union of which forms an arbitrary topology, cause of the random mobility of the nodes. In this paper, an attempt has been made to compare these three protocols DSDV, AODV and DSR on the performance basis under different traffic protocols namely CBR and TCP in a large network. The simulation tool is NS2, the scenarios are made to see the effect of pause times. The results presented in this paper clearly indicate that the different protocols behave differently under different pause times. Also, the results show the main characteristics of different traffic protocols operating on MANETs and thus select the best protocol on each scenario.
Abstract: Many corporations are seriously concerned about
security of networks and therefore, their network supervisors are still
reluctant to install WLANs. In this regards, the IEEE802.11i standard
was developed to address the security problems, even though the
mistrust of the wireless LAN technology is still existing. The thought
was that the best security solutions could be found in open standards
based technologies that can be delivered by Virtual Private
Networking (VPN) being used for long time without addressing any
security holes for the past few years. This work, addresses this issue
and presents a simulated wireless LAN of IEEE802.11g protocol, and
analyzes impact of integrating Virtual Private Network technology to
secure the flow of traffic between the client and the server within the
LAN, using OPNET WLAN utility. Two Wireless LAN scenarios
have been introduced and simulated. These are based on normal
extension to a wired network and VPN over extension to a wired
network. The results of the two scenarios are compared and indicate
the impact of improving performance, measured by response time
and load, of Virtual Private Network over wireless LAN.
Abstract: These days wireless local area networks has become
very popular, when the initial IEEE802.11 is the standard for
providing wireless connectivity to automatic machinery, equipment
and stations that require rapid deployment, which may be portable,
handheld or which may be mounted on moving vehicles within a
local area. IEEE802.11 Wireless local area network is a sharedmedium
communication network that transmits information over
wireless links for all IEEE802.11 stations in its transmission range to
receive. When a user is moving from one location to another, how
the other user knows about the required station inside WLAN. For
that we designed and implemented a system to locate a mobile user
inside the wireless local area network based on RSSI with the help of
four specially designed architectures. These architectures are based
on statistical or we can say manual configuration of mapping and
radio map of indoor and outdoor location with the help of available
Sniffer based and cluster based techniques. We found a better
location of a mobile user in WLAN. We tested this work in indoor
and outdoor environments with different locations with the help of
Pamvotis, a simulator for WLAN.
Abstract: A generalization of the concepts of Feistel Networks (FN), known as Extended Feistel Network (EFN) is examined. EFN splits the input blocks into n > 2 sub-blocks. Like conventional FN, EFN consists of a series of rounds whereby at least one sub-block is subjected to an F function. The function plays a key role in the diffusion process due to its completeness property. It is also important to note that in EFN the F-function is the most computationally expensive operation in a round. The aim of this paper is to determine a suitable type of EFN for a scalable cipher. This is done by analyzing the threshold number of rounds for different types of EFN to achieve the completeness property as well as the number of F-function required in the network. The work focuses on EFN-Type I, Type II and Type III only. In the analysis it is found that EFN-Type II and Type III diffuses at the same rate and both are faster than Type-I EFN. Since EFN-Type-II uses less F functions as compared to EFN-Type III, therefore Type II is the most suitable EFN for use in a scalable cipher.
Abstract: A mobile Ad-hoc network consists of wireless nodes
communicating without the need for a centralized administration. A
user can move anytime in an ad hoc scenario and, as a result, such a
network needs to have routing protocols which can adopt
dynamically changing topology. To accomplish this, a number of ad
hoc routing protocols have been proposed and implemented, which
include DSR, OLSR and AODV. This paper presents a study on the
QoS parameters for MANET application traffics in large-scale
scenarios with 50 and 120 nodes. The application traffics analyzed in
this study is File Transfer Protocol (FTP). In large scale networks
(120 nodes) OLSR shows better performance and in smaller scale
networks (50 nodes)AODV shows less packet drop rate and OLSR
shows better throughput.
Abstract: Integrated fiber-wireless (FiWi) access networks are a viable solution that can deliver the high profile quadruple play services. Passive optical networks (PON) networks integrated with wireless access networks provide ubiquitous characteristics for high bandwidth applications. Operation of PON improves by employing a variety of multiplexing techniques. One of it is time division/wavelength division multiplexed (TDM/WDM) architecture that improves the performance of optical-wireless access networks. This paper proposes a novel feedback-based TDM/WDM-PON architecture and introduces a model of integrated PON-FiWi networks. Feedback-based link architecture is an efficient solution to improves the performance of optical-line-terminal (OLT) and interlink optical-network-units (ONUs) communication. Furthermore, the feedback-based WDM/TDM-PON architecture is compared with existing architectures in terms of capacity of network throughput.
Abstract: Wavelet neural networks (WNNs) have emerged as a vital alternative to the vastly studied multilayer perceptrons (MLPs) since its first implementation. In this paper, we applied various clustering algorithms, namely, K-means (KM), Fuzzy C-means (FCM), symmetry-based K-means (SBKM), symmetry-based Fuzzy C-means (SBFCM) and modified point symmetry-based K-means (MPKM) clustering algorithms in choosing the translation parameter of a WNN. These modified WNNs are further applied to the heterogeneous cancer classification using benchmark microarray data and were compared against the conventional WNN with random initialization method. Experimental results showed that a WNN classifier with the MPKM algorithm is more precise than the conventional WNN as well as the WNNs with other clustering algorithms.
Abstract: Smart Grids employ wireless sensor networks for
their control and monitoring. Sensors are characterized by limitations
in the processing power, energy supply and memory spaces, which
require a particular attention on the design of routing and data
management algorithms.
Since most routing algorithms for sensor networks, focus on
finding energy efficient paths to prolong the lifetime of sensor
networks, the power of sensors on efficient paths depletes quickly,
and consequently sensor networks become incapable of monitoring
events from some parts of their target areas. In consequence, the
design of routing protocols should consider not only energy
efficiency paths, but also energy efficient algorithms in general.
In this paper we propose an energy efficient routing protocol for
wireless sensor networks without the support of any location
information system. The reliability and the efficiency of this protocol
have been demonstrated by simulation studies where we compare
them to the legacy protocols. Our simulation results show that these
algorithms scale well with network size and density.
Abstract: Symbolic Circuit Analysis (SCA) is a technique used
to generate the symbolic expression of a network. It has become a
well-established technique in circuit analysis and design. The
symbolic expression of networks offers excellent way to perform
frequency response analysis, sensitivity computation, stability
measurements, performance optimization, and fault diagnosis. Many
approaches have been proposed in the area of SCA offering different
features and capabilities. Numerical Interpolation methods are very
common in this context, especially by using the Fast Fourier
Transform (FFT). The aim of this paper is to present a method for
SCA that depends on the use of Wavelet Transform (WT) as a
mathematical tool to generate the symbolic expression for large
circuits with minimizing the analysis time by reducing the number of
computations.
Abstract: As computer network technology becomes
increasingly complex, it becomes necessary to place greater
requirements on the validity of developing standards and the
resulting technology. Communication networks are based on large
amounts of protocols. The validity of these protocols have to be
proved either individually or in an integral fashion. One strategy for
achieving this is to apply the growing field of formal methods.
Formal methods research defines systems in high order logic so that
automated reasoning can be applied for verification. In this research
we represent and implement a formerly announced multicast protocol
in Prolog language so that certain properties of the protocol can be
verified. It is shown that by using this approach some minor faults in
the protocol were found and repaired. Describing the protocol as
facts and rules also have other benefits i.e. leads to a process-able
knowledge. This knowledge can be transferred as ontology between
systems in KQML format. Since the Prolog language can increase its
knowledge base every time, this method can also be used to learn an
intelligent network.
Abstract: In this work, we present an automatic vehicle detection
system for airborne videos using combined features. We propose a
pixel-wise classification method for vehicle detection using Dynamic
Bayesian Networks. In spite of performing pixel-wise classification,
relations among neighboring pixels in a region are preserved in the
feature extraction process. The main novelty of the detection scheme is
that the extracted combined features comprise not only pixel-level
information but also region-level information. Afterwards, tracking is
performed on the detected vehicles. Tracking is performed using
efficient Kalman filter with dynamic particle sampling. Experiments
were conducted on a wide variety of airborne videos. We do not
assume prior information of camera heights, orientation, and target
object sizes in the proposed framework. The results demonstrate
flexibility and good generalization abilities of the proposed method on
a challenging dataset.
Abstract: A gene network gives the knowledge of the regulatory
relationships among the genes. Each gene has its activators and
inhibitors that regulate its expression positively and negatively
respectively. Genes themselves are believed to act as activators and
inhibitors of other genes. They can even activate one set of genes and
inhibit another set. Identifying gene networks is one of the most
crucial and challenging problems in Bioinformatics. Most work done
so far either assumes that there is no time delay in gene regulation or
there is a constant time delay. We here propose a Dynamic Time-
Lagged Correlation Based Method (DTCBM) to learn the gene
networks, which uses time-lagged correlation to find the potential
gene interactions, and then uses a post-processing stage to remove
false gene interactions to common parents, and finally uses dynamic
correlation thresholds for each gene to construct the gene network.
DTCBM finds correlation between gene expression signals shifted in
time, and therefore takes into consideration the multi time delay
relationships among the genes. The implementation of our method is
done in MATLAB and experimental results on Saccharomyces
cerevisiae gene expression data and comparison with other methods
indicate that it has a better performance.
Abstract: The modern queueing theory is one of the powerful
tools for a quantitative and qualitative analysis of communication systems, computer networks, transportation systems, and many other technical systems. The paper is designated to the analysis of queueing
systems, arising in the networks theory and communications theory
(called open queueing network). The authors of this research in the
sphere of queueing theory present the theorem about the law of the iterated logarithm (LIL) for the queue length of a customers in open
queueing network and its application to the mathematical model of
the open message switching system.
Abstract: Misalignment and unbalance are the major concerns
in rotating machinery. When the power supply to any rotating system
is cutoff, the system begins to lose the momentum gained during
sustained operation and finally comes to rest. The exact time period
from when the power is cutoff until the rotor comes to rest is called
Coast Down Time. The CDTs for different shaft cutoff speeds were
recorded at various misalignment and unbalance conditions. The
CDT reduction percentages were calculated for each fault and there
is a specific correlation between the CDT reduction percentage and
the severity of the fault. In this paper, radial basis network, a new
generation of artificial neural networks, has been successfully
incorporated for the prediction of CDT for misalignment and
unbalance conditions. Radial basis network has been found to be
successful in the prediction of CDT for mechanical faults in rotating
machinery.
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: QoS Routing aims to find paths between senders and
receivers satisfying the QoS requirements of the application which
efficiently using the network resources and underlying routing
algorithm to be able to find low-cost paths that satisfy given QoS
constraints. The problem of finding least-cost routing is known to be
NP hard or complete and some algorithms have been proposed to
find a near optimal solution. But these heuristics or algorithms either
impose relationships among the link metrics to reduce the complexity
of the problem which may limit the general applicability of the
heuristic, or are too costly in terms of execution time to be applicable
to large networks. In this paper, we analyzed two algorithms namely
Characterized Delay Constrained Routing (CDCR) and Optimized
Delay Constrained Routing (ODCR). The CDCR algorithm dealt an
approach for delay constrained routing that captures the trade-off
between cost minimization and risk level regarding the delay
constraint. The ODCR which uses an adaptive path weight function
together with an additional constraint imposed on the path cost, to
restrict search space and hence ODCR finds near optimal solution in
much quicker time.