TTA   FINAL YEAR PROJECTS TITLES         WITH ABSTRACT     IEEE 2013,2012,2011, 2010,etc..,Projects for B.E/B.Tech/M.E/MCA...
DOMAIN : NETWORKINGCODE       PROJECT TITLE             DESCRIPTION                                      REFERENCETTASTJ01...
The accuracy of the estimate can be                                     enhanced and its variance can be reduced          ...
protect or maximize his/her own profit. In                                      this paper, we analyze the optimal price  ...
launch low-effort jamming attacks that are                              difficult to detect and counter. In this work,    ...
Our results show that we are able to reduce                                   the load by ~ 24% (compared to a possible   ...
scale. Flow-based hashing algorithms also                                    perform badly due to the heavy-tailed flow-  ...
system membership is likely to change                                      during the system lifetime. In this paper, we  ...
percolation threshold, from which the benefit                                   of cooperation is justified. For example, ...
topologies for long term operation through                                     the optimized setting of link weights. Base...
different communication phases as                                       jammers in order to create intentional            ...
and diamond encoding (DE) are two                                      data-hiding methods proposed recently              ...
TTAECD20   Design and                  The multi-hop routing in wireless sensor            IEEE 2012           Implementat...
techniques         to     mitigate      such                                       critical attacks,      existing     sol...
outsourcers and workers are negligible.TTASTJ23   In Cloud, Can Scientific   The basic idea behind cloud computing is     ...
Forwarding               Internet. Storing data in a third partys                                    cloud system causes s...
bandwidth to the road network through                                        repeated measurements. In this paper,        ...
this strategy. On the other hand, our                                      study also shows that in-situ energy           ...
Capacity-Optimized Cooperative (COCO)                                     topology control scheme to improve the          ...
reduce battery usage on the mobile                                    devices and improve response times.                 ...
affect the results obtained before.TTASTJ32   Stateless Multicast         Multicast routing protocols typically rely     I...
hoc network from the perspective of                                     replica allocation. We term this selfish          ...
representative multicast protocol for                                       wireless mesh networks, and SPP, an           ...
policies.   We      leverage     the    JAR                                        programmable capabilities to both creat...
mergency Alert System (EAS)                                     using text messages as                                    ...
tremor, rigidity, slowness of movement,                                      and postural instability. The current        ...
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Project titles abstract_2012
Upcoming SlideShare
Loading in …5
×

Project titles abstract_2012

2,070 views

Published on

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
2,070
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
16
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Project titles abstract_2012

  1. 1. TTA FINAL YEAR PROJECTS TITLES WITH ABSTRACT IEEE 2013,2012,2011, 2010,etc..,Projects for B.E/B.Tech/M.E/MCA/Bsc/MscFor complete base paper, call now and talk to our expert89396 41060 | 89396 41061 | 044 4218 1385
  2. 2. DOMAIN : NETWORKINGCODE PROJECT TITLE DESCRIPTION REFERENCETTASTJ01 Bloom Cast: Efficient Efficient and effective full-text retrieval in and Effective Full-Text unstructured peer-to-peer networks remains Retrieval in a challenge in the research community. Unstructured P2P First, it is difficult, if not impossible, for IEEE 2012 Networks unstructured P2P systems to effectively locate items with guaranteed recall. Second, existing schemes to improve search success rate often rely on replicating a large number of item replicas across the wide area network, incurring a large amount of communication and storage costs. In this paper, we propose BloomCast, an efficient and effective full-text retrieval scheme, in unstructured P2P networks. By leveraging a hybrid P2P protocol, BloomCast replicates the items uniformly at random across the P2P networks, achieving a guaranteed recall at a communication cost of O(√N), where N is the size of the network. Furthermore, by casting Bloom Filters instead of the raw documents across the network, BloomCast significantly reduces the communication and storage costs for replication. We demonstrate the power of BloomCast design through both mathematical proof and comprehensive simulations based on the query logs from a major commercial search engine and NIST TREC WT10G data collection. Results show that BloomCast achieves an average query recall of 91 percent, which outperforms the existing WP algorithm by 18 percent, while BloomCast greatly reduces the search latency for query processing by 57 percent.TTAECJ02 Cooperative Density Density estimation is crucial for wireless ad IEEE 2012 Estimation in Random hoc networks for adequate capacity Wireless Ad Hoc planning. Protocols have to adapt their Networks operation to the density since the throughput in an ad hoc network approaches asymptotically to zero as the density increases. A wireless node can estimate the global density by using local information such as the received power from neighbors. In this paper, we propose a cross layer protocol to compute the density estimate.
  3. 3. The accuracy of the estimate can be enhanced and its variance can be reduced through cooperation among the nodes. Nodes share the received power measurements with each other. Based on the collected observations, the maximum likelihood estimate is computed. It is shown that cooperative density estimation has better accuracy with less variance than the individual estimation. When nodes share received power measurements from further away neighbors, the variance of the estimate is further reduced.TTAECJ03 FireCol A Collaborative Distributed denial-of-service (DDoS) attacks IEEE 2012 Protection Network for remain a major security problem, the the Detection of mitigation of which is very hard especially Flooding DDoS Attacks when it comes to highly distributed botnet- based attacks. The early discovery of these attacks, although challenging, is necessary to protect end-users as well as the expensive network infrastructure resources. In this paper, we address the problem of DDoS attacks and present the theoretical foundation, architecture, and algorithms of FireCol. The core of FireCol is composed of intrusion prevention systems (IPSs) located at the Internet service providers (ISPs) level. The IPSs form virtual protection rings around the hosts to defend and collaborate by exchanging selected traffic information. The evaluation of FireCol using extensive simulations and a real dataset is presented, showing FireCol effectiveness and low overhead, as well as its support for incremental deployment in real networks.TTAECJ04 Game-Theoretic Pricing Mobile phones are among the most popular IEEE 2012 for Video Streaming in consumer devices, and the recent Mobile Networks developments of 3G networks and smart phones enable users to watch video programs by subscribing data plans from service providers. Due to the ubiquity of mobile phones and phone-to-phone communication technologies, data-plan subscribers can redistribute the video content to nonsubscribers. Such a redistribution mechanism is a potential competitor for the mobile service provider and is very difficult to trace given users high mobility. The service provider has to set a reasonable price for the data plan to prevent such unauthorized redistribution behavior to
  4. 4. protect or maximize his/her own profit. In this paper, we analyze the optimal price setting for the service provider by investigating the equilibrium between the subscribers and the secondary buyers in the content-redistribution network. We model the behavior between the subscribers and the secondary buyers as a non-cooperative game and find the optimal price and quantity for both groups of users. Based on the behavior of users in the redistribution network, we investigate the evolutionarily stable ratio of mobile users who decide to subscribe to the data plan. Such an analysis can help the service provider preserve his/her profit under the threat of the redistribution networks and can improve the quality of service for end users.TTAECJ5,TT Throughput and Energy This paper studies the bottleneck link IEEE 2012AECD5 Efficiency in Wireless capacity under the Gaussian channel model Ad Hoc Networks With in strongly connected random wireless ad Gaussian Channels hoc networks, with n nodes independently and uniformly distributed in a unit square. We assume that each node is equipped with two transceivers (one for transmission and one for reception) and allow all nodes to transmit simultaneously. We draw lower and upper bounds, in terms of bottleneck link capacity, for homogeneous networks (all nodes have the same transmission power level) and propose an energy-efficient power assignment algorithm (CBPA) for heterogeneous networks (nodes may have different power levels), with a provable bottleneck link capacity guarantee of 2 Ω(Blog(1+1/√nlog n)), where B is the channel bandwidth. In addition, we develop a distributed implementation of CBPA 2 with O(n ) message complexity and provide extensive simulation results.TTAECJ06 Packet-Hiding Methods The open nature of the wireless medium IEEE 2012 for Preventing leaves it vulnerable to intentional Selective Jamming interference attacks, typically referred to as Attacks jamming. This intentional interference with wireless transmissions can be used as a launch-pad for mounting Denial-of-Service attacks on wireless networks. Typically, jamming has been addressed under an external threat model. However, adversaries with internal knowledge of protocol specifications and network secrets can
  5. 5. launch low-effort jamming attacks that are difficult to detect and counter. In this work, we address the problem of selective jamming attacks in wireless networks. In these attacks, the adversary is active only for a short period of time, selectively targeting messages of high importance. We illustrate the advantages of selective jamming in terms of network performance degradation and adversary effort by presenting two case studies; a selective attack on TCP and one on routing. We show that selective jamming attacks can be launched by performing real-time packet classification at the physical layer. To mitigate these attacks, we develop three schemes that prevent real-time packet classification by combining cryptographic primitives with physical-layer attributes. We analyze the security of our methods and evaluate their computational and communication overhead.TTAECJ07 Optimizing Cloud Virtualized cloud-based services can take IEEE 2012 Resources for advantage of statistical multiplexing across Delivering IPTV applications to yield significant cost savings. Services through However, achieving similar savings with Virtualization real-time services can be a challenge. In this paper, we seek to lower a providers costs for real-time IPTV services through a virtualized IPTV architecture and through intelligent time-shifting of selected services. Using Live TV and Video-on-Demand (VoD) as examples, we show that we can take advantage of the different deadlines associated with each service to effectively multiplex these services. We provide a generalized framework for computing the amount of resources needed to support multiple services, without missing the deadline for any service. We construct the problem as an optimization formulation that uses a generic cost function. We consider multiple forms for the cost function (e.g., maximum, convex and concave functions) reflecting the cost of providing the service. The solution to this formulation gives the number of servers needed at different time instants to support these services. We implement a simple mechanism for time- shifting scheduled jobs in a simulator and study the reduction in server load using real traces from an operational IPTV network.
  6. 6. Our results show that we are able to reduce the load by ~ 24% (compared to a possible ~ 31%). We also show that there are interesting open problems in designing mechanisms that allow time-shifting of load in such environments.TTAECJ08 Maximal Scheduling in This paper proposes a hyper graph IEEE 2012 Wireless Ad Hoc interference model for the scheduling Networks With problem in wireless ad hoc networks. The Hypergraph proposed hyper graph model can take the Interference Models sum interference into account and, therefore, is more accurate as compared with the traditional binary graph model. Further, different from the global signal-to- interference-plus-noise ratio (SINR) model, the hyper graph model preserves a localized graph-theoretic structure and, therefore, allows the existing graph-based efficient scheduling algorithms to be extended to the cumulative interference case. Finally, by adjusting certain parameters, the hyper graph can achieve a systematic tradeoff between the interference approximation accuracy and the user node coordination complexity during scheduling. As an application of the hyper graph model, we consider the performance of a simple distributed scheduling algorithm, i.e., maximal scheduling, in wireless networks. We propose a lower bound stability region for any maximal scheduler and show that it achieves a fixed fraction of the optimal stability region, which depends on the interference degree of the underlying hyper graph. We also demonstrate the interference approximation accuracy of hyper graphs in random networks and show that hyper graphs with small hyper edge sizes can model the interference quite accurately. Finally, the analytical performance is verified by simulation results.TTAECD09 Load Balancing Multipath Switching systems (MPS) are IEEE 2012 Multipath Switching intensely used in state-of-the-art core System with Flow routers to provide terabit or even petabit switching capacity. One of the most intractable issues in designing MPS is how to load balance traffic across its multiple paths while not disturbing the intra flow packet orders. Previous packet-based solutions either suffer from delay penalties or lead to 2 O(N ) hardware complexity, hence do not
  7. 7. scale. Flow-based hashing algorithms also perform badly due to the heavy-tailed flow- size distribution. In this paper, we develop a novel scheme, namely, Flow Slice (FS) that cuts off each flow into flow slices at every intra flow interval larger than a slicing threshold and balances the load on a finer granularity. Based on the studies of tens of real Internet traces, we show that setting a slicing threshold of 1-4 ms, the FS scheme achieves comparative load-balancing performance to the optimal one. It also limits the probability of out-of-order packets -6 to a negligible level (10 ) on three popular MPSes at the cost of little hardware complexity and an internal speedup up to two. These results are proven by theoretical analyses and also validated through trace- driven prototype simulations.TTAECD10 Distributed Throughput We develop a distributed throughput-optimal IEEE 2012 Maximization in power allocation algorithm in wireless Wireless Networks via networks. The study of this problem has Random Power been limited due to the non-convexity of the Allocation underlying optimization problems that prohibits an efficient solution even in a centralized setting. By generalizing the randomization framework originally proposed for input queued switches to SINR rate-based interference model, we characterize the throughput-optimality conditions that enable efficient and distributed implementation. Using gossiping algorithm, we develop a distributed power allocation algorithm that satisfies the optimality conditions, thereby achieving (nearly) 100 percent throughputs. We illustrate the performance of our power allocation solution through numerical simulation. solution (an NP-hard problem).TTAECD11 Automatic Byzantine-fault-tolerant replication enhances IEEE 2012 Reconfiguration for the availability and reliability of Internet Large-Scale Reliable services that store critical state and preserve Storage Systems it despite attacks or software errors. However, existing Byzantine-fault-tolerant storage systems either assume a static set of replicas, or have limitations in how they handle reconfigurations (e.g., in terms of the scalability of the solutions or the consistency levels they provide). This can be problematic in long-lived, large-scale systems where
  8. 8. system membership is likely to change during the system lifetime. In this paper, we present a complete solution for dynamically changing system membership in a large- scale Byzantine-fault-tolerant system. We present a service that tracks system membership and periodically notifies other system nodes of membership changes. The membership service runs mostly automatically, to avoid human configuration errors; is itself Byzantine-fault-tolerant and reconfigurable; and provides applications with a sequence of consistent views of the system membership. We demonstrate the utility of this membership service by using it in a novel distributed hash table called dBQS that provides atomic semantics even across changes in replica sets. dBQS is interesting in its own right because its storage algorithms extend existing Byzantine quorum protocols to handle changes in the replica set, and because it differs from previous DHTs by providing Byzantine fault tolerance and offering strong semantics. We implemented the membership service and dBQS. Our results show that the approach works well, in practice: the membership service is able to manage a large system and the cost to change the system membership is low.TTAECD12 Connectivity of Multiple In cognitive radio networks, the signal IEEE 2012 Cooperative Cognitive reception quality of a secondary user Radio Ad Hoc Networks degrades due to the interference from multiple heterogeneous primary networks, and also the transmission activity of a secondary user is constrained by its interference to the primary networks. It is difficult to ensure the connectivity of the secondary network. However, since there may exist multiple heterogeneous secondary networks with different radio access technologies, such secondary networks may be treated as one secondary network via proper cooperation, to improve connectivity. In this paper, we investigate the connectivity of such a cooperative secondary network from a percolation-based perspective, in which each secondary networks user may have other secondary networks users acting as relays. The connectivity of this cooperative secondary network is characterized in terms of
  9. 9. percolation threshold, from which the benefit of cooperation is justified. For example, while a non-cooperative secondary network does not percolate, percolation may occur in the cooperative secondary network; or when a non-cooperative secondary network percolates, less power would be required to sustain the same level of connectivity in the cooperative secondary network. DOMAIN –WIRELESS COMMUNICATION/WIRELESS NETWORKTTAECJ13 An Adaptive A distributed adaptive opportunistic routing IEEE 2012 Opportunistic Routing scheme for multi-hop wireless ad hoc Scheme for Wireless networks is proposed. The proposed scheme Ad-hoc Networks utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model. This scheme is shown to be optimal with respect to an expected average per-packet reward criterion. 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. In particular, this learning framework leads to a stochastic routing scheme that optimally “explores” and “exploits” the opportunities in the network.TTAECJ14 AMPLE An Adaptive Handling traffic dynamics in order to avoid IEEE 2012 Traffic Engineering network congestion and subsequent service System Based on disruptions is one of the key tasks Virtual Routing performed by contemporary network Topologies management systems. Given the simple but rigid routing and forwarding functionalities in IP base environments, efficient resource management and control solutions against dynamic traffic conditions is still yet to be obtained. In this article, we introduce AMPLE - an efficient traffic engineering and management system that performs adaptive traffic control by using multiple virtualized routing topologies. The proposed system consists of two complementary components: offline link weight optimization that takes as input the physical network topology and tries to produce maximum routing path diversity across multiple virtual routing
  10. 10. topologies for long term operation through the optimized setting of link weights. Based on these diverse paths, adaptive traffic control performs intelligent traffic splitting across individual routing topologies in reaction to the monitored network dynamics at short timescale. According to our evaluation with real network topologies and traffic traces, the proposed system is able to cope almost optimally with unpredicted traffic dynamics and, as such, it constitutes a new proposal for achieving better quality of service and overall network performance in IP networks. DOMAIN : NETWORK SECURITYCODE PROJECT TITLE DESCRIPTION REFERENCETTAECJ15 Distributed Private Key Identity Based Cryptography (IBC) has IEEE 2012 Generation for Identity the advantage that no public key Based Cryptosystems in certification is needed when used in a Ad Hoc Networks 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.TTAECJ16 Joint Relay and Jammer In this paper, we investigate joint relay IEEE 2012 Selection for Secure Two- and jammer selection in two-way Way Relay Networks cooperative networks, consisting of two sources, a number of intermediate nodes, and one eavesdropper, with the constraints of physical-layer security. Specifically, the proposed algorithms select two or three intermediate nodes to enhance security against the malicious eavesdropper. The first selected node operates in the conventional relay mode and assists the sources to deliver their data to the corresponding destinations using an amplify-and-forward protocol. The second and third nodes are used in
  11. 11. different communication phases as jammers in order to create intentional interference upon the malicious eavesdropper. First, we find that in a topology where the intermediate nodes are randomly and sparsely distributed, the proposed schemes with cooperative jamming outperform the conventional non-jamming schemes within a certain transmitted power regime. We also find that, in the scenario where the intermediate nodes gather as a close cluster, the jamming schemes may be less effective than their non-jamming counterparts. Therefore, we introduce a hybrid scheme to switch between jamming and non-jamming modes. Simulation results validate our theoretical analysis and show that the hybrid switching scheme further improves the secrecy rate.TTAECJ17 A Secure Single Sign-On User identification is an important access IEEE 2012 Mechanism for Distributed control mechanism for client-server Computer Networks networking architectures. The concept of single sign-on can allow legal users to use the unitary token to access different service providers in distributed computer networks. Recently, some user identification schemes have been proposed for distributed computer networks. Unfortunately, most existing schemes cannot preserve user anonymity when possible attacks occur. Also, the additional time-synchronized mechanisms they use may cause extensive overhead costs. To overcome these drawbacks, we propose a secure single sign-on mechanism that is efficient, secure, and suitable for mobile devices in distributed computer networks.TTAECD18 A Novel Data Embedding This paper proposes a new data-hiding IEEE 2012 Method Using Adaptive method based on pixel pair matching Pixel Pair Matching (PPM). The basic idea of PPM is to use the values of pixel pair as a reference coordinate, and search a coordinate in the neighborhood set of this pixel pair according to a given message digit. The pixel pair is then replaced by the searched coordinate to conceal the digit. Exploiting modification direction (EMD)
  12. 12. and diamond encoding (DE) are two data-hiding methods proposed recently based on PPM. The maximum capacity of EMD is 1.161 bpp and DE extends the payload of EMD by embedding digits in a larger notational system. The proposed method offers lower distortion than DE by providing more compact neighborhood sets and allowing embedded digits in any notational system. Compared with the optimal pixel adjustment process (OPAP) method, the proposed method always has lower distortion for various payloads. Experimental results reveal that the proposed method not only provides better performance than those of OPAP and DE, but also is secure under the detection of some well-known steg- analysis techniques.TTAECD19 Characterizing the The Naval Research Laboratory (NRL) IEEE 2012 Efficacy of the NRL Network Pump, or Pump, is a standard Network Pump in for mitigating covert channels that arise Mitigating Covert Timing in a multilevel secure (MLS) system Channels when a high user (HU) sends acknowledgements to a low user (LU). The issue here is that HU can encode information in the "timings" of the acknowledgements. The Pump aims at mitigating the covert timing channel by introducing buffering between HU and LU, as well as adding noise to the acknowledgment timings. We model the working of the Pump in certain situations, as a communication system with feedback and use then this perspective to derive an upper bound on the capacity of the covert channel between HU and LU in the Pump. This upper bound is presented in terms of a directed information flow over the dynamics of the system. We also present an achievable scheme that can transmit information over this channel. When the support of the noise added by Pump to acknowledgment timings is finite, the achievable rate is nonzero, i.e., infinite number of bits can be reliably communicated. If the support of the noise is infinite, the achievable rate is zero and hence a finite number of bits can be communicated.
  13. 13. TTAECD20 Design and The multi-hop routing in wireless sensor IEEE 2012 Implementation of TARF A networks (WSNs) offers little protection Trust-Aware Routing against identity deception through Framework for WSNs 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. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust- aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implementedTARF, a robust trust- aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF- shielding network conditions. Further, we have implemented a low-overhead TARF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an ant detection mechanism.TTAECD21 Risk-Aware Mitigation for Mobile Ad hoc Networks (MANET) have IEEE 2012 MANET Routing Attacks 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. Even though there exist several intrusions response
  14. 14. techniques to mitigate such critical attacks, existing solutions typically attempt to isolate malicious nodes based on binary or naive fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure, and naive fuzzy responses could lead to uncertainty in countering routing attacks in MANET. In this paper, we propose a risk- aware response mechanism to systematically cope with the identified routing attacks. Our risk- aware approach is based on an extended Dempster-Shafer mathematical theory of evidence introducing a notion of importance factors. In addition, our experiments demonstrate the effectiveness of our approach with the consideration of several performance metrics. DOMAIN :CLOUD COMPUTINGTTASTD22,T Payments for Outsourced With the recent advent of cloud IEEE 2012TASTJ22,TT Computations computing, the concept of outsourcingASTA22 computations, initiated by volunteer computing efforts, is being revamped. While the two paradigms differ in several dimensions, they also share challenges, stemming from the lack of trust between outsourcers and workers. In this work, we propose a unifying trust framework, where correct participation is financially rewarded: neither participant is trusted, yet outsourced computations are efficiently verified and validly remunerated. We propose three solutions for this problem, relying on an offline bank to generate and redeem payments; the bank is oblivious to interactions between outsourcers and workers. We propose several attacks that can be launched against our framework and study the effectiveness of our solutions. We implemented our most secure solution and our experiments show that it is efficient: the bank can perform hundreds of payment transactions per second and the overheads imposed on
  15. 15. outsourcers and workers are negligible.TTASTJ23 In Cloud, Can Scientific The basic idea behind cloud computing is IEEE 2012 Communities Benefit from that resource providers offer elastic the Economies of Scale? resources to end users. In this paper, we intend to answer one key question to the success of cloud computing: in cloud, can small-to-medium scale scientific communities benefit from the economies of scale? Our research contributions are threefold: first, we propose an innovative public cloud usage model for small-to- medium scale scientific communities to utilize elastic resources on a public cloud site while maintaining their flexible system controls, i.e., create, activate, suspend, resume, deactivate, and destroy their high-level management entities-service management layers without knowing the details of management. Second, we design and implement an innovative system- Dawning Cloud, at the core of which are lightweight service management layers running on top of a common management service framework. The common management service framework of Dawning Cloud not only facilitates building lightweight service management layers for heterogeneous workloads, but also makes their management tasks simple. Third, we evaluate the systems comprehensively using both emulation and real experiments. We found that for four traces of two typical scientific workloads: High-Throughput Computing (HTC) and Many-Task Computing (MTC), Dawning Cloud saves the resource consumption maximally by 59.5 and 72.6 percent for HTC and MTC service providers, respectively, and saves the total resource consumption maximally by 54 percent for the resource provider with respect to the previous two public cloud solutions. To this end, we conclude that small-to-medium scale scientific communities indeed can benefit from the economies of scale of public clouds with the support of the enabling system.TTASTJ24 Secure Erasure Code- A cloud storage system, consisting of a IEEE 2012 Based Cloud Storage collection of storage servers, provides System with Secure Data long-term storage services over the
  16. 16. Forwarding Internet. Storing data in a third partys cloud system causes serious concern over data confidentiality. General encryption schemes protect data confidentiality, but also limit the functionality of the storage system because a few operations are supported over encrypted data. Constructing a secure storage system that supports multiple functions is challenging when the storage system is distributed and has no central authority. We propose a threshold proxy re-encryption scheme and integrate it with a decentralized erasure code such that a secure distributed storage system is formulated. The distributed storage system not only supports secure and robust data storage and retrieval, but also lets a user forward his data in the storage servers to another user without retrieving the data back. The main technical contribution is that the proxy re-encryption scheme supports encoding operations over encrypted messages as well as forwarding operations over encoded and encrypted messages. Our method fully integrates encrypting, encoding, and forwarding. We analyze and suggest suitable parameters for the number of copies of a message dispatched to storage servers and the number of storage servers queried by a key server. These parameters allow more flexible adjustment between the number of storage servers and robustness. DOMAIN :MOBILE COMPUTINGTTAECJ25 Improving QoS in High- It is widely evidenced that location has a IEEE 2012 Speed Mobility Using significant influence on the actual Bandwidth Maps bandwidth that can be expected from Wireless Wide Area Networks (WWANs), e.g., 3G. Because a fast-moving vehicle continuously changes its location, vehicular mobile computing is confronted with the possibility of significant variations in available network bandwidth. While it is difficult for providers to eliminate bandwidth disparity over a large service area, it may be possible to map network
  17. 17. bandwidth to the road network through repeated measurements. In this paper, we report results of an extensive measurement campaign to demonstrate the viability of such bandwidth maps. We show how bandwidth maps can be interfaced with adaptive multimedia servers and the emerging vehicular communication systems that use on- board mobile routers to deliver Internet services to the passengers. Using simulation experiments driven by our measurement data, we quantify the improvement in Quality of Service (QoS) that can be achieved by taking advantage of the geographical knowledge of bandwidth provided by the bandwidth maps. We find that our approach reduces the frequency of disruptions in perceived QoS for both audio and video applications in high- speed vehicular mobility by several orders of magnitude.TTAECJ26 Energy-Efficient Distributed Information Sharing (DISH) IEEE 2012 Strategies for Cooperative is a new cooperative approach to Multichannel MAC designing multichannel MAC protocols. It Protocols aids nodes in their decision making processes by compensating for their missing information via information sharing through neighboring nodes. This approach was recently shown to significantly boost the throughput of multichannel MAC protocols. However, a critical issue for ad hoc communication devices, viz. energy efficiency, has yet to be addressed. In this paper, we address this issue by developing simple solutions that reduce the energy consumption without compromising the throughput performance and meanwhile maximize cost efficiency. We propose two energy- efficient strategies: in-situ energy conscious DISH, which uses existing nodes only, and altruistic DISH, which requires additional nodes called altruists. We compare five protocols with respect to these strategies and identify altruistic DISH to be the right choice in general: it 1) conserves 40-80 percent of energy, 2) maintains the throughput advantage, and 3) more than doubles the cost efficiency compared to protocols without
  18. 18. this strategy. On the other hand, our study also shows that in-situ energy conscious DISH is suitable only in certain limited scenarios.TTAECJ27 FESCIM: Fair, Efficient, In multi-hop cellular networks, the IEEE 2012 and Secure Cooperation mobile nodes usually relay others Incentive Mechanism for packets for enhancing the network Multi-hop Cellular performance and deployment. However, Networks selfish nodes usually do not cooperate but make use of the cooperative nodes to relay their packets, which has a negative effect on the network fairness and performance. In this paper, we propose a fair and 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 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.TTAECJ28 Topology Control in Cooperative communication has received IEEE 2012 Mobile Ad Hoc Networks tremendous interest for wireless with Cooperative networks. Most existing works on Communications cooperative communications are focused on link-level physical layer issues. Consequently, the impacts of cooperative communications on network-level upper layer issues, such as topology control, routing and network capacity, are largely ignored. In this article, we propose a
  19. 19. Capacity-Optimized Cooperative (COCO) topology control scheme to improve the network capacity in MANETs by jointly considering both upper layer network capacity and physical layer cooperative communications. Through simulations, we show that physical layer cooperative communications have significant impacts on the network capacity, and the proposed topology control scheme can substantially improve the network capacity in MANETs with cooperative communications.TTAECD29 Cooperative download in We consider a complex (i.e., nonlinear) IEEE 2012 vehicular environments road scenario where users aboard vehicles equipped with communication interfaces are interested in downloading large files from road-side Access Points (APs). We investigate the possibility of exploiting opportunistic encounters among mobile nodes so to augment the transfer rate experienced by vehicular downloaders. To that end, we devise solutions for the selection of carriers and data chunks at the APs, and evaluate them in real-world road topologies, under different AP deployment strategies. Through extensive simulations, we show that carry & forward transfers can significantly increase the download rate of vehicular users in urban/suburban environments, and that such a result holds throughout diverse mobility scenarios, AP placements and network loads.TTAECD30 Network Assisted Mobile Many mobile applications retrieve IEEE 2012 Computing with Optimal content from remote servers via user Uplink Query Processing generated queries. Processing these queries is often needed before the desired content can be identified. Processing the request on the mobile devices can quickly sap the limited battery resources. Conversely, processing user-queries at remote servers can have slow response times due communication latency incurred during transmission of the potentially large query. We evaluate a network- assisted mobile computing scenario where mid-network nodes with "leasing" capabilities are deployed by a service provider. Leasing computation power can
  20. 20. reduce battery usage on the mobile devices and improve response times. However, borrowing processing power from mid-network nodes comes at a leasing cost which must be accounted for when making the decision of where processing should occur. We study the tradeoff between battery usage, processing and transmission latency, and mid-network leasing. We use the dynamic programming framework to solve for the optimal processing policies that suggest the amount of processing to be done at each mid-network node in order to minimize the processing and communication latency and processing costs. Through numerical studies, we examine the properties of the optimal processing policy and the core tradeoffs in such systems.TTASTJ31 Smooth Trade-Offs Throughput capacity in mobile ad hoc IEEE 2012 between Throughput and networks has been studied extensively Delay in Mobile Ad Hoc under many different mobility models. Networks However, most previous research assumes global mobility, and the results show that a constant per-node throughput can be achieved at the cost of very high delay. Thus, we are having a very big gap here, i.e., either low throughput or low delay in static networks or high throughput and high delay in mobile networks. In this paper, employing a practical restricted random mobility model, we try to fill this gap. Specifically, we assume that a network of unit area with n nodes is evenly divided into cells with an area of n -2α, each of which is further evenly divided into -2β squares with an area of n (0≤ α ≤ β ≤1/2). All nodes can only move inside the cell which they are initially distributed in, and at the beginning of each time slot, every node moves from its current square to a uniformly chosen point in a uniformly chosen adjacent square. By proposing a new multihop relay scheme, we present smooth trade- offs between throughput and delay by controlling nodes mobility. We also γ consider a network of area n (0 ≤ γ ≤ 1) and find that network size does not
  21. 21. affect the results obtained before.TTASTJ32 Stateless Multicast Multicast routing protocols typically rely IEEE 2012 Protocol for Ad Hoc on the a priori creation of a multicast Networks tree (or mesh), which requires the individual nodes to maintain state information. In dynamic networks with bursty traffic, where long periods of silence are expected between the bursts of data, this multicast state maintenance adds a large amount of communication, processing, and memory overhead for no benefit to the application. Thus, we have developed a stateless receiver-based multicast (RBMulticast) protocol that simply uses a list of the multicast members (e.g., sinks) addresses, embedded in packet headers, to enable receivers to decide the best way to forward the multicast traffic. This protocol, called Receiver-Based Multicast, exploits the knowledge of the geographic locations of the nodes to remove the need for costly state maintenance (e.g., tree/mesh/neighbor table maintenance), making it ideally suited for multicasting in dynamic networks. RBMulticast was implemented in the OPNET simulator and tested using a sensor network implementation. Both simulation and experimental results confirm that RBMulticast provides high success rates and low delay without the burden of state maintenance.TTASTJ33 Handling Selfishness in In a mobile ad hoc network, the mobility IEEE 2012 Replica Allocation over a and resource constraints of mobile nodes Mobile Ad Hoc Network may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them 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
  22. 22. hoc network from the 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.TTASTNS34 Secure High-Throughput Recent work in multicast routing for IEEE 2012 Multicast Routing in wireless mesh networks has focused on Wireless Mesh Networks metrics that estimate link quality to maximize throughput. Nodes must collaborate in order to compute the path metric and forward data. The assumption that all nodes are honest and behave correctly during metric computation, propagation, and aggregation, as well as during data forwarding, leads to unexpected consequences in adversarial networks where compromised nodes act maliciously. In this work, we identify novel attacks against high-throughput multicast protocols in wireless mesh networks. The attacks exploit the local estimation and global aggregation of the metric to allow attackers to attract a large amount of traffic. We show that these attacks are very effective against multicast protocols based on high- throughput metrics. We conclude that aggressive path selection is a double- edged sword: While it maximizes throughput, it also increases attack effectiveness in the absence of defense mechanisms. Our approach to defend against the identified attacks combines measurement-based detection and accusation-based reaction techniques. The solution accommodates transient network variations and is resilient against attempts to exploit the defense mechanism itself. A detailed security analysis of our defense scheme establishes bounds on the impact of attacks. We demonstrate both the attacks and our defense using ODMRP, a
  23. 23. representative multicast protocol for wireless mesh networks, and SPP, an adaptation of the well-known ETX unicast metric to the multicast setting. DOMAIN :ANDROIDTTASTA35,T Ubisoap: A Service- The computing and networking capacities IEEE 2012TASTJ35 Oriented Middleware for of todays wireless portable devices allow Ubiquitous Networking for ubiquitous services, which are seamlessly networked. Indeed, wireless handheld devices now embed the necessary resources to act as both service clients and providers. However, the ubiquitous networking of services remains challenged by the inherent mobility and resource constraints of the devices, which make services a priori highly volatile. This paper discusses the design, implementation, and experimentation of the ubiSOAP service- oriented middleware, which leverages wireless networking capacities to effectively enable the ubiquitous networking of services. ubiSOAP specifically defines a layered communication middleware that underlies standard SOAP-based middleware, hence supporting legacy Web Services while exploiting nowadays ubiquitous connectivity.TTASTA36,T Ensuring Distributed Cloud computing enables highly scalable IEEE 2012TASTJ36 Accountability for Data services to be easily consumed over the Sharing in the Cloud Internet on an as-needed basis. A major feature of the cloud services is that users data are usually processed remotely in unknown machines that users do not own or operate. While enjoying the convenience brought by this new emerging technology, users fears of losing control of their own data (particularly, financial and health data) can become a significant barrier to the wide adoption of cloud services. To address this problem, in this paper, we propose a novel highly decentralized information accountability framework to keep track of the actual usage of the users data in the cloud. In particular, we propose an object-centered approach that enables enclosing our logging mechanism together with users data and
  24. 24. policies. We leverage the JAR programmable capabilities to both create a dynamic and traveling object, and to ensure that any access to users data will trigger authentication and automated logging local to the JARs. To strengthen users control, we also provide distributed auditing mechanisms. We provide extensive experimental studies that demonstrate the efficiency and effectiveness of the proposed approaches.TTASTA37,T Who, When, Where: We consider variations of a problem in IEEE 2012TASTJ37 Timeslot Assignment to which data must be delivered to mobile Mobile Client clients en route, as they travel toward their destinations. The data can only be delivered to the mobile clients as they pass within range of wireless base stations. Example scenarios include the delivery of building maps to firefighters responding to multiple alarms. We cast this scenario as a parallel-machine scheduling problem with the little-studied property that jobs may have different release times and deadlines when assigned to different machines. We present new algorithms and also adapt existing algorithms, for both online and offline settings. We evaluate these algorithms on a variety of problem instance types, using both synthetic and real-world data, including several geographical scenarios, and show that our algorithms produce schedules achieving near-optimal throughput.TTASTA38 Characterizing the Cellular text messaging services are IEEE 2012 Security Implications of increasingly being relied upon to Third-Party Emergency disseminate critical information during Alert Systems over emergencies. Accordingly, a wide Cellular Text Messaging range of organizations including colleges Services and universities now partner with third- party providers that promise to improve physical security by rapidly delivering such messages. Unfortunately, these products do not work as advertised due to limitations of cellular 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 E
  25. 25. mergency 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.TTASTA39 Design and The devices most often used for IT IEEE 2012 Implementation of services are changing from PCs and Improved Authentication laptops to smart phones and tablets. System for Android These devices need to be small for Smartphone Users increased portability. These technologies are convenient, but as the devices start to contain increasing amounts of important personal information, better security is required. Security systems are rapidly being developed, as well as solutions such as remote control systems. However, even with these solutions, major problems could still result after a mobile device is lost. In this thesis, we present our upgraded Lock Screen system, which is able to support authentication for the users convenience and provide a good security system for smart phones. We also suggest an upgraded authentication system for Android smart phones.TTASTA40 Android Application for The paper presents an application for IEEE 2012 Spiral Analysis in spiral analysis in Parkinsons Disease Parkinson’s Disease (PD). PD is one of the most common degenerative disorders of the central nervous system that affects elderly. Four cardinal symptoms of the disease are
  26. 26. tremor, rigidity, slowness of movement, and postural instability. The current diagnosis is based on clinical observation which relies on skills and experiences of a trained specialist. Thus, an additional method is desirable to help in the diagnosis process and possibly improve the detection of early PD as well as the measurement of disease severity. Many studies have reported that the spiral analysis may be useful in the diagnosis of motor dysfunction in PD patient. We therefore implement a mobile, safe, easy to use, inexpensive, and online application for detection of movement disorders with a comprehensive test analysis according to the indices from Archimedean and octagon spirals tracing tasks. We introduce the octagon tracing task along with the conventional Archimedean spiral task because a shape tracing task with clear sequential components may increase a likelihood of detecting tremors and other cardinal features of PD. A widely used Android mobile operating system, the fastest markets share growth among smartphone platforms, is chosen as our development platform. We also show that the preliminary results of selected indices in the application could potentially be used to distinguish between PD patient and healthy control.TTASTA41 Android Suburban Railway One of the biggest challenges in the IEEE 2012 Ticketing with GPS as current ticketing facility is “QUEUE” in Ticket Checker buying our suburban railway tickets. In this fast growing world of technology we still stand in the queue or buy with oyster & octopus cards for our suburban tickets, which is more frustrating at times to stand in the queue or if we forget our cards. This paper Android Suburban Railway (ASR) ticketing is mainly to buy the suburban tickets which is the most challenging when compared to booking the long journey tickets through `M-ticket which fails with suburban(local travel) tickets. Our ASR ticket can be bought with just a smart phone application, where you can carry your suburban railway tickets in your smart phone as a QR (Quick Response)

×