Your SlideShare is downloading. ×
IEEE Projects 2013, Mtech projects 2013,Cloud Computing 2013,Final year engineering projects ieee based,BE Projects,Distributed & parallel Projects
Upcoming SlideShare
Loading in...5

Thanks for flagging this SlideShare!

Oops! An error has occurred.

Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

IEEE Projects 2013, Mtech projects 2013,Cloud Computing 2013,Final year engineering projects ieee based,BE Projects,Distributed & parallel Projects


Published on

CITL Tech Varsity, a leading institute for assisting academicians M.Tech / MS/ B.Tech / BE (EC, EEE, ETC, CS, IS, DCN, Power Electronics, Communication)/ MCA and BCA students in various Domains & …

CITL Tech Varsity, a leading institute for assisting academicians M.Tech / MS/ B.Tech / BE (EC, EEE, ETC, CS, IS, DCN, Power Electronics, Communication)/ MCA and BCA students in various Domains & Technologies from past several years.
Embedded, Robotics, Quadcopter (Flying Robot), Biomedical, Biometric, Automotive, VLSI, Wireless (GSM,GPS, GPRS, RFID, Bluetooth, Zigbee), Embedded Android.
Cloud Computing, Mobile Computing, Wireless Sensor Network, Network Security, Networking, Wireless Network, Data Mining, Web mining, Data Engineering, Cyber Crime, Android for application development.
Image Processing, Power Electronics, Power Systems, Communication, Biomedical, Geo Science & Remote Sensing, Digital Signal processing, Vanets, Wireless Sensor network, Mobile ad-hoc networks
Embedded (8051, PIC, ARM7, ARM9, Embd C), VLSI (Verilog, VHDL, Xilinx), Embedded Android
JAVA / J2EE, XML, PHP, SOA, Dotnet, Java Android.
Matlab and NS2
1. Train you on the technology as per the project requirement
2. IEEE paper explanation, Flow of the project, System Design.
3. Algorithm implementation & Explanation.
4. Project Execution & Demo.
5. Provide Documentation & Presentation of the project.

  • Be the first to comment

  • Be the first to like this

No Downloads
Total Views
On Slideshare
From Embeds
Number of Embeds
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

No notes for slide


  • 1. DISTRIBUTED AND PARALLEL NO PRJ TITLE ABSTRACT DOMAIN YOP 1 Distribut ed Private Key Generati on for Identity Based Cryptosy stems in Ad Hoc Network s 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 give 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 verifiable 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. DISTRIBUT ED AND PARALLEL 2012 2 DRINA: A Lightwei ght and Reliable Routing Approac h for in- Network Aggregat ion in Wireless Sensor Network s Large scale 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 when 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 messages 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, maximized 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 that 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 by WSNs. DISTRIBUT ED AND PARALLEL 2012 3 The Three- Tier Security Scheme in Wireless Sensor Network s 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 and revoking 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 collection 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 deploying 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. DISTRIBUT ED AND PARALLEL 2012 #56, II Floor, Pushpagiri Complex, 17th Cross 8th Main, Opp Water Tank,Vijaynagar,Bangalore-560040. Website:, Email ID:, MOB: 9886173099 / 9986709224, PH : 080 -23208045 / 23207367 JAVA / J2EE PROJECTS – 2013 (Networking, Network-Security, Mobile Computing, Cloud Computing, Wireless Sensor Network, Datamining, Webmining, Artificial Intelligence, Vanet, Ad-Hoc Network)
  • 2. 4 A 3N Approac h to Network Control and Manage ment 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 routing 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 problems 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 management 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. DISTRIBUT ED AND PARALLEL 2012 5 Towards Practical Commun ication in Byzantin e- 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 scheme 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 hidden constants and setup costs for our protocols are small, and no trusted third party is required. Finally, we present results from microbenchmarks conducted over PlanetLab showing that our protocols are practical for deployment under significant levels of churn and adversarial behavior. DISTRIBUT ED AND PARALLEL 2012 6 An Efficient and Adaptive Decentra lized File Replicati on Algorith m 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 efficiency. 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 and 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 DISTRIBUT ED AND PARALLEL 2012 7 Rumor Riding: Anonym zing Unstruct ured Peer-to- Peer Systems Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, 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 paths 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 cryptographic algorithm. DISTRIBUT ED AND PARALLEL 2012 8 FDAC: Toward Fine- grained Distribut ed Data Access Control in Wireless Sensor Network s 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 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 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. 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 platforms. To our best knowledge, this paper is the first to realize distributed fine-grained data access control for WSNs. DISTRIBUT ED AND PARALLEL 2012
  • 3. 9 Consiste nt Monitori ng System for Parallel and Distribut ed 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 mathematically analyze 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 PlanetLab, and from a peer-to-peer system (Overnet). Our results demonstrate that AVMON would work well in a wide variety of distributed systems. DISTRIBUT ED AND PARALLEL 2012