{"title":"Evaluation of security system based on failure-risk exposure","authors":"Rajesh Purohit, Prof. K. R. Chowdhary","doi":"10.1109/ETNCC.2011.5958512","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.5958512","url":null,"abstract":"Verifying a security system needs large number of event sequences to be generated and applied to the candidate system. Like other systems, security systems have various components or subsystems i.e. hardware or software in it. A security subsystem is said to be failed in the case of false acception and false rejection. For a reliable system, verification has to be performed more extensively on specific part(s) of the system, which is expected to be used more. In this paper, usage pattern, failure risk and failure impact associated with every subsystem are considered as indicator parameters. The criticality is calculated on the basis of effective failure risk exposure (FRE) of the event sequences. This paper suggests a method to calculate criticality of part of the system which contribute more towards reliability of the security system.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121341023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Game theoretic approach to routing in 802.11 based wireless mesh networks","authors":"Raveenpal Kaur, Gurpal Singh","doi":"10.1109/ETNCC.2011.5958518","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.5958518","url":null,"abstract":"This paper models the IEEE 802.11 based wireless mesh networks for optimal routing paths and pricing using the concept of Game Theory. In traditional approaches, each node has the tendency to pass maximum traffic through the selected route leaving rest of the network in a starvation state. To avoid this situation the concept of Mesh manager can be applied to break the selfish behavior of the nodes. The Mesh manager increases the cost proportionally to the traffic sent by the node. The consequences of this behavior leads to decrease in the payoff of the node, will ultimately leads the node in a situation to find another optimized route (i.e. route with minimum ETX(high throughput) and less cost). By using the game theory, an analytic model has been presented. This approach helps the node to search the high throughput path and break the selfish behavior of the node while routing the packets from source to destination in wireless mesh networks.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126935908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Mandal, B. Kaushik, B. Kumar, K. Tyagi, R. P. Agarwal
{"title":"LMS algorithm based error correction technique in in-phase and quadrature channel signal processing","authors":"A. Mandal, B. Kaushik, B. Kumar, K. Tyagi, R. P. Agarwal","doi":"10.1109/ETNCC.2011.6255891","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.6255891","url":null,"abstract":"Every communication receiver that uses in-phase and quadrature channel signal processing technique encounters problems related to matching of gain and phase in both the channels. The gain and phase imbalances occur between Low Pass Filter and Local Oscillator used in both the channels and as a result the performance of the receivers and the quality of the received signals are degraded. The imbalances produced may cause insufficient attenuation in image frequency band leading to interference. The problem needs to be compensated. This paper represents the design and implementation of Coordinate Rotation Digital Computer (CORDIC) algorithm based Adaptive FIR filter using Least Mean Square (LMS) algorithm to give a solution for correcting I/Q imbalances. The design of CORDIC in the vector rotation mode results in high system throughput due to its pipelined architecture where latency is reduced in each of the pipelined stage and finds its appropriate application in real time signal processing. The good convergence of CORDIC in the given LMS algorithm based adaptive filter facilitates in easy calculation of new filter weights.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128483189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CPW-fed semi circle patch antenna for 2.4GHz WLAN application","authors":"I. Balakrishna, M. S. Kumar, S. Raghavan","doi":"10.1109/ETNCC.2011.5958508","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.5958508","url":null,"abstract":"This paper presents a CPW-fed semi circle patch antenna for 2.4GHz WLAN application. This Antenna satisfies the licensed frequency band (2.4 to 2.480GHz) having return loss lower than −10 dB. This antenna is designed on a substrate with dielectric constant εr =4.4. With a size 30mm×27mm×1.75mm the antenna operates for WLAN application. The effects of shape, length, size, and location of feeding point, substrate and their thickness have been evaluated. And obtained 2D radiation patterns with elevation, VSWR, Return loss, gain and antenna efficiency. The simulation results of this antenna are analyzed by using Method of Moment (MoM) from IE3D software.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124171439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Resource requirement prioritized grid scheduling model","authors":"M. Bhatia, M. Bhatia","doi":"10.1109/ETNCC.2011.6255927","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.6255927","url":null,"abstract":"Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling in an important aspect of distributed computing. As grid computing is a form of distributed computing with heterogeneous resources working in a shared environment with no central control. The main aim of Grid scheduling is to increase the system throughput and to satisfy the job requirements from the available resources. This work proposes a resource requirement (R2) prioritized task-scheduling algorithm for grid computing. This algorithm is based on prioritizing the resource requirement of the jobs which schedules the jobs taking into account the memory requirement of the jobs. It is named as the scheduling algorithm. It is compared with one of the widely used grid scheduling algorithm MinMin and has been tested in simulated grid environment. The experimental results showed a significant improvement of in terms of a makespan and system utilization.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134117789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multimedia based fitness function optimization through evolutionary game learning","authors":"Sanjay M. Shah, Chirag S. Thaker, D. Singh","doi":"10.1109/ETNCC.2011.5958507","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.5958507","url":null,"abstract":"One of the areas of Artificial intelligence is Board Game Playing. Game-playing programs are often described as being a combination of search and knowledge. The board games are very popular. Board Games provide dynamic environments that make them ideal area of computational intelligence theories, architectures, and algorithms. Building a quality evaluation function is usually a lot of manual hard work and luck. The goodness of the evaluation function is determined by its accuracy, relevance, cost and outcome. All of these parameters must be addressed and the weighed results are added to an evaluation function experimentally. Evolutionary algorithms such as Genetic algorithm are applied to the game playing because of the very large state space of the problem. In natural evolution, the fitness of an individual is defined with respect to its competitors and collaborators, as well as to the environment. Evolutionary algorithms follow the same path to evolve game playing programs. Among all computer board games, Go-moku (Five-inLine), which is a variant of a Game of GO. This paper mainly highlights how genetic algorithm can be applied to game of Go-moku, where fitness values can be used by applying genetic operators through linear evaluation function.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134147960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Consistency of Geographic Routing Protocol for high density MANET","authors":"T. Raval, J. S. Shah","doi":"10.1109/ETNCC.2011.6255908","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.6255908","url":null,"abstract":"Mobile ad hoc network is a collection of self organized nodes. They form a temporary network without additional infrastructure like wireless access points. Such network does not have any centralized control. Here every node can communicate directly with other nodes in the network. Mobile ad hoc network communicate one to the other through broadcast radio transmissions, i.e., transmissions that reach all the terminals within the transmission power range. In recent years several routing protocols are developed for mobile ad hoc networks. Some of them are DSDV, AODV, TORA, DSR and GRP. This paper does the distance based analysis of Geographic Routing Protocol for random mobility of nodes in MANET. The simulation environment is created in Opnet 14.0. We conclude that the performance of GRP for high density network is more consistent compare to the less dense network.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131761542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Impact of Denial-of-Service in security protocols","authors":"M. Jain","doi":"10.1109/ETNCC.2011.5958503","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.5958503","url":null,"abstract":"Denial-of-Service (DOS) attacks are unavoidable in networked systems. These attacks have their impact on security protocols. As defence against DoS has been built more and more into security protocols, this paper studies how to evaluate the risk of DoS in security protocols. First, we build a formal framework to model protocol operations and attacker capabilities. Then we propose an economic model for the risk evaluation. By characterizing the intruder capability with a probability model, our risk evaluation model specifies the “Risk-Factor” (RF) for the security protocols. The “Risk-Factor” represents how much computing resources are expected to lose with a given level of confidence. The proposed model can help users to have a better understanding of the protocols they are using, and in the meantime help designers to examine their designs and get clues of improvement.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Vikas Srivastava, A. K. Keshri, Abhishek Roy, V. Chaurasiya, Rahul Gupta
{"title":"Advanced port knocking authentication scheme with QRC using AES","authors":"Vikas Srivastava, A. K. Keshri, Abhishek Roy, V. Chaurasiya, Rahul Gupta","doi":"10.1109/ETNCC.2011.5958506","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.5958506","url":null,"abstract":"Port Knocking is an important concept to secure services provided by the servers. By a predefined port knocking sequence server identify whether the request is a legitimate request for a service. This paper presents an improved authentication scheme over the existing port knocking methods. The existing port knocking methods are prone to reasonable attacks and vulnerabilities. The paper addresses those vulnerabilities, and accordingly provides mechanism to circumvent on the port knocking mechanism. In a client-server communication, request for services from the clients is done by providing them connection to a specific port on the server. For security concerns, all the ports on the server are initially closed and no connection is possible. Port knocking permits a user to request for a port to open for network services. This request takes the form of a sequence of authentication packets across closed ports on the server. Many port knocking schemes have been proposed earlier but all of them suffer from the problems like sequence replay attack, man in the middle attack, use of spoofed packets in knocking sequence and out of order delivery of packets. The proposed algorithm addresses all the above mentioned issues by implementing a secure knock sequence with AES encryption scheme, which cannot be detected or disturbed by the sniffing and use of spoofed packets. The algorithm also addresses the problem of out of order delivery of knock sequence packets as the knock sequence is determined when all the packets are received at the server end.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132708810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantative analysis of Histopathological image","authors":"P. Saxena, H. Choudhary","doi":"10.1109/ETNCC.2011.6255910","DOIUrl":"https://doi.org/10.1109/ETNCC.2011.6255910","url":null,"abstract":"In resent time there is no such system by which doctors can relate their qualitative result of Histopathological image, which varies person to person. Histopathological images are the images of diseased tissues of any section of the body. All these are microscopic digital images. To analyze these images by naked eye, it is very difficult. So we develop such a black-box that analyzes the quality of the Histopathological Images using Neural Network. This basically comes under the domain of Digital Image Processing. Objective: Produce a research based system that works on image processing to calculate quality analysis. We have the opportunity to be the first to market in this category.","PeriodicalId":221059,"journal":{"name":"2011 International Conference on Emerging Trends in Networks and Computer Communications (ETNCC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128852584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}