ieee Project Titles & abstracts

A COUPLED STATISTICAL MODEL FOR FACE SHAPE RECOVERY FROM BRIGHTNESS IMAGES VB.NET|C#

ABSTRACT

We focus on the problem of developing a coupled statistical model that can be used to recover facial shape from brightness images of faces. We study three alternative representations for facial shape. These are the surface height function, the surface gradient and a Fourier basis representation. We jointly capture variations in intensity and the surface shape representations using a coupled statistical model. The model is constructed by performing principal components analysis (PCA) on sets of parameters describing the contents of the intensity images and the facial shape representations. By fitting the coupled model to intensity data, facial shape is implicitly recovered from the shape parameters. Experiments show that the coupled model is able to generate accurate shape from out-of-training-sample intensity images.

INDEX TERMS

Shape-from-shading, statistical models, face analysis.

A FIREWALL FOR ROUTERS: PROTECTING AGAINST ROUTING MISBEHAVIOR JAVA

ABSTRACT

This work explore the novel idea of route normalization  by correcting on the fly routing traffic on behalf of a  local router to protect the local network from malicious and misconfigured routing updates. Analogous to traffic normalization for network intrusion detection systems, the proposed RouteNormalizer patches ambiguities and eliminates semantically incorrect routing updates to protect against routing protocol attacks. Furthermore, it serves the purpose of a router firewall by identifying resource-based attacks against routers. Upon detecting anomalous routing changes, it suggests local routing policy modifications to improve route selection decisions. Deploying a RouteNormalizer requires no modification to routers if desired using a transparent TCP proxy setup. This paper gives the detailed design of the RouteNormalizer and evaluates it using a prototype implementation based on empirical BGP routing updates.

A New Human Interactive Proofs System for Deaf Persons JAVA | JSP

ABSTRACT

Nowadays the Internet users are from different ages and groups. Disabled people are a group of the Internet users. Some websites are especially created for disabled people and public access to them is undesirable. In this paper, for the first time, a method is introduced for distinguishing between deaf persons and other users using a new HIP (Human Interactive Proofs) system. In this method, the sign language is used. A word is shown as a movie using a sign language. The user should recognize the word and select it from a list. Only deaf persons can understand sign language and recognize the word, therefore other persons and also computer programs cannot enter the website. This project has been implemented by JSP.

AN IMAGE COMPRESSION METHOD OF FRACTAL BASED ON GSOFM NETWORK – JAVA

ABSTRACT

We proposed a method which incorporated multi-scale analysis into neural nets to solve the problem that fractal coding allows fast decoding but suffers from long encoding times. Furthermore this paper also incorporates gray relational pattern analysis into the self-organizing feature maps (SOFM) network to develop a GSOFM network. The self-organizing feature maps network incorporated by gray relational pattern analysis is more effective and feasible than general method.

APOGEE AUTOMATED PROJECT GRADING AND INSTANT FEEDBACK SYSTEM FOR WEB BASED COMPUTING ASP.NET C#

ABSTRACT

Providing consistent, instant, and detailed feedback to students has been a great challenge in teaching Web based computing. We present the prototype of an automated grading system called ProtoAPOGEE for enriching students’ learning experience and elevating faculty productivity. Unlike other automated graders used in introductory programming classes, Proto APOGEE emphasizes the examination of quality attributes of student project submissions, in addition to the basic functionality requirements. The tool is able to generate step by step play-back guidance for failed test cases, hence providing informative feedback to help students make reflective and iterative improvements in learning.

KEYWORDS:

Automated grading, test case generation, web application

GREEDY-BOUNDED COMPASS FORWARDING USING BOUNDARY MAPPING AND BOUNDARY STATE ROUTING (BSR) IN AD HOC NETWORKS JAVA

ABSTRACT

This paper presents a geographic routing protocol, Boundary State Routing (BSR), which consists of two components. The first is an improved forwarding strategy, Greedy-Bounded Compass, which can forward packets around concave boundaries, where the packet moves away from the destination without looping. The second component is a Boundary Mapping Protocol (BMP), which is used to maintain link state information for boundaries containing concave vertices. The proposed forwarding strategy Greedy- Bounded Compass is shown to produce a higher rate of path completion than Greedy forwarding and significantly improves the performance of Greedy Perimeter State Routing (GPSR) in sparse networks when used in place of Greedy forwarding. The proposed geographic routing protocol BSR is shown to produce significant improvements in performance in comparison to GPSR in sparse networks due to informed decisions regarding the direction of boundary traversal at local minima.

COMPARTMENTED SECURITY FOR BROWSERS TO THWART A PHISHER WITH TRUSTED COMPUTING JAVA|JSP

ABSTRACT

Identity theft through phishing attacks has become a major concern for Internet users. Typically, phishing attacks aim at luring the user to a faked web site to disclose personal information. Existing solutions proposed against this kind of attack can, however, hardly counter the new generation of sophisticated malware phishing attacks, e.g., pharming Trojans, designed to target certain services. This paper aims at making the first steps towards the design and implementation of a security architecture that prevents both classical and malware phishing attacks. Our approach is based on the ideas of compartmentalization for isolating applications of different trust level, and a trusted wallet for storing credentials and authenticating sensitive services. Once the wallet has been setup in an initial step, our solution requires no special care from users for identifying the right web sites while the disclosure of credentials is strictly controlled. Moreover, a prototype of the basic platform exists and we briefly describe its implementation.

CONTROL-BASED ADAPTIVE MIDDLEWARE FOR REAL-TIME IMAGE TRANSMISSION OVER BANDWIDTH-CONSTRAINED NETWORKS JAVA

ABSTRACT

Real-time image transmission is crucial to an emerging class of distributed embedded systems operating in open network environments. Examples include security systems based on wireless camera networks, and online collaboration using camera phones. Meeting image transmission deadlines is a key challenge in such systems due to unpredictable network conditions. In this paper, we present CAMRIT, a Control-based Adaptive Middleware framework for Real-time Image Transmission in distributed real-time embedded systems. Existing ORB middleware standards not adequately address the challenges. To overcome this, we have developed a Control-based Adaptive Middleware (CAM) Framework for real-time image transmission. CAMRIT features a distributed feedback control loop that meets image transmission deadlines by dynamically adjusting the quality of image tiles. Experimental results demonstrate that CAMRIT can provide robust real-time guarantees for a representative application scenario.

IP SPOOFING THROUGH INTER DOMAIN PACKET FILTERS PACKET FILTERING

JAVA & NET

ABSTRACT

The Distributed Denial of Services (DDoS) attack is a serious threat to the legitimate use of the Internet. Prevention mechanisms are thwarted by the ability of attackers to forge, or spoof, the source addresses in IP packets. By employing IP spoofing, attackers can evade detection and put a substantial burden on the destination network for policing attack packets. In this paper, we propose an inter-domain packet filter (IDPF) architecture that can mitigate the level of IP spoofing on the Internet. A key feature of our scheme is that it does not require global routing information. IDPFs are constructed from the information implicit in BGP route updates and are deployed in network border routers. We establish the conditions under which the IDPF framework works correctly in that it does not discard packets with valid source addresses. Based on extensive simulation studies, we show that even with partial deployment on the Internet, IDPFs can proactively limit the spoofing capability of attackers. In addition, they can help localize the origin of an attack packet to a small number of candidate networks.

DESIGN AND IMPLEMENTATION WITH CART FOR B2B USING MOBILE JAVA

ABSTRACT

A Mobile Payment Service is designed for use on a handheld device such as a PDA or mobile phone. Mobile Payment Service are optimized so as to display shopping application most effectively for small screens on portable devices and have small file sizes to accommodate the low memory capacity the low-bandwidth of wireless handheld devices. Java technology is used, brings additional benefits that provides enhanced user experience, reduced airtime requirement, and provides rich animated graphics etc.

DIGITAL IMAGE PROCESSING TECHNIQUES FOR THE DETECTION AND REMOVAL OF CRACKS IN DIGITIZED PAINTINGS VB.NET C#

ABSTRACT

An integrated methodology for the detection and removal of cracks on digitized paintings is presented in this paper. The cracks are detected by thresholding the output of the morphological top-hat transform. Afterwards, the thin dark brush strokes which have been misidentified as cracks are removed using either a Median Radial Basis Function (MRBF) neural network on hue and saturation data or a semi-automatic procedure based on region growing. Finally, crack filling using order statistics filters or controlled anisotropic diffusion is performed. The methodology has been shown to perform very well on digitized paintings suffering from cracks

DISTRIBUTED CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL

JAVA

ABSTRACT

The goal of our project is to proactively disseminating the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is key to the adaptation of on-demand routing protocols to mobility.

DOCKET CHUNK SYSTEM VC#.NET

ABSTRACT

The objective of this application will manage a file sharing site.  The Company can create a employee’s database, each one with his assigned folder.   Within this folder, the employee can upload its files or download the one already in the folder already uploaded by the company itself.  When the company uploads a file in a employee’s folder, the employee will receive an email alerting him of the new file and with a link to download it without logging in the File Sharing System.  The employee can also log into the system any time and lock for previously uploaded files.Ever user normally thinks about how to store information on files for future usage. Sometimes he used to share his data to another person’s also that is called public data which can be shared with others.  But some data may be protective means private only for limited persons or single usage.  That’s why the company creates a database for employees to store their data in the form of files. This system can given permissions to the users to create a new file throw this application.  Then user can able to upload his own information in to that particular file.  Now he need to put folder sharing options whether the folder information public or private.In the form of administration admin can upload information from his side.  Then admin will send the Notifications or emails to users for his newly uploaded information.   If the user wants that information then he had a facility to download the information and save into his personnel folder for further usage.   The admin information is completely public for all users.  The details of Uploading and downloading information are displayed to each and every user separately.  The maximum number of space a user can be used is 2 GB only.  Whenever user upload or down load the application can calculate the size of the file and adjust the maximum space of a user using.

DISTRIBUTED CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL

JAVA

ABSTRACT

On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately estimate timeouts because topology changes are unpredictable. In this paper, we propose proactively disseminating the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters,

thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-Max Life, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is key to the adaptation of on-demand routing protocols to mobility.

E2M CONFERENCE ASP.NET C#

ABSTRACT

E2M Conference plays a typical role and acts like a link between Units of an Organization usually a corporate company. The main objective of “E2M Conference” is to introduce computerized system in a widely spread organization which can be used as a resource for private network, in order to fulfill the basic needs of an Organization like Information sharing, Communication, Document Viewing as well as sharing. This also helps to provide an easy and fast interface for the employees of an Organization to perform their tasks quickly and efficiently.By providing this entirely private network the information regarding the Organization can be fetched from any corner of the world in a highly secured manner.

EDGE DETECTION IN IMAGES WITH WAVELET TRANSFORM C++

ABSTRACT

The Faber-Schauder wavelet transform is a simple multiscale transformation with many interesting properties in image processing. Some of these properties are: preservation of pixel ranges, arithmetic operations, non requirement of boundary processing, multiscale edge detection, elimination of the constant and the linear correlation, and the use of close neighboring information. In this study we describe this transformation and we propose a mixed scale visualization of the wavelet transform which makes it possible to show the transform result as an image. This visualization is used, with orientation information, to refine edge detection and image characterization by selecting regions with a high density of extrema wavelet coefficients.

FABER-SCHAUDER WAVELET TRANSFORM, APPLICATION TO EDGE DETECTION AND IMAGE CHARACTERIZATION C++

ABSTRACT

The Faber-Schauder wavelet transform is a simple multiscale transformation with many interesting properties in image processing. Some of these properties are: preservation of pixel ranges, arithmetic operations, non requirement of boundary processing, multiscale edge detection, elimination of the constant and the linear correlation, and the use of close neighboring information. In this study we describe this transformation and we propose a mixed scale visualization of the wavelet transform which makes it possible to show the transform result as an image. This visualization is used, with orientation information, to refine edge detection and image characterization by selecting regions with a high density of extrema wavelet coefficients.

BLUR DETECTION FOR DIGITAL IMAGES USING WAVELET TRANSFORM C++

ABSTRACT

With the prevalence of digital cameras, the number of digital images increases quickly, which raises the demand for image quality assessment in terms of blur. Based on the edge type and sharpness analysis using Harr wavelet transform, a new blur detection scheme

is proposed in this paper, which can determine whether an image is blurred or not and to what extent an image is blurred. Experimental results demonstrate the effectiveness of the proposed scheme.

EFFICIENT APPROXIMATE QUERY PROCESSING IN PEER TO PEER NETWORKS VB.NET C#

ABSTRACT

Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, given the distributed and dynamic nature of P2P databases. In this paper, we present novel sampling-based techniques for approximate answering of ad hoc aggregation queries in such databases. Computing a high-quality random sample of the database efficiently in the P2P environment is complicated due to several factors: the data is distributed (usually in uneven quantities) across many peers, within each peer, the data is often highly correlated, and, moreover, even collecting a random sample of the peers is difficult to accomplish. To counter these problems, we have developed an adaptive two-phase sampling approach based on random walks of the P2P graph, as well as block-level sampling techniques. We present extensive experimental evaluations to demonstrate the feasibility of our proposed solution.

EFFICIENT DISTRIBUTED DATA MINING USING INTELLIGENT AGENTS VB .NET

ABSTRACT

Data preprocessing is one of the important task in Knowledge Discovery in Databases or Data Mining. The preprocessing is complex and tedious task especially involving large dataset. It is crucial for a data miner to be able to determine the appropriate data preprocessing techniques for a particular data set as it will save the processing time and retain the quality of the data for data mining. Current data mining researchers use agent as a tool to assist data mining process. However, very few researches focus on using agent in the data preprocessing. Applying agents with autonomous, flexible and intelligence reduced the cost of having a quality, precise and updated data or knowledge. The most important part of having an agent to perform data mining task particularly data preprocessing is the generation of agent’s knowledge. The data preprocessing agent’s knowledge are meant for agent to decide the appropriate data preprocessing technique to be used on a particular dataset. Therefore, in this paper we propose a methodology for creating the data preprocessing agent’s knowledge by using rough set theory. The experimental results showed that the agent’s knowledge generated is significant to be used for automated data preprocessing techniques selection.

RESEARCH OF A SECURE FILE SYSTEM FOR PROTECTION OF INTELLECTUAL PROPERTY RIGHT VB.NET VB

ABSTRACT

This paper analyses the architecture of current secure file system and the security needs for protection of intellectual property rights and especially the major problems of it. Then we propose a secure data container model based on data encapsulation from the realization concept of Virtual File System (VFS) in Linux. Based on this model, we design and implant a secure file system IPR-SFS on Windows platform for protection of intellectual property which achieves perfect combination between data encryption and access control. Compared with the previous systems, the IPR-SFS file system is more convenient and flexible, safe and scalable, also comparable to the existing file.

ENCRYPTION BASED DATA HIDING ARCHITECTURE WITH TEXT PATTERN AUTHENTICATION AND VERIFICATION VC++

ABSTRACT

Security of hidden data is a tradeoff between capacity, robustness and embedding against induced distortion. In this paper, authors have used the fourth parameter, authentication and verification. Authors have used 128-bit Advanced Encryption Standard (AES) for encryption and Least Significant Bit (LSB) algorithm to hide textual data behind Bitmap images. Selected images by user can be transformed into text pattern and then used for authentication and verification or as hidden message. The password protection mechanism is supported at both the stages of encryption and data hiding respectively to provide better security. Security is further enhanced by the presence of file destruction mechanism after 3 wrong password trials. The present paper claims the superiority of the designed model over existing one in terms of combined security provided by its robust authentication / verification system, encryption and data hiding. This paper demonstrates the security robustness through a comparison with existing software’s.

FLASH DATA DISSEMINATION IN UNSTRUCTURED PEER-TO-PEER NETWORKS VC++

ABSTRACT

The problem of flash data dissemination refers to spreading dynamically-created medium-sized data to all members of a large group of users. In this paper, we explore a solution to the problem of flash data dissemination in unstructured P2P networks and propose a gossip-based protocol, termed catalogue-gossip. Our protocol alleviates the shortcomings of prior gossip-based dissemination approaches through the introduction of an efficient catalogue exchange scheme that helps reduce unnecessary interactions among nodes in the unstructured network. We provide deterministic guarantees for the termination of the protocol and suggest optimizations concerning the order with which pieces of flash data are assembled at receiving peers. Experimental results show that catalogue-gossip is significantly more efficient than existing solutions when it comes to delivery of flash data.

AN ENCRYPTO- STEGO TECHNIQUE BASED SECURE DATA TRANSMISSION SYSTEM VC++

ABSTRACT

Digital communication has become an essential part of infrastructure nowadays, a lot of applications are Internet-based and in some cases it is desired that communication be made secret. Consequently, the security of information has become a fundamental issue. Two techniques are available to achieve this goal: Encryption and steganography is one of them. Using cryptography, the data is transformed into some other gibberish form and then the encrypted data is transmitted. In steganography, the data is embedded in an image file and the image file is transmitted. This paper proposed a system that combines the effect of these two methods to enhance the security of  the data. This proposed system encrypts the data with a crypto algorithm and then embeds the encrypted text in an image file. The embedding process is done with help of stego-key, and the detection or reading of embedded information is possible only having this key. The stego key (user-specified or default) is used not only to facilitate random selection of bytes for hiding message file bits but also is used to encrypt the message file. The encryption method is based on XORing the message bytes with random numbers generated by a pseudo-random number generator whose seed is derived from the stego key. Here we also calculate the message digest of image and embed into image file to check integrity of message contents.

FACE RECOGNITION USING NEURAL NETWORK SYSTEM VB.NET C#

ABSTRACT

This paper proposes a face recognition method using artificial immune network classifiers based on Principal Component Analysis (PCA). The PCA abstracts principal eigenvectors of the image in order to get best feature description, hence to reduce the number of inputs of immune networks. After this, these image data of reduced dimensions are input into an immune network to be trained. Subsequently the antibodies of the immune networks are optimized using genetic algorithms. The performance of the present method was evaluated using the AT&T Laboratories Cambridge database (formerly called ORL face database). The results show that this method gains higher recognition rate in contrast with some other methods.

USING THE CONCEPTUAL COHESION OF CLASSES FOR FAULT PREDICTION IN OBJECT-ORIENTED SYSTEMS VB.NET C#

ABSTRACT

High cohesion is a desirable property of software as it positively impacts understanding, reuse, and maintenance. Currently proposed measures for cohesion in Object-Oriented (OO) software reflect particular interpretations of cohesion and capture different aspects of it. Existing approaches are largely based on using the structural information from the source code, such as attribute references, in methods to measure cohesion. This paper proposes a new measure for the cohesion of classes in OO software systems based on the analysis of the unstructured information embedded in the source code, such as comments and identifiers. The measure, named the Conceptual Cohesion of Classes (C3), is inspired by the mechanisms used to measure textual coherence in cognitive psychology and computational linguistics. This paper presents the principles and the technology that stand behind the C3 measure. A large case study on three open source software systems is presented which compares the new measure with an extensive set of existing metrics and uses them to construct models that predict software faults. The case study shows that the novel measure captures different aspects of class cohesion compared to any of the existing cohesion measures. In addition, combining C3 with existing structural cohesion metrics proves to be a better predictor of faulty classes when compared to different combinations of structural cohesion metrics.

HIERARCHICAL REPLICATION TECHNIQUES TO ENSURE CHECKPOINT STORAGE RELIABILITY IN GRID ENVIRONMENT  JAVA

ABSTRACT

As High Performance platforms (Clusters, Grids, etc.) continue to grow in size, the average time between failures decreases to a critical level. An efficient and reliable fault tolerance protocol plays a key role in High Performance Computing. Rollback recovery is the most common fault tolerance technique used in High Performance Computing and especially in MPI applications. This technique relies on the reliability of the checkpoint storage. Most of the rollback recovery protocols assume that the checkpoint server machines are reliable. However, in a grid environment any unit can fail at any moment, including components used to connect different administrative domains. Such failures lead to the loss of a whole set of machines, including the more reliable machines used to store the checkpoints in this administrative domain. Thus it is not safe to rely on the high MTBF (Mean Time Between Failures) of specific machines to store the checkpoint images. This paper introduces a new coordinated checkpoint protocol, which tolerates checkpoint server failures and clusters failures, and ensures checkpoint storage reliability in a grid environment. To provide this reliability the protocol is based on a replication process. We propose new hierarchical replication strategies, with two different degrees of hierarchy, adapted to the topology of cluster of clusters. Our solution exploits the locality of checkpoint images in order to minimize inter-cluster communication. We evaluate the effectiveness of our two hierarchical replication strategies through simulations against several criteria such as topology and scalability.

KEY AGREEMENT IN PEER-TO-PEER WIRELESS NETWORKS JAVA

ABSTRACT

A set of simple techniques for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol, which is known to be vulnerable to the “man-in-the-middle” attack if the two users involved in the protocol do not share any authenticated information about each other (e.g., public keys, certificates, passwords, shared keys, etc.) prior to the protocol execution. We solve the problem by leveraging on the natural ability of users to authenticate each other by visual and verbal contact. We propose three techniques. The first is based on visual comparison of short strings, the second on distance bounding, and the third on integrity codes; In each case, the users do not need to enter any password or other data, nor do they need physical or infrared connectivity between their devices. We base our analysis on a well-established methodology that leads us to a rigorous modularization and a thorough robustness proof of our proposal.

A DISTRIBUTED LOAD BALANCING ALGORITHM FOR STRUCTURED P2P SYSTEMS VB.NET C#

ABSTRACT

In structured P2P system, DHT abstraction and the heterogeneity of node capacity could result in a load imbalance problem. Existing load balancing approaches have two limitations. First, they do not take the link latency into account when moving loads, thus loads may be transferred between two nodes with large link latency. Second, they heavily rely on some nodes of fixed logical locations in the system, which could overload these nodes and make them vulnerable. This paper presents a distributed load balancing algorithm. Each peer node periodically aggregates local loads information based on local neighborhood information, and a heuristic algorithm is used when transferring loads from heavy nodes to light nodes. Our algorithm not only utilizes the proximate relationships of nodes in the physical networks, but also manages to achieve a good tradeoff between the quality of load balance and the load movement cost. The results of our intensive simulation experiments show that our algorithm can not only achieve a good load balance, but also save the bandwidth by more than 23%.

HISTOGRAM-BASED GLOBAL LOAD BALANCING IN STRUCTURED PEER-TO-PEER SYSTEMS VB.NET C#

ABSTRACT

Over the past few years, peer-to-peer (P2P) systems have rapidly grown in popularity and have become a dominant means for sharing resources. In these systems, load balancing is a key challenge because nodes are often heterogeneous. While several load-balancing schemes have been proposed in the literature, these solutions are typically ad hoc, heuristic based, and localized. In this paper, we present a general framework, HiGLOB, for global load balancing in structured P2P systems. Each node in HiGLOB has two key components: 1) a histogram manager maintains a histogram that reflects a global view of the distribution of the load in the system, and 2) a load-balancing manager that redistributes the load whenever the node becomes overloaded or underloaded. We exploit the routing metadata to partition the P2P network into nonoverlapping regions corresponding to the histogram buckets. We propose mechanisms to keep the cost of constructing and maintaining the histograms low. We further show that our scheme can control and bound the amount of load imbalance across the system. Finally, we demonstrate the effectiveness of HiGLOB by instantiating it over three existing structured P2P systems: Skip Graph, BATON, and Chord. Our experimental results indicate that our approach works well in practice.

EFFECTIVE LOAD BALANCING IN P2P SYSTEMS VB.NET C#

ABSTRACT

In DHT based P2P systems, various issues such as peer heterogeneity, network topology, and diverse file popularity, may affect the DHT system efficiency. In this paper, we propose an effective load balancing algorithm for DHT-Based P2P systems. Our main contributions are: (1) we propose an fully distributed mechanism to maintain the history of file access information. This information is used to predict the future file access frequencies and support the load distribution and redistribution operations; (2) we design a novel load balancing algorithm, which takes the file access history and peer heterogeneity properties into account to determine the load distribution. Our algorithm can generate the best load distribution decision when a new peer comes, it can also be able to dynamically perform the load redistribution during system running time if overloaded peers appeared. In our algorithm, no virtual servers are used, thus we have less processing overhead on the expensive routing metadata maintenance; (3) finally, we design a topologically-aware data replication mechanism, the topological information of the peers are used for file replication decisions. A file is replicated only on a peer close to the group of peers which have high access frequencies.

MULTI ROUTER TRAFFIC GRAPHER (MRTG) FOR BODY AREA NETWORK (BAN) SURVEILLANCE C

ABSTRACT

Wireless sensors are capable of gathering real-time data not only from the environment, but also from the signals that the human body can generate. These tiny and smart tags may act as another layer of infrastructure between the physical world and the Internet. However, a complete system of software tools, gateway devices and reliable communication channels are needed to achieve this bridging. In our testbed we tested the limits of implementing a motes based system using commodity based hardware In this paper, the authors discuss a portable and remote health monitoring system using wireless sensors, based on a persistent monitoring of bio-signals from an unwell or elderly person, using the concept of Body Area Network (BAN). All the signals not only from the body but also from the environment, will be stored in a web server and displayed graphically using an existing tool for monitoring network traffic, namely MRTG (Multi Router Traffic Grapher). The aim is to allow secure remote access to certain health parameters in order to alert carers to abnormal body signs, and provide a complete data collection at doctor’s disposal. Consequently MRTG can facilitate the determination of how changes in the environment affect vital signs (e.g. correlation between weather and health). The researchers demonstrate that wireless sensors have a very high level of integration with existing tools related to network monitoring. This will enable a new and powerful method for joining physical and networks layers.

KEYWORDS:

Body area networks, health, wireless sensor network

ON THE PERFORMANCE BENEFITS OF MULTIHOMING ROUTE CONTROL VB.NET C#

ABSTRACT

Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks today can employ a variety of route control products to optimize their Internet access performance and reliability. However, little is known about the tangible benefits that such products can offer, the mechanisms they employ and their trade-offs. This paper makes two important contributions. First, we present a study of the potential improvements in Internet round-trip times (RTTs) and transfer speeds from employing multihoming route control. Our analysis shows that multihoming to three or more ISPs and cleverly scheduling traffic across the ISPs can improve Internet RTTs and throughputs by up to 25% and 20%, respectively. However, a careful selection of ISPs is important to realize the performance improvements. Second, focusing on large enterprises, we propose and evaluate a wide-range of route control mechanisms and evaluate their design trade-offs. We implement the proposed schemes on a Linux-based Web proxy and perform a trace-based evaluation of their performance. We show that both passive and active measurement-based techniques are equally effective and could improve the Web response times of enterprise networks by up to 25% on average, compared to using a single ISP. We also outline several “best common practices” for the design of route control products.

REDUCING NETWORK TRAFFIC OF TOKEN PROTOCOL USING SHARING RELATION CACHE – NETWORK TRAFFIC ANALYSIS CACHING HANDLER – DOT NET C#

ABSTRACT

Token protocol provides a new coherence framework for shared-memory multiprocessor systems. It avoids indirections of directory protocols for common cache-to-cache transfer misses, and achieves higher interconnect bandwidth and lower interconnect latency compared with snooping protocols. However, the broadcasting increases network traffic, limiting the scalability of token protocol. This paper describes an efficient technique to reduce the token protocol network traffic, called sharing relation cache. This cache provides destination set information for cache-to-cache miss requests by caching directory information for recent shared data. This paper introduces how to implement the technique in a token protocol. Simulations using SPLASH-2 benchmarks show that in a 16-core chip multiprocessor system, the cache reduced the network traffic by 15% on average.

Key words: token protocol; sharing relation cache; network traffic

A RESILIENT DISTRIBUTED PROTOCOL FOR NETWORK SYNCHRONIZATION VC++

ABSTRACT

We present a resilient distributed protocol that enables a synchronous algorithm to run on an asynchronous network. The protocol is resilient in the sense that it can continue providing network synchronization in the presence of topological changes in the underlying communication network of a distributed system. These changes are caused by link/node failures and recoveries that occur while running the protocol. In general, the protocol is a useful tool in the design of resilient distributed algorithms as it isolates the algorithm from the characteristics of the communication network.

NEW SOLUTION FOR PASSWORD KEY TRANSFERRING IN STEGANOGRAPHY METHODS  JAVA

ABSTRACT

One of the methods introduced for establishing hidden communication is steganography. One of the problems in these methods is the security of transferring password key used for steganography between sender and receiver of secure data. In this project a new method is proposed for solving this problem using CAPTCHA method. In this method the password key is drawing in the image and the data are hidden in the image by this password key. So the human receiver can recognize the password from the image and extract the data from the image using this password,  but a computer program cannot do above operation by this method the user does not need to memorize any password for extracting the data.

A NEW, EFFICIENT COORDINATED CHECK POINTING PROTOCOL COMBINED WITH SELECTIVE SENDER-BASED MESSAGE LOGGING JAVA

ABSTRACT:

Check pointing and message logging are the popular and general-purpose tools for providing fault tolerance in distributed systems. The most of the Coordinated check pointing algorithms available in the literature have not addressed about treatment of the lost messages and these algorithms suffer from high output commit latency. To overcome the above limitations, we propose a new coordinated check pointing protocol combined with selective sender-based message logging. The protocol is free from the problem of lost messages. The term ‘selective’ implies that messages are logged only within a specified interval known as active interval, thereby reducing message logging overhead. All processes take checkpoints at the end of their respective active intervals forming a consistent global state.

A PEER-TO-PEER MESSAGE EXCHANGE SCHEME FOR LARGE-SCALE NETWORKED VIRTUAL ENVIRONMENTS DOT NET

ABSTRACT

This paper presents a scalable peer-to-peer communication architecture suitable for supporting networked virtual environments that does not require costly dedicated servers or special infrastructure such as multicasting. Entities establish an overlay network based on the distance between the entities. As message exchange is handled directly by unicast between nearest-neighbor entities, the communication overhead is kept low. The proposed architecture is highly scalable and suitable for online applications such as massively multiplayer online role-playing games with hundreds of thousands of participants, where the dominant factor affecting scalability and performance is the overhead associated with exchange of update messages between users.

AN EFFICIENT SEARCH TO IMPROVE NEIGHBOUR SELECTION MECHANISM IN P2P NETWORK DOT NET C#

ABSTRACT

One of the key challenging aspects of peer-to-peer systems has been efficient search for objects. For this, we need to minimize the number of nodes that have to be searched, by using minimum number of messages during the search process. This can be done by selectively sending requests to nodes having higher probability of a hit for queried object. In this paper, we present an enhanced selective walk searching algorithm along with low cost replication schemes. Our algorithm is based on the fact that most users in peer-to-peer network share various types of data in different proportions. This knowledge of amount of different kinds of data shared by each node is used to selectively forward the query to a node having higher hit-ratio for the data of requested type, based on history of recently succeeded queries. Replication scheme replicates frequently accessed data objects on the nodes which get high number of similar queries or closer to the peers from where most of the queries are being issued. Two simple replication schemes have been discussed and their performances are compared. Experimental results prove that our searching algorithm performs better than the selective walk searching algorithm.

PROTECTING THE INFRASTRUCTURE INFORMATION FROM DDOS ATTACK JAVA

ABSTRACT

Denial of Service Attacks has evolved to be one serious threat for Network activities. Their massive, distributed, and hard to trace nature makes them impossible to be countered by the efforts of a single site. This paper presents an inter-domain infrastructure that aims to coordinate detection and response to such attacks. The main building block of the design is a lightweight software platform installed at each participating domain that provides messaging and alert services and the point of coordinated response control. We describe the operation of this Cooperative IDS Entity and focus on its policy control features. The response capability that enables an effective cooperation is adaptable to suit the security policies and needs at each site.

REPRESENTING AND REASONING ABOUT COMMITMENTS IN BUSINESS PROCESSES JAVA

ABSTRACT

A variety of business relationships in open settings can be understood in terms of the creation and manipulation of commitments among the participants. These include B2C and B2B contracts and processes, as realized via Web services and other such technologies. Business protocols, an interaction-oriented approach for modeling business processes, are formulated in terms of the commitments. Commitments can support other forms of semantic service composition as well. This paper shows how to represent and reason about commitments in a general manner. Unlike previous formalizations, the proposed formalization accommodates complex and nested commitment conditions, and concurrent commitment operations. In this manner, a rich variety of open business scenarios are enabled.

RESEARCH OF A SECURE FILE SYSTEM FOR PROTECTION OF INTELLECTUAL PROPERTY RIGHT DOT NET

ABSTRACT

This paper analyses the architecture of current secure file system and the security needs for protection of intellectual property rights and especially the major problems of it. Then we propose a secure data container model based on data encapsulation from the realization concept of virtual file system (VFS) in Linux. Based on this model, we design and implant a secure file system IPR-SFS on Windows platform for protection of intellectual property which achieves perfect combination between data encryption and access control. Compared with the previous systems, the IPR-SFS file system is more convenient and flexible, safe and scalable, also comparable to the existing file.

RISK MITIGATION FOR CROSS SITE SCRIPTING ATTACKS USING SIGNATURE BASED MODEL ON THE SERVER SIDE JAVA

ABSTRACT:

Cross-site Scripting (XSS) is the top most vulnerability in the web applications. Attacks on web applications are increasing with the implementation of newer technologies, new html tags and new JavaScript functions. The proposed Signature based misuse detection approach introduces a security layer on top of the web application, so that the existing web application remain unchanged whenever a new threat is introduced that demands new security mechanisms. To test the effectiveness of this approach, the vulnerable web inputs listed in research sites, black-hat hacker sites and in the black hat hacker sites are considered. The proposed security system was tested on those vulnerable inputs collected from the above sites. There are around 100 variants of XSS attacks found during the testing. It has been found that the approach is very effective as it addresses the vulnerabilities at a granular level of tags and attributes, in addition to addressing the XSS vulnerabilities.

DISTRIBUTIVE REAL-TIME IMAGE TRANSMISSION USING RIORB JAVA

ABSTRACT:

Real-time image transmission is crucial to an emerging class of distributed embedded systems operating in open network environments. Examples include security systems based on wireless camera networks, and online collaboration using camera phones. Meeting image transmission deadlines is a key challenge in such systems due to unpredictable network conditions. In this paper, we present CAMRIT, a Control-based Adaptive Middleware framework for Real-time Image Transmission in distributed real-time embedded systems. Existing ORB middleware standards not adequately address the challenges. To overcome this, we have developed a Control-based Adaptive Middleware (CAM) Framework for real-time image transmission. CAMRIT features a distributed feedback control loop that meets image transmission deadlines by dynamically adjusting the quality of image tiles. Experimental results demonstrate that CAMRIT can provide robust real-time guarantees for a representative application scenario.

ROUTE STABILITY IN MANETS UNDER THE RANDOM DIRECTION MOBILITY MODEL VC++

Domain: Dot Net Mobile Computing

IEEE Transactions on Mobile Computing, Sept. 2009, Volume: 8, Issue: 9

ABSTRACT

A fundamental issue arising in mobile ad hoc networks (MANETs) is the selection of the optimal path between any two nodes.A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction.In this work, we study both the availability and the duration probability of a routing path that is subject to link failures caused by node mobility.In particular, we focus on the case where the network nodes move according to the Random Direction model, and we derive both exact and approximate (but simple) expressions of these probabilities. Through our results, we study the problem of selecting an optimal route in terms of path availability. Finally, we propose an approach to improve the efficiency of reactive routing protocols.

Algorithm /Technique: Random Direction model.

SCREENING MOBILE DEVICES TO EXAMINE NETWORK HEALTH JAVA

ABSTRACT

Personal Digital Assistants (“PDAs”) are everywhere these days. Typically they are some type of small, hand-held device that combines computing functions with telephone/fax and networking features. In fact, PDA technology is becoming so prevalent that industry analysts predict, there will be more than one billion “smart devices” connected wirelessly, with more than half of that figure being web-enabled.Screening mobile devices for changes to their local registries is a key vital sign that can provide comprehensive health examinations for the benefit of an enterprise network. Our research reveals that the registry can be modified with very little difficulty to include “protected” entries within the WinCE registry.  Our testing demonstrated that in many commercial computing systems the default configuration permits all access in order to facilitate ease of use, thus exposing this perilous vulnerability. Critical changes to the registry from attacks or direct manipulation are detected by our work, providing increased protection and response time. Vital signs taken from the registry, along with other device data, is periodically reported back to a monitor using a registry short-list, delta-set update via agents we designed for effective reporting  (ER) for further diagnosis of the health threat these changes pose to the mobile device(s) and, in the  aggregate, the network.

SECURITY IN MULTI DOMAIN ONLINE ACCESS CONTROL MANAGEMENT JAVA

ABSTRACT

Information sharing plays vital role in real world environment. Every person can share the information through the online forum. In this system online student recruitment process and task scheduling based on the employee’s performance.  In this project the framework will be built upon role-based access control (RBAC) models. Due to the dynamic nature of distributed applications and the heterogeneity aspects of the underlying multi domain environment, development of the proposed framework poses several daunting challenges.

SEQUENCE BASED LOCALIZATION IN WIRELESS SENSOR NETWORKS JAVA

ABSTRACT

We introduce a novel sequence-based localization technique for wireless sensor networks. We show that the localization space can be divided into distinct regions that can each be uniquely identified by sequences that represent the ranking of distances from the reference nodes to that region. For n reference nodes in the localization space, combinatorially, O(n^n) sequences are possible, but we show that, due to geometric constraints, the actual number of feasible location sequences is much lower: only O(n^4). Using these location sequences, we develop a localization technique that is robust to random errors due to the multipath and shadowing effects of wireless channels. Through extensive systematic simulations and a representative set of real mote experiments, we show that our lightweight localization technique provides comparable or better accuracy than other state-of-the-art radio signal strength-based localization techniques over a range of wireless channel and node deployment conditions.

SECURITY ARCHITECTURE FOR WEB-BASED HEALTH INSURANCE SYSTEMS ASP.NET

ABSTRACT

Today, the use of information systems in healthcare has dramatically increased. Some health insurance companies use WWW for patient operations such as opening patient consultation, prescription etc. From the security point of view, generally simple security is applied in order to identify patients and physicians. The lack of security results in exploitation of insurance companies by some of patients and physicians. In this paper, we have examined the current web-based healthcare insurance systems and purposed security architecture to solve security problems. The security architecture highly depends on patient and physician smart cards and fingerprint-based biometrics.

INTEGRATION OF A SPEECH ACTIVATED CONTROL SYSTEM AND A WIRELESS INTERWORKING UNIT FOR A CAN-BASED DISTRIBUTED APPLICATION DOT NET

ABSTRACT

Ever increasing number of mobile devices in automation systems have revealed the requirement of utilizing wireless communication systems enabling interoperability between existing wired and wireless systems. Therefore, a wireless interworking unit (WIU) is usually employed to provide required interworking functionality. This work briefly exploits a controller area network (CAN)/IEEE 802.11b WIU and a speech activated control application to be used in a CAN-based industrial networking environment and presents its prototype. The WIU employed provides communication skills with the speech activated control system including a speech recognition process and CAN-based distributed control application over the wireless medium.

EXPERIMENTS IN HIDING DATA INSIDE THE FILE STRUCTURE OF COMMON OFFICE DOCUMENTS: A STEGONOGRAPHY APPLICATION DOT NET

ABSTRACT

In the world of spy vs. spy, covert communication, or steganography, is not a new concept. This ancient art has been used in many ways and in many mediums and has not been ignored in this century with the bits and bytes of the computerized world. Many methods have been found for hiding covert messages and data in computer files. One only has to search the Internet for steganography, or stego for short, to find multiple freeware utilities that will allow even a novice computer user to create files with hidden communications. However, where there is a desire to hide communication, there is also a desire to detect that communication. For this reason, there are also tools available online to detect covert data in image files. How dangerous is a hiding place that everyone knows about? What if someone sending covert data used file types less commonly used for steganography such as MS Word documents? Would that communication escape notice? Can these files even carry a covert message? This paper will examine the problem of covert communication in common office files by examining some commonly used office file types to determine if they have this capability. Then, it will seek to determine if this is a problem by determining if data hidden here changes the file from a user’s point of view. Finally some solutions will be proposed on how to solve this problem.

ON THE DEVELOPMENT OF STEGANOGRAPHIC TOOLS JAVA

ABSTRACT

Digital steganography refers to the insertion of a secret message into a carrier file to covertly communicate the message. Steganography systems are usually composed of insertion and extraction systems. The insertion system takes a host file, a prepared message file, and an optional key to insert the message into the host for creating a cover host. The cover host is then stored or transmitted. The extraction system operates in reverse. It takes a covert host and an optional key as input and extracts the message. Many steganography systems have some forms of built in encryption and will automatically encrypt and decrypt the message as part of the process. The most common steganography systems use various image and audio formats as host files. These files are usually large and offer the bandwidth necessary for reliable hidden. Video systems are also emerging to exploit the large size of video data files and streams. Some steganography systems do not use a host file at all, but will generate a covert host based on the contents of the message. The degree of covertness of the host depends on the capabilities of the perceived threat. A steganography attacker aims to detect whether a message is present, and if so, to extract the message and exploit it. Detecting a message requires identifying a signature or in some way determining that something about a file is unusual. Until now, there is no universal steganalysis system that is suitable to all of the current steganography techniques.In this paper, we investigate various steganography techniques and tools. We develop a set of criteria to analyze and evaluate the strengths and weaknesses of the presented techniques. We discuss the requirements of more robust steganography techniques that takes advantages of the presented strengths and avoids the limitations.

Keywords: Steganography techniques, steganalysis

SELF-BALANCED AND SELF-ADAPTIVE ROUTES IN UNSTRUCTURED P2P NETWORKS VC++

ABSTRACT

A simple strategy for routing and load balancing in unstructured P2P network based on ant-like agents is presented. In [Unger, Wulff], the authors present an algorithm, which enables to build a sorted structure on top of a P2P Network in order to support searching in such systems and to reduce maintenance times. Based on this structure, a routing mechanism that allows the user to send messages between two peers in finite time will be provided The current work adopts ant systems as introduced by Dorigo, Maniezzo and Colorini and looks for alternative paths near to the optimal route in case of congestion conditions. Although ANTs take advantage of collaborative behavior and sign the closest paths, it is also possible to rapidly saturate the communication channels between source and target nodes. Therefore, a load balancing criterion is considered, as well.

VIDEO CONFERENCING WITH MULTICAST SUPPORT USING DOTNET WITH SQL

DOT NET

ABSTRACT

This project aims to implement a video conferencing with multicast support software. This software is preferred to use this over Local Area Network (LAN) than internet due to the need for high bandwidth .It can be used to unicast, multicast or broadcast live captured media streams according to user wish. The same software can be used to receive the media streams and playback to the user. Unlike other server based systems this is a peer-to-peer software. This is based on progressive downloading. By using a message passing system every user are able to get a list of online users.

FILE ENCRYPTION AND ENCRYPTED TEXT EMBEDDING IN AN IMAGE VC++

ABSTRACT

Security of hidden data is a tradeoff between capacity, robustness and embedding against induced distortion. In this paper, authors have used the fourth parameter, authentication and verification. Authors have used 128-bit Advanced Encryption Standard (AES) for encryption and Least Significant Bit (LSB) algorithm to hide textual data behind Bitmap images. Selected images by user can be transformed into text pattern and then used for authentication and verification or as hidden message. The password protection mechanism is supported at both the stages of encryption and data hiding respectively to provide better security. Security is further enhanced by the presence of file destruction mechanism after 3 wrong password trials. The present paper claims the superiority of the designed model over existing one in terms of combined security provided by its robust authentication / verification system, encryption and data hiding. This paper demonstrates the security robustness through a comparison with existing software’s.

NEW STEGANOGRAPHY TECHNIQUE FOR PALETTE BASED IMAGES VC++

ABSTRACT

Steganography is the art and science of hiding information. The goal of steganography is to avoid drawing suspicion to the transmission of a hidden message. The success of steganography depends on the secrecy of the cover carrier. Once the steganographic carrier is disclosed then the security depends on the robustness of the algorithm and the cryptographic methods used. Therefore, to maintain secrecy either we need to make the carrier more robust against steganalysis or discover new and better carriers. This paper discusses a new steganography technique for palette based images. Secret message is encrypted using public key cryptography before hiding. The bits of encrypted message will be hidden inside the stretched palette of image.