JAVA PROJECTS ABSTRACT

jumentousmanlyInternet και Εφαρμογές Web

21 Οκτ 2013 (πριν από 4 χρόνια και 17 μέρες)

167 εμφανίσεις


JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


NETWORKING

1.

AMPLE: An Adaptive Traffic Engineering System Based on Virtual Routing Topologies

Handling traffic dynamics in order to avoid network congestion and subsequent service disruptions is one of the key
tasks performed by contemporary network management systems. Given the simple but rigid routing and forwarding
functionalities in IP base env
ironments, efficient resource management and control solutions against dynamic traffic
conditions is still yet to be obtained. In this article, we introduce AMPLE


an efficient traffic engineering and
routing topologies for long term operation through the

optimized setting of link weights. Based on these diverse paths,
adaptive traffic control performs intelligent traffic splitting across individual routing topologies in reaction to the
monitored network dynamics at short timescale. According to our evalua
tion with real network topologies and traffic
traces, the proposed system is able to cope almost optimally with unpredicted traffic dynamics and, as such, it
constitutes a new proposal for achieving better quality of service and overall network performance

in IP networks.
Management system that performs adaptive traffic control by using multiple virtualized routing topologies. The
proposed system consists of two complementary components: offline link weight optimization that takes as input the
physical netw
ork topology and tries to produce maximum routing path diversity across multiple virtual

2.

Computing localized power efficient data aggregation in Trees for sensor network

We propose localized, self organizing, robust, and energy
-
efficient data aggregation

tree approaches for sensor
networks, which we call Localized Power
-
Efficient Data Aggregation Protocols (L
-
PEDAPs). They are based on
topologies, such as LMST and RNG, that can approximate minimum spanning tree and can be efficiently computed
using only p
osition or distance information of one
-
hop neighbors. The actual routing tree is constructed over these
topologies. We also consider different parent selection strategies while constructing a routing tree. We compare each
topology and parent selection stra
tegy and conclude that the best among them is the shortest path strategy over LMST
structure. Our solution also involves route Maintenance procedures that will be executed when a sensor node fails or a
new node is added to the network. The proposed solutio
n is also adapted to consider the remaining power levels of
nodes in order to increase the network lifetime. Our simulation results show that by using our power
-
aware localized
approach, we can almost have the same performance of a centralized solution in
terms of network lifetime, and close
to 90 percent of an upper bound derived here.


3.

Improving Energy Saving and Reliability in Wireless Sensor Networks Using a Simple CRT
-
Based
Packet
-
Forwarding Solution

This paper deals with a novel forwarding scheme for wireless sensor networks aimed at combining low
computational complexity and high performance in terms of energy efficiency and reliability. The proposed
approach relies on a packet
-
splitting algori
thm based on the Chinese Remainder Theorem (CRT) and is
characterized by a simple modular division between integers. An analytical model for estimating the energy
efficiency of the scheme is presented, and several practical issues such as the effec
t of unreliable channels, topology
changes, and MAC overhead are discussed. The results obtained show that the proposed algorithm outperforms
traditional approaches in terms of power saving, simplicity, and fair distribution of energy consumption a
mong all
nodes in the network.

4.

Continuous Neighbor Discovery in Asynchronous Sensor Networks

Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide
the client’s IP address from the server. The success of such networks, however, has been limited by users employing
this anonymity for a
busive purposes such as defacing popular Web sites. Web site administrators routinely rely on IP
-
address blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser
routes through an anonymizing network. As
a result, administrators block all known exit nodes of anonymizing
networks, denying anonymous access to misbehaving and behaving users alike. To address this problem, we present
Nymble, a system in which servers can “blacklist” misbehaving users, thereby
blocking users without compromising
their anonymity. Our system is thus agnostic to different servers’ definitions of misbehavior

servers can blacklist
users for whatever reason, and the privacy of blacklisted users is maintained




JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


5.

Energy Efficient Routin
g Mechanism in Wireless Sensor Network

This paper gives a brief idea about wireless sensor networks and energy efficient routing in wireless sensor networks.
Sensor networks are deployed in an ad hoc fashion, with individual nodes remaining largely inactiv
e for long periods
of time, but then becoming suddenly active when something is detected. Sensor Networks are generally battery
constrained. They are prone to failure, and therefore the sensor network topology changes frequently. In this paper, we
propose
a routing algorithm for Wireless Sensor Networks combining Energy Efficient and Hierarchical based routing
techniques which minimize the energy consumption, increase the lifetime of the sensor nodes and saves battery power.


6.

Adaptive Opportunistic Routing
for Wireless Ad Hoc Networks

A distributed adaptive opportunistic routing scheme for multihop wireless ad hoc networks is proposed. The proposed
scheme utilizes a reinforcement learning framework to opportunistically route the packets even in the absence o
f
reliable knowledge about channel statistics and network model. This scheme is shown to be optimal with respect to an
expected average per
-
packet reward criterion. The proposed routing scheme jointly addresses the issues of learning
and routing in an oppo
rtunistic context, where the network structure is characterized by the transmission success
probabilities. In particular, this learning framework leads to a stochastic routing scheme that optimally “explores” and
“exploits” the opportunities in the network
.


7.

The COQUOS approach to continuous queries in unstructured overlays. 2011

The current peer
-
to
-
peer (P2P) content distribution systems are constricted by their simple on
-
demand content
discovery mechanism. The utility of these systems can be greatly
enhanced by incorporating two capabilities, namely a
mechanism through which peers can register their long term interests with the network so that they can be
continuously noti_ed of new data items, and a means for the peers to advertise their contents. Al
though researchers
have proposed a few unstructured overlay
-
based publish
-
subscribe systems that provide the above capabilities, most of
these systems require intricate indexing and routing schemes, which not only make them highly complex but also
render t
he overlay network less _exible towards transient peers.

This paper argues that for many P2P applications
implementing full
-
_edged publish
-
subscribe systems is an overkill. For theseapplications, we study the alternate
continuous query paradigm, which is a

best
-
effort service providing the above two capabilities.

We present a scalable
and effective middleware called CoQUOS for supporting continuous queries in unstructured overlay networks.Besides
being independent of the overlay topology, CoQUOS preserves t
he simplicity and _exibility of the unstructured P2P
network. Our design of the CoQUOS system is characterized by two novel techniques, namely cluster
-
resilient random
walk algorithm for propagating the queries to various regions of the network and dynamic

probability
-
based query
registration scheme to ensure that the registrations are well distributed in the overlay. Further, we also develop
effective and ef_cient schemes for providing resilience to the churn of the P2P network and for ensuring a fair
dist
ribution of the noti_cation load among the peers. This paper studies the properties of our algorithms through
theoretical analysis. We also report series of experiments evaluating the effectiveness and the costs of the proposed
schemes.


8.

Secure Data Transm
ission In Wireless Broadcast Services With Efficient Key Management

Wireless broadcast is an effective approach for disseminating data to a number of users. To provide secure access to
data in wireless broadcast services, symmetric
-
key
-
based encryption is
used to ensure that only users who own the
valid keys can decrypt the data. With regard to various subscriptions, an efficient key management for distributing and
changing keys is in great demand for access control in broadcast services. In this paper, we
propose an efficient key
management scheme, namely, key tree reuse (KTR), to handle key distribution with regard to complex subscription
options and user activities. Key Tree Reuse has the following advantages. First, it supports all subscription activiti
es
in wireless broadcast services. Second, in KTR, a user only needs to hold one set of keys for all subscribed programs
instead of separate sets of keys for each program. Third, KTR identifies the minimum set of keys that must be changed
to ensure broadca
st security and minimize the rekey cost. Our simulations show that KTR can save about 45 percent of
communication overhead in the broadcast channel and about 50 percent of decryption cost for each user compared
with logical
-
key
-
hierarchy
-
based approaches.

NETWORK + SECURITY


JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


9.

Design and Implementation of TARF: A Trust
-
Aware Routing Framework for WSN

The multi
-
hop routing in wireless sensor networks (WSNs) offers little protection against identity deception through
replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating
attacks against the routi
ng protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is
further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at
developing trust
-
aware routing protocols do not eff
ectively address this severe problem. To secure the WSNs against
adversaries misdirecting the multi
-
hop routing, we have designed and implemented TARF, a robust trust
-
aware
routing framework for dynamic WSNs. Without tight time synchronization or known geo
graphic information, TARF
provides trustworthy and energy
-
efficient route. Most importantly, TARF proves effective against those harmful
attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both
s
imulation and empirical experiments on large
-
scale WSNs under various scenarios including mobile and RF
-
shielding
network conditions. Further, we have implemented a low
-
overhead TARF module in Tiny OS; as demonstrated, this
implementation can be incorporat
ed into existing routing protocols with the least effort. Based on TARF, we also
demonstrated a proof
-
of
-
concept mobile target detection application that functions well against an anti
-
detection
mechanism.


10.

Secure Authentication Scheme in Wireless Network
s

Mobile users enjoy seamless roaming over wireless environment. The wireless network is cumbersome and error
prone, thus there is a need for a good and strong authentication scheme which should be designed in such a way that it
retains the privacy of the
user .It should also be capable of providing minimized communication overhead as most of
the exchange of messages in wireless network is found to be the exchange of messages meant for authentication. This
results in clumsy environment .The proposed sc
heme brings out the solution for the above mentioned problems,
where the authentication procedure consists of only four messages exchanged between home agent, mobile user and
foreign agent. Also the light weight authentication scheme with user anonymity

is presented. Apart from that other
main issues that are to be solved are prevention of fraud, updating of session key periodically, no need of password
verification table and single registration of user to home network. It provides security in protectin
g the password even
if the information is disclosed. The proposed scheme deserves the property of protecting the wireless network from
various attacks. And the proposed scheme is simple and user friendly.


11.

Privacy
-
Preserving Decentralized Key
-
Policy Att
ribute
-
Based Encryption

Decentralized attribute
-
based encryption (ABE) is a variant of a multi
-
authority ABE scheme where each authority can
issue secret keys to the user independently without any cooperation and a central authority. This is in contrast t
o the
previous constructions, where multiple authorities must be online and setup the system interactively, which is
impractical. Hence, it is clear that a decentralized ABE scheme eliminates the heavy communication cost and the need
for collaborative com
putation in the setup stage. Furthermore, every authority can join or leave the system freely
without the necessity of re
-
initializing the system. In contemporary multi
-
authority ABE schemes, a user’s secret keys
from different authorities must be tied t
o his global identiFer (GID) to resist the collusion attack. However, this will
compromise the user’s privacy. Multiple authorities can collaborate to trace the user by his GID, collect his attributes,
then impersonate him. Therefore, constructing a dece
ntralized ABE scheme with privacy
-
preserving remains a
challenging research problem. In this paper, we propose a privacy
-
preserving decentralized key
-
policy ABE scheme
where each authority can issue secret keys to a user independently without knowing any
thing about his GID.
Therefore, even if multiple authorities are corrupted, they cannot collect the user’s attributes by tracing his GID.
Notably, our scheme only requires standard complexity assumptions (e.g., decisional bilinear Dif?e
-
Hellman) and
does

not require any cooperation between the multiple authorities, in contrast to the previous comparable scheme that
requires non
-
standard complexity assumptions (e.g., q
-
decisional Diffie
-
Hellman inversion) and interactions among
multiple authorities. To t
he best of our knowledge, it is the First decentralized ABE scheme with privacy
-
preserving
based on standard complexity assumptions.


12.

A Three Party Authentication for Key Distributed Protocol Using Classical and Quantum
Cryptography

In the existing stud
y of third party authentication, for message transformation has less security against attacks such as
man
-
in
-
the
-
middle, efficiency and so on. In this approach, we at hand give a Quantum Key Distribution Protocol
(QKDP) to safeguard the security in larger
networks, which uses the combination of merits of classical cryptography
and quantum cryptography. Two three
-
party QKDPs, one implemented with implicit user authentication and the other

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


with explicit mutual authentication, which include the following: 1. S
ecurity against such attacks as the man
-
in
-
themiddle, eavesdropping and replay. 2. Efficiency is improved as the proposed protocols contain the fewest number
of communication rounds among the existing QKDPs. 3. Two parties can share and use a long
-
term sec
ret
(repeatedly). To prove the security of the proposed schemes, this work also presents a new primitive called the
Unbiased
-
Chosen Basis (UCB) assumption.

13.

Nymble: Blocking Misbehaving Users in Anonym zing Networks

Anonymizing networks such as Tor allow u
sers to access Internet services privately by using a series of routers to hide
the client’s IP address from the server. The success of such networks, however, has been limited by users employing
this anonymity for abusive purposes such as defacing popular

Web sites. Web site administrators routinely rely on IP
-
address blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser
routes through an anonymizing network. As a result, administrators block all known

exit nodes of anonymizing
networks, denying anonymous access to misbehaving and behaving users alike. To address this problem, we present
Nymble, a system in which servers can “blacklist” misbehaving users, thereby blocking users without compromising
thei
r anonymity. Our system is thus agnostic to different servers’ definitions of misbehavior

servers can blacklist
users for whatever reason, and the privacy of blacklisted users is maintained.

14.

FireCol: A Collaborative Protection Network for the Detection of

Flooding DDoS Attacks

Distributed denial
-
of
-
service (DDoS) attacks remain a major security problem, the mitigation of which is very hard
especially when it comes to highly distributed botnet
-
based attacks. The early discovery of these attacks, although
ch
allenging, is necessary to protect end
-
users as well as the expensive network infrastructure resources. In this paper,
we address the problem of DDoS attacks and present the theoretical foundation, architecture, and algorithms of
FireCol
. The core of
FireC
ol
is composed of intrusion prevention systems (IPSs) located at the Internet service
providers (ISPs) level. The IPSs form virtual protection rings around the hosts to defend and collaborate by
exchanging selected traffic information. The evaluation of
Fi
reCol
using extensive simulations and a real dataset is
presented, showing
FireCol
effectiveness and low overhead, as well as its support for incremental deployment in real
networks.


15.

A Secure Intrusion detection system against DDOS

attack in Wireless Mobi
le Ad
-
hoc Network

Wireless Mobile ad
-
hoc network (MANET) is an emerging technology and have great strength to be applied in critical
situations like battlefields and commercial applications such as building, traffic surveillance, MANET is infrastructure
less, with no any centralized controller exist and also each node contain routing capability, Each device in a MANET is
independently free to move in any direction, and will therefore change its connections to other devices frequently. So
one of the major
challenges wireless mobile ad
-
hoc networks face today is security, because no central controller exists.
MANETs are a kind of wireless ad hoc networks that usually has a routable networking environment on top of a link
layer ad hoc network. Ad hoc also con
tains wireless sensor network so the problems is facing by sensor network is also
faced by MANET. While developing the sensor nodes in unattended environment increases the chances of various
attacks. There are many security attacks in MANET and DDoS (Distr
ibuted denial of service) is one of them. Our main
aim is seeing the effect of DDoS in routing load, packet drop rate, end to end delay, i.e. maximizing due to attack on
network. And with these parameters and many more also we build secure IDS to detect th
is kind of attack and block it.
In this paper we discussed some attacks on MANET and DDOS also and provide the security against the DDOS attack.

16.

Automatic Discovery of Association Orders between Name and Aliases from the Web using
Anchor Texts
-
based
Co
-
occurrences

Many celebrities and experts from various fields may have been referred by not only their personal names but also by
their aliases on web. Aliases are very important in information retrieval to retrieve complete information about a
personal
name from the web, as some of the web pages of the person may also be referred by his aliases. The aliases
for a personal name are extracted by previously proposed alias extraction method. In information retrieval, the web
search engine automatically expan
ds the search query on a person name by tagging his aliases for complete
information retrieval thereby improving recall in relation detection task and achieving a significant mean reciprocal
rank (MRR) of search engine. For the further substantial improvem
ent on recall and MRR from the previously
proposed methods, our proposed method will order the aliases based on their associations with the name using the
definition of anchor texts
-
based co
-
occurrences between name and aliases in order to help the search
engine tag the
aliases according to the order of associations. The association orders will automatically be discovered by creating an
anchor texts
-
based co
-
occurrence graph between name and aliases. Ranking support vector machine (SVM) will be

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


used to crea
te connections between name and aliases in the graph by performing ranking on anchor texts
-
based co
-
occurrence measures. The hop distances between nodes in the graph will lead to have the associations between name
and aliases. The hop distances will be f
ound by mining the graph. The proposed method will outperform previously
proposed methods, achieving substantial growth on recall and MRR.


17.


A group key agreement protocol based on stability & power using a Elliptical curve cryptography

In mobile ad hoc
networks, the security is the main constraint in message transmission. For secure group
basedmessage transmission, we must share the key among users so that we can make the transmission as secure. This
paper addresses an interesting security problem in mob
ile ad hoc networks that is dynamic group key agreement for
key establishment. For secure communication, a group key must be shared by all group members. This group key
should be updated when the existing group members are leaving the network or new member
s are entering into the
existing network. In this paper, we propose a efficient group key agreement protocol called Key Agreement protocol
based on Stability and Power (KASP). Here the idea is to split a large group into several subgroups, each maintaining

its subgroup keys to manage the subgroup and managing many subgroups using Elliptic Curve Diffie
-
Hellman
(ECDH) key agreement algorithm. In KASP, we develop two protocols namely, Subgroup Key Generation(SKG) and
Group Key Generation(GKG) based on ECDH for

subgroups and outer groups respectively. These subgroup keys and
group keys should be changed when there are membership changes (such as when the current member leaves or the
new member joins). By introducing group
-
based approach, messages and key updates

will be limited within subgroup
and outer group. Thus computation load is distributed to many mobile ad hoc nodes. Both theoretical and practical
results show that this KASP, a new efficient group key agreement protocol performs well for the key establish
ment
problem in ad hoc network in terms of efficiency and security


18.

An Abuse
-
Free Fair Contract
-
Signing Protocol Based on the RSA Signature

Afair contract
-
signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., dig
ital
signatures) to an agreed contract over the Internet in a fair way, so

that either each of them obtains the other’s
signature, or neither party does. Based on the RSA signature scheme, a new digital contract
-

signing protocol is
proposed in this paper.

Like the existing RSA
-
based solutions for the same problem, our protocol is not only fair, but
also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the
communication channel is interrupted. Furth
ermore, the proposed protocol satisfies a new property


abuse
-
freeness.
That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results
to others. Technical details are provided to analyze the secu
rity and performance of the proposed protocol. In
summary, we present the first abuse
-
free fair contractsigning protocol based on the RSA signature, and show that it is
both secure and efficient.


19.


Providing Witness Anonymity Under Peer
-
to
-
Peer Settings

In this paper, we introduce the concept of witness anonymity for peer
-
to
-
peer systems, as well as other systems with
the peer
-
to
-
peer nature. Witness anonymity combines the seemingly conflicting requirements of anonymity (for honest
peers who report on the

misbehavior of other peers) and accountability (for malicious peers that attempt to misuse the
anonymity feature to slander honest peers). We propose the Secure Deep Throat (SDT) protocol to provide anonymity
for the witnesses of malicious or selfish beha
vior to enable such peers to report on this behavior without fear of
retaliation. On the other hand, in SDT, the misuse of anonymity is restrained in such a way that any malicious peer
attempting to send multiple claims against the same innocent peer for t
he same reason (i.e., the same misbehavior
type) can be identified. We also describe how SDT can be used in two modes. The active mode can be used in
scenarios with real
-
time requirements, e.g., detecting and preventing the propagation of peer
-
to
-
peer worm
s, whereas
the passive mode is suitable for scenarios without strict real
-
time requirements, e.g., query
-
based reputation systems.
We analyze the security and overhead of SDT, and present countermeasures that can be used to mitigate various
attacks on the
protocol. Moreover, we show how SDT can be easily integrated with existing protocols/mechanisms
with a few examples. Our analysis shows that the communication, storage, and computation overheads of SDT are
acceptable in peer
-
to
-
peer systems .


20.

Authenticated Group Key Transfer Protocol Based on Secret Sharing

Key transfer protocols rely on a mutually trusted key generation center (KGC) to select session keys and

transport
session keys to all communication entities secretly. Most often, KGC encrypts session keys under another secret key
shared with each entity during registration. In this paper, we propose an authenticated key transfer protocol based on
secret shar
ing scheme that KGC can broadcast group key information to all group members at once and only

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


authorized group members can recover the group key; but unauthorized users cannot recover the group key. The
confidentiality of this transformation is information

theoretically secure. We also provide authentication for
transporting this group key. Goals and security threats of our proposed group key transfer protocol will be analyzed in
detail.


21.

MABS Multicast Authentication Based on Batch Signature
-

Conventional

block
-
based multicast authentication schemes overlook the heterogeneity of receivers by letting the
sender choose the block size, divide a multicast stream into blocks, associate each block with a signature, and spread
the effect of the signature across a
ll the packets in the block through hash graphs or coding algorithms. The
correlation among packets makes them vulnerable to packet loss, which is inherent in the Internet and wireless
networks. Moreover, the lack of Denial of Service (DOS) resilience ren
ders most of them vulnerable to packet
injection in hostile environments.

DISTRIBUTED AND PARALLEL

22.

Distributed Private Key Generation for Identity Based Cryptosystems in Ad Hoc Networks

Identity Based Cryptography (IBC) has the advantage that no public key

certification is needed
when used in a mobile ad hoc network (MANET). This is especially useful when bi
-
directional
channels do not exist in a MANET. However, IBC normally needs a centralized server for issuing
private keys for different identities. We gi
ve a protocol distributing this task among all users, thus
eliminating the need of a centralized server in IBC for use in MANETs.

Distributing the public key
certification task among users has been considered Through the application of Feldman’s
verifiab
le secret sharing scheme a construction for sharing the task of the IBC
-
PKG among all
users is given. More specifically, the main contribution of this article is that a distributed PKG
implementation for Boneh
-

Franklin’s IBE is presented, which allows
the function of a trusted
private key generator (needed for IBC) to be securely distributed among all the participating nodes
in a MANET.


23.

DRINA: A Lightweight and Reliable Routing Approach for in
-
Network Aggregation in Wireless
Sensor Networks

Large s
cale dense wireless sensor networks (WSNs) will be increasingly deployed in different
classes of applications for accurate monitoring. Due to the high density of nodes in these networks,
it is likely that redundant data will be detected by nearby nodes whe
n sensing an event. Since
energy conservation is a key issue in WSNs, data fusion and aggregation should be exploited in
order to save energy. In this case, redundant data can be aggregated at intermediate nodes reducing
the size and number of exchanged me
ssages and, thus, decreasing communication costs and energy
consumption. In this work we propose a novel Data Routing for In
-
Network Aggregation, called
DRINA, that has some key aspects such as a reduced number of messages for setting up a routing
tree, ma
ximized number of overlapping routes, high aggregation rate, and reliable data aggregation
and transmission. The proposed DRINA algorithm was extensively compared to two other known
solutions: the In FRA and SPT algorithms. Our results indicate clearly tha
t the routing tree built by
DRINA provides the best aggregation quality when compared to these other algorithms. The
obtained results show that our proposed solution outperforms these solutions in different scenarios
and in different key aspects required b
y WSNs.


24.

The Three
-
Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks

Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient
data accumulation, localized sensor reprogramming, and for distinguishing an
d revoking

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


compromised sensors. However, in sensor networks that make use of the existing key pre
distribution schemes for pair wise key establishment and authentication between sensor nodes and
mobile sinks, the employment of mobile sinks for data collect
ion elevates a new security
challenge: in the basic probabilistic and q
-
composite key pre distribution schemes, an attacker can
easily obtain a large number of keys by capturing a small fraction of nodes, and hence, can gain
control of the network by deplo
ying a replicated mobile sink preloaded with some compromised
keys. This article describes a three
-
tier general framework that permits the use of any pair wise key
pre distribution scheme as its basic component. The new framework requires two separate key
pools, one for the mobile sink to access the network, and one for pair wise key establishment
between the sensors. To further reduce the damages caused by stationary access node replication
attacks, we have strengthened the authentication mechanism between

the sensor and the stationary
access node in the proposed framework. Through detailed analysis, we show that our security
framework has a higher network resilience to a mobile sink replication attack as compared to the
polynomial pool
-
based scheme.



25.

A

3N Approach to Network Control and Management

As the network technology and applications continue to evolve, computer networks become more
and more important. However, network users can attack the network infrastructure (such as
domain name service and rou
ting services, etc.). The networks can not provide the minimum
required quality of service for control. Network situation can not be aware in a timely manner. And
network maintaining and upgrading are not easy. We argue that one root cause of these problem
s is
that control, management and forwarding function are intertwined tightly. We advocate a complete
loosing of the functionality and propose an extreme design point that we call “3N”, after the
architecture’s three separated networks: forwarding network,

control network and management
network. Accordingly, we introduce four network entities: forwarder, controller, manager and
separators. In the 3N architecture, the forwarding network mainly forwards packets at the behest of
the control network and the man
agement network; the control network mainly perform route
computation for the data network; and the management network mainly learn about the situation of
the data network and distribute policies and configurations, and the three networks working
together
to consist a efficient network system. In this paper we presented a high level overview of
3N architecture and some research considerations in its realization. We think the 3N architecture is
helpful to improve network security, availability, manageability
, scalability and so on.



26.

Towards Practical Communication in Byzantine
-
Resistant DHTs

There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine
faults. Unfortunately, in such systems, operations such as data retrieval and message sending incur
significant communication costs. For example, a simple sc
heme used in many Byzantine fault
-
tolerant DHT constructions of nodes requires messages; this is likely impractical for real
-
world
applications. The previous best known message complexity is
in expectation
. However, the
corresponding protocol suffers from
prohibitive costs owing to hidden constants in the asymptotic
notation and setup costs. In this paper, we focus on reducing the communication costs against a
computationally bounded adversary. We employ threshold cryptography and distributed key
generation

to define two protocols, both of which are more efficient than existing solutions. In
comparison, our first protocol is
deterministic
with message complexity, and our second protocol
is randomized with expected message complexity. Furthermore, both the hi
dden constants and
setup costs for our protocols are small, and no trusted third party is required. Finally, we present

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


results from microbenchmarks conducted over PlanetLab showing that our protocols are practical
for deployment under significant levels o
f churn and adversarial behavior.


27.

An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems

In peer
-
to
-
peer file sharing systems, file replication technology is widely used to reduce hot spots and improve file
query e
fficiency. Most current file replication methods replicate files in all nodes or two end points on a client
-
server
query path. However, these methods either have low effectiveness or come at a cost of high overhead. File replication
in server side enhances

replica hit rate, hence, lookup efficiency but produces overloaded nodes and cannot
significantly reduce query path length. File replication in client side could greatly reduce query path length, but cannot
guarantee high replica hit rate to fully utilize

replicas. Though replication along query path solves these problems, it
comes at a high cost of overhead due to more replicas and produces underutilized replicas.

This paper presents an
Efficient and Adaptive Decentralized (EAD) file replication algorithm

that achieves high query efficiency and high
replica utilization at a significantly low cost. EAD enhances the utilization of file replicas by selecting query traffic
hubs and frequent requesters as replica nodes, and dynamically adapting to no uniform an
d time
-
varying file
popularity and node interest. Unlike current methods, EAD creates and deletes replicas in a decentralized self
-
adaptive
manner while guarantees high replica utilization. Theoretical analysis shows the high performance of EAD. Simulation

results demonstrate the efficiency and effectiveness of EAD in comparison with other approaches in both static and
dynamic environments. It dramatically reduces the overhead of file rep

lication, and yields significant improvements
on the efficiency and e
ffectiveness of file replication in terms of query efficiency, replica hit rate, and overloaded
nodes reduction.


28.


Rumor Riding: Anonym zing Unstructured Peer
-
to
-
Peer Systems

Although anonymizing Peer
-
to
-
Peer (P2P) systems often incurs extra traffic cost
s, many systems try to mask the
identities of their users for privacy considerations. Existing anonymity approaches are mainly path
-
based: peers have
to pre
-
construct an anonymous path before transmission. The overhead of maintaining and updating such path
s is
significantly high. We propose Rumor Riding (RR), a lightweight and non
-
path
-
based mutual anonymity protocol for
decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly
using the symmetric cryptogra
phic algorithm.


29.

FDAC: Toward Fine
-
grained Distributed Data Access Control in Wireless Sensor Networks

Distributed sensor data storage and retrieval has gained increasing popularity in recent years for supporting various
applications. While distributed
architecture enjoys a

more robust and fault
-
tolerant wireless sensor network (WSN),
such architecture also poses a number of security challenges especially when applied in mission
-
critical applications
such as battle field and e
-
healthcare. First, as senso
r data are stored and

maintained by individual sensors and unattended sensors are easily subject to strong attacks such as physical
compromise, it is significantly harder to ensure data security. Second, in many mission
-
critical applications, fine
-
grained
data access control is a

must as illegal access to the sensitive data may cause disastrous result and/or
prohibited by the law. Last but not least, sensors usually are resource
-
scarce, which limits the direct adoption of
expensive cryptographic primitives.

To address the above challenges, we propose in this paper a distributed data
access control scheme that is able to fulfill fine
-
grained access control over sensor data and is resilient against strong
attacks such as

sensor compromise and user colluding. T
he proposed scheme exploits a novel cryptographic primitive
called attribute
-
based encryption (ABE), tailors, and adapts it for WSNs with respect to both performance and security
requirements. The feasibility

of the scheme is demonstrated by experiments o
n real sensor platforms. To our best
knowledge, this paper is the first to realize distributed fine
-
grained data access control for WSNs.


30.

Consistent Monitoring System for Parallel and Distributed Systems

This paper proposes to build overlays that help in

the monitoring of long
-
term availability histories of hosts, with a
focus on large
-
scale distributed settings where hosts may be selfish or colluding (but not malicious). Concretely, we
focus on the important problems of selection and discovery of such an

availability monitoring overlay. We motivate
six significant goals for these problems

the first three goals are consistency, verifiability, and randomness in
selecting the availability monitors of nodes, so as to be Probabilistically resilient to selfish
and colluding nodes. The
next three goals are discoverability, load balancing, and scalability in finding these monitors. We then present
AVMON, an availability monitoring overlay that is the first system to satisfy all the above six requirements. The core

algorithmic contribution of this paper is a range of protocols for discovering the availability monitoring overlay in a
scalable and efficient manner, given any arbitrary monitor selection scheme that is consistent and verifiable. We

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


mathematically analyz
e the performance of AVMON’s discovery protocols with respect to scalability and discovery
time of monitors. Most interestingly, we are able to derive optimal variants of AVMON, with the aim of minimizing
memory, bandwidth, computation, and discovery time
of monitors (or a subset of these metrics). Our analysis indicates
that these optimal variants are also practically feasible. Finally, we perform extensive experimental evaluations of
AVMON by using three types of availability traces

synthetic, from Planet
Lab, and from a peer
-
to
-
peer system
(Overnet). Our results demonstrate that AVMON would work well in a wide variety of distributed systems.

VANETS


31.

Acknowledgment
-
Based Broadcast Protocol for Reliable and Efficient Data Dissemination in
Vehicular Ad Hoc Networks

Reliable Re
-
encryption in Unreliable Clouds Abstract

A key approach to secure cloud computing is for the data
owner to st
ore encrypted data in the cloud, and issue decryption keys to authorized users. Then, when a user is
revoked, the data owner will issue re
-
encryption commands to the cloud to re
-
encrypt the data, to prevent the revoked
user from decrypting the data
, and to generate new decryption keys to valid users, so that they can continue to
access the data. However, since a cloud computing environment is comprised of many cloud servers, such
commands may not be received and executed by all of the cloud
servers due to unreliable network communications.
In this paper, we solve this problem by proposing a time based re
-
encryption scheme, which enables the cloud servers
to automatically re
-
encrypt data based on their internal clocks. Our solution is
built on top of a new encryption
scheme,attribute based encryption, to allow Fine
-
grain access control, and does not require perfect clock
synchronization for correctness.


Cloud Computing


32.

A Refined RBAC Model for Cloud Computing

Cloud computing is a fast growing field which is arguably a new computing paradigm. In cloud computing, computing
resources are provided as services over the Internet and users can access resources on based on their payments. This
paper discusses cloud com
puting and its related security risks, with a focus on access control. As a traditional access
control
mechanism, role
-
based access control (RBAC) model can be used to implement several important security
principles such as least privilege, separation of d
uties, and data abstraction. This paper shows an on
-
going effort by
refining entities in RBAC used for cloud computing, and further discusses their security implications. We argue that
RBAC is well suited to many situations in cloud computing where users o
r applications can be clearly separated
according to their job functions.

33.

Building Crawler Engine on Cloud Computing Infrastructure

This paper is aimed to create implementation crawler engine or search engine using cloud computing infrastructure.
This
approach use virtual machines on a cloud computing infrastructure to run service engine crawlers and also for
application servers. Based on our initial experiments, this research has successfully built crawler engine that runs on
Virtual Machine (VM) of cl
oud computing infrastructure. The use of Virtual Machine (VM) on this architecture will
help to ease setup or installation, maintenance or VM terminating that has been running with some particular service
crawler engine as needed. With this infrastructure,

the increasing or decreasing in capacity and capability of multiple
engine crawlers could set easily and more efficiently.



34.

Reliable Re
-
encryption in Unreliable Clouds

A key approach to secure cloud computing is for the data owner to store encrypted
data in the cloud, and issue
decryption keys to authorized users. Then, when a user is revoked, the data owner will issue re
-
encryption commands
to the cloud to re
-
encrypt the data, to prevent the revoked user from decrypting the data, and to generate new
decryption keys to valid users, so that they can continue to access the data. However, since a cloud computing
environment is comprised of many cloud servers, such commands may not be received and executed by all of the
cloud servers due to unreliable netw
ork communications. In this paper, we solve this problem by proposing a
timebased re
-
encryption scheme, which enables the cloud servers to automatically re
-
encrypt data based on their
internal clocks. Our solution is built on top of a new encryption scheme
, attributebased encryption, to allow fine
-
grain
access control, and does not require perfect clock synchronization for correctness.


JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com



35.

Towards Green P2P: Analysis of Energy Consumption in P2P and Approaches to Control

Nowadays, information and communication

technology (ICT) has become more and more energy conscious. In this
paper, we focus on peer
-
to
-
peer systems which contribute a major fraction of the Internet traffic. This paper proposes
analytical models of energy consumption in P2P system. The model con
siders content pollution, the most common
attack in P2P system, which has received little attention in previous work on green P2P. The analysis of the models
shows that the popular sleep method in green computing potentially affects peer
-
to
-
peer performanc
e. When the online
time of clean copy holders is over cut, the system collapses. To find the balance between energy saving and system
maintenance, the concept energy effectiveness is introduced. An approach for controlling energy consumption while
keeping
the system stable is suggested. We show that the whole system can be benefited if some warm
-
hearted and
smart peers are willing to spend a little extra cost on energy, when most peers over cut their power on time. This
approach can perfectly complement the

popular sleep methods in green computing.


36.

Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud

In recent years ad
-
hoc parallel data processing has emerged to be one of the killer applications for Infrastructure
-
as
-
a
-
Service (IaaS) clouds. Major Cloud computing companies have started to integrate frameworks for parallel data
processing in their product portfolio, making it easy for customers to access these services and to deploy their
programs. However, the processing

frameworks which are currently used have been designed for static, homogeneous
cluster setups and disregard the particular nature of a cloud. Consequently, the allocated compute resources may be
inadequate for big parts of the submitted job and unnecessar
ily increase processing time and cost. In this paper we
discuss the opportunities and challenges for efficient parallel data processing in clouds and present our research project
Nephele. Nephele is the first data processing framework to explicitly exploit

the dynamic resource allocation offered
by today’s IaaS clouds for both, task scheduling and execution. Particular tasks of a processing job can be assigned to
different types of virtual machines which are automatically instantiated and terminated during
the job execution.


37.

Dynamic Load
-

-

Balanced Multicast for Data Intensive Applications on Clouds 2010

Data
-
intensive parallel applications on clouds need to deploy large data sets from the cloud’s storage facility toall
compute nodes as fast as possible.
Many multicast algorithms have been proposed for clusters and grid environments.
The most common approach is to construct one or more spanning trees based on the network topology and network
monitoring data in order to maximize available bandwidth and avoi
d bottleneck links. However, delivering optimal
performance becomes difficult once the available bandwidth changes dynamically.

In this paper, we focus on Amazon EC2/S3 (the most commonly used cloud platform today) and propose

two high performance

multic
ast algorithms. These algorithms make it possible to efficiently transfer large amounts of data stored in Amazon S3 to


multiple Amazon EC2 nodes. The three salient features of our algorithms are (1) to construct an overlay network on clouds


without netwo
rk topology information, (2) to optimize the total throughput dynamically, and (3) to increase the download

throughput by letting nodes cooperate with each other. The two algorithms differ in the way nodes cooperate: the first ‘non
-
steal’

algorithm lets
each node download an equal share of all data, while the second ‘steal’ algorithm uses work stealing to counter the


effect of heterogeneous download bandwidth. As a result, all nodes can download files from S3 quickly, even when the network

performance c
hanges while the algorithm is running.

We evaluate our algorithms on EC2/S3, and show that they are scalable


and consistently achieve high throughput. Both algorithms perform much better than having each node downloading


38.

Service Oriented Architecture for

Cloud based Travel Reservation Software as a Service

Cloud is gaining popularity as means for saving cost of IT ownership and accelerating time to market due to ready
-
to
-
use, dynamically scalable computing infrastructure and software services offered on

Cloud on pay
-
per
-
use basis.
Design of software solution for delivery as a shared service over Cloud requires specific considerations. In this paper

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


we describe an approach for design of travel reservations solution for use by corporate business travelers
based on
Service Oriented Architecture, Software
-
as
-
a
-
Service, and Cloud Computing paradigms.

39.

A New Wireless Web Access Mode Based on Cloud Computing 2008

As most websites are designed for desktop PCs, it is extremely uncomfortable to browse these large pa
ges on a
wireless handheld device with small screen and limited user interface. So it is necessary to adapt these web pages to
small screen devices. Besides, as the limited computing ability and capacity of storage of wireless handheld devices, it
is also
extremely challenging to deploy existing web page adaptation engine. By referring to huge computing ability
and storage resource of cloud computing infrastructure, a new wireless web access mode is proposed. Firstly, the
system framework is present. Subseq
uently, the two key components of system are described in detail: the one is
distributed web page adaptation engine, which is designed for the purpose that the engine can be carried by computing
cloud distributed and parallel; the other is distributed web
page blocks management based on cloud computing, which
is proposed so that the web page adaptation engine can be deployed reasonably. Moreover, a prototype system and a
set of evaluation experiments have been implemented.


Mobile computing


40.

Energy
Efficient Cluster Based Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks consist of hundreds of tiny, inexpensive, resource constrained sensor nodes. Routing is a
challenging task in such environment mainly due to the unique constrain
ts the wireless sensor networks suffer from.
Highly dynamic topology of wireless sensor networks is another challenge due to which the existing route becomes
unavailable very frequently. Energy efficiency of the protocols and algorithms being a major desig
n goal in sensor
network setup, in this paper a novel energy efficient routing protocol is proposed. The proposed protocol is
hierarchical and cluster based. In this protocol, the Base Station selects the Cluster Heads (CH). The selection
procedure is carr
ied out in two stages. In the first stage, all candidate nodes for becoming CH are listed, based on the
parameters like relative distance of the candidate node from the Base Station, remaining energy level, probable
number of neighboring sensor nodes the c
andidate node can have, and the number of times the candidate node has
already become the Cluster Head. The Cluster Head generates two schedules for the cluster members namely
Sleep

and TDMA based
Transmit
. The data transmission inside the cluster and from

the Cluster Head to the Base Station
takes place in a multi
-
hop fashion. The current session ends when the energy level of any one of the current Cluster
Heads reduces to half of its initial energy amount. The simulation results of the proposed protocol a
re also reported.
Future scopes of this work are outlined.



41.

Channel
-
Aware Routing in MANETs With Route Handoff (AOMDV)

In wireless mobile ad hoc networks (MANETs), packet transmission is impaired by radio link fluctuations. This paper
proposes a novel
channel adaptive routing protocol which extends the Ad hoc On
-
Demand Multipath Distance Vector
(AOMDV) routing protocol to accommodate channel fading. Specifically, the proposed Channel
-
Aware AOMDV
(CA
-
AOMDV) uses the channel average non fading duration as

a routing metric to select stable links for path
discovery, and applies a preemptive handoff strategy to maintain reliable connections by exploiting channel state
information. Using the same information, paths can be reused when they become available agai
n, rather than being
discarded. We provide new theoretical results for the downtime and lifetime of a live
-
die
-
live multiple path system, as
well as detailed theoretical expressions for common network performance measures, providing useful insights into th
e
differences in performance between CA
-
AOMDV and AOMDV. Simulation and theoretical results show that CA
-
AOMDV has greatly improved network performance over AOMDV


42.

A Node
-
Disjoint Multipath Routing Method Based on AODV Protocol for MANETs

Frequent link fai
lures are caused in mobile ad
-
hoc networks due to node’s mobility and use of unreliable wireless
channels for data transmission. Due to this, multipath routing protocols become an important research issue. In this
paper, we propose and implement a node
-
dis
joint multipath routing method based on AODV protocol. The main goal
of the proposed method is to determine all available node
-
disjoint routes from source to destination with minimum
routing control overhead. With the proposed approach, as soon as the Firs
t route for destination is determined, the
source starts data transmission. All the other backup routes, if available, are determined concurrently with the data

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


transmission through the First route. This minimizes the initial delay caused because data tran
smission is started as
soon as First route is discovered. We also propose three different route maintenance methods. All the proposed route
maintenance methods are used with the proposed route discovery process for performance evaluation. The results
obtai
ned through various simulations show the effectiveness of our proposed methods in terms of route availability,
control overhead, average end
-
to
-
end delay and packet delivery ratio.

43.


An energy
-
efficient data storage scheme in wireless sensor networks



Decentralized attribute
-
based encryption (ABE) is a variant of a multi
-
authority ABE scheme where each authority
can issue secret keys to the user independently without any cooperation and a central authority. This is in contrast to
the previous construc
tions, where multiple authorities must be online and setup the system interactively, which is
impractical. Hence, it is clear that a decentralized ABE scheme eliminates the heavy communication cost and the need
for collaborative computation in the setup s
tage. Furthermore, every authority can join or leave the system freely
without the necessity of re
-
initializing the system. In contemporary multi
-
authority ABE schemes, a user’s secret keys
from different authorities must be tied to his global identi?er
(GID) to resist the collusion attack. However, this will
compromise the user’s privacy. Multiple authorities can collaborate to trace the user by his GID, collect his attributes,
then impersonate him. Therefore, constructing a decentralized ABE scheme wi
th privacy
-
preserving remains a
challenging research problem. In this paper, we propose a privacy
-
preserving decentralized key
-
policy ABE scheme
where each authority can issue secret keys to a user independently without knowing anything about his GID.
Th
erefore, even if multiple authorities are corrupted, they can not collect the user’s attributes by tracing his GID.
Notably, our scheme only requires standard complexity assumptions (e.g., decisional bilinear Diffie
-
Hellman) and
does not require any coope
ration between the multiple authorities, in contrast to the previous comparable scheme that
requires non
-
standard complexity assumptions (e.g., q
-
decisional Difie
-
Hellman inversion) and interactions among
multiple authorities. To the best of our knowledg
e, it is the First decentralized ABE scheme with privacy
-
preserving
based on standard complexity assumptions.

44.


The Black
-
hole node attack in MANET

The black hole problem is one of the security attacks that occur in mobile ad hoc networks (MANETs)
. We present
two possible solutions. The first is to find more than one route to the destination. The second is to exploit the packet
sequence number included in any packet header. Computer simulation shows that in comparison to the original ad hoc
ondeman
d distance vector (AODV) routing scheme, the second solution can verify 75% to 98% of
the route to the destination depending on the pause time at a minimum cost of the delay

in
the
networks. The main objective of this paper is to analyze black hole attack in MANET and
its solutions.

45.

Fast Data Collection in Tree
-
Based Wireless Sensor Networks

We investigate the following fundamental question
-

how fast can information be collected from a wireless sensor
network organized as tree? To address this, we explore and evaluate a number of different techniques using realistic
simulation models under the many
-
to
-
one communication paradigm known as conv
ergecast. We first consider time
scheduling on a single frequency channel with the aim of minimizing the number of time slots required (schedule
length) to complete a convergecast. Next, we combine scheduling with transmission power control to mitigate the
effects of interference, and show that while power control helps in reducing the schedule length under a single
frequency, scheduling transmissions using multiple frequencies is more efficient. We give lower bounds on the
schedule length when interference i
s completely eliminated, and propose algorithms that achieve these bounds. We
also evaluate the performance of various channel assignment methods and find empirically that for moderate size
networks of about 100 nodes, the use of multi
-
frequency scheduling
can suffice to eliminate most of the interference.
Then, the data collection rate no longer remains limited by interference but by the topology of the routing tree. To this
end, we construct degree
-
constrained spanning trees and capacitated minimal spanning

trees, and show significant
improvement in scheduling performance over different deployment densities. Lastly, we evaluate the impact of
different interference and channel models on the schedule length.


46.

Protecting Location Privacy in Sensor Networks against a Global Eavesdropper

While many protocols for sensor network security provide confidentiality for the content of messages, contextual
information usually remains exposed. Such contextual info
rmation can be exploited by an adversary to derive sensitive
information such as the locations of monitored objects and data sinks in the field. Attacks on these components can
significantly undermine any network application. Existing techniques defend

the leakage of location information
from a limited adversary who can only observe network traffic in a small region. However, a stronger adversary, the
global eavesdropper, is realistic and can defeat these existing techniques. This paper first formal
izes the location

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


privacy issues in sensor networks under this strong adversary model and computes a lower bound on the
communication overhead needed for achieving a given level of location privacy. The paper then proposes two
techniques to provide loc
ation privacy to monitored objects (source
-
location privacy)

periodic collection and source
simulation

and two techniques to provide location privacy to data sinks (sink
-
location privacy)

sink simulation
and backbone flooding. These techniques provide
trade
-
offs between privacy, communication cost, and latency.
Through analysis and simulation, we demonstrate that the proposed techniques are efficient and effective for source
and sink
-
location privacy in sensor networks.


47.

Fast Detection of Mobile Re
plica Node Attacks in Wireless Sensor Networks Using Sequential
Hypothesis Testing

Due to the unattended nature of wireless sensor networks, an adversary can capture and compromise sensor nodes,
generate replicas of those nodes, and mount a variety of
attacks with the replicas he injects into the network. These
attacks are dangerous because they allow the attacker to leverage the compromise of a few nodes to exert control over
much of the network. Several replica node detection schemes in the literature

have been proposed to defend against
these attacks in static sensor networks. These approaches rely on fixed sensor locations and hence do not work in
mobile sensor networks, where sensors are expected to move. In this work, we propose a fast and effective

mobile
replica node detection scheme using the Sequential Probability Ratio Test. To the best of our knowledge, this is the

rst work to tackle the problem of replica node attacks in mobile sensor networks. We show analytically and through
simulation expe
riments that our schemes achieve effective and robust replica detection capability with reasonable
overheads.


48.

Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes

Compromised
-
node and denial
-
of
-
service are two key attacks

in wireless sensor networks (WSNs). In this paper, we
study data delivery mechanisms that can with high probability circumvent black holes formed by these attacks. We
argue that classic multipath routing approaches are vulnerable to such attacks, mainly d
ue to their deterministic nature.
So once the adversary acquires the routing algorithm, it can compute the same routes known to the source, hence
making all information sent over these routes vulnerable to its attacks. In this paper, we develop mechanisms
that
generate randomized multi
-
path routes. Under our designs, the routes taken by the “shares” of different packets change
over time. So even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the
routes traversed

by each packet. Besides randomness, the generated routes are also highly dispersive and energy
efficient, making them quite capable of circumventing black holes. We analytically investigate the security and energy
performance of the proposed schemes. We a
lso formulate an optimization problem to minimize the end
-
to
-
end energy
consumption under given security constraints. Extensive simulations are conducted to verify the validity of our
mechanisms.


49.

On demand Temporary Route Recovery for Frequent Link Failu
res in Adhoc Networks


50.

Secure Distance
-
Based Localization In The Presence Of Cheating Beacon Nodes

Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although
significant progress has been made on this pr
oblem, some fundamental theoretical questions still remain unanswered:
in the presence of malicious beacon nodes, what are the necessary and sufficient conditions to guarantee a bounded
error during 2
-
dimensional location estimation? Under these necessary
and sufficient conditions, what class of
localization algorithms can provide that error bound? In this paper, we try to answer these questions. Specifically, we
show that, when the number of malicious beacons is greater than or equal to some threshold, the
re is no localization
algorithm that can have a bounded error. Furthermore, when the number of malicious beacons is below that threshold,
we identify a class of localization algorithms that can ensure that the localization error is bounded. We also outline

two
algorithms in this class, one of which is guaranteed to finish in polynomial time (in the number of beacons providing
information) in the worst case, while the other is based on a heuristic and is practically efficient. For completeness, we
also exten
d the above results to the 3
-
dimensional case. Experimental results demonstrate that our solution has very
good localization accuracy and computational efficiency

VANET


JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


51.

Acknowledgment
-
Based Broadcast Protocol for Reliable and Efficient Data Dissemination in
Vehicular Ad Hoc Networks

We propose a broadcast algorithm suitable for a wide range of vehicular scenarios, which only employs local
information acquired via periodic beacon messages, containing acknowledgments of the circulated broadcast
messages. Each vehicle decides whether

it belongs to a connected dominating set (CDS). Vehicles in the CDS use a
shorter waiting period before possible retransmission. At time
-
out expiration, a vehicle retransmits if it is aware of at
least one neighbor in need of the message. To address i
ntermittent connectivity and appearance of new neighbors, the
evaluation timer can be restarted. Our algorithm resolves propagation at road intersections without any need to even
recognize intersections. It is inherently adaptable to different mobility r
egimes, without the need to classify network
or vehicle speeds. In a thorough simulation
-
based performance evaluation, our algorithm is shown to provide higher
reliability and message efficiency than existing approaches for non safety applications.


Wireless Communication

52.


Power Aware Ad Hoc On
-
demand Distance Vector (PAAODV) Routing for MANETS

Compromised
-
node and denial
-
of
-
service are two key attacks in wireless sensor networks (WSNs). In this paper, we
study data delivery mechanisms that can

with high probability circumvent black holes formed by these attacks. We
argue that classic multipath routing approaches are vulnerable to such attacks, mainly due to their deterministic nature.
So once the adversary acquires the routing algorithm, it can

compute the same routes known to the source, hence
making all information sent over these routes vulnerable to its attacks. In this paper, we develop mechanisms that
generate randomized multi
-
path routes. Under our designs, the routes taken by the “shares
” of different packets change
over time. So even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the
routes traversed by each packet. Besides randomness, the generated routes are also highly dispersive and energ
y
efficient, making them quite capable of circumventing black holes. We analytically investigate the security and energy
performance of the proposed schemes. We also formulate an optimization problem to minimize the end
-
to
-
end energy
consumption under give
n security constraints. Extensive simulations are conducted to verify the validity of our
mechanisms


53.

Power Management for Throughput Enhancement in Wireless Ad
-
Hoc Networks

In this paper we introduce the notion of power management within the context
of wireless ad
-
hoc networks. More
specifically, we investigate the effects of using different transmit powers on the average power consumption and end
-
to
-
end network throughput in a wireless ad
-
hoc environment. This power management approach would help in
reducing the system power consumption and hence prolonging the battery life of mobile nodes. Furthermore, it
improves the end
-
to
-
end network throughput as compared to other ad
-
hoc networks in which all mobile nodes use the
same transmit power. The improvem
ent is due to the achievement of a tradeoff between minimizing interference
ranges, reduction in the average number of hops to reach a destination, the probability of having isolated clusters, and
the average number of transmissions (including retransmissi
ons due to collisions). The protocols would first
dynamically determine an optimal connectivity range wherein they adapt their transmit powers so as to only reach a
subset of the nodes in the network. The connectivity range would then be dynamically change
d in a distributed
manner so as to achieve the near optimal throughput. Minimal power

routing is used to further enhance performance.


54.

A Secure and Power Efficient Routing Scheme for Ad Hoc Networks


Wireless Sensor N
etworks


55.

A Secure Web
Service
-
based Platform for Wireless Sensor Network Management and
Interrogation

A Wireless Sensor Network (WSN) is composed of small, low cost and low energy consumption devices called
sensors. Those sensors are deployed in a monitored area. They capture measurements related to the monitored
phenomenon (temperature, humidity...) and s
end them through a multi
-
hop routing to a sink node that delivers them to
a Base Station for use and decision making. WSN are used in several fields ranging from military applications to
civilian ones, for security, home automation and health care... Up to

now, most of the works focused on designing
routing protocols to address energy consumption issue, fault tolerance and security. In this paper, we address the issue
of secure management and interrogation of WSN through Internet mainly. In our work, we des
igned and implemented
a generic approach based on Web Services that builds a standardized interface between a WSN and external networks
and applications. Our approach uses a gateway that offers a synthesis of Web Services offered by the WSN assuring its
in
terrogation and management. Furthermore, Authentication, Authorization and Accounting mechanism has been
implemented to provide security services and a billing system for WSN interrogation. We designed our architecture as

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


a generic framework. Then, we inst
antiated it for two use cases. Furthermore, we designed, implemented and tested
Directed Service Oriented Diffusion (DSOD), a Service

Oriented routing protocol for WSN.


56.

Supporting Efficient and Scalable Multicasting over Mobile Ad Hoc Networks

Group
communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method for
implementing

group communications. However, it is challenging to implement efficient and scalable multicast in
MANET due to the difficulty in group

members
hip management and multicast packet forwarding over a dynamic
topology.We propose a novel Efficient Geographic Multicast Protocol (EGMP). EGMP uses a virtual
-
zone
-
based
structure to implement scalable and efficient group membership management. A network
-
w
ide zone
-
based bi
-
directional tree is constructed to achieve more efficient membership management and multicast delivery. The position
information is used to guide the zone structure building, multicast tree construction and multicast packet forwarding,
wh
ich efficiently reduces the overhead for route searching and tree structure maintenance. Several strategies have been
proposed to further improve the efficiency of the protocol, for example, introducing the concept of zone depth for
building an optimal tre
e structure and integrating the location search of group members with the hierarchical group
membership management. Finally, we design a scheme to handle empty zone problem faced by most routing protocols
using a zone structure. The scalability and the eff
iciency of EGMP are evaluated through simulations and quantitative
analysis. Our simulation results demonstrate that EGMP has high packet delivery ratio, and low control overhead and
multicast group joining delay under all test scenarios, and is scalable t
o both group size and network size. Compared to
Scalable Position
-
Based Multicast (SPBM) [20], EGMP has significantly lower control overhead, data transmission
overhead, and multicast group joining delay.


57.

A Novel Indirect Trust based Link State Routing Sc
heme using a Robust Route Trust Method for
Wireless Sensor Networks.

Integration of trust in routing mechanisms already

prevalent in Wireless Sensor Networks (WSN) has become an

interesting research area of late. Several methods exist for the

assignment of

trust to the nodes present in a WSN.
However

the real challenge lies in proper integration of this trust to an

existing routing protocol for the synthesis of a
trust
-
aware

routing algorithm. In this paper we try to take the help of

Geometrical Mean based
indirect trust evaluation
mechanism

for calculation of trust of individual nodes and thereby use the

calculated trusts for determination of the
different route trusts

(RTs). We present a link state routing protocol based only on

these indirect trusts which

forms the
routes and finds the best

trustworthy route among them by comparing the values of all

the calculated route trusts as for
each route present in the

network. We have developed three algorithms related to this

and have shown their merits.
Finally,
we compare our work

with similar trust integrated routing protocols and show its

advantages over them.


58.

A Hybrid Key Management Protocol forWireless Sensor Networks

Wireless Sensor Networks (WSNs) are wireless ad
-
hoc networks of tiny battery
-
operated wirel
ess sensors. They are
usually deployed in unsecured, open, and, harsh environments where it is difficult for humans to perform continuous
monitoring. Due to its nature of deployment it is very crucial to provide security mechanisms for authenticating data.

Key management is a pre
-
requisite for any security mechanism. Due to memory, computation, and communication

constraints of sensor nodes, distribution and management of key in WSNs is a challenging task. Because of its
lightweight feature, symmetric crypto
-
systems are a natural choice for key management in WSNs. However, they
often fail to provide a good trade
-
off between resilience and storage. On the other hand, Public Key Infrastructure
(PKI) is infeasible in WSNs because of its continuous availability o
f trusted third party and heavy computational
requirements for certificate verification. Pairing
-
Based Cryptography (PBC) has paved a way for how parties can
agree on keys without any interaction. It has relaxed the requirement of expensive certificate ver
ification on PKI
system. In this paper, we propose a new hybrid ID based non
-
interactive key management protocol for WSNs, which
leverages the benefits from both symmetric key based cryptosystems and PBC by combining them together. The
proposed protocol is

very flexible and suits many applications. We also provide mechanisms for key refresh when the
network changes.


59.

PowerNap: An Energy Efficient MAC Layer for Random Routing in Wireless Sensor Networks

Idle
-
listening is the biggest challenge for energy
-

efficiency and longevity of multihop wireless sensor network (WSN)
deployments. While existing coordinated sleep/wakeup scheduling protocols eliminate idle
-
listening for simple traffic
pat
-

terns, they ar
e unsuitable to handle the complex traffic patterns of the random routing protocols. We present a
novel coordinated sleep/wakeup protocol POWERNAP , which avoids the overhead of distributing complex, large
sleep/wakeup scheduling information to the nodes.
POWERNAP piggybacks onto the relayed data packets the seed of
the pseudo
-
random generator that encodes the scheduling information, and enables any recipient/snooper to calculate

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


its sleep/wakeup schedule from this seed. In essence, POWERNAP trades off doin
g extra computation in order to
avoid expensive control packet transmissions. We show through simula
-

tions and real implementation on Telos B
motes that POWERNAP eliminates the idle
-
listening problem efficiently and achieves self
-
stabilizing, low
-
latency


60.

FDAC: Toward Fine
-
grained Distributed Data Access Control in Wireless Sensor Networks

Distributed sensor data storage and retrieval has gained increasing popularity in recent years for supporting various
applications. While distributed architecture enjoy
s a more robust and fault
-
tolerant wireless sensor network (WSN),
such architecture also poses a number of security challenges especially when applied in mission
-
critical applications
such as battle field and e
-
healthcare. First, as sensor data are stored
and

maintained by individual sensors and unattended sensors are easily subject to strong attacks such as physical
compromise, it is significantly harder to ensure data security. Second, in many mission
-
critical applications, fine
-
grained data access contro
l is a must as illegal access to the sensitive data may cause disastrous result and/or
prohibited by the law. Last but not least, sensors usually are resource
-
scarce, which limits the direct adoption of
expensive cryptographic primitives. To address the ab
ove challenges, we propose in this paper a distributed data
access control scheme that is able to fulfill fine
-
grained access control over sensor data and is resilient against strong
attacks such as sensor compromise and user colluding. The proposed scheme

exploits a novel cryptographic primitive
called attribute
-
based encryption (ABE), tailors, and adapts it for WSNs with respect to both performance and security
requirements. The feasibility of the scheme is demonstrated by experiments on real sensor plat
forms. To our best
knowledge, this paper is the first to realize distributed fine
-
grained data access control for WSNs.


61.

An Energy
-
Efficient Data Fusion Protocol for Wireless

Sensor Network

It is a critical consideration to collect and fuse sensed informat
ion in an energy efficient manner for obtaining a long
lifetime of the sensor network. Based on our findings that the conventional methods of direct transmission, shortest
path routing, and Dempster
-

Shafer tool may not be optimal for data fusion of sensor

networks, we propose LEECF
(Low
-
Energy Event Centric Fusion), a event
-
centric
-
based protocol that utilizes the centric sensor node to aggregate
the event data among the triggered sensors in a short delay. LEECF incorporates a fast information fusion into
the
routing protocol to reduce the amount of information that must be transmitted to the sink and the time complexity of
fusion computation of fusion center. Simulations show that LEECF can decrease the energy

and fusion time significantly compared with
conventional routing protocols and D
-
S evidence theory with the
increased number of sensors.


Datamining/Webmining

62.

Intelligent teaching models for STEM related careers using a service
-
oriented architecture and
management science

The development of World Wide Web (WWW) a little more than a decade ago has caused an information
explosion that needs an Intellig
ent Web (IW) for users to easily control their information and commercial
needs. Therefore, engineering schools have offered a variety of IW courses to cultivate hands
-
on experience
and training for industrial systems. In this study, Intelligent Teaching M
odels for STEM Related Careers
Using Service
-
Oriented Architecture (SOA) and Management Science

project

course has been designed.
The goal is to help students learn theoretical concepts of IW, practice advanced technical skills, and
discover knowledge to s
olve problem. Undergraduate Science, Technology, Engineering and Mathematics
(STEM) students involved in the development of innovative approaches and techniques. They are able to
help solve the problems of disease misdiagnoses that medical and health care
professionals experience.
They co
-
authored and presented numerous research papers introducing the solution via scientific
conferences and journals. This study provides the solution in the form of an Intelligent models using an
integration of Service
-
Orient
ed Architecture and Management Science to decrease disease misdiagnosis in
health care. Results show that this new course strengthens the capacity and quality of STEM undergraduate
degree programs and the number of overall graduate student enrollment. It p
romotes a vigorous STEM
academic environment and increases the number of students entering STEM careers. It expands the breadth
of faculty and student involvement in research and development. It enhances and leverages the active
engagement of faculty techn
ology transfer and translational research. It improves and develops new
relationships between educational institutions and research funding entities to broaden the university's

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


research portfolio and increase funding. The proposed

project

course is a softw
are engineering research
methodology, an educational tool, and a teaching te
-

hnique is needed in future medical and health IT fields.

63.

A smart communication gateway for V2I applications in Public Transport

In this paper, we present a smart gateway which improves communication between future Public Transport
vehicles and their back
-
offices. This gateway impl
ements context based wireless access network selection
and improves end
-
to end communication Quality of Service (QoS) responding by this way to the
requirements of the new intelligent transportation systems architecture developed in Europe through the
Euro
pean Bus System of the Future (EBSF)project. This Service Oriented Architecture (SOA) allows
resource sharing such as Vehicle to Infrastructure communications (V2I). We show that the proposed smart
gateway respond to the requirements of the EBSF

project an
d going straightforward we demonstrate its
effectiveness in an alarm scenario which is a critical scenario that the gateway has to handle.

64.

Design and Implementation of Teaching Management Systems Integrated of Vocational College
Based on

SOA

Teaching Management Systems is the center work of Vocational College. The

paper

discuss exist some
problems of the current teaching management systems, according to theoretical system based on service
-
oriented architecture, we propose a sort of archit
ecture and hierarchical model SOA
-
based about academic
management system, develop a integrated

platform

of teaching information system on web service of

J2EE
-
based. The phenomenon is solved about data islands of teaching management system
.

65.

Horizontal

Aggregations

in

SQL

to

Prepare

Data

Setsfor

Data

Mining

Analysis

Preparing

a

data

set

for

analysis

is generally the most time consuming task

in

a

data

mining

project,
requiring many complex

SQL

queries, joining tab
les, and aggregating columns.
Existing

SQL

aggregations

have limitations

topre
pare

data

sets

because they return one column per
aggregated group.

In

general, a significant manual effort is required

to

build

data

sets, where
a

horizontal

layout is required. We propose simple, yet powerful, methods

togenerate

SQL

code

to

return
aggreg
ated columns

in

ahorizontal

tabular layout, returning a

set

of numbers instead of one number per row.
This new class of functions is

calledhorizontal

aggregations
calledhorizontal

aggregations.

Horizontal

aggregations

build

datasets

with a

horizontal

denor
malized layout
(e.g., point
-
dimension, observation
-
variable, instance
-
feature), which is the standard layout required by
most

data

miningalgorithms. We propose three fundamental methods

to

evaluate

horizontal

aggregations:
CASE: Exploiting the programming
CASE construct; SPJ: Based on standard relational algebra operators
(SPJ queries); PIVOT: Using the PIVOT operator, which is offered by some DBMSs. Experiments with
large tables compare the proposed query evaluation methods. Our CASE method has similar spe
ed

tothe
PIVOT operator and it is much faster than the SPJ method.

In

general, the CASE and PIVOT methods
exhibit linear scalability, whereas the SPJ method does not.

66.

Outsourced

Similarity

Search

on

Metric

Data

Assets


This paper considers a cloud computing setting in which similarity

querying of

metric

data

is

outsourced

to
a service provider. The

data

is to be revealed only to trusted users, not to the service provider or anyone
else. Users query the server for the most similar

data

objects to a query example. Outsourcing

offers
the

data

owner scalability and a low
-
initial i
nvestment. The need for privacy may be due to the data

being
sensitive (e.g., in medicine), valuable (e.g., in astronomy), or otherwise confidential. Given this setting, the
paper presents techniques that transform the

data

prior to supplying it to the ser
vice provider
for

similarity

queries

on the transformed

data. Our techniques provide interesting trade
-
offs between query
cost and accuracy. They are then further extended to offer an intuitive privacy guarantee. Empirical studies
with real

data

demonstrat
e that the techniques are capable of offering privacy while enabling efficient and
accurate processing of

similarity

queries.


67.

Bootstrapping

Ontologies

for

Web

Services


JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


Ontologies

have become the de
-
facto modeling tool of choice, employed in many applications and
prominently in the semantic

web. Nevertheless,

ontology

construction rem
ains a daunting task.
Ontological

bootstrapping, which aims at automatically generating concepts and their relations in a given
domain, is a promising technique

forontology

construction.

Bootstrapping

an

ontology

based on a set of
predefined textual source
s, such as

web

services, must address the problem of multiple, largely unrelated
concepts. In this paper, we propose an

ontology bootstrapping

process

for

web

services. We exploit the
advantage that

web

services

usually consist of both WSDL and free text d
escriptors. The WSDL descriptor
is evaluated using two methods, namely Term Frequency/Inverse Document Frequency (TF/IDF)
and

web

context generation. Our proposed

ontology

bootstrapping

process integrates the results of both
methods and applies a third met
hod to validate the concepts using the

service

free text descriptor, thereby
offering a more accurate definition of

ontologies. We extensively validated our

bootstrapping

method using
a large repository of real
-
world

web

services

and verified the results a
gainst existing

ontologies. The
experimental results indicate high precision. Furthermore, the recall versus precision comparison of the
results when each method is separately implemented presents the advantage of our
integrated

bootstrapping

approach.

68.

Pub
lishing

Search

Logs

A

Comparative

Study

ofPrivacy

Guarantees

Search

engine companies collect the “database

ofintentions,” the histories

of

their users'

search

queries.
These

search

logs

are

a

gold mine for researchers.

Searchengine companies, however, are
wary

of

publishing

searchlogs

in order not to disclose sensitive information. In this paper, we analyze
algorithms for

publishing

frequent keywords, queries, and clicks

of

a

search

log. We first show how
methods that achieve variants

of

k
-
anonymity are vul
nerable to active attacks. We then demonstrate that the
stronger

guarantee

ensured by ε
-
differential

privacyunfortunately does not provide any utility for this
problem. We then propose an algorithm ZEALOUS and show how to set its parameters to achieve (ε,
δ)
-
probabilistic

privacy. We also contrast our analysis

of

ZEALOUS with an analysis by Korolova et al. [17]
that achieves (ε',δ')
-
indistinguishability. Our paper concludes with

a

large experimental

study

using real
applications where we compare ZEALOUS and

previous work that achieves k
-
anonymity
in

search

log

publishing. Our results show that ZEALOUS yields comparable utility to k
-
anonymity while
at the same time achieving much strongerprivacy

guarantees

69.

Slicing: A New Approach to Privacy Preserving Data Pu
blishing

Several anonymization techniques, such as generalization and bucketization, have been designed for
privacy preserving microdata publishing. Recent work has shown that general
-
ization loses considerable
amount of information, especially

for high
-
d
imensional data. Bucketization, on the other hand,does not
prevent membership disclosure and does not apply for data that do not have a clear separation between
quasi
-
identifying attributes and sensitive attributes.

In this paper, we present a novel techni
que called
slicing, which partitions the data both horizontally and vertically.

We show that slicing preserves better data
utility than gen
-
eralization and can be used for membership disclosure pro
-
tection. Another important
advantage of slicing is that it

can handle high
-
dimensional data. We show how slicing can be used for
attribute disclosure protection and develop an ef
-
ficient algorithm for computing the sliced data that obey
the

-
diversity requirement. Our workload experiments confirm

that slicing pr
eserves better utility than
generalization and is more effective than bucketization in workloads involving the sensitive attribute. Our
experiments also demonstrate that slicing can be used to prevent membership disclosure.


70.

Ranking Model Adaptation for Do
main
-
Specific Search

With the explosive emergence of vertical search domains, applying the broad
-
based ranking model directly
to different domains is no longer desirable due to domain differences, while building a unique ranking
model for each domain is bo
th laborious for

labeling data and time
-
consuming for training models. In this
paper, we address these difficulties by proposing a regularization based algorithm called ranking adaptation
SVM (RA
-
SVM), through which we can adapt an existing ranking model
to a new domain, so that the
amount of labeled data and the training cost is reduced while the performance is still guaranteed. Our
algorithm only requires the prediction from the existing ranking models, rather than their internal

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


representations or the d
ata from auxiliary domains. In addition, we assume that documents similar in the
domain
-
specific feature space should have consistent rankings, and add some constraints to control the
margin and slack variables of RA
-
SVM adaptively. Finally, ranking adapta
bility measurement is proposed
to quantitatively estimate if an existing ranking model can be adapted to a new domain. Experiments
performed over Letor and two large scale datasets crawled from a commercial search engine demonstrate
the applicabilities of
the proposed ranking adaptation algorithms and the ranking adaptability measurement.


71.

Efficient

Extended

Boolean

Retrieval

Extended

Boolean

retrieval

(EBR) models were proposed nearly three decades ago, but have had little
practical impact, despite their significant advantages compared to either ranked keyword or
pure

Boolean

retrieval. In

particular, EBR models produce meaningful rankings; their query model allows
the representation of complex concepts in an and
-
or format; and they are scrutable, in that the score
assigned to a document depends solely on the content of that document, unaff
ected by any collection
statistics or other external factors. These characteristics make EBR models attractive in domains typified by
medical and legal searching, where the emphasis is on iterative development of reproducible complex
queries of dozens or e
ven hundreds of terms. However, EBR is much more computationally expensive than
the alternatives. We consider the implementation of the p
-
norm approach to EBR, and demonstrate that
ideas used in the max
-
score and wand exact optimization techniques for rank
ed keywordretrieval

can be
adapted to allow selective bypass of documents via a low
-
cost screening process for this and
similar

retrieval

models. We also propose term
-
independent bounds that are able to further reduce the
number of score calculations for s
hort, simple queries under the

extendedBoolean

retrieval

model.
Together, these methods yield an overall saving from 50 to 80 percent of the evaluation cost on test queries
drawn from biomedical search.

72.

Advance mining of temporal high utility Itemset

73.

Information

Technology

Skill

Management

Strategiesfor


Implementing

New

Technologies:


A

Case

ofService
-
Oriented

Architecture

Managing human resources and

skills

for

informationtechnology

(IT) presents

a

challenging
task

for

executives, more so
when

new

ITs are involved. Lack

of

familiarity with the

technology, the
learning curve associated with its incorporation, and the relative paucity

of

skilled personnel serve to
alter the

strategies

for

management

of

human resources and

skills. This paper p
resents

a

system
dynamics approach

for

examining alternative

strategies

for

skillmanagement

and supporting decisions
during the implementation

of

service
-
oriented

architecture

(SOA) in an organization.

For

projects
involving SOA, the initial planning and i
mplementation

of

the underlying

architecture

entail higher costs
and slower delivery

of

initial SOA applications. The use

of

appropriate IT human resource

management

strategies

for

SOA projects is critical

for

successful SOA implementation. The complexity
associated
with the fluctuating demand

for

IT

skills, coupled with the need

forhighly skilled senior architects and
professional developers in SOA projects, as well as inevitable delays in

skillacquisition, makes
this

a

challenging task. This paper examine
s the impact

of

alternative staffing

strategies

under various
environmental conditions and provides guidance

forstaffing decisions. Using

a

design science
methodology, it employs system dynamics as

a

vehicle

for

allowing human resource managers to
examine
the impact

of

alternative staffing

strategies

under

a

variety

of

environmental conditions.

74.

SQL INJECTIONS


A hazard to web applications

With changing times, our dependence on the web applications for the fulfilment of our daily needs (like
online shopping
, banking, share trading, ticket booking, payment of bills etc.) has increased. Because of
this, our confidential data is present in the databases of various applications on Web. The security of this
myriad amount of data is a matter of major concern. In r
ecent times, SQL Injection attacks have emerged
as a major threat to database security. In this paper we define SQL Injections, illustrate how SQL
Injections are performed. In addition we have also surveyed the various SQL Injection detection and
Preventio
n tools and well
-
known attack methods. Finally, we have provided our solution to the problem
and have assessed its performance.


JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


75.

An Exploration of Improving Collaborative Recommender Systems via User
-
Item Subgroups

Collaborative filtering (CF) is one of the

most successful recommendation approaches. It typically
associates a user

with a group of like
-
minded users based on their preferences over all the items, and
recommends to the user those items enjoyed by others in the group. However we find that two user
s with
similar tastes on one item subset may have totally different tastes on another set. In other words, there exist
many user
-
item subgroups each consisting of a subset of items and a group of like
-
minded users on these
items. It is more natural to make

preference predictions for a user via the correlated subgroups than the
entire user
-
item matrix. In this paper, to find meaningful subgroups, we formulate the Multiclass Co
-
Clustering (MCoC) problem and propose an effective solution to it. Then we propose

an

unified framework
to extend the traditional CF algorithms by utilizing the subgroups information for improving their

top
-
N
recommendation performance. Our approach can be seen as an extension of traditional clustering CF
models.

Systematic experiments
on three real world data sets have demonstrated the effectiveness of our
proposed approach.


76.

Hybrid Intrusion Detection Systems (HIDS) using Fuzzy Logic

The rapid growth of the computers that are interconnected, the crime rate has also increased and the wa
ys to
mitigate those crimes has become the important problem now. In the entire globe, organizations, higher
learning institutions and governments are completely dependent on the computer networks which plays a
major role in their daily operations. Hence t
he necessity for protecting those networked systems has also
increased. Cyber crimes like compromised server, phishing and sabotage of privacy information has
increased in the recent past. It need not be a massive intrusion, instead a single intrusion can
result in loss of
highly privileged and important data. Intusion behaviour can be classified based on different attack types.
Smart intruders will not attack using a single attack, instead, they will perform the attack by combining few
different attack typ
es to deceive the detection system at the gateway. As a countermeasure, computational
intelligence can be applied to the intrusion detection systems to realize the attacks, alert the administrator
about the form and severity, and also to take any predeterm
ined or adaptive measures dissuade the
intrusion.


77.

Organizing User Search Histories

Users are increasingly pursuing complex task
-
oriented goals on the Web, such as making travel
arrangements, managing finances

or planning purchases. To this end, they
usually break down the tasks into
a few co
-
dependent steps and issue multiple queries around these steps repeatedly over long periods of time.
To better support users in their long
-
term information quests on the Web, search engines keep track of their
quer
ies and clicks while searching online. In this paper, we study the problem of organizing a user’s
historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups
is helpful for a number of different search engine
components and applications, such as query suggestions,
result ranking, query alterations,

sessionization, and collaborative search. In our approach, we go beyond
approaches that rely on textual similarity or time thresholds, and we propose a more robust a
pproach that
leverages search query logs. We experimentally study the performance of different techniques, and
showcase their potential, especially when combined together.

78.

A Service Versioning Model For Personali
zed E
-

Learning System(SOA)

Service Version
ing is a hot topic that has generated a broad range of guidance from a variety of sources. Several Web
services standardization efforts are underway but none of them address the problem of service versioning.

Service versioning with metadata in e
-
learning
system makes easy search, retrieval, import and evaluate. In E learning
systems, learning objects with metadata allow the learners to use quality educational contents filling their
characteristic and teacher may use quality educational contents to structur
e their courses. A service versioning model
in e
-
learning objects system with metadata satisfies the requirements for learning environment. In personalized e
-
learning systems, when more numbers of learner searching data the retrieval time is being delayed
when the data
volume is increasing continuously. This problem can be solved by designing and applying a proper service versioning
model to personalized e
-
learning systems. Hence, it is proposed to design a service version model with metadata for
personaliz
ed e
-
learning system. This proposed service versioning model satisfies some of the requirements like
accessibility, interoperability, adaptability, durability and reusability in learning environment. Support multiple

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


versions of a service isolate more expe
nsive business behavior calls to specific versions so as to reduce impact to all of
the other learners.


79.

Monitoring Service Systems from a Language
-
Action Perspective (SOA)

Business processes are increasingly distributed and open, making them prone to fai
lure. Monitoring is, therefore, an
important concern not only for the processes themselves but also for the services that comprise these processes. We
present a framework for multilevel monitoring of these service systems. It formalizes interaction protoco
ls, policies,
and commitments that account for standard and extended effects following the language
-
action perspective, and allows
specification of goals and monitors at

varied abstraction levels. We demonstrate how the framework can be
implemented and eva
luate it with multiple scenarios that include specifying and monitoring open
-
service policy
commitments.


80.

SOA an Approach for Information Re
trieval Using Web Services


81.

Mining Web

Graphs for Recommendations

As the exponential explosion of various contents generated on the Web, Recommendation techniques have become
increasingly indispensable. Innumerable different kinds of recommendations are made on the Web every day,
including movies, music, images, books re
commendations, query suggestions, tags recommendations, etc. No matter
what types of data sources are used for the recommendations, essentially these data sources can be modeled in the
form of various types of graphs. In this paper, aiming at providing a g
eneral framework on mining Web graphs for
recommendations,

(1) we first propose a novel diffusion method which propagates similarities between different nodes and generates
recommendations;

(2) then we illustrate how to generalize different
recommendation problems into our graph diffusion framework. The
proposed framework can be utilized in many recommendationtasks on the World Wide Web, including query
suggestions, tag recommendations, expert finding, image recommendations, image annotations
, etc. The experimental
analysis on large datasets shows the promising future of our work.


82.

ODAM An Optimized Distributed Association Rule Mining Algorithm

With the explosive growth of information sources available on the World Wide Web, it has become incr
easingly
necessary for users to utilize automated tools in find the desired information resources, and to track and analyze their
usage patterns. Association rule mining is an active data mining research area. However, most ARM algorithms cater
to a centra
lized environment. In contrast to previous ARM algorithms, ODAM is a distributed algorithm for
geographically distributed data sets that reduces communication costs. Recently, as the need to mine patterns across
distributed databases has grown, Distributed

Association Rule Mining (D
-
ARM) algorithms have been developed.
These algorithms, however, assume that the databases are either horizontally or vertically distributed. In the special
case of databases populated from information extracted from textual data
, existing D
-
ARM algorithms cannot discover
rules based on higher
-
order associations between items in distributed textual documents that are neither vertically nor
horizontally distributed, but rather a hybrid of the two.

83.

Truth discovery in web search engi
nes.

The world
-
wide web has become the most important information source for most of us. Unfortunately, there is no
guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting in
-
formation on a subject,
such as different specifications for the same product. In this paper we propose a new problem
called Veracity that is conformity to truth, which studies how to find true facts from a large amount of conflicting
information on many subjects that is provided

by various web sites. We design a general framework for the Veracity
problem, and invent an algorithm called Truth Finder, which utilizes the relationships between web sites and their
information, i.e., a web site is trustworthy if it provides many pieces

of true information, and a piece of information is
likely to be true if it is provided by many trustworthy web sites. Our experiments show that Truth Finder successfully
finds true facts among conflicting information, and identifies trustworthy web sites
better than the popular search
engines.



JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


Artificial Intelligence

84.

Distributed management system


Distributed management system project is useful for companies to analyze products sales by manger of company by
collecting data from distributers, sales
managers, representatives..etc. This application is a web based application
which will help to upload sales data from different sources. Distributed management system consists of five modules
where each module has separate functionalities. Manager and admi
n has access to all modules.

The main objective of the project is to analyze the sales of the products by a manager through the details supplied by
the distributors, sales managers and representatives. It is very useful for the distributors, sales managers

to know about
the sales of the products done by them and by others in particular area/zone.


85.

Cyber credit card system

This CreditCard Banking (CCB) allows the user to use his credit card to purchase the products. This project will
validate the credit card

number, security number, and expiry date, discount products. After the validation of the credit
card, the amount for the purchasing products will be deducted from his bank account.

The way of people buying the variety of things, using credit card changed
the pattern of purchasing the products.
Previously, if the user wants to purchase something, he has to carry the money to all the places.

CCB gives all the information related to the credit cards and additional features of their credit cards, which makes t
he
customer or user wisely, to decide which credit card has to be selected.

This project has a powerful utility that enables users to know for the details of particular credit card in a very simple
and efficient manner the option is limited to these catego
ries of credit cards. Hence minimizing the time taken to know
for the details of credit card is in the user’s choice.


86.

Advanced secured system


ADVANCED SECURED SYSTEM” deals with the Server based Information and Maintenance of the Server. This
system is
used to reduce the workload of the server. It provides mail services, chat services between the clients and it
also response to the client requests. This system is designed as a middleman between the client and the server. This
system provides all kinds of

services to the clients like file transfer, mail, chat etc... This system is cost
-
effective and
provides a security like firewall to the server. Though there are any software available in the market there is no
popular server in terms of cost and providi
ng services. Developed in java platform will be an advantage to this
software.


87.

Secure Multi signature generation for group communication


In distributed systems it is sometimes necessary for users to share the power to use a cryptosystem. The system secr
et
is divided up into shares and securely stored by the entities forming the distributed cryptosystem. The main advantage
of a distributed cryptosystem is that the secret is never computed, reconstructed, or stored in a single location, making
the secret m
ore difficult to compromise. Investigations within the fields of threshold group
-
oriented signature
schemes, threshold group signature schemes, Multisignature schemes, and Threshold
-
Multisignature schemes resulted
in explicitl
y defining the properties of
T
hreshold
-
Multisignature schemes.



88.

Mobile payment service system


A Mobile Payment Service is designed for use on a handheld device such as a PDA or mobile phone. Mobile Payment
Service are optimized so as to display shopping application most effectively
for small screens on portable devices and
have small file sizes to accommodate the low memory capacity the low
-
bandwidth of wireless handheld devices. Java
technology is used, brings additional benefits that provides enhanced user experience, reduced airti
me requirement, and
provides rich animated graphi
cs etc.

89.

Helthcare service system


A

health care system

is the

organization

of people, institutions, and resources to deliver

health are

services to meet
the

health

needs of target populations. There is a wid
e variety of health care systems around the world, with as many

JAVA
PROJECTS ABSTRACT

(Networking, Network
-
Security, Mobile Computing, Cloud Computing, Wireless Sensor Network,
Datamining, Webmining, Artificial Intelligence, Vanet, Ad
-
Hoc Network)


#56, II Floor, Pushpagiri Complex, 17
th

Cross 8
th

Main, Opp Water Tank, Vijaynagar, Bangalore


40. Ph : 080


23208045 / 23207367, 9886173099, mail ID :
hr@citlindia.com,vinatha@citlindia.com


histories and organizational structures as there are nations. In some countries, health care system planning is distributed
among market participants. In others, there is a concerted effort am
ong governments, trade unions, charities, religious,
or other co
-
ordinate bodies to deliver planned health care services targeted to the populations they serve. However,
health care planning has been described as often evolutionary rather than revolutionar
y.

Health care information systems are becoming more and more computerized. A huge amount of health related
information needs to be stored and analyzed, and with the aid of computer systems this can be done faster and more
efficiently. The dynamic health c
are oriented paradigm provides an alternative way of developing medical based
systems.


MINI Projects

90.

SKIP: A Secure Key Issuing Scheme for Peer
-
to
-
Peer Networks

91.


The Implementation of a Web Crawler URL Filter Algorithm Based on Caching 2009