|
Home>Products>Journals
and Reviews>I.Re.Co.S.>Latest
issue
International Review
on Computers and Software - Papers
 Performance
Comparison of MANET Routing Protocols
by Jaspal Kumar,
Muralidhar Kulkarni, Daya Gupta
Vol. 5. n. 1, pp. 1-5
Abstract -
A Mobile Ad hoc Network
(MANET) is a collection of wireless mobile nodes forming a temporary
network without using any existing infrastructure. Since not many MANETs
are currently deployed, research in this area is simulation based. We
have compared different routing protocols like DSR, DSDV, AODV to study
the mobility characteristics of different scenarios in which MANETs may
be deployed. Evaluation of the impact of different mobility models on
the performance of these routing protocols is carried out, based upon
different parameters- throughput, Packet delivery ratio, end to end
delay, and offered traffic load. Also, mobility models are compared
based on these performance parameters in various routing protocols.
Copyright © 2010 Praise
Worthy Prize S.r.l. - All rights reserved
Keywords:
Mobile Ad hoc Network, Mobility Models, Performance Metrics,
Routing Protocols, NS2.
Proactive
Traffic Adaptive Tuning of Contention Window for Wireless Sensor Network
Medium Access Control Protocol
by Nesa Mouzehkesh,
Nor K. Noordin, Mohd Fadlee A. Rasid
Vol. 5. n. 1, pp. 6-13
Abstract - Sensor
MAC (S-MAC) as the very first MAC protocol for Wireless Sensor Network (WSN)
had been designed on top of the IEEE 802.11 MAC protocol along with some
added features to meet the especial requirements of a WSN. However the
Back-Off scheme of S-MAC is based on a fixed Contention Window (CW)
size. This is known as a significant sort of trouble spot in S-MAC in
the sense that the delay produced during collisions and idle listening
can be so critical to the limited battery lifetime of a sensor node.
IEEE 802.11 MAC protocol follows a static approach for obtaining the
back-off time and resets the CW to its default minimum upon just one
successful transmission and doubles it each time it faces a collision.
While the back-off algorithm of IEEE 802.11 suffers from fairness for
its faulty behavior in both high and low traffic loads, the back-off
mechanism in S-MAC suffers from a fixed CW size. Reducing the undesired
idle listening time caused by unnecessary long back-off times when
traffic is low and also decreasing the probability of collisions in
situations with high traffic load due to the fixed CW size in S-MAC have
motivated our research. We have tried to come up with a dynamic back-off
algorithm for S-MAC that can extract the current traffic information of
the network and engage them in estimating the contention window from
which the back-off time is chosen. Our approach is a proactive algorithm
to get the CW of the neighboring nodes ready before contending for the
medium. The performance of our algorithm has been measured in terms of
average delay, average throughput, delivery ratio, and average energy
efficiency. It is shown that our proactive protocol has reduced the
delay up to 47% and has decreased the energy consumption up to above 15%
over the current S-MAC implementation. The delivery ratio and throughput
have been improved up to 44% and 28% respectively.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Wireless Sensor Network (WSN), Medium Access Control Protocol (MAC),
Back-off, Contention Window.
SIFT
Points for Matching Aerial Images in Reduced Space
by K.
Houari, Y. Chahir, M. K. Kholladi, M. Benmohamed
Vol. 5. n. 1, pp. 14-21
Abstract - This
paper we propose a novel approach for matching cartographic images over
detecting interest points invariant to scale and affine transformations.
Our scale and affine invariant detectors are based on the following
recent results: Interest points extracted with the SIFT detector which
is adapted to affine transformations and give repeatable results
(geometrically stable). This provides a set of distinctive points which
are invariant to scale, rotation and translation as well as robust to
illumination changes and limited changes of viewpoint. The
characteristic scale determines a scale invariant region for each point.
The characteristic scale and the affine shape of neighborhood determine
an affine invariant region for each point. We apply an unsupervised
classification to reduce the space of sets of interest points by using
weighted bipartite graph matching in solving the point correspondence.
Diffusion map: projection of the bipartite graph in a reduce space on
which we apply K-means to classify the representatives clusters. The
performance of our approach detector is also confirmed by excellent
matching results.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Points, Local Features, Scale Invariance, Affine Invariance,
Matching and Recognition.
Network-On-Chip:
On-Chip Communication Solution
by
Rabindra Ku. Jena, Pankaj Srivastava, G. K. Sharma
Vol. 5. n. 1, pp. 22-33
Abstract - Due to
the interplay between increasing chip capacity and complex applications,
System-on-Chip (SoC) development is confronted by severe challenges,
such as managing deep submicron effects, scaling communication
architectures and bridging the productivity gap. Network-on-Chip (NoC)
has been a rapidly developed concept in recent years to tackle the
crisis with focus on network-based communication. NoC problems spread in
the whole SoC spectrum ranging from specification, design,
implementation to validation, from design methodology to tool support.
In this paper, we succinctly discuses the SoC communication issues and
highlights the benefit of NoC as an alternative. The paper also focuses
the research issues and trends in NoC.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
System-on-Chip, Network-on-Chip, On-chip Communication.
by M. M. Fakheri,
B. Mashoufi, T. Sedghi
Vol. 5. n. 1, pp. 34-43
Abstract - Human
fingerprints are rich in details called minutiae, which can be used as
identification marks for fingerprint verification. The goal of this
paper is to develop a complete system for fingerprint verification
through extracting and matching minutiae. A neural network is trained
using the back-propagation algorithm and will work as a classifier to
locate various minutiae. To achieve good minutiae extraction in
fingerprints with varying quality, preprocessing in form of binarization
and skeletonization is first applied on fingerprints before they are
evaluated by the neural network. Extracted minutiae are then considered
as a 2D point pattern problem and an efficient algorithm is used to
determine the number of matching points between two point patterns.
Performance of the developed system is evaluated on a database with
fingerprints from different people and experimental results are
presented.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Algorithm, Back Propagation, Fingerprint, Neural Nets.
A
Novel GA Based Approach to Farsi and Arabic Signature Verification
by Ezzat Alsous,
Fathi Nezam, S. Amirhassan Monadjemi, Naser Neamatbakhsh
Vol. 5. n. 1, pp. 44-51
Abstract - In this
paper, we describe the Farsi and Arabic signature recognition and
verification problem, and introduce a new offline method for Farsi and
Arabic signature verification. After analyzing the structures of typical
Farsi signatures, variety of features are proposed, extracted, and
tested to determine a high performance feature set for signatures
verifications. Features extracted include structural, statistical, mask,
histogram-based, and Zernike moments. In the classification stages, a
GA-based method for optimization of linear classifiers is implemented
and tested. The overall performance of system is evaluated on a set of
Farsi signatures and suggests the efficiency of applied methods with
around 86% correct verification. Regarding the high similarity between
Farsi and Arabic signatures, the method can be applied in Arabic
signature verification as well.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Signature Verification, Farsi/Arabic Signature, Genetic Algorithm,
Classification.
Context-Aware
Information Broker for Cloud Computing
by
Tomaž Klančnik, Borka Jerman Blažič
Vol. 5. n. 1, pp. 52-58
Abstract - In this
paper, a context-aware information broker for a Cloud computing is
presented. The broker recommends the most feasible Cloud provider based
on the cost and Quality of Service (QoS). The brokering model is based
on similarity measurements which are calculated using the Euclidean
distance between provider's offers and the user’s requirements. The
broker provides the user with a ranked list of providers based on a
minimum Euclidean distance. The QoS is the measure of a Cloud provider’s
reliability and the level of user satisfaction. The process of measuring
QoS relies on the user evaluations. A user evaluates the offered
resources after using them. This evaluation is critical to the broker as
it is the main source of input for calculating a user’s satisfaction and
a provider’s reputation. The broker uses beta reputation model to
calculate providers’ reputation. The feedback model keeps a record of
the time the feedback was given as older feedback information carries
less weight. In this paper, the information broker’s position in a
broader context and information broker’s architecture are presented. It
contains four key elements: Computational Resources Manager, QoS
Manager, Similarity Manager and Reputation Updater. A prototype of the
information broker was developed and analysed. The analysis shows that
the broker efficiently aided the user in searching for the most suitable
Cloud resources
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Cloud Computing, Information Brokering, QoS.
What
Were the Last Moves?
by M. Maliković,
M. Čubrilo
Vol. 5. n. 1, pp. 59-70
Abstract - This
paper presents a formal system for reasoning about retrograde chess
problems using Coq - a formal proof management system. The system is
divided into two parts. The first part describes the environment that
includes the axioms, definitions and hypotheses of chess objects, and
also the functions for computing changes in states. The second part is
developed for generating possible retrograde chess moves and includes
Coq’s tactics combined with the use of tacticals (elements of Ltac - the
Coq’s language for combining tactics). All of these tactics are defined
as one Ltac function. This approach enables reasoning about retrograde
chess problems with respect to reasoning about sequences of retrograde
moves. In the aforementioned Ltac function, a number of heuristic
solutions are implemented with the aim of solving the problems within a
big search space such as retrograde chess analysis.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Calculus of Inductive Constructions, Coq, Heuristics, Retrograde
Chess Analysis, Tactics.
A
Certificate Based Inquisition Approach for Routing Optimization in
Mobile IPv6
by D. Kavitha, K.
E. Sreenivasa Murthy, B. Sathyanarayana, V. Raghunatha Reddy, S. Zahoor
ul Huq
Vol. 5. n. 1, pp. 71-76
Abstract -
Mobile IPv6 (MIPv6) allows a Mobile Node to talk directly to its peers
while retaining the ability to move around and change the currently used
IP address. This mode of operation is called Route Optimization (RO), as
it allows the packets to traverse a shorter route than the default one
through the Home Agent. In Route Optimization, the peer node learns a
binding between the Mobile Node’s permanent Home Address and its current
temporary Care -
of- Address. Once such a binding is in place, the peer node will send
all packets whose destination is the Home Address to the Care -of-
Address. This is potentially dangerous, since a malicious host might be
able to establish false bindings, thereby preventing some packets from
reaching their intended destination, diverting some traffic to the
attacker, or flooding third parties with unwanted traffic. Most of the
proposed security protocols for routing optimization in Mobile IPv6,
depend on the special relationship between the home network and the
mobile node. In this paper we present a new protocol that does not
depend on the security relationship between the home network and the
mobile. The security of the protocol is analyzed and its performance
evaluation is also given.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Route Optimization, Mobile IPv6, Binding Update, Certificate based
Binding Update, authentication, Security.
Investigating
the Performance of Segmented CSMA/CD LANs under Various Retransmission
Control Algorithms
by Ibrahiem M. M.
El Emary
Vol. 5. n. 1, pp. 77-83
Abstract - The term
Carrier Sense Multiple Access/Collision Detection (CSMA/CD) is defined
for the protocol of Carrier Transmission Access in Ethernet networks
(International Standard IEEE 802.3). On Ethernet, any Network Interface
Card (NIC) can try to send a packet in a channel at any time. If another
NIC tries to send a packet at the same time, a collision is said to
occur and the packets are discarded. The CSMA/CD protocol was designed
to avoid this problem, more precisely to allow a NIC to send its packet
without collision. This is done by way of a randomized exponential
backoff process (one type of retransmission algorithms). In this paper,
we investigate the performance of a segmented local area network that
uses CSMA/CD as an access protocol when it works under various types of
retransmission algorithms to handle the collided packets. The reason
that let us deal with the segmentation approach for the network stations
is to reduce the effect of performance deterioration which has been
occurred as a result of existing heavy loads, since previous studies
indicate that CSMA/CD LANs behave well only under light load conditions.
To check the effect of using various types of retransmission algorithms
on such networks, we describe a package to simulate the operation
mechanism of these networks. It has been possible to compare the
simulated results in terms of average packet delay and average
collisions per second to those obtained by others previously approaches.
Facilities to perform parametric studies end provide users specified
output statistics (such as link utilization and buffer usage statistics)
are also available through the used simulation approach.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Network Interface Card (NIC), CAMA/CD, LAN, Bridge, Utilization,
Buffer, Partition, IEEE 802.3, EBK, FBK, LBK.
The
Impact of Cross-Layer Designs on Routing Ad Hoc Protocols
by Boumedjout Amel,
Mekkakia M. Zoulikha
Vol. 5. n. 1, pp. 84-88
Abstract - To
improve the performance of mobile ad hoc network (Manet), cross-layer
mechanisms are used. The challenge is to effectively handle frequent
topology changes caused by node mobility/failure and link disruption due
to interference and jamming. A number of cross-layer techniques have
been proposed to address this issue. In these solutions feedbacks are
used to enable state information flow from upper to lower layers or vice
versa, while the traditional layered structure is preserved. In this
paper, we proposed cross-layer designs among physical, medium access
control (Mac) and network layers, using Received Signal Strength (RSS)
as cross-layer interaction parameter for reliable route discovery and
reduction energy when transmitting data in mobile ad hoc network. The
NS2, Network Simulator is used to implement these proposed Cross-layer
designs.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Cross-Layer Designs, Manet, Energy Conservation, Reliable Route
Discovery.
A
Data-Mining-Based Localized Scheduling System for a Wafer Fab
by Horng-Ren Tsai,
Toly Chen
Vol. 5. n. 1, pp. 89-96
Abstract - This
paper constructs a data-mining-based localized scheduling system to
improve the performance of scheduling jobs in a wafer fabrication
factory (wafer fab). The system is modified from Chen’s tailored
nonlinear fluctuation smoothing (TNFS) rule with some innovative
treatments. First, the remaining cycle time of a job to be scheduled is
estimated with a data mining approach instead to improve the accuracy.
Second, in the original TNFS rule, the adjustable factor is static,
while in this system it becomes dynamic. Third, the adjustable factor is
also dependent on the stages of the jobs to be scheduled. Namely, the
TNFS rule is localized. To evaluate the effectiveness of the proposed
methodology, production simulation was also applied in this study.
According to experimental results, the proposed methodology outperformed
some existing approaches in reducing the average cycle time and cycle
time variation.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Data mining, Wafer Fab, Scheduling, Localized, Dynamic.
An
Empirical Study of Blog Marketing Based on Trust and Purchase Intention
by Ching-Chiang
Chen, Dong-Her Shih, Hsiu-Sen Chiang, Che-Hung Lin
Vol. 5. n. 1, pp. 97-105
Abstract - Recently,
blogs have become a new marketing channel, along with other forms of
network marketing. Thus, our research investigates the character and use
of blogs as a marketing platform, particularly with regard to online
auctions and efforts to increase both trust and purchase intentions. In
addition, our approach is distinct from others that we don't need any
models to make modifications. In this study of the relationships among
blog content, involvement, virtual community, trust and purchase
intentions, we utilize the Partial Least Square (PLS) statistical
analysis model to proceed with the quantitative analysis. In summary,
the results of an analysis of 130 valid questionnaires show that trust,
involvement and virtual community are the main factors that drive
purchase intentions. The findings of this study will be able to provide
considerable assistance to bloggers with regard to marketing strategies,
and particularly with respect to promote the personal characteristics of
a product, catch readers’ attention, enhance click rate, reduce costs
and increase profits.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Blog, Involvement, Virtual Community, Trust, Partial Least
Squares.
Real
Time Implementation of the Face Detection Algorithm Based Adaboost on
VLIW Processor
by Moad
Benkiniouar, Mohamed Benmohammad
Vol. 5. n. 1, pp. 106-112
Abstract - The
increase in the levels integrations of the circuits and the request
pressing for reduction execution times of the application led to the new
methodologies of implementation. This implies the design a strongly
architectures skeletal and reconfigurable. This paper presents a study
of the VLIW space processor for a real time system of vision based
adaboost, making it possible to locate faces in video sequences. With an
aim to compare the performances with other existing implementations,
this work consist in the identification of optimal processor parameters
representing the difference between the performances and processor
complexity.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Face Localization, Adaboost, Real Time Implementation, DSP, VLIW
Processor.
Content
Based Images Retrieval Using Decomposition Model Image
by M. H. Ould
Mohamed Dyla, S. Senhaji, H. Tairi, A. Aarab
Vol. 5. n. 1, pp. 113-118
Abstract - In this
paper, we have developed a CBIR methodology that uses a new
decomposition image based on PDE, the effective feature extraction is
performed not on the original image but on its components. The texture
features based on threshold Gabor features, are then calculated. Our
system was tested on Brodatz databases and can be used in others CBIR
applications. Retrieval efficiency and accuracy combining PDE
decomposition and Gabor wavelet based features is found to be superior
to other existing methods.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Content Based Image Retrieval, Gabor Wavelets, Image
Decomposition, Texture Component, Geometrical Component.
Evol-Onto:
a Methodology for Managing an Evolving Ontology from a Corpus of Texts
by N. Taleb, M.
Sellami
Vol. 5. n. 1, pp. 119128
Abstract - This
paper concerns ontology evolution from texts, which is one of the key
problems facing ontology users today. Domain knowledge is evolving over
time and should be reflected at the ontology level. Ontology evolution
from corpus is currently under study and its basic principles have not
been precisely defined according to our notion of evolution, which also
concerns addition, removal and updating of texts. Moreover, the
evolution processes are far from automated. We propose a bottom-up
methodology consisting in a rigorous analysis of changes, which ensures
that the ontology remains consistent after changes have been applied on
the linked corpus, i.e., the corpus from which the ontology has been
built.
The Evol-Onto methodology includes a change detection mechanism that
allows generating automatically a detailed overview of changes that have
occurred based on a set of change definitions. A software tool S-Evol-Onto
is being developed in order to automate the evolution process and to
lighten the cognitive load of users. The domain of experiment is the
medical one and especially cancer disease.
Copyright © 2010 Praise Worthy Prize S.r.l. -
All rights reserved
Keywords:
Evolution, corpus, ontology.
| 
