{"title":"E3BFT: Energy efficient and energy balanced fault tolerance clustering in Wireless Sensor Networks","authors":"S. Gupta, P. Kuila, P. K. Jana","doi":"10.1109/IC3I.2014.7019694","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019694","url":null,"abstract":"Wireless Sensor Networks (WSNs) consist of sensor nodes, which are small in size with limited energy and computational power. The main function of WSN is to route sensed data to base station (BS), however the main constraint in WSN is irreplaceable power sources of sensor nodes. In this paper, a distributed energy efficient and energy balanced clustering algorithm is proposed. A sensor node selects a cluster head (CH) having minimum routing overhead with higher ratio of residual energy of CH and corresponding distance. Routing overhead of CH is calculated only when the route from individual CH to base station (BS) is defined, so for defining the route amongst CH, we execute GA based routing algorithm named as GAR [1] before selection of CH by sensor nodes. Proposed algorithm also takes care of those sensor nodes, which are not in communication range of CH. This is also complimented with fault tolerant issue of WSNs as the sensor nodes are prone to failure.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122184316","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":"Orchestration of cloud computing virtual resources","authors":"Mayanka Katyal, A. Mishra","doi":"10.1109/IC3I.2014.7019756","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019756","url":null,"abstract":"Cloud computing is a hotly debated and researched topic amongst all group of users ranging from industry to academia. It has highly raised the expectations of small, medium and large enterprises beyond measure. Many organizations have migrated to cloud. The progressive use of cloud resources in the entire IT sector urged the need for better management of cloud infrastructure. Cloud infrastructure needs most efficient management techniques to cater to increasingly growing demands of users. Cloud computing has evolved tremendously and is still constantly undergoing changes. This paper gives the overview of cloud orchestration software along with their features.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114239921","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}
Anushikha Singh, M. Dutta, M. Parthasarathi, Radim Burget, K. Říha
{"title":"An efficient automatic method of Optic disc segmentation using region growing technique in retinal images","authors":"Anushikha Singh, M. Dutta, M. Parthasarathi, Radim Burget, K. Říha","doi":"10.1109/IC3I.2014.7019713","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019713","url":null,"abstract":"Segmentation of Optic disc (OD) from a retinal image is a essential step while developing automated screening systems for eye disease like diabetic retinopathy, Glaucoma etc. This paper proposes a method of automatic optic disk segmentation based on region growing technique with automatic seed selection. In this method centre of optic disk is considered as a seed to apply region growing technique to segment the optic disk from the preprocessed retinal image. Automatic detection of centre of optic disk is done by double windowing method. The algorithm uses image processing techniques like contrast adjustment, morphological operations & filtering to process the retinal image and to remove the blood vessels from the retinal image. The performance of optic disk segmentation by proposed method is compared with Optic disk segmentation by ophthalmologists and results are found convincing and efficient. The experimental results indicate this method of segmentation of the OD has good accuracy and also is computationally cheap.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121456007","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":"Personal informatics weave your numbers","authors":"S. Anbalagan, G. Grinstein, Shweta Purushe","doi":"10.1109/IC3I.2014.7019775","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019775","url":null,"abstract":"There are often several interconnected complex factors affecting one's healthy behavior. Visualization of a single factor, as current tools provide, is limited and makes overall analysis difficult. We describe a system that supports both the self-monitoring of vital statistics as well as the collaborative exploratory analysis of multivariate contextual and behavioral information with respective domain experts. These analyses, data and visualizations are automatically shared through the use Google Drive.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124025666","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}
Sonali P. Kadam, Varsha S. Naikwadi, Kaveree S. Belamkar, Aruna S. Andhare, Mayuri M. Mohite
{"title":"Clustering based - A FAST algorithm on high dimensional data","authors":"Sonali P. Kadam, Varsha S. Naikwadi, Kaveree S. Belamkar, Aruna S. Andhare, Mayuri M. Mohite","doi":"10.1109/IC3I.2014.7019751","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019751","url":null,"abstract":"The rapid advance of computer technologies in data processing, collection and storage has provided unparalleled opportunities to expand capabilities in production, services communication and research. However, a feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. It finds the subset of features. There are two steps of FAST algorithm. First, using graph theoretic method features are divided into clusters. Second the features which are highly related to target class are selected. We are comparing FAST algorithm with the some representative feature subset selection algorithm name as Fast correlation based filter, Relief-F, Correlation based feature selection, Consist and FOCUS-SF. The results are available on high-dimensional data, microarray, text data and image data. Experimental results show that our FAST algorithm implementation can run faster and obtain better-extracted features than other methods.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128052704","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":"An energy efficient remote user authentication scheme preserving user anonymity","authors":"Surekha Bapana, K. Narayana, C. Vorugunti","doi":"10.1109/IC3I.2014.7019600","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019600","url":null,"abstract":"Internet of Things (IoT), is an interconnection of heterogeneous devices in terms of computational, communication, energy efficient competences over public insecure communication channel called Internet. Through advancement in mobile and communication technologies, users can connect to remote servers ubiquitously through a 'thing' or device which is a part of IoT. Insecure nature of Internet and resource constrained nature of devices or things which are part of IoT demands for remote user authentication protocols which are extremely secure, light weight and energy efficient. In this context, C.G MA et al proposed a new dynamic ID based authentication scheme. In this manuscript we will illustrate that C.G MA et al. scheme cannot preserve user anonymity under their hypothesis and susceptible to stolen verifier attack. In addition, we will confirm that their scheme is heavy weight and needs more energy. We then present our improved scheme which is a generalized one, which is secure, light weight and energy efficient, while protecting the merits of different dynamic identity based authentication schemes.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115888797","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":"OFDM channel estimation using total variation minimization in compressed sensing","authors":"Manu K M M Tech, Nelson K J Assistant","doi":"10.1109/IC3I.2014.7019578","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019578","url":null,"abstract":"Compressed sensing (CS) is a newly emerging technology, which states that a signal can be sampled at a rate much smaller than what is commonly prescribed by Shannon-Nyquist. CS combines sampling and compression in to a single non-adaptive linear measurement process. In this paper, we are investigating the application of compressed sensing to the problem of estimating a doubly selective channel in Orthogonal Frequency Division Multiplexing (OFDM) system.We presented a compressed sensing based pilot-aided channel estimation method, in which Total variation minimization by augmented Lagrangian and alternating direction algorithms (TVAL3) is used as a compressed sensing algorithm. Most of the existing pilot-aided channel estimators, e.g. Least square estimator, depends on the use of large number of pilots to increase the accuracy of estimation, which results in lack of spectral efficiency. Results of the TVAL3 method is compared with the existing LS method. Simulation results shows that TVAL3 based channel estimator is proves to be a very good alternative to LS channel estimator, yielding good estimation quality despite using only fewer number of pilots. The TVAL3 based compressive channel estimator establishes the fact that Total variation (TV) minimization has application in channel estimation.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134120963","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":"Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption","authors":"Nidhi Lal, Anurag Prakash Singh, Shishupal Kumar","doi":"10.1109/IC3I.2014.7019588","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019588","url":null,"abstract":"The security of RSA algorithm depends upon the positive integer N, which is the multiple of two precise large prime numbers. Factorization of such great numbers is a problematic process. There are many algorithms has been implemented in the past years. The offered KNJ-Factorization algorithm contributes a deterministic way to factorize RSA N=p*q. The algorithm limits the search by only considering the prime values. Subsequently prime numbers are odd numbers (apart from 2) accordingly it also requires smaller number steps to factorize RSA. In this paper, the anticipated algorithm is very simple besides it is very easy to understand and implement. The main concept of this KNJ-factorization algorithm is, to check only those factors which are odd and prime. The proposed KNJ-Factorization algorithm works very efficiently on those factors; which are adjoining and close to √N. The proposed factorization method can speed up if we can reduce the time for primality testing. It fundamentally decreases the time complexity.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133081735","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":"Human recognition for surveillance systems using bounding box","authors":"P. Deepak, S. Krishnakumar, S. Suresh","doi":"10.1109/IC3I.2014.7019631","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019631","url":null,"abstract":"In all computer vision system, the important step is to separate moving object from background and thus detecting all the objects from video images. The main aim of this paper is to design a bounding box concept for the human detection and tracking system in the presence of crowd. The images are captured by using monocular cameras. The bounding box around each object can track the moving objects in each frame and it can be used to detect crowd and the estimation of crowd. This paper gives the implementation results of bounding box for detecting objects and its tracking.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132726574","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":"Coordination of mobile robots with master-slave architecture for a service application","authors":"A. Anand, M. Nithya, T. Sudarshan","doi":"10.1109/IC3I.2014.7019647","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019647","url":null,"abstract":"Swarm robotics is based on the characteristics displayed by the insects and their colony and is applied to solve real world problems utilizing multi-robot systems. Research in this field has demonstrated the ability of such robot systems to assemble, inspect, disperse, aggregate and follow trails. A set of mobile and self-sufficient robots which has very restricted capabilities can form intricate patterns in the environment they inhabit. The simple patterns can be used by the robots to achieve high level tasks. In the proposed work, a set of robots are coordinating to form a specific pattern around the object with step wise linear motion and are programmed to push the object from a source position to the destination in an obstacle free environment. Initially the robots are placed in known positions. ZigBee communication protocol is used for interaction among the robots. A single robot is chosen as a central coordinator and controls the movement of the rest of the robots in the swarm. Master bot decides on the path to be taken and also supplies the slave bots with the coordinates to be reached. The entire scenario has been simulated using the open source tool Player/Stage and the hardware implementation has been done using micromouse chassis set up and the Arduino Uno controller board.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821339","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}