Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726634
G. Kumar, J. Singh
Energy efficiency is one of most important parameter to consider while designing the wireless sensor networks. In this paper, we proposed energy efficient clustering scheme based on grid optimization using genetic algorithm. In this scheme, the given sensing field divided into the virtual grids and each grid represents a cluster. Genetic algorithm is used to optimize the grids in order to equal the number of nodes in each grid which leads to equal traffic load on each cluster and enhance the lifetime of network. In this scheme, the residual energy of nodes is considered during selection of cluster head in order to balance the energy of network. For comparison LEACH, improved version of LEACH, EE-LEACH, LEACH-MIMO and Energy efficient cooperative MIMO (EE-LEACH-MIMO) schemes are considered. Simulation results show that, our scheme performs better as compared to the mentioned schemes in terms of more load balancing, energy saving and enhancement of network lifetime.
在无线传感器网络设计中，能量效率是一个重要的参数。本文提出了一种基于遗传算法的网格优化节能聚类方案。该方案将给定的传感场划分为虚拟网格，每个网格代表一个簇。采用遗传算法对网格进行优化，使每个网格的节点数量相等，从而使每个集群的流量负荷相等，提高网络的生存期。该方案在选择簇头时考虑了节点的剩余能量，以平衡网络能量。为了比较LEACH，考虑了LEACH、EE-LEACH、LEACH-MIMO和Energy efficient cooperative MIMO (EE-LEACH-MIMO)方案的改进版本。仿真结果表明，与上述方案相比，我们的方案在负载均衡、节能和提高网络寿命方面表现更好。
{"title":"Energy efficient clustering scheme based on grid optimization using genetic algorithm for wireless sensor networks","authors":"G. Kumar, J. Singh","doi":"10.1109/ICCCNT.2013.6726634","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726634","url":null,"abstract":"Energy efficiency is one of most important parameter to consider while designing the wireless sensor networks. In this paper, we proposed energy efficient clustering scheme based on grid optimization using genetic algorithm. In this scheme, the given sensing field divided into the virtual grids and each grid represents a cluster. Genetic algorithm is used to optimize the grids in order to equal the number of nodes in each grid which leads to equal traffic load on each cluster and enhance the lifetime of network. In this scheme, the residual energy of nodes is considered during selection of cluster head in order to balance the energy of network. For comparison LEACH, improved version of LEACH, EE-LEACH, LEACH-MIMO and Energy efficient cooperative MIMO (EE-LEACH-MIMO) schemes are considered. Simulation results show that, our scheme performs better as compared to the mentioned schemes in terms of more load balancing, energy saving and enhancement of network lifetime.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"21 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77775181","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726711
S. S. Patil, J. Gaikwad
Present day requirements for enhanced reliability of rotating equipments are most critical than ever before, and demands continue to grow constantly. Detection of faults play important role in the quest for highly reliable operations. Reducing maintenance and production cost, improving uptime, product quality, advance safety and reducing risks are some of the essential drivers for deploying vibration analysis. These serve as goals of any plant or corporation. Vibration analysis for predictive maintenance is an important ingredient in all these goals. Vibration analysis can be used as part of root cause analysis efforts within any plant. The present work offers a course of action for analyzing the vibration signals of electrical rotating machines and diagnoses the health of machine for predictive maintenance requirements using Fast Fourier Transform (FFT). The Vibration analysis of electrical rotating machines lies on the fact that all rotating machines in good condition have fairly stable vibration pattern. Under any abnormal condition in working of machines, the vibration pattern gets changed. The amount of variation can be detected and the nature of abnormalities can be analyzed with LabVIEW to get an idea about the fault in the machine. Based on the type of defect and its slope of progression, predictive maintenance schedule can be proposed. This work also aims at overcoming the limitations of traditional vibration analysis techniques.
{"title":"Vibration analysis of electrical rotating machines using FFT: A method of predictive maintenance","authors":"S. S. Patil, J. Gaikwad","doi":"10.1109/ICCCNT.2013.6726711","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726711","url":null,"abstract":"Present day requirements for enhanced reliability of rotating equipments are most critical than ever before, and demands continue to grow constantly. Detection of faults play important role in the quest for highly reliable operations. Reducing maintenance and production cost, improving uptime, product quality, advance safety and reducing risks are some of the essential drivers for deploying vibration analysis. These serve as goals of any plant or corporation. Vibration analysis for predictive maintenance is an important ingredient in all these goals. Vibration analysis can be used as part of root cause analysis efforts within any plant. The present work offers a course of action for analyzing the vibration signals of electrical rotating machines and diagnoses the health of machine for predictive maintenance requirements using Fast Fourier Transform (FFT). The Vibration analysis of electrical rotating machines lies on the fact that all rotating machines in good condition have fairly stable vibration pattern. Under any abnormal condition in working of machines, the vibration pattern gets changed. The amount of variation can be detected and the nature of abnormalities can be analyzed with LabVIEW to get an idea about the fault in the machine. Based on the type of defect and its slope of progression, predictive maintenance schedule can be proposed. This work also aims at overcoming the limitations of traditional vibration analysis techniques.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"18 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75486583","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726621
G. Wahane, S. Lonare
Mobile Ad Hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure and predetermined organization of available links. Security is a major challenge for these networks due to their features of open medium, dynamically changing topologies. The black hole attack is a well known security threat in mobile ad hoc networks. However, it spuriously replies for any route request without having any active route to the specified destination. Sometimes the Black Hole Nodes cooperate with each other with the aim of dropping packets these are known as Cooperative Black Hole attack. This research work suggests the modification of Ad Hoc on Demand Distance Vector Routing Protocol. we are going to use a mechanism for detecting as well as defending against a cooperative black hole attack. This work suggest two new concepts, first one is Maintenance of Routing Information Table and second is Reliability checking of a node. This system also decreases the end to end delay and Routing overhead.
{"title":"Technique for detection of cooperative black hole attack in MANET","authors":"G. Wahane, S. Lonare","doi":"10.1109/ICCCNT.2013.6726621","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726621","url":null,"abstract":"Mobile Ad Hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure and predetermined organization of available links. Security is a major challenge for these networks due to their features of open medium, dynamically changing topologies. The black hole attack is a well known security threat in mobile ad hoc networks. However, it spuriously replies for any route request without having any active route to the specified destination. Sometimes the Black Hole Nodes cooperate with each other with the aim of dropping packets these are known as Cooperative Black Hole attack. This research work suggests the modification of Ad Hoc on Demand Distance Vector Routing Protocol. we are going to use a mechanism for detecting as well as defending against a cooperative black hole attack. This work suggest two new concepts, first one is Maintenance of Routing Information Table and second is Reliability checking of a node. This system also decreases the end to end delay and Routing overhead.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"117 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78980494","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726808
K. Thenmalar, A. Allirani
Economic load dispatch (ELD) is an important optimization task in power system. It is the process of allocating generation among the committed units such that the constraints imposed are satisfied and the energy requirements are minimized. There are three criteria in solving the economic load dispatch problem. They are minimizing the total generator operating cost, total emission cost and scheduling the generator units. In this paper Firefly Algorithm(FA) solution to economic dispatch problem is very useful when addressing heavily constrained optimization problem in terms of solution accuracy. Results obtained from this technique clearly demonstrate that the algorithm is more efficient in terms of number of evolution to reach the global optimum point. The result also shows that the solution method is practical and valid for real time applications In this paper the Firefly Algorithm(FA) solves economic load dispatch (ELD) power system problem of three generator system, six generator system with emission constraints and twelve generator system with introduced population-based technique - is utilized to solve the DED problem. A general formulation of this algorithm is presented together with an analytical mathematical modeling to solve this problem by a single equivalent objective function. The results are compared with those obtained by alternative techniques proposed by the literature in order to show that it is capable of yielding good optimal solutions with proper selection of control parameters. The validity and quality of the solution obtained Firefly Algorithm(FA) based economic load dispatch method are checked and compared with Artificial colony algorithm(ABC), Particle Swarm Optimization Algorithm (PSO), simulated Annealing Algorithm(SA).
{"title":"Solution of firefly algorithm for the economic themal power dispatch with emission constraint in various generation plants","authors":"K. Thenmalar, A. Allirani","doi":"10.1109/ICCCNT.2013.6726808","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726808","url":null,"abstract":"Economic load dispatch (ELD) is an important optimization task in power system. It is the process of allocating generation among the committed units such that the constraints imposed are satisfied and the energy requirements are minimized. There are three criteria in solving the economic load dispatch problem. They are minimizing the total generator operating cost, total emission cost and scheduling the generator units. In this paper Firefly Algorithm(FA) solution to economic dispatch problem is very useful when addressing heavily constrained optimization problem in terms of solution accuracy. Results obtained from this technique clearly demonstrate that the algorithm is more efficient in terms of number of evolution to reach the global optimum point. The result also shows that the solution method is practical and valid for real time applications In this paper the Firefly Algorithm(FA) solves economic load dispatch (ELD) power system problem of three generator system, six generator system with emission constraints and twelve generator system with introduced population-based technique - is utilized to solve the DED problem. A general formulation of this algorithm is presented together with an analytical mathematical modeling to solve this problem by a single equivalent objective function. The results are compared with those obtained by alternative techniques proposed by the literature in order to show that it is capable of yielding good optimal solutions with proper selection of control parameters. The validity and quality of the solution obtained Firefly Algorithm(FA) based economic load dispatch method are checked and compared with Artificial colony algorithm(ABC), Particle Swarm Optimization Algorithm (PSO), simulated Annealing Algorithm(SA).","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"31 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79040530","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726847
S. Vaidyanathan, S. Pakiriswamy
Generalized projective synchronization (GPS) of chaotic systems is a new type of synchronization, which is a general form of synchronization compared to other types of synchronization such as complete synchronization (CS), anti-synchronization (AS), hybrid synchronization (HS), projective synchronization (PS), etc. There are many types of techniques available for synchronizing chaotic systems such as delayed feedback control, sampled-data feedback control, sliding mode control, backstepping control, etc. In this paper, we have used active control method for GPS of four-wing chaotic systems, viz. Wang four-wing chaotic system (2009) and Liu four-wing chaotic system (2009). Explicitly, we derive active controllers for GPS of identical Wang four-wing chaotic systems, identical Liu four-wing chaotic systems and non-identical Wang and Liu four-wing chaotic systems. Main GPS results in this work have been proved with the help of Lyapunov stability theory. MATLAB plots are shown to demonstrate the GPS results for Wang and Liu four-wing chaotic systems.
{"title":"Active controller design for the GPS of four-wing chaotic systems","authors":"S. Vaidyanathan, S. Pakiriswamy","doi":"10.1109/ICCCNT.2013.6726847","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726847","url":null,"abstract":"Generalized projective synchronization (GPS) of chaotic systems is a new type of synchronization, which is a general form of synchronization compared to other types of synchronization such as complete synchronization (CS), anti-synchronization (AS), hybrid synchronization (HS), projective synchronization (PS), etc. There are many types of techniques available for synchronizing chaotic systems such as delayed feedback control, sampled-data feedback control, sliding mode control, backstepping control, etc. In this paper, we have used active control method for GPS of four-wing chaotic systems, viz. Wang four-wing chaotic system (2009) and Liu four-wing chaotic system (2009). Explicitly, we derive active controllers for GPS of identical Wang four-wing chaotic systems, identical Liu four-wing chaotic systems and non-identical Wang and Liu four-wing chaotic systems. Main GPS results in this work have been proved with the help of Lyapunov stability theory. MATLAB plots are shown to demonstrate the GPS results for Wang and Liu four-wing chaotic systems.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"1 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80005922","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726618
P. Sivasankar, M. Ramakrishnan
In Wireless sensor Network, the sensor nodes transmit critical information over the network; therefore, security services, such as, authentication and pair wise key establishment between sensor nodes and mobile sinks, are important. However, the problem of authentication and pair wise key establishment in sensor networks with MSs is still not solved in the face of mobile sink replication attacks. For the basic probabilistic and q-composite key pre distribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of the network sensor nodes, making it possible for the attacker to take control of the entire network by deploying a replicated mobile sink, preloaded with some compromised keys to authenticate and then initiate data communication with any sensor node. To solve this problem, we have developed a general framework that permits the use of any pair wise key pre distribution scheme as its basic component, to provide authentication and pair wise key establishment between sensor nodes and MSs. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pair wise key establishment between the sensors.
{"title":"Active key management scheme to avoid clone attack in wireless sensor network","authors":"P. Sivasankar, M. Ramakrishnan","doi":"10.1109/ICCCNT.2013.6726618","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726618","url":null,"abstract":"In Wireless sensor Network, the sensor nodes transmit critical information over the network; therefore, security services, such as, authentication and pair wise key establishment between sensor nodes and mobile sinks, are important. However, the problem of authentication and pair wise key establishment in sensor networks with MSs is still not solved in the face of mobile sink replication attacks. For the basic probabilistic and q-composite key pre distribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of the network sensor nodes, making it possible for the attacker to take control of the entire network by deploying a replicated mobile sink, preloaded with some compromised keys to authenticate and then initiate data communication with any sensor node. To solve this problem, we have developed a general framework that permits the use of any pair wise key pre distribution scheme as its basic component, to provide authentication and pair wise key establishment between sensor nodes and MSs. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pair wise key establishment between the sensors.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"767 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81072984","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726470
S. Muniyappan, A. Allirani, S. Saraswathi
A novel approach for image enhancement by using contrast limited adaptive histogram equalization method will produces a good contrast images such as medical images. In this paper, we propose a new method for image enhancement by using contrast limited adaptive histogram equalization method. We propose a general framework with a adaptive histogram equalization method. We are going to prove its effectiveness in comparison to other contrast enhancement method.
{"title":"A novel approach for image enhancement by using contrast limited adaptive histogram equalization method","authors":"S. Muniyappan, A. Allirani, S. Saraswathi","doi":"10.1109/ICCCNT.2013.6726470","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726470","url":null,"abstract":"A novel approach for image enhancement by using contrast limited adaptive histogram equalization method will produces a good contrast images such as medical images. In this paper, we propose a new method for image enhancement by using contrast limited adaptive histogram equalization method. We propose a general framework with a adaptive histogram equalization method. We are going to prove its effectiveness in comparison to other contrast enhancement method.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"130 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87784849","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726695
C. Abilash, B. Lakshminath
This paper mainly concentrates on the control of Lunar-bots and is also applicable to other kinds of robots like the one used in warfare, medical surgeries, and even the one that is used for UAV automation using the world wide accessed internet communication with Earth Moon Communication (EMC). This paper discusses the unique way in which we can control the robot deployed in the Moon for space research using EMC (Earth Moon Communication) technique and all other robots located anywhere in the world with the help of a simple webpage loaded with controls. Here a particular webpage is created over the internet whose administrator privileges are restricted to the authority. The robot in which this system is implemented also has access to the webpage, but is read only. The input to the webpage is designed by using simple LabVIEW programs interfacing sophisticated piezoelectric, tactile sensors and other sensor systems to provide gesture, speech, and image inputs. This LabVIEW program is then sourced to an administrative website. The robot is already programmed in such a way that it is able to understand and synchronize with these commands uniquely. The robot which is permanently connected to the internet with the help of wireless modem (3G/4G), can read these commands with ease. This control is extended to the moon by deploying EMC, developed from the existing ancient Moon Bounce technique. This is accomplished by replacing the Moon's rugged reflector surface by a parabolic reflector antenna. Two similar antennas are placed on diametrically opposite zones of Earth in order to maintain the path of sight with the Moon. BPSK (Binary Phase Shift Keying) modulation is employed here. Using this technique we can extend the internet connectivity to the lunar atmosphere. In addition, these robots are also pre-programmed with Artificial Intelligence (AI), in order to survive communication breakdowns. In this mode it acts precisely according to the sustaining environment.
{"title":"Earth Moon Communication incorporated Internet webpage based control for robots","authors":"C. Abilash, B. Lakshminath","doi":"10.1109/ICCCNT.2013.6726695","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726695","url":null,"abstract":"This paper mainly concentrates on the control of Lunar-bots and is also applicable to other kinds of robots like the one used in warfare, medical surgeries, and even the one that is used for UAV automation using the world wide accessed internet communication with Earth Moon Communication (EMC). This paper discusses the unique way in which we can control the robot deployed in the Moon for space research using EMC (Earth Moon Communication) technique and all other robots located anywhere in the world with the help of a simple webpage loaded with controls. Here a particular webpage is created over the internet whose administrator privileges are restricted to the authority. The robot in which this system is implemented also has access to the webpage, but is read only. The input to the webpage is designed by using simple LabVIEW programs interfacing sophisticated piezoelectric, tactile sensors and other sensor systems to provide gesture, speech, and image inputs. This LabVIEW program is then sourced to an administrative website. The robot is already programmed in such a way that it is able to understand and synchronize with these commands uniquely. The robot which is permanently connected to the internet with the help of wireless modem (3G/4G), can read these commands with ease. This control is extended to the moon by deploying EMC, developed from the existing ancient Moon Bounce technique. This is accomplished by replacing the Moon's rugged reflector surface by a parabolic reflector antenna. Two similar antennas are placed on diametrically opposite zones of Earth in order to maintain the path of sight with the Moon. BPSK (Binary Phase Shift Keying) modulation is employed here. Using this technique we can extend the internet connectivity to the lunar atmosphere. In addition, these robots are also pre-programmed with Artificial Intelligence (AI), in order to survive communication breakdowns. In this mode it acts precisely according to the sustaining environment.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"59 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89537019","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726500
Chengani VinodChandra, S. Ramasamy
The test generation problem for circuits is known to be NP-hard. Efficient techniques for test generation are essential in order to reduce the test generation time. Test patterns were generated using ATPG (Automatic Test Pattern Generation) and faults were inserted in the netlist file generated using DFT (Design for Test). Here ATPG is achieved using the combination of Design Compiler and the Tetramax. Fault coverage and test patterns were generated. It was observed that neither a comprehensive functional verification sequence nor a sequence with high stuck-at fault coverage gives high transition fault coverage for sequential circuits. A customized LFSR algorithm is used to find the fault coverage and pattern used to detect the faults. It is found that LFSR techniqque seems to be good when compared to the ATPG tool for the small and medium circuits. LFSR technique yields 100% fault coverage where as Tetramax is giving about 97% fault coverage.
{"title":"Test pattern generation for benchmark circuits using LFSR","authors":"Chengani VinodChandra, S. Ramasamy","doi":"10.1109/ICCCNT.2013.6726500","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726500","url":null,"abstract":"The test generation problem for circuits is known to be NP-hard. Efficient techniques for test generation are essential in order to reduce the test generation time. Test patterns were generated using ATPG (Automatic Test Pattern Generation) and faults were inserted in the netlist file generated using DFT (Design for Test). Here ATPG is achieved using the combination of Design Compiler and the Tetramax. Fault coverage and test patterns were generated. It was observed that neither a comprehensive functional verification sequence nor a sequence with high stuck-at fault coverage gives high transition fault coverage for sequential circuits. A customized LFSR algorithm is used to find the fault coverage and pattern used to detect the faults. It is found that LFSR techniqque seems to be good when compared to the ATPG tool for the small and medium circuits. LFSR technique yields 100% fault coverage where as Tetramax is giving about 97% fault coverage.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88100063","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}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726496
C. C. Kavar, S. Parmar
The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.
{"title":"Improve the performance of LRU page replacement algorithm using augmentation of data structure","authors":"C. C. Kavar, S. Parmar","doi":"10.1109/ICCCNT.2013.6726496","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726496","url":null,"abstract":"The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"9 4 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83611297","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：