Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165188
K. Muthumayil, V. Rajamani, S. Manikandan
The design of efficient routing protocols for Ad hoc neworks is a complex issue. These networks need efficient algorithms to determine ad hoc connectivity and routing. MANET aims not only to provide correct and efficient routes between pair of nodes but also to provide energy efficient route to maximize the life time of ad hoc mobile networks. In this paper, a dynamic energy conscious routing algorithm ECL-AODV where cross layer interaction is provided to utilize the energy related information from physical and MAC layers. This algorithm avoids the nodes which are having low residual energy. By maximizing the lifetime of mobile nodes routing algorithm selects a best path from the viewpoint of high residual energy path as part of route stability. The RTS/CTS transmission is a crucial step towards saving the energy of mobile nodes. In this scheme, the RTS/CTS transmission occurs after route discovery and route reply process. The path is reserved for further transmissions. The receiving power of sender, intermediate nodes and receiver are also another part of route stability. The protocol is implemented for achieving quality of service (QoS) in terms of average energy consumption, packet delivery ratio, end-to-end delay and throughput.
{"title":"A novel cross layered energy based ad hoc on-demand routing protocol for MANETs","authors":"K. Muthumayil, V. Rajamani, S. Manikandan","doi":"10.1109/ICOAC.2011.6165188","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165188","url":null,"abstract":"The design of efficient routing protocols for Ad hoc neworks is a complex issue. These networks need efficient algorithms to determine ad hoc connectivity and routing. MANET aims not only to provide correct and efficient routes between pair of nodes but also to provide energy efficient route to maximize the life time of ad hoc mobile networks. In this paper, a dynamic energy conscious routing algorithm ECL-AODV where cross layer interaction is provided to utilize the energy related information from physical and MAC layers. This algorithm avoids the nodes which are having low residual energy. By maximizing the lifetime of mobile nodes routing algorithm selects a best path from the viewpoint of high residual energy path as part of route stability. The RTS/CTS transmission is a crucial step towards saving the energy of mobile nodes. In this scheme, the RTS/CTS transmission occurs after route discovery and route reply process. The path is reserved for further transmissions. The receiving power of sender, intermediate nodes and receiver are also another part of route stability. The protocol is implemented for achieving quality of service (QoS) in terms of average energy consumption, packet delivery ratio, end-to-end delay and throughput.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131393437","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165215
T. Shanmugam, C. Chellappan
Shrew attack which causes TCP flows to attain zero throughput or a session reset by sending a very short bursts of attack pulses synchronized with TCP retransmission timeout value and makes the TCP packets to be dropped every time during TCP retransmission timeout. It creates a false congestion at the bottleneck links / routers. The Shrew attack can send packets either to non TCP ports or to TCP ports. There is no existing system which defends the attacks on protected ports, multiple and distributed shrew attacks, efficiently. In this paper, we propose an improved Shrew Attack Protection System (iSAP) for protecting the TCP flows from attack on both protected and unprotected ports. This system is based on a newly developed DiffServ Policy which ensures identification of shrew attack flows, preferential treatment and priority scheduling of TCP flows and other unresponsive flows. The simulation results show that legitimate TCP flows and other unresponsive flows attain their high bandwidth shares in the event of Shrew Attack in various forms. This system is developed as a new DiffServ Policy which makes easy to deploy in any DiffServ enabled bottleneck routers.
{"title":"A DiffServ Policy based approach for improved Shrew Attack Protection","authors":"T. Shanmugam, C. Chellappan","doi":"10.1109/ICOAC.2011.6165215","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165215","url":null,"abstract":"Shrew attack which causes TCP flows to attain zero throughput or a session reset by sending a very short bursts of attack pulses synchronized with TCP retransmission timeout value and makes the TCP packets to be dropped every time during TCP retransmission timeout. It creates a false congestion at the bottleneck links / routers. The Shrew attack can send packets either to non TCP ports or to TCP ports. There is no existing system which defends the attacks on protected ports, multiple and distributed shrew attacks, efficiently. In this paper, we propose an improved Shrew Attack Protection System (iSAP) for protecting the TCP flows from attack on both protected and unprotected ports. This system is based on a newly developed DiffServ Policy which ensures identification of shrew attack flows, preferential treatment and priority scheduling of TCP flows and other unresponsive flows. The simulation results show that legitimate TCP flows and other unresponsive flows attain their high bandwidth shares in the event of Shrew Attack in various forms. This system is developed as a new DiffServ Policy which makes easy to deploy in any DiffServ enabled bottleneck routers.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133401220","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165238
C. Chandra Sekhar, S. Thamarai Selvi, C. N. Rao
Discriminative learning based approaches to pattern classification are important for tasks that involve nonlinearly separable classes and overlapping classes as in many real world pattern classification tasks. Multilayer feedforward neural networks built using the computational models of neurons with sigmoidal activation function, and trained using the error back propagation learning algorithm have been explored for complex pattern classification tasks. The main limitations of theses models are the slow convergence of the learning method, the local minima problem and the poor generalization ability of trained models. Support vector machines overcome these limitations by using the principles of kernel methods. In the kernel methods for pattern classification, the first stage involves nonlinear transformation of representation of an example in a low dimensional input feature space to a representation in a high dimensional feature space induced by a kernel function, so that the nonlinearly separable classes in the input feature space are likely be linearly separable classes in the kernel feature space. The second stage in the kernel methods involves constructing an optimal linear solution in the kernel feature space that corresponds to an optimal nonlinear solution in the input feature space. The main advantages of the support vector machines are the good generalization ability and the requirement of small size training data sets. The main issue in the design of support vector machines is the choice of kernel function that induces the nonlinear transformation. Support vector machines can be used for vectorial representations of data as well as for non-vectorial representations of data, whereas multilayer feed forward neural networks can be used mainly for vectorial representations of data. The tutorial presents the underlying principles of approaches to pattern classification using multilayer feedforward neural networks and support vector machines, and discusses the issues in developing pattern classification models using these approaches. Some applications of support vector machines to pattern classification tasks in speech and image processing are also presented.
{"title":"Tutorial I: Neural networks and support vector machines","authors":"C. Chandra Sekhar, S. Thamarai Selvi, C. N. Rao","doi":"10.1109/ICOAC.2011.6165238","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165238","url":null,"abstract":"Discriminative learning based approaches to pattern classification are important for tasks that involve nonlinearly separable classes and overlapping classes as in many real world pattern classification tasks. Multilayer feedforward neural networks built using the computational models of neurons with sigmoidal activation function, and trained using the error back propagation learning algorithm have been explored for complex pattern classification tasks. The main limitations of theses models are the slow convergence of the learning method, the local minima problem and the poor generalization ability of trained models. Support vector machines overcome these limitations by using the principles of kernel methods. In the kernel methods for pattern classification, the first stage involves nonlinear transformation of representation of an example in a low dimensional input feature space to a representation in a high dimensional feature space induced by a kernel function, so that the nonlinearly separable classes in the input feature space are likely be linearly separable classes in the kernel feature space. The second stage in the kernel methods involves constructing an optimal linear solution in the kernel feature space that corresponds to an optimal nonlinear solution in the input feature space. The main advantages of the support vector machines are the good generalization ability and the requirement of small size training data sets. The main issue in the design of support vector machines is the choice of kernel function that induces the nonlinear transformation. Support vector machines can be used for vectorial representations of data as well as for non-vectorial representations of data, whereas multilayer feed forward neural networks can be used mainly for vectorial representations of data. The tutorial presents the underlying principles of approaches to pattern classification using multilayer feedforward neural networks and support vector machines, and discusses the issues in developing pattern classification models using these approaches. Some applications of support vector machines to pattern classification tasks in speech and image processing are also presented.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116838265","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165153
J. Sekar, S. Arivazhagan, R. Murugan
Iris segmentation is used to locate the valid part of the iris for iris biometrics which is an essential module in iris recognition because it defines the effective image region used for subsequent processing such as feature extraction and iris identification. A novel algorithm for efficient and accurate iris segmentation is carried out in this system. The pupil boundary is detected by applying the equation of circle by finding three points on its circumference. The reflection within the pupil region (if any) is filled by reducing the radius of the pupil one by one until it reaches to zero. Then calculating the edge points of iris boundaries (left, right, upper and lower) point by taking the fixed value from pupil circumference. The novelty here for eyelids localization can be performed by using ‘3 points marking’ for upper lid and ‘edge detector’ for lower lid. After that, eyelash removal can be done by Order — Statistic Filtering. Finally, the accurate iris edge region is fitted by calculating the point of intersection between eyelids and eye localization. After edge fitting, the curvelet transform is applied for feature extraction. The Manhattan and Euclidean Distance measures are used to measure the similarity between two images to find the best match. Here, the challenging benchmark database MMU is used for identification and verification.
{"title":"Methodology for iris segmentation and recognition using multi-resolution transform","authors":"J. Sekar, S. Arivazhagan, R. Murugan","doi":"10.1109/ICOAC.2011.6165153","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165153","url":null,"abstract":"Iris segmentation is used to locate the valid part of the iris for iris biometrics which is an essential module in iris recognition because it defines the effective image region used for subsequent processing such as feature extraction and iris identification. A novel algorithm for efficient and accurate iris segmentation is carried out in this system. The pupil boundary is detected by applying the equation of circle by finding three points on its circumference. The reflection within the pupil region (if any) is filled by reducing the radius of the pupil one by one until it reaches to zero. Then calculating the edge points of iris boundaries (left, right, upper and lower) point by taking the fixed value from pupil circumference. The novelty here for eyelids localization can be performed by using ‘3 points marking’ for upper lid and ‘edge detector’ for lower lid. After that, eyelash removal can be done by Order — Statistic Filtering. Finally, the accurate iris edge region is fitted by calculating the point of intersection between eyelids and eye localization. After edge fitting, the curvelet transform is applied for feature extraction. The Manhattan and Euclidean Distance measures are used to measure the similarity between two images to find the best match. Here, the challenging benchmark database MMU is used for identification and verification.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116909412","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165214
Thirumaran M S Dhavachelvan, G Aranganayagi, M Karthikeyan, Pondicherry Pondicherry
Service Integration has become a critical issue as organizations find a greater need to consistently interact with their partners and share their Business logics to carry out the necessities. To accurately and efficiently extract and integrate the required service logics from the rapidly expanding Business services, developers need to empathize the whole service and must decide on proper approach to merge them which are complex and time-consuming tasks. So the present focus is to have a mechanized system which analyzes the Business logics and conveys proper mode to integrate them. There is no standard model to undertake these issues and one such a model proposed in this paper examines the Business logics individually and suggests proper structure to integrate them. One of the innovative concepts of proposed model is Property Evaluation System which scrutinizes the service logics and ascertains proper mode to integrate the service. The system constructs FSM for each Business logic and consumes this FSM to identify dependency between the logic and suggests the feasible ways to integrate the service logics. This helps developers to integrate the service logics with least effort.
{"title":"A dynamic service integration framework for modern service industry","authors":"Thirumaran M S Dhavachelvan, G Aranganayagi, M Karthikeyan, Pondicherry Pondicherry","doi":"10.1109/ICOAC.2011.6165214","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165214","url":null,"abstract":"Service Integration has become a critical issue as organizations find a greater need to consistently interact with their partners and share their Business logics to carry out the necessities. To accurately and efficiently extract and integrate the required service logics from the rapidly expanding Business services, developers need to empathize the whole service and must decide on proper approach to merge them which are complex and time-consuming tasks. So the present focus is to have a mechanized system which analyzes the Business logics and conveys proper mode to integrate them. There is no standard model to undertake these issues and one such a model proposed in this paper examines the Business logics individually and suggests proper structure to integrate them. One of the innovative concepts of proposed model is Property Evaluation System which scrutinizes the service logics and ascertains proper mode to integrate the service. The system constructs FSM for each Business logic and consumes this FSM to identify dependency between the logic and suggests the feasible ways to integrate the service logics. This helps developers to integrate the service logics with least effort.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125340138","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165156
B. Elangovan, Bharath
In this paper a Peer to peer network is considered where all the peers have equal responsibilities. In a peer to peer network, trust issues have gained focus as a result of the decentralized nature of P2P systems where autonomous peers interact with each other. Reputation systems provide a way for building trust through feedback about past experiences of peers to help making recommendation and judgment on quality and reliability of the transactions. The peer can rate the reliability of those peers with which it has dealt in the past. Existing reputation mechanisms detects malicious peer by simple trust metric like calculating number of positive feedback divided by sum of positive feedback and negative feedback. The proposed system is to design a trust model with intensified malicious node detection in peer-to-peer network in which, I-SDT (Intensified Secure Deep Throat) protocol is used to provide witness anonymity of malicious behaviour with intensified malicious node detection procedure. The detection method proposed is improved — Eigen Trust algorithm based on Fuzzy synthetic evaluation model.
本文考虑了一个对等网络，其中所有的对等节点都具有相同的责任。在点对点网络中，信任问题由于P2P系统的分散性而受到关注，在P2P系统中，自主的对等体彼此交互。声誉系统提供了一种建立信任的方式，通过对同行过去经验的反馈来帮助对交易的质量和可靠性进行推荐和判断。对等体可以对它过去处理过的对等体的可靠性进行评估。现有的信誉机制通过计算正反馈数除以正反馈和负反馈之和的简单信任度量来检测恶意对等体。该系统设计了一种在点对点网络中增强恶意节点检测的信任模型，该模型采用I-SDT (enhanced Secure Deep Throat，强化安全深喉)协议，通过增强的恶意节点检测过程为恶意行为证人提供匿名性。提出了一种改进的基于模糊综合评价模型的特征信任算法。
{"title":"Trust model: Providing witness anonymity in P2P network","authors":"B. Elangovan, Bharath","doi":"10.1109/ICOAC.2011.6165156","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165156","url":null,"abstract":"In this paper a Peer to peer network is considered where all the peers have equal responsibilities. In a peer to peer network, trust issues have gained focus as a result of the decentralized nature of P2P systems where autonomous peers interact with each other. Reputation systems provide a way for building trust through feedback about past experiences of peers to help making recommendation and judgment on quality and reliability of the transactions. The peer can rate the reliability of those peers with which it has dealt in the past. Existing reputation mechanisms detects malicious peer by simple trust metric like calculating number of positive feedback divided by sum of positive feedback and negative feedback. The proposed system is to design a trust model with intensified malicious node detection in peer-to-peer network in which, I-SDT (Intensified Secure Deep Throat) protocol is used to provide witness anonymity of malicious behaviour with intensified malicious node detection procedure. The detection method proposed is improved — Eigen Trust algorithm based on Fuzzy synthetic evaluation model.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293823","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165173
Dr.S. K. Jayanthi, D. Rajalakshmi
Writer identification is a popular research field in many languages. Since alphabets of different language have different pattern, the methods are dependent on the language. Handwriting of a person has some features which are unique to every person and can be used for identification. Most of the research activities for writer identification are based on English documents and the research activities for Tamil handwriting are thin and databases are not available. In this paper, a method is proposed to identify a writer from the scanned images of Tamil handwritten text. Our approach is based on texture analysis where each writer's handwriting is treated as a different texture. The method is text independent and based on the features extracted from gray level co-occurrence matrix of the scanned image. Handwriting samples from 70 writers were used and the documents were scanned with 150 dpi.
{"title":"Writer identification for offline Tamil handwriting based on gray-level co-occurrence matrices","authors":"Dr.S. K. Jayanthi, D. Rajalakshmi","doi":"10.1109/ICOAC.2011.6165173","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165173","url":null,"abstract":"Writer identification is a popular research field in many languages. Since alphabets of different language have different pattern, the methods are dependent on the language. Handwriting of a person has some features which are unique to every person and can be used for identification. Most of the research activities for writer identification are based on English documents and the research activities for Tamil handwriting are thin and databases are not available. In this paper, a method is proposed to identify a writer from the scanned images of Tamil handwritten text. Our approach is based on texture analysis where each writer's handwriting is treated as a different texture. The method is text independent and based on the features extracted from gray level co-occurrence matrix of the scanned image. Handwriting samples from 70 writers were used and the documents were scanned with 150 dpi.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132977805","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165231
N. Shenoy, M. Srivatsa, K. Sivalingam, R. Chandramouli, C. Chellappan, S. Naik, Shoolapani Biju, A. Kannan, T. Geetha, K. Sunder, V. Vaidehi, M. Govindarasu
Over the last couple of decades, the trends in network protocols and the layering principles have witnessed deviations from the standard 7-layer OSI model or the 5-layer TCP/IP model. These deviations were necessary to improve network performance, in terms of service quality offered to the increasing numbers in users and their demands and coping with emerging software and hardware technologies among others. In the wireless networking arena, cross layered techniques are being increasingly employed to overcome limitations and constraints imposed by the layering principles. These efforts are indicators that it is time for researchers to investigate the rationale to adhere to the legacy layering principles. This talk is directed towards some of the recent networking demands that would be better addressed by a clean slate approach both from an architectural and protocols perspective. The talk targets the current Internet as an example of wired networks and mobile ad hoc networks as an example of wireless networks, to show how one can transition out of the layering principles and hence the constraints imposed by them.
{"title":"Plenary speaker I: Networking and protocol layering — Legacy or clean slate","authors":"N. Shenoy, M. Srivatsa, K. Sivalingam, R. Chandramouli, C. Chellappan, S. Naik, Shoolapani Biju, A. Kannan, T. Geetha, K. Sunder, V. Vaidehi, M. Govindarasu","doi":"10.1109/ICOAC.2011.6165231","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165231","url":null,"abstract":"Over the last couple of decades, the trends in network protocols and the layering principles have witnessed deviations from the standard 7-layer OSI model or the 5-layer TCP/IP model. These deviations were necessary to improve network performance, in terms of service quality offered to the increasing numbers in users and their demands and coping with emerging software and hardware technologies among others. In the wireless networking arena, cross layered techniques are being increasingly employed to overcome limitations and constraints imposed by the layering principles. These efforts are indicators that it is time for researchers to investigate the rationale to adhere to the legacy layering principles. This talk is directed towards some of the recent networking demands that would be better addressed by a clean slate approach both from an architectural and protocols perspective. The talk targets the current Internet as an example of wired networks and mobile ad hoc networks as an example of wireless networks, to show how one can transition out of the layering principles and hence the constraints imposed by them.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134137838","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165170
V Kavitha, Professor, S. Balaji, R. Jeeva, P. Scholar
The random bit generated by pseudorandom bit generator used in Randomized Arithmetic Coding (RAC) doesn't depend on any parameter, so it raises the difficulty in decryption side to reconstruct that random bit and the process to match the exact pattern will take multistep till it reaches exact value. In our system Randomized Matrix Arithmetic Coding (RMAC), the security depends on a randomized matrix formed by the random key based on the user profile. So the adversary can't guess the cipher or key because we are encrypting plaintext with the symbols in the matrix, not only by the key and at the same time using that key it is easy to recreate the matrix at the decryption side. It will increase the security of Arithmetic Coding by preventing from the attacks like Chosen Cipher text Attack type-2 (CCA2) attack, third party attack etc and at the same time it reduces the computational time to match the cipher with original pattern.
{"title":"RMAC — A new encryption scheme for Arithmetic Coding to evade CCA attacks","authors":"V Kavitha, Professor, S. Balaji, R. Jeeva, P. Scholar","doi":"10.1109/ICOAC.2011.6165170","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165170","url":null,"abstract":"The random bit generated by pseudorandom bit generator used in Randomized Arithmetic Coding (RAC) doesn't depend on any parameter, so it raises the difficulty in decryption side to reconstruct that random bit and the process to match the exact pattern will take multistep till it reaches exact value. In our system Randomized Matrix Arithmetic Coding (RMAC), the security depends on a randomized matrix formed by the random key based on the user profile. So the adversary can't guess the cipher or key because we are encrypting plaintext with the symbols in the matrix, not only by the key and at the same time using that key it is easy to recreate the matrix at the decryption side. It will increase the security of Arithmetic Coding by preventing from the attacks like Chosen Cipher text Attack type-2 (CCA2) attack, third party attack etc and at the same time it reduces the computational time to match the cipher with original pattern.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"106 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131980152","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}
Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165217
T. S. Kumar, R. Ganesan
In this work we have proposed a new mobile based health application on pervasive computing to cater the well being of heart and we designing a new bio-related mobile which is incorporated with stethoscope. We call it as “Mobile Steth” with automatic application for suggesting the food and heart related alerts. Mobile Steth will record the user feeding food related datum; with this user datum critical label will be checked. If the subject (patient) reaches the critical label, mobile steth will initiates an alarm to their family members and if the subject needs, it will fix appointm ent in the nearest hospital zone.
{"title":"Sharon: Tension free mobile incorporated with health care system using Christina heart card","authors":"T. S. Kumar, R. Ganesan","doi":"10.1109/ICOAC.2011.6165217","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165217","url":null,"abstract":"In this work we have proposed a new mobile based health application on pervasive computing to cater the well being of heart and we designing a new bio-related mobile which is incorporated with stethoscope. We call it as “Mobile Steth” with automatic application for suggesting the food and heart related alerts. Mobile Steth will record the user feeding food related datum; with this user datum critical label will be checked. If the subject (patient) reaches the critical label, mobile steth will initiates an alarm to their family members and if the subject needs, it will fix appointm ent in the nearest hospital zone.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132197578","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：