{"title":"Security for IoT: An effective DTLS with public certificates","authors":"Mukul Panwar, Ajay Kumar","doi":"10.1109/ICACEA.2015.7164688","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164688","url":null,"abstract":"The IoT (Internet of Things) is a scenario in which things, people, animal or any other object can be identified uniquely and have the ability to send or receive data over a network. With the IPV6 the address space has been increased enormously, favors allocation of IP address to a wide range of objects. In near future the number of things that would be connected to internet will be around 40 million. In this scenario it is expected that it will play a very vital role in business, data and social processes in which devices will interact among themselves and with the surrounding by interchanging information [5]. If this information carries sensitive data then security is an aspect that can never be ignored. This paper discusses some existing security mechanism for IoT and an effective DTLS mechanism that makes the DTLS security more robust by employing public certificates for authentication. We can use a Certificate authority that can give the digital certificates to both the client and server and can increase the effectiveness of this communication. This work aims to introduce a CA for the communication and to provide some results that can show its improved performance in contrast to the pre-shared key communication.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570263","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 implementation of energy efficient data compression & security mechanism in clustered wireless sensor network","authors":"A. S. Nagdive, Piyush k. Ingole","doi":"10.1109/ICACEA.2015.7164733","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164733","url":null,"abstract":"In WSN the amount of data transmission has become an important issue. New technology of compressive sensing (CS) in sensor networks new idea for data collection and target localization are research areas in sensor networks. Compressive Sensing (CS) minimize the number of data transmissions and balance of the traffic load throughout networks. Afterall, by using pure compressive sensing the total number of transmissions for data collection is still high. To minimize the number of transmissions in sensor networks, hybrid method of Compressive Sensing (CS) is used. Further to provide data compression in WSN a light weight Enhanced Lossless Entropy Compression (LEC) algorithm will be used for reducing size of data in the Sensor Network. Security is the major issue in the Sensor Network and to make the data secure the Advance Secured and Efficient Transmission-Identity SET-IBS protocol will be used. It is a light weight algorithm which consumes less energy while encrypting and decrypting the data. This encryption takes less energy and therefore it is helpful to make the WSN efficient. In this project the main focus is on optimization of energy in terms of lightweight security and compression techniques which reduces the complexity of Wireless Sensor Network the Advance SET-IBS protocol for encrypting the data on the sensor node is proposed.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124772461","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 efficient and secure means for identity and trust management in cloud","authors":"Nida, Bhupendra Teli","doi":"10.1109/ICACEA.2015.7164777","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164777","url":null,"abstract":"Cloud users are inevitably confronted with the potential risk of storing their crucial data into the remote data center of cloud service providers (CSP), which raises the concern among cloud users for their Identities and Trust for CSP's. So their arises the need for an efficient identity and trust management system, which can serve to both CSP and Cloud Consumer and hence necessary to increase the service level agreements (SLA) between them. This paper propose a strong heterogeneous online and offline sign crypt model for a cloud network for the issue pertaining to identities and trust management. This model has certain merits: firstly, it set ups the secure, trustworthy connection between the cloud user and cloud data center, while maintaining the identities of the user and also it achieves confidentiality, authentication, and non-repudiation of services in a coherent single step. Secondly, it allows a cloud user in an Identity based cryptography (IBC) to send a request message to an internet host in public key infrastructure (PKI). Thirdly, it splits the generated sign crypt into two phases: a) Offline, and b) Online phase, and thereafter they are shown on several types of attacks. Our model is very suitable to provide high level of identity and trust management in cloud computing paradigm.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125054045","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 survey on congestion control mechanisms in packet switch networks","authors":"A. Singh, Madan Mohan Malaviya","doi":"10.1109/ICACEA.2015.7164833","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164833","url":null,"abstract":"In past few years an explosive growth is observed in internet and still not constant. At the same time this growth have come severe congestion problems. While there is no universal definition of congestion but the definitions and researchers conclude that any such event that consequence the degradation of performance and denial of services is congestion. The network which governs the communication must be congestion free to overcome the queuing delay, packet loss or blocking of new connection. To compensate packet loss some protocols use fast retransmission scheme but suffer problem of Congestion collapse. Congestion collapse means the bandwidth is available but the network becomes under-utilize. When a network is in such condition, since the network is under-utilize and the demand is high, both lead to worst throughput. The network in this situation experience high level of loss and delayed packet. This results in need for better algorithms, protocol implementations scheme(s) and efficient network devices with sufficient space (storage), because the reason behind the Network Congestion problem lies in transport protocol implementations. The obvious looking way to implement a Protocol sometimes results in wrong response to the network. The algorithms in this category are rooted in the idea that the condition of packet conservation must not violet. This paper is a survey of congestion control algorithms in packet switched networks.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126289731","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}
Saggurthi KishorBabu, V. Sagar, B. Nikhitha, P. Priyanka
{"title":"Exigency alert and tracking system","authors":"Saggurthi KishorBabu, V. Sagar, B. Nikhitha, P. Priyanka","doi":"10.1109/ICACEA.2015.7164781","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164781","url":null,"abstract":"Now a day's people feel insecure due to increase in the crime rate and accidents. Technology can be used at a greater scale to reduce these and with this inspiration we are proposing a system that can provide instant help in a better and faster way. The most common applications we have are panic alarm/ danger alert, requiring user to take actions to keep themselves safe. Practitioners saw some value of information and evidence gathering functions but, had safety concerns relating to their use by domestic violence victims still living with the perpetrator. The proposed system is using GPS which will take the location of the user from Google map. The main concept would be sending a voice message and a message template to the selected contacts and emergency numbers when in danger. Enhancement from the earlier systems we are providing user tracking when he/she is in a position that he cannot alert others.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126498940","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 GA based job scheduling strategy for computational grid","authors":"Krishan Veer Singh, Z. Raza","doi":"10.1109/ICACEA.2015.7164708","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164708","url":null,"abstract":"To meet the ever increasing demand of computing capacity and to cater towards collaborative engineering grid systems have emerged as the effective solution. Scheduling on such systems play a very critical role to ensure that the available resources are assigned and used optimally. Scheduling on grid has been proven to be an NP hard problem owing to the heterogeneity of the participating resources, huge search space and dynamicity of the grid system. GA has gained popularity among the researchers for scheduling problems on the grid systems, being a part of the evolutionary computing based on Darwin's theory of survival of the fittest. The proposed work presents a design and eventual analysis of a scheduling strategy using GA that schedules the job with the objective of minimizing the turnaround time of the job. This is done ensuring the resource assignment as per the job's requirement while considering the precedence and communication cost constraints. The work explores the use of Roulette wheel and Rank selection method as the selection methods while varying other parameters to study the model under various conditions.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126597854","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":"Preprocessing web logs: A critical phase in web usage mining","authors":"Neha Goel, C. K. Jha","doi":"10.1109/ICACEA.2015.7164776","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164776","url":null,"abstract":"Web usage mining refers to finding out user access patterns from the web logs of a Website. The Web logs obtained are highly unstructured and this very nature of Web logs makes them unsuitable for mining directly. Hence they go through a stage called preprocessing which not only makes them suitable for analysis but reduces the file size significantly. This paper explores this preprocessing phase in detail and proposes a total and absolute tool for the same which reduces the irrelevant and noisy data and transforms it into a form so that it can be readily used for analysis. The tool has been referred to as total and absolute as after cleaning the data it shows us a summary statistics of the records at the end once they have been preprocessed. The summary statistics highlights the number of records fed as input, elements obtained after carrying out preprocessing and the time utilized in accomplishing the task. Finally it exports the preprocessed data obtained into a .log file which can be very easily imported in any data mining utility. The features of summary statistics and export data can be considered as a distinguishing feature from the other tools which have been proposed earlier.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125667745","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 survey on the impact of economies of scale on scientific communities","authors":"S. Verma, R. Satao","doi":"10.1109/ICACEA.2015.7164784","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164784","url":null,"abstract":"Cloud computing is commonly characterized as a sort of computing that depends on offering computing resources instead of having neighborhood servers or individual gadgets to handle applications. The resource suppliers give adaptable resources to the client. In this paper, we propose to discover it out whether the little or medium scale scientific communities can utilize the economies of scale as a part of the cloud for its advantages. In this paper, we propose a Public Cloud model for leasing the adaptable resources from any open cloud supplier to the little or medium scale research associations. On the premise of this Public Cloud model, we are actualizing a novel strategy to handle the heterogeneous scientific workload on the cloud. The two average workloads are contemplated in this paper: High Throughput Computing (HTC) and Many Task Computing (MTC). Our workload taking care of the system can spare the aggregate resource utilization in both these workloads viably. We are proposing a novel scheduling technique, “Earlier Account Expire Prioritized with Round Robin (EAEP-RR) scheduling”, to handle the requests at cloud. At last, we can presume that our routines can advantage the scientific communities from the economies of scale in the cloud environment.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130008007","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 comprehensive review on recent advances in Variational Bayesian inference","authors":"Rohit Sain, Vikas Mittal, Vrinda Gupta","doi":"10.1109/ICACEA.2015.7164793","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164793","url":null,"abstract":"Variational Bayesian (VB) inference is the latest method for prediction of data or information in various processes. It provides a faster response with a reasonable accuracy as compared to the other methods (like Monte Carlo Markov Chain (MCMC) method). There is a large literature and work on prediction of data which deals with large amount of data. When data is missing, other methods, like MCMC, cannot be used as they require complete data for processing, while VB method provides the solution with missing data also with a very fast speed. Accuracy is the main limitation with VB method. Some algorithms are developed to overcome this limitation with some computational cost. SNVA, LSVB, SSVB and some others are the latest developed method which can be used to improve the accuracy.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080245","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":"Implementation model for access control using log based security: Practical approach","authors":"Amritpal Singh","doi":"10.1109/ICACEA.2015.7164717","DOIUrl":"https://doi.org/10.1109/ICACEA.2015.7164717","url":null,"abstract":"This paper proposes an implementation for access control in SQL Server, and the technique is to improve security of the data masking technique devised for secure data warehouse since it stores the sensitive information which needs to be secure from attackers. A large number of techniques have been proposed for the same but based on analysis those techniques produce large overheads. This technique can be implemented in database management system of any kind. By the help of proposed technique, it will get to know the behavior of access strongly based on mining process on intelligently recorded log and other metadata of respective access.","PeriodicalId":202893,"journal":{"name":"2015 International Conference on Advances in Computer Engineering and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116688315","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}