Ieee 2012 project_pdf_bangalore
Upcoming SlideShare
Loading in...5
×
 

Ieee 2012 project_pdf_bangalore

on

  • 1,290 views

Ieee 2012 project_pdf_bangalore

Ieee 2012 project_pdf_bangalore

Statistics

Views

Total Views
1,290
Slideshare-icon Views on SlideShare
1,290
Embed Views
0

Actions

Likes
0
Downloads
21
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Ieee 2012 project_pdf_bangalore Ieee 2012 project_pdf_bangalore Document Transcript

    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com IEEE 2012 Projects TitlesData Mining 1. Scalable Learning of Collective Behavior – Dot Net 2. Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis – Dot Net 3. Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques – Dot Net 4. Outsourced Similarity Search on Metric Data Assets – Java/J2EE 5. Publishing Search Logs—A Comparative Study of Privacy Guarantees – Java/J2EENetworking 6. Independent Directed Acyclic Graphs for Resilient Multipath Routing – Java 7. MeasuRouting: A Framework for Routing Assisted Traffic Monitoring – Java 8. Opportunistic Flow-level Latency Estimation using NetFlow – Java 9. Router Support for Fine-Grained Latency Measurements – Java 10. Design, Implementation, and Performance of A Load Balancer for SIP Server Clusters – Java 11. Privacy- and Integrity-Preserving Range Queries in Sensor Networks – Java 12. An Adaptive Opportunistic Routing Scheme for Wireless Ad-hoc Networks – JavaDependable Secure Computing 13. ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor Networks Using Sequential Hypothesis Testing – Java 14. Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs – Java 15. Packet-Hiding Methods for Preventing Selective Jamming Attacks – Java 16. Risk-Aware Mitigation for MANET Routing Attacks – JavaMAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.comImage Processing 17. Multiple exposure fusion for high dynamic range image acquisition – Dot NetMultimedia 18. Learn to Personalized Image Search from the Photo Sharing Websites – Java/J2EEMobile Computing 19. Energy-Efficient Cooperative Video Distribution with Statistical QoS Provisions over Wireless Networks – Java 20. Compressed-Sensing-Enabled Video Streaming for Wireless Multimedia Sensor Networks– Dot Net 21. Converge Cast: On the Capacity and Delay Tradeoffs – Dot NetParallel Distributed Systems 22. Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks – Java 23. Catching Packet Droppers and Modifiers in Wireless Sensor Networks - Dot Net 24. Exploiting Jamming-Caused Neighbor Changes for Jammer Localization – Java 25. Bounding the Impact of Unbounded Attacks in Stabilization – Dot Net 26. Cut Detection in Wireless Sensor Networks - Java 27. Detection and Localization of Multiple Spoofing Attackers in Wireless Networks – Java 28. Capacity of Data Collection in Arbitrary Wireless Sensor Networks – Java 29. BECAN: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False Data in Wireless Sensor Networks – Java 30. Balancing the Tradeoffs between Query Delay and Data Availability in MANETs – JavaSERVICES COMPUTING 31. Towards Secure and Dependable Storage Services in Cloud Computing – Java/J2EEMAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com Data Mining/ Knowledge and Data EngineeringS.No Title & Abstract Technology1 Scalable Learning of Collective Behavior Dot Net June 2012 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.2 Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis Dot Net April 2012 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).3 Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques Dot Net Recommender systems are becoming increasingly important to individual users and businesses for providing personalized recommendations. However, while the majority of algorithms proposed in recommender systems literature have focused on improving recommendation accuracy other important aspects of recommendation quality, such as the diversity of recommendations, have often been overlooked. In this paper, we introduce and explore a number of item ranking techniques that can generate substantially more diverse recommendations across all users whileMAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com maintaining comparable levels of recommendation accuracy.4 Outsourced Similarity Search on Metric Data Assets Java/J2EE Feb. 2012 To set 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. The goal of this research is to develop a transformation method for converting an original object p in a metric space into another metric space object. The data owner specifies a key value CK in order to define the instance to be used, then computes for each object p and uploads it to the server (i.e., service provider). At query time, the query user specifies his query object q and then submits the transformed query object to the server for similarity search.5 Publishing Search Logs—A Comparative Study of Privacy Guarantees Java/J2EE March 2012 To publish search logs with privacy. The aim is not to disclose sensitive information of the users searching the search engines. To implement ZEALOUS algorithm to publish search logs with privacy.MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com NetworkingS.No Title & Abstract Technology6 Independent Directed Acyclic Graphs for Resilient Multipath Routing JAVA Feb. 2012 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.7 MeasuRouting: A Framework for Routing Assisted Traffic Monitoring JAVA Feb. 2012 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.8 Opportunistic Flow-level Latency Estimation using NetFlow JAVA Feb. 2012 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.9 Router Support for Fine-Grained Latency Measurements JAVA June 2012 Datacenter network applications, including automated trading and high-performance computing,MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com 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.10 Design, Implementation, and Performance of A Load Balancer for SIP Server Clusters JAVA Preprint 2012 Feb 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.11 Privacy- and Integrity-Preserving Range Queries in Sensor Networks JAVA Preprint March 2012 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.12 An Adaptive Opportunistic Routing Scheme for Wireless Ad-hoc Networks JAVA Feb. 2012 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.MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com Dependable Secure Computing / Network SecurityS.No Title & Abstract Technology13 ZoneTrust: Fast Zone-Based Node Compromise Detection and Revocation in Wireless Sensor JAVA Networks Using Sequential Hypothesis Testing July-Aug. 2012 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.14 Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs JAVA March-April 2012 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 routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. To secure the WSNs against adversaries misdirecting the multi-hop routing, we designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs.15 Packet-Hiding Methods for Preventing Selective Jamming Attacks JAVA Jan.-Feb. 2012 Selective jamming attacks can be launched by performing real-time packet classification at the physical layer. To mitigate Selective jamming attacks, three schemes that prevent real- time packet classification by combining cryptographic primitives with physical-layer attributes to be proposed.16 Risk-Aware Mitigation for MANET Routing Attacks JAVA March-April 2012MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com Mobile Ad hoc Networks (MANET) have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. Proposed a risk-aware response mechanism to systematically cope with the identified routing attacks. Image ProcessingS.No Title & Abstract Technology17 Multiple exposure fusion for high dynamic range image acquisition Dot Net Jan. 2012 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. Multi MediaS.No Title & Abstract Technology18 Learn to Personalized Image Search from the Photo Sharing Websites Dot Net Aug. 2012 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.MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com Mobile ComputingS.No Title & Abstract Technology19 Energy-Efficient Cooperative Video Distribution with Statistical QoS Provisions over Wireless JAVA Networks July 2012 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.20 Compressed-Sensing-Enabled Video Streaming for Wireless Multimedia Sensor Networks Dot Net June. 2012 This paper presents the design of a networked system for joint compression, rate control and error correction of video over resource-constrained embedded devices based on the theory of Compressed Sensing (CS). The objective of this work is to design a cross-layer system that jointly controls the video encoding rate, the transmission rate, and the channel coding rate to maximize the received video quality. First, compressed sensing-based video encoding for transmission over Wireless Multimedia Sensor Networks (WMSNs) is studied. It is shown that compressed sensing can overcome many of the current problems of video over WMSNs, primarily encoder complexity and low resiliency to channel errors. A rate controller is then developed with the objective of maintaining fairness among different videos while maximizing the received video quality.21 Converge Cast: On the Capacity and Delay Tradeoffs Dot Net June. 2012 In this paper, we define an ad hoc network where multiple sources transmit packets to one destination as Converge-Cast network. We will study the capacity delay tradeoffs assuming that n wireless nodes are deployed in a unit square. For each session (the session is a dataflow from k different source nodes to 1 destination node), k nodes are randomlyMAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com selected as active sources and each transmits one packet to a particular destination node, which is also randomly selected. We first consider the stationary case, where capacity is mainly discussed and delay is entirely dependent on the average number of hops. Parallel and Distributed Systems/ Distributed NetworkingS.No Title & Abstract Technology22 Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks JAVA Jan. 2012 In unstructured peer-to-peer networks, the average response latency and traffic cost of a query are two main performance metrics. Controlled-flooding resource query algorithms are widely used in unstructured networks such as peer-to-peer networks. Propose Selective Dynamic Query (SDQ), SDQ calculates the optimal combination of an integer TTL value and a set of neighbors to control the scope of the next query.23 Catching Packet Droppers and Modifiers in Wireless Sensor Networks Dot Net May 2012 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.24 Exploiting Jamming-Caused Neighbor Changes for Jammer Localization JAVA March 2012 Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wide range of defense strategies. Proposed system localizes a jammer by exploiting neighbor changes.25 Bounding the Impact of Unbounded Attacks in Stabilization DOT NET March 2012MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com 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.26 Cut Detection in Wireless Sensor Networks JAVA March 2012 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.27 Detection and Localization of Multiple Spoofing Attackers in Wireless Networks JAVA Preprint April 2012 Wireless networks are vulnerable to spoofing attacks. Proposed a method for both detecting spoofing attacks, and locating the positions of adversaries performing the attacks.28 Capacity of Data Collection in Arbitrary Wireless Sensor Networks JAVA Jan. 2012 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.29 BECAN: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False JAVA Data in Wireless Sensor Networks Jan. 2012MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com
    • MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com www.projectsatbangalore.com 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.30 Balancing the Tradeoffs between Query Delay and Data Availability in MANETs JAVA April 2012 To propose data replication techniques to address query delay and data availability issues. As both metrics are important for mobile nodes, propose a technique to balance the tradeoffs between data availability and query delay under different system settings and requirements. Service ComputingS.No Title & Abstract Technology31 Towards Secure and Dependable Storage Services in Cloud Computing JAVA/J2EE April-June 2012 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.MAXINETEC (0) 9986694973 projectsatbangalore@gmail.com