{"title":"WCA based re-clustering approach in DSR and OLSR routing protocols in MANET","authors":"Mahesh Gochar, Ravinder Singh","doi":"10.1109/rise.2017.8378205","DOIUrl":"https://doi.org/10.1109/rise.2017.8378205","url":null,"abstract":"This is a weighted cluster algorithm based on re-clustering approach for OLSR and DSR protocols in MANET. In this protocol, all the nodes of the networks are clustered into a single cluster; we have analyzed the way how to compute the trusting values according to their interaction performances between the nodes. Based on the trusting value, we can decide and check whether the connection between the two nodes is reliable or not. On the basis of no. of reliable connections, we can choose the cluster head in the cluster, and the nodes which hold solid association with cluster head will be the base nodes, base nodes and the cluster head can work together for being the service providing congregation (group) for the cluster. Each member will circulate a secret share mechanism which will be a part of secret key for itself, and come into being the parameter of authentication in the processing of investigation about the up to date requirement in the next cluster, and the obscure and secret share mechanism can also be authenticated by the node itself. One node has been confirmed as a malicious node at a time; cluster head broadcasts the information to all the cluster members and refuse to provide updating service for the particular malicious node. The protocol has absolute forward confidentiality and backward confidentiality. The keys of nodes and cluster are generated after discussion among the service group members, Man-in-the-middle attack can be resisted by this way. At the same time, the cluster can achieve the periodic update, the cluster head will be reelected, service group will be reformed, subsequently, the key of cluster and nodes will be updated as well.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114181428","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":"Delay analysis of a dynamic latched comparator","authors":"S. Ulhaq, R. K. Baghel, T. Gupta","doi":"10.1109/RISE.2017.8378198","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378198","url":null,"abstract":"The need for ultra low-power area efficient, and high speed analog-to-digital converters is pushing toward the use of dynamic latched comparators to maximize speed and power efficiency. In this paper, a conventional single tail dynamic comparator consisting of two back to back inverter in 180-nm technology is being analyzed and modified for low power dissipation. The delay and power analysis gives the idea about modification to be made in the former circuit. The mathematical relation has been presented, which gives the dependency of delay on different parameters. The delay mainly depends on the effective transconductance gmeff and the initial output voltage difference ΔV0. The simulation is being carried out on cadence virtuoso's Analog Design Environment. Post Layout simulation results in a 180nm CMOS technology confirm the analysis results.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122120692","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":"Gaussian kernel filtering for video stabilization","authors":"P. Rawat, Manish D. Sawale","doi":"10.1109/RISE.2017.8378142","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378142","url":null,"abstract":"Kernel based methods are most popular non parametric estimators. There are various types of kernels which are used for filtering the video sequences. Gaussian kernel filtering is widely used method to remove unwanted fluctuations present in the video sequences because they are simple to implement. Gaussian filters are designed to give no overshoot to a step function input while minimizing the rise and fall time. This behavior is closely connected to the fact that the Gaussian filter has the minimum possible group delay. But the use of the large gaussian kernel might lead to the blurring effect and small gaussian kernel may not effectively remove the high frequency camera motion. Hence it needs to find the optimal value of gaussian kernel. Most of previous methods suffer from the problem of the large missing image areas. Temporal mean or median filter is the optimal approach to removing the noise when the corrupting noise on each video frame is identically and independently drawn from a zero mean distribution. But they have limited performance for smoothing the inter frame motion. The paper discusses the mean, median and gaussian kernel filters for smoothing the video sequences. First video sequences are stabilized using hierarchical global motion estimation and then kernel filtering is used to remove the accumulation error. The performance of the gaussian kernel filtering is then compared with the mean and median filters. Motion in X and Y direction after estimation and compensation is compared for different gaussian kernels. Proposed video stabilization technique is experimented on the large variety of videos taken in real time environment with different motions.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128744709","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}
Amit D. Joshi, S. Indrajeet, N. Ramasubramanian, B. S. Begum
{"title":"Analysis of multi-core cache coherence protocols from energy and performance perspective","authors":"Amit D. Joshi, S. Indrajeet, N. Ramasubramanian, B. S. Begum","doi":"10.1109/RISE.2017.8378186","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378186","url":null,"abstract":"Multi-core processors are widely spread in today's computing environment. These processors provide high performance by executing programs independently on multiple cores. Multithreading helps programmer to execute tasks independently by utilizing underlying computing architecture appropriately. Multiple threads share common memory space. Shared memory architectures face the problem of cache coherence. Different techniques has been devised to keep caches coherent. These techniques have their own advantages and disadvantages. The prime aim of computer architects is to provide a much better computing environment along with high performance and less energy consumption. The processors required for smart phone devices have major concern with energy efficiency. Recent research shows that hybridization of cache coherence techniques is being carried out to achieve the goals like high performance, energy efficiency and scalability. This work gives a focus on analysis of existing cache coherence techniques independently. These techniques can be integrated together for hybridization of cache coherence techniques. In particular, the issues like performance analysis and energy consumption of snoopy and directory based cache coherence variants are addressed. Snoopy protocol performance gets affected due to on-chip traffic. It has been observed that MOESI CMP Token cache coherence protocol is energy and performance efficient than all other variants.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123823619","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":"Impulse noise removal with zero's padding by median based adaptive filter","authors":"Prashant Goyal, Vijayshri Chaurasia, O. P. Meena","doi":"10.1109/RISE.2017.8378129","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378129","url":null,"abstract":"Random valued impulse noise (RVIN) is one of the most frequently occurring noise in images. This paper presents a median based dual threshold system for removal of RVIN. Dual threshold value improves the accuracy of noise detection in noisy image. In proposed technique additional measures are taken for noise removal at boundary pixels by using zero. By means of simulation results, it has been confirmed that the proposed system improves the precision of the image denoising process and offers better image quality.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116503375","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":"Asynchronous pilot transmission with pilot sequence hopping for improved channel estimation in massive MIMO system","authors":"Amrita Ruperee, S. Nema","doi":"10.1109/RISE.2017.8378135","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378135","url":null,"abstract":"The most crucial factor which affects the performance of Multi-User Multi-cell Massive MIMO system is the pilot contamination. Pilot contamination is nothing but the interference caused by reuse of the pilot sequences to accommodate more number of users. Contaminated pilot results in poor channel estimation at the BS (Base Station). Addressing the problem of pilot contamination is the prime concern in Multicell Massive MIMO system. In the proposed scheme, instead of transmitting pilot sequence synchronously by all user terminals of all the cells, time shifted pilot sequence transmission in a non-overlapping time interval along with pilot sequence hopping is used at each coherence interval. Pilot sequence hopping causes random position of interfering user terminals. Therefore, changing the channel coefficient in each transmission slot, which results in better channel estimation as the group of interfering user terminals changes. At the BS, Mean Square Error (MSE) which is the measure of channel estimation and Pilot signal power to Interference power Ratio (PSIR) are calculated for less aggressive frequency reuse factor for the pilot sequences.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126523414","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":"Embedded system for automatic real time weight based grading of fruits","authors":"S. Chakraborty, K. Dubey","doi":"10.1109/RISE.2017.8378209","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378209","url":null,"abstract":"After harvest fruits are required to be prepared for sale. Arrangements on the part of the producer that lead to reduced handling will lower cost and preserve quality of the produce. Weight is a key factor based on which fruits are purchased by consumers. In the present research work a micro controller has been used to carry out weight based grading system for fruits. The machine is capable of weighing and separation of fruits into different weight categories without any human intervention. Developed machine comprises a load cell sensors, SSR relays, solenoid, anlaog to digital convertor and a Arduino Mega 2560 micro controller. Algorithm was developed to register weight recorded by load cells and accordingly actuate solenoids for accurate (±1 g) categorization of the spherical fruits under three weight categories, Small: < 70 g, Medium: 70 g to 120 g and Large: > 120 g. These weight categories can however be programmed as per the requirement of the user. The overall ‘Accuracy’ of the machine over all the weight categories was observed to be 88 percent.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134438301","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":"Performance analysis of routing protocol based on sojourn time in MANET","authors":"S. Jain, A. Shrivastava, Anjana Jain","doi":"10.1109/RISE.2017.8378219","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378219","url":null,"abstract":"A Mobile Ad hoc Network (MANET) is an infrastructure-less network of wireless mobile nodes that can communicate with one another directly or via intermediate nodes. Connectivity breaks between nodes, resulting from random fashioned nodes movement, are a serious problem for MANET routing protocols. Though, sometimes the selected routes which are based on hop count are having weak quality links, implies low SNR, which results higher rate of frame error, higher end to end delay and lower throughput. This present mechanism permits the network layer to modify its routing protocol dependent on Received Power and SNR along the source to destination route for every transmission link. This proposed routing method uses signal-to-noise ratio (SNR) of a link for getting value of its sojourn time and allot a link cost value on the basis of calculated sojourn time. Sojourn time is assumed to follow a Rayleigh distribution. Link cost is inversely proportional to sojourn time. Node which is connected to its previous node with less link cost is chosen as next neighbor node on the way of source to destination route establishment. The performance analysis was evaluating our approach (Sojourn Time-ST-AODV) and AODV, to illustrate that our proposed methodology improved the performance of AODV. Finally, justify network performance on NS-2 network simulator platform depending on the basic network parameters such as delay and throughput in respect of nodes and different transmission rates of mobile nodes.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128907668","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":"Cloud computing: A Juxtapositioning with grid computing","authors":"Tasneem Bano Rehman","doi":"10.1109/RISE.2017.8378207","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378207","url":null,"abstract":"Computing has changed the way humans solve problems. It has changed the world more than any other innovation in the recent past. Over the last couple of years, there has been an increased interest in utilizing computing processor powers to its maximum. Cloud, cluster and grid computing are the most common types of computing. All these share some common features toward achieving utility although marginal differences exist in their processes and approaches. The paper presents the relationship and the differences of grid computing from cloud computing in terms of their architecture, applications, security and tools.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123695080","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":"Novel audio feature set for monophonie musical instrument classification","authors":"Shubham Bahre, S. Mahajan, Rohan T. Pillai","doi":"10.1109/RISE.2017.8378218","DOIUrl":"https://doi.org/10.1109/RISE.2017.8378218","url":null,"abstract":"This paper proposes a novel set of parameters for musical instrument classification of three different instrument classes of the instrument from audio recordings of monophonie musical sounds notes. The proposed method extracted three features: attack slope, constant Q transform and cepstral coefficients. The algorithm consisted of feature extraction and classifier learning steps. Thus, this system depends upon low-level features. A maximum accuracy of 87% was obtained when tested on the database obtained from University of IOWA Electronic Music Studios. Confusion matrix and subsequent significant classification metrics have been computed. This classification scheme finds application in audio indexing, content based retrieval, genre identification of instrumental music.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122170796","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}