Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Janakiraman, S.
- A Framework for Dynamic Multipath Self Reconfiguration Mechanism in Wireless Mesh Network
Abstract Views :207 |
PDF Views:3
Authors
Affiliations
1 Anna University of Technology, Chennai, IN
2 Anna University of Technology, IN
3 Pondicerry Central University, IN
1 Anna University of Technology, Chennai, IN
2 Anna University of Technology, IN
3 Pondicerry Central University, IN
Source
Networking and Communication Engineering, Vol 4, No 9 (2012), Pagination: 568-572Abstract
Mesh Network has the advantages of fast implementation, easy maintenance and low direct investment while comparing with the existing networks. Since Wireless mesh networks are implemented as wireless anchors, but they are not stabilized.WMN frequently affects by link failures. This paper presents the fast autonomous network reconfiguration system which provides the multi radio Wireless Mesh Networks to recover from link failure automatically to maintain the network performance. Fast autonomous network reconfiguration system gives the necessary changes in local radio and channel allocations to rescue from fails. Recover Mechanism have been introduced in order to increase the network performance while failure occurs.. In this research, we study if the extra infrastructure support can be exploited to build disjoint paths in those frameworks, while keeping the recovery path lengths close to the primary paths. Our evaluations show that it is possible to extend the proactive recovery mechanisms to provide support for nearly-disjoint paths. Energy consumption must be minimized while achieving high throughput and low delay.Keywords
IEEE 802.11, Multi-Radio WMNs, Self-Reconfigurable Networks, Wireless Link Failures.- A Secure Data Hiding Scheme for Digital Images Using Permutation and Normalization
Abstract Views :171 |
PDF Views:2
Authors
Affiliations
1 IT Department, Jaya Engineering College, Chennai, IN
2 Department of CSE, Anna University of Technology, Chennai, IN
1 IT Department, Jaya Engineering College, Chennai, IN
2 Department of CSE, Anna University of Technology, Chennai, IN
Source
Digital Image Processing, Vol 3, No 7 (2011), Pagination: 406-409Abstract
A secure data hiding method for digital images is proposed here. Min-Max Normalization method is used to provide space to embed secret bits into image pixels. The image pixels are normalized into some short range and then denormalized. The secret bit is directly added to the denormalized image pixel. Message dependent Permutation is performed to generate secret key. XOR operation is performed between the denormalized pixel values of the cover image on the positions according to secret key and the byte values of the secret message to enhance security. The experimental results reveal that the proposed scheme produces well hiding capacity and security.Keywords
Watermarking, Steganography, Permutation, Normalization.- Defect Detection in Pattern Texture Analysis Based on Kernel Selection in Support Vector Machine
Abstract Views :143 |
PDF Views:0
Authors
Affiliations
1 MVJ College of Engineering and Research Scholar in Manonmaniam Sundaranar University, Tirunelveli – 627012, TamilNadu, IN
2 Department of Banking Technology, School of Management, Pondicherry University,Pondicherry – 605014, TamilNadu, IN
1 MVJ College of Engineering and Research Scholar in Manonmaniam Sundaranar University, Tirunelveli – 627012, TamilNadu, IN
2 Department of Banking Technology, School of Management, Pondicherry University,Pondicherry – 605014, TamilNadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 45 (2016), Pagination:Abstract
Background/Objective: Finding defects in real world application is assorted process. A robust and novel method is designed to select fine distinctions of features and classifying the images lead to improve the quality of products in industrial engineering. Methods/Statistical Analysis: Image feature accentuate, feature selection and classification are the different stages in pattern texture analysis. The efficiency of the overall system depends on efficiency of individual stages. Findings: Computational complexity of kernel algorithms are more intelligent than features .We analyzed and reviewed linear kernel, Quadratic Kernel, Polynomial Kernel, Sigmoid Kernel of SVM to classify the patterns effectively for classifying the defects. Improvements/Applications: Here kernel functions such as the polynomial kernel functions are yield superb performance ratios.Keywords
Defect Detections, Feature Extractions, GTDM, Polynomial Kernel Functions, SVM.- A Brief Survey on Performance Analysis and Routing Strategies on Vanets
Abstract Views :252 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, SMVEC, Pondicherry - 605107, Tamil Nadu, IN
2 Department of Banking Technology, Pondicherry University, Pondicherry - 605014, Tamil Nadu, IN
1 Department of Computer Science and Engineering, SMVEC, Pondicherry - 605107, Tamil Nadu, IN
2 Department of Banking Technology, Pondicherry University, Pondicherry - 605014, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 11 (2016), Pagination:Abstract
Background/Objectives: To analyze the performance and find the challenges of routing in VANET. Findings: VANET protocols should be designed in such a way that a link should be established between the nodules in a nexus for efficient communication. Routing protocols are developed usually based on the two types of communication (i.e.) Vehicle to Vehicle (V2V) communication and Vehicle to Infrastructures (V2I) irrespective of their environment. This paper gives a survey of about the various routing protocols in VANETs, their main characteristics and their pros and cons which help for the further enrichment of the same. Applications/Improvements: The results observed from this work will motivate to improve the issues in VANET and to enhance the routing protocols.Keywords
Greedy Forwarding, Issues in VANET, Routing Protocols, VANET- Analyzing the Performance of Diverse LEACH Algorithms for Wireless Sensor Networks
Abstract Views :137 |
PDF Views:2
Authors
Affiliations
1 Anna University, Chennai, IN
2 Jaya Engineering College, Chennai, Tamil Nadu, IN
3 Pondicherry University, IN
1 Anna University, Chennai, IN
2 Jaya Engineering College, Chennai, Tamil Nadu, IN
3 Pondicherry University, IN
Source
International Journal of Advanced Networking and Applications, Vol 4, No 3 (2012), Pagination: 1610-1615Abstract
Sensor nodes can be used for continuous sensing, location sensing and event detection with the help of different types of sensors such as seismic, thermal, visual, infrared, magnetic, and many gaseous sensors. Sensor networks have wide range of applications including medical, military, home, etc. All these applications involve vigorous wireless communication protocol that is good in reduced energy utilization. A Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm is a protocol designed to obtain energy efficient application specific data aggregation with good performance for the wireless sensor networks. LEACH is a cluster-based routing protocol in which each node has given equal probability to act as cluster head. In this paper, analysis has been done with LEACH protocol and modified LEACH protocols like LEACH-C, and DEEAC. Analyses show that with proper enhancement in the LEACH design, the transmission can enhance the energy efficiency and increase the life time of the sensor node.Keywords
DEEAC, LEACH, LEACH-C, Routing Protocol, Wireless Sensor Networks.- A Visible Watermarking Scheme for Digital Images in Frequency Domain
Abstract Views :115 |
PDF Views:8
Authors
Affiliations
1 Anna University, Chennai, IN
2 MCA Department, Jaya Engineering College, Chennai, IN
3 CSE Department, Pondicherry University, Pondicherry, IN
1 Anna University, Chennai, IN
2 MCA Department, Jaya Engineering College, Chennai, IN
3 CSE Department, Pondicherry University, Pondicherry, IN