LATEST TITLES OF PROJECTS FOR COMPUTER SCIENCE (IEEE) STANDARD
click here to download full data base of cse ieee project titles with abstarcts
CONFERENCE-IEEE
INFOCOM
DOUBLE-COVERED
BROADCAST (DCB): A SIMPLE RELIABLE BROADCAST ALGORITHM IN MANETS:--JAVA--2004
Mobile ad hoc networks (MANETs)
suffer from high transmission error rate because of the nature of radio
communications. The broadcast operation, as a fundamental service in MANETs, is
prone to the broadcast storm problem if forward nodes are not carefully
designated. The objective of reducing the broadcast redundancy while still
providing high delivery ratio for each broadcast packet is a major challenge in
a dynamic environment. In this paper, we propose a simple, reliable broadcast
algorithm, called double-covered broadcast (DCB), that takes advantage of
broadcast redundancy to improve the delivery ratio in the environment that has
rather high transmission error rate. Among 1-hop neighbors of the sender, only
selected forward nodes retransmit the broadcast message. Forward nodes are
selected in such a way that (1) the sender’s 2-hop neighbors are covered and
(2) the sender’s 1-hop neighbors are either a forward node, or a non-forward
node but covered by at least two forwarding neighbors. The retransmissions of
the forward nodes are received by the sender as confirmation of their receiving
the packet. The non-forward 1-hop neighbors of the sender do not acknowledge
the reception of the broadcast. If the sender does not detect all its forward
nodes’ retransmissions, it will resend the packet until the maximum times of
retry is reached. Simulation results show that the algorithm provides good
performance for a broadcast operation under high transmission error rate
environment
COMBINATORIAL
APPROACH FOR PREVENTING SQL INJECTION ATTACKS:--J2EE--2009
A combinatorial approach for
protecting Web applications against SQL injection is discussed in this paper,
which is a novel idea of incorporating the uniqueness of Signature based method
and auditing method. The major issue of web application security is the SQL
Injection, which can give the attackers unrestricted access to the database
that underlie Web applications and has become increasingly frequent and
serious. From signature based method standpoint of view, it presents a
detection mode for SQL injection using pair wise sequence alignment of amino
acid code formulated from web application form parameter sent via web server.
On the other hand from the Auditing based method standpoint of view, it
analyzes the transaction to find out the malicious access. In signature based
method It uses an approach called Hirschberg algorithm, it is a divide and
conquer approach to reduce the time and space complexity. This system was able
to stop all of the successful attacks and did not generate any false positives.
INTERNATIONAL
CONFERENCE ON INTELLIGENT AND ADVANCED SYSTEMS
PREDICTIVE
JOB SCHEDULING IN A CONNECTION LIMITED SYSTEM USING PARALLEL GENETIC
ALGORITHM:--JAVA--2005
Job scheduling is the key feature of
any computing environment and the efficiency of computing depends largely on
the scheduling technique used. Intelligence is the key factor which is lacking
in the job scheduling techniques of today. Genetic algorithms are powerful
search techniques based on the mechanisms of natural selection and natural
genetics. Multiple jobs are handled by the scheduler and the resource the job
needs are in remote locations. Here we assume that the resource a job needs are
in a location and not split over nodes and each node that has a resource runs a
fixed number of jobs. The existing algorithms used are non predictive and
employs greedy based algorithms or a variant of it. The efficiency of the job
scheduling process would increase if previous experience and the genetic
algorithms are used. In this paper, we propose a model of the scheduling
algorithm where the scheduler can learn from previous experiences and an
effective job scheduling is achieved as time progresses.
CONFERENCE-IEEE
INFOCOM
DOUBLE-COVERED
BROADCAST (DCB): A SIMPLE RELIABLE BROADCAST ALGORITHM IN MANETS:--JAVA--2004
Mobile ad
hoc networks (MANETs) suffer from high transmission error rate because of the
nature of radio communications. The broadcast operation, as a fundamental
service in MANETs, is prone to the broadcast storm problem if forward nodes are
not carefully designated. The objective of reducing the broadcast redundancy
while still providing high delivery ratio for each broadcast packet is a major
challenge in a dynamic environment. In this paper, we propose a simple,
reliable broadcast algorithm, called double-covered broadcast (DCB), that takes
advantage of broadcast redundancy to improve the delivery ratio in the
environment that has rather high transmission error rate. Among 1-hop neighbors
of the sender, only selected forward nodes retransmit the broadcast message.
Forward nodes are selected in such a way that (1) the sender’s 2-hop neighbors
are covered and (2) the sender’s 1-hop neighbors are either a forward node, or
a non-forward node but covered by at least two forwarding neighbors. The
retransmissions of the forward nodes are received by the sender as confirmation
of their receiving the packet. The non-forward 1-hop neighbors of the sender do
not acknowledge the reception of the broadcast. If the sender does not detect
all its forward nodes’ retransmissions, it will resend the packet until the
maximum times of retry is reached. Simulation results show that the algorithm
provides good performance for a broadcast operation under high transmission
error rate environment
click here to download full data base of cse ieee project titles with abstarcts
