Mobile computing java ieee projects 2012 Seabirds ( Chennai, Pondicherry, Vellore, Tirupati, Nellore, Chittoor )
- 1. SEABIRDS IEEE 2012 – 2013 SOFTWARE PROJECTS IN VARIOUS DOMAINS | JAVA | J2ME | J2EE | DOTNET |MATLAB |NS2 | SBGC SBGC 24/83, O Block, MMDA COLONY 4th FLOOR SURYA COMPLEX, ARUMBAKKAM SINGARATHOPE BUS STOP, CHENNAI-600106 OLD MADURAI ROAD, TRICHY- 620002 Web: www.ieeeproject.in E-Mail: [email protected] Trichy Chennai Mobile:- 09003012150 Mobile:- 09944361169 Phone:- 0431-4012303
- 2. SBGC Provides IEEE 2012-2013 projects for all Final Year Students. We do assist the students with Technical Guidance for two categories. Category 1 : Students with new project ideas / New or Old IEEE Papers. Category 2 : Students selecting from our project list. When you register for a project we ensure that the project is implemented to your fullest satisfaction and you have a thorough understanding of every aspect of the project. SBGC PROVIDES YOU THE LATEST IEEE 2012 PROJECTS / IEEE 2013 PROJECTS FOR FOLLOWING DEPARTMENT STUDENTS B.E, B.TECH, M.TECH, M.E, DIPLOMA, MS, BSC, MSC, BCA, MCA, MBA, BBA, PHD, B.E (ECE, EEE, E&I, ICE, MECH, PROD, CSE, IT, THERMAL, AUTOMOBILE, MECATRONICS, ROBOTICS) B.TECH(ECE, MECATRONICS, E&I, EEE, MECH , CSE, IT, ROBOTICS) M.TECH(EMBEDDED SYSTEMS, COMMUNICATION SYSTEMS, POWER ELECTRONICS, COMPUTER SCIENCE, SOFTWARE ENGINEERING, APPLIED ELECTRONICS, VLSI Design) M.E(EMBEDDED SYSTEMS, COMMUNICATION SYSTEMS, POWER ELECTRONICS, COMPUTER SCIENCE, SOFTWARE ENGINEERING, APPLIED ELECTRONICS, VLSI Design) DIPLOMA (CE, EEE, E&I, ICE, MECH,PROD, CSE, IT) MBA(HR, FINANCE, MANAGEMENT, HOTEL MANAGEMENT, SYSTEM MANAGEMENT, PROJECT MANAGEMENT, HOSPITAL MANAGEMENT, SCHOOL MANAGEMENT, MARKETING MANAGEMENT, SAFETY MANAGEMENT) We also have training and project, R & D division to serve the students and make them job oriented professionals
- 3. PROJECT SUPPORTS AND DELIVERABLES Project Abstract IEEE PAPER IEEE Reference Papers, Materials & Books in CD PPT / Review Material Project Report (All Diagrams & Screen shots) Working Procedures Algorithm Explanations Project Installation in Laptops Project Certificate
- 4. TECHNOLOGY : JAVA DOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTING S.No. IEEE TITLE ABSTRACT IEEE YEAR 1. Acknowledgment- We propose a broadcast algorithm suitable for a wide 2012 Based Broadcast range of vehicular scenarios, which only employs Protocol for local information acquired via periodic beacon Reliable and messages, containing acknowledgments of the Efficient Data circulated broadcast messages. Each vehicle decides Dissemination in whether it belongs to a connected dominating set Vehicular Ad Hoc (CDS). Vehicles in the CDS use a shorter waiting Networks 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 intermittent 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 regimes, 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. 2. FESCIM: Fair, In multihop cellular networks, the mobile nodes 2012 Efficient, and usually relay others’ packets for enhancing the Secure network performance and deployment. However, Cooperation selfish nodes usually do not cooperate but make use of Incentive the cooperative nodes to relay their packets, which has Mechanism for a negative effect on the network fairness and Multihop Cellular performance. In this paper, we propose a fair and Networks efficient incentive mechanism to stimulate the node cooperation. Our mechanism applies a fair charging policy by charging the source and destination nodes when both of them benefit from the communication. To implement this charging policy efficiently, hashing operations are used in the ACK packets to reduce the number of public-key-cryptography operations. Moreover, reducing the overhead of the payment checks is essential for the efficient implementation of the incentive mechanism due to the large number of payment transactions. Instead of generating a check per message, a small-size check can be generated per
- 5. route, and a check submission scheme is proposed to reduce the number of submitted checks and protect against collusion attacks. Extensive analysis and simulations demonstrate that our mechanism can secure the payment and significantly reduce the checks’ overhead, and the fair charging policy can be implemented almost computationally free by using hashing operations. 3. Characterizing the Cellular text messaging services are increasingly 2012 Security being relied upon to disseminate critical information Implications of during emergencies. Accordingly, a wide range of Third-Party organizations including colleges and universities now Emergency Alert partner with third-party providers that promise to Systems over improve physical security by rapidly delivering such Cellular Text messages. Unfortunately, these products do not work Messaging as advertised due to limitations of cellular Services infrastructure and therefore provide a false sense of security to their users. In this paper, we perform the first extensive investigation and characterization of the limitations of an Emergency Alert System (EAS) using text messages as a security incident response mechanism. We show emergency alert systems built on text messaging not only can meet the 10 minute delivery requirement mandated by the WARN Act, but also potentially cause other voice and SMS traffic to be blocked at rates upward of 80 percent. We then show that our results are representative of reality by comparing them to a number of documented but not previously understood failures. Finally, we analyze a targeted messaging mechanism as a means of efficiently using currently deployed infrastructure and third-party EAS. In so doing, we demonstrate that this increasingly deployed security infrastructure does not achieve its stated requirements for large populations. 4. Handling In a mobile ad hoc network, the mobility and resource 2012 Selfishness in constraints of mobile nodes may lead to network Replica partitioning or performance degradation. Several data Allocation over a replication techniques have been proposed to Mobile Ad Hoc minimize performance degradation. Most of them Network assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the
- 6. perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay. 5. Local Broadcast There are two main approaches, static and dynamic, to 2012 Algorithms in broadcast algorithms in wireless ad hoc networks. In Wireless Ad Hoc the static approach, local algorithms determine the Networks: status (forwarding/nonforwarding) of each node Reducing the proactively based on local topology information and a Number of globally known priority function. In this paper, we Transmissions first show that local broadcast algorithms based on the static approach cannot achieve a good approximation factor to the optimum solution (an NP-hard problem). However, we show that a constant approximation factor is achievable if (relative) position information is available. In the dynamic approach, local algorithms determine the status of each node “on-the-fly” based on local topology information and broadcast state information. Using the dynamic approach, it was recently shown that local broadcast algorithms can achieve a constant approximation factor to the optimum solution when (approximate) position information is available. However, using position information can simplify the problem. Also, in some applications it may not be practical to have position information. Therefore, we wish to know whether local broadcast algorithms based on the dynamic approach can achieve a constant approximation factor without using position information. We answer this question in the positive—we design a local broadcast algorithm in which the status of each node is decided “on-the-fly” and prove that the algorithm can achieve both full delivery and a constant approximation to the optimum solution.