{"title":"Enhancing MANET's performance: A cross-layer solution","authors":"A. Bansal, M. Singh","doi":"10.1109/PDGC.2012.6449855","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449855","url":null,"abstract":"A major issue in MANET is degradation in TCP throughput due to node mobility, interference, unreliable medium and route failures. Additionally, TCP suffers because it is unable to distinguish segment loss either due to route failures or due to congestion. Sometimes, TCP misinterprets wireless error as congestion. Another major issue of MANET relates to routing. Aiming at performance enhancement in MANET, we present a cross-layer solution that deals with increased RTT and congestion, and removes false interpretation of link failure due to node movement. We modify lower layer and use link stability information. We modify TCP New Reno to improve TCP performance. We involve DSDV and AODV routing protocol in our study. Along with this, we analyze performance of both actual and modified TCP New Reno implementations in term of Packet Delivery Fraction and Throughput.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129430255","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 GPU based parallel algorithm for image reconstruction","authors":"M. Bajpai, P. Munshi, Phalguni Gupta","doi":"10.1109/PDGC.2012.6449825","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449825","url":null,"abstract":"This paper proposes an efficient GPU based parallel algorithm image reconstruction. It has been implemented on a system having a general purpose graphical processing unit (GPU), Nvidia graphics card GTX-275. Experimental results reveal that an image of size 256 × 256 with 90 projections can be reconstructed in real time with single iteration. The results enable us to use MART algorithm for online applications.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126493807","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":"Secure Overlay Services (SOS): A critical analysis","authors":"R. Kaur, A. L. Sangal, K. Kumar","doi":"10.1109/PDGC.2012.6449864","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449864","url":null,"abstract":"Due to increased use of the internet for various time critical applications such as banks, power stations, mission critical applications and even our defense system its unavailability greatly hinders our day to day operations. We all know that the biggest threat to the availability of internet is Distributed Denial of Service (DDoS) attack. The objective of DDoS attack is to consume the target's resources to such an extent that it becomes incapable to serve legitimate clients. Till date, a wide variety of solutions have been proposed to solve this problem but a very few of them concentrate on protecting critical infrastructures. Secure Overlay Services (SOS) architecture acts as a basis to protect all these time critical applications. It proactively prevents the target by providing layers of security between the authenticated client and the protected target. Although SOS architecture is successful in complicating the job of attacker, but still it is vulnerable to various attacks. Various researchers critically study this architecture and discuss various attacks possible on it. The aim of this paper is to review various attacks possible on this architecture so that more detailed understanding of attacker's strategy can be achieved and use this knowledge to develop more robust solutions.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127652077","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":"Effect of change in rate of genetic algorithm operator on composition of signatures for misuse intrusion detection system","authors":"M. Goyal, A. Aggarwal, Neelam Jain","doi":"10.1109/PDGC.2012.6449900","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449900","url":null,"abstract":"Intrusion detection (ID) has become an important area of research since building a system with no vulnerabilities has not been technically feasible. In this paper, effect of change in rate of genetic algorithm operator on fitness value in composition of signatures for misuse intrusion detection system is presented. The proposed genetic algorithm uses a set of classification rules which are generated from a predefined intrusion behavior. From the results it could be concluded that if crossover performed is not sufficient, there is not sufficient sharing of genes. If we crossover too much, good segments of individuals get split up a lot. This allows some individuals with high fitness's to be copied directly to the next population.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124428402","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}
I. S. Rajput, S. K. Sharma, A. Aggarwal, M. Thapliyal
{"title":"An efficient parallel searching algorithm on Hypercube Interconnection network","authors":"I. S. Rajput, S. K. Sharma, A. Aggarwal, M. Thapliyal","doi":"10.1109/PDGC.2012.6449799","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449799","url":null,"abstract":"In the information age, the huge amount of data and information are exchanged which requires fast and efficient searching mechanisms for effective use of this information. There are various sequential searching algorithms to search an element in an unsorted array or sorted array of elements. A number of researchers have explored methods for improving the efficiency and speedup of search using parallel hardware, for eg. A 2-D Mesh of Processors can be used to solve various searching problems in O(n1/2) time regardless of any assumption about wire delay. We proposed an algorithm for searching on Hypercube Interconnection network that solves the basic query problem, namely given an integer x, it is required to search a file of records on the s field for x. Proposed algorithm produces a yes or no answer to such a query in O(log n) time.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122594109","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":"Novel routing protocol for vehicular adhoc networks","authors":"V. B. Vaghela, D. J. Shah, Sunny Gyamlani","doi":"10.1109/PDGC.2012.6449907","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449907","url":null,"abstract":"A vehicular ad hoc network (VANET) is a subclass of mobile adhoc network (MANET) and targeted to support vehicular safety, traffic monitoring, and other applications. In recent years many routing protocols have been proposed after considering the particular VANET characteristics. We have rigorously studied the proposals and then came up with the conclusion that protocols based on the vehicles positions were found to be the most adequate to VANETs due to the flexibility criterion of handling the nodes position variations. We propose the novel protocol which provide the solution for existing position based routing protocol with help of our test bed and algorithms.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115435979","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}
M. Mazouzi, I. Mbarek, Dhia Belhajali, S. Hasnaoui, Mohamed Abid
{"title":"Design, implementation and simulation of CAN-based crossbar switched fabric","authors":"M. Mazouzi, I. Mbarek, Dhia Belhajali, S. Hasnaoui, Mohamed Abid","doi":"10.1109/PDGC.2012.6449852","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449852","url":null,"abstract":"Nowadays, CAN bus, as a well-known, fieldbus, reaches its limits when dealing with sophisticated embedded systems that require reliability and high-speed data transfer. Switched fabric can be a fast and reliable hardware solution for existing CAN-bus limits. In fact, it allows multiple packets to be transferred simultaneously ensuring sufficient bandwidth. To resolve this problem when keeping the use of CAN protocol, we remove the CAN access technique module from an existing VHDL implementation of a CAN controller component and we replace it by a crossbar switched fabric, implemented in VHDL also. In this paper, we designed a Crossbar switched fabric CAN based on VHDL modules and we simulated it under ModelSim tools and we give of proof-of-concept of a CAN controller based on crossbar switched fabric.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115820723","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":"Optimized Elliptic Curve Cryptography for wireless sensor networks","authors":"S. Bala, G. Sharma, A. Verma","doi":"10.1109/PDGC.2012.6449797","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449797","url":null,"abstract":"Recent technical advances have made it possible to develop such devices, which are small in size, cheap and capable of wireless communication using radio interfaces and provide pervasive services to the user. Sensor networks are the extreme examples of such ubiquous and pervasive computer paradigm. The constraints imposed on the wireless sensor networks make it more prone to cost of computation. So, the major issue is to reduce the computation cost by implementing some optimization technique, so that the overall efficiency of the system increases without any loss of information. In this paper, we list out few optimization techniques that can be used in Elliptic Curve Cryptography for wireless sensor networks.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130831626","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":"Comparative analysis of 10T and 14T full adder at 45nm technology","authors":"R. Johri, R. Singh, S. P. Pandey, S. Akashe","doi":"10.1109/PDGC.2012.6449931","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449931","url":null,"abstract":"Adders are basic building block of Arithmetic VLSI circuits found in processors and microcontroller inside Arithmetic and Logic units. Upgrading the performance of the adder thus becomes imperative which would certainly result in the improvement of digital electronic circuits where adder is employed. Full adders, till now, have been designed using wide range of structures for improvement of various parameters like power consumption, speed performance and structure size. The paper here describes a comparative analysis of 10T and 14T full adder with the aim of increasing power efficiency and reducing structure size at 45nm technology. The simulation results have been obtained for power by varying different parameters using Cadence Virtuoso Tool and SPECTRE simulator.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126643534","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 soft handoff algorithm using fuzzy logic in CDMA systems","authors":"S. Aggarwal, S. K. Tomar, A. Aggarwal","doi":"10.1109/PDGC.2012.6449886","DOIUrl":"https://doi.org/10.1109/PDGC.2012.6449886","url":null,"abstract":"In a code division multiple access system performance of conventional soft handoff can be improved by adapting the soft handoff thresholds. In this paper, using fuzzy inference system, performance of soft handoff has been analyzed with adaptive thresholds. Work emphasizes on the improvement of quality of traffic channels. The analyzed results show that the proposed fuzzy inference system gives lower blocking probability, outage probability and better Eb/I0 compared to IS-95A, IS-95B soft handoff algorithms.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121506375","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}