myacademicproject logo

Dot Net

  • myacademicproject categorys

    Network Traffic Classification Using Correlation Information

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Traffic classification has wide applications in network management, from security monitoring to quality of service measurements. Recent research tends to apply machine learning techniques to flow statistical feature based classification methods. The nearest neighbor (NN)-based method has exhibited superior classification performance.

    Know More
  • myacademicproject categorys

    A Data Fusion Technique for Wireless Ranging Performance Improvement

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    The increasing diffusion of mobile and portable devices provided with wireless connectivity makes the problem of distance measurement based on radio-frequency technologies increasingly important for the development of next-generation nomadic applications. In this paper, the performance limitations of two classic wireless ranging techniques based on received signal strength

    Know More
  • myacademicproject categorys

    An Access Point-Based FEC Mechanism for Video Transmission Over Wireless LANs

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Forward Error Correction (FEC) is one of the most common means of performing packet error recovery in data transmissions. FEC schemes typically tune the FEC rate in accordance with feedback information provided by the receiver. However, the feedback and FEC rate calculation processes inevitably have a finite duration, and thus the FEC rate implemented at the sender may not accurately reflect the current state of the network.

    Know More
  • myacademicproject categorys

    EAACK—A Secure Intrusion-Detection System for MANETs

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    The migration to wireless network from wired network has been a global trend in the past few decades. The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks, Mobile Ad hoc NETwork (MANET) is one of the most important and unique applications.

    Know More
  • myacademicproject categorys

    A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Given the sensitivity of the potential WSN applications and because of resource limitations, key management emerges as a challenging issue for WSNs. One of the main concerns when designing a key management scheme is the network scalability. Indeed, the protocol should support a large number of nodes to enable a large scale deployment of the network.

    Know More
  • myacademicproject categorys

    Efficient Algorithms for Neighbor Discovery in Wireless Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of nodes, we propose a ALOHA-like neighbor discovery algorithm when nodes cannot detect collisions, and an order-optimal receiver feedback-based algorithm when nodes can detect collisions.

    Know More
  • myacademicproject categorys

    FairTorrent: A Deficit-based Distributed Algorithm to Ensure Fairness in Peer-to-Peer Systems

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Peer-to-peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload bandwidth while consuming much download bandwidth. Previous attempts to address this fair bandwidth allocation problem suffer from slow peer discovery, inaccurate predictions of neighboring peers’ bandwidth allocations, underutilization of bandwidth, and complex parameter tuning.

    Know More
  • myacademicproject categorys

    Measu-Routing: A Framework for Routing Assisted Traffic Monitoring

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Monitoring transit traffic at one or more points in a network is of interest to network operators for reasons of traffic 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 monitoring utility of the network operator for a given traffic routing.

    Know More
  • myacademicproject categorys

    Measuring Multipath Routing in the Internet IEEE

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Measuring Multipath Routing in the Internet is used to measure multipath routes under each type of load balancer and describes our measurement setup and characterization metrics.The load balancers found in our traces.

    Know More
  • myacademicproject categorys

    Design and implementation of TARF: a trust aware routing framework for wsns

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 13 Months ago

    The multi-hop routing in wireless sensor networks (WSNs) offers little protection against identity deception through 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.

    Know More
  • myacademicproject categorys

    An Authentication Code Against Pollution Attacks in Network Coding

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Systems exploiting network coding to increase their throughput suffer greatly from pollution attacks, which consist of injecting malicious packets in the network. The pollution attacks are amplified by the network coding process, resulting in a greater damage than under traditional routing

    Know More
  • myacademicproject categorys

    AMPLE: An adaptive traffic engineering system based on virtual routing topologies

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Handling traffic dynamics in order to avoid network congestion and subsequent service disruptions is one of the key tasks performed by contemporary network 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.

    Know More
  • myacademicproject categorys

    Providing end to end secure communications in wireless sensor networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Providing desirable data security, that is, confidentiality, authenticity, and availability, in wireless sensor networks (WSNs) is challenging, as a WSN usually consists of a large number of resource constraint sensor nodes that are generally deployed in unattended/hostile environments and, hence, are exposed to many types of severe insider attacks due to node compromise.

    Know More
  • myacademicproject categorys

    Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Routing in the Internet is based on the hop-by-hop shortest-path paradigm. Finding the shortest-path does not place a heavy processing burden on the routers and usually requires at most one entry per destination network in every router.

    Know More
  • myacademicproject categorys

    Jamming-Aware Traffic Allocation for Multiple- Path Routing Using Portfolio Selection

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this article, 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.

    Know More
  • myacademicproject categorys

    Sampling online social network

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    This Project, focus on improving the performance of information collection from the neighborhood of a user in a dynamic social network. By introducing sampling-based algorithms to efficiently explore a user’s social network respecting its structure and to quickly approximate quantities of interest.

    Know More
  • myacademicproject categorys

    Secure Mining of Association Rules in Horizontally Distributed Databases

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    We propose a protocol for secure mining of association rules in horizontally distributed databases. Our protocol, like theirs, is based on the Fast Distributed Mining (FDM) algorithm which is an unsecured distributed version of the Apriori algorithm.

    Know More
  • myacademicproject categorys

    SUSIE Search using services and information extraction

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    The API of a Web service restricts the types of queries that the service can answer. For example, a Web service might provide a method that returns the songs of a given singer, but it might not provide a method that returns the singers of a given song. If the user asks for the singer of some specific song, then the Web service cannot be called – even though the underlying database might have the desired piece of information.

    Know More
  • myacademicproject categorys

    Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns. Existing SQL aggregations have limitations to prepare data sets because they return one column per aggregated group. In general, a significant manual effort is required to build data sets, where a horizontal layout is required.

    Know More
  • myacademicproject categorys

    Scalable Learning of Collective behavior

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    This study of collective behavior is to understand how individuals behave in a social networking environment. Oceans of data generated by social media like Face book, Twitter, Flicker, and YouTube present opportunities and challenges to study collective behavior on a large scale.

    Know More
  • myacademicproject categorys

    Data leakage detection

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    We study the following problem: A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the data is leaked and found in an unauthorized place (e.g., on the web or somebody’s laptop).

    Know More
  • myacademicproject categorys

    Optimization of horizontal aggregation in SQL by using Kmeans Clustering

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    To analyze data efficiently, Data mining systems are widely using datasets with columns in horizontal tabular layout. Preparing a data set is more complex task in a data mining project, requires many SQL queries, joining tables and aggregating columns.

    Know More
  • myacademicproject categorys

    A Survey of Indexing Techniques for Scalable Record Linkage and De duplication

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Record linkage is the process of matching records from several databases that refer to the same entities. When applied on a single database, this process is known as deduplication. Increasingly, matched data are becoming important in many application areas, because they can contain information that is not available otherwise, or that is too costly to acquire. Removing duplicate records in a single database is a crucial step in the data cleaning process, because duplicates can severely influence the outcomes of any subsequent data processing or data mining.

    Know More
  • myacademicproject categorys

    Organizing user search histories

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    The advent of cloud computing, data owners are motivated to outsource their complex data management systems from local sites to commercial public cloud for great flexibility and economic savings. But for protecting data privacy, sensitive data has to be encrypted before outsourcing, which obsoletes traditional data utilization based on plaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramount importance.

    Know More
  • myacademicproject categorys

    One Size Does Not Fit All Towards User-and Query-Dependent Ranking For Web Databases

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    WITH THE EMERGENCE OF THE DEEP WEB, SEARCHING WEB DATABASES IN DOMAINS SUCH AS VEHICLES, REAL ESTATE, ETC. HAS BECOME A ROUTINE TASK. ONE OF THE PROBLEMS IN THIS CONTEXT IS RANKING THE RESULTS OF A USER QUERY. EARLIER APPROACHES FOR ADDRESSING THIS PROBLEM HAVE USED FREQUENCIES OF DATABASE VALUES, QUERY LOGS, AND USER PROFILES. A COMMON THREAD IN MOST OF THESE APPROACHES IS THAT RANKING IS DONE IN A USER- AND/OR QUERY-INDEPENDENT MANNER.

    Know More
  • myacademicproject categorys

    Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    WITH THE EMERGENCE OF THE DEEP WEB, SEARCHING WEB DATABASES IN DOMAINS SUCH AS VEHICLES, REAL ESTATE, ETC. HAS BECOME A ROUTINE TASK. ONE OF THE PROBLEMS IN THIS CONTEXT IS RANKING THE RESULTS OF A USER QUERY. EARLIER APPROACHES FOR ADDRESSING THIS PROBLEM HAVE USED FREQUENCIES OF DATABASE VALUES, QUERY LOGS, AND USER PROFILES. A COMMON THREAD IN MOST OF THESE APPROACHES IS THAT RANKING IS DONE IN A USER- AND/OR QUERY-INDEPENDENT MANNER. THIS PAPER PROPOSES A NOVEL QUERY- AND USER-DEPENDENT APPROACH FOR RANKING QUERY RESULTS IN WEB DATABASES. WE PRESENT A RANKING MODEL, BASED ON TWO COMPLEMENTARY NOTIONS OF USER AND QUERY SIMILARITY, TO DERIVE A RANKING FUNCTION FOR A GIVEN USER QUERY. THIS FUNCTION IS ACQUIRED FROM A SPARSE WORKLOAD COMPRISING OF SEVERAL SUCH RANKING FUNCTIONS DERIVED FOR VARIOUS USER-QUERY PAIRS. THE MODEL IS BASED ON THE INTUITION THAT SIMILAR USERS DISPLAY COMPARABLE RANKING PREFERENCES OVER THE RESULTS OF SIMILAR QUERIES. WE DEFINE THESE SIMILARITIES FORMALLY I

    Know More
  • myacademicproject categorys

    Trust Based Optimal Routing in MANETS

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    A MANET Mobile Ad Hoc Networks is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. Since the nodes are mobile, the network topology may change rapidly and unpredictably over time. The network is decentralized, where all network activity including discovering the topology and delivering messages must be executed by the nodes

    Know More
  • myacademicproject categorys

    Topology control in mobile ad-hoc networks with cooperative communications

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Cooperative communication has received tremendous interest for wireless networks. Most existing works on 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, and the proposed topology control scheme can substantially improve the network capacity in MANETs with cooperative communications.

    Know More
  • myacademicproject categorys

    Continuous Neighbor Discovery in Asynchronous Sensor Networks

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    In most sensor networks the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence, even after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process we call continuous neighbor discovery.

    Know More
  • myacademicproject categorys

    Scalable and Secure Sharing of Personal Health Records in Cloud Computing Using Attribute-Based Encryption

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 13 Months ago

    Personal health record (PHR) is an emerging patient-centric model of health information exchange, which is often outsourced to be stored at a third party, such as cloud providers. However, there have been wide privacy concerns as personal health information could be exposed to those third party servers and to unauthorized parties. To assure the patients’ control over access to their own PHRs, it is a promising method to encrypt the PHRs before outsourcing. Yet, issues such as risks of privacy exposure, scalability in key management, flexible access, and efficient user revocation, have remained the most important challenges toward achieving fine-grained, cryptographically enforced data access control. In this paper, we propose a novel patient-centric framework and a suite of mechanisms for data access

    Know More
  • myacademicproject categorys

    Data integrity and data dynamics with secure storage service in cloud

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    It is not an easy task to securely maintain all essential data where it has the need in many applications for clients in cloud. To maintain our data in cloud, it may not be fully trustworthy because client doesnt have copy of all stored data. But any authors don’t tell us data integrity through its user and CSP level by comparison before and after the data update in cloud

    Know More
  • myacademicproject categorys

    Privacy-Preserving Public Auditing for Secure Cloud Storage

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Using Cloud Storage, users can remotely store their data and enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources, without the burden of local data storage and maintenance. However, the fact that users no longer have physical possession of the outsourced data makes the data integrity protection in Cloud Computing a formidable task, especially for users with constrained computing resources.

    Know More
  • myacademicproject categorys

    An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    It is not an easy task to securely maintain all essential data where it has the need in many applications for clients in cloud. To maintain our data in cloud, it may not be fully trustworthy because client doesn’t have copy of all stored data. But any authors don’t tell us data integrity through its user and CSP level by comparison before and after the data update in cloud.

    Know More
  • myacademicproject categorys

    Mona Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 13 Months ago

    With the character of low maintenance, cloud computing provides an economical and efficient solution for sharing group resource among cloud users. Unfortunately, sharing data in a multi-owner manner while preserving data and identity privacy from an untrusted cloud is still a challenging issue, due to the frequent change of the membership. In this paper, we propose a secure multiowner data sharing scheme, named Mona, for dynamic groups in the cloud.

    Know More
  • myacademicproject categorys

    Load Rebalancing for Distributed File Systems in Clouds

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 13 Months ago

    Distributed file systems are key building blocks for cloud computing applications based on the MapReduce programming paradigm. In such file systems, nodes simultaneously serve computing and storage functions; a file is partitioned into a number of chunks allocated in distinct nodes so that MapReduce tasks can be performed in parallel over the nodes. However, in a cloud computing environment, failure is the norm, and nodes may be upgraded, replaced, and added in the system. Files can also be dynamically created, deleted, and appended.

    Know More
  • myacademicproject categorys

    Cloud data production for masses

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Offering strong data protection to cloud users while enabling rich applications is a challenging task. We explore a new cloud platform architecture called Data Protection as a Service, which dramatically reduces the per-application development effort required to offer data protection, while still allowing rapid development and maintenance. Cloud computing promises lower costs, rapid scaling, easier maintenance, and service availability anywhere, anytime, a key challenge is how to ensure and build confidence that the cloud can handle user data securely. A recent Microsoft survey found that “58 percent of the public and 86 percent of business leaders are excited about the possibilities of cloud computing. But more than 90 percent of them are worried about security , availability, and privacy of their data as it rests in the cloud.”

    Know More
  • myacademicproject categorys

    Efficient audit service outsourcing for data integrity in clouds

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Cloud-based outsourced storage relieves the client’s burden for storage management and maintenance by providing a comparably low-cost, scalable location-independent platform. However, the fact that clients no longer have physical possession of data indicates that they are facing a potentially formidable risk for missing or corrupted data. To avoid the security risks, audit services are critical to ensure the integrity and availability of outsourced data and to achieve digital forensics and credibility on cloud computing.

    Know More
  • myacademicproject categorys

    Towards Secure and Dependable Storage Services in Cloud Computing

    • B.TECH / M.TECH / M.SC / PH.D

    •  GANGADHAR.T

    • 12 Months ago

    Cloud storage enables users to remotely store their data and enjoy the on-demand high quality cloud applications without the burden of local hardware and software management. Though the benefits are clear, such a service is also relinquishing users’ physical possession of their outsourced data, which inevitably poses new security risks toward the correctness of the data in cloud. In order to address this new problem and further achieve a secure and dependable cloud storage service, we propose in this paper a flexible distributed storage integrity auditing mechanism, utilizing the homomorphic token and distributed erasure-coded data. The proposed design allows users to audit the cloud storage with very lightweight communication and computation cost.

    Know More