IEEE
2012 Projects Titles
Check page 3 for abstracts
Data Mining
1.
Scalable Learning of Collective Behavior –
Dot Net
2.
Horizontal Aggregations in SQL to Prepare Data
Sets for Data Mining Analysis –
Dot Net
Networking
3.
Independent Directed Acyclic Graphs for
Resilient Multipath Routing –
Java
4.
MeasuRouting: A Framework for Routing Assisted
Traffic Monitoring –
Java
5.
Opportunistic Flow-level Latency Estimation
using NetFlow -
Java
6.
Router Support for Fine-Grained Latency
Measurements –
Java
7.
Design, Implementation, and Performance of A
Load Balancer for SIP Server Clusters –
Java
8.
Privacy- and Integrity-Preserving Range Queries
in Sensor Networks
9.
An
Adaptive Opportunistic Routing Scheme for Wireless Ad-hoc Networks –
Java
Dependable Secure Computing
10.
ZoneTrust: Fast Zone-Based Node Compromise
Detection and Revocation in Wireless Sensor Networks Using Sequential
Hypothesis Testing –
Java
Image Processing
11.
Multiple exposure fusion for high dynamic range
image acquisition –
Dot Net
Multimedia
12.
Learn to Personalized Image Search from the
Photo Sharing Websites –
Java/J2EE
Mobile Computing
13.
Energy-Efficient Cooperative Video Distribution
with Statistical QoS Provisions over Wireless Networks –
Java
Parallel
Distributed Systems
14.
Catching Packet
Droppers and Modifiers in Wireless Sensor Networks
15.
Bounding the Impact of
Unbounded Attacks in Stabilization –
Dot Net
16.
Cut Detection in
Wireless Sensor Networks -
Java
17.
Detection and
Localization of Multiple Spoofing Attackers in Wireless Networks – Java
18.
Capacity of Data Collection in Arbitrary
Wireless Sensor Networks –
Java
19. BECAN: A Bandwidth-Efficient
Cooperative Authentication Scheme for Filtering Injected False Data in Wireless
Sensor Networks – Java
SERVICES COMPUTING
20. Towards Secure and Dependable Storage
Services in Cloud Computing – Java/J2EE
Data Mining/ Knowledge
and Data Engineering
|
S.No
|
Title & Abstract
|
Technology
|
|
1
|
Scalable Learning
of Collective Behavior
This study of collective behavior is to understand how
individuals behave in a social networking environment. Aim to learn to
predict collective behavior in social media. In particular, given information
about some individuals, how can we infer the behavior of unobserved
individuals in the same network? A social-dimension-based approach has been
shown effective in addressing the heterogeneity of connections presented in
social media.
|
Dot Net
|
|
2
|
Horizontal
Aggregations in SQL to Prepare Data Sets for 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 tables and aggregating columns. We propose simple, yet
powerful, methods to generate SQL code to return aggregated columns in a
horizontal tabular layout, returning a set of numbers instead of one number
per row. This new class of functions is called horizontal aggregations.
Horizontal aggregations build data sets with a horizontal denormalized layout
(e.g. point-dimension, observation-variable, instance-feature).
|
Dot Net
|
Networking
|
S.No
|
Title & Abstract
|
Technology
|
|
3
|
Independent Directed Acyclic Graphs for Resilient Multipath Routing
To achieve resilient multipath routing, the concept of
Independent Directed Acyclic Graphs (IDAGs) is introduced. Link-independent
(Node-independent) DAGs satisfy the property that any path from a source to
the root on one DAG is link-disjoint (node-disjoint) with any path from the
source to the root on the other DAG. DAGs supports: (1) multipath routing;
(2) use all possible edges; (3) recovery from single link failure; and (4)
one bit per packet as overhead.
|
JAVA
|
|
4
|
MeasuRouting: A Framework for Routing Assisted Traffic Monitoring
Monitoring transit traffic at one or more points in a
network. This problem is addressed by strategically routing traffic
sub-populations over fixed monitors. This approach is MeasuRouting.
MeasuRouting works within the constraints of existing intra-domain traffic
engineering operations that are geared for efficiently utilizing bandwidth
resources, or meeting Quality of Service (QoS) constraints, or both.
|
JAVA
|
|
5
|
Opportunistic Flow-level Latency Estimation using NetFlow
The inherent support in routers (SNMP counters or NetFlow)
is not sufficient to diagnose performance problems in IP networks, especially
for flow-specific problems where the aggregate behavior within a router
appears normal. Consistent NetFlow (CNF) architecture is proposed for
measuring per-flow performance measurements within routers. CNF proposes
hash-based sampling to ensure that two adjacent routers record the same
flows.
|
JAVA
|
|
6
|
Router Support for Fine-Grained Latency Measurements
Datacenter network
applications, including automated trading and high-performance computing,
have stringent end-to-end latency requirements where even microsecond
variations may be intolerable. The resulting fine-grained measurement demands
cannot be met effectively by existing technologies, such as SNMP, NetFlow, or
active probing. Instrumenting routers with a hash-based primitive that we
call a Lossy Difference Aggregator (LDA) to measure latencies down to tens of
microseconds even in the presence of packet loss.
|
JAVA
|
|
7
|
Design, Implementation, and Performance of A Load Balancer for SIP
Server Clusters
This load balancer improves
both throughput and response time versus a single node, while exposing a
single interface to external clients. The algorithm achieves Transaction Least-Work-Left (TLWL),
achieves its performance by integrating several features: knowledge of the
SIP protocol; dynamic estimates of back-end server load; distinguishing
transactions from calls; recognizing variability in call length; and
exploiting differences in processing costs for different SIP transactions.
|
JAVA
|
|
8
|
Privacy- and Integrity-Preserving Range Queries in Sensor Networks
The architecture of two-tiered
sensor networks, where storage nodes serve as an intermediate tier between
sensors and a sink for storing data and processing queries, has been widely
adopted. We propose SafeQ, a protocol that prevents attackers from gaining
information from both sensor collected data and sink issued queries. SafeQ
also allows a sink to detect compromised storage nodes when they misbehave.
|
JAVA
|
|
9
|
An Adaptive Opportunistic Routing Scheme for Wireless Ad-hoc Networks
A distributed adaptive
opportunistic routing scheme for multi-hop wireless ad-hoc networks is
proposed. The proposed opportunistically route the packets even in the
absence of reliable knowledge about channel statistics and network model. The
proposed routing scheme jointly addresses the issues of learning and routing
in an opportunistic context, where the network structure is characterized by
the transmission success probabilities.
|
JAVA
|
Dependable Secure
Computing / Network Security
|
S.No
|
Title & Abstract
|
Technology
|
|
10
|
ZoneTrust: Fast
Zone-Based Node Compromise Detection and Revocation in Wireless Sensor
Networks Using Sequential Hypothesis Testing
In wireless sensor networks, an adversary can physically
capture and compromise sensor nodes and then mount a variety of attacks. To
minimize the damage incurred by compromised nodes, the system should detect
and revoke them as soon as possible. Proposed a zone-based node compromise
detection scheme in sensor networks. The main idea of the proposed scheme is
to use sequential hypothesis testing to detect suspect regions in which
compromised nodes are likely placed.
|
JAVA
|
Image Processing
|
S.No
|
Title & Abstract
|
Technology
|
|
11
|
Multiple exposure
fusion for high dynamic range image acquisition
Multiple exposure fusion to enhance the dynamic range of an
image is proposed. The construction of high dynamic range images (HDRI) is
performed by combining multiple images taken with different exposures and
estimating the irradiance value for each pixel.
|
Dot Net
|
Multi Media
|
S.No
|
Title & Abstract
|
Technology
|
|
12
|
Learn to
Personalized Image Search from the Photo Sharing Websites
Personalized search serves are one, where the web search
experience is improved by generating the returned list according to the
modified user search intents. Proposed system considers the user and query
relevance to learn to personalized image search.
|
Dot Net
|
Mobile Computing
|
S.No
|
Title & Abstract
|
Technology
|
|
13
|
Energy-Efficient
Cooperative Video Distribution with Statistical QoS Provisions over Wireless Networks
For real-time video broadcast where multiple users are
interested in the same content, mobile-to-mobile cooperation can be utilized
to improve delivery efficiency and reduce network utilization. The resource
allocation problem for general multihop multicast network flows is considered
and derived the optimal solution that minimizes the total energy consumption
while guaranteeing a statistical end-to-end delay bound on each network path.
|
JAVA
|
Parallel and
Distributed Systems/ Distributed Networking
|
S.No
|
Title & Abstract
|
Technology
|
|
14
|
Catching Packet
Droppers and Modifiers in Wireless Sensor Networks
Packet dropping and modification are common attacks that
can be launched by an adversary to disrupt communication in wireless
multi-hop sensor networks. Proposed a effective scheme, which can identify misbehaving
forwarders that drop or modify packets.
|
|
|
15
|
Bounding the Impact
of Unbounded Attacks in Stabilization
Self-stabilization is a versatile approach to
fault-tolerance since it permits a distributed system to recover from any
transient fault that arbitrarily corrupts the contents of all memories in the
system. Byzantine tolerance is an attractive feature of distributed systems
that permits to cope with arbitrary malicious behaviors. Combining these two
properties proved difficult: it is impossible to contain the spatial impact
of Byzantine nodes in a self-stabilizing context for global tasks such as
tree orientation and tree construction.
|
DOT NET
|
|
16
|
Cut Detection in
Wireless Sensor Networks
A wireless sensor network can get separated into multiple
connected components due to the failure of some of its nodes, which is called
a “cut.” Aim is detecting cuts by the remaining nodes of a wireless sensor
network. Proposed algorithm allows 1) every node to detect when the
connectivity to a specially designated node has been lost, and 2) one or more
nodes (that are connected to the special node after the cut) to detect the
occurrence of the cut.
|
|
|
17
|
Detection and
Localization of Multiple Spoofing Attackers in Wireless Networks
Wireless networks are vulnerable to spoofing attacks. Proposed
a method for both detecting spoofing attacks, and locating the positions of
adversaries performing the attacks.
|
JAVA
|
|
18
|
Capacity of Data
Collection in Arbitrary Wireless Sensor Networks
How to efficiently collect sensing data from all sensor
nodes is critical to the performance of wireless sensor networks. We derive
the upper and constructive lower bounds for data collection capacity in
arbitrary networks. The proposed data collection method can lead to
order-optimal performance for any arbitrary sensor networks.
|
JAVA
|
|
19
|
BECAN: A
Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected
False Data in Wireless Sensor Networks
To propose a novel bandwidth-efficient cooperative
authentication (BECAN) scheme for filtering injected false data in wireless
sensor networks. To achieve not only high filtering probability but also high
reliability through BECAN scheme.
|
JAVA
|
Service Computing
|
S.No
|
Title & Abstract
|
Technology
|
|
20
|
Towards Secure and
Dependable Storage Services in Cloud Computing
Propose an effective and flexible distributed storage
verification scheme with dynamic data support to ensure the correctness and
availability of users’ data in the cloud. Data error localization i.e, to
indentify misbehaving server.
|
JAVA/J2EE
|
