CSE Paper Presentations - 1000 Projects

September 23, 2012

Solution to Privacy Issues in RFID Item-level Applications

Introduction to Solution to Privacy Issues in RFID Item-level Applications Project:

This paper discussed about a solution that addresses the privacy issues of Radio Frequency Identification item-level applications and also demonstrates a solution which provides high security with low manufacturing and management cost.

Overview:

Automated identification is possible in RFID without the knowledge of tag bearer and it is one of the major privacy concerns of RFID. In RFID item-level applications this unauthorized read can be prevented with the help of traditional cryptographic operations like authentication and encryption but these operations are too costly in RFID. Automated identification also raises privacy concerns like inventorying and clandestine tracking.

Many researches has been carried out to provide consumer privacy in the RFID world. Physical approaches such as peeling off tags antennas or physical triggers do not provide protection from clandestine inventorying. The trade-off between cryptographic operations and low-cost has become a major challenge in designing RFID tags. With the new proposed RFID structure, the tags need not store more information. Tags need to carry only the ID numbers to avoid clandestine and eavesdropping tracking. Information security, integrity and non-repudiation are protected by the database in the new RFID structure.

Conclusions

This paper proposed a solution to the privacy concerns in RFID in item-level applications at low manufacturing and maintenance cost. In this system, RFID tags do not need a PIN or a secret key authentication which in turn reduces the costly key distribution and management. Tags carry only ID numbers and uses hash function to prevent clandestine tracking. This eliminates eavesdropping attacks because no reader will get meaningful information from tag responses. Information related to tags is so secured and stored in a back-end database.

This information will send to end-users along the supply chains through cryptographic operations. Burden of using cryptographic operations shifts from tags to database so tags are easy to manufacture and maintain. Tags carry only ID numbers, which are divided into segments, which will helps to reduce computational complexity of database management.

September 23, 2012

Smart Gateway Design for WSN Health Care System Project Report

Introduction to Smart Gateway Design for WSN Health Care System Project:

This paper discussed about a smart gateway design which designed especially for WSN health care systems at home environments by building a bridge between different networks to get faster response time during emergencies. The communication protocols are also designed between WSN, gateway and remote servers. Researches has been carried out on this smart gateway with a wireless home e-health care sensor network in order to show that this gateway is reliable and has low power consumption and latency.

Overview:

Wireless Sensor Networks (WSN) have been used in many areas because of its numerous advantages. WSNs are also using in health care systems by integrating health care, sensor network and wireless communications together. Smart gateway designed by following embedded system development processes and this resultant designed gateway is used in WSN health care systems.

In a health care system, time required detecting patient’s health state and informing the same to care givers is very important. In WSN, sensor nodes always must be in working mode and less interfere channel. Data from WSN is analyzed by the proposed gateway or by any central server. With the help of WSN, the data about health state of patient’s must reach health care takers on time. Health care takers must get notice when patient’s health is in danger.

Smart gateway is classified into simple and intelligent models. In simple model, connection exists between WSN and smart gateway, and between smart gateway and health care takers. Communication protocol exists between WSN and PCN in transport layers and it should exist between WSN and HCC in application layer.

Data transfers to HCC from WSN and commands received from HCC which need to be implemented. In intelligent model, connection exists between WSN and smart gateway, and between smart gateway and remote server. Onboard database plays an important role in receiving and storing data from WSN and informing the same to HCC. Reporting of patient’s health state to remote server takes place periodically.

Download Smart Gateway Design for WSN Health Care System Project Report.

September 23, 2012

Shape Based Voting Algorithm for Pedestrian Detection and Tracking

Introduction:

This paper discussed about how shape-based object detection and tracking takes place using the MOUGH Transform. The shape-based voting algorithm proposed in this paper is mainly addressed one of the challenging problem, pedestrian tracking.

Shape-based detection and tracking:

MOUGH (Mixture of Union and Gaussians Hough) Transform is a new shape model designed and it designed based on a Gaussian Mixture model (GMM). As this method is shape-based, it is used to detect stationary objects and does not depend on movement. Shape-based algorithms use the object typical shape to perform tracking. Register complex 3d models and constraint optic flow methods are the part of shape based methods. This paper focused on edge-based methods for edge-based shape tracking. Active shape models are used in pedestrian tracking. But ASM has its own limitations which overcome by level set methods.

Generalized Hough Transform suggested an alternative approach to shape-based detection. GHT detects arbitrary shapes by using a single template image with a marked centroid. Since GHT has lot of drawbacks. Leibe’s implicit shape model uses a voting approach and has been applied to pedestrian tracking. MOUGH voting can be made up to sixteen times faster by an outlier distribution in training and using centroid adjustments.

Conclusion:

MOUGH is a new shape-based model for shape-based detection and tracking. Voting from edges takes place in MOUGH using mixture of Gaussians. An analysis of noise characteristics given images of rigid objects gives this algorithm. Semi-parametric shape template from sample images has been learnt by this algorithm.

This algorithm uses silhouette shape, so it is very effective in detecting pedestrians. This algorithm shows high performance when compared to that of other Hough variants and also provides more advantages than other shape based tracking algorithms like active shape models. The shape-based model using this algorithm helps to locate and track objects accurately against complex backgrounds. This algorithm is more efficient in tracking pedestrians from a side view.

September 23, 2012

Seminar Report on A Phase Change Memory as a Secure Main Memory

Introduction to A Phase Change Memory as a Secure Main Memory Seminar Topic:

This paper discussed about Phase Change Memory technology and describes how to design a PCM-based main memory to overwrite attacks. The benefits of PCM over existing DRAM technology is that its static energy consumption, and integration scalability for future technologies generations.

Overview:

Limited endurance is one of the issues for the design of PCM-based main memory systems. PCM components create a main memory through a very simple program of overwriting the same memory cells again and again. In a secure PCM-based main memory, PA-to-PCMA translation is continuously altered through a random process.

Applications:

The following are few of the applications of PCM:

In embedded systems: In embedded systems, memory is used for code storage. Phase change memory enables new memory usage models which are used as storage memory for an embedded file system.
In wireless systems: PCM serves as an outstanding code execution memory and outstanding read-mostly memory. PCM achieves the best overall cost while meeting the increasing performance demands of high-end, multimedia wireless devices
In solid state devices: PCM can be used in solid state storage systems to store often accessed pages. And also to store those elements which are more easily managed when manipulated in place.
As non-volatile memory: To reduce power consumption, PCM banks are turned off when they are in idle state. PCM subsystem density envelope is not limited by the system power envelope constraints.

Conclusions:

The PCM based main memory is more effective because of its very low static energy consumption. To consider PCM memory as an industrial product it should resists to software overwrite attacks. Overwrite attacks can be prevented by hiding the PCM memory address and then moving the physical memory block in PCM memory. PA-to-PCMA scheme allows the overall PCM main memory to resist to an overwrite attack for a very high fraction of its expected lifetime. A scheme proposed in this paper reduces performance on memory intensive applications.

Download Seminar Report on A Phase Change Memory as a Secure Main Memory.

September 23, 2012

Image Steganography Technique -Based On Block-DCT and Huffman Encoding

Introduction:

This paper describes about a Image steganography technique to hide information into a cover page based on Block-DCT, and Huffman coding. Huffman encoding is on the secret messages/images before embedding and each bit of secret message/image is embedded in the frequency domain by modifying the least significant bit of cover image blocks DCT coefficients. This algorithm has a good invisibility and capacity. Peak signal to Noise Radio of cover image with stego-image gives better results when compared to that of existing steganography approaches. The secret message/image cannot be extracted without knowing Huffman table and decoding rules.

Image Steganography Algorithm:

The main objective of Steganography is the true message cannot able to observe by an observer. Unauthorized users are not supports to differentiate a cover-image i.e., an image does not contain an secret message and stego-mage i.e., cover-image is modified and results a stego-image with secret message. Now-a-days steganograhpy is widely used in computer where digital data acts as carriers and networks acts as speed delivery channels.

Image steganography schemes are classified spatial-domain based category and transform-domain based category. In spatial domain approaches, the embedding of secret messages takes place directly. The simplest stegonographic method in spatial domain is Least Significant Bits Insertion method. Secret image is encoded using Huffman coding and then the secret image is embedded into cover image. Huffman codes are optimal codes in which one symbol maps to one code word.

Conclusion:

In spatial domain, a steganography process improved security and image quality, compared to that of existing algorithms. It is very difficult to differentiate original image with the steganography algorithm resultant stego-image. This algorithm also provides 3 layers of security to cover image transformation. But the demand for image robustness in steganography is not as much as in watermarking field. Image in steganography process neglects the basic demand of robustness. This algorithm performs few operations and Huffman encoding of secret image helps to protect the images from stealing or misuse by unintended users.

Download Image Steganography Technique -Based On Block-DCT and Huffman Encoding.

September 23, 2012September 23, 2012

A Novel Algorithm for Hiding Sensitive Frequent Item Sets

Introduction to A Novel Algorithm for Hiding Sensitive Frequent Item Sets Project:

This paper discussed about fast hiding sensitive frequent itemsets (FHSFI) approach to hide sensitive frequent itemsets with one database scan and generate limited side effects.

Overview:

In a database, with an association analyzer, if an itemset with support above a given minimal support then that itemset is called a frequent itemset. There is a need to analyze the correlations between the sensitive itemsets and each transaction in a database. The transactions order to be altered can be decided based on the each transaction weight which is given by heuristic function.

So by this there is a possibility of saving time by only consider the actual required transactions to modified and then hide the given sensitive frequent itemsets. There is no need to deal with all the transactions to hide the sensitive frequent itemsets. FHSFI provides the facility to hide the SFI without generating many side effects but still there is loss in rule sets, so researches have been takes place to overcome this issue. The main goal of FHSFI is to hide sensitive frequent itemsets by allowing minimum support thresholds, by limited side effects and by executed only one database scan.

Conclusions:

In network and data mining world, there is a severe need to protect the confidentiality of sensitive information in a database. The relationships hidden among large data sets are in a form of frequent item sets or association rules. Privacypreserving data mining is an important issue which needs the immediate attentions in the current industry.

When the support of each given sensitive itemsets are reduced then it will help to hide sensitive frequent itemsets, and this can be achieved by modifying transaction in database but at the same time will have enough side effects due to it. So FHSFI emerged to hide sensitive frequent itemsets with limited side effects.

Download A Novel Algorithm for Hiding Sensitive Frequent Item Sets.

September 23, 2012September 23, 2012

NIT Seminar Topic on A Logic programming approach Knowledge State Planning

Introduction to NIT Seminar Topic on A Logic programming approach Knowledge State Planning:

This thesis discussed about new logic programming language k and how to apply it to knowledge state planning. The symantics and syntax of K is also discussed in this paper.

Overview:

The language K can describe the transitions between different knowledge states and also allows planning under incomplete knowledge. Also language K describes the transitions between completely described world states. Natural and compact representation is also possible with this language.

In reality, numbers of fluents are unknown and planning agents don’t have a complete knowledge. So to overcome this K language proved three valued view of fluent, and those values or true or false or unknown. K language never describes world’s view of knowledge states. Theoretical DVLk implementations are provided by K and computational complexity of K is analyzed.

K language consists of three disjoint sets namely action, fluent and type. If we start with the definition of the planning domain typed instantiation then we will get semantics of K planning domains and planning problems. After defining state transitions, there is a need to define an order of state transitions that leads from initial state to some success state and then in turn satisfies the given goal. Planning agent knows the complete knowledge of affairs initial state.

If initial state block locations are not known or if initial state is incompletely defined then any planning problem involving the domain does not admit any plan. In planning literature, based on the results the planning complexity in K is related to several results. In all the formalism, state transitions are similar in spirit and several complexity characteristics.

Conclusions:

This paper discussed about an approach to knowledge state planning using new logic programming. Problems like incomplete initial states are addressed by this language. The highlighted point in this paper is discussed the approach of problem solving using K.

Download NIT Seminar Topic on A Logic programming approach Knowledge State Planning.

September 23, 2012

An Approach for FEC Decoding Based on the BP Algorithm LTE and WiMAX Systems

This paper describes about unified belief propagation (BP) algorithm and how it helps in decoding in tailbiting convolutional and turbo codes. For all convolutional code classes and turbo codes, BP algorithm provides an effective general methodology for devising low-complexity iterative decoding algorithms. If a small performance has taken place during decoding turbo codes with BP instead of MAP, then this will be offset by the lower complexity of the BP algorithm.

Overview:

Prerequisites like generator matrix and parity check matrix are required to apply BP algorithm on tail-biting convolutional code by a Tanner graph for decoding. In order to replace the traditional decoders of turbo codes with the BP decoder, there is a need to obtain the turbo code party-check matrix. As the BP decoder is less complex than traditional decoder and also due to enables a unified decoding approach, the loss in BER performance is acceptable. When compares MAP and SOVA decoders, BP algorithm yields the lowest implementation complexity over all the required operations. BP algorithm for turbo codes is about 1.7 dB worse at a BER value of 10−2, than that of traditional decoders for turbo codes.

Conclusions:

The usage of BP algorithm is determined in this paper and also describes the feasibility of decoding arbitrary tailbiting convolutional and turbo codes. This algorithm helps to speeds up the error correction convergence and decreases the decoding computational complexity in WiMAX systems. Besides, based on forward-only algorithm, BP algorithm performs a non-trellis.

BP decoder for turbo codes in a combined architecture is having more benefits based on the efficient reuse of computational hardware and memory resources of the two separate decoders. As traditional turbo decoders having a higher complexity, there is a high loss in performance with BP. In fact, the low decoding complexity of BP decoder brings end-to-end efficiency as both encoding and decoding takes place with low hardware complexity.

September 23, 2012

A New Approach to Intrusion Detection System Evaluation in Distributed Real-Time Systems

Introduction:

This paper describes about a metric-based approach which will help Real-Time systems to get the best facilities by making use of best intrusion detection system. This metric-based approach addresses all real-time and distributed processing issues. Also, this paper discussed about the metric scorecard to test 3 commercial intrusion detections systems.

Intrusion Detection Systems:

Always Intrusion detection systems checks the effectiveness of other access controls and by this provides defense-in-depth. ID’s detects both internal misuse of computer and network resources and also external attacks. ID technologies always points to a soft real-time problems. To prevent the damages from intrusion there is a severe need that arrived data must be analyzed and alerts must be issued in equal intervals of time. Besides, IDs considers the needs of real-time and distributed system before providing protection to those.

IDs must not disturb system performance. IDS are classified into three types signature-based, anomaly-based and hybrid based on the corresponding detection mechanisms. Anomaly-based or behavior-based IDS are helpful to detect behavior which is inconsistent with normal behavior. Anomaly-based IDS generates a suspicious activity alert when it detects hundreds of login within a few seconds. A signature-based ID detects patterns in network traffic. Signature-based IDS are also known as “misuse-based” or “knowledge-based” IDS. A hybrid IDS uses either series or parallel technologies. Based on monitoring scope IDS are characterized further. IDs that monitors one or more or both hosts in a network. IDS monitors a network collects and also analyzes the packets from network.

Conclusions:

Information security services frequently have conflicts with the highly distributed and real-time systems performance. These systems grow more complex and constrained. These issues can be overcome by intrusion detection. Intrusion detections assure integrity by keeping it clear whenever access controls have failed. This paper also proposed a testing technology to test ID products as per user-definable and dynamically-changing standards.

September 23, 2012

An Efficient Wireless Architecture to Connect Rural Regions Project

Introduction to An Efficient Wireless Architecture to Connect Rural Regions Project:

This paper discussed about a new wireless network architecture WiRE (Wi-Fi-based Rural Extensions), which provides connectivity to rural regions at very low costs. To enhance the features of WiRE architectural, this paper also addressed the challenges at various protocols. Operations costs of WiMAX and cellular networks are higher in rural areas, because significant power consumption requires covering large areas with low user densities. So there is a need of WiRE network to provide connectivity to rural areas at low cost.

WiRE Network Architecture:

The main working principle of WiRE is to provide coverage to specific rural regions where connectivity is more required rather than providing broad coverage. The six important network components of WiRE are wireless nodes, point-to-multipoint links, low cost computing devices, point-to-point links, multi-radio mesh links and large local storage. The scope of WiRE network architecture is much broader when compared to that of WiLD networks. A wiRE network provides rural connectivity, supports wide range of applications and also focuses on challenges across different protocol layers. WiRE network provider uses unlicensed spectrum so there is no need to pay spectrum costs.

As the manufactures of Wi-Fi chipsets supports open source drivers which help to tailor the protocol in order to meet our needs. Low power single board computers are used by every wireless router in a WiRE network. PCs/ kiosks or the cell phones are the end-devices of WiRE. WiRE architecture is helpful to enable specific services like telephony services, tele consultation and telemedicine services, interactive distance learning service and mobile banking services to rural regions. But in order to provide the above mentioned services, WiRE network has to face some challenges which come across network and transport layers. WiRE network is designed in a way to tolerate all failures and address all challenges in these two layers.

Conclusions:

The WiRE architecture is developed for the typical rural regions to connect them to the city. WiRE is a wireless distribution network which extends connectivity from the city to village.

Download An Efficient Wireless Architecture to Connect Rural Regions Project.