Seminar Topic on Cryptography Techniques over Block Cipher

Introduction to Seminar Topic on Cryptography Techniques over Block Cipher:

This paper discussed about the research takes place on text description an on block cipher description. This paper also discussed about the cryptography technique as best and secured model over block cipher. 

Overview: 

Existing encryption techniques has many security issues like managing of encryption keys throughout the life cycle and protection from unauthorized disclosure, modifications.  Encryption and decryptions enables by the sequence of symbols used with a cryptographic algorithm. Critical radio transmissions are protected with proper encryption methods and encryption keys are stored securely during the entire life cycle.  The cryptosystem consists of hardware and software which provides means to encrypt and decrypt transmissions In order to enhance the security during encryption process, a flexible cryptography mechanism helps to analyze and compare different algorithms. 

Cryptography mechanism over block cipher by managing the keys sequentially, which classified into 3 ways like encryption-secret-key, description-secret-key and shared-secret-key.  These keys help to communicate and share sensitive or important information. Among public safety agencies with interoperable functions, the importance of key management processes cannot be overstated.  This models target to provide security by removing the keys faults to make encryption implementations effective. There should be required key controls and awareness on encryption key management. 

Advantages of using cryptography model over block cipher: 

  1. High security can be obtained during encryption and decryption process of the text contents.
  2.  Managing the encryption keys is so simple.
  3. In encryption process, it is easy to remove faults and other relevant errors. 

Conclusion:

There are many security issues with the existing encryption techniques and this paper focus on those issues for providing effective cryptography technique over the block cipher.  Most of the security issues occurred when a user maintains the same keys for years, easy keys or leaving keys unattended. These issues can be resolved by using the model which uses independently existing encrypting key as an external tool by managing keys sequentially.


Performance Comparison Of AODV And DSR Routing Protocols In MANETS Project Report

Introduction to Performance Comparison Of AODV And DSR Routing Protocols In MANETS Project:

This paper compares two routing protocols AODV and DSR performances. The evaluation of routing protocols AODV and DSR takes place, for wireless Ad-hoc networks based on performance. 

AODV protocols: 

AODV maintains one route per destination and destination sequence numbers. Destination sequence numbers is a process of preventing loops and to determine routes freshness.  These sequence numbers are carried out by all routing Packets. AODV uses similar route discovery process of DSR. AODV maintains routing information in different ways like one entry per destination and traditional routing tables.

AODV depends on routing table entries to route data packets to the destination and to propagate Route Reply back to the source.  In using of individual routing table entries, AODV maintains timer-based states in each node. Route error propagation in AODV can represents as a tree where root node indicates the failure point and leaves are the sources which are all using the failed link. 

DSR protocols: 

DSR never depends on time-based activities and uses source routing, route caches. DSR maintains various routes per target. In DSR, source route carries by the data packet in the packet header. Route discovery is the mechanism which is used to dynamically determine the routes whenever the route is not known when data packet is send to the destination. If any source root link is broken then source node is identified by a route error packet.  A DSR protocol aggressively uses source routing and route caching. 

Conclusion: 

Under high mobility simulations both AODV and DSR gives good performance. On-demand routing strategy is applied by both of these protocols but with different routing mechanisms.  DSR generates low routing load when compared to that of AODV. Because of the DSR characteristics like aggressive use of caching, determine the routes freshness when multiple choices are available and not having stale routes expiry mechanisms leads to give poor performances.

 Download  Performance Comparison Of AODV And DSR Routing Protocols In MANETS Project Report.

Efficient Encryption Decryption and Compact Module for FPGA Implementation

Introduction to Efficient Encryption Decryption and Compact Module for FPGA Implementation :

This paper suggested solutions for effective and compact FGA implementation of the AES.  Also discussed on how to provide a low-cost solution to manage with the sub keys computed during the decryption and efficient usage of the key schedule, data path parts. 

Overview: 

NIST selected Rijndael as the new Advanced Encryption Standard to replace the old Data Encryption Standard (DES). DES implementation reaches higher throughput when compared to that of AES implementation. But speed efficient designs of DES are not always relevant solutions. Also many applications needs smaller throughput.  Only the 128 bit encryption version is considered as part of AES algorithm, where the 128-bit data block is called state and its key called as RoundKey, with 4 rows and columns respectively.  The AES round provides multiple opportunities of parallelism. The round in AES design is consists of 16 S-boxes and four 32-bit MixColumn operations, which works on independent data.

One of the drawbacks of AES is that the AddRoundKey is executed after MixColumn during encryption and before InvMixColumn during decryption. Such encryption/decryption implementation requires additional switching logic in order to select appropriate data paths, which can affect the time performance.  In advance, both RoundKeys and InvRoundKey will compute and store on one RAM block, based on which the implementation of AES key schedule takes place.  Data path and key schedule parts combined together to give final AES design.  To calculate a new complete InvRoundeys AES design need to do 92 cycles, in the worst case. 

Conclusion: 

If the use of three internal RAM blocks is not considered then AES is more effective. Among the 3-DES, AES is more efficient. The proposed solution by this paper is of low cost and perfectly suits to cryptographic embedded applications.  AES design implementation based on one complete round, until the entire encryption or decryption is achieved the data will iteratively loop through this round.

Download  Efficient Encryption Decryption and Compact Module for FPGA Implementation.

Network Reconfiguration with the Help of an Improved Genetic Algorithm

Introduction: 

This project discussed about how Improved Genetic Algorithm addresses the network Reconfiguration problems in distribution systems.  Efficiency of distribution systems can be achieved by minimizing the losses, which in turn responsible to increase voltage stability and load balancing. The main goal of this project is to design a methodology for network reconfiguration in order to minimize losses and improve reliability.

 Overview: 

Both analytical methods and Monte Carlo simulation methods are used to improve the distribution system’s reliability.  In the past years, branch and bound type optimization techniques are used to reduce the losses in distribution systems. Conventional genetic algorithm is also used to reduce the losses in distribution systems reconfiguration, but it’s have less convergence speed. To overcome the problems in conventional genetic algorithm many research has taken place and new improved genetic algorithm is emerged from these researches.  IGA introduced black list of infeasible solutions, crossover dynamic adaption and a two- termination criterion to improve efficiency and to reduce losses in distribution systems. During the optimization process, IGA uses chromosome with a small length. IGA also uses suitable coding and decoding techniques for its processes. Crossover and mutation probabilities severely affect the performance and behavior of Genetic algorithm.  The termination criterion in IGA depends on either maximum number of generations or mentioned convergence threshold. During optimization process, blacklist identifies all infeasible solutions, which in turn responsible to increase the efficiency in distribution systems. 

Conclusions 

Network configuration used improved genetic algorithm (IGA) approach to improve the efficiency and Reliability in distribution systems. To predict the reliability of the network configurations, a Monte Carle simulation method is used. Coding techniques used by IGA is responsible for less computation, when compared to that of remaining techniques. One of the important characteristics of IGA is the creation of blacklist which identifies all infeasible solutions during optimization process. This blacklist is useful to increase the efficiency in distribution systems. 

Download  Network Reconfiguration with the Help of an Improved Genetic Algorithm .

Image Video Processing Applied to Traffic Queue Detection Algorithm Full Report

This paper discussed about the video image processing technique which will helps to solve the real-time road traffic control system problems.  There is a need to develop an edge detection technique with the help of real-time image tracking approach for detecting vehicles during problematic conditions and for measuring traffic queue parameters accurately.         

Real-time image processing-Queue detection algorithm:

As part of image analysis, image sensors are used to capture images and ADC conversion is to convert analog video signals to digital\binary form for further processing.

Differencing through Background frame, Differencing through Inter-frame, Segmentation and classification are the three methods involved in vehicle detection.  Motion detection operation and Vehicle detection operation are the two algorithms involved in Queue detection algorithm to measure traffic queue parameters. For adjusting traffic lights and to analyze cross-section traffic conditions, there is a need to measure traffic movements of vehicles at junctions. The main traffic queue parameters are the queue length, the occurrence period and the slope the queue occurrence. In order to implement the algorithm in real-time there is a need to use vehicle detection operation in a sub-profile where the queue will be extended.

Conclusions:

This paper discussed about the algorithm which helps to measure basic traffic queue parameters. Queue detection algorithm uses a technique by applying simple and effective operations. To reduce computation time, motion detection operation is applied on all sub profiles and vehicle detection operation is applied only as per requirement and it is less sensitive edge-based technique. The effects of lighting variations can be reduced by selecting the threshold dynamically.  The measurement algorithm can apply to traffic scenes under different lighting conditions. Errors may cause if the objects are located far from camera and these errors can be decrease by decreasing the sub profiles size.  At maximum, Queue length measurement shows 95% accuracy.

Download  Image Video Processing Applied to Traffic Queue Detection Algorithm Full Report.

Developing A New Generation Network which beyond Internet and NGN

In Japan, researches have been taken place to develop new generation network beyond the existing internet and the next generation network. Both the next generation network and the internet are developed based on IP protocols. There is a need to develop a revolutionary network technology beyond the IP structure.                                                                              

Overview: 

Based on next generation standards advanced applications using next generation network can be developed. The main objective of NGN is to replace legacy telephone networks using IP network technologies.  Internet is a best effort bearer function to connect huge multiple IP packet router-based networks internally. The three popular communication networks are the telegraph, the telephone and the internet. The telegraph network to transfer Morse code through electric current.  The telephone is a network to transfer electrical waveforms which produced by vocal air vibration.

The internet is to transfer data between computers. The fourth network paradigm on which the researches are carrying out is NWGN. In this NWGN, versatile appliances will consider to determine the network architecture and protocol. NWGN is not developing as a replacement of any existing networks but it is developing with many additional characteristic together and with a clean-state network architecture definition. All the research output of all approaches like bottom-up or top down approaches and combined those outputs together helps to develop a solution for NWGN architecture and protocol. NWGN is developing as a fourth communication network paradigm.   From 2006, systematic researches have been carried out on this NWGN in Japan.  The important things need to be considered during the development and research of NWGN is the End Host, Layering, Identifier and locator separation and transported data format. 

Conclusion: 

Research on NWGN and Future Internet are targeted to build a new Paradigm beyond the Internet. The success of this research will help in develop tight collaboration among the different research communities, all over the world.

Download  Developing A New Generation Network which beyond Internet and NGN  .

Seminar Topic on Transient Stability Assessment Using Neural Networks

Introduction to Transient Stability Assessment Using Neural Networks Seminar Topic:

This paper discussed about the artificial neural network and how this approach applies to the transient stability assessment of a power system.  Neural networks were trained by back-propagation technique. Artificial neural networks are useful for computing critical cleaning time and transient energy margin for a machine infinite bus system. TSA using ANN approach always uses a single machine which connected to an infinite bus with a double circuit line. System is stable only if clearing time is greater than the actual fault clearing time otherwise system is considered as unstable. 

Overview: 

Numerical Integration, pattern recognition and second method of Lyapunov are few of the conventional approaches to the transient stability assessment of a power system. Simulation is the process in which transient stability analysis carried out under numerical integration method. In the second method of Lyapunov, stability criterion has replaced the integration off post fall system equation. In pattern recognition method the computational requirements are reduced to minimum by elaborating offline computations. If we using conventional approaches, the task like online stability assessment of a power system with the available techniques is one of the complex or difficult task. All the drawbacks of conventional approaches has overcome by artificial neural network approach applied to the transient stability assessment of a power system.  This technique is capable of producing faster transient stability assessment and also has the potential to meet online requirements by providing the online transient stability assessment.

 Conclusions: 

A fast assessment can be achieved to the transient stability assessment of a machine infinite bus system with the help of neural network approach. Security of the power system can be improved by using neural network approach which in turn develops an on-line dynamic security package for energy management system. Researchers are still carrying out their study about the usage of ANN for TSA of multimachine system by considering all aspects like change in network topology, different loading conditions and fault clearing.

Download  Seminar Topic on Transient Stability Assessment Using Neural Networks .

Seminar Report on DNA Computing

Introduction to DNA Computing Seminar Topic:

This paper discussed about DNA computer and its speed calculations.  DNA strands can be used as representations of binary data bits. DNA computation depends on the technology which allows reproducing required number of individual DNA strands to solve complex computational problems. The main advantage of DNA computing is it can work in a massively parallel fashion. A molecules pair on a DNA strand represents data and the hardware to read and manipulate the code is the two naturally occurring enzymes. Software used for DNA computing is biological catalysts which will helpful to perform desired operations. 

Overview:

DNA computers can perform million of operations simultaneously when compared to that of conventional computers. DNA approach is processing all possible answers at a time and provides the set of potential solutions. DNA holds more information in a cubic centimeter when compared to that of a trillion CD. So, it helps to manage huge amount of memory efficiently.  DNA computers are power-saving computers and its energy-efficiency is million times more than that of a normal PC. 

Applications and limitations:

There are many applications like DNA sequencing, DNA fingerprinting, DNA mutation detection which performs re-coding natural DNA into a computable form. 

As there is a trial and error for all possible solutions for a complex problem in DNA computing, the possibility of getting errors for trials is more than that of getting correct solution to the problem. On a small test tube of DNA, every primitive operation takes some hours to complete.  These are all limitations of DNA computing. 

Conclusion:

The remarkable features of DNA computer are more storage capacity, high parallelism, high speed in calculations and less power consuming i.e., high energy efficiency. In order to execute the program on a DNA computer, few operations like synthesis, separation, merging, extraction, melting, cutting, ligation, detection, binding and multiplying need to be work out on DNA sequences in a test tube.

Download Seminar Report on DNA Computing .

Context Based Storage System for Managing Data Ubiquitous Computing Environment

This paper discussed about ubiquitous computing, which is using a new computing technology that easily adapts to user environment with the help of computing infrastructure. This paper discussed about the differences between ubiquitous computing and traditional distributed computing and also mentioned about context aware ubiquitous computing applications which can manage user data by using context. 

Overview: 

In the entire Ubiquitous computing research, the main issue is how to create context- aware applications. For mobile users there is a middleware architecture available called Context Based Storage system which helps to build context- aware applications. Information about the user in both physical and virtual worlds is stored in context. CBS system finds the accessed files that are stored elsewhere using context.  In Ubiquitous computing, context-aware computing technology supports new interaction styles and also makes the interactions between users and computers much easier. CBS system uses context to avoid additional programming effort or traditionally performed programming effort  By using this system data can retrieve easily based on context of user priority, data can organize easily based on user preference and the context can also used to constrain the data quantity presented to the user. Every document will links to the context attributes and can retrieve those documents from storage using the corresponding context attributes. The main terminologies need to be highlighted in CBS system are logical context data model, entities, attributes, relationships and groups. File Browser and calendar are the two applications which implemented as part of capnet system on top of CBS system. These two applications describe how context is used to find relevant user information. In CBS system, we have both normal and context-aware modes. 

Conclusion: 

In CBS system there is architecture to organize the data in ubiquitous environment.  There is a different type of context information’s that supports useful functions in context-aware application and also exists context information that can be integrated with data management system.

Download Context Based Storage System for Managing Data Ubiquitous Computing Environment .

ECE Seminar Topic on Extending lifetime of sensor surveillance systems Data fusion model

Introduction to Extending lifetime of sensor surveillance systems Data fusion model:

This paper discussed about the sensor surveillance system and how to increase the network lifetime of this system in data fusion model. The sensors need to be scheduled to monitor the respective targets, and then only the surveillance system network lifetime can be improved. The time duration when each target is monitored by sensor can be termed as network lifetime. A set of wireless sensor nodes and target will be there in a sensor surveillance system. Always, each target must be monitored by sensors. The sensors has short battery life so there is a severe need in increase the lifetime of a sensor surveillance system as it is difficult to recharge the sensors battery whenever required. 

Data fusion model- overview of sensor surveillance systems: 

To discuss about the network lifetime extension of a sensor surveillance system, there is a need to discuss about sensing model and data fusion model.

A. Sensing model: We usually assume targets will get detected by sensors with the help of signals energy which emitted by targets.

B. Data fusion model:  By using multiple sensors, data fusion can improve the performance of detecting targets.  Sensors need to be organized into clusters in order to use in data fusion. In every cluster, cluster head is responsible to take decisions about whether the target is present or not based on the information gathered from the member sensors in the cluster. The main goal is to extend network lifetime of the sensor network. Target is monitored only if the sensors in its fusion range informs that the target is exists based on the data fusion model. Sensors are organized into number of no disjoint cover sets and each cover set totally monitors all the targets. 

Conclusion: 

Energy consumption must monitor to extend the network lifetime of a sensor surveillance systems.  If we implement data fusion model in wireless sensor networks then sensing performance will get improved. As per this paper Data fusion model is helpful to extend the lifetime of sensor surveillance systems.