Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165152
B. Sajeev, K. Thangavel
Fast retrieval of relevant information from the databases has always been a significant issue. Different techniques have been developed for this purpose; one of them is Data mining. Clustering analysis is a key and easy tool in data mining and pattern recognition. In this paper K-Mean clustering is used for evaluating the performance of socially and economically backward group of people, self help groups (SHG's) in Kerala state, and suggestions are made to improve socioeconomic status. The necessary information about the members of SHG has been collected from 9 districts in Kerala through structured questionnaire. The Parameters considered for the study are financial status, types of loan availed, improvement in assets before and after joining the group, effect of joining in more than one group and district wise analysis.
从数据库中快速检索相关信息一直是一个重要的问题。为此目的开发了不同的技术;其中之一就是数据挖掘。聚类分析是数据挖掘和模式识别中一个关键而简单的工具。本文采用k均值聚类方法对喀拉拉邦社会经济落后群体——自助群体(self - help groups, SHG’s)的绩效进行了评价，并提出了改善社会经济状况的建议。通过结构化问卷从喀拉拉邦的9个地区收集了关于SHG成员的必要信息。该研究考虑的参数包括财务状况、获得的贷款类型、加入集团前后的资产改善情况、加入多个集团的影响以及地区明智分析。
{"title":"Evolving effective strategies for enhancing SHG's using K-mean clustering","authors":"B. Sajeev, K. Thangavel","doi":"10.1109/ICOAC.2011.6165152","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165152","url":null,"abstract":"Fast retrieval of relevant information from the databases has always been a significant issue. Different techniques have been developed for this purpose; one of them is Data mining. Clustering analysis is a key and easy tool in data mining and pattern recognition. In this paper K-Mean clustering is used for evaluating the performance of socially and economically backward group of people, self help groups (SHG's) in Kerala state, and suggestions are made to improve socioeconomic status. The necessary information about the members of SHG has been collected from 9 districts in Kerala through structured questionnaire. The Parameters considered for the study are financial status, types of loan availed, improvement in assets before and after joining the group, effect of joining in more than one group and district wise analysis.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"13 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":"131804044","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.6165232
V. Narasimhan, Xavier N Fernando, Vivekanda Sureshkumar, Sasanka V. Prabhala, Subhashini Ganapathy
Cloud computing radically changes the way computer applications and services are constructed, delivered, and managed — particularly in Healthcare and various other medical applications. Large size of medical datasets and the data-intensive applications are performed more efficiently using cloud computing than with other forms of computing. Software services that can obtain seemingly infinite scalability and services level is now possible. Incremental growth to meet customers' varying demands is also possible. Several types of costing models, rapid provisioning and availability lead to more efficient resource utilization and reduced cost for utilization. Consequently, a good understanding of how cloud computing can be employed for medical applications is required for medical professionals, social scientists and business professionals. In this talk, I will provide cloud computing applications to several areas which include, but not limited to, medical information management, medical intelligence, value-adding thru' information extraction, medical and pharmaceutical intelligence and just-in-time management of health. Furthermore, I will allude to some examples of cloud computing to medial intelligence that possibly raises several yet-answered ethical and legal Issues. I will conclude with a list of grand challenges that cloud computing faces in the context of medical applications.
{"title":"Plenary online I: Cloud computing for Healthcare & medical applications (online)","authors":"V. Narasimhan, Xavier N Fernando, Vivekanda Sureshkumar, Sasanka V. Prabhala, Subhashini Ganapathy","doi":"10.1109/ICOAC.2011.6165232","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165232","url":null,"abstract":"Cloud computing radically changes the way computer applications and services are constructed, delivered, and managed — particularly in Healthcare and various other medical applications. Large size of medical datasets and the data-intensive applications are performed more efficiently using cloud computing than with other forms of computing. Software services that can obtain seemingly infinite scalability and services level is now possible. Incremental growth to meet customers' varying demands is also possible. Several types of costing models, rapid provisioning and availability lead to more efficient resource utilization and reduced cost for utilization. Consequently, a good understanding of how cloud computing can be employed for medical applications is required for medical professionals, social scientists and business professionals. In this talk, I will provide cloud computing applications to several areas which include, but not limited to, medical information management, medical intelligence, value-adding thru' information extraction, medical and pharmaceutical intelligence and just-in-time management of health. Furthermore, I will allude to some examples of cloud computing to medial intelligence that possibly raises several yet-answered ethical and legal Issues. I will conclude with a list of grand challenges that cloud computing faces in the context of medical applications.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"39 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":"132245671","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.6165181
T. M. Bhruguram, Jesna Jamal, M. Kurian, Chinchu Jose
A data encryption scheme which does not allows any internal data access to the third party who is responsible for processing the data which is highly confidential. This separation is a complex task and can fall in to a data violation for the intermediate processing nodes. We describe a new standard for these malleable environments which will provide good semantic level security and prevent the third party from accessing highly confidential internal data. This scheme allows the third party to execute any complex functions to the encrypted internal details but does not need any secret decryption key. But he is not permitted to peep into the data contents. We are proposing this scheme for cloud computing where more security is taking as the major factor.
{"title":"An arbitrary encryption scheme for homomorphic data Migration","authors":"T. M. Bhruguram, Jesna Jamal, M. Kurian, Chinchu Jose","doi":"10.1109/ICOAC.2011.6165181","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165181","url":null,"abstract":"A data encryption scheme which does not allows any internal data access to the third party who is responsible for processing the data which is highly confidential. This separation is a complex task and can fall in to a data violation for the intermediate processing nodes. We describe a new standard for these malleable environments which will provide good semantic level security and prevent the third party from accessing highly confidential internal data. This scheme allows the third party to execute any complex functions to the encrypted internal details but does not need any secret decryption key. But he is not permitted to peep into the data contents. We are proposing this scheme for cloud computing where more security is taking as the major factor.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"3 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":"123592323","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.6165190
P. Tamilselvi, S. Srivatsa
In general, different levels of knowledge are used for disambiguation. In this paper, only three knowledge features or sources (trigram) are used to achieve the word sense disambiguation. Case based approach is applied for the disambiguation process. Cases are nothing but the refined form of words collected from Semcor, used for deriving the sense of the ambiguous input word. All possible Part of Speech (PoS) listed in Brown Corpus are collected and grouped into seventeen groups, and each group is assigned with a constant value. Trigram features of input (ambiguous words) as well as cases are represented as vector of size 1×3. Vector values for the ambiguous word and other two neighboring words are taken out from those assigned weights based on their PoS. In this paper ten different distance metric functions are empirically analyzed for improving the accuracy performance of word disambiguation with minimal knowledge sources. Neural Network is used for extracting correct sense of the ambiguous word from the selected minimal distance cases. In this paper, a long sentence is taken to project the performance of disambiguation process. From the result, it is clear that, post-trigramed Hamming function (F9) produced appreciable disambiguation accuracy 78.57% (recognized eleven ambiguous words out of fourteen).
{"title":"Optimal distance metric function with trigram features for case based word sense disambiguation using artificial neural network","authors":"P. Tamilselvi, S. Srivatsa","doi":"10.1109/ICOAC.2011.6165190","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165190","url":null,"abstract":"In general, different levels of knowledge are used for disambiguation. In this paper, only three knowledge features or sources (trigram) are used to achieve the word sense disambiguation. Case based approach is applied for the disambiguation process. Cases are nothing but the refined form of words collected from Semcor, used for deriving the sense of the ambiguous input word. All possible Part of Speech (PoS) listed in Brown Corpus are collected and grouped into seventeen groups, and each group is assigned with a constant value. Trigram features of input (ambiguous words) as well as cases are represented as vector of size 1×3. Vector values for the ambiguous word and other two neighboring words are taken out from those assigned weights based on their PoS. In this paper ten different distance metric functions are empirically analyzed for improving the accuracy performance of word disambiguation with minimal knowledge sources. Neural Network is used for extracting correct sense of the ambiguous word from the selected minimal distance cases. In this paper, a long sentence is taken to project the performance of disambiguation process. From the result, it is clear that, post-trigramed Hamming function (F9) produced appreciable disambiguation accuracy 78.57% (recognized eleven ambiguous words out of fourteen).","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"1 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":"115501840","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.6165185
K. Sandhya, G. Raju
In a compute cluster, the nodes may be distributed and heterogeneous in nature. It may be difficult to administer and interface with such a system. It will be better if all the users get an interface with same look and feel rather to have a different view in each node of the cluster. Thus Single System Image(SSI) is a major design goal of cluster based systems. The services that SSI clusters offer are single user interface, single process space, single memory space, single file hierarchy and single control point. Kerrighed is an SSI Operating System which provides the services mentioned above. This paper gives the details about how to set up a Kerrighed cluster, how to use a kerrighed cluster for running MPI programs, and shows how a cluster can improve the performance of an MPI program when it is run on a cluster of machines. The paper also gives an idea about how Kerrighed helps programmers to easily add new scheduling algorithms for cluster with the help of Scheduler API and a design for adding a proposed algorithm into Kerrighed.
{"title":"Single System Image clustering using Kerrighed","authors":"K. Sandhya, G. Raju","doi":"10.1109/ICOAC.2011.6165185","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165185","url":null,"abstract":"In a compute cluster, the nodes may be distributed and heterogeneous in nature. It may be difficult to administer and interface with such a system. It will be better if all the users get an interface with same look and feel rather to have a different view in each node of the cluster. Thus Single System Image(SSI) is a major design goal of cluster based systems. The services that SSI clusters offer are single user interface, single process space, single memory space, single file hierarchy and single control point. Kerrighed is an SSI Operating System which provides the services mentioned above. This paper gives the details about how to set up a Kerrighed cluster, how to use a kerrighed cluster for running MPI programs, and shows how a cluster can improve the performance of an MPI program when it is run on a cluster of machines. The paper also gives an idea about how Kerrighed helps programmers to easily add new scheduling algorithms for cluster with the help of Scheduler API and a design for adding a proposed algorithm into Kerrighed.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"51 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":"128374555","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.6165201
A. Ahilan, Esther Annlin, Kala James
Face detection is a technique that determines the locations and sizes of human face images. It detects facial features and ignores anything else, such as buildings, trees and bodies. Face-detection algorithms focused on the detection of frontal human faces, whereas newer algorithms attempt to solve the more general and difficult problem of multi-view face detection. This paper presents a hardware architecture for face detection system based on Viola Jones algorithm using Haar features. The proposed algorithm is used in real time car theft detection. The architecture for face detection is designed using Verilog HDL and implemented in Xilinx Virtex-5 ML505 FPGA. Its performance has been measured and compared with an equivalent software implementation.
{"title":"Design and implementation of real time car theft detection in FPGA","authors":"A. Ahilan, Esther Annlin, Kala James","doi":"10.1109/ICOAC.2011.6165201","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165201","url":null,"abstract":"Face detection is a technique that determines the locations and sizes of human face images. It detects facial features and ignores anything else, such as buildings, trees and bodies. Face-detection algorithms focused on the detection of frontal human faces, whereas newer algorithms attempt to solve the more general and difficult problem of multi-view face detection. This paper presents a hardware architecture for face detection system based on Viola Jones algorithm using Haar features. The proposed algorithm is used in real time car theft detection. The architecture for face detection is designed using Verilog HDL and implemented in Xilinx Virtex-5 ML505 FPGA. Its performance has been measured and compared with an equivalent software implementation.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"1 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":"128985560","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.6165151
T. Sabapathi, S. Sundaravadivelu, A. Vairamuthu
To meet the growing data traffic demands in the telecommunication applications, the number of wavelengths is to be increased in a fiber-optic backbone of the telecommunication network. The exponential growth of internet services, transmission capacity is a tremendous challenge to networks. Nowadays, 100 Gb/s transmission systems are being used for commercial applications. At the same time, the non-linear effects such as FWM, SRS, XPM, SPM, and Dispersion are also increased, when the number of wavelengths passing through the single fiber is increased. The analysis of efficient modulation formats for DWDM system and long-haul transmission system, we go for various modulations for DWDM system. The maximum data rate for NRZ-OOK modulation format is 100 Gb/s. For RZ-OOK the maximum rate is 50 Gb/s. Since RZ-OOK modulation uses twice the band width when compared to NRZ-OOK modulation. The modulation format is partially upgraded from OOK to PSK, the influence of OOK signals on the updated PSK signals must be considered when using multi-channel wavelength conversion. The PSK modulation is also analyzed.
{"title":"Analysis of optical modulation formats for DWDM system","authors":"T. Sabapathi, S. Sundaravadivelu, A. Vairamuthu","doi":"10.1109/ICOAC.2011.6165151","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165151","url":null,"abstract":"To meet the growing data traffic demands in the telecommunication applications, the number of wavelengths is to be increased in a fiber-optic backbone of the telecommunication network. The exponential growth of internet services, transmission capacity is a tremendous challenge to networks. Nowadays, 100 Gb/s transmission systems are being used for commercial applications. At the same time, the non-linear effects such as FWM, SRS, XPM, SPM, and Dispersion are also increased, when the number of wavelengths passing through the single fiber is increased. The analysis of efficient modulation formats for DWDM system and long-haul transmission system, we go for various modulations for DWDM system. The maximum data rate for NRZ-OOK modulation format is 100 Gb/s. For RZ-OOK the maximum rate is 50 Gb/s. Since RZ-OOK modulation uses twice the band width when compared to NRZ-OOK modulation. The modulation format is partially upgraded from OOK to PSK, the influence of OOK signals on the updated PSK signals must be considered when using multi-channel wavelength conversion. The PSK modulation is also analyzed.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"180 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":"122153688","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.6165154
M. Thirumaran, P. Dhavachelvan, K. Seenuvasan, G. Aranganayagi
Currently web services are being widely and extensively used in the business world mainly because they offer reusable application-components and due to their support in solving the interoperability problem by providing different applications a way to link their data. The current consumer needs are mainly converged towards leveraging an efficient method of determining if the exceptions occurring during the runtime execution of the web services can be handled. Moreover, the identification of manageable exceptions also comes into picture when consideri ng the manageability aspect of a web service stimulating an increased value of reliability of the service. In this paper, we propose an innovative model for focusing upon and verifying the manageability of a web service. Runtime management has been given utmost significance as a potential strategy to handle runtime exceptions increases the adaptability of services to exceptional circumstances. Thus a novel architecture for exception handling has been proposed which affords facilities for explicit reference to the cause, location, priority and dependency of the various runtime exceptions in contrast to the traditional pattern of throwing only the exception message.
{"title":"A novel approach for run time web service exception handling","authors":"M. Thirumaran, P. Dhavachelvan, K. Seenuvasan, G. Aranganayagi","doi":"10.1109/ICOAC.2011.6165154","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165154","url":null,"abstract":"Currently web services are being widely and extensively used in the business world mainly because they offer reusable application-components and due to their support in solving the interoperability problem by providing different applications a way to link their data. The current consumer needs are mainly converged towards leveraging an efficient method of determining if the exceptions occurring during the runtime execution of the web services can be handled. Moreover, the identification of manageable exceptions also comes into picture when consideri ng the manageability aspect of a web service stimulating an increased value of reliability of the service. In this paper, we propose an innovative model for focusing upon and verifying the manageability of a web service. Runtime management has been given utmost significance as a potential strategy to handle runtime exceptions increases the adaptability of services to exceptional circumstances. Thus a novel architecture for exception handling has been proposed which affords facilities for explicit reference to the cause, location, priority and dependency of the various runtime exceptions in contrast to the traditional pattern of throwing only the exception message.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"22 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":"124294130","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.6165197
A. Selvakumar, V. Vaidehi, T. G. Palanivelu
Recent day development of wireless technology integrates to communicate with each other. A handoff scheme is essential to continue connections whenever a mobile node moves from one coverage area of network to another. The handoff management issues consist of finding the appropriate time to perform the handoff, velocity, channel conditions, cost, bandwidth and RSS etc., In this paper, we propose a vertical handoff decision algorithm for heterogeneous wireless network based on the Velocity of mobile node and the Adaptive traffic load balanced handoff management scheme which adaptively control the handoff time according to the load status of cells. The algorithm considers the number of handoff when the velocity increases with effective reduction of probability of handoff and efficiently manages further overloaded traffic in the system. Simulation result shows that the effectiveness of the proposed algorithm during handover between different wireless networks.
{"title":"Adaptive load balancing handoff scheme for heterogeneous wireless network","authors":"A. Selvakumar, V. Vaidehi, T. G. Palanivelu","doi":"10.1109/ICOAC.2011.6165197","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165197","url":null,"abstract":"Recent day development of wireless technology integrates to communicate with each other. A handoff scheme is essential to continue connections whenever a mobile node moves from one coverage area of network to another. The handoff management issues consist of finding the appropriate time to perform the handoff, velocity, channel conditions, cost, bandwidth and RSS etc., In this paper, we propose a vertical handoff decision algorithm for heterogeneous wireless network based on the Velocity of mobile node and the Adaptive traffic load balanced handoff management scheme which adaptively control the handoff time according to the load status of cells. The algorithm considers the number of handoff when the velocity increases with effective reduction of probability of handoff and efficiently manages further overloaded traffic in the system. Simulation result shows that the effectiveness of the proposed algorithm during handover between different wireless networks.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"56 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":"121401696","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.6165163
R. Mariappan, S. Mohan
In this paper, we present new protocol design scenario like Re-Pro Routing Protocol (RPRP) for Broadcasting in wireless mobile Ad-hoc Network and a comparative performance for Mobile Ad hoc Networks protocols like as Ad-hoc On-Demand Distance Vector Routing protocol focusing on the effects of changes such as the increasing number of receivers or sources and increasing the number of nodes. Although some simulation results of MANET protocols have been published before, these protocols have not been compared in isolation. A systematic performance evaluation of these protocols is done by performing certain simulations and the trust methods are one of the security methods in mobile Ad-Hoc networks and this methods are prone to security risks but have found their acceptance due to efficiency over computationally expensive and time consuming cryptographic methods. The major problem with the trust methods is the period during which trust is growing and is yet to reach the requisite threshold. This paper also proposes security mechanism dependent upon Electronic Code (EC) combined with permutation functions. The proposed mechanism has low time complexity, is easier to implement, computationally inexpensive and has very high brute force search value.
{"title":"Re-Pro Routing Protocol with trust based security for Broadcasting in Mobile Ad hoc Network","authors":"R. Mariappan, S. Mohan","doi":"10.1109/ICOAC.2011.6165163","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165163","url":null,"abstract":"In this paper, we present new protocol design scenario like Re-Pro Routing Protocol (RPRP) for Broadcasting in wireless mobile Ad-hoc Network and a comparative performance for Mobile Ad hoc Networks protocols like as Ad-hoc On-Demand Distance Vector Routing protocol focusing on the effects of changes such as the increasing number of receivers or sources and increasing the number of nodes. Although some simulation results of MANET protocols have been published before, these protocols have not been compared in isolation. A systematic performance evaluation of these protocols is done by performing certain simulations and the trust methods are one of the security methods in mobile Ad-Hoc networks and this methods are prone to security risks but have found their acceptance due to efficiency over computationally expensive and time consuming cryptographic methods. The major problem with the trust methods is the period during which trust is growing and is yet to reach the requisite threshold. This paper also proposes security mechanism dependent upon Electronic Code (EC) combined with permutation functions. The proposed mechanism has low time complexity, is easier to implement, computationally inexpensive and has very high brute force search value.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"49 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":"132185496","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
扫码关注我们
求助内容：
应助结果提醒方式：