Informatics Publishing Limited

S. Koteeswaran ¹, R. Srinivasan ¹, K. A. Varunkumar ¹

Affiliations
1 Department of CSE, Vel Tech Rangarajan Dr. Sagunthala R & D Institute of Science and Technology (Vel Tech Dr.RR & Dr.SR Technical University), Chennai-62. TamilNadu, IN

Abstract

Wireless Sensor Networks in real time applications are vastly increasing due to their sensing feature. In this paper we propose an efficient routing protocol for heterogeneous wireless sensor network. Two scenarios are considered: 20 advanced nodes&80 normal nodes are used in simulation. In scenario one, Nodes transmitted data directly to the base station. In scenario two, Nodes transmitted their data to base station with assigned cluster node. After assigned rounds are completed, number of alive nodes is considered for analyzing energy efficiency, throughput, stability and network life time. Currently, two efficient routing protocols like Leech, Sep are induced to the simulations and compared with the proposed RSE routing protocol. Results proved that throughput, stability, network life time, energy efficiency are increased in our proposed model.

Keywords

Clustering, Energy Efficiency, Election, Regions, Routing, Wireless Sensor Network.

Full Text

   

S. Koteeswaran ¹, P. Visu ¹, E. Kannan ¹

Affiliations
1 Department of CSE, Vel Tech University, Chennai-62. TamilNadu, India, IN

Abstract

Hadoop is an advanced framework with separated File storage system to organize these data’s in distributed environment.Hadoop is a form of cluster with which is subjected to wide range of visualized data. Job sequence is one of the most peculiar sequences often handled by the scheduler in order to split and merge the job and its probable environment in organizing and utilizing the data. Once the scheduler assigns the job to its sequence and then it is visualized in terms of tracking, reordering and distributing those data in any distributed environment. Here the major focus of the research is concentrated on enormous amount of data to distinguish its pattern and way of organizing those data’s. The major scope is switched in the context of analyzing the data distribution using next generation yarn structure of HADOOP. The experimental results show that the problem addressed here has a vast advantage over the existing visualization techniques.

Keywords

Data Visualisation, Hadoop, Job Sequence, Scheduler, Yarn, Big Data.

Full Text

   

M. Saleem Babu ¹, S. Koteeswaran ¹, P. Visu ¹, E. Kannan ¹

Affiliations
1 Department of Computer Science and Engineering, Veltech Dr.RR & Dr.SR Technical University, Chennai, IN

Abstract

Wireless ad hoc network, though it is not structured by itself, represents a powerful communication infrastructure. The distributed and flexible architecture of wireless ad hoc networks is a key factor; however, their wide deployment relies on protocols capable of providing energy optimization, high channel utilization, support for real time traffic, etc. In such a context, recently a Collision Free MAC protocol has been proposed. Its effectiveness has been already investigated showing significant improvements compared to the Standard IEEE 802.11, in terms of throughput, one way packet delay, energy consumption and support of real time traffic. This paper suggests a means for utilization of multiple parallel wireless channels and proposes an enhanced version called ECF-MAC, by imposing all stations to stay awake and ready to receive during the access window. Therefore, a transmitting station will surely find awake its destination station.

Keywords

Collision Free MAC, Power Saving, Wireless Networks, Variable Time Slot.

Full Text

     

P. Visu ¹, E. Kannan ¹, S. Koteeswaran ¹, N. Pughazendi ²

Affiliations
1 Department of Computer Science and Engineering, Veltech Dr.RR & Dr.SR Technical University, Chennai, IN
2 Panimalar Engineering College, Chennai, IN

Abstract

Service oriented steganography is a framework based on, on which a logical transparent steganographic layer development. In this paper the works on steganography and its approach is studied and divided on Work Breakdown Structure into simple rational services allotted to network infrastructure. Service oriented architecture is also described which service oriented architecture communicates each and everything through a common language to desired compositions. It also reuses, outsource, maintain and make simple and available all the system attributes. In addition to this a related ADL model in the form of framework is also developed to describe and clarify the above proposed approach of steganographic algorithms which can be supported by different services on the network. This service based steganography system implements encoding service to hide a secret image inside a cover image automated by cover image selection service and decoding service which performs the extraction process.

Keywords

Service Oriented Architecture, Slightest Momentus Crub Inclusion, Application Programming Interfaces, Granular and Distributed Service Oriented Systems.

Full Text

     

S. Koteeswaran ¹, J. Janet ², P. Visu ³

Affiliations
1 Department of CSE, Vel Tech Dr.RR & Dr.SR Technical University, Chennai-62, IN
2 Department of CSE, Dr. MGR University, Chennai, IN
3 Department of CSE, Vel Tech Dr.RR & Dr.SR Technical University, Chennai, IN

Abstract

The Semantic Web aims to extend the existing Web with conceptual metadata that are more accessible to machines and thereby more effectively communicate the proposed meaning of Web resources. We need efficient ways to access and extract knowledge from Web documents in order to make  the Semantic Web to life and provide advanced knowledge services. Specialized knowledge services therefore require tools that can search and extract specific knowledge directly from unstructured text on the Web, guided by an ontology that details what type of knowledge to harvest. This paper links acknowledge-extraction tool   with ontology to achieve continuous knowledge support and guide information extraction. The extraction tool is applied onto web documents and extracts knowledge that matches the given Web Query. Knowledge extraction is further enhanced using a lexicon-based term expansion mechanism that provides extended ontology terminology. It provides this knowledge in an XML format that will be automatically maintained in knowledge base (KB). This knowledge base can be used for further inferences (i.e.) to produce a narrative generation. The user interface is designed in such a manner that it receives the relevant interests of the user and the ontology aware query.

Keywords

Ontology, Knowledge Extraction, Web Page Annotations, Semantic Web, Web Search.

Full Text

     

P. Visu ¹, J. Janet ², S. Koteeswaran ³

Affiliations
1 Vel Tech Dr.RR Dr.SR Technical University, Avadi, Chennai, IN
2 Department of CSE, Dr.M.G.R University, Chennai, IN
3 Department of CSE, Vel Tech Dr.RR & Dr.SR Technical University, Chennai-62, IN

Abstract

Mobile Ad-hoc Networks shows unexpected behavior with multiple data streams under heavy traffic load such as multimedia data when it is sent to common destination. The main reason for packet loss in mobile ad hoc networks is due to congestion. In the current design, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. In the current design, the routing protocols are not congestion adaptive. The way in which the congestion is handled results in longer delay and more packet loss. When a new route is needed the routing protocols take significant overhead in finding it. In this paper we propose an Efficient congestion Adaptive Routing Protocol for Mobile Ad-hoc Networks, which out performs even during constrained situation. In order to analyze the performance we have chosen popular routing protocols such as AODV and DSR. We strongly argue that routing should not only be aware of but also be adaptive to network congestion.

Keywords

Ad-Hoc Networks, Routing Protocols, Mobile Computing, Congestion Adaptivity.

Full Text

     

A. N. Arularasan ¹, S. Koteeswaran ¹

Affiliations
1 Department of Computer Science and Engineering, Vel Tech University, Chennai - 62, Tamil Nadu, IN

Abstract

Objectives: The objective of the work is to identify the most influential nodes and to classify the information hubs in the social network in promoting the viral marketing.  Methods: N-gram model classification approach is used for categorizing the information hubs of different domains.  Findings: The proposed method aims at estimating influence of each user in the network and categorizes the information hubs by using domain based classification to advertise a product in a social network.  Applications/Improvements: The work can further be extended to slice the longer string into N characters to measure the similarity value depending on the set of characters between words and relationship among them.

Keywords

Information Hub, Influence Maximization, Influential Node, Social Network, Viral Marketing

Full Text

   

K. Silambarasan ¹, S. Ambareesh ², S. Koteeswaran ³

Affiliations
1 Department of CSE, Vel Tech University, Chennai - 600062, Tamil Nadu, IN
2 Department of CSE, Vemana Institute of Technology, Bangalore - 560034, Karnataka, IN
3 Department of CSE, Vel Tech University, Chennai - 600062, Tamil Nadu

Abstract

Background/Objectives: Overseeing resources at mega scale while giving performance isolation and efficient utilization of basic hardware is a key test for any cloud management software. Aside from scalability issue, a cloud-level resource management layer requirements to settle the heterogeneity of frameworks, compatibility imperatives between virtual machines and basic hardware, islands of resources made because of storage and network connectivity and restricted scale of storage resources. Methods/Statistical Analysis: Upshots prospects promising optimizable brooks initiated probe in various filed, in this work we projected an effectual topology for solving the resource model for resource problem solution. Deployment of optimization algorithm opted for multi objective problem is Artificial Bee Colony Algorithm (ABC) which delivered best optimized result and less computation time is utilized to unfurl the determined objective, upshots of the proposition topology has depicted promising and effectual results and minimized computational exertion. Findings: In our proposed method, the execution time is reduced largely when compared to the existing method. Applications/Improvements: Optimization of cloud computing resource utilization.

Keywords

ABC, Cloud Computing, Multi Objective Problem, Map Reduce, Mass Storage Capacity etc, Resource Problem

Full Text

   

Jeevanandam Jotheeswaran ¹, S. Koteeswaran ¹

Affiliations
1 Department of CSE, Vel Tech University, Chennai - 600062, Tamil Nadu, IN

Abstract

Background/Objectives: Online review has become important decision support system for the customers to decide on the subscription or purchse. This paper is aiming to suggest a method that improves the accuracy of the classifier. Methods/Statistical analysis: Feature selection for sentiment analysis using decision forest method and Principal Component Analysis (PCA) is used for the feature reduction. The proposed method is evaluated using twitter data set. Findings: It is proved, that the proposed decision forest based feature extraction improves the precision of the classifiers in the range of 12.49% to 62.5% when compared to PCA and by 49.5% to 62.5% when compared to decision tree based feature selection. Application/Improvements: This method is applicable to product reviews, emotion detection, Knowledge transformation, and predictive analytics.

Keywords

Inverse Document Frequency (IDF), Learning Vector Quantization (LVQ), Opinion Mining, Principal Component Analysis (PCA), Sentiment Analysis, Twitter

Full Text