{"title":"Collaborative Warning System for Dense Vehicular Networks Using MUSIC Algorithm DoA","authors":"C. Warty, R. Yu, K. ElMahgoub","doi":"10.1109/ICACC.2013.110","DOIUrl":"https://doi.org/10.1109/ICACC.2013.110","url":null,"abstract":"The problem of providing a collaborative early warning system for multiple moving vehicles against a small size fast moving object like a motorbike. This approach consists of three stages: The first stage consists of detecting the incoming object using a highly directive antenna at 5.0 GHz in license free industrial, scientific and medical (ISM) band. The second stage consists of broadcasting the warning message using a low directivity broad beam antenna, third stage will be detected by receiving vehicles by using direction of arrival (DOA) estimation technique. The position of a fast arriving object can be estimated using the MUSIC algorithm for warning beam DOA estimation. This paper is intended to demonstrate the feasibility of an early detection and warning system using a collaborative vehicle to vehicle communication links. The simulation is performed to show the behavior of detecting and broadcasting antennas as well as performance of the detection algorithm. The process can be further expanded to implement commercial grade detection and warning system.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134149235","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":"Efficient Optimal Route Stability Routing Protocol in MANET Using Gauss-Markov Mobility Model","authors":"B. S. Gouda, P. Panigrahi, R. Shial","doi":"10.1109/ICACC.2013.95","DOIUrl":"https://doi.org/10.1109/ICACC.2013.95","url":null,"abstract":"In Mobile Ad-hoc Network (MANET), routing is the most important issue for communication. Numbers of routing protocols are available for communication in MANET, but optimality is the key issue in routing to improve the performance of MANET. Reactive protocols do not preserve routing information at the network node level, if there is no communication between the nodes. Reverse Reactive protocol determines a route to a specific destination when a particular packet is intends to send. We proposed an optimal route stability routing protocol based route discovery approach, which is used to find an optimal route to the destination with lower communication overhead than flooding based reverse route discovery mechanism. In this proposed work, Optimal Route Stability Routing Protocol (ORSRP) which is a reactive routing based approach uses the reverse route calculation in route request (RREQ), route reply(RREP), route cache (RCAC) and route error (RRER) in order to find out the optimal path. Extensive simulations have been carried out using NS2 network simulator and the obtained result shows that the performance of ORSRP is better than the other existing routing protocol.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131396579","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":"Joint Adaptive Channel Estimation and Transceiver Design for Two-Way Relay Systems","authors":"Arun Joy, Vijay Kumar Chakka","doi":"10.1109/ICACC.2013.82","DOIUrl":"https://doi.org/10.1109/ICACC.2013.82","url":null,"abstract":"This paper discusses a joint adaptive channel estimation and transceiver design scheme for MIMO two-way relay systems. In order to reduce the computational complexity at the transmitting nodes, the transceiver is implemented at the relay station. Adaptive transceiver consists of an adaptive post equalizer known as receive filter and an adaptive pre-equalizer known as transmit filter. The design of adaptive pre-equalizer requires the knowledge of Channel State Information (CSI) between nodes and relay station. So a channel tracking adaptive filter should be implemented at the relay. Due to the structure of a two-way relay system, the training signals used to train the receive filter can be used to train the channel tracking filter. Thus the adaptive channel estimator and receive filter work simultaneously. The channel estimate is then used to design the transmit filter. The adaptive filters are implemented using the NLMS algorithm. The performance of the proposed scheme is verified by making use of MATLAB simulations.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127667860","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 Proposal for Improving Data Deduplication with Dual Side Fixed Size Chunking Algorithm","authors":"P. K. Krishnaprasad, Biju Abraham Narayamparambil","doi":"10.1109/ICACC.2013.10","DOIUrl":"https://doi.org/10.1109/ICACC.2013.10","url":null,"abstract":"DeDuplication is the technique of data reduction by breaking streams of data down into very granular components, and storing only the first instance of data items on the destination media and all the other similar occurrences to an index. Hash values are computed to identify the similar data items. Fixed size chunking (FSC) is a DeDuplication algorithm which breaks the data into fixed size chunks or blocks from the beginning of the file. But the main disadvantage of this technique is that, if new chunks are added in front or in the middle of a file, remaining chunks will get shifted from its initial position. This will yields a new hash value to the resulting chunks and thereby less DeDuplication ratio. But we can overcome this drawback by calculating hash values of chunks from the beginning as well as from the end of file and storing both values to metadata table. A new algorithm 'Dual Side Fixed Size Chunking' is proposed to get the high DeDuplication ratio over existing FSC. Without using computationally expensive Variable size chunking or content defined chunking, this algorithm can be effectively used for video or audio files to achieve a better DeDuplication ratio. This data reduction will provide network bandwidth savings and the ability to store more data on a given amount of disk or cloud storage. Reduced storage requirements will result in lower storage management and energy costs.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114846064","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":"Sensor Localization and Obstacle Boundary Detection Algorithm in WSN","authors":"Supantha Das, I. Banerjee, T. Samanta","doi":"10.1109/ICACC.2013.88","DOIUrl":"https://doi.org/10.1109/ICACC.2013.88","url":null,"abstract":"Existence of obstacles in sensor deployment region distorts the communication among sensor nodes and also disrupts sensor localization process. This paper represents a novel approach for localizing obstacles and sensors nodes using four GPS enabled anchor nodes. Based on four high energy anchor nodes, sensor localization is done, and an approximate rectangular boundary of each obstacle is detected. Next, accurate measure of the obstacle circumference is performed based on the communication between the neighbor sensor nodes of every obstacle in a time efficient manner, chosen by an elegant heuristic. Simulation results demonstrate the effectiveness and correctness of our proposed scheme, and improvement of our results in many cases.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125469537","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":"LEaCRS: An Extendible Array Based Compression Scheme for High Dimensional Data Using Linearization","authors":"Md. Rakibul Islam, K. Hasan, T. Tsuji","doi":"10.1109/ICACC.2013.66","DOIUrl":"https://doi.org/10.1109/ICACC.2013.66","url":null,"abstract":"Large multidimensional arrays are extensively used as the basic data structure in scientific, statistical and engineering applications. Increasing size of Data warehouses and high degree of sparsity makes demand for developing some compression schemes in order to obtain better performance. In this paper, we propose a new compression scheme namely Linearized Extendible array based Compressed Row Storage (LEaCRS) scheme for large multidimensional sparse array. The main idea of this scheme is to linearize each sub array found from the existing extendible array and then compresses the sub arrays independently using the CRS method.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121157961","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}
A. Deshmukh, A. Joshi, Ankita R. Jain, T. Tirodkar, K. P. Ray
{"title":"Broadband Proximity Fed Half U-Slot Cut Rectangular Microstrip Antennas","authors":"A. Deshmukh, A. Joshi, Ankita R. Jain, T. Tirodkar, K. P. Ray","doi":"10.1109/ICACC.2013.87","DOIUrl":"https://doi.org/10.1109/ICACC.2013.87","url":null,"abstract":"Broadband proximity fed U-slot cut rectangular micro strip antenna is discussed. It gives bandwidth of more than 350 MHz. By splitting the U-slot cut patch into two halves, a proximity fed gap-coupled configuration of half U-slot cut rectangular micro strip antennas is proposed. It gives simulated and measured bandwidth of nearly 600 MHz (>50%) with broadside radiation pattern and gain of more than 7 dBi over the operating bandwidth.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121215310","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":"Registry Based Discovery Model for Android Application","authors":"J. P. Martin, M. Divakar, Hareesh M. Joseph","doi":"10.1109/ICACC.2013.29","DOIUrl":"https://doi.org/10.1109/ICACC.2013.29","url":null,"abstract":"The confrontational growth of the mobile application market has made it a remarkable challenge for the users to find interesting applications in crowded App Stores. The existing industrial solutions often use the users' application download history and possibly their ratings to recommend applications that might be of interest, which in turn have alleviated the crisis. Conversely, the user downloading an application is a weak indicator for ranking an application (particularly if the application is free and the user just wants to try it out). On the contrary, usage of application ratings suffers from tedious manual input and potential data scarcity problems. In this paper, we present the registry based discovery model which uses parameters like reputation, client feedback and QoS metric to find the rating score. Eventually user gets paramount application based on users' functional requirements.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116916874","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":"Safety and Security Framework for Exception Handling in Concurrent Programming","authors":"Faisal Anwer, Mohd Nazir, K. Mustafa","doi":"10.1109/ICACC.2013.65","DOIUrl":"https://doi.org/10.1109/ICACC.2013.65","url":null,"abstract":"Exception handling mechanism provides a structured way of handling errors in software applications as compared to traditional error handling. Moreover it may cause safety and security threats if not used carefully. Some of the possible issues are information leakage, spoofed parent classes and inconsistent states. Unfortunately most programmers are rarely aware of exception handling re-percussions, in case of inappropriate exception handling. However, with the advent of multi-core processors people are more interested in utilizing all the computational powers of machine by using concurrent programming. This also brings up new challenges in terms of exception handling decisions like retry, continuation, rollback, termination and at the same time maintaining the clean state of the program. In this paper we propose a safety and security architecture by using Aspect Oriented Programming (AOP) technique and transactional memory (TM) concept without making any modifications to the development language.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127942510","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}
Saurabh Agarwal, Tushark Bansal, Rajat Agarwal, M. Qadeer
{"title":"Student's Desk: My Workplace on Android","authors":"Saurabh Agarwal, Tushark Bansal, Rajat Agarwal, M. Qadeer","doi":"10.1109/ICACC.2013.61","DOIUrl":"https://doi.org/10.1109/ICACC.2013.61","url":null,"abstract":"This paper puts forward the original research work done and applied, keeping in perspective the needs of students. It routes you through the general initiative behind the application building and what it is about, along-with detailed information on the features incorporated in the application, which are-Time table, Notes, SPI Calculator, Reminder and Tools and its importance in a student's academic life. The application is built solely to fill in one purpose and that is to lower down the hectic and stressed life of students. It brings in a new mode for easy learning for the user. In addition to this, it also puts forward some of the future perspectives for this application, which if developed would increase its usage for the academic work at workplace as well as at home.","PeriodicalId":109537,"journal":{"name":"2013 Third International Conference on Advances in Computing and Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131351844","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}