{"title":"Achieving MAC layer fairness in wireless mesh backbone based vehicular network","authors":"Sandip Chakraborty, Sukumar Nandi","doi":"10.1109/ICCCT.2011.6075100","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075100","url":null,"abstract":"Wireless Mesh Network is a promising technology for using as the backbone for Vehicular networks where the roadside access points form a mesh network to forward packets between vehicular client nodes and gateway node that is connected with wired Internet. Due to the dynamic vehicular traffic characteristics, the load at roadside access points varies with time. IEEE 802.11 DCF based MAC protocol shows substantial unfairness in this situation because of dynamic traffic load and multi-hop relay. The APs act as the relay nodes that needs to forward the relayed traffic as well as its own towards the gateway. In this paper an IEEE 802.11 DCF based MAC protocol is proposed that provides proportional fairness among the vehicular clients and roadside access points. Simulation result shows that the proposed scheme performs better than standard IEEE 802.11 DCF based MAC protocol in terms of fairness without loss in throughput.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128134945","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}
Rakesh Kumar Yadav, A. Rana, S. Chauhan, Deepesh Ranka, Kamalesh Yadav
{"title":"Four phase clocking rule for energy efficient digital circuits — An adiabatic concept","authors":"Rakesh Kumar Yadav, A. Rana, S. Chauhan, Deepesh Ranka, Kamalesh Yadav","doi":"10.1109/ICCCT.2011.6075195","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075195","url":null,"abstract":"The energy consumption issue is efficiently addressed by adiabatic switching technique in design of low power digital circuits. Adiabatic switching technique offers the reducing in energy dissipation during switching events and recycling the load capacitance energy instead of dissipated as heat. But adiabatic circuits highly depend upon power clock and parameter variations. With the help of clocking rule, the digital circuits such as inverter and inverter chain are designed for adiabatic techniques, 2N-2N2P, Efficient Charge Recovery Logic (ECRL), Positive Feedback Adiabatic Logic (PFAL) and Clocked Adiabatic Logic (CAL) using TSPICE simulation. The results show high energy savings as compared to CMOS circuits in specified frequency range.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114151140","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":"Developing trust policies for cloud scenarios","authors":"Aradhana, Inderveer Chana","doi":"10.1109/ICCCT.2011.6075147","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075147","url":null,"abstract":"Security is one of the major areas of concern in cloud computing. Users have to authenticate themselves before accessing the services provided by the service provider so trust forms the basis for secure identity provisioning. Cloud providers need to manage trust along with the risks associated with it. This paper determines process for managing trust and specifying trust policies for cloud scenarios. Further trust policies have been represented in the form of decision table that help in clear implementation of these policies.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114266951","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":"Offline signature verification using grid based feature extraction","authors":"S. Srivastava, S. Agarwal","doi":"10.1109/ICCCT.2011.6075121","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075121","url":null,"abstract":"Signature verification is one of the most widely used biometrics for authentication. This paper presents a novel approach for offline signature verification. The proposed technique is based on the grid features extraction. For verification, the extracted features of test signature are compared with the already trained features of the reference signature. This technique is suitable for various applications such as bank transactions, passports etc. The threshold used in the proposed technique can be dynamically changed according to the target application. Basically, the threshold here is the security level which the user can input as per his requirement. The proposed technique deals with skilled forgeries and has been tested on two databases: Database A and a standard Database B (Set 1 and Set 2). The proposed technique gives FAR of 9.7% and FRR of 17.9% for Database A, FAR of 12.6% and FRR of 10.2% for Database B (Set 1) and FAR of 13.5% and FRR of 10.8% for Database B (Set 2) which is better than many existing verification techniques.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114415652","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":"Taxonomy of tree based classification algorithm","authors":"D. Gupta, Dilpreet Singh Kohli, Rajni Jindal","doi":"10.1109/ICCCT.2011.6075191","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075191","url":null,"abstract":"In this paper we are suggesting improvements over an existing C4.5 Algorithm. This is a very popular tree based classification algorithm, used to generate decision tree from a set of training examples. The heuristic function used in this algorithm is based on the concept of information entropy. We are proposing two new heuristic functions which are better than the one used by C4.5 Algorithm by some way or the other. First heuristic function is better in terms of execution time. Second heuristic function is more realistic, gives importance to realistic attributes and thus gives more accurate and reasonable results. So in this way we are proposing two new improvements over J48/C4.5 Algorithm. Throughout the paper we will be using two case studies (examples), one of weather and the other one of student classification for comparing the performance of algorithms.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115067460","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":"Modified Elgamal Cryptosystem Algorithm (MECA)","authors":"Prashant Sharma, Sonal Sharma, R. Dhakar","doi":"10.1109/ICCCT.2011.6075141","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075141","url":null,"abstract":"In 1985 a powerful and public-key scheme was produced by ElGamal. ElGamal encryption/decryption algorithm is based on the difficulty of discrete logarithm problem where it is straight forward to raise numbers to large powers but it is much harder to do the inverse computation of the discrete logarithm. Now, there are so many algorithms available which can solve the discrete logarithm problem of small size numbers in a reasonable time. So to improve security, we proposed a Modified ElGamal Cryptosystem Algorithm (MECA) to enhance the security for encrypting long messages and also secure against mathematical and brute-force attack as well as Low-Modulus and Known-Plaintext attack on Elgamal. The security of this algorithm is based on the difficulty of solving the discrete logarithm problem and Integer factorization problem. This paper also presents comparison between MECA and ElGamal cryptosystem in respect of security and complexity.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115711964","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":"Enhancement of security in visual cryptography system using cover image share embedded security algorithm (CISEA)","authors":"Himanshu Sharma, Neeraj Kumar, G. Jha","doi":"10.1109/ICCCT.2011.6075137","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075137","url":null,"abstract":"Visual Cryptography is an encryption technique used to hide visual information in such a way that it can be decrypted by the human visual system, without using any decryption algorithm. There exist various schemes like digital watermarking algorithm etc. In this paper we have proposed a new algorithm to enhance the security in visual cryptography. To achieve this level of security, we have proposed a Cover Image Share Embedded security algorithm (CISEA) to produce the meaningful shares from the secret image. In this algorithm we have applied a new concept for generation of compliment images of a cover image over which the shares of secret image are to be embedded. CISEA provides one more layer of security for the images in communication channel. It is shown that CISEA provides better security compared to security provided by visual cryptography using digital watermarking system and the results are tested using MS visual studio dot net platform.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"60 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120921029","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":"Search engines evaluation using users efforts","authors":"R. K. Goutam, S. Dwivedi","doi":"10.1109/ICCCT.2011.6075104","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075104","url":null,"abstract":"The performance evaluation of search engines continues to become an research problem. Numerous researchers tried to measure the quality of information retrieval systems with different parameters and achieved several milestones. in case of graded relevance dependent measures, the Discounted Cumulative Gain metric exists that deals with the position of the retrieved results. In this paper, we present the task of learning rankings with the help of human assessment and click hits. we combined experts judgments about the results with the users clicks hits and found that this strategy is effective to assign ranking. The proposed ranking method can be seen as an extension of Expected Reciprocal Ranking that correlates better with clicks metrics than editorial metrics.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121059198","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":"Interactive content-based texture image retrieval","authors":"Pushpa B. Patil, M. Kokare","doi":"10.1109/ICCCT.2011.6075199","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075199","url":null,"abstract":"Due to the semantic gap between low-level image features and high level concepts, content-Based image retrieval (CBIR) systems are incapable to provide the effective results to the user. To address this problem, we have presented a framework for effective image retrieval by proposing a novel idea of cumulative learning using Support Vector Machines (SVM). It creates a knowledge base model to increase the training samples by simply accumulating the samples based on user interactions. As we know relevance feedback (RF) is online process, so we have optimized the learning process by considering the most positive image selection on each feedback iteration. To learn the system we have used SVM. The main significances of our system are to address the small training sample and to reduce retrieval time. Experiments are conducted on 1856 texture images to demonstrate the effectiveness of the proposed framework","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117098080","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":"Online accelarated implementation of the Fuzzy C-means algorithm with the use of the GPU platform","authors":"Sharanyan Srikanthan, V. Krishnan, Arvind Kumar","doi":"10.1109/ICCCT.2011.6075148","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075148","url":null,"abstract":"Fuzzy C-means is a very widely covered topic in literature. It is a very successful clustering method whose subtle variations are involved in various clustering related applications. Despite its success, it shares a disadvantage with almost all of its contemporary pattern discovery algorithms — computational complexity. With the explosion in multimedia data over the internet and growing storage systems, there is a lot of research done in content based data retrieval. Fuzzy C-means is an integral part of this goal but its innate complexity makes it a strictly offline algorithm. Online pattern discovery is the need of the hour and our paper aims to address this issue without the use of powerful servers for implementing Fuzzy C-Means (FCM). We aim at accelerating the algorithm using Graphical Processing Units (GPUs), which are basically graphic cards common in desktop computers. We aim at restructuring the algorithm in a manner in which maximum data parallelism could be extracted thus utilizing the resources of the GPU to the fullest extent. In this paper we compare the speed of our approach using a NVIDIA Tesla C1060 GPU to that of sequential versions running on an Intel Xeon 2.93 GHz and an Intel Dual Core 2GHz.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116332705","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}