Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

4 ( 1 )

2019 ( 140 )

2018 ( 788 )

2017 ( 807 )

Custom range...

Search Results: 1 - 10 of 474240 matches for " N. CH. S. N. Iyengar "
All listed articles are free for downloading (OA Articles)
Page 1 /474240
Display every page Item
Interference Aware Channel Assignmnet Using Edge Coloring in Multi-Channel Multi-Radio Wireless Mesh Networks
Sarasvathi V,N. CH. S. N. Iyengar,Snehanshu Saha
Computer Science , 2013,
Abstract: Recently multi-channel multi-radio wireless mesh networks are considered a reliable and cost effective way for internet access in wide area. A major research challenge in this network is selecting least interference channel from available channel and then assigning it to radio efficiently. Many algorithms and methods have been developed for channel assignment to maximize network throughput using orthogonal channels. Recent research and testbed experiments proved that POC based channel assignment allows more flexibility in wireless spectrum sharing. In this paper, we represent the channel assignment as a graph edge coloring problem using POC. The signal-to-noise interference ratio is measured to avoid interference from neighbouring transmission, when we assign channel to link. Simulation result shows that our proposed method improves network throughput and performance. Keywords: Wireless Mesh Networks, Multi-Radio, Multi-Channel, Partially Overlapping Channels, Signal-to-noise interference
QoS Guaranteed Intelligent Routing Using Hybrid PSO-GA in Wireless Mesh Networks
V. Sarasvathi,N. Ch. S. N. Iyengar,Snehanshu Saha
Computer Science , 2015, DOI: 10.1515/cait-2015-0007
Abstract: In Multi-Channel Multi-Radio Wireless Mesh Networks (MCMR-WMN), finding the optimal routing by satisfying the Quality of Service (QoS) constraints is an ambitious task. Multiple paths are available from the source node to the gateway for reliability, and sometimes it is necessary to deal with failures of the link in WMN. A major challenge in a MCMR-WMN is finding the routing with QoS satisfied and an interference free path from the redundant paths, in order to transmit the packets through this path. The Particle Swarm Optimization (PSO) is an optimization technique to find the candidate solution in the search space optimally, and it applies artificial intelligence to solve the routing problem. On the other hand, the Genetic Algorithm (GA) is a population based meta-heuristic optimization algorithm inspired by the natural evolution, such as selection,mutation and crossover. PSO can easily fall into a local optimal solution, at the same time GA is not suitable for dynamic data due to the underlying dynamic network. In this paper we propose an optimal intelligent routing, using a Hybrid PSO-GA, which also meets the QoS constraints. Moreover, it integrates the strength of PSO and GA. The QoS constraints, such as bandwidth, delay, jitter and interference are transformed into penalty functions. The simulation results show that the hybrid approach outperforms PSO and GA individually, and it takes less convergence time comparatively, keeping away from converging prematurely. Keywords: Wireless mesh networks, Multi-radio, Multi-channel, Particle swarm optimization, Genetic algorithm, Quality of service.
M.A.Saleem Durai,N.Ch.S.N.Iyengar
International Journal of Engineering Science and Technology , 2010,
Abstract: In this paper, the structure of a lung cancer analysis system is presented. The main focus for the development of the system is on the architecture and the algorithm used to find the probable disease, stage and the appropriate treatment of cancer a patient may have. The disease is determined by using a rule base, populated by rules made for different types of lung cancer. The algorithm uses the output of the rule base (i.e. the disease name) and the symptoms entered by the user to determine the stage of cancer the patient is in. Both these results (disease name and stage) help the diagnostic logic to determine the treatment for the patient with accuracy. Our diagnosis does a complex analysis of all the information gathered about our symptoms. In this paper, we have evolved a method of choosing the besttreatment for cancer using fuzzy decision making techniques.
Enhanced Prediction of Heart Disease with Feature Subset Selection using Genetic Algorithm
International Journal of Engineering Science and Technology , 2010,
Abstract: Clinical diagnosis is done mostly by doctor’s expertise and experience. But still cases are reported of wrong diagnosis and treatment. Patients are asked to take number of tests for diagnosis. In many cases, not all the tests contribute towards effective diagnosis of a disease. The objective of our work is to predict more accurately the presence of heart disease with reduced number of attributes. Originally, thirteen attributes were involved in predicting the heart disease. In our work, Genetic algorithm is used to determine the attributes which contribute more towards the diagnosis of heart ailments which indirectly reduces the number of tests which are needed to be taken by a patient. Thirteen attributes are reduced to 6 attributes using genetic search. Subsequently, three classifiers like Naive Bayes, Classification by clustering and Decision Tree are used to predict the diagnosis of patients withthe same accuracy as obtained before the reduction of number of attributes. Also, the observations exhibit that the Decision Tree data mining technique outperforms other two data mining techniques after incorporating feature subset selection with relatively high model construction time. Na ve Bayes performs consistently before and after reduction of attributes with the same model construction time. Classification via clustering performs poor compared to other two methods.
A Study on Security Threats in Cloud
Na Jeyanthi,Hena Shabeeb,N.Ch.S.N. Iyengar
International Journal of Cloud Computing and Services Science (IJ-CLOSER) , 2012, DOI: 10.11591/closer.v1i3.702
Abstract: Cloud computing is now invading almost all IT industry and has become a rich area of research. It enables the users to share the resources which are done through resource virtualization and they have to pay only for what they use. The new paradigm freed the organizations from the burden of installing and maintaining the expensive and critical software, platform and infrastructure. The only thing they need to see is the Internet enabled systems. As the number of dependents on the cloud services shoots up, the security issue has become an overwhelming problem for cloud service providers. In order to make use of the cloud benefits to full extent, these issues need to be addressed first. This paper presents the major security issues in cloud computing. Some of the countermeasures that can be implemented is also suggested.
Coefficient of Restitution based Cross Layer Interference Aware Routing Protocol in Wireless Mesh Networks
Sarasvathi V,Snehanshu Saha,N. Ch. S. N. Iyengar,Mahalaxmi Koti
Computer Science , 2015,
Abstract: In Multi-Radio Multi-Channel (MRMC) Wireless Mesh Networks (WMN), Partially Overlapped Channels (POC) has been used to increase the parallel transmission. But adjacent channel interference is very severe in MRMC environment; it decreases the network throughput very badly. In this paper, we propose a Coefficient of Restitution based Cross layer Interference aware Routing protocol (CoRCiaR) to improve TCP performance in Wireless Mesh Networks. This approach comprises of two-steps: Initially, the interference detection algorithm is developed at MAC layer by enhancing the RTS/CTS method. Based on the channel interference, congestion is identified by Round Trip Time (RTT) measurements, and subsequently the route discovery module selects the alternative path to send the data packet. The packets are transmitted to the congestion free path seamlessly by the source. The performance of the proposed CoRCiaR protocol is measured by Coefficient of Restitution (COR) parameter. The impact of the rerouting is experienced on the network throughput performance. The simulation results show that the proposed cross layer interference aware dynamic routing enhances the TCP performance on WMN. Keywords: Coefficient of Restitution, Wireless Mesh Networks, Partially Overlapped Channels, Round Trip Time, Multi-Radio, Multi-Channel.
A Frame Work for Ontological Privacy Preserved Mining
Geetha Mary. A,Sriman Narayana Iyengar. N.Ch.
International Journal of Network Security & Its Applications , 2010,
Abstract: Data Mining analyses the stocked data and helps in foretelling the future trends. There are different techniques by which data can be mined. These different techniques reveal different types of hiddenknowledge. Using the right procedure of technique result specific patterns emerge.Ontology is a specification of conceptualization. It is a description of concepts and relationships that can exist for an agent or a community of agents. To make software more user-friendly, ontology could be used to explain both the technical and domain details. In the process of analyzing a data certain important detailscannot be revealed, therefore security is the most important feature dealt in all technologies and work places.Data mining and Ontology techniques when integrated would capitulate an efficient system capable of selecting the appropriate algorithm for a data mining technique and privacy preserving techniques also byexploring the domain knowledge using ontology.
A Cross Layer Based QoS Model for Wireless and Mobile Ad Hoc Networks
P. Venkata Krishna,S.N. Iyengar
Journal of Mobile Communication , 2012,
Abstract: The cross-layer design approach is an efficient procedure used to solve several open issues of mobile and wireless networks. Cross-layer design is used to share the information between layers and promotes adaptability at various layers based on information exchanged. However, such a design process needs to be carefully coordinated to avoid unintentional and undesirable consequences. The basic idea of cross layer approach is to overcome performance problems by allowing protocols belonging to different layers to cooperate and share network status information to maintain the Quality of Service. This study presents a QoS model based on cross layer concepts for Mobile and wireless environments.
Gottwald Melborune (0–1) test for chaos in a plasma
D. R. Chowdhury, A. N. S. Iyengar,S. Lahiri
Nonlinear Processes in Geophysics (NPG) , 2012,
Abstract: Plasma is a highly complex system exhibiting a rich variety of nonlinear dynamical phenomena. In the last two decades or so there has been a spurt of growth in exploring unconventional nonlinear dynamical methods of analysis, like chaos theory, multi fractal analysis, self organized criticality etc. of experimental data from different plasma systems. Investigation of fluctuating plasma parameters is very important since they are correlated with transport of particles, and energy. In time series analysis, it is considered of key importance to determine whether the data measured from the system is regular, deterministically chaotic, or random. The two important parameters that are in general estimated are the correlation dimension and the Lyapunov exponent. Though correlation dimension helps in determining the complexity of a system, Lyapunov exponent reveals if the system is chaotic or not and also helps in prediction to some extent. In spite of its extensive usage, estimation of Lyapunov exponent can be quite tedious and sometimes suffers from some disadvantages like reliability in the presence of noise, requirement of phase space reconstruction etc., and hence it is necessary to explore other possibilities of estimating the chaoticity of a data. In this paper we have analysed for chaoticity, the nonlinear floating potential fluctuations from a glow discharge plasma system by the 0–1 test and compared it with the results obtained from Lyapunov exponent.
An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks
N. Ch. Sriman Narayana Iyengar,Syed Mohammad Ansar Sachin kumar,Piyush Nagar,Siddharth Sharma
International Journal of Computer Networks & Communications , 2010,
Abstract: Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complexproblems in the domain of communication networks. This paper presents a random algorithm for handling therouting problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols forMANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyonda certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion innetwork increases due to control packets generated by the routing protocols in the process of route discovery androute maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDVfor the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. Thispaper introduces the concept of random routing algorithm that neither maintains a routing table nor floods theentire network as done by various known protocols thereby reducing the load on network in terms of number ofcontrol packets in a highly dynamic scenario. This paper calculates the expected run time of the designed randomalgorithm.
Page 1 /474240
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.