• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
IEEE 2013 projects,M.Tech 2013 Projects,Final year Engineering Projects,Best student Projects,MS Projects,BE Projects,2013 2014 IEEE Projects
 

IEEE 2013 projects,M.Tech 2013 Projects,Final year Engineering Projects,Best student Projects,MS Projects,BE Projects,2013 2014 IEEE Projects

on

  • 719 views

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.
DOMAINS WE ASSIST
HARDWARE:
Embedded, Robotics, Quadcopter (Flying Robot), Biomedical, Biometric, Automotive, VLSI, Wireless (GSM,GPS, GPRS, RFID, Bluetooth, Zigbee), Embedded Android.
SOFTWARE
Cloud Computing, Mobile Computing, Wireless Sensor Network, Network Security, Networking, Wireless Network, Data Mining, Web mining, Data Engineering, Cyber Crime, Android for application development.
SIMULATION:
Image Processing, Power Electronics, Power Systems, Communication, Biomedical, Geo Science & Remote Sensing, Digital Signal processing, Vanets, Wireless Sensor network, Mobile ad-hoc networks
TECHNOLOGIES WE WORK:
Embedded (8051, PIC, ARM7, ARM9, Embd C), VLSI (Verilog, VHDL, Xilinx), Embedded Android
JAVA / J2EE, XML, PHP, SOA, Dotnet, Java Android.
Matlab and NS2
TRAINING METHODOLOGY
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.



Statistics

Views

Total Views
719
Views on SlideShare
719
Embed Views
0

Actions

Likes
0
Downloads
2
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft Word

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 2013 projects,M.Tech 2013 Projects,Final year Engineering Projects,Best student Projects,MS Projects,BE Projects,2013 2014 IEEE Projects IEEE 2013 projects,M.Tech 2013 Projects,Final year Engineering Projects,Best student Projects,MS Projects,BE Projects,2013 2014 IEEE Projects Document Transcript

    • Mobile computing NO PRJ TITLE ABSTRACT DOMAIN YOP 1 1. Energy Efficient Cluster Based Routing Protocol for Wireless Sensor Network s 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 constraints 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 design 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 carried 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 candidate 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 are also reported. Future scopes of this work are outlined Mobile computing 2012 2 SDSM: A Secure Data Service Mechani sm in Mobile Cloud Computi ng To enhance the security of mobile cloud users, a few proposals have been presented recently. However we argue that most of them are not suitable for mobile cloud where mobile users might join or leave the mobile networks arbitrarily. In this paper, we design a secure mobile user-based data service mechanism (SDSM) to provide confidentiality and fine-grained access control for data stored in the cloud. This mechanism enables the mobile users to enjoy a secure outsourced data services at a minimized security management overhead. The core idea of SDSM is that SDSM outsources not only the data but also the security management to the mobile cloud in a trust way. Our analysis shows that the proposed mechanism has many advantages over the existing traditional methods such as lower overhead and convenient update, which could better cater the requirements in mobile cloud computing scenarios. Mobile Computing 2013 3 DSS: Distribut ed SINR- Based Scheduli ng Algorith m for Multihop Wireless Network s The problem of developing distributed scheduling algorithmsfor high throughput in multihop wireless networks has been extensively studied in recent years. The design of adistributed low-complexity scheduling algorithm becomes even more challenging when taking into account a physical interference model, which requires the SINR at a receiver to be checked when making scheduling decisions. To do so, we need to check whether a transmission failure is caused by interference due to simultaneous transmissions from distant nodes. In this paper, we propose a scheduling algorithmunder a physical interference model, which is amenable todistributed implementation with 802.11 CSMA technologies. The proposed scheduling algorithm is shown to achieve throughput optimality. We present two variations of thealgorithm to enhance the delay performance and to reduce the control overhead, respectively, while retaining throughput optimality Mobile computing 2013 #56, II Floor, Pushpagiri Complex, 17th Cross 8th Main, Opp Water Tank,Vijaynagar,Bangalore-560040. Website: www.citlprojects.com, Email ID: projects@citlindia.com,hr@citlindia.com 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)
    • 4 Channel- Aware Routing in MANET s With Route Handoff (AOMD V) 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 again, 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 the differences in performance between CA-AOMDV and AOMDV. Simulation and theoretical results show that CA-AOMDV has greatly improved network performance over AOMDV Mobile computing 2012 5 A Node- Disjoint Multipat h Routing Method Based on AODV Protocol for MANET s Frequent link failures 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-disjoint 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 First route for destination is determined, the source starts data transmission. All the other backup routes, if available, are determined concurrently with the data transmission through the First route. This minimizes the initial delay caused because data transmission 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 obtained 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. Mobile computing 2012 7 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 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 computation 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 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 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 anything about his GID. Therefore, 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 cooperation 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 knowledge, it is the First decentralized ABE scheme with privacy-preserving based on standard complexity assumptions. Mobile computing 2012 8 The Black- hole node attack in MANET 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 ondemand 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. Mobile computing 2012 9 Fast Data Collectio n in Tree- Based Wireless Sensor Network s 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 convergecast. 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 is 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. Mobile computing 2012
    • 10 Protectin g Location Privacy in Sensor Network s against a Global Eavesdro pper While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such contextual information 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 formalizes the location 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 location 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. Mobile computing 2012 11 Fast Detectio n of Mobile Replica Node Attacks in Wireless Sensor Network s Using Sequenti al Hypothes is 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 first work to tackle the problem of replica node attacks in mobile sensor networks. We show analytically and through simulation experiments that our schemes achieve effective and robust replica detection capability with reasonable overheads. Mobile computing 2012 12 Secure Data Collectio n in Wireless Sensor Network s Using Randomi zed Dispersiv e 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 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 energy 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 given security constraints. Extensive simulations are conducted to verify the validity of our mechanisms. Mobile computing 2012 13 On demand Tempora ry Route Recovery for Frequent Link Failures in Adhoc Network s Mobile computing 2012
    • 14 Secure Distance- Based Localizat ion 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 problem, 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, there 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 extend the above results to the 3-dimensional case. Experimental results demonstrate that our solution has very good localization accuracy and computational efficiency Mobile computing 2012