Successfully reported this slideshow.

Project titles abstract


Published on

Published in: Business, Technology
  • pls give modules answering frequent probalistic inference queries in database in
    Are you sure you want to  Yes  No
    Your message goes here
  • Be the first to like this

Project titles abstract

  1. 1. TTA FINAL YEAR PROJECTS TITLES WITH ABSTRACT IEEE 2011, 2010, 2009, 2008 , etc… Projects for B.E/B.Tech/M.E/Bsc/MscFor complete base paper, call now and talk to our expert89397 22135 | 89397 22145 | 044 4218 1385
  2. 2. TTA Final year projects by IT professionals JAVA - DOMAIN : MOBILE COMPUTINGCODE PROJECT TITLE DESCRIPTION REFERENCEYJM01 Reliability Improvement A new interference management scheme is Using Receive Mode proposed to improve the reliability of Selection in the Device- a device-to-device (D2D) to-Device Uplink Period communication in the uplink (UL) period wit IEEE 2011 Under laying Cellular hout reducing the power of cellular user Networks equipment (UE). To improve the reliability of the D2D receiver, two conventional receive techniques and one proposed method are introduced. OneYJM02 Map-Based Location and Technical enhancements IEEE 2011 Tracking in Multipath of mobile technologies are paving the way to Outdoor Mobile Networks the definition of high-quality and accurate geolocation solutions based on data collected and managed by GSM/3G networks. We present a technique that provides geolocation and mobility prediction both at network and service level, does not require any change to the existing mobile network infrastructure, and i s entirely performed on the mobile network sideYJM03 Distributed lgorithms for A widely applied strategy for workload IEEE 2011 Environment Partitioning sharing is to equalize the workload assigned in Mobile Robotic to each resource. In mobilemultiagent Networks systems, this principle directly leads to equitable partitioning policies whereby: 1) the environment is equitably divided into subregions of equal measure; 2) one agent is assigned to each subregion; and 3) each agent is responsible for service requests originating within its own subregion.YJM04 Photo Retrieval based on In this paper IEEE 2011 Spatial Layout with new photo retrieval system for mobile device Hardware Acceleration for s is proposed. The system can be used to Mobile Devices search for photos withsimilar spatial layouts efficiently, and it adopts an image segmentation algorithm that extracts features of image regions based on K-Means clustering. Since K-Means is computationally intensive for real-time applications and prone to generate clustering For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  3. 3. TTA Final year projects by IT professionals results with local optima, parallel hardware architectures are designed to meet the real-time requirement of the retrieval process.YJM05 Hop-by-hop Routing in Wireless Mesh Network (WMN) has become IEEE 2011 Wireless Mesh Networks an important edge network to provide with Bandwidth Internet access to remote areas Guarantees and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-of- service in WMNsYJM06 Cooperating with The use of smart antennas in multi- IEEE 2011 Smartness: Using hop wireless networks (MWNs) has garnered Heterogeneous Smart significant attention over the last few years. Antennas in Multi-hop While homogeneous MWNs with all nodes Wireless Networks having the same antenna capabilities will have certain applications, we argue that MWNs with nodes having heterogeneous antenna capabilities are more likely to be the norm due to a variety of motivating factors.YJM07 Local Greedy In recent years, there has been a significant IEEE 2011 Approximation for amount of work done in developing low- Scheduling in Multi-hop complexity schedulingschemes to achieve Wireless Networks high performance in multi- hop wireless networks. A centralized sub- optimal schedulingpolicy, called Greedy Maximal Scheduling (GMS) is a good candidate because its empirically observed performance is close to optimal in a variety of network settings.YJM08 Network Connectivity We investigate the communication IEEE 2011 with a Family of Group range of the nodes necessary Mobility Models for network connectivity, which we call bi- directional connectivity, in a simple setting. Unlike in most of existing studies, however, the locations ormobilities of the nodes may be correlated through group mobility: Nodes are broken into groups, with each groupcomprising the same number of nodes, and lie on a unit circle. The locations of the nodes in the same group are not mutually independent, but are instead conditionally independent given the location of the group. We examine the distribution of the smallest communication For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  4. 4. TTA Final year projects by IT professionalsYJM09 Towards Reliable Data This paper addresses the problem of IEEE 2011 Delivery for Highly delivering data packets for highly dynamic m Dynamic Mobile Ad Hoc obile ad hoc networks in areliable and timely Networks manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially forlarge-scale networks. Driven by this issue, we propose an efficient Position based Opportunistic Routing protocol (POR) which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium.YJM10 Local Broadcast There are two main approaches, static and IEEE 2011 Algorithms in Wireless Ad dynamic, in broadcast algorithms in wireless Hoc Networks: Reducing ad hoc networks. In thestatic the Number of approach, local algorithms determine the sta Transmissions tus (forwarding/non-forwarding) of each node proactively based on local topology information and a globally known priority function. In this paper, we first show that localbroadcast algorithms based on the static approach cannot achieve a good approximation factor to the optimum solution (an NP-hard problem).YJM11 A Privacy-Preserving Monitoring personal locations with a potentia IEEE 2011 Location Monitoring lly untrusted server poses privacy threats to System for Wireless the monitored individuals. To this end, we Sensor Networks propose a privacy- preserving location monitoring system for wi reless sensornetworks. In our system, we design two in- network location anonymization algorithms, namely, resource and quality-aware algorithms, that aim to enable the system to provide high- quality location monitoring services forsyste m users, while preserving personal location privacyYJM12 Optimal Stochastic We consider IEEE 2011 Location Updates in the location service in a mobile ad- Mobile Ad Hoc Networks hoc network (MANET), where each node needs to maintain itslocation information by 1) frequently updating its location information within its neighboring region, which is called neighborhood update (NU), and 2) occasionally updating its location information to certain distributedlocation server in the network, which is called location server update (LSU). For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  5. 5. TTA Final year projects by IT professionalsYJM13 Supporting Efficient and Group communications are important IEEE 2011 Scalable Multicasting over in Mobile Ad hoc Networks (MANETs). Mobile Ad Hoc Networks Multicast is an efficient method for implementing group communications. However, it is challenging to implement efficient and scalable multicast in MANET due to the difficulty in group membership management and multicast packet forwarding over a dynamic topology. We propose a novel Efficient Geographic Multicast Protocol (EGMP). JAVA - DOMAIN : KNOWLEDGE AND DATA ENGINEERINGCODE PROJECT TITLE DESCRIPTION REFERENCEYJK01 Motion Segmentation Group communications are important IEEE 2011 using the Hadamard in Mobile Ad hoc Networks (MANETs). Product and Spectral Multicast is an efficient method for Clustering implementing group communications. However, it is challenging to implement efficient and scalable multicas t in MANET due to the difficulty in group membership management and multicast packet forwarding over a dynamic topologyYJK02 A Unified Probabilistic In this paper, we formalize the IEEE 2011 Framework for Name problem in a unified probabilisticframewo Disambiguation in Digital rk, which incorporates both attributes Library and relationships. Specifically, we define a disambiguationobjective function for the problem and propose a two-step parameter estimation algorithm. We also investigate adynamic approach for estimating the number of people K.YJK03 Improving Aggregate In this paper, we introduce and explore a IEEE 2011 Recommendation number of item ranking techniques that Diversity can generate recommendations that Using Ranking-Based have substantially Techniques higher aggregate diversity across all users while maintaining comparable levels of recommendation accuracy. Comprehensive empirical evaluation consistently shows the diversity gains of For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  6. 6. TTA Final year projects by IT professionals the proposed techniques using several real-world rating datasets and different rating prediction algorithms.YJK04 Publishing Search Logs – In this paper we analyze algorithms IEEE 2011 A Comparative Study of for publishing frequent keywords, queries Privacy Guarantees and clicks of a search log. We first show how methods that achieve variants of k- anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by epsilon- differential privacy unfortunately does not provide any utility for this problem. We then propose a novel algorithm ZEALOUS and show how to set its parameters to achieve (epsilon, delta)- probabilistic privacy.YJK05 Cluster Oriented This paper presents a IEEE 2011 Ensemble Classifier: novel cluster oriented ensemble classifier Impact of Multi-cluster . The proposed ensemble classifier is Characterization on based onoriginal concepts such Ensemble Classifier as learning of cluster boundaries by the Learning. base classifiers and mapping of clusterconfidences to class decision using a fusion classifier. The categorised data set is characterised into multipleclusters and fed to a number of distinctive base classifiers.YJK06 Visual Role Mining: A This paper offers a new role engineering IEEE 2011 Picture Is Worth a approach to Role-Based Access Control Thousand Roles (RBAC), referred to as visualrole mining. The key idea is to graphically represent user-permission assignments to enable quick analysis and elicitation of meaningful roles. First, we formally define the problem by introducing a metric for the quality of the visualization.YJK07 A Knowledge-Driven This paper introduces a knowledge- IEEE 2011 Approach to Activity driven approach to real-time, Recognition in Smart continuous activity recognition based on Homes multi-sensor data streams in smart homes. The approach goes beyond the traditional data-centric methods for activityrecognition in three ways. Firstly, it makes extensive use of domain knowledge in the lifecycle of activityrecognition. Secondly, it uses For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  7. 7. TTA Final year projects by IT professionals ontologies for explicit context and activity modeling and representation. Thirdly and finally, it exploits semantic reasoning and classification for activity inferencing, thus enabling both coarse-grained and fine- grained activity recognition.YJK08 Finding Top-k Answers in in this paper, we study how to integrate IEEE 2011 Keyword Search over multiple related tuple units to Relational Databases effectively answerkeyword queries. To Using Tuple Units achieve a high performance, we devise two novel indexes, single-keyword-based structure-aware index and keyword-pair- based structure-aware index, and incorporate structural relationships between different tuple units into the indexes. We use the indexes to efficiently identify the answers of integrated tupleunits.YJK09 Efficient Iceberg Query In this paper, we exploited the IEEE 2011 Evaluation using property of bitmap index and Compressed Bitmap Index developed a very effective bitmappruning strategy for processing iceberg queries. Our index-pruning based approach eliminates the need of scanning and processing the entire data set (table) and thus speeds up the iceberg query processing significantly. Experiments show that our approach is much more efficient than existing algorithms commonly used in row-oriented and column-oriented databasesYJK10 Improving Security and in this study, we propose a novel CP-ABE IEEE 2011 Efficiency in Attribute- scheme for a data sharing system by Based Data Sharing exploiting the characteristic of the system architecture. The proposed scheme features the following achievements: (1) the key escrow problem could be solved by escrow-free key issuing protocol, (2) fine-grained user revocation per each attribute could For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  8. 8. TTA Final year projects by IT professionals be done by proxy encryption which takes advantage of the selective attribute group key distribution on top of the ABE.YJK11 Clustering with Multi- In this paper, we introduce a IEEE 2011 Viewpoint based novel multi- Similarity Measure viewpoint based similarity measure and two related clustering methods. The major difference between a traditional dissimilarity/similarity measure and ours is that the former uses only a single viewpoint, which is the origin, while the latter utilizes many different viewpoints, which are objects assumed to not be in the same cluster with the two objects being measured. Using multiple viewpoints, more informative assessment of similarity could be achieved.YJK12 Manifold Adaptive In this paper, we propose a novel active IEEE 2011 Experimental Design for learning algorithm which is performed in Text Categorization the data manifold adaptive kernel space. The manifold structure is incorporated into the kernel space by using graph Laplacian. This way, the manifold adaptive kernel space reflects the underlying geometry of the data.YJK13 Multi-resolution Web link In this paper, we generalize the IEEE 2011 analysis using generalised multiresolution popularity analysis to use link relations any form of Web page link relations. We provide results for both the PageRank relations and the In- degree relations. By utilizing the multiresolution popularity lists, we achieve a 13 percent and 25 percent improvement in mean average precision over In-degree and PageRank, respectively.YJK14 Distributed Processing of In this paper, we introduce the IEEE 2011 Probabilistic Top-k notion of sufficient set and necessary set Queries in Wireless for distributed processing ofprobabilistic t Sensor Networks op-k queries in cluster- based wireless sensor networks. These two concepts have very nice properties that can facilitate localized data pruning in clusters. Accordingly, we develop a suite of algorithms, namely, sufficient set-based (SSB), necessary For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  9. 9. TTA Final year projects by IT professionals set-based (NSB) and boundary-based (BB), for inter- cluster queryprocessing with bounded rounds of communications.YJK15 Cost-aware rank join with We address the problem of joining IEEE 2011 random and sorted access ranked results produced by two or more services on the Web. We consider services endowed with two kinds of access that are often available: i) sorted access, which returns tuplessorted by score; ii) random access, which returns tuples matching a given join attribute value. Rank joinoperators combine objects of multiple relations and output the K combinations with the highest aggregate score.YJK16 Joint Top-K Spatial Web users and content are increasingly IEEE 2011 Keyword Query being geo-positioned, and increased Processing focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study the efficient, joint processing of multiple top- kspatial keyword queries. Such joint processing is attractive during high query loads and also occurs when multiplequeries are used to obfuscate a users true query.YJK17 Adaptive Provisioning of IEEE 2011 Human Expertise in Service-oriented SystemsYJK18 Improving Aggregate In this paper, we introduce and explore a IEEE 2011 Recommendation number of item ranking techniques that Diversity Using Ranking- can generate recommendations that Based Techniques have substantially higher aggregate diversity across all users while maintaining comparable levels of recommendation accuracy. Comprehensive empirical evaluation consistently shows the diversity gains of the proposed techniques using several real-world rating datasets and different rating prediction algorithms.YJK19 Publishing Search Logs – In this paper we analyze algorithms IEEE 2011 A Comparative Study of for publishing frequent keywords, queries For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  10. 10. TTA Final year projects by IT professionals Privacy Guarantees and clicks of a search log. We first show how methods that achieve variants of k- anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by epsilon- differential privacy unfortunately does not provide any utility for this problem.YJK20 A Link-Analysis Extension This work IEEE 2011 of Correspondence introduces a link analysis procedure for d Analysis for Mining iscovering relationships Relational Databases in a relational database or a graph, generalizing both simple and multiple correspondence analysis. It is based on a random walk model through thedatabase defining a Markov chain having as many states as elements in the database. Suppose we are interested in analyzing the relationships between some elements (or records) contained in two different tables ofthe relational databaseYJK21 Adaptive Cluster Distance We consider approaches for similarity IEEE 2011 Bounding for High search in correlated, high- Dimensional Indexing dimensional data sets, which are derived within a clustering framework. We note that indexing by “vector approximation” (VA-File), which was proposed as a technique to combat the “Curse of Dimensionality,” employs scalar quantization, and hence necessarily ignores dependencies across dimensions, which represents a source of suboptimality.YJK22 Discovering Conditional In this paper, we present the BioNav IEEE 2011 Functional Dependencies system, a novel search interface that enables the user to navigate large number of query results by organizing them using the MeSH concept hierarchy. First, the query results are organized into a navigation tree. At each node expansion step, BioNav reveals only a small subset of the concept nodes, selected such that the expected user navigationcost is minimized.YJK23 Effective Navigation of In this paper, we propose a novel IEEE 2011 Query Results Based on algorithm, called Semisupervised Semi- Concept Hierarchies RiemannianMetric Map (S3RMM), following the geometric framework of semi Riemannian manifolds. S3RMM For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  11. 11. TTA Final year projects by IT professionals maximizes the discrepancy of the separability and similarity measures of scatters formulated by using semi- Riemannian metric tensors.YJK24 Learning Semi- In this paper, we propose a novel IEEE 2011 Riemannian Metrics for algorithm, called Semisupervised Semi- Semi supervised Feature RiemannianMetric Map (S3RMM), Extraction following the geometric framework of semi Riemannian manifolds. S3RMM maximizes the discrepancy of the separability and similarity measures of scatters formulated by using semi- Riemannian metric tensors. The metric tensor of each sample is learned via semisupervised regressionYJK25 Load Shedding in Mobile IEEE 2011 Systems with Mobi QualYJK26 Ranking Spatial Data by A spatial preference query ranks objects IEEE 2011 Quality Preferences based on the qualities of features in their spatial neighborhood. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial neighborhood. Such a neighborhood concept can be specified by the user via different functions DOMAIN : NETWORK SECURITYCODE PROJECT TITLE DESCRIPTION REFERENCEYJS01 Secret Key Agreement IEEE 2011 from Vector Gaussian We investigate Sources by Rate Limited the secret key agreement from correlate Public Communication d vector Gaussian sources in which legitimate parties can use public communication with limited ra te. For the class of protocols with one- way public communication, we show that For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  12. 12. TTA Final year projects by IT professionals the optimal trade-off between the rate of key generation and the rate of the publiccommunication is characterized as an optimization problem of a Gaussian random variable.YJS02 Detecting Recompression In this paper, we present a new IEEE 2011 of JPEG Images via technique to discover traces caused Periodicity Analysis of by recompression. We assume all Compression Artifacts for source images are in JPEG format and Tampering Detection propose to formulate the periodic characteristics of JPEG images both in spatial and transform domains. Using theoretical analysis, we design a robust detection approach which is able to detect either block-aligned or misaligned recompression.YJS03 Privacy-Preserving ECG The paper deals with all the IEEE 2011 Classification With requirements anddifficulties related to Branching Programs and working with data that must stay Neural Networks encrypted during all the computation steps, including the necessity of working with fixed point arithmetic with no truncation while guaranteeing the same performance of a floating point implementation in the plain domain.YJS04 Restoring Degraded Face The purpose of this paper is to illustrate IEEE 2011 Images: A Case Study in the complexity Matching Faxed, Printed, of face recognition in such realistic and Scanned Photos scenarios and to provide a viable solution to it. The contributions of this work are two-fold. First, a database of face images is assembled and used to illustrate the challenges associated with matching severely degraded face im ages. Second, a preprocessing scheme with low computational complexity is developed in order to eliminate the noise present in degraded images and restore their quality.YJS05 Keys Through ARQ: This paper develops a novel framework IEEE 2011 Theory and Practice for sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying information theoretic limits, under different assumptions on the channel spatial and temporal correlation function. Our analysis reveals a novel role of “dumb antennas” in overcoming For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  13. 13. TTA Final year projects by IT professionals the negative impact of spatial correlation on the achievable secrecy rates.YJS06 Digital Image It is often desirable to determine if IEEE 2011 Authentication From JPEG an image has been modified in any Headers way from its original recording. The JPEGformat affords engineers many implementation trade-offs which give rise to widely varying JPEG headers. We exploit these variations for image authentication.YJS07 A Message-Passing We propose a new paradigm for blind IEEE 2011 Approach to Combating watermark decoding in the presence Desynchronization Attacks of desynchronization attacks. Employing Forney-style factor graphs to model the watermarking system, we cast the blind watermark decoding problem as a probabilistic inference problem on a graph, and solve it via message- passing.YJS08 Nonlinearity Estimation We present a radio frequency (RF) front- IEEE 2011 for Specific Emitter end nonlinearity estimator that is based Identification in Multipath on the knowledge of a training sequence Channels to perform specific emitter identification (SE I), which discerns radio emitters of interest. Design and fabrication variations provide unique signal signatures for each emitter, and we extract those characteristics through the estimation of transmitter nonlinearity coefficients.YJS09 Physical-Layer Secret Key In thissystem, Alice and Bob IEEE 2011 Agreement in Two-Way share secret keys generated from Wireless Relaying measured radio propagation Systems characteristics with the help of the relay in the presence of an eavesdropper. We present four secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF) scheme, a multiple-access amplify-and-forward (MA-AF) scheme, and an amplify-and-forward with artificial noise (AF with AN) schemeYJS10 Secure Type-Based We consider data confidentiality in a IEEE 2011 Multiple Access distributed detection scenario with a type-based multiple-access (TBMA) protocol where a large set of sensors sends local measurements to an ally For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  14. 14. TTA Final year projects by IT professionals fusion center (FC) over an insecure wireless medium called the main channel.YJS11 Key Agreement Over In this paper, a IEEE 2011 Multiple Access Channel generalized multiple access channel (MA C) model for secret key sharing between three terminals is considered. In this model, there are two transmitters and a receiver where all three terminals receive noisychannel outputs.YJS12 Strongly Secure We consider the problem IEEE 2011 Communications Over the of secure communications over the two- Two-Way Wiretap way wiretap channel under a strong Channel secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit boththe interference at the eavesdroppers terminal and cooperation between legitimate users.YJS13 Using a Knowledge-Based In this paper, a knowledge- IEEE 2011 Approach to Remove based (KB) approach, which Blocking Artifacts in Skin simultaneouslyremoves JPEG blocking art Images ifacts, and recovers skin features, is for Forensic Analysis proposed. Given a training set containing both original and compressed skin images, the relationship between original blocks and compressed blocks can be established. This prior information is used to infer the original blocks of compressed evidence images.YJS14 Improved Differential Differential Fault Analysis (DFA) finds IEEE 2011 Fault Analysis the key of a block cipher on AES Key Schedule using differential information between correct and faulty ciphertexts obtained by inducing faults during the computation of ciphertexts. Among many ciphers Advanced Encryption Standard (AES) has been the main target of DFA due to its popularity.YJS15 Blind Forensics of Median This paper proposes a novel approach for IEEE 2011 Filtering detecting median filtering in digitalimage in Digital Images s, which can 1) accurately detect median filtering in arbitrary image s, even reliably detect median filteringin low-resolution and JPEG compressed images; 2) reliably detect tampering when part of a median- filtered imageis inserted into a non- median-filtered image, or vice versa. For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  15. 15. TTA Final year projects by IT professionalsYJS16 Improved Radiometric This paper experimentally IEEE 2011 Identification of demonstratesimproved identification acc Wireless Devices using uracy and reduced sensitivity MIMO Transmission to identification parameters when such techniques are applied to the multiple transmitters within multiple-input multiple-output devices. It further studies an information theoretic technique for determining which radiometric features are most effective in discriminating devices and analyzes the identification performance as a function of the number of features used.YJS17 Robust Image We propose a robust quantization- IEEE 2011 Watermarking Based on based image watermarking scheme, Multi scale Gradient called Direction Quantization the gradient direction watermarking(GD WM), based on the uniform quantization of the direction of gradient vectors. In GDWM, the watermark bits are embedded by quantizing the angles of significant gradient vectors at multiple wavelet scales. DOMAIN : NETWORKINGCODE PROJECT TITLE REFERENCEYJS01 Cluster-Based Back-Pressure the back-pressure algorithmrequires IEEE 2011 Routing Algorithm routers to maintain a separate queue for each destination, which precludes its implementation in large-scale networks. In this paper, we propose a distributed cluster-based back- pressure routing algorithm that retains the adaptability of back- pressure routing while significantly reducing the number of queues that have to be maintained at each node.YJS02 Impact of Correlated Mobility on We extend the analysis of the scaling IEEE 2011 Delay-Throughput laws of wireless ad hoc networks to the Performance in Mobile Ad-Hoc case of correlated nodes movements, Networks which are commonly found in real mobility processes. We For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  16. 16. TTA Final year projects by IT professionals consider a simple version of the Reference Point Group Mobility model, in which nodes belonging to the same group are constrained to lie in a disc area, whose center moves uniformly across the networkYJS03 On the Price of Security in In this paper, based on a general IEEE 2011 Large-Scale Wireless Ad Hoc random network model, theasymptotic Networks behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed.YJS04 Cross-Layer Designs in Coded A cross-layer design along with an IEEE 2011 Wireless Fading optimal resource allocation framework is Networks With Multicast formulated for wireless fadingnetworks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transport- layer rates, network code design variabl es, broadcast link flows, link capacities, average power consumption, and short- term power allocation policies.YJS05 Link-State Routing With Hop- This paper settles an open IEEE 2011 by-Hop Forwarding Can Achieve question with a positive Optimal Traffic Engineering answer: Optimal traffic engineering (or optimalmulticommodity flow) can be realized using just link- state routing protocols with hop-by- hop forwarding. Todays typical versions of these protocols, Open Shortest Path First (OSPF) and Intermediate System- Intermediate System (IS-IS), split traffic evenly over shortest paths based on link weights.YJS06 Stability and Benefits of Network utility maximization has been IEEE 2011 For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  17. 17. TTA Final year projects by IT professionals Suboptimal Utility Maximization widely used to model resource allocation and network architectures. However, in practice, often it cannot be solved optimally due to complexity reasons. Thus motivated, we address the following two questions in this paper: 1) Can suboptimal utility maximization mai ntain queue stability? 2) Can underoptimization of utility objective function in fact benefit other network design objectives?YJS07 A New Estimation Scheme for Many congestion control protocols have IEEE 2011 the Effective Number been recently proposed in order to of Users in Internet Congestion alleviate the problems encountered by Control TCP in high-speed networks and wireless links. Protocols utilizing an architecture that is in the same spirit asthe ABR service in ATM networks require estimates of the effective number of use rs utilizing each link in thenetwork to maintain stability in the presence of delays. In thi s paper, we propose a novel estimation algorithm that is based on online parameter identification techniques and is shown through analysis and simulations to converge to the effective number of users utilizing each linkYJS08 Multichannel Scheduling and In this paper, we utilize multiple IEEE 2011 Spanning Trees: Throughput– frequency channels and design an Delay Tradeoff for Fast efficient link scheduling protocol that DataCollection in Sensor gives a constant factor approximation Networks on the optimal throughput in delivering aggregated data from all the nodes to the sink. To minimize the maximum delay subject to a given throughput bound, we also design an $(alpha, beta)$-bicriteria approximation algorithm to construct a Bounded-Degree Minimum- Radius Spanning Tree, with the radius of thetree at most $beta$ times the minimum possible radius for a given degree bound $Delta^*$, and the For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  18. 18. TTA Final year projects by IT professionals degree of any node at most $Delta^* + alpha$ , where $alpha$ and $beta$ are positive constants.YJS09 DAC: Generic and Automatic In this paper, we present DAC, IEEE 2011 Address Configuration for Data a generic andautomatic Data center Add Center Networks ress Configuration system. With an automatically generated blueprint that defines the connections of servers and switches labeled by logical IDs, e.g., IP addresses, DAC first learns the physical topology labeled by device IDs, e.g., MAC addresses.YJS10 Distributed -Optimal User In this paper, we develop a framework IEEE 2011 Association and Cell Load for user association in infrastructure- Balancing in Wireless Networks based wireless networks, specifically focused on flow- level cell load balancing under spatially inhomogeneous traffic distributions. Our work encompasses several different user association policies: rate- optimal, throughput-optimal, delay- optimal, andload-equalizing, which we collectively denote $alpha$- optimal user association.YJS11 MeasuRouting: A Framework for Monitoring transit traffic at one or more IEEE 2011 Routing Assisted Traffic points in a network is of interest to Monitoring network operators for reasons oftraffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Previous research in the area has focused on deriving a placement of monitors across the network toward the end of maximizing the monitoringutility of the network operator for a given traffic routing. However, both traffic characteristics and measurement objectives can dynamically change over time, rendering a previously optimal placement of monitors suboptimal.YJS12 Automatic Generation of System level modeling is widely IEEE 2011 Assertions from System Level employed at early Design Using Data Mining stages of system development for For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  19. 19. TTA Final year projects by IT professionals simplifying designverification and architectural exploration. Assertion based verification has become a well established part of RTL verification methodology. In the traditional assertion based verification flow, assertions are manually written. In this paper, we generate assertions from system level d esigns using GoldMine, an automatic assertion generationengin e that uses data mining and static analysis.YJS13 Spatial Correlation and Mobility- In this paper, a IEEE 2011 Aware Traffic Modeling for novel trafficmodeling scheme for capturi Wireless Sensor Networks ng these dynamics is proposed that takes into account the statistical patterns of node mobility and spatial correlation. The contributions made in this paper are twofold. First, it is shown that the joint effects of mobility and spatial correlation can lead to bursty traffic. More specifically, high mobilityvariance and small spatial c orrelation can give rise to pseudo-long- range-dependent (LRD) traffic (high burstytraffic), whose autocorrelation function decays slowly and hyperbolically up to a certain cutoff time lag.YJS14 Jamming-Aware Traffic Multiple-path source routing protocols IEEE 2011 Allocation for Multiple-Path allow a data source node to distribute Routing Using Portfolio the total traffic among available paths. Selection In this paper, we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate thistraffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics.YJS15 A Unified Approach to In this work, we develop the IEEE 2011 Optimizing Performance in mathematical framework and novel Networks serving design methodologies needed to support For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  20. 20. TTA Final year projects by IT professionals Heterogeneous Flows such heterogeneous requirements and propose provably optimal network algorithms that account for the multilevel interactions between the flows. To that end, we first formulate a network optimization problem that incorporates the above throughput and service prioritization requirements of the two traffic types. We, then develop a distributed joint load-balancing and congestion control algorithm that achieves the dual goal of maximizing the aggregate utility gained by the elastic flows while satisfying the fixed throughput and prioritization requirements of the inelastic flowsYJS16 Delay Analysis and Optimality This paper focuses on IEEE 2011 of Scheduling Policies for designing and analyzing throughput- Multi-Hop Wireless Networks optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, exploit only local information, andpotentially improve the delay performance, for multi- hop wireless networks under general interference constraintsYJS17 Selfish Overlay Network In this paper, we unify the IEEE 2011 Creation and Maintenance aforementioned thrusts by defining and studying the selfish neighbor selection (SNS) game and its application to overlay routing. At the heart of SNS stands the restriction that peers are allowed up to a certain number of neighbors. This makes SNS substantially different from existingnetwork formation games that impose no bounds on peer degrees. Having bounded degrees has important practical consequences as it permits the creation of overlay structures that require $O(n)$ instead of $O(n^2)$link monitoring overhead. For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  21. 21. TTA Final year projects by IT professionals DOMAIN : PARALLEL DISTRIBUTIONCODE PROJECT TITLE REFERENCEYJP01 EBRP: Energy-Balanced n this paper, enlightened by the IEEE 2011 Routing Protocol for Data concept of potential in common Gathering in Wireless Sensor physics, we design an Energy- Networks Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field, including depth, energy density and residual energy to force packets to move towards the sink through the dense energy area so as to protect the nodes with relatively low residual energy. The design principle and guidelines are presented in detail.YJP02 Effective Delay-Controlled This paper proposes a IEEE 2011 Load Distribution over new load distribution model aiming to Multipath Networks minimize the difference among end-to- end delays, thereby reducing packet delay variation and risk of packet reordering without additional network overhead. In general, the lower the risk of packet reordering, the smaller the delay induced by the packet reordering recovery process, i.e., extra delay induced by the packet reordering recovery process is expected to decrease.YJP03 Tracking Dynamic Boundaries We examine the problem IEEE 2011 using Sensor Network of tracking dynamic boundaries occurri ng in natural phenomena using a network of range sensors. Two main challenges of the boundary tracking problem are accurate boundary estimation from noisy observations and continuous tracking of the boundary. We propose Dynamic Boundary Tracking ( DBTR), an algorithm that combines the spatial estimation and temporal For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  22. 22. TTA Final year projects by IT professionals estimation techniques.YJP04 CACAO: Distributed Client- In CACAO, the clients feed back traffic IEEE 2011 Assisted Channel Assignment information to their APs. This leads to Optimizationfor better network condition knowledge Uncoordinated WLANs and betterchannel assignment decisions at the APs. We conduct extensive simulation study and comparisons using Network Simulator 2 (NS2). Our results show that CACAO outperforms other traditional and recent schemes in terms of TCP and UDP throughputs with a similar level of fairness.YJP05 Athanasia: A User- This article presents Athanasia, a user- IEEE 2011 Transparent and Fault- transparent and fault- Tolerant System tolerant system, for parallel application for Parallel Applications s running on large-scale cluster systems. Cluster systems have been regarded as a de facto standard to achieve multitera-flop computing power. These cluster systems, as we know, have an inherent failure factor that can cause computation failure. The reliability issue in parallel computing systems, therefore, has been studied for arelatively long time in the literature, and we have seen many theoretical promises arise from the extensive research.YJP06 BECAN: A Bandwidth-Efficient Inthis paper, we IEEE 2011 Cooperative Authentication propose a novel bandwidth- Scheme for Filtering Injected efficient cooperative authentication (BE False Data in Wireless Sensor CAN) scheme for filteringinjected false Networks data. Based on the random graph characteristics of sensor node deployment and the cooperativebit- compressed authentication technique, the proposed BECAN scheme can save energy by early detecting andfiltering the majority of injected false data with minor extra overheads at the en-route nodes. For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  23. 23. TTA Final year projects by IT professionalsYJP07 Delay Constrained Subtree Virtual world and other IEEE 2011 Homeomorphism Problem collaborative applications are with Applications increasingly becoming popular among Internet users. In such applications, users interact with each other through digital entities or avatars. In order to preserve the user experience, it is important that certain Quality of Service (QoS) requirements (e.g. delay, bandwidth) are satisfied by the interactions. These QoS requirements are usually defined by the application designer. Whenapplications with such QoS requirements are being deployed on a network of servers, an appropriate set of servers capable of satisfying the QoS constraints of the interactions must be identified.YJP08 Efficient communication In this article we show IEEE 2011 algorithms in hexagonal the hexagonal mesh networks develope mesh interconnection d in the early 1990s are a special case networks of the EJnetworks that have been considered more recently. Using a node addressing scheme based on the EJ number system, we give a shortest path routing algorithm for hexagonal mesh n etworks.YJP09 An Efficient Prediction-based This paper proposes predict and relay IEEE 2011 Routing in Disruption- (PER), an efficient routing algorithm for Tolerant Networks DTNs, where nodes determine the probability distribution of future contact times and choose a proper next- hop in order to improve the end-to-end delivery probability. The algorithm is based on two observations: one is that nodes usually move around a set of well-visited landmark points instead of moving randomly; the other is that node mobility behavior is semi- deterministic and could be predicted once there is sufficient mobility history information.YJP10 Bounding the Impact of Self-stabilization is a versatile approach IEEE 2011 For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  24. 24. TTA Final year projects by IT professionals Unbounded Attacks to fault-tolerance since it permits a in Stabilization distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. Combining these two properties proved difficult: it is impossible to contain the spatial impact of Byzantine nodes in a self-stabilizing context for global tasks such as tree orientation and tree construction.YJP11 Stability Analysis of In this paper, we propose a policy that IEEE 2011 Reservation-Based allows links to transmit data in any Scheduling Policies in future frame by means of frame Wireless Networks reservations. The new, reservation- based distributed scheduling approach will improve the capacity of the system and provide greater throughput.YJP12 Fast Secure Communications This paper proposes three IEEE 2011 in Shared Memory authentication schemes to remove Multiprocessor Systems those security vulnerabilities. First, we prevent replay attacks on data messages by inserting Request Counter (RC) into request messages. Second, we also use RC to detect integrity attacks on control messages. Third, we propose a new counter, referred to as GCC Counter (GC), to protect the global counter messages. We simulated our design with SPLASH-2 benchmarks on up to 16- processor sharedmemory multiprocess or systems by using Simics with Wisconsin multifacet General Execution- drivenMultiprocessor Simulator (GEMS). For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  25. 25. TTA Final year projects by IT professionals DOMAIN : IMAGE PROCESSINGCODE PROJECT TITLE DESCRIPTION REFERENCEYJI01 A Generalized Accelerated This paper IEEE 2011 Proximal Gradient Approach proposes a generalized accelerated for Total Variation-Based proximal gradient (GAPG) approach Image Restoration for solving total variation(TV)- based image restoration problems. The GAPG algorithm generalizes the original APG algorithm by replacing the Lipschitz constant with an appropriate positive-definite matrix, resulting in faster convergence. For TV- basedimage restoration problems, we further introduce two auxiliary variables that approximate the partial derivatives. Constraints on the variables can easily be imposed without modifying the algorithm much, and the TV regularization can be either isotropic or anisotropic.YJI02 Residues Cluster Based In this paper, IEEE 2011 Segmentation and Outlier- the phase unwrappingproblem is Detection Method for Large- abstracted as solving a large- Scale Phase Unwrapping scale system of inconsistent linear equations. With the difficulties oflarge- scale phase unwrapping analyzed, L 0 -norm criterion is found to have potentials in efficient image tiling andsplicing. Making use of the clustering characteristic of residue distribution, a tiling strategy is proposed for L0-norm criterion. Unfortunately, L0-norm is an NP-hard problem, which is very difficult to find an exact solution in a polynomial time.YJI03 An a priori shading correction Digital imaging devices are increasingly IEEE 2011 technique for contact imaging used for color measurements in fields devices such as forensics, the food industry, and ecological and medical research. Especially concerning the skin, in the follow-up of benign or malignant For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  26. 26. TTA Final year projects by IT professionals lesions, it is crucial to ensure that the measured colors are accurate and reproducible. Several color calibration methods having been presented over the last few yearsYJI04 Spread Spectrum Image Efficient image watermark calls for IEEE 2011 Watermarking Based on full exploitation of Perceptual Quality Metric the perceptual distortion constraint. Second-order statistics of visual stimuli are regarded as critical features for perception. This paper proposes a second-order statistics (SOS) based image quality metric, which considers the texture masking effect and the contrast sensitivity in Karhunen-Loève transform domain.YJI05 Memory-Efficient Architecture Hysteresis thresholding is a method IEEE 2011 for Hysteresis Thresholding that offers and Object Feature Extraction enhanced object detection. Due to its recursive nature, it is time consuming and requires a lot of memory resources. This makes it avoided in streaming processors with limitedmemory. We propose two versions of a memory- efficient and fast architecture for hy steresis thresholding: a high- accuracy pixel- based architecture and a faster block-based one at the expense of some loss in the accuracy.YJI06 Generalized Random Walks In this paper, we propose a novel IEEE 2011 for Fusion of Multi-Exposure probabilistic model- Images based fusion technique for multi- exposure images. Unlike previousmulti- exposure fusion methods, our method aims to achieve an optimal balance between two quality measures, i.e., local contrast and color consistency, while combining the scene details revealed under different exposures.YJI07 Edge Strength Filter Based We propose an orientation- IEEE 2011 Color Filter Array free edge strength lter and apply it For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web:
  27. 27. TTA Final year projects by IT professionals Interpolation to the demosaicing problem. Edge strength lter output is utilized both to improve the initial green channel interpolation and to apply the constant color dierence rule adaptively. This simple edge directed method yields visually pleasing results with high CPSNR.YJI08 Towards a Unified Color mage processing methods that IEEE 2011 Space for Perception-Based utilize characteristics of the human Image Processing visual system require color spaces with certain properties to operate effectively. After analyzing different types of perception- based image processingproblems, we present a list of properties a unified color space sho uld have. Due to contradictory perceptual phenomena and geometric issues a color space cannot incorporate all these properties.YJI09 Model-guided Adaptive In compressive sensing (CS) a IEEE 2011 Recovery of Compressive challenge is to find a space in which Sensing the signal is sparse and hence recoverable faithfully. Since many natural signals such as images have locally varying statistics, the sparse space varies in time/spatial domain. As such, CS recovery should be conducted in locally adaptive, signal-dependent spaces to counter the fact that the CS measurements are global and irrespective of signal structuresDOMAIN : MOBILE COMPUTINGCODE PROJECT TITLE REFERENCEYDM01 Providing Secure Integrity in IEEE Peer-to-peer Oriented Mobile EnvironmentsYDM02 RAM: Rate Adaptation in IIEEE Mobile Environments For base paper and detailed discussion, call 89397 22135 | 89397 22145 | 044 4218 1385 Web: