|
|
MS ieee 01:Rabbit-MAC: Lightweight Authenticated Encryption in Networks
Technology: J2EE & Java
Ref: 978-1-4244-2184-8/08 © 2008 IEEE. Ruhma Tahir, Muhammad Younas Javed , Ahmad Raza Cheema
To develop a new Lightweight Authenticated Encryption Mechanism based on Rabbit stream cipher referred to as Rabbit-MAC, for Networks that fulfils both requirements of security as well as energy efficiency. Secrecy is very important for some types of information, such as information related to militaries, banking etc.. Here Symmetric algorithm used for authentication is called a Message Authentication Code or MAC. Rabbit was designed to be faster than commonly used ciphers and to justify a key size of 128 bits for encrypting up to 264 bytes of plaintext. This means that for an hacker who does not know the key, it should not be possible to distinguish up to 264 bytes of cipher output from the output of a truly random generator. Our proposed security protocol is an idea for resource constrained Networks, and can be widely used in the applications of secure communication. This will be very fast and high security.
MS ieee 02: Security Communication for Network using Kerberos Protocol
Technology: Java – Swing Ieee Paper
Today more then ever, secure communication is a must. Most companies now user network infrastructure to conduct their business, whether internally Intranet model or externally to reach partners or customers (extranet/Internet models). While it is utopian to consider today’s networks as being safe, there are solutions to make them more secure and use them with a bit of trust. The key aspects to securing communications over a distributed environment are authentication, integrity, confidentiality and authorization. Kerberos is a network protocol that addresses the authentication part. This application aims at using Kerberos to secure the communication between client and Server. This project mainly covers at gaining the initial ticket provided by the authentication server. Authentication server checks its database to authenticate the user. If the username and the password matches it generates and initial ticket by which we can obtain many service tickets to access the services provided.
MS ieee 03:Distributed Token Circulation in Mobile Ad-Hoc Networks
Technology: Java – Swing Simulation Project
Mobile ad hoc networks consist of mobile hosts, which are free to move arbitrarily. The communication between the mobile hosts depends on their positions and transmission ranges, so the communication topology may change with time as the hosts move into and go out of each other’s transmission range. The technology of mobile ad hoc networking is becoming increasingly prevalent and it has been an active research area. There are several distributed algorithms that cause a token to continually circulate through all the nodes of a mobile ad hoc network. An important application of such algorithms is to ensure total order of message delivery in a group communication service. Some of the proposed algorithms are aware of, and adapt to changes in, the ad hoc network topology. When using a token circulation algorithm, a round is said to complete when every node has been visited at least once. Criteria for comparing the algorithms include the average time required to complete a round, number of bytes sent per round, and number of nodes visited per round. Comparison between the proposed algorithms is performed using simulation results obtained from a detailed simulation model.
MS ieee 04 Elliptic Curve Cryptography (ECC)
Technology: ASP.Net & C#
Elliptic Curve Cryptography (ECC) is emerging as an attractive alternative to traditional public –key cryptosystems (RSA, DSA, and DH).ECC offers equivalent security with smaller key sizes resulting in faster computations, lower power consumption, as well as memory and band with savings. While these characteristics make ECC especially appealing for mobile devices, they can also alleviate the computational burden on secure we servers.
This article studies the performance impact of using ECC with secure Sockets Layer (SSL), the dominant internet security protocol.
MS ieee 05: Digital Image Processing Techniques for the Detection and Removal of Cracks in Digitized Paintings
Technology: VB.Net
An integrated methodology for the detection and removal of cracks on digitized paintings is presented in this project. The cracks are detected by threshold the output of the morphological top-hat transform. Afterward, the thin dark brush strokes which have been misidentified as cracks are removed using either a median radial basis function 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.
MS ieee 06 Face Recognition Using Laplacian faces
Technology: Java – Swing ieee paper
The face recognition is a fairly controversial subject right now. A system such as this can recognize and track dangerous criminals and terrorists in a crowd, but some contend that it is an extreme invasion of privacy. The proponents of large-scale face recognition feel that it is a necessary evil to make our country safer. It could benefit the visually impaired and allow them to interact more easily with the environment. Also, a computer vision-based authentication system could be put in place to allow computer access or access to a specific room using face recognition. Another possible application would be to integrate this technology into an artificial intelligence system for more realistic interaction with humans.
We propose an appearance-based face recognition method called the Laplacianface approach. By using Locality Preserving Projections (LPP), the face images are mapped into a face subspace for analysis. Different from Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) which effectively see only the Euclidean structure of face space, LPP finds an embedding that preserves local information, and obtains a face subspace that best detects the essential face manifold structure. The Laplacian faces are the optimal linear approximations to the eigen functions of the Laplace Beltrami operator on the face manifold. In this way, the unwanted variations resulting from changes in lighting, facial expression, and pose may be eliminated or reduced.
Theoretical analysis shows that PCA, LDA, and LPP can be obtained from different graph models. We compare the proposed Laplacianface approach with Eigenface and Fisherface methods on three different face data sets. Experimental results suggest that the proposed Laplacianface approach provides a better representation and achieves lower error rates in face recognition. Principal Component Analysis (PCA) is a statistical method under the broad title of factor analysis. The purpose of PCA is to reduce the large dimensionality of the data space (observed variables) to the smaller intrinsic dimensionality of feature space (independent variables), which are needed to describe the data economically. This is the case when there is a strong correlation between observed variables. The jobs which PCA can do are prediction, redundancy removal, feature extraction, data compression, etc. Because PCA is a known powerful technique which can do something in the linear domain, applications having linear models are suitable, such as signal processing, image processing, system and control theory, communications, etc.
The main idea of using PCA for face recognition is to express the large 1-D vector of pixels constructed from 2-D face image into the compact principal components of the feature space. This is called eigenspace projection. Eigenspace is calculated by identifying the eigenvectors of the covariance matrix derived from a set of fingerprint images (vectors).
MS ieee 07 Robust Content Based Image Retrieval System
Technology: Java – Swing ieee Paper - 2008
Most of the existing image retrieval systems perform reasonably when using color features. However, retrieval accuracy using shape or texture features does not produce as good results. Therefore, this thesis investigates different methods of representing shape and texture in content-based image retrieval. Later, when appropriate segmentation algorithms are available some of these methods could also be applied to video object retrieval.
Efficient and effective retrieval techniques of images are desired because of the explosive growth of digital images. Content- based image retrieval is a promising approach because of its automatic indexing and retrieval based on their semantic features and visual appearance. The similarity of image depends on the feature representation and feature dissimilarity functions. However, users have difficulties in representing their information needs in queries to content- based image retrieval systems.
In this, we investigate two approaches, query by example and image browsing map. Activities to support the information seeking behavior are analyzed. The performance of these approaches is measured by a user evaluation. It is found that the image-browsing map provides more functionalities and capabilities to support the features of information seeking behavior and produces better performance in searching images.
In this, we develop an image-browsing map using Kohonen self- organizing map for CBIR. The collection of images is trained and append onto a two- dimensional map. Users may select the nodes based on the labeled image in the self- organizing map to retrieve similar images or explore the nearby nodes in the map.
MS ieee 08 :Distributed Cache Updating for the Dynamic Source Routing Protocol
Technology: JAVA & SWING
Ref: IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 6, June 2006
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-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.
MS ieee 09: Node Allocation In Grid Computing Using Optimal Resource Constraint (ORC) Scheduling : Simulation Project
Technology: JAVA & SWING
Ref: IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.6, June 2008
The objective of grid computing is to distribute the jobs to heterogeneous environment and increase the speed of processing the jobs. Most of the Grid tool kits use the First Come First Served (FCFS) based scheduling algorithm to distribute the job to different executors or client nodes. In FCFS scheduling algorithm, doesn’t consider the capabilities of executors or client and also many processes runs on a processor, has bottlenecks in Grid environment such as when scheduling workloads that are subject to time constraints, it increases the waiting time of list of processes. We proposed a new scheduling algorithm called Optimum Resource Constraint (ORC) Scheduling algorithm which includes the combination of both the Best fit allocation and Round Robin scheduling to allocate the jobs in queue pool. The algorithm was implemented in local and global grid schedulers. This improved the efficiency of load balancing and dynamicity capability of the Grid resources. We measured the performance of ORC algorithm on a Grid computing with maximum number of
jobs and nodes.
MS ieee 10:Ant Colony Optimization - Artificial Ants as a Computational Intelligence Technique
Technology: JAVA & SWING
Ref: IRIDIA – TECHNICAL REPORT SERIES: TR/IRIDIA/2006- 023
Marco Dorigo, Mauro Birattari, and Thomas St¨utzle, Universit´e Libre de Bruxelles
All networks tend to become more and more complicated. They can be wired, with lots of routers, or wireless, with lots of mobile nodes… The problem remains the same: in order to get the best from the network, there is a need to find the shortest path. The more complicated the network is, the more difficult it is to manage the routes and indicate which one is the best.
The Nature gives us a solution to find the shortest path. The ants, in their necessity to find food and brings it back to the nest, manage not only to explore a vast area, but also to indicate to their peers the location of the food while bringing it back to the nest. Thus, they know where their nest is, and also their destination, without having a global view of the ground. Most of the time, they will find the shortest path and adapt to ground changes, hence proving their great efficiency toward this difficult task.
The purpose of this project is to provide a clear understanting of the Ants-based algorithm, by giving a formal and comprehensive systematization of the subject. The simulation developed in Java will be a support of a deeper analysis of the factors of the algorithm, its potentialities and its limitations. Then the state-of-the-arts utilisation of this algorithm and its implementations in routing algorithms, mostly for mobile ad hoc networks, will be explained. Results of recent studies will be given and resume the current employments of this great algorithm inspired by the Nature.
MS ieee 11: Measurement-Based Admission Control at Edge Routers
Technology: JAVA & SWING
Ref: 1063-6692 © 2008 IEEE Seung Yeob Nam, Member, IEEE, Sunggon Kim, and Dan Keun Sung, Senior Member, IEEE
It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in both data and control planes, we consider that each flow is classified at the ingress router and data traffic is aggregated according to the class inside the core network as in a DiffServ framework. In our approach, admission decision is made for each flow at the edge (ingress) routers, but it is scalable because per-flow states are not maintained and the admission algorithm is simple. In the proposed admission control scheme, an admissible bandwidth, which is defined as the maximum rate of a flow that can be accommodated additionally while satisfying the delay performance requirements for both existing and new flows, is calculated based on the available bandwidth measured by edge routers. The admissible bandwidth is a threshold for admission control, and thus, it is very important to accurately estimate the admissible bandwidth. The performance of the proposed algorithm is evaluated by taking a set of simulation experiments using bursty traffic flows.
MS ieee 12:Network Border Patrol: Preventing Congestion Collapse
Technology: JAVA & SWING
Ref: IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 12, NO. 1, FEBRUARY 2004
Célio Albuquerque, Member, IEEE, Brett J. Vickers, Member, IEEE, and Tatsuya Suda, Fellow, IEEE
The Internet’s excellent scalability and robustness result in part from the end-to-end nature of Internet congestion control. End-to-end congestion control algorithms alone, however, are unable to prevent the congestion collapse and unfairness created by applications that are unresponsive to network congestion. To address these maladies, we propose and investigate a novel congestion-avoidance mechanism called network border patrol (NBP). NBP entails the exchange of feedback between routers at the borders of a network in order to detect and restrict
unresponsive traffic flows before they enter the network, thereby preventing congestion within the network. Moreover, NBP is complemented with the proposed enhanced core-stateless fair queueing (ECSFQ) mechanism, which provides fair bandwidth allocations to competing flows. Both NBP and ECSFQ are compliant
with the Internet philosophy of pushing complexity toward the edges of the network whenever possible. Simulation results show that NBP effectively eliminates congestion collapse and that, when combined with ECSFQ, approximately max-min fair bandwidth allocations can be achieved for competing flows.
|
|
