2018 4th International Conference on Recent Advances in Information Technology (RAIT)最新文献

{"title":"A secure handshaking aodv routing protocol (SHS-AODV)","authors":"Rajagopal Kumar, S. Tripathi, R. Agrawal","doi":"10.1109/RAIT.2018.8389029","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389029","url":null,"abstract":"Mobile ad-hoc network is wireless network made out of various nodes converse with each uncommon while not setting up the structure. The security of such framework is a fundamental subject. This study, we have presented the most known protocols, routing limit in MANETs for securing. The securing of the diverse proposed Routing Protocols (RPs) has displayed that the characteristic ad hoc network, for instance, quickly changing topologies and nonappearance of structure, present further troubles with the adequately muddled issue of secure routing. Meanwhile, as regular RP, Ad-hoc on-demand distance vector (AODV) RP has been associated comprehensively in MANET. Starting at now, how to upgrade the transmission execution and improve security are the two basic points of view in AODV's research field. To enhance the safety of such network, the method proposed right here is securing RP, AODV through using RSA Algorithm and Symmetric Encryption algorithm AES. This secures the data as well as preserves the confidentiality, integrity, and authenticity. Our study demonstrates that none of the proposals of secure RPs can fulfill all security objectives. By our proposed technique SHA-AODV RP, the network performance improves by demonstrating throughput, energy and packet delivery ratio (PDR).","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130697878","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":"Optimal DG allocation for minimizing active power loss with better computational speed and high accuracy","authors":"Arnab Pal, A. Chakraborty, A. Bhowmik, Bhaskar Bhattacharya","doi":"10.1109/RAIT.2018.8389009","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389009","url":null,"abstract":"This paper presents the optimal allocation of Distributed Generation (DG) units in a distribution network for minimization of active power loss with less execution time and with better accuracy. The DG allocation problem is formulated as a non-linear constrained optimization problem where power loss has been taken as objective and various constraints have been considered into the formulation. In this work, a new algorithm, one by one search algorithm (OBOSA), to find out the DG locations for minimum power loss has been proposed. To show the effectiveness of the proposed algorithm, it has been tested on a standard IEEE 33 and 69 radial distribution test bus systems. The performance of OBOSA is compared with the results found by grey wolf optimization (GWO) and ant lion optimization (ALO) based techniques. Numerical results demonstrate the tangible superiority of the proposed method in achieving the optimum DG allocation with better computational speed and high accuracy.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"434 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122736539","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":"IoT in mining for sensing, monitoring and prediction of underground mines roof support","authors":"Ankita Singh, U. Singh, D. Kumar","doi":"10.1109/RAIT.2018.8389041","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389041","url":null,"abstract":"Digital transformation is emerging as a driving force to revolutionize the world around us. Digitalization will play defining role in the mining industry too where connectivity plays a gigantic role. The idea is to embed more and more things with electronics, sensors, and software to allow things to communicate and exchange data with each other possibly but not necessarily via the Internet. This type of setting is inevitably known as the Internet of Things (IoT). ‘Self-Advancing Goaf Edge Support Systems (SAGES)’ have been developed for de-pillaring operations in Indian Underground Coalmines as mobile roof support systems. This paper explores and proposes the development of Smart SAGES by harnessing the power of IoT technologies. Though IoT brings lots of benefits but it comes with its own challenges. Like mining industry is increasingly prone to cyberattacks due to enormous economical factor attached to it. It is concluded that a robust communication channel using data-logger should be established for SAGES so that the safety, and reliability of the SAGES data sent to the clouds are ensured and the information are accessed reliably via a smart-phone application.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130097051","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":"MTLBO-MS: Modified teaching learning based optimization on multicore system","authors":"U. Balande, D. Shrimankar, Nitesh Funde","doi":"10.1109/RAIT.2018.8389055","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389055","url":null,"abstract":"Teaching-Learning-Based Optimization (TLBO) algorithm is newly developed nature-inspired algorithm for solving large-scale-global optimization problems. The basic TLBO algorithm is modified using the approach of Differential Evolution with Random-Scale Factor (DERSF). This paper presents a Modified Teaching-Learning-Based Optimization algorithm on Multicore System (MTLBO-MS), which is a parallel version of TLBO. Master-worker paradigm is used for MTLBO-MS algorithm in the teacher and learner stage. This proposed algorithm is tested on different unimodal and multimodal unconstrained benchmark functions with diverse characteristics. The proposed algorithm is implemented on multi-core architecture using open multiprocessing (OpenMP). The effectiveness of the MTLBO-MS algorithm is analyzed in terms of statistical value such as best, mean, speedup and efficiency. The experimental outcomes and discussions justify that the proposed MTLBO-MS algorithm has better speedup, efficiency, computational complexity and optimal best or mean value as compared to other evolutionary algorithms.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123816820","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":"Automatic identification of saline blanks and pattern of related mangrove species on hyperspectral imagery","authors":"S. Chakravortty, D. Ghosh","doi":"10.1109/RAIT.2018.8389023","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389023","url":null,"abstract":"This research attempts to apply hyper spectral imagery to identity saline blank patterns within mixed mangrove forest of the Sunderban Bio-geographic Province of West Bengal, India. Identification of patterns of changing mangrove species around saline blanks on hyperspectral image has also been attempted. This research uses derivative analysis to identify hyperspectral wavelengths that are sensitive to the presence of minerals comprising saline blanks. These wavelengths have been considered for development of a new saline blank identification model. Spectral signatures of mangrove species endmembers have been automatically extracted using NFINDR algorithm and considered as input for spectral unmixing of saline blank and mangrove endmembers. The fractional abundance estimates of spectral unmixing applied on time series hyperspectral data of the study area indicate that, over the years, as saline blanks become more abundant in the region, the presence of mangrove species (even the salt tolerant ones) gets reduced. However, in areas where the mangrove species still dominate and saline blanks are in its formative stage, there is still a possibility of re-growth of the saline prone mangrove species. It is found that mangrove species namely, Excoecaria agallocha and Ceriops Decandra are prevalent around the saline blank areas. Others like Avicennia marina and Avicennia alba also exist in certain locations of saline blanks.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125872532","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":"Design of low power RRAM cell using CNFET","authors":"Srinithya Nagiri, S. Majumder, Riya, A. Islam","doi":"10.1109/RAIT.2018.8389016","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389016","url":null,"abstract":"This paper presents a CNFET based novel RRAM cell using memristor as memory element. The proposed RRAM cell is designed in such a way that half-select issue is resolved. Simulation results of critical design metrics of the proposed RRAM cell and previous 2T2M RRAM cell are compared. The proposed RRAM cell achieves 6.13x lower read delay along with 33x lower hold power due to use of MTCMOS power reduction technique than 2T2M cell at nominal VDD. It is a half-select free non-volatile RRAM cell with faster read operation and it is also power efficient.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129275780","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":"Abnormal behaviour detection at traffic junctions using Lucas Kanade and Harris Corner detector","authors":"Charvi Jain, Diwakar Gautam","doi":"10.1109/RAIT.2018.8388994","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8388994","url":null,"abstract":"Image processing has played a vital role in every aspect of human life. Video surveillance has reached a major out through by the application of advanced image processing and frame modeling techniques. Video surveillance is the most recent issue regarding community security and welfare. Detection of behavior of moving objects in video streams is a vital aspect. In this article, automatic real-time object's behavior detection is implemented using Lucas Kanade and Harris Corner based approach. The velocity of moving element is reported and their association with anomalous activity is also an inseparable part of this art. This work can be used to develop a surveillance system of static camera and robotic automation visual systems. Whenever a new object comes in the camera frame, the system uses the concepts of frame based processing using Lucas Kanade approach incorporated with Harris Corner Detector. In this work, an investigation is carried out to define the optimum value of velocity parameters for declaring a behavior as anomalous. Moreover, it is analyzed that proposed algorithm for video behaviour detection at traffic points perform well but its accuracy can be further enhanced using three dimensional imaging and mapping of moving elements in a hyperspace.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125991937","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":"A modified particle swarm optimization algorithm for solving traveling salesman problem with imprecise cost matrix","authors":"Indadul Khan, Sova Pal, M. Maiti","doi":"10.1109/RAIT.2018.8389060","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389060","url":null,"abstract":"Here, using swap sequence, swap operation and different velocity update rules a modified form of Particle Swarm Optimization(PSO) technique is outlined to solve Traveling Salesman Problem (TSP) having crisp or fuzzy cost matrix. In the propose approach, a potential solution of a TSP is represented by an order of nodes in which a salesman visits all the nodes and named as path. Interchange of the positions of any two nodes of any path is named as swap operation (SO). A set of SOs applied on a path in a particular order is defined as swap sequence(SS). Using this structure of representation of a probable solution, different perturbed rules of PSO are modified using SO and SS to find out the solutions of TSPs in crisp and fuzzy environments. During search process, to improve any static path a strong perturbation technique (K-Opt) is applied. Five different rules are proposed to determine update velocities of a solution in the algorithm. Following roulette wheel selection process, one rule from the rule set is randomly selected each time and is used for updating a solution in the algorithm. K-opt operation is again used at the end of the algorithm for the possible improvement of the best path found so far. The algorithm is capable of solving any TSP with crisp or fuzzy cost matrix. Different sizes benchmark test problems available in TSPLIB are used to test the capability of the algorithm. It is found that success rate of the algorithm is nearly 100% for TSPs with considerably large sizes crisp cost matrix. Due to the absence of test problems on TSP with fuzzy cost matrix in the literature, here, few such problems are randomly generated from some crisp test problems of TSPLIB and are applied to test the capability of the algorithm for solving such problems. It is found form numerical experiments that, efficiency of the said algorithm for solving such problems (Symmetric TSP and Asymmetric TSP) in respect of accuracy and run time is better than some other well established algorithms for TSPs.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126244624","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 vertically coupled triple micro optical ring resonator as optical filters with multiple output bus waveguides","authors":"B. Chatterjee, S. Mandal","doi":"10.1109/RAIT.2018.8388975","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8388975","url":null,"abstract":"A triple micro optical ring resonator (TMORR) of silicon nitride with multiple output bus waveguides is modeled based on vernier principle. This proposed model is analyzed using delay line signal processing approach and Mason's gain formula in Z-domain. Performance analysis of this ring model is obtained in MATLAB. A higher value of free spectral range (FSR) is obtained from both the output buses with negligible crosstalk. Thus it can be efficiently utilized in communication system also can be used for obtaining optical filter. Group delay, dispersion characteristics and finesse are also graphically presented in this work.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124656260","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":"A novel hybrid private information retrieval with non-trivial communication cost","authors":"Radhakrishna Bhat, N. Sunitha","doi":"10.1109/RAIT.2018.8389078","DOIUrl":"https://doi.org/10.1109/RAIT.2018.8389078","url":null,"abstract":"All the existing replicated database Private Information Retrieval (PIR) schemes have failed to achieve 1) Breaking the dependency of both user privacy and data privacy on a single intractability assumption 2) Maintaining information-theoretically secure queries even on colluding and 3) Non-trivial server communication cost 4) Verifying the integrity of the communicating information. In this paper, we have introduced a computationally bounded 2-database colluding resistant information-theoretic private information retrieval scheme with non-trivial communication cost. Since intractability assumption independent user privacy, colluding resistant information-theoretically secure query generation and the non-trivial communication have been involved in the proposed scheme, we coin the proposed scheme as Hybrid Private Information Retrieval (hPIR). In this, colluding resistant information-theoretically secure query generation (to preserve user privacy) is achieved by extending from quadratic residuosity property dependent index inputs to quadratic residuosity property independent index inputs and non-trivial communication is achieved by a new quadratic residuosity based recursive 2-bit encryption method (to preserve data privacy). Note that the generation of colluding resistant information-theoretically secure query supports user privacy whereas application of recursive 2-bit encryption method supports both data privacy and non-trivial communication.","PeriodicalId":219972,"journal":{"name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125209702","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}