{"title":"Adaptive Multi Constraint Multipath Routing Protocol in Wireless Multimedia Sensor Network","authors":"J. Agrakhed, G. Biradar, V. D. Mytri","doi":"10.1109/ICCS.2012.9","DOIUrl":"https://doi.org/10.1109/ICCS.2012.9","url":null,"abstract":"In Wireless Multimedia Sensor Networks (WMSN), routing is essential to promote high data rate accommodation. During the query and data dissemination phases, optimal routing is a vital role since the multimedia content is conditional to strict QoS requirements. But the existing works on Multipath routing rarely consider losses and delay at the sink leading to energy degradation, involve unnecessary additional paths which cause high overhead. To overcome these issues, in this paper, we proposed an adaptive multi constraint Multipath routing protocol which minimizes loss rate, energy consumption and delay. We consider a cluster based architecture where inter cluster routing is performed based on a weighted cost function. The cost function is based on the parameters such as loss rate, residual energy and delay. In order to save energy, nodes which don't take part in routing are put to sleep mode. The simulation results prove that the proposed protocol is efficient in terms of energy efficiency, delay and packet delivery ratio when compared to the QoS aware routing from the literature.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122352552","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":"QoS Aware Routing Scheme Based on Traffic Priority for Wireless Sensor Networks","authors":"S. Kaushik, R. Aggarwal, R. Sharma","doi":"10.1109/ICCS.2012.61","DOIUrl":"https://doi.org/10.1109/ICCS.2012.61","url":null,"abstract":"Wireless sensor networks (WSN) have generated tremendous interest among researchers these years because of their potential usage in a wide variety of applications. The most predicament issue that happens in WSN is Congestion. Congestion causes packet loss, which in turn reduces throughput and energy efficiency. Therefore congestion in WSNâs needs to be controlled for high energy-efficiency, to prolong system lifetime, improve fairness, and improve quality of service (QoS) in terms of throughput (or link utilization) and packet loss ratio along with the packet delay. This paper proposes a new protocol for data delivery into high congested areas. Proposed algorithm provides an efficient way to overcome congestion in wireless cluster sensor network. Proposed algorithm provides priority both on data and location.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128890293","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":"Fault Tolerant ALU System","authors":"A. Majumdar, S. Nayyar, J. Sengar","doi":"10.1109/ICCS.2012.36","DOIUrl":"https://doi.org/10.1109/ICCS.2012.36","url":null,"abstract":"This paper presents the design of FAULT TOLERANT ALU SYSTEM by using Triple Modular Redundancy. ALU is a critical component of microprocessor and is the core component of central processing unit. Therefore, it is necessary for making the ALU to be fault tolerant. The use of voting logic and disagreement detector has been implied in making the ALU system to be fault tolerant. The source code for the following was developed in VerilogHDL. The software used was XilinxISE.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122212629","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":"Dual Gateway Routing Protocol","authors":"G. Singh, M. V. Raju","doi":"10.1109/ICCS.2012.27","DOIUrl":"https://doi.org/10.1109/ICCS.2012.27","url":null,"abstract":"Dependency on Computer Networks is growing Day by Day. Many new services have been introduced which leads the popularity of the internet to next level, for example VoIP (Voice over Internet), E-Banking, Telepresence etc. Uninterrupted service is the most important requirement of the computer networks, the main reason behind this requirement is dependency on computer networks. Uninterrupted service or high availability can be achieved through redundancy and Redundancy Protocols, Redundancy can be achieved easily but efficient use of available resources is somewhat difficult task. So in this paper we will discuss a new redundancy mechanism which tries to use available resources efficiently, and make networks more fault tolerant.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115391075","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":"Inherent Dangers in Database Security","authors":"Sartaj Singh","doi":"10.1109/ICCS.2012.42","DOIUrl":"https://doi.org/10.1109/ICCS.2012.42","url":null,"abstract":"With the danger/risk of data theft looming large over the horizon of the Internet user involved in e-banking, online shopping, transaction etc. it becomes imperative to identify the dangers involved and employ security checks. Usually big stores have secure SSL [1] connections to be used by the owners of credit cards. Use of base64 encoding instead of hexadecimal and similarly using AES-128[2] cipher algorithm certainly heightens database security because these methods ensure high security where as they shorten the length of the encrypted string. Carrying forward these two above stated methods i.e. base64 encoding and AES-128 cipher algorithm, a more secure approach will be to use random number generator in which is required only to store the 8-byte random component instead of full 16 bytes. The existing methods of encryption are also not fool proof for high end professionals. The main thrust of this paper is to identify, pinpoint and find the solutions for the inherent dangers involved in the database storage.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125207760","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":"CAPTCHINO - A Gamification of Image-Based CAPTCHAs to Evaluate Usability Issues","authors":"Rahul Saha, R. Manna, G. Geetha","doi":"10.1109/ICCS.2012.18","DOIUrl":"https://doi.org/10.1109/ICCS.2012.18","url":null,"abstract":"CAPTCHA technology is at a boom in the field of information security. When text CAPTCHAs are at a point of break down, it is the time for the image based CAPTCHAs to get a pace. But often the designers of the CAPTCHA forget the issues related to the usability as the objective of a CAPTCHA is to reduce the burden of solving it along with the robustness. In this paper, we have shown an analysis of some image based CAPTCHAs with different usability factors. This analysis is made manually with the data collected by the GWAP concept.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133104975","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 Trust Based Approach for AODV Protocol to Mitigate Black Hole Attack in MANET","authors":"Fidel Thachil, K. Shet","doi":"10.1109/ICCS.2012.7","DOIUrl":"https://doi.org/10.1109/ICCS.2012.7","url":null,"abstract":"This paper presents a trust based collaborative approach to mitigate black hole nodes in AODV protocol for MANET. In this approach every node monitors neighbouring nodes and calculates trust value on its neighbouring nodes dynamically. If the trust value of a monitored node goes below a predefined threshold, then the monitoring node assume it as malicious and avoids that node from the route path. The experiments reveal that the proposed scheme secures the AODV routing protocol for MANET by mitigating and avoiding black hole nodes.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669543","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":"Analysis of Joins and Semi-joins in Centralized and Distributed Database Queries","authors":"Manik Sharma, G. Singh","doi":"10.1109/ICCS.2012.15","DOIUrl":"https://doi.org/10.1109/ICCS.2012.15","url":null,"abstract":"Database is defined as collection of files or table, where as DBMS stands for Database Management System which is collection of unified programs used to manage overall activities of the database. The two dominant approaches used for storing and managing database are centralized database management system and distributed database management system in which data is placed at central location and distributed over several locations respectively. Independent of the database approach used, one of the foremost issue in the database is the retrieval of data by using multiple table from central repository in centralized database and from number of sites in distributed database. Joins and semi joins are primitive operations used to extract required information from one, two or multiple tables. In this paper the focus is given on computing and analyzing the performance of joins and semi joins in centralized as well as in distributed database system. The various metrics that will be considered while analyzing performance of join and semi join in centralized database and distributed database system are Query Cost, Memory used, CPU Cost, Input Output Cost, Sort Operations, Data Transmission, Total Time and Response Time. In short the intention of this study is compare and contrasts the behavior join and semi-join approach in centralized and distributed database system.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124738103","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 User Friendly GUI Based Benchmark for Image Watermarking","authors":"R. Kaur, G. S. Kalra, M. Kansal","doi":"10.1109/ICCS.2012.8","DOIUrl":"https://doi.org/10.1109/ICCS.2012.8","url":null,"abstract":"Watermarking is a technique used to hide data or identify information within digital multimedia. Bench-marking is used to evaluate the watermarking algorithms. Different benchmarks are available for digital watermarking. These benchmarks work efficiently but they are quite complex and difficult to understand, so a new benchmark is introduced in this paper which is GUI (Graphical user interface) based and implemented in MATLAB. It also includes brief introduction about digital watermarking, different attacks and existing benchmarks.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125326590","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":"Visualizing Clouds on Different Stages of DWH - An Introduction to Data Warehouse as a Service","authors":"H. Kaur, P. Agrawal, A. Dhiman","doi":"10.1109/ICCS.2012.78","DOIUrl":"https://doi.org/10.1109/ICCS.2012.78","url":null,"abstract":"Various Advantages that cloud computing has established, namely scalability, agility, automation and resource sharing are being utilized by today's forward-thinking business leaders within their enterprise data centre. Large-scale data analytics as and when needed, at the price user can afford can be established on demand. This paper presents architecture to affect cloud computing for Data Warehouse applications and thrashes out the pros and cons of visualizing cloud on traditional data warehousing. The emphasis in this work is on providing different stages of Data Warehouse as a service (DWH-aaS), which have recently gained a great deal of attention. Conclusion is supported with a brief discussion on level of architecture adopted by some popular DWH cloud service providers.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127747207","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}