International Journal of Intelligent Engineering and Systems

1

Authors: Preeti Ivy Barrow, Swathi Jamjala Naryanan

While the genome sequences of different crops have been published and annotated, relatively little is known about the transcriptional networks that regulate gene expression. There are different ways of finding significant motifs in genome sequences, evolutionary motif finding algorithms being one of them. The work presented in this paper uses Differential Evolution (DE) Algorithm to discover new motifs in rice genome sequences and aims to provide an intuitive wizard to analyse the micro-array analysis of expression patterns (motifs) for the queried genes. The used DE algorithm involves crossover operation with fine tuning. Further, to search for already known motifs parallel version of adaptive hash based pattern matching algorithm has been implemented. The study is conducted on rice genome sequences for twelve chromosomes each consisting of approximately 70000 genome sequences. In this paper, experimental results provide a comparison of serial and parallel version of the algorithm applied for the same dataset which shows that parallel implementation improves the performance by almost 25-30% to search the patterns in genome sequences and provide a list of newly discovered significant motifs.

20

Authors: Sribindu Sattu, Moparthy Gurunadha Babu

In cognitive radio systems; primary clients can use auxiliary clients as agreeable transfers to expand their transmission rates while auxiliary clients will consequently acquire more range to get circumstances, prompting coordinated cognitive radio systems. Earlier research proposals in Coordinated Cognitive Radio Networks (CCRNs) predominantly concentrate on giving omnipresent access and high throughput primary client for clients yet have infrequently contemplated vitality proficiency. Moreover, most existing works expect that auxiliary clients are inactively chosen by primary clients, paying little respect to auxiliary client’s eagerness to help, which is clearly not feasible. To address energy issue, this paper identifies an Energy-Efficient Cooperative Strategy (EECS) by leveraging temporal and spatial diversity of the primary network. In particular, auxiliary clients with delay-tolerant packets can proactively settle on the agreeable choices by together thinking about primary channel accessibility, channel state data, primary client’s movement stack, and their own particular transmission necessities. Principle challenge for this cooperative relay determination issue is to choose a relay effectively and economically. Since the quantity of auxiliary clients is expanded step by step because of the quickly developing number of wireless communication gadgets, it is unfeasible to examine all the auxiliary clients and after that pick the best. Predominantly primary client transmitter successively watches auxiliary clients. An arrangement of auxiliary clients is chosen in view of transmission criteria. The hand-off choice plan selects the best hand-off from an arrangement of accessible transfers which are chosen in light of transmission criteria of coordinated connections. In the observation of a hand off primary client need to settle on choice in regards to whether to stop its observation and to pick that as best hand-off or to skip to see next transfer. This problem is addressed by optimal stopping theory and optimal stopping rule. To evaluate the performance of proposed scheme Optimal Selection Approach (OSA), it is compared with auxiliary client’s energy efficient and existing cooperative schemes. Extensive simulation study is conducted so that impacts of different system parameters are investigated and algorithm proposed can satisfy different system requirements.

42

Authors: Jeong-Su Kim, Jeong-Beom Kim

The challenge to solve in large capacity ternary content addressable memory (TCAM) is the large power consumption of search-line and match-line. In this paper, we propose a circuit that uses match-line selective-charging scheme and low-swing search-line scheme simultaneously to reduce power consumption of search-line and match-line which occupies a large ratio in power consumption of TCAM. The circuit was verified by Hspice simulation using a 1.8V supply voltage in a CMOS 0.18 um CMOS process. The proposed 128x128 bit TCAM shows 45.4% power savings in match-line and 74.7% power savings in search-line compared to the conventional precharge high scheme in search cycle. Also, the minimum search cycle time is 3 ns (333MHz).

61

Authors: Nandoori Srikanth, Muktyala Siva Ganga Prasad

Due to shortage of power source, energy is the significant concern part in Wireless Sensor Systems. Wireless Sensor Networks (WSNs) are currently used in numerous kinds of WSN simulators have been established to visually illustrate the coverage, energy consumption status and expected lifetime of WSN sensors. Most of the Researchers have proposed and develop routing algorithm to increase the network lifetime. Among them clustering is the best technique and it is well known for accomplishing energy effectiveness in WSNs. In this paper, Energy Efficient Multi-hop Routing Clustering Protocol (EEMRCP) based on Fuzzy K-Means and Centralized Mid-point Algorithm (FKM-CMA) is proposed for network lifetime improvement. An existing and frequently used algorithm is K- means algorithm in WSN. The main limitation of this K-means algorithm is random initial centroid selection. To improve K-means algorithm, a Midpoint method in initial centroid selection is used. This is named as FKM-CMA. There are two main considerations for cluster head selection in proposed work, one is it’s residual energy, and another one is Euclidean distance used in basic Fuzzy K-means algorithm. Finally, Multi-hop communication is performed for transmitting the packets from CHs to Base Station depending on the distance between them. Furthermore, stimulated outcomes showed that the total network performance of the proposed approach is improved than the other existing approaches.

88

Authors: Udaya Dayanandan, Vivekanandan Kalimuthu

Software quality assessment at the architectural level is efficient because it provides various advantages to find and fix design errors at the earliest stage of software development life cycle (SDLC).Numerous methods have been evolved to validate quality-related issues at the architectural level. The software quality comprises of a total of eight attributes where maintainability is one of the important attribute which affects the overall system quality. Though few methods are available for maintainability analysis, none of the state of art method employs fuzzy logic with Quality Model for Object Oriented Design (QMOOD) metric suite. In this paper, the fuzzy analytic hierarchy process (FAHP) method is proposed with Buckley method to evaluate the influence of maintainability and its sub-attributes in software quality at the architectural level. The proposed evaluation model is tested against several versions of the MFC and OWL windows application frameworks and the obtained results are compared with the state-of-the-art methods. This experimental analysis shows that the FAHP with Buckley method is superior to the other compared methods.

107

Authors: Hemanth Somasekar, Kavya Naveen

Text categorization means dividing a set of input documents into the two or more classes to which these documents belong. Because of increase in availability of data in digital form in large amount, it becomes necessary to organize it. Feature extraction is the crucial step in text classification. Most of the existing text classifiers are lacking in finding out the relations among the terms. In this research work proposed text clustering of Improved Markov Clustering Model (IMCM) and text classification in which the nonlinear relations among the terms are also considered. This approach is scalable to huge dataset also and its classification power is not affected if relations among terms are large. The proposed IMCM method improved the text document clustering significantly and helped to avoid the human interaction in text clustering. Experimental results have shown that proposed system is 91% accurate for 8 categories and decreases, as increase the classes from 8 to 12, from 96% to 94%, respectively. Also, compared proposed model with existing Naive Bayes and k-Nearest Neighbor classifiers. Experimental results show that the proposed model is more accurate than these two classifiers. The better results demonstrated that presented system is developed effectively.

128

Authors: Mallaiah Vorsu, Vinaya Babu Arramraju, Sujatha Bhanothu

Object Oriented Program (OOP) provides the way to reuse the program by pre-implementing functionalities in the software. It is difficult to develop the object oriented software, which is important in the computer programing. For OOP, modularization mainly depends on the class. There are many methods present for the assigning responsibilities, but most of them are based on the human for decision making. In this research, back propagation neural network (BPNN) was used to provide the solution to object oriented design of the software. The Cinema Booking System (CBS) was taken as the input documentation and Formal Concept analysis (FCA) then found the relationship of the element in the lattice manner, after that the relationship was set with each other. The result showed that the proposed system outperformed the existing system and also the design made manually.

147

Authors: Mohammed Lahraichi, Khalid Housni, Samir Mbarki

Object tracking is a crucial step in video analysis, as well as detection and recognition. Particle filter, based on color histogram, is considered among multiple approaches that prove their effectiveness in this domain. It is apparent that if an object and its background, or more objects to be tracked, having nearly the same color histogram, the quality of tracking will be negatively affected. Therefore, combining color histogram and texture features for pixels in motion is considered a potential solution to this issue. In this paper, we propose a particle filter tracking method consisting of two stages: at the prediction stage, the state space model is represented by Box–Muller transform, and at the correction stage, the observation likelihood model is calculated in three steps: firstly, the background subtraction is used to extract the moving objects in order to reduce the impact of background pixels on color histogram. Secondly, the texture Gabor features are computed using moving pixels to distinguish between objects having the same color histogram. Finally, the histogram and texture features are combined to define a likelihood observation model. The proposed method is implemented using several video sequences. The visual and numerical results obtained are compared with those of traditional particle filter method, and show that our method is very efficient particularly in case of similar objects, and clearly improves the quality of tracking.

167

Authors: Pushpa Mohan, Kiran Kumari Patil

One of the most experimentally difficult problem in the world is weather forecasting, which is a basic mechanism in meteorology. Especially in data mining system, there are different information mining strategies are available, for example, K-Means, Artificial Neural Network (ANN) and Support Vector Machine (SVM), etc. These weather predicting strategies are financially high and also very inconsistent for large datasets. To overcome these issues, an effective dimensionality reducing strategy: Self Organizing Map (SOM) is proposed along with Latent Dirichlet Allocation (LDA). The SOM strategy is one of the proper dimensionality reducing strategy to highlight the self-arranging outline. After reducing the measurement, the dimensionality reduced information are used to forecast climate for a reasonable outcome. A reasonable season for an appropriate crop is arranged with the guide of Deep Neural Network (DNN) classification system. This research work depends on finding appropriate information model, which helps in accomplishing high precision and simplification for value forecast. Finally, the experimental outcome shows that the proposed approach improved accuracy in weather and crop prediction up to 7-23% compared to the existing methods.

188

Authors: Pranai Kungwalrut, Viriya Kongratana, Thanit Trisuwannawat, Vittaya Tipsuwanporn, Arjin Numsomran

Optimized water management strategies are among the most crucial concerns in a biomass power plant. Especially during the times of water scarcity, an improper water supply planning and operation result in a detrimental power generation or shut down processes. This paper aims to propose the cyber-physical cloud computing (CPCC), a mechanism of analysis and control physical process using cloud-based framework, in order to improve the efficiency of water management system in a biomass power plant. In this study, a 9.9 MW biomass power plant is implemented to investigate the performance of CPCC. The architecture of the proposed system consists of three physical tiers. The first tier is a tier of physical devices included with pressure, flow, pH sensors, water pumps and valves that are responsible for detecting the physical data and interacting with the water production process. The second tier is an edge computing device which functions as a controller, embedded server, data storage, gateway and switch to manage all operational tasks in an intranet area. The third tier is a cloud computing system which enables big data applications such as online monitoring and visualization of process operation, adaptive filtration fouling control, consuming water and total water cost analysis. The results validate the effectiveness of the proposed system as the ability of an adaptive fouling control system to adjust backwash scheduling and chemical dosing so that achieving the target of purified water quality even during the fluctuation of raw water qualities. Subsequently, the water treatment system can achieve the capability for optimal total water cost operations under a target permeate flow rate and the percent of the recovery. Significantly, the data analytics in the CPCC reflect current operational requirements of water under local climate conditions, likewise contribute to the practical solution for sustainable water resource planning in the energy production.

212

Authors: Mylam Chinnappan Babu, Sankaralingam Pushpa

Discrimination is one of the most important challenging tasks in web mining due to its many legal and ethical features in social media and enterprise based industries. There are an enormous amount of anti-discrimination measures available to prevent discrimination such as using some features like race, religion, gender, nationality, disability, marital status, and age besides situations like employment and training, access to public services, credit, insurance, etc. Practically, those systems are not possible to use in industries due to large datasets. Indirect discrimination contains a set of rules or techniques which are not explicitly specifying discriminatory features, deliberately or accidentally and could create unfair decisions. Existing systems have low classification accuracy and data loss with high discrimination data detection time. To overcome these limitations, an Efficient Discrimination Prevention and Rule Protection (EDPRP) approach has been proposed for removing the discrimination and protects the rule without damaging the data quality. The proposed system designing pre-processing discrimination prevention approach and specify the different features and represent to deal with direct or indirect discrimination. EDPRP is capable of preventing Indirect and direct discrimination, and it allows automatic and routine collection of large amounts of data from the public. In EDPRP, the discrimination prevention model is based on partial data sets as part of the automated decision making. Based on Experimental evaluations, proposed method improves 8% (percentages) of Support and 8 ms (milliseconds) of Execution Time compared than existing methods.

231

Authors: Doaa Elsayed, Eman Nasr, Alaa El Din Ghazali, Mervat Gheith

Web Service Composition (WSC) has attracted considerable attention and research to support Service Oriented Architecture (SOA). WSC constructs complex applications by combing atomic Web services together to achieve users’ requirements. The selection of the best Web service that fulfils the Functional Requirements (FRs) and optimizes the Quality of Service (QoS) requirements, such as response time, cost, reliability, etc., is a critical part of WSC, especially in a dynamic environment. Since requirements frequently change, this demands that WSC must be adapted to provide the most suitable composite services and fulfil the users’ requirements that emerge. This paper presents a new hybrid approach for dynamic optimization of WSC using Parallel Genetic Algorithm (PGA) based on Q-learning, which we integrate with K-means clustering. We call it PGAQK. Q-learning is utilized to generate an initial population to enhance the effectiveness of PGA. K-means clustering is used to cluster Web services based on a fitness function. It is applied in the mutation operator, and used for Web service substitution to prune the Web services in the search space to find the best Web services for the environment changes that might occur at runtime. To the best of our knowledge such a hybrid approach has not been used for WSC before. We implemented PGAQK over the .NET Framework using C# programming language. A series of comparable experiments were carried out showed that PGAQK outperforms traditional PGA and Q-learning approaches in terms of fitness values. PGAQK allows WSC to modify itself dynamically and achieve a better fitness value to fit the changing environment, where the characteristics of composite web services continue to change.

250

Authors: Deepak Nandal, Om Prakash Sangwan

This paper estimates the effort for software by optimizing the COnstructive COst MOdel (COCOMO) model parameters using hybrid BATGSA (Bat inspired Gravitational Search Algorithm) algorithm. The performance of the COCOMO model completely depends upon its parameters which can be optimized by using meta-heuristic algorithms. This paper uses hybrid BATGSA algorithm which hybrids the improved bat algorithm with the gravitation search algorithm (GSA) to optimize the COCOMO model. The bat algorithm demonstrates the hunting and routing behavior of the bat which is improved by using a random walk in the exploration phase. The exploration phase is further improved by using GSA as gravitation force affects the velocity of the bat. The algorithm has been analyzed on four NASA datasets downloaded from promise repository. The comparison of the algorithm has been made with existing three states of art techniques i.e. COCOMO model, BAT algorithm, Improved BAT(IBAT) algorithm by using normalized error as a parameter. The reduction in error ranges from 2% to 10% on different dataset as compared other state of art algorithms proves the significance of proposed algorithm.

275

Authors: Mukesh Bansal, Chaitanya Purushottam Agrawal

This paper develops a technique by using Jaya algorithm and feed-forward neural network to determine the quality of object-oriented software by using Chidamber & Kemerer (CK) along with Li & Henry metrics. The technique basically focuses on the maintainability factor of software quality which in turn depends upon the software complexity. The software complexity is directly proportional to the number of changes done per class which is determined by the technique. The analysis has been done on UIMS (User Interface Management System) and QUES (Quality Evaluation System) datasets by using the mean absolute error as the analysis parameter. The reduction in the mean absolute error as compared to the existing state of art techniques along with the individual component of proposed technique proves the significance of the technique.

293

Authors: Maddela Vijaya Lakshmi, Pardhasaradhi Pokkunuri, Boddapati Taraka Phani Madhav

A coplanar waveguide fed asymmetric ground frequency reconfigurable antenna is designed and analyzed in this paper. The proposed antenna is occupying the compact dimension of 50X45X1.6 mm on FR4 substrate with dielectric permittivity 4.4. The designed antenna is operating in the wideband from 2 to 5.8 GHz with coverage in applications like Bluetooth, LTE, Wi-Fi and WLAN. The reconfigurable nature of the antenna is analyzed with the switching of PIN diodes placed on the antenna structure. The on and off conditions of the diodes D1 and D2 providing switching between the LTE, Wi-Fi and WLAN bands with good impedance matching. The advantage of PIN diodes includes high power handling capability, very low driving voltage and extremely low cost. Here the switch placement and control/biasing strategies depend on the type of the switch and the topology of the antenna. The prototyped antenna with biasing is providing excellent correlation with High Frequency Structure Simulator (HFSS) and Computer Simulation Technology (CST) simulation results. The reconfigurability of the antenna and its parametric optimization is analyzed and presented in this work.

1

Authors: Priti Sharma, Uma Bhardwaj

Spam email is one of the biggest issues in the world of internet. Spam emails not only influence the organisations financially but also exasperate the individual email user. This paper aims to propose a machine learning based hybrid bagging approach by implementing the two machine learning algorithms: Naïve Bayes and J48 (decision tree) for the spam email detection. In this process, dataset is divided into different sets and given as input to each algorithm. Total three experiments are performed and the results obtained are compared in terms of precision, recall, accuracy, f-measure, true negative rate, false positive rate and false negative rate. The two experiments are performed using individual Naïve Bayes & J48 algorithms. Third experiment is the proposed SMD system implemented using hybrid bagged approach. The overall accuracy of 87.5% achieved by the hybrid bagged approach based SMD system.

20

Authors: Kundala Sandeep, Eswaran Parthasarathy, Lakshmi Prathibha

Vision-guided robotic operation is one of the new concepts in teleoperated Unmanned Ground Vehicle (UGV) for military applications. The objective of the Visual Servoing (VS) is to control the position of the robotic arm using the data such as the distance of an object from the reference frame, or the length and width of the object extracted from the vision sensor. In Image-Based Visual Servoing (IBVS) scheme, position control values are computed from image features directly. This work proposes the technique of shadow removal of the object through the advanced light model from the image, acquired using a monocular camera. The 2D spatial coordinates and Point-of-Contact (PoC) of the object with reference to the ground plane is computed using straight-line equations. PoC analysis is made through mapping of pixel distances to spatial distances to analyses mean pixel distance, and the percentage of error obtained between actual distance and calculated distance computed. Other parameters like the width of the object and, the distance between the camera and object is also estimated. The computed result yields a maximum error of 3 cm and shows 2.6% error for camera fixed at the height of 160 cm with a tilt angle of 50˚, which covers an area of 150 cm x 120 cm.

37

Authors: Chairani Fauzi, Selo Sulistyo, Widyawan Widyawan

The environmental adaptability of the smart building is required for energy efficiency. The scheduling-based control model that widely implemented, have a user dependence and assumes maximum occupancy regardless of the occupant's desire in the energy usage requirement during the activity (i.e., ignoring user preferences). In this paper, we present our study on a building control model based on user preference, presence, location, and activity. We present it in a formal model, including conflict resolution techniques on multi-user preference (minimum, maximum, and average preference models). The contribution of this study is the optimization of control model for energy efficiency that also meet multi-user preference. The evaluation of the proposed control model is done through simulation and is compared with the scheduling-based control models. The results show that the minimum, maximum, and average preferences have an energy consumption of 73.5 kWh/day, 44.5 kWh/day, and 58.9 kWh/day, respectively, which are more efficient than the scheduling-based control model. If the Euclidean distance is used to estimate the error value between temperature and light actuation to multi-user preference, the lowest error is the average preference.

59

Authors: Shailendra Singh Gaur, Amar Kumar Mohapatra, Brijesh Kochar

Wireless Sensor Network has various security issues like authentication of sensor nodes and its power consumption. Therefore, we are focusing on evaluation and optimization of power consumption in wireless sensor networks using light weight cryptographic techniques. This research paper studies the certificateless cryptographic algorithms and hence develops an optimal algorithm for the same. The proposed algorithm is more efficient and secured by eliminating the concept of digital signature to make the light weight cryptographic algorithm using PKC and IBE. The simulation result shows that the proposed algorithm can achieve approximately 5-20% reduction of energy consumption with same level of security.

79

Authors: Luther Alexander Latumakulita, Tsuyoshi Usagawa

“Bidik Misi” (BM) is a famous scholarship offered by Indonesia Government which has two main qualification aspects: economic needs and academic performance. Since BM scholarship was initiated in 2010, the number of candidates has increased year by year despite limited quota, causing difficulties in selecting the most qualified candidates. This research is proposing a new selection model by combining Back-Propagation Neural Network (BPNN) as candidate’s predictor and Fuzzy Inference System (FIS) as candidate’s selector. BPNN is used to classify candidates into two, and three recommendation classes then perform FIS on priority set of candidates which is derived from the intersection of classification’s result of two and three recommendation classes to make candidate’s ranking. Closed test results show that for assuming quota of 50% from total 625 candidates or quota = 312, system can choose 267 highly recommended and reject 268 non-recommended candidates while 45 are identified as moderate recommended, and 45 other are identified as candidates of lower priority with selection accuracy of 85.6% better than five previous similar works. The open test results provide accuracy average of 86.88% and the lowest accuracy of 84% which is close enough to the closed test’s accuracy of 85.6% with the difference around 1%, and a small standard deviation value of 2.37 indicates stability of system performance in the selection process. The lowest and highest accuracies of the open test results indicate the proposed system can predict and select BM scholarship's candidates in the future with satisfactory accuracies from 84% up to 90%; thus the proposed system can be trusted as a proper model for BM scholarship selection process.

100

Authors: Mandhula Trupthi, Suresh Pabboju, Gugulotu Narsimha

Social media are generating an enormous amount of sentiment data in the form of companies getting their customers’ opinions on their products, political sentiment analysis and movie reviews, etc. In this scenario, twitter sentiment analysis is undertaken for classifying and identifying sentiments or opinions expressed by people in their tweets. Usually, the raw tweets consist of more noises in terms of URLs, stop-words, positive emojis and negative emojis, which are essentially reduced. After pre-processing, an effective topic modelling methodology Latent Dirichlet Allocation (LDA) is implemented for extracting the keywords and identifying the concerned topics. The extracted key words are utilized for twitter sentiment analysis using Possibilistic fuzzy c-means (PFCM) approach. The proposed clustering method finds the optimal clustering heads from the sentimental contents of twitter-sanders-apple2 database. The acquired results are obtained in two forms such as positive and negative. Finally, the experimental outcome shows that the proposed approach improved accuracy in twitter sentiment analysis up to 3-3.5% compared to the existing methods: pattern based approach and ensemble method.

121

Authors: Margaret Sangeetha, Velumani Padikkaramu, Rajakumar Thankappan Chellan

Data clustering is one of the active research areas, which aims to group related data together. The process of data clustering improves the data organization and enhances the user experience as well. For this sake, several clustering algorithms are proposed in the literature. However, a constant demand for a better clustering algorithm is still a basic requirement. Understanding the necessity, this paper proposes a density based clustering algorithm which is based on Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. The main drawback of DBSCAN algorithm is it requires two important parameters as initial input. It is really difficult to fix the values for these parameters, as it requires some prior knowledge about the dataset. This requirement is overthrown by the proposed clustering algorithm by selecting the parameters automatically. The automated selection of parameters is achieved by analysing the dataset and it varies from dataset to dataset. This way of parameter selection improves the quality of service and produce effective clusters. The experimental results show that the proposed approach outperforms the DBSCAN algorithm in terms of purity, F-measure and entropy.

138

Authors: Kavita Arjun Sultanpure, Lakkam Siva Shanker Reddy

Virtualization is used for saving energy, cost and is run for multiple applications using various operating systems on the same server at the same time. Thus, it increases the CPU utilization, efficiency and flexibility of the computer hardware. This paper presents the concept of job scheduling for energy efficiency using Artificial Bee Colony (ABC) by utilizing virtual migration concept in addition to broadcasting of requests. Due to the fact that the virtual migration concept helps a lot in management of the scheduling in cloud computing, so, the validations of job scheduling and service level agreement (SLA) violations with and without virtual migrations are opted in this work. In the initial phase, when server gets the requests for task execution, then the sub-servers (S1, S2, …, Sn), executes that requests (R1, R2,…Rn) irrespective of the main server. When the load at sub- servers increased, then the usage of virtual migration machines is executed, so that the jobs can be implemented equally. Two types of energy has been obtained in the work, first, which is utilized for the execution of the task and second, when virtual migrations creates energy reduction of overall energy (E= E1, E2…En). So, for given interval of time, the creation energy for virtual migrations came out to be less than the allocation energy of virtual migrations for jobs, to have better accuracy. At last, the comparison of proposed work, with existing work is provided. In the existing work, we have considered the papers that evaluate SLA violation and job scheduling by using neural network (NN) and genetic algorithm (GA). The SLA violation of ABC algorithm with respect to GA is reduced by 10% whereas SLA violation of ABC algorithm with respect to NN is reduced by 15%. Job scheduling of ABC algorithm with respect to NN is improved by 15%.

159

Authors: Zeinab Ezz Elarab Attia, Waleed Arafa, Mervat Gheith

The paper presents a new system for correcting short answer questions using the course material in addition to the model answer. Such system overcomes the limitations of the current systems that are just based on calculating the similarity degree between the model answer and students’ answer. Thus they neglect any correct answer that may be written by a student but not mentioned in the model answer. Also, they neglect correcting student answers that contains definition or explanation for a concept stated in the model answer. To overcome such limitations, the proposed system uses the course material to expand the model answer with more correct answers via answering the short answer questions. In addition to expanding the model answer’s concepts with their synonyms and definitions (using is-a relation and have relation). The proposed system is tested and evaluated on Texas dataset. The proposed system outperforms those systems that are evaluated on the same dataset, by achieving a correlation value about 0.8.

177

Authors: Gadda Archana Devi, Muparthy Gurunadha Babu

Due to the higher data transmission networks and maximum efficiency, multiple-input-multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) has become most vital wireless communications system in nowadays. Accurate estimation of channel under severe time and frequency selective fading channels has been required by these MIMO-OFDM systems for enabling high practical mobility. Established methods trust on non-realistic estimations or result in impractical complexities. In this, we presented a new MIMO-OFDM channel estimation (CE) scheme for pilot length minimizing by designing novel pilot bits from the Hadamard matrices of Paley (HM-P) type I allows its orthogonal and diagonal constant matrix structures manipulations. Additionally, we also implemented a method which estimates the channel impulse response length to enamour existed number of multipath within the channel by stretching the length of pilot. Furthermore, our proposed channel estimation scheme modified to derive the initial fluctuation of channel and its Doppler rate, afterwards during the payload applied for tracking of MIMO channel using fast adaptive hybrid linear quadratic estimation (FAH-LQE) filter. Experimental analysis has done in MATLAB environment under Rayleigh distribution and achieved excellent channel estimation and channel tracking performances over the state-of-art channel estimation algorithms. Our proposed scheme also achieved lower diversity of transmitting bits by applying FAH-LQE filter and the superior estimation of channel under multipath conditions while increasing the number of pilot bits sent per transmitting antenna.

196

Authors: Azhagiri Mahendiran, Rajesh Appusamy

The huge proliferation of cyber economy, social media usage and online transactions has resulted in large volumes of data in the cyber space. This has led to an increase in concern over the security of confidential data in the cyber space. Network security situational awareness systems helps in effectively monitoring a network for suspicious activities and thwarting any attacks on the information stored in the network. In this paper, an intrusion detection system for network security situational awareness using conditional random field has been proposed. Conditional random fields being conditional models are capable of modeling inter relationships between the observed features. This results in greater accuracy in classification. Conditional random field’s complexity increases with the number of features in the observation. To reduce this complexity, a feature selection method using oneR algorithm has been proposed. The ability of oneR algorithm to find the best attribute that result in optimal classification has been used for ranking the features in the observation. The proposed system was trained and tested using the bench mark NSL-KDD dataset. The proposed system on experimentation, exhibited higher accuracy (98%) in identifying an attack in general and also showed better performance (>93%) in identifying individual attack categories specifically.

215

Authors: Ashok Kasirayagouda Patil, Siddanagouda Somanagouda Patil, Prabhakar Manickam

Lung cancer is defined as an uncontrolled cell growing in the tissues of lung, which is also said to be lung tumor. The lung cancer is curable in the starting stage, but identifying the lung cancer in starting stage is very difficult. In recent decades, researchers showed great interest on gene level lung cancer identification using shortest path between the lung cancer related genes. Many research has been done to identify the shortest path between the genes, but the conventional methods consumes more time for processing the data. In this research, Protein to Protein Interaction (PPI) structure is constructed from the weighted protein present in the Search Tool for the Retrieval of Interacting Genes/Proteins (STRING) database. For identifying the shortest path between the genes in PPI, an effective algorithm: enhanced Floyd warshall algorithm is proposed. Floyd warshall is efficient in finding the shortest path between the genes and also solves all pairs of shortest path problem. A major drawback of Floyd warshall algorithm is, it works slower than other conventional algorithms designed to perform the same task. To improve the performance of traditional Floyd warshall algorithm, an iterative matrix is used for eliminating the invalid path. Then, the comparison between the proposed method and existing system is given in the experimental result. Experimental outcome shows that the proposed approach improved the time consumption up to 2-3 sec compared to the existing methods: Dijkstra’s algorithm and Floyd warshall algorithm.

233

Authors: Yuttana Kongjeen, Wannawit Junlakan, Krischonme Bhumkittipich, Nadarajah Mithulananthan

This paper has presented the estimation methodology of the quick charging station for electric vehicles (EVs) based on both area and population density data. The proportion of EV owners per number of population in location data; is also used to compute the number of the quick charging stations. The population density data and proportion of EVs owners per number of population in area data are varied from 1 to 6 % and 0.01 to 0.8 %, respectively. The simulation results showed that the number of EVs stations increased and the randomly selected Feeder No.1 was installed at EVs stations; of which range from No.1 to No.4. The total real power loss increased up to 18%. Therefore, this study could be verified that the quick charging stations should be considered both optimal in sizing and location of EVs charging stations.

251

Authors: Nagraju Naik Mood, Venkata Subbareddy Konkula

This paper proposes a Secure, robust and intelligent watermarking approach based on Redundant Wavelet Transform, Singular Value Decomposition and Genetic Algorithm. Here the robustness. The proposed watermarking scheme accomplishes RWT and SVD for feature extraction and the GA for optimization. Further this approach proposes a signature embedding mechanism by which the watermarked image will be more secure. The Genetic Algorithm proposed in this approach adopts intelligent property and the signature process adopts more security. Further the combination of RWT and SVD adopts the robustness to the proposed approach. Numerous experiments are conducted over the proposed approach and the performance is evaluated through the performance metrics such as Peak Signal to Noise ratio (PSNR) and Normalized Correlation (NC). The obtained experimental results demonstrates that the proposed approach is superior compared to conventional approach and is able to provide efficient resistance over Gaussian noise, salt & pepper noise, median filtering, cropping, rotation, contrast enhancement, scaling and Histogram Equalization attacks.

271

Authors: Pradeep Krishnadoss1* Prem Jacob

Cloud computing offers dynamic allocation of resources on demand, the feature which makes it to stand apart providing great performance, scalability, cost efficient and less maintenance, thus making it an apt choice. Task scheduling becomes the essential factor in increasing the performance for the dynamic allocation of resources which is most essential in the cloud environment to increase performance and decrease the cost. In this work, a solution is proposed using makespan and cost, taking them as important constraints for the optimization problem. We have merged two algorithms namely, cuckoo search algorithm (CSA) and oppositional based learning (OBL) and created a new hybrid algorithm called oppositional cuckoo search algorithm (OCSA) to provide solution to the above stated issue. Our proposed OCSA algorithm showed noticeable improvement over the other task scheduling algorithms. The proposed work is simulated in cloudsim programming environment and the simulation results show the effectiveness of the proposed work by minimizing cost and makespan parameters. The obtained results are better in comparison to other existing algorithms like particle swarm optimization (PSO), Improved Differential Evolution Algorithm (IDEA) and genetic algorithm (GA).

1

Authors: Santhosh Kumar Gangadharaiah, Hosahally Narayangowda Suresh

Automatic extraction of soft biometric characteristics of face image is an emerging research field in recent years. Among these soft biometrics, age estimation is very useful for several applications, like video surveillance, business intelligence, and search optimization in large databases. Generally, facial aging effects perceived in two main forms like, growth related transformations and textural variation. So, in order to generate an effective age classifier, both dimension and texture information should be used together. In this work, an age estimation system that is combination of dimension feature (Hybrid Principal Component Analysis (HPCA)) and textural feature (Log Gabor filter) for feature extraction, is used. The extracted feature values are classified by employing a multi-objective classifier named as Multi-Support Vector Machine (M-SVM). The result of the experiment shows that the proposed approach delivers a better age estimation rate on overlapping age group classes.

18

Authors: Premkumar Manoharan, Sumithira Rameshkumar, Sowmya Ravichandran3

In the field of power electronics, multilevel inverter plays a vital role for power quality improvement. The high switching frequency is used to obtain quality output waveform with a minimum amount of ripple content. The high voltage is reached by using voltage source inverter with almost zero harmonics without series connected switching devices. If the voltage level increased, the harmonic content of the output voltage waveform decreases in multistage converter. In this present work, single phase cascaded nine level inverter is designed for low powered microinverter and switching angles are produced by Selective Harmonic Elimination (SHE) technique. Each bridge in cascaded inverter will produce the output at different levels and allowing an overall nine level AC output voltage. Now-a-days, the solar photovoltaic is connected with microinverter is an efficient way of increasing the performance so that the proposed inverter derives an input from single PV module since it is module level inverter and it can provide good regulation for leads up to their rated capacity. The prototype is designed for 80W rating and the control signals are generated and processed using FPGA controller. The proposed inverter is designed and tested experimentally to verify the theoretical explanations and proposed design delivers high efficiency when compared with the conventional inverter at full load.

39

Authors: Jayapandian Natarajan

Cloud Computing reshapes the entire computing paradigm. In general, cloud computing means outsourcing available services and data storage in centralized scenario. In cloud computing task allocation is a major problem because multiple numbers of tasks are allocated to multiple numbers of processors for simultaneous processing. From the given list, tasks are queued according to the ascending order based on their duration. This paper is designed to solve the Task Scheduling problem, by using our proposed effective new approach of Backfilling algorithm. Depending upon the task duration, tasks are split into multiple threads for processing. Multiple thread tasks are processed in the basic concept of “gang scheduling” technique. Here we implement new backfilling algorithm concept to minimize the idle processing time of the processors. The existing Simple Backfilling Algorithm (SBA) is used to minimize the ideal time processing. Whereas comparatively Dynamic Cloud Scheduling using Backfilling Algorithm (DCBA) is designed to reduce the ideal time processing than SBA to carry out the process of both LQueue and SQueue simultaneously. At the outset, DCBA reduces the average waiting time. As mentioned the algorithm which is specified in the previous line that contains three level which represent the working speed of the algorithm. The first and second level of DCBA algorithm is comparatively similar to the performance of SBA algorithm. The maximum better performance was given in a queue size (q=1.5) by DCBA algorithm as compare to SBA algorithm. The existing type (Gang Scheduling) consist of two approaches namely Adaptive First Come First Serve (AFCFS) and Largest Job First Served (LJFS) that focus on non-parallel jobs with deadline. When compare to existing gang scheduling algorithm and SBA algorithm the average waiting time of DCBA has slight improvement in the loader level of the key. As the separation of the queue like LQ and SQ the waiting time and average waiting time is reduced comparatively.

57

Authors: Shriraghavan Madbushi, Rajeshree Raut, Mulpuri Santhi Sri Rukmini

In this paper, a novel method for detection of Primary User Emulation Attack (PUEA) by tagging (adding tag bits) a test signal in chaotic communication is proposed. The tagged test signal is masked by the secondary user using Lorenz chaotic attractor and sent over the channel. However, it doesn’t interfere with test signals of other secondary users. The Bit Error Rate (BER) analysis of the received test signal indicates whether the channel is free or is under PUEA. If the BER of the received signal is above the set threshold then it indicates an attack. Moreover, for the first time the concept of test signal to identify whether the channel is occupied by the primary user or an attacker is proposed. It is further suggested to compare the result of the proposed method with the database provided by Spectrum Bridge Inc. (SBI). It is worth mentioning here that the proposed method has made the use of the centralized control approach employed by the Federal Communications Commission (FCC) to combat PUEA. Simulation results in terms of the BER have been analysed and compared with other existing methods to show the efficacy of the proposed method.

76

Authors: Suyambu Karthick

Now a day the usage of Self-Organizing Networks (SONs) is increasing, because of its broad application. Unlike common networks, the SONs have the capability of reconfiguration, whenever any defect occurs in the network. However, while routing in this network, the loss of data occurs due to its security lack. Hence many researchers have presented their research for providing secure routing in various SONs. However, the security is still an issue in the routing of SONs especially in Wireless Sensor Network (WSN). Here in this paper, a novel protocol for the secure routing of WSNs has developed. The proposed protocol is named as Trust-Distrust Protocol (TDP). As per the proposed protocol, the routing is done in four stages. The initial stage is topology management using the k-means algorithm. The second stage is Link Quality Appraisal (LQA), where the quality of every network node is evaluated. The third stage is grading, in which it is based on the LQA value and a grade point is allotted to every node in the network. In the last stage, the most secure path for the routing is determined based on the grade points. The proposed protocol is tested in one of the major kinds of SONs, like WSN using the NS2. By comparing with the existing LEACH protocol, the performance is evaluated. Ultimately the proposed protocol outperformed the performance of the existing routing protocol and suggested for rounding in SONs.

93

Authors: Sadanand Ramchandrarao Inamdar, SathishBabu Basavaiah, Ravi Malleshappa Yadahalli

In Mobile Ad Hoc Network (MANET), the existing routing protocol may result in overhead and increased collisions during data transmission. In order to overcome this issue, in this paper, we propose to design a cooperation based directional routing protocol in MANET. Initially the source nodes discover neighbors by constructing the Directional Neighbour Table (DNT). Then the node with minimum transfer time is selected as best relay node. The transfer time is estimated using bio-inspired algorithm. Once the relay nodes are selected, the source node follows the Adaptive Directional Monitoring MAC (ADMMAC) protocol to transmit the data to the destination. In this technique, the nodes use the co-operative transmission mode when it requires transmitting the data packet faster. By simulation results, we show that the proposed technique minimizes the overhead and enhances the efficiency.

111

Authors: Mohamed Kasim Jannathl Firdouse, Mururgan Balasubramanian

Computed Tomography (CT) is the main source for analyzing the lung diseases and the preplanning of pulmonary surgeries. The accurate interpretation of chest CT scan makes a challenge to radiologists due to its complex visual nature. This paper proposes a novel method to segment the left and right lungs from the background of CT images to assist the pathologists for the easy and accurate diagnosis of pulmonary diseases. The segmentation of lung is a challenging task due to the anatomical difference of different people. This paper develops a novel algorithm namely successive peak based quantization transform (SPQT) to segment the lungs from the background. This method extracts 8 bit patterns from the input lung image and at last a BYTE data which is formed from 8 bit patterns is produced. Prior to SPQT lung segmentation, the lung image which may contain impulse noise is reduced into noise free one by using ‘Fuzzy Impulse Detection and Reduction Method’ (FIDRM). The novel lung image hikes the accuracy to a significant level than the existing algorithms.

132

Authors: Enumula Mahesh, Suman Maloji, Dhyapulai Nagendra Rao

Now a days Image forgery (IF) makes many problems in a society. Super Pixels Segmentation and ScaleInvariant Feature Transform based Image Forgery Detection (SPS-SIFT-IFD) has introduced to detect the forgeries in the images. The forgery region extraction algorithm replaces the features point with small SP as feature blocks and neighboring blocks that have similar local color features has been identified by the Scale-Invariant Feature Transform (SIFT) technique. Artificial Neural Network (ANN) classifier is used for better detection of forged parts in the original images. It applies the morphological operation to the merged regions to generate the detected forgery regions. The experimental results indicate that the SPS-SIFT-IFD scheme achieve much better detection results even under various challenging conditions compared with the existing Forgery Detection (FD) methods. Finally, SPSSIFT-IFD method performance is measure, in terms of Recall, Precision, False Measure, Sensitivity, Sensitivity, Accuracy and Gmean.

152

Authors: Manjula Thimsandra Ramakrishna, Raju Garudachar

Signal tracking loop in GNSS receivers play a major role of data extraction by tracking carrier phase. Under adverse signal conditions such as ionosphere scintillation, conventional tracking loops are less robust and hence are susceptible to loss of lock. Kalman filter’s inherent ability to adapt to signal conditions is one of the desirable features which improve the tracking performance. The paper analyses Linear Kalman filter technique of tracking signals in Navigation receiver under scintillation conditions and presents the improvements obtained with Linear Kalman filter based tracking method over conventional tracking method. Performance parameters such as phase error, carrier to noise ratio, correlator power and phase lock indicator are analysed in addition to highlighting the tuning merits of Kalman filter. NavIC L5 band signal modulated with simulated scintillation is used as test signal to analyse the performance of the Kalman filter based tracking method.

173

Authors: Samuel Peter James I, Ramasubramanian P, Magdalene Delighta Angeline D

The emotions of human in every part of a life are usual and unavoidable. The emotions uplift or cast down a person facing different situations in each moment. The main objective of this research work is to provide learning with emotional-based approach and to analyze the result using data mining algorithms. This paper examine how emotions involve the learners learning and the success of performance improvement of various learners under different environment that leads to the success of a learner. This study scrutinize the Emotional Intelligence (EI) and how it relates to academic performance. The key idea is to bring out different learning environments that focus on the learners’ positive emotional behavior and proceed according to the observed behavior. The proposed work uses Observe, Amend and Analysis (OAA) Method in the learning environment to enhance the learners learning and to evaluate performance using Data Mining Tools to enhance the future outcome. The experimental results show that with the proposed approach the learners learning is improved with positive emotions.

192

Authors: Pushpa Mohan, Kiran Kumari Patil

In India Rice and ragi are the two pre-eminent crops that stable’s the food of eastern and southern part of the country. These two crops mainly grown in rain fed areas, which receives heavy annual rainfall. In this scenario, Mysore district is undertaken for experiment analysis. As the region receives heavy rainfall (782mm). In this region the rainfall rate is high but the productivity of this crops are very low due to irrelevant crop cultivation. In order to overcome this concern, an advanced technology named Weighted-Self Organizing Map (W-SOM) is employed for accurate crop and weather prediction, which is the combination of both Self Organizing Map (SOM) and Learning Vector Quantization (LVQ). In this paper, the prediction accuracy is enhanced by minimizing the Within Class Error (WCE) among the clusters. Therefore, this new approach outcome shows a clear idea about suitable crop cultivation in Mysore. Experimental outcome shows that the proposed approach improved accuracy in crop and weather prediction up to 0.5-2% compared to the existing methods: SOM, Kernel-Nearest Neighbors (KNN) and Ensemble Neural Network (ENN).

208

Authors: Puttaswamy Gowda Vanajakshi, Murugavelu Mathivanan, Thangamuthu Senthil Kumaran

There is a big challenge in speech recognition system due to variability of the spoken languages and also speech signal is degraded due the environmental noise. Therefore speech recognition system requires pre-processing, which plays vital role to restore speech signal more effectively. Many challenges are there to restore the speech from different noisy environment. In this paper, proposed method is divided into two parts. First part is Kannada speech restoration, the modified wiener filter is proposed to restore the Kannada speech signal with very good speech quality. The experimental results are verified for different types of noise by varying input Signal to Noise Ratio (SNR) from -20dB to 5 decibels (dB). Second part is Autocorrelation based Kannada speech recognition system. Autocorrelation technique gives better output SNR for degraded input SNR with -20dB. The Autocorrelation is the simple method to recognize the isolated Kannada word in speech signal. This proposed technique results 100% recognition rate for male, female, with different accents.

225

Authors: Kasarla Satish Reddy, Hosahally Narayangowda Suresh

Reconfigurable Finite Impulse Response (RFIR) filter plays an important role in Software Defined Ratio (SDR) systems, whose filter co-efficient change dynamically during runtime. In this paper, Low Cost Carry Bypass adder Reconfigurable Finite Impulse Response (LC-CBA-RFIR) is introduced to perform the RFIR filter operations. DRAM-based Reconfigurable Partial Product Generators (DRPPG) consists of MUX and dual port distributed RAM, which has co-efficient to perform a FIR filter operation. With the help of Verilog code, the RFIR filter architecture was verified in Modelsim software. The same Verilog code was used to analyse the ASIC performances such as area, power and delay Area Power Product (APP), Area Delay Product (ADP) as well as FPGA performances such as LUT, flip flop, slice and frequency. After implementing ASIC and FPGA, all the performance improved in LC-CBA-RFIR method compared to the conventional methods.

246

Authors: Sunitha Mallasetty Shivamallaiah, Kwadiki Karibasappa

Nowadays, wireless communication plays a major role in sending information from one area to another in an effective way. In wireless communication, the important parameters are coverage area, power consumption, lifetime, and Black Hole (BH) detection in network with interconnected mobile nodes. Ant Colony Optimization (ACO) is used for finding shortest path in the Network. ACO helps in choosing another path, if there is any malicious node in the network. Data is secured using Dual Rivest-Shamir-Adleman (DRSA) technique and Black Hole Detection (BD) is used for identifying malicious node in the network. For efficient wireless system these parameters have been optimized, several algorithms have been applied to optimize the performance parameters and detect the BH in the network. Efficient BH identification with optimized routing algorithm is implemented in secured environment by using Dual RSA. The ACO-DRSA-BD algorithm precisely detected the BH Node (BHN) in finding the proper solution for data transmission using ACO and secured environment using DRSA. Hence, “ACO-DRSA-BD” finds proper solutions for transmitting data in the presence of BH Attacks and enhancing better performance parameters in terms of throughput, routing overhead and energy consumption.

266

Authors: Ammar Djerioui, Dehimi Ouali, Mohamed Ladjal

This paper proposes a sliding mode control strategy for hybrid power system (HPS). The hybrid power system consists of four-leg voltage source Inverter Bridge. The HPS ensures full compensation for harmonic phase currents, neutral current, reactive power compensation and unbalanced nonlinear load currents. The Sliding Mode control strategy with a three dimensional space vector modulation deals with power quality enhancement in standalone power-supply systems with the key objective to compensate for AC side load and phase disturbances that result essentially from the presence of nonlinear and unbalanced loads. The four-leg voltage source inverters play an important role by providing both balanced and unbalanced loads with clean power and balanced output voltage. The simulation results show that the performance of the four-leg HPS with the proposed control algorithm.

1

Authors: Mohcine Bouksim, Fatima Rafii Zakani, Khadija Arhid, Mohamed Aboulfatah, Taoufiq Gadi

In the last decades, 3D models have known a significant expansion, as we can see them in many fields such as computer vision, biology, augmented reality, engineering, and even medicine. They become more and more popular and accessible than ever. Due to these facts, there is an increasing need for a retrieval system, which can return the most similar 3D objects existing in the database to the query. In the present paper, a new retrieval approach is proposed, based on a multi-criteria method to generate a compact descriptor, which represents a signature for each 3D model. The key idea behind this approach is to try to extract the best out of each criterion (i.e., measure) by extracting a combined score using the Data envelopment analysis method (DEA). The results of the proposed method are very satisfactory and outperform some commonly used retrieval methods which highlight the potential and the performance of our approach.

20

Authors: Guchenko Mykola, Sokhin Natalia, Lugovyj Oleksandr, Dobiáš Václav, Čejka Jiří, Ludvík Miroslav

The actual task is to research QoS (Quality of Service) instruments in order to improve existing and develop new methods. This paper presents the modified method of double QoS, which differs from standard one by application of multi-level traffic analysis by user groups, types of traffic and priorities. The efficiency of the proposed method is proved experimentally on routers with the Mikrotik operating system by means of local computer network simulation, based on virtual machines. The experiments were conducted with generated multi-traffic with a uniform distribution for Packet Size and Internet Departure Time parameters. Compared results of router work with standard and modified methods. Using the proposed method allows reducing the number of dropped packets by simply configuring the router system tools and thus improving the quality of user service.

41

Authors: Syed Muzamil Basha, Dharmendra Singh Rajput, Vishnu Vandhan

Boosting is the method used to improve the accuracy of any learning algorithm, which often suffers from over fitting problem, because of inappropriate coefficient associated to the data points. The objective of our research is to train the data, such that the weighing error of linear classifier goes to zero and classify the sentiments accurately. In this paper, Gradient ascent approach is used to minimize the weighing error of sentiment classifier by predicting the proper coefficients to the data points in trained dataset. When compared to previous studies on designing a strong classifier, our research is novel in the following areas: Estimation of Maximum Likelihood for logistic regression using Gradient ascent and making use of weights of metric in understanding the behavior of AdaBoost algorithm in classifying the sentiments. In our finding, the first decision stump has training error of 30.44%. After thousand iterations, we observed a smooth transition, where the classification error tends to go down to 8.22% and actually stays at same value. Finally, concluding that Boosting algorithm outperforms Random Forests with lesser Mean squared Test Errors.

62

Authors: Syaifulnizam Abd Manaf, Norwati Mustapha, Md Nasir Sulaiman, Nor Azura Husin, Helmi Zulhaidi Mohd Shafri, Mohd Norhisham Razali

Observation satellites orbiting the Earth provide important surveillance information that helps in identifying various types of land cover. As such, the resolution of satellite images is critical to ensure high accuracy in classifying land cover types. Clearly, high-resolution images are desirable, but such images are prohibitively expensive. Hence, the use of medium-resolution satellite images seems more economical and practical. Several techniques have been developed to monitor the conditions of land covers across the world, such as aerial photography, ground survey, and remote sensing. Among the three techniques, remote sensing is the best, given its ability to monitor vast geographical areas more accurately and much faster compared to those of the other two techniques. In recent decades, many countries have been relying on remote sensing to monitor the conditions of coastal areas by extracting shorelines from satellite images. To date, several pixel-based methods have been proposed for the extraction of shorelines, but most of these methods are fraught with problems. Thus, the object-based approach is proposed using a combination of segmentation algorithms, namely Felzenswalb, Quickshift, and SLIC, together with 15 machine learning classifiers, to classify segmented images of Langkawi Island. The performance of the segmentation algorithms and machine learning classifiers were assessed in terms of segmentation time and overall accuracy in four experimental settings comprising of three different parameters. The research findings showed that the proposed hybridization of SLIC segmentation and Extra Tree classifier was the most efficient and accurate technique compared to other combinations of techniques in extracting the shoreline of the study area. Specifically, SLIC was faster than Felzenswalb and Quickshift by as much as 37 times and 500 times, respectively. Together with Extra Tree classifier, SLIC managed to achieve 100% overall accuracy in the object-based classification in three out of four settings compared to the rest of the techniques tested in the study.

83

Authors: Clara Kanmani Arulanandu, SumaVasu Deva Murthy, Guruprasad Nagraj

In this paper, a new secured data model for cloud computing is proposed which uses partial resource description framework (RDF) encryption and token based access control system in which sensitive data in an RDF graph is encrypted and all other non-sensitive data are publicly lucid. The security process, the decryption process, and query process are the three essential procedures in this framework. The consequence of the security process is the encrypted data, encrypted metadata, and plain text fragments. The proposed technique permits the token based access control system for the decryption procedure. The query process incorporates the map reduce framework is for lessening the immense measure of employments. At long last, the query answer is sent to the user in light of the access token list (AT-list) of the system administrator. Our test comes about demonstrate that, the performance of the proposed technique is assessed in view of the precision, recall and execution time of the framework. Our proposed approach is actualized using Java and keep running on Windows XP framework and the Lehigh University Benchmark (LUBM) datasets are used for our examination. In the paper this new secured RDF data model is deployed and tested using AWS elastic beanstalk.

104

Authors: Dhanavijayan Ramakrishnan, Sudhakar Pushparajan

This paper demonstrates an ideal procedure to find the desirable bus location and operating power of distributed generation in radial power distribution system with the aid of unified particle swarm optimization algorithm. In general, an electrical power network economics primarily relies on the conductor line losses. Hence in the proposed study, the network active power loss is picked as the minimization problem, and it is reduced by incorporating optimum distributed energy source at appropriate buses using proposed unified particle swarm optimization algorithm. The system power loss is handled as the cost function for each particle in a swarm. The simulation analysis of the purposed procedure is successfully executed for different radial distribution system using MATLAB. The prosperous solutions achieved from the simulation studies manifest that the high level of system loss reduction and desirable bus voltage profile, when compared against earlier existing methods such as genetic algorithm, particle swarm optimization, and parameter improved particle swarm optimization.

121

Authors: Swati Srivastava, Bipin Kumar Tripathi

This paper aims to develop a recognition system which incorporates a novel fusion from different areas of computational intelligence along with a proposed artificial neuron structure. Our Deep Hybrid Computational Model (DHCM) is a novel aggregation of fuzzy clustering fused with evolutionary searching and a neural network based on a proposed neuron model TROIKA. The deep architecture with evolutionary fuzzy clustering followed by hybrid neural network, built upon novel neuron TROIKA, yields a powerful tool for face recognition applications. The proposed TROIKA neuron is based on nonlinear aggregation functions which enables our hybrid neural classifier to inculcate the benefits of its computational power resulting in superior learning and generalization. The proposed TROIKA neuron reduces the complexity of DHCM because very few neurons are sufficient to recognize a subject in database. The experimental results completed on two benchmark face datasets-INDIAN and FERET datasets demonstrated the effectiveness of the proposed model. The performance comparisons revealed the outperformance of (i) TROIKA based model over conventional neuron based model (ii) proposed model over other classification methods.

142

Authors: Jayapal Joseph, Ravi Subban

Nowadays, the exploitation of images is inevitable in all the domains. However, the major issue being faced by the images is ‘noise’, which seriously affects the image quality. In order to address this issue, this article presents a novel denoising algorithm that is based on superpixel clustering and dictionary learning process. The superpixel clustering groups the similar pixels together to form a superpixel. As soon as the superpixels are computed, the sparse coefficients are computed by the steepest descent orthogonal matching pursuit algorithm. The process of dictionary updation is achieved by Discriminative K- Singular Value Decomposition (DK-SVD). The dictionary is trained by DK-SVD algorithm, as the discriminative capability of the algorithm is greater. The proposed approach shows promising results, which when compared to the existing techniques. Additionally, the time consumption of the proposed approach is very minimal than the comparative techniques.

163

Authors: Metta Venkata Satya Sairam, Mupparaju Sivaparvathi

Radio spectrum (3 KHz to 300 GHz) is a limited natural resource and efficient utilization of the spectrum can be accomplished by cognitive radio (CR). In CR, spectrum sensing is one of the significant challenging issues. Cooperative spectrum sensing (CSS) based CR is a captivating solution to enhance spectrum sensing. In CSS, multiple secondary users (SUs) report their results to fusion center (FC) and final decision is taken on the status of the primary user (PU) based on the predetermined fusion rule. This cooperative decision in CSS based CR, improves the spectrum sensing performance. Nevertheless, the foremost drawback in CSS is low throughput due to reporting time introduced by the multiple SUs. We propose a novel method to reduce the reporting time so as to enhance the throughput performance for the same number of SUs in CSS based CR. In the proposed scheme k SUs, where k is even, are divided into two groups, each with k/2 users. Two groups report their sensing results to two FCs separately and final decision is taken by the third FC. Consequently, the reporting time is condensed in the proposed scheme. The sensing performance of the proposed CSS (PCSS) for all possible fusion rules is reviewed. Analytical expressions for probability of false alarm, probability of detection and throughput are derived for PCSS. Both simulation results and theoretical analyses validate that PCSS improves throughput significantly when compared with CSS.

181

Authors: Bukka Narendra Kumar, Mantena S. V. Sivarama Bhadri Raju, Bulusu Vishnu Vardhan

With the huge development of the usage of computer over network and advancement in applications running on various platforms captures the attention towards network security. The Intrusion Detection System (IDS) plays a vital role in detecting anomalies and attacks in the network. Earlier approaches of IDS relied on Machine Learning (M L) techniques. Due to some limitations, a better approach is needed. A combination of Machine Learning techniques and data preprocessing is an effective approach for IDS. In this work, a new dimensionality reduction technique combined with the Multi-class SVM (Support Vector Machine) is proposed for intrusion detection. In the proposed model, Multi-Linear Dimensionality Reduction (ML-DR) is proposed as a feature extraction technique to reduce the dimension in order to shorten the training time. A Multi-class SVM (M-SVM) is used to detect whether the action is an attack or not. Here the Multi-class SVM is adopted to perform multi-attack classification in a layered fashion. Radial Basis Function Kernel is used as a SVM kernel. NSL-KDD data set is used for the performance evaluation of the proposed approach. The performance metrics such as classification accuracy, false alarm rate and the correlation coefficient are evaluated to measure its efficiency. In comparison with other detection approaches, the experimental results show that the proposed model outperforms the higher classification accuracy.

201

Authors: Vulapula Sridhar Reddy, Barige Thirumala Rao

In this paper, we plan a combined clustering and geometric data perturbation approach for improving privacy preservation of health care data in hybrid clouds. We will possibly plan an answer that can productively give protection to information put away in the cloud without presenting substantial overhead on both computation and communication. At first, the high-dimensional data are separated into various parts by utilizing the K-mean clustering method, each partition is considered as a cluster. At that point the mean estimate of each cluster processed; after that the contrast between the each cluster member and the mean of the cluster value is computed. In the next stage, the clustered information is perturbed by utilizing the Geometric Data Perturbation (GDP) algorithm which makes the values difficult to be recognized. These perturbed values are stored in the public cloud and the key parameters for randomizing and clustering is stored in the private cloud. Our approach would contribute in reduction of too much storage on private cloud on the off chance that we basically store the entire sensitive information on private clouds. The experimental results show that, the GDP algorithm has better privacy preserving compared with the other existing methods.

221

Authors: Megala Tulasiraman, Vivekanandan Kalimuthu

Regression testing is one among the strongest testing criteria which ensure the quality of the software under test. However, regression testing is too expensive due to execution of too many test cases .Test case prioritization is one of the traditional techniques which improve the regression testing by proposing a test case order that increases the rate of fault detection . In this paper, we propose a cost – cognizant history based test case prioritization approach that utilizes the historical information of the test cases like cost, fault identified by the test case and the severity of the identified fault for prioritization. Also an artificial immune system based, Clonal selection algorithm is proposed to find an effective test case order from existing test suite. To evaluate the proposed approach, controlled experiment were performed and the evaluation results indicates the test case order produced by proposed approach shows improvement in terms of average percentage of fault detected per cost.

239

Authors: Biswa Mohan Acharya, Ajit Kumar Nayak

Wireless multimedia sensor network (WMSN) deals with transmitting multimedia traffic over a long range in multi-hop along multiple paths. This is so for achieving the objectives of Quality of Service (QoS). In clustered routing, the load on the cluster head nodes increase and the energy consumed at the cluster head nodes lead to energy depletion of that node which degrades the network performance. The proposed protocol focuses on QoS and energy efficiency in WMSN by considering the hierarchical deployment of heterogeneous nodes. This protocol makes use of hierarchical structure of powerful cluster head nodes and the optimized multiple paths to support reliable and energy efficient multimedia transmission in WMSN. The reliability and life of the network increases because of the fault tolerance and load balanced feature of the protocol. Simulation results describe a significant performance improvement in terms of energy consumption of the nodes and the QoS parameter.

259

Authors: Calduwel Newton Pitchai, Nismon Rio Robert

Routing in Mobile Ad-hoc Networks (MANETs) is a very challenging task since, nodes are mobile and links are frequently created and broken. Traditional proactive routing algorithms initiate path discovery process from beginning after link failure occurrence. Generally, link failure occurs due to frequent topology change, fading, multiuser interference, etc., In MANETs link stability is the important criterion for link failure. Once the link meets with failure, it affects the overall performance of MANETs topology and it is very difficult to select optimum path as it leads to more transmission delay. The objective of this paper is to develop a mathematical model for Path Selection Algorithm based on Hamming Distance and delay parameters (PSA-HD). In this paper, link failure is identified, stable link is selected from the available links to reach the destination and it determines a stable path. The simulation result reveals that there is a decrease in average End-to-End delay and increase in Packet Delivery Ratio (PDR).

276

Authors: Tamilarasan Santhamurthy, Kumar Parasuraman

The cognitive radio (CR) offers keen solution to the serious scarcity of spectrum in wireless communication. In Multi-Input and Multi-Output (MIMO), primary user recruits some secondary users to cooperatively relay the primary traffic. It is very difficult to assign channel allocation and resource distribution in heterogeneous networks. We propose EPBDRA-CRN technique which provides priority scheduling scheme resulting in more reliability and efficient data transmission. The resource allocation can be done dynamically after ensuring that the nodes satisfy the specified constraints such as fairness, minimum-rate-guarantee, and minimum-delay-guarantee. Proposed EPBDRA-CRN algorithm does resource allocation and scheduling for PU and SU to exploit the performance of entire network by reducing the interference at PU. The proposal also supports different rates of transmission with priority, minimizes the transmission delay and improves fairness and provides significant network throughput and avoids collision. We compare EPBDRA-CRN with existing DRA-CRN algorithm using ns-2 simulation. The simulation result shows that the proposal is 27% more efficient than the existing DRA-CRN algorithm.

1

Authors: Neha Singh, Agrawal Kalpesh, Swathi Jamjala Narayanan

Prediction of fault proneness of modules in software is one of the ways to ensure the achievement of software quality and reliability. Software delivered cannot not always be bug free, the more the number of bug the more the dis-satisfaction among client due to degradation in software quality and reliability. Though we have few models for detecting software fault prone modules, the intend of our work is to increase the reliability of the software by using an approach named Rough Fuzzy c-means (RFCM) clustering algorithm to analyse the fault proneness of the software modules under test. This helps in an efficient analysis of the modules having an ambiguous behaviour using rough set boundary which is not possible using traditional clustering methods. A dataset from PROMISE software engineering repository has been taken for the experimental analysis. The results were promising enough to determine software modules which fall in the boundary region of ambiguity emphasizing the software team to focus on those modules to achieve higher reliable system.

20

Authors: Naradon Chotiwanaporn, Chow Chompoo-Inwai

This research paper presents the new idea of applying the transmission line teleprotection scheme called direct transfer trip (DTT) technique to use with a closed-loop distribution network. A large-scale 163MW gas turbine power plant connected to a three-substation closed-loop distribution network was chosen to be a case study here. A newly-proposed DTT configuration, DTT logic diagram and circuit breaker trip matrix had been redesigned and presented in this paper. For the proposed DTT configuration, several remote terminal units will be installed at every substation connected to the distribution network, whereas the logic controller will be installed at the selected power plant. A huge advantage over the conventionally-installed zoning peer-to-peer protection scheme is that the proposed DTT logic controller is able to almost instantaneously compute and send out the clearing faults command, regardless of fault locations in this particular closed-loop distribution network, while the conventional one cannot in many cases. Additional benefit is that the proposed DTT teleprotection scheme completely prevent the generators from operation in island mode resulting in minimal lost and damages caused from this circumstance. The relay test tool is used to verify the proposed DTT protective capabilities and speed. The simulation and commissioning test results confirm the proper functionality of the proposed technique. The implementation to the real field has been done and presented here as well. What we have learned from this case study shall be a very good guideline for other similar circumstances.

39

Authors: Bachir Bendjaima, Djamel Saigaa, Djalal Eddine Khodja

In industry, the service continuity of an electrical system drives requires degrees of reliability of operation and high safety. Thus, the system requires robust elements to avoid falling into the defects. But the appearance of defects, it is inevitable. It is therefore necessary to solve this problem by developing a control technique that can ensure continuity of operation in the presence of faults. Indeed, the sliding mode adaptive control based on fuzzy logic ensures the stability of the system healthy and able to compensate certain types of defects: the defects of low severity. In fact, is with the fuzzy sliding controller with varying control gains. This one is based on supervisory fuzzy inference system using the adaptive tune in order to improve the performance of controller in presence of current sensors faults. In addition, the sensors are the most sensitive elements and the seat of frequent faults, and play a leading role in the closed loop control. An operation of a tolerant control the default intended to compensate the default offset sensor. The developed algorithm is validated by simulation and the obtained results showed the effectiveness and the robustness of the proposed approach under different scenarios.

60

Authors: Srihari Mandava, Abhishek Gudipalli, Vidhyasagar Gorla, AmuthaPrabha Nagarajan

The harmonics injecting into power systems are increasing from day to day with the increasing use of power electronics and nonlinear loads. These harmonics are to be monitored and analyzed to measure their impact on the quality of the power flowing through the lines during normal and abnormal conditions. It is easy to measure the fundamental frequency and it’s off nominals of power signal using DFT and its extended methods when the power system frequency is stable. But, with increase in micro-grids and renewable energy sources like wind into the power network, the frequency of the power system in not stable. The DFT leads to errors in frequency estimation during this unstable state .This work uses the demodulation method for estimating the amplitudes and phase angle of fundamental frequency and its off-nominals of a power system having dynamics in frequency. This demodulation principle is part of the orthogonal frequency division multiplexing (OFDM) used for digital multi-carrier modulation.

78

Authors: Madhav Vaidya, Yashwant Joshi, Milind Bhalerao

Recognition of handwritten Marathi character/digits is comparatively a tough task as compared to English. It has several types of applications including the postal code reading and sorting, banks check amount processing. In this paper a novel feature extraction and selection method is proposed for the recognition of isolated handwritten Marathi numbers which is based on one dimensional Discrete Cosine Transform (DCT) algorithm. The scanned document is pre-processed and segmented to create isolated numerals. Features for each numeral can be calculated after normalizing the numeral image to 32 × 32 size. Based on these reduced features, the numerals are classified into appropriate groups. Neural network is used for classification of numerals based on the extracted features. The results of proposed method are compared with the results obtained using Discrete Wavelet Transform and zonal discrete cosine transform (ZDCT). The proposed approach gives improved results as compared to zonal DCT and DWT method. Experimental results shows accuracy observed for the method is 90.30% with normalized numeral image of size 32 × 32.

98

Authors: Kairat Jaroenrat, Natchamol Srichumroenrattana

One popular IP network routing protocol is OSPF (Open Shortest Path First), which uses algorithms to find its own path by calculating the path with the least weight from source to destination. As a result, the design and routing of the data flow may not meet the requirements. To meet the efficiency of cable installation and routing, the Branch Exchange for network design process was applied. With the ability to select the number of links to be exchanged with others, we can trade-off between the design efficiency and the processing time. We used the ability of the Branch Exchange method to determine a network with an efficient traffic flow distribution. We calculated the end-to-end delay time using the M/M/1 model, then analyzed the network design efficiency of 8- and 9-node networks compared to the Simplex method. For 8-, 9-, and 10-node networks, we compared the MENTOR-II method to traffic flow and network complexity. The results showed that the efficiency of the Branch Exchange method in terms of delay and cost closely align to the Simplex method but with faster calculation time. However, more exchange links (r) means a processing time closer to the Simplex method.

116

Authors: Viji Gripsy Jebaseelan, Anithalakshmi Srinivasan

Location aided routing in Mobile-Ad hoc networks are the most significant process because it limits the route search and allows routing with least messages. Due to the dynamic and uncertain infrastructure of Ad-hoc and sensor networks also creates several security issues like route misbehaviors. This paper aims to develop a new lightweight route selection scheme with the security concern. In this scheme, the routing attack targets are identified and avoided by deploying intellectual watchdog and lightweight key verification mechanisms, the scheme also utilizes the curved rectangle zone selection for shrinking route search space. The scheme is extended to adopt the curved rectangle zone routing for both Ad-hoc and Sensor Networks. The core functionality of the proposed work in terms of cost effective and secure route selection is validated by NS-2 tool. The experimental results demonstrated that the proposed approach is cost effective and secure and provides significant performance improvements with least energy consumption

134

Authors: Sindhu Babulogiah, Valarmathi Jayaraman, Christopher Sargunaraj

This paper discusses about the range estimation using multiple model method for single sensor bearing only tracking (BOT) in 3D. For BOT, the ownship is assumed to take a manoeuvre to gain observability in range and target state. The unknown target range was divided into uniform sub-intervals and nonlinear filters like Extended and unscented Kalman filter (EKF and UKF) with Cartesian and modified spherical coordinates (MSC) were implemented. Comparative results indicate that, UKF in MSC performs better with high computational time. This paper introduces Adaptive nonlinear filter (ANF) to get better range estimate with reduced computational time without affecting the filter performance. It is accomplished by conjoining Cartesian EKF with UKF in MSC, adaptively during the stationary and manoeuvring ownship conditions. The performance comparison was analysed using root mean square error, bias error and computational time. Simulation results reveal that ANF shows better results with reduced computational time.

156

Authors: Ketthari Thandapani, Sugumar Rajendran

Privacy Preserving Data Mining (PPDM) has turned into a well-known research region. Step by step instructions are adjusted between privacy assurance and knowledge discovery in the sharing procedure is a critical issue. Likewise, currently, not more strategies are accessible in the literature to hide the sensitive itemsets in the database. One of the existing privacy-preserving utility mining strategies uses two algorithms, HHUIF and MSICF to disguise the sensitive item sets so that the foes can't mine them from the modified database. This paper concentrates the privacy for the sensitive data actualize in a hybrid approach that is Optimal High Utility Item Selector (OHUIS) method. This Item Selector (IS) procedure upgrades the threshold utilizing inspired Krill Herd Optimization (KHO) method. With a specific end goal to hide the sensitive item sets, the frequency estimation of the items is changed. On the off chance that the utility estimations of the items are same, the OHUIS algorithm chooses the precise items and after that, the frequency estimations of the selected items are altered. The proposed OHUIS reduces the computation many-sided quality and also enhances the hiding performance of the item sets. The algorithm is actualized and the resultant item sets are thought about against the item sets that are acquired from the traditional privacy preserving utility mining algorithms. The test comes about demonstrate that OHUIS accomplishes the lower miss costs compared to the existing procedures for various manufactured datasets.

174

Authors: Zavli Juwantara, Maman Abdurohman, Sidik Prabowo

This paper proposes the enhancement of a selected Fuzzy Multiple Attribute Decision Making algorithm, namely Modified Multiplicative Exponent Weighting (M2EW) algorithm. The main focus of improving the Multiplicative Exponent Weighting (MEW) algorithm is to enhance the reliability of alternative vector preference calculations for selecting network candidates in a vertical handover (VHO). However, MEW algorithm has resulted in relative accuracy from each network which has not, in many cases, matched the necessary conditions. The improvement is done by calculating the Euclidean distance between the nodes represented by the weight values of each selected network candidate parameter. There are various algorithms used to support the VHO mechanism, for example an algorithm that calculates the value of each of the network selection parameters such as RSS, bandwidth or network speed such as Simple Additive Weighting (SAW) and MEW algorithm. The result shows that the M2EW algorithm has increased the relative standard deviation value by 0.2% and has shown the same delay as the MEW algorithm.

192

Authors: Eman El Sayed, Abeer El Korany, Akram Salah, Hesham Hefny

Continually, search engines improve their capabilities toward facilitating search and the retrieval enhancement. Despite the great efforts in the information retrieval field, the retrieved results may be out of user’s expectation. This may be due to the huge number of web resources, and unidentified user’s interests and domain. This paper proposes exploiting social annotations for improving retrieval based on personalization. The personalization focuses on web resources and retrieval process. In this context, new layer of knowledge is added to the web resource analysis and retrieval. Then, the additional knowledge leads to improve the retrieved results to be close to user’s interests. So, it retrieved different results for the same query based on the user’s interests. By applying the system, the experiments realize 36% precision improvement compared to non-personalized search engine. Moreover, the user satisfaction measured by evaluating search results versus user’s priorities, where it was in between 92% up to 100%.

211

Authors: Vinod Kumar, Ramjeevan Singh Thakur

High utility webpage set states to those set of webpages which have high utility value in a weblog database. To find high utility item sets from transactional databases, there exist various algorithms. However, these existing algorithms mostly deals with data like- categorical, time series, binary etc. The weblog data is different from other types of data. The utility webpages extracted from the log data can be used for knowing the user’s behaviour. In this research paper, two algorithms named HUWSM (high utility webpage sets mining) and HUWP-FP (high utility webpage sets - frequent pattern) Tree have been developed and used for efficiently mining high utility webpage sets from web log database. Along with this, a pattern generation technique based on the ‘Jaccard Similarity’ is also included in this method. The HUWSM method has also been compared with various other existing methods. This algorithm has shown a much better performance and more effectiveness over other algorithms like FHM, HUI-MINER and IHUP methods in terms of memory consumption and execution time.

230

Authors: Kotari Sridevi, Mandapati Sridhar

An unstructured version of a traditional wireless network provides a mobile ad hoc network (MANET) that is well suited for emergencies. However, due to lack of infrastructure and resource limitations, many performance problems occur at the same time. High-security vulnerabilities are likely to arise, largely because of dynamic behavior, and the complete communication cycle dependent on unidentified nodes which join and leaves as they want. Several past security schemes studies suggested that reliable and trusted nodes can minimize communication overhead and achieve higher throughput. This kind of scheme affects the route chosen for communication because it cannot distinguish between intentional and unintentional errors at runtime. It is, therefore, important to categorize node activities and also provide a node recovery scheme to regain their original reliability for the genuine nodes. In this paper, we propose a Reliable Trustworthy Approach (RTA) based on node behavior prediction for secure routing. It presents a behavior prediction algorithm for recognizing node behavior by differentiating among the unintentional transient errors and intentional malicious behavior, and the RTA mechanism which provides a method for node trust computation and a method for trust recovery. Experiment results show throughput improvisation against the malicious node intrusion. With increasing, malicious nodes in network RTA mechanism effectively predicted with an optimal packet loss and delay it attained prove the effectiveness of the mechanism.

250

Authors: Sumalatha Madugula, Panchala Venkata Naganjaneyulu, Kodati Satya Prasad

In VLSI design, performance parameters such as speed and hardware cost are important facts during the implementation of complex algorithms. In this paper, Low Cost Carry SeLect Adder Finite Impulse Response (LC-CSLA-FIR) is introduced to perform the FIR filter operations. With the help of shifter-I, shifter-II, and Shifter-III circuits, the FIR filter operation is performed without using any multipliers. In this new architecture, there is no need of storing the co-efficient in the ROM and number of multipliers. Due to the absence of multipliers, the quantity of hardware is reduced and the performance of the architecture is increase. With the help of Verilog code, the FIR filter architecture is verified in Modelsim software. After Field Programmable Gate Array (FPGA) analysis, Look Up Table (LUT), slices, flip flops, frequency and ASIC implementation area, power, delay, Area Power Product (APP), Area Delay Product (ADP) is improved in LC-CSLA-RFIR method compare to conventional methods.

273

Authors: Sharmasth Vali Yerur, Prakash Natarajan, Tiruchirai Ramanujam Rangaswamy

The open nature of Mobile Ad Hoc NETworks (MANETs) provides an opportunity for intrusions. The current intrusion mechanisms are reactive and incapable of preventing the intrusions proactively. This paper proposes the secure routing using Hybrid intrusion prevention systems against dropping and data integrity THreat (SHEATH). This proposal implements self-key and mutual-key reliant prevention and the appearance frequency based behavior certainty measurement on routing paths. The self-key prevention scheme exploits the encrypted value of the sequence number as a normal pattern and the decryption determine whether the route reply is the result of a malicious node or not. The behavior certainty measurement using distributed selection of Squad Head nodes ensures the effective observation of misuse pattern and minimum routing overhead. The data forwarding phase shares a mutual key between the communicating nodes that prevent the data integrity attacks. The simulation results confirm the efficiency of the hybrid preventive scheme against intrusions.