Pub Date : 1900-01-01DOI: 10.1109/ICACCS.2016.7586321
Lijo Thomas, S. Panicker, J. Daniel, Tilty Tony
The increasing number of collisions at intersections calls for a reliable and safe, real time collision warning system that can alert the drivers about a potential collision. Although many kinds of collision warning systems are available, the problems related to acceleration change and curved road scenarios are to be considered to improve the accuracy of the system. In the proposed paper, an efficient intersection collision avoidance system for straight and curved roads are considered. The objective of the project is to predict the location of the vehicle 10 seconds in future. The location, speed and heading information of a vehicle are available through a GPS device. Accelerometer provides the acceleration/deceleration information of the vehicles. Kalman filter with GPS and accelerometer as inputs can be used to predict the future location of the vehicle. These predicted locations are checked to be on the road or not using GIS map. If off road, the locations are projected onto the road with the help of the coordinate data. A warning message in the form of alarms or lights are generated when the distance between the predicted locations of the host vehicle and target vehicle falls below a threshold value. Position information are exchanged between the vehicles using Dedicated Short Range Communication. The MATLAB simulation results validate our proposed system by reducing the prediction error with the combination of GIS and kalman filter. False alarms are reduced considerably in the proposed system for collision avoidance.
{"title":"DSRC based collision warning for vehicles at intersections","authors":"Lijo Thomas, S. Panicker, J. Daniel, Tilty Tony","doi":"10.1109/ICACCS.2016.7586321","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586321","url":null,"abstract":"The increasing number of collisions at intersections calls for a reliable and safe, real time collision warning system that can alert the drivers about a potential collision. Although many kinds of collision warning systems are available, the problems related to acceleration change and curved road scenarios are to be considered to improve the accuracy of the system. In the proposed paper, an efficient intersection collision avoidance system for straight and curved roads are considered. The objective of the project is to predict the location of the vehicle 10 seconds in future. The location, speed and heading information of a vehicle are available through a GPS device. Accelerometer provides the acceleration/deceleration information of the vehicles. Kalman filter with GPS and accelerometer as inputs can be used to predict the future location of the vehicle. These predicted locations are checked to be on the road or not using GIS map. If off road, the locations are projected onto the road with the help of the coordinate data. A warning message in the form of alarms or lights are generated when the distance between the predicted locations of the host vehicle and target vehicle falls below a threshold value. Position information are exchanged between the vehicles using Dedicated Short Range Communication. The MATLAB simulation results validate our proposed system by reducing the prediction error with the combination of GIS and kalman filter. False alarms are reduced considerably in the proposed system for collision avoidance.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131711400","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586351
Akash Garg, P. Maheshwari
The most important purpose of intrusion detection system is to identify attacks against information systems. It is a security method attempting to identify various attacks. Snort is mostly used signature based IDS because it is an open source software. It is used world widely in intrusion detection and prevention domain. In this paper, we used IDEVAL data set we detect attacks using Snort on this dataset.
{"title":"Performance analysis of Snort-based Intrusion Detection System","authors":"Akash Garg, P. Maheshwari","doi":"10.1109/ICACCS.2016.7586351","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586351","url":null,"abstract":"The most important purpose of intrusion detection system is to identify attacks against information systems. It is a security method attempting to identify various attacks. Snort is mostly used signature based IDS because it is an open source software. It is used world widely in intrusion detection and prevention domain. In this paper, we used IDEVAL data set we detect attacks using Snort on this dataset.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128957478","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586360
M. Maharaja, T. Sivakumar
This paper presents a novel method to classify coal texture into the six major categories, namely, Anthracite, Lignite, Bituminous, Sub-bituminous, Graphite and Peat. Coal textures are stochastic in nature. The existing classification and retrieval algorithms work well for the classification of regular texture, but fail to give the same results for the stochastic textures. Stochastic textures are mixture of textures. These textures can be identified only by visually meaningful classifiers. Coal textures are classified by calculating the Tamura features, since they give near-eye perception. This computer vision based algorithm can be used for automated coal texture classification. The proposed method outperforms the other previously developed methods by providing the classification accuracy of more than 87% for all the types of coal.
{"title":"Classification of non-homogenous coal textures","authors":"M. Maharaja, T. Sivakumar","doi":"10.1109/ICACCS.2016.7586360","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586360","url":null,"abstract":"This paper presents a novel method to classify coal texture into the six major categories, namely, Anthracite, Lignite, Bituminous, Sub-bituminous, Graphite and Peat. Coal textures are stochastic in nature. The existing classification and retrieval algorithms work well for the classification of regular texture, but fail to give the same results for the stochastic textures. Stochastic textures are mixture of textures. These textures can be identified only by visually meaningful classifiers. Coal textures are classified by calculating the Tamura features, since they give near-eye perception. This computer vision based algorithm can be used for automated coal texture classification. The proposed method outperforms the other previously developed methods by providing the classification accuracy of more than 87% for all the types of coal.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131170333","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586369
K. Papithasri, M. Babu
The high efficiency of Wireless Sensor Networks (WSNs) purely depends on the data collection scheme. Several data gathering schemes such as multipath, tree, chain, cluster and hybrid topologies are available in literature for gathering data in WSNs. However, the existing data gathering schemes failed to provide a guaranteed reliable network in terms of traffic, mobility, and end-to-end connection. Recent work shows sink mobility can increase the energy efficiency in WSNs. However, data delivery latency often increases owing to the speed limit of Mobile Sink. Most of them utilize the mobility, to address the problem of data gathering in WSNs. In this project, first define WSNs with Mobile Sink and provide an exhaustive taxonomy of their architectures, based on the role of MS. Then, present an overview of load balanced cluster and dual data uploading data gathering process in such a scenario, and recognize the corresponding challenges and issues. On the basis of these issues, Delay Aware Adaptive Multi Hop Routing Protocol called DAMHR is proposed, which is a heuristic method that locates a near-optimal traveling tour that minimizes the energy consumption of sensor nodes and improves the data gathering. Path selection problem is focused in load balanced clustering and delay-guaranteed sensor networks with a path-constrained mobile sink and concentrate on an efficient data gathering scheme, that simultaneously increases the total amount of data and reduces the energy consumption. The optimal path is preferred to meet the necessary on delay as well as minimizes the energy consumption of entire network. Predictable sink mobility is demoralized to improve energy efficiency of sensor networks.
无线传感器网络(WSNs)的高效性完全取决于数据采集方案。文献中提出了多路径、树、链、簇和混合拓扑等数据采集方案。但是，现有的数据采集方案在流量、移动性、端到端连接等方面都不能保证提供可靠的网络。最近的研究表明，汇迁移可以提高无线传感器网络的能量效率。然而，由于移动Sink的速度限制，数据传输延迟往往会增加。它们大多利用移动性来解决无线传感器网络的数据采集问题。在本项目中，首先定义了具有移动Sink的wsn，并基于ms的作用提供了其架构的详尽分类，然后概述了这种场景下的负载均衡集群和双数据上传数据采集过程，并认识到相应的挑战和问题。基于这些问题，提出了延迟感知自适应多跳路由协议(Delay - Aware Adaptive Multi Hop Routing Protocol, DAMHR)，该协议是一种启发式方法，它定位了一个接近最优的旅行，使传感器节点的能量消耗最小化，并提高了数据收集的效率。研究了具有路径约束移动汇聚的负载均衡聚类和时延保证传感器网络的路径选择问题，重点研究了在增加数据总量的同时降低能耗的高效数据采集方案。选择最优路径，既能满足所需的时延，又能使整个网络的能耗最小。为了提高传感器网络的能量效率，降低了可预测的汇迁移率。
{"title":"Efficient multihop dual data upload clustering based mobile data collection in Wireless Sensor Network","authors":"K. Papithasri, M. Babu","doi":"10.1109/ICACCS.2016.7586369","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586369","url":null,"abstract":"The high efficiency of Wireless Sensor Networks (WSNs) purely depends on the data collection scheme. Several data gathering schemes such as multipath, tree, chain, cluster and hybrid topologies are available in literature for gathering data in WSNs. However, the existing data gathering schemes failed to provide a guaranteed reliable network in terms of traffic, mobility, and end-to-end connection. Recent work shows sink mobility can increase the energy efficiency in WSNs. However, data delivery latency often increases owing to the speed limit of Mobile Sink. Most of them utilize the mobility, to address the problem of data gathering in WSNs. In this project, first define WSNs with Mobile Sink and provide an exhaustive taxonomy of their architectures, based on the role of MS. Then, present an overview of load balanced cluster and dual data uploading data gathering process in such a scenario, and recognize the corresponding challenges and issues. On the basis of these issues, Delay Aware Adaptive Multi Hop Routing Protocol called DAMHR is proposed, which is a heuristic method that locates a near-optimal traveling tour that minimizes the energy consumption of sensor nodes and improves the data gathering. Path selection problem is focused in load balanced clustering and delay-guaranteed sensor networks with a path-constrained mobile sink and concentrate on an efficient data gathering scheme, that simultaneously increases the total amount of data and reduces the energy consumption. The optimal path is preferred to meet the necessary on delay as well as minimizes the energy consumption of entire network. Predictable sink mobility is demoralized to improve energy efficiency of sensor networks.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130936098","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586376
U. Nanda, S. K. Pattnaik
All most all computers and microcontrollers have several serial data ports used to communicate with serial input/output devices such as keyboards and serial printers. By using a modem connected to a serial port serial data can be transmitted to and received from a remote location via telephone line. The serial communication interface, which receives and transmits the serial data is called a UART (Universal Asynchronous Receiver-Transmitter). RxD is the received serial data signal and TxD is transmitted data signal. In this project UART is implemented in virtex II pro FPGA chip due to low cost, high speed, reprogram ability and fast time to market.
几乎所有的计算机和微控制器都有几个串行数据端口，用于与串行输入/输出设备(如键盘和串行打印机)通信。通过使用连接到串行端口的调制解调器，可以通过电话线向远程位置发送和接收串行数据。接收和传输串行数据的串行通信接口称为UART(通用异步收发器)。RxD是接收的串行数据信号，TxD是发送的数据信号。在这个项目中，由于低成本、高速度、可重编程能力和快速上市，UART在virtex II pro FPGA芯片上实现。
{"title":"Universal Asynchronous Receiver and Transmitter (UART)","authors":"U. Nanda, S. K. Pattnaik","doi":"10.1109/ICACCS.2016.7586376","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586376","url":null,"abstract":"All most all computers and microcontrollers have several serial data ports used to communicate with serial input/output devices such as keyboards and serial printers. By using a modem connected to a serial port serial data can be transmitted to and received from a remote location via telephone line. The serial communication interface, which receives and transmits the serial data is called a UART (Universal Asynchronous Receiver-Transmitter). RxD is the received serial data signal and TxD is transmitted data signal. In this project UART is implemented in virtex II pro FPGA chip due to low cost, high speed, reprogram ability and fast time to market.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132158566","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586328
Romil Chauhan, Yash S. Jain, Harsh Agarwal, Khushali Deulkar
There are many traditional techniques through which diseases can be detected. Nadi Pareeksha is one of the most effective traditional techniques amongst them. Diseases can be detected using this technique by sensing various features of the pulse. This technique was originally implemented using the three fingers of human hand namely: the index, middle and ring finger. The exponential growth in the Artificial Intelligence domain has led to the creation of intelligent devices which can sense the pulse rate and detect diseases. In this paper, we are going to study their implementation and get to know about the various diseases which can be detected through them.
{"title":"Comparative study of various techniques to diagnose disease using Pulse sensing","authors":"Romil Chauhan, Yash S. Jain, Harsh Agarwal, Khushali Deulkar","doi":"10.1109/ICACCS.2016.7586328","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586328","url":null,"abstract":"There are many traditional techniques through which diseases can be detected. Nadi Pareeksha is one of the most effective traditional techniques amongst them. Diseases can be detected using this technique by sensing various features of the pulse. This technique was originally implemented using the three fingers of human hand namely: the index, middle and ring finger. The exponential growth in the Artificial Intelligence domain has led to the creation of intelligent devices which can sense the pulse rate and detect diseases. In this paper, we are going to study their implementation and get to know about the various diseases which can be detected through them.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114983627","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586381
P. A. Jadhav, P. Chatur
Image matching or object matching is one of the cutting edge research fields in machine learning or computer vision domain. Whereas aim of image matching techniques is to build geometrical transformations over source image and target image, videos, real time moving object to extract similarity measure. Several research methods devised for image matching but efficiency of techniques is bounded with various parameters such as image rotation, speed, blurriness, quality etc., these parameters are important while understanding and devising robust image matching techniques. Study and analysis of image matching parameters is highly important while learning and understanding, predicting performance when time is a limiting factor for implementation. Several approaches have been presented to achieve efficiency over real time object matching. Now in this paper we have presented fundamentals of object matching based on geometrical transformation to match object. Comprehensive review of existing methods with analysis of image matching parameters is presented to determine the limitations of existing methods. This review also addresses comparative study of existing image matching techniques to generalize criteria for design of robust technique.
{"title":"Machine learning techniques to build geometrical transformations for object matching a review","authors":"P. A. Jadhav, P. Chatur","doi":"10.1109/ICACCS.2016.7586381","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586381","url":null,"abstract":"Image matching or object matching is one of the cutting edge research fields in machine learning or computer vision domain. Whereas aim of image matching techniques is to build geometrical transformations over source image and target image, videos, real time moving object to extract similarity measure. Several research methods devised for image matching but efficiency of techniques is bounded with various parameters such as image rotation, speed, blurriness, quality etc., these parameters are important while understanding and devising robust image matching techniques. Study and analysis of image matching parameters is highly important while learning and understanding, predicting performance when time is a limiting factor for implementation. Several approaches have been presented to achieve efficiency over real time object matching. Now in this paper we have presented fundamentals of object matching based on geometrical transformation to match object. Comprehensive review of existing methods with analysis of image matching parameters is presented to determine the limitations of existing methods. This review also addresses comparative study of existing image matching techniques to generalize criteria for design of robust technique.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117255656","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586338
P. Srivastava, Harninder Rai, Pankaj Chauhan
The paper discusses a software solution for contention between Long Term Evolution (LTE) layer 1 (L1) Time Division Duplex (TDD) software which is a soft real time system with strict timing compliance requirements and Linux Real Time operating system over shared Serial Peripheral Interface (SPI). The cores of the asymmetric multiprocessor systems are agnostic to each other's activities and share SPI in real time with no synchronization mechanism existing between them. The solution effectively mitigates the possibility of contention by converting non deterministic SPI transactions into externally triggered deterministic SPI transactions and provides mechanism to detect contention if it occurs under high L1 load scenarios. In the case of contention, an effective retry mechanism is put in place as a part of proposed solution. The paper concludes by providing various scenarios in which the proposed solution can be leveraged.
{"title":"Real-time SPI based radio control solving Hardware contention for asymmetric multicore LTE systems","authors":"P. Srivastava, Harninder Rai, Pankaj Chauhan","doi":"10.1109/ICACCS.2016.7586338","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586338","url":null,"abstract":"The paper discusses a software solution for contention between Long Term Evolution (LTE) layer 1 (L1) Time Division Duplex (TDD) software which is a soft real time system with strict timing compliance requirements and Linux Real Time operating system over shared Serial Peripheral Interface (SPI). The cores of the asymmetric multiprocessor systems are agnostic to each other's activities and share SPI in real time with no synchronization mechanism existing between them. The solution effectively mitigates the possibility of contention by converting non deterministic SPI transactions into externally triggered deterministic SPI transactions and provides mechanism to detect contention if it occurs under high L1 load scenarios. In the case of contention, an effective retry mechanism is put in place as a part of proposed solution. The paper concludes by providing various scenarios in which the proposed solution can be leveraged.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121992972","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586319
D. S. Bhadane, S. Kanawade
Wireless sensor network is very active research area. WSNs are very popular nowadays due to their wide range of application areas like in health monitoring, industrial monitoring, environmental monitoring, inventory location monitoring, surveillance, factory and process automation, object tracking, precision agriculture, disaster management, and equipment diagnostics etc. To perform a specific task sensor nodes in WSNs communicate with each other wirelessly and they are generally self-organized. Each node is equipped with sensors, battery, processor, wireless transceiver, and memory. Due to the limited capacity of the batteries, it is important to consider the energy (power) in the design and deployment of wireless sensor networks (WSNs). Energy is consumed during sensing, processing and communication. But the major power consumer is the communication unit in WSNs, one of possible solution that can help to reduce the amount of data transmitted between wireless sensor nodes resulting in power saving is the use of efficient data compression technique. In this paper we evaluate a K-RLE method which is inspired from existing Run Length Encoding algorithm. Method is designed in Matlab software. With creating effective GUI, we show here the compression ratios for different values of K with variable input temperature dataset values. We get higher compression ratios for long length of runs. It is found that as the values of K goes on increasing, the compression ratios are very high. K-RLE is efficient but lossy technique.
{"title":"Comparative study of RLE & K-RLE compression and decompression in WSN","authors":"D. S. Bhadane, S. Kanawade","doi":"10.1109/ICACCS.2016.7586319","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586319","url":null,"abstract":"Wireless sensor network is very active research area. WSNs are very popular nowadays due to their wide range of application areas like in health monitoring, industrial monitoring, environmental monitoring, inventory location monitoring, surveillance, factory and process automation, object tracking, precision agriculture, disaster management, and equipment diagnostics etc. To perform a specific task sensor nodes in WSNs communicate with each other wirelessly and they are generally self-organized. Each node is equipped with sensors, battery, processor, wireless transceiver, and memory. Due to the limited capacity of the batteries, it is important to consider the energy (power) in the design and deployment of wireless sensor networks (WSNs). Energy is consumed during sensing, processing and communication. But the major power consumer is the communication unit in WSNs, one of possible solution that can help to reduce the amount of data transmitted between wireless sensor nodes resulting in power saving is the use of efficient data compression technique. In this paper we evaluate a K-RLE method which is inspired from existing Run Length Encoding algorithm. Method is designed in Matlab software. With creating effective GUI, we show here the compression ratios for different values of K with variable input temperature dataset values. We get higher compression ratios for long length of runs. It is found that as the values of K goes on increasing, the compression ratios are very high. K-RLE is efficient but lossy technique.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666684","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586358
K. Nehru, M. Ramesh Babu, J. Sravana, Shashikanth Reddy
In this paper, we present the implementation of high speed 16-Bit CRC Generator architecture using gate diffusion input technique. The main objective of CRC generator is used for error detection in communication systems. The Gate Diffusion Input logic is a technique that are used to reduce transistor count and power consumption of sequential circuits. The hardware component of CRC is consists of group of D flip-flops. Here the gate diffusion input logic based D flip-flop is a basic cell to design a CRC Generator, maintaining low complexity of logic design. The design of 16 Bit CRC generator using GDI technique reports 59.95 % improvement in power consumption and 19% reduction in transistor count compared to conventional CMOS technique.
{"title":"Performance analysis of low power and high speed 16-Bit CRC Generator using GDI technique","authors":"K. Nehru, M. Ramesh Babu, J. Sravana, Shashikanth Reddy","doi":"10.1109/ICACCS.2016.7586358","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586358","url":null,"abstract":"In this paper, we present the implementation of high speed 16-Bit CRC Generator architecture using gate diffusion input technique. The main objective of CRC generator is used for error detection in communication systems. The Gate Diffusion Input logic is a technique that are used to reduce transistor count and power consumption of sequential circuits. The hardware component of CRC is consists of group of D flip-flops. Here the gate diffusion input logic based D flip-flop is a basic cell to design a CRC Generator, maintaining low complexity of logic design. The design of 16 Bit CRC generator using GDI technique reports 59.95 % improvement in power consumption and 19% reduction in transistor count compared to conventional CMOS technique.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132775347","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
扫码关注我们
求助内容：
应助结果提醒方式：