Informatics Publishing Limited

V. Palanisamy , Jose Ananth Vino

Abstract

Overall equipment effectiveness (OEE) is a concept where the bottleneck operations of a particular process are reduced to certain extent. A pilot scale study is under taken in the product manufacturing industry and OEE concepts are implemented in the job floor. The three parameters such as availability, performance and quality of the process are taken up for this purpose. The OEE concepts were implemented in a periodic manner and continuous improvement in the job floor was monitored which proved some positive output.

Keywords

OEE, Availability, Performance, Quality

Full Text

   

N. Chitradevi ¹, V. Palanisamy ², K. Baskaran ³, D. Aswini ⁴

Affiliations
1 IT Department, Kumaraguru College of Technology, Coimbatore - 641 049, IN
2 INFO Institute of Engineering, Coimbatore - 641 007, IN
3 CSE Department, Government College of Technology, Coimbatore - 641 013, IN
4 Kumaraguru College of Technology, Coimbatore-641 049, IN

Abstract

Wireless Sensor Networks (WSNs) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, and to cooperatively pass their data through the network to a base station. Data Fusion/Aggregation can effectively reduce the volume of data transmission in the network, reduce the energy consumption to extend network lifetime and improve bandwidth utilization, as a result, it can overcome the restriction of energy and bandwidth. Moreover since a sensor is typically placed in locations that are accessible to malicious attackers, information assurance of the data fusion process is very important. In order to improve the performance in terms of assurance, overhead and delay, we proposed a novel trust based direct voting mechanism [1]. Our work employs trust metric to poll the witness nodes for in the process of data fusion assurance. In this paper we extended the work of [1] in terms of bottom-up approach where the child node can select the node (parent) to forward the data. Generally, a hierarchical data collection scheme is used by the sensors to report data to the base station, it is difficult to precisely identify and eliminate a compromised node in such a data collecting hierarchy. Most security schemes for sensor networks focuses on developing mechanism for nodes located higher in the hierarchy to monitor those located at lower levels. We propose a complementary mechanism with which the nodes at lower levels can monitor their parents in the hierarchy to identify the behavior, based on that child will select the parent node to forward the data. Every node maintains a reputation (trust) value of its parent and updates this at the end of every data reporting cycle. We propose a novel combination of statistical testing techniques and reinforcement learning schemes to manage the reputation of a parent node. In this paper baye’s theorem is used to evaluate the trust of nodes. The performance of proposed approach is evaluated and compared with previous approaches and found that our approach has a lower overhead than the previous approaches in terms of delay and energy consumption.

Keywords

Wireless Sensor Networks, Data Fusion Assurance, Power-Efficient, Voting Mechanism, Witness Node, Bottom-Up Approach, Reputation.

Full Text

     

R. Pandi Selvam ¹, V. Palanisamy ¹

Affiliations
1 Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamil Nadu, IN

Abstract

Ad hoc networks are wireless, infrastructure less, multi-hop and dynamic network, established by a collection of mobile nodes which provide envisioned features and applications to the modern communication technologies and services. In ad hoc networks clustering technique nodes are formed together and arranged in a group. Due to the dynamic topology of ad hoc network the cluster head (CH) election and route optimization are considering as the complicated processes [1] [2]. In this paper, we used the genetic algorithm (GA) for the CH election and route optimization in mobile ad hoc networks. For this optimization technique we have chosen some parameters such as degree difference, battery power, degree of mobility and sum of the distance of a node of mobile ad hoc networks[7][12]. Simulation results are conducted to evaluate theproposed approach average number of clusters in various environments and its route construction to find, the shortest and a very good path between the source to destination in ad hoc networks.

Keywords

Mobile Ad Hoc Networks, Clustering, GA, CBRP, WCA.

Full Text

     

N. Chitradevi ¹, V. Palanisamy ², K. Baskaran ³, S. Prabeela ⁴

Affiliations
1 Department of Information Technology, Kumaraguru College of Technology, Coimbatore, Tamil Nadu, IN
2 Department of Electronics and Communication Engineering, INFO Institute of Engineering, Coimbatore, Tamil Nadu, IN
3 Department of Computer Science and Engineering, Government College of Technology, Coimbatore, Tamil Nadu, IN
4 Department of Computer Science and Engineering, Kumaraguru College of Technology, Coimbatore, Tamil Nadu, IN

Abstract

Wireless sensor networks allow distributed sensing and forwarding of data co-operatively during energy efficient operations. Sensor nodes in this network are small and inexpensive, so that they can be produced and deployed in large numbers, and so their resources in terms of energy, memory, computational speed and bandwidth are severely constrained. The information processing algorithms in wireless sensor networks must also use reduced computing power of the sensor networks Critical resource limitations like power constraints demands energy efficient data gathering schemes. Data aggregation, eliminating data redundancy is an efficient data gathering scheme. Cluster analysis, primitive exploration with little or no prior knowledge is an efficient data aggregation scheme. By sending the sink clustered data instead of practical ones, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. This paper provides a more detailed look at some of the existing data clustering algorithms used in wireless sensor networks.

Keywords

Clustering, Clustering Algorithm, Energy Minimization, Unsupervised Technique, Wireless Sensor Network.

Full Text

     

R. Pandi Selvam ¹, V. Palanisamy ²

Affiliations
1 Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Alagappa University, Karaikudi,Tamil Nadu, IN

Abstract

Mobile ad hoc networks (MANETs) also called ad hoc networks is a type of wireless network which organized without any physical medium. In this network nodes are moving dynamically without any centralized infrastructure and each node behaving as a self-organizing and self-configuring node i.e. acts as a router. Routing is an essential component of communication networks, which defines act of moving information from source(s) node to destination node(s) in an inter network. Multicast is a type of routing scheme used to send the data packets from the source to multiple destination. Multicasting can support a variety of applications and services. Most existing multicast routing protocols have only one source in a multicast group, as a resulting point of view cluster based multi-source multicasting has been developed to send different kinds of applications in the multicast environment. The proposed routing algorithm is implemented by the network simulator and its packet delivery ratio, control overhead and forwarding efficiency results are drawn by the network animator.

Keywords

Mobile Ad hoc Network, Multicasting, Multi-Source Multicasting, Clustering, NS2.

Full Text

     

G. A. Sathishkumar ¹, K. Boopathy Bagan ², P. Muthu Kannan ³, V. Palanisamy ⁴, P. Muthukumaran ¹

Affiliations
1 Department of Electronics and Communication Engineering, Sri Venkateswara College of Engineering, Sriperumbudur-602108, IN
2 Department of Electronics, Madras Institute of Technology, Chrompet, Chennai-44, IN
3 School of Electrical Sciences, VIT University, Vellore, IN
4 Department of Computer Science and Engineering, Alagappa University, Karaikudi, IN

Abstract

In today's modern world, wireless technologies have become increasingly popular in our everyday business and personal lives. Personal digital assistants (PDA) allow individuals to access calendars, e-mail, phone number lists, address and the Internet. Some Vendors even provide global positioning system (GPS) capabilities that can pinpoint the location of the device anywhere in the world. In the coming years wireless technologies promise to offer even more features and functions for the future generation. An increasing number of government agencies, businesses, and home users are using, wireless technologies in their environments. An important point here is agencies should be aware of the security risks associated with wireless technologies. Agencies need to develop strategies that will mitigate risks as they integrate wireless technologies into their computing environments. This paper discusses a simple TV scanning technique based on MISO system for wireless communication technologies, outlines the associated antenna design, and offers good resistance to the vulnerabilities in the channel.

Keywords

MISO, Scanning, PN Sequence, BBS Generator, Antenna, Interlaced Scanning, Encryption, FFT, CGSN, SGSN.

Full Text

     

V. Vanitha ¹, V. Palanisamy ², K. Baskaran ³

Affiliations
1 CSE Department, Kumaraguru College of Technology, Coimbatore, Tamilnadu, IN
2 Info Institute of Engineering, Coimbatore, Tamilnadu, IN
3 CSE Department, Govt. College of Technology, Coimbatore, Tamilnadu, IN

Abstract

In recent years, there has been a growing interest in service oriented architecture for wireless sensor networks which ease the programming and decouple the application development from the low level details of the nodes and networks. However, there are many fundamental problems that sensor networks research will have to address in order to realize the potential of service oriented wireless senor networks. Chief among them is power. Since the nodes in the wireless sensor networks are energy constraint appropriate routing protocol can drastically reduce the energy consumption and enhance the lifetime of the network. In this paper we propose Energy efficient Service driven Query Routing protocol (ESQR). ESQR routes the query based on the service requested. It makes use of hierarchical, distributed and unequal clustering protocol in which transmission range of the node changes dynamically based on the residual energy and the distance from the base station. Simulation results show that our approach is scalable, minimizes energy consumption, extends the network lifetime and reduces the query latency.

Keywords

Wireless Sensor Networks, Service Oriented Architecture, Query Routing, Hierarchical Routing.

Full Text

     

P. Muthu Kannan ¹, V. Palanisamy ², R. Swaminathan ¹

Affiliations
1 School of Electrical Sciences, VIT University, Vellore, IN
2 Department of Computer Science and Engineering, Alagappa University, Karaikudi, IN

Abstract

Wireless Networks are the backbone of modern communication. The development of Wireless Networks over the last decade is enormous and so the challenges are. As the signals are radiated in the free space, it is easier for unauthorized users to sniff, monitor the signal transmitted. Using the data collected, they can easily intrude the network. In this paper, we discuss on the security provided to the wireless transmission with reconfigurable antennas which are giving out various gain levels. By adjusting the gain of the yagi structures, the signal is confined within the required region. This process provides security against the intruders for WLAN.

Keywords

WLAN, Wireless Security, MIMO, MEMS, Reconfigurable Antennas, Yagi Antenna, Micro Strip Yagi Array, PIN Diode, Eavesdroppers.

Full Text

     

M. Tamilarasi ¹, V. Palanisamy ²

Affiliations
1 Department of Electronics and Communication Engg, Chettinad College of Engineering and Technology, Puliyur, IN
2 Info Institute of Engineering, Coimbatore, IN

Abstract

The main objective of this paper is to compress a medical image using contourlet transform used in different modalities of medical imaging. Recent reports on natural image compression have shown superior performance of contourlet transform, a new extension to the wavelet transform in two dimensions using nonseparable and directional filter banks. As far as medical images are concerned the diagnosis part(ROI) is of much important compared to other regions. Therefore those portions are segmented from the whole image using neural network based fuzzy logic technique. Contourlet transform is then applied to ROI portion which performs Laplacian Pyramid(LP) and directional filter banks to the resultant because of irectionality and anisotropy. The region of less significance are compressed using Discrete Wavelet Transform and finally modified embedded zerotree wavelet algorithm is applied which uses six symbols instead of four symbols used in Shapiro’s EZW to the resultant image which shows better PSNR and high compression ratio and finally Huffman coding is applied to get the compressed image.

Keywords

Compression Ratio, Contourlet, DFB, DWT, EZW, Medical Imaging, PSNR, Region of Interest.

Full Text

     

M. Nirmala ¹, V. Palanisamy ¹

Affiliations
1 INFO Institute of Engineering, Coimbatore, IN

Abstract

The most significant tasks in data mining are the process of discovering frequent item sets and association rules. Numerous efficient algorithms are available in the literature for mining frequent item sets and association rules. The time required for generating frequent item sets plays an important role. Some algorithms are designed, considering only the time factor. Incorporating utility considerations in data mining tasks is gaining popularity in recent years. Our study includes depth analysis of algorithms and discusses some problems of generating frequent item sets from the algorithm. The time of execution for each data set is also well analyzed. The work yields a detailed analysis of the algorithms to elucidate the performance with standard dataset like Adult, Mushroom etc. The comparative study of algorithms includes aspects like different support values, size of transactions and different datasets.

Keywords

Data Mining, FP Growth, Frequent Item Set Mining, Mushroom.

Full Text

     

B. Mathivanan ¹, V. Palanisamy ², S. Selvarajan ³

Affiliations
1 Sri Ramakrishna Engineering College, Coimbatore, Tamilnadu, IN
2 Info Institute of Engineering, Coimbatore, IN
3 Muthayammal Technical Campus, Namakkal, Rasipuram, IN

Abstract

In most of the previous works on hand-based recognition methods, mostly, the significance was not given to the side of the hand, which is used in the model. The palm side of the hand is generally used because, it is very easy to capture using a simple scanning device and we can extract the shape based features as well as the palm print from the same image. Dorsum of hand (backside of hand or topside of hand) is the apposite side of the palm side of the hand. In this work, we highlight some of the advantages of using dorsum of hand for modeling a biometrics based human recognition system. Segmenting the hand image is the most important step in any hand geometry based recognition systems. We realized that the segmentation algorithm used for segmenting the palm side of the hand will not be suitable for segmenting the dorsum of hand. In this paper, we address a simple and fast method for segmenting the dorsum of hand image. The proposed method can be used in hand geometry based recognition algorithms which use the dorsum of hand as the input.

Keywords

Biometrics, Dorsum of Hand, Hand Geometry, Human Recognition.

Full Text

     

A. Jeneba Mary ¹, V. Palanisamy ¹

Affiliations
1 Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamilnadu, IN

Abstract

Main aim of this paper is to protect the file using Hybrid cryptography. AES and RSA algorithms are using hybrid cryptography. The Rijndael algorithm mainly consists of a symmetric block cipher that can process data blocks of 128, 192 or 256 bits by using key lengths of 128, 196 and 256 bits. This work using Rijndael cryptography symmetric algorithm for data encryption/decryption and RSA cryptography asymmetric algorithm for Rijndael key's encryption/decryption. The encryption and decryption of any data has a secure key, which is used for data encryption. For this purpose asymmetric key is used. The work securing for data secrete key using RSA algorithm. Here RSA key size is 128-bytes. The work also generating two pairs of keys are public and private key. Using Public key it encrypts the data key and other one is public and private key pair, which will send to other person, so that opposite person can decrypt the encrypted key using his public and private key.

Keywords

AES, RSA, Symmetric Algorithm, Asymmetric Algorithm, Symmetric Key, Asymmetric Key.

Full Text