Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844214
M. Amaresh, G. Usha
A Mobile Ad-hoc Network (MANET) is a self-organized system comprised of mobile wireless nodes. It does not have centralized administration. So MANETs in open environment, easily attacked by malicious nodes because any node can join at any time in the network. AODV is a most traditional routing protocol used for MANET, which selects the shortest path for routing and it affects the data communication if any malicious node present in the shortest path. Proposed model uses the combination of trust and energy value based routing protocol called Energy and Trust Based AODV routing protocol (ET-AODV) to establish a most trusted routes by providing modification to AODV protocol. In proposed technique each node estimates its neighbor's trust value and energy value that is one node has for another node during communication dynamically. Adding trust value and energy value new root value is calculated and maintained in every neighbor table. Using root value trusted routes are established by two methods that are single value routing and multiple value routing and isolate the malicious nodes from the network. This technique only considers the black hole attack which can easily interrupt the communication path. Experimental results shows that the ET-AODV routing protocol is able to achieve an improvement in packet delivery ratios rather than AODV.
{"title":"Efficient malicious detection for AODV in mobile ad-hoc network","authors":"M. Amaresh, G. Usha","doi":"10.1109/ICRTIT.2013.6844214","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844214","url":null,"abstract":"A Mobile Ad-hoc Network (MANET) is a self-organized system comprised of mobile wireless nodes. It does not have centralized administration. So MANETs in open environment, easily attacked by malicious nodes because any node can join at any time in the network. AODV is a most traditional routing protocol used for MANET, which selects the shortest path for routing and it affects the data communication if any malicious node present in the shortest path. Proposed model uses the combination of trust and energy value based routing protocol called Energy and Trust Based AODV routing protocol (ET-AODV) to establish a most trusted routes by providing modification to AODV protocol. In proposed technique each node estimates its neighbor's trust value and energy value that is one node has for another node during communication dynamically. Adding trust value and energy value new root value is calculated and maintained in every neighbor table. Using root value trusted routes are established by two methods that are single value routing and multiple value routing and isolate the malicious nodes from the network. This technique only considers the black hole attack which can easily interrupt the communication path. Experimental results shows that the ET-AODV routing protocol is able to achieve an improvement in packet delivery ratios rather than AODV.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126335174","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844238
R. Priyadarshini, L. Tamilselvan
In recent years, the World Wide Web has grown tremendously and become more complex because of the growing number of users and the content being added in varied formats. Web 1.0 suffered from publishing limitations as it requires significant amount of software investments. Web 2.0 has changed this by providing easy to use web tools to enable people to generate content and publish it easily on the web. This resulted in an explosion of web contents and has made relevant information retrieval challenging. This has led to the evolution of semantic web, where the traditional web content is added with semantic repository. There are semantic web based tools being developed and researched to make the information retrieval more efficient. This paper describes a semantic weblog which has the feature of locating the exact source content from the reference URLs. This ideology will be used in the CMS (Content Management System). It's highly possible that the content in CMS will be redundant over the web as most of the time the content will be gathered from already existing websites. Back tracking the source of such content will become obsolete and also changes to the source are difficult to be tracked. The proposed document based CMS varies from these traditional CMS in architecture, storage and control flow. Source URLs and content markings are indexed and mirrored. The Semantically annotated content are located in the stored websites and matched with the original source websites. It also allows backtracking of data to the original source URL(s) which will also be referred for future use.
{"title":"Tracking and locating source content in a weblog using semantic annotation techniques","authors":"R. Priyadarshini, L. Tamilselvan","doi":"10.1109/ICRTIT.2013.6844238","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844238","url":null,"abstract":"In recent years, the World Wide Web has grown tremendously and become more complex because of the growing number of users and the content being added in varied formats. Web 1.0 suffered from publishing limitations as it requires significant amount of software investments. Web 2.0 has changed this by providing easy to use web tools to enable people to generate content and publish it easily on the web. This resulted in an explosion of web contents and has made relevant information retrieval challenging. This has led to the evolution of semantic web, where the traditional web content is added with semantic repository. There are semantic web based tools being developed and researched to make the information retrieval more efficient. This paper describes a semantic weblog which has the feature of locating the exact source content from the reference URLs. This ideology will be used in the CMS (Content Management System). It's highly possible that the content in CMS will be redundant over the web as most of the time the content will be gathered from already existing websites. Back tracking the source of such content will become obsolete and also changes to the source are difficult to be tracked. The proposed document based CMS varies from these traditional CMS in architecture, storage and control flow. Source URLs and content markings are indexed and mirrored. The Semantically annotated content are located in the stored websites and matched with the original source websites. It also allows backtracking of data to the original source URL(s) which will also be referred for future use.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130074024","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844272
Sarabjeet Singh, M. Yamini
This paper aims at implementing voice based login authentication on Linux systems. Presently face authentication, finger print based authentication are available for Linux systems but there is no proper voice based biometric authentication. In this work, login authentication happens in three stages: Text based password verification, speech verification, speaker verification. The speech verification also encounters the record and replay problem, in which the users' voice can be recorded and replayed at the time of login. This is overcome by generating the random pass-phrase each time the user logs in. This ensures the physical presence of the user while logging in.
{"title":"Voice based login authentication for Linux","authors":"Sarabjeet Singh, M. Yamini","doi":"10.1109/ICRTIT.2013.6844272","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844272","url":null,"abstract":"This paper aims at implementing voice based login authentication on Linux systems. Presently face authentication, finger print based authentication are available for Linux systems but there is no proper voice based biometric authentication. In this work, login authentication happens in three stages: Text based password verification, speech verification, speaker verification. The speech verification also encounters the record and replay problem, in which the users' voice can be recorded and replayed at the time of login. This is overcome by generating the random pass-phrase each time the user logs in. This ensures the physical presence of the user while logging in.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114278555","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844206
Dhananjay Kumar, V. Subbulakshmi
The storage requirement for digital video is growing day-by-day due to increase in video quality. In order to reduce the file size while maintaining the required quality, a novel compression algorithm is needed. In this paper, an Adaptive Rood Pattern Search (ARPS) is used as the Motion Estimation (ME) and Motion Compensation (MC) technique and ARPS is integrated with the proposed Rate Distortion Optimized Transform (RDOT) to reduce the computational complexity without losing the quality of the video. In this ME technique, Mean Absolute Difference (MAD) is considered as the matching criteria. ARPS technique is compared with the Diamond Search (DS) and Three Step Search (TSS) algorithms and it outperforms with respect to execution time and PSNR. Finally the combination of ARPS with RDOT achieves a high compression ratio.
{"title":"Video compression with an effective block matching algorithm and RDOT","authors":"Dhananjay Kumar, V. Subbulakshmi","doi":"10.1109/ICRTIT.2013.6844206","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844206","url":null,"abstract":"The storage requirement for digital video is growing day-by-day due to increase in video quality. In order to reduce the file size while maintaining the required quality, a novel compression algorithm is needed. In this paper, an Adaptive Rood Pattern Search (ARPS) is used as the Motion Estimation (ME) and Motion Compensation (MC) technique and ARPS is integrated with the proposed Rate Distortion Optimized Transform (RDOT) to reduce the computational complexity without losing the quality of the video. In this ME technique, Mean Absolute Difference (MAD) is considered as the matching criteria. ARPS technique is compared with the Diamond Search (DS) and Three Step Search (TSS) algorithms and it outperforms with respect to execution time and PSNR. Finally the combination of ARPS with RDOT achieves a high compression ratio.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121891733","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844290
T. M. A. Teresa, Niyas Ibrahim, K. R. R. Babu
In Infrastructure as a Service cloud computational resources of different clouds within its federation can be used in the form of leases. This may result in tasks getting completed in other clouds that have more computational power or currently have free resources to service the request. In this paper a new task scheduling approach has been considered that not only considers the effective finish time of clouds as parameters similar to list scheduling, but also takes into account the latency of networks involved in the federation. This consideration is due to the fact that the estimated finish time may differ from actual finish time of tasks when there is a communication delay between clouds in the federation. When dependency among tasks are considered it becomes necessary that a dependent task can start execution only if its predecessors have completed. So if the predecessor task has been scheduled in a different cloud the calculation of estimated finish time with communication delay will help in finding the proper cloud to schedule the task. This would not be possible if the communication delay is not considered as a parameter in estimating the finish time of task. By this approach make-span time of an application which is a set of tasks can be considerably reduced. The experimental results show that the proposed method outperforms the existing list scheduling algorithm.
{"title":"Latency aware scheduling policy for tasks in IaaS cloud","authors":"T. M. A. Teresa, Niyas Ibrahim, K. R. R. Babu","doi":"10.1109/ICRTIT.2013.6844290","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844290","url":null,"abstract":"In Infrastructure as a Service cloud computational resources of different clouds within its federation can be used in the form of leases. This may result in tasks getting completed in other clouds that have more computational power or currently have free resources to service the request. In this paper a new task scheduling approach has been considered that not only considers the effective finish time of clouds as parameters similar to list scheduling, but also takes into account the latency of networks involved in the federation. This consideration is due to the fact that the estimated finish time may differ from actual finish time of tasks when there is a communication delay between clouds in the federation. When dependency among tasks are considered it becomes necessary that a dependent task can start execution only if its predecessors have completed. So if the predecessor task has been scheduled in a different cloud the calculation of estimated finish time with communication delay will help in finding the proper cloud to schedule the task. This would not be possible if the communication delay is not considered as a parameter in estimating the finish time of task. By this approach make-span time of an application which is a set of tasks can be considerably reduced. The experimental results show that the proposed method outperforms the existing list scheduling algorithm.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120962691","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844184
S. R. Satheesh, D. Sangeetha, V. Vaidehi
Cloud computing is a key computing platform for sharing resources that includes IaaS, Saas, PaaS and business process. This provides many benefits for the users to create and store health care data on the cloud thereby utilizing fewer resources in the client system. The proposed system mainly focuses on health care data security. To reduce the increase in cost of hospitalization, researchers are building Smart Health care environment where medical data are continuously monitored by health experts. Some of the major imports that still need to be discussed before these devices get a wide acceptance include the security and privacy of medical data collected by these devices. Enhanced RSA is a technique which uses random integer as an additional technique in traditional RSA. Enhanced RSA based storage security method uses encryption and decryption technique of the remote data by improving existing RSA based encryption and decryption. The encrypted data will be stored in the cloud using provable data possession scheme. To improve the privacy and security, the primal based privacy technique is used in securing the health care data. The proposed technique provides better security. Using this proposed method, the correctness of health care data is assured and identification of file block existence in the cloud is performed. This method also supports insertion, modification and deletion of the data and tries to reduce the calculation time of the server. The attacks are made with encrypted data and the results shows that the proposed scheme outperforms with improved security in data storage when compared to the existing methods.
{"title":"EPSSHIC-enabling privacy and security of smart health care system in cloud","authors":"S. R. Satheesh, D. Sangeetha, V. Vaidehi","doi":"10.1109/ICRTIT.2013.6844184","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844184","url":null,"abstract":"Cloud computing is a key computing platform for sharing resources that includes IaaS, Saas, PaaS and business process. This provides many benefits for the users to create and store health care data on the cloud thereby utilizing fewer resources in the client system. The proposed system mainly focuses on health care data security. To reduce the increase in cost of hospitalization, researchers are building Smart Health care environment where medical data are continuously monitored by health experts. Some of the major imports that still need to be discussed before these devices get a wide acceptance include the security and privacy of medical data collected by these devices. Enhanced RSA is a technique which uses random integer as an additional technique in traditional RSA. Enhanced RSA based storage security method uses encryption and decryption technique of the remote data by improving existing RSA based encryption and decryption. The encrypted data will be stored in the cloud using provable data possession scheme. To improve the privacy and security, the primal based privacy technique is used in securing the health care data. The proposed technique provides better security. Using this proposed method, the correctness of health care data is assured and identification of file block existence in the cloud is performed. This method also supports insertion, modification and deletion of the data and tries to reduce the calculation time of the server. The attacks are made with encrypted data and the results shows that the proposed scheme outperforms with improved security in data storage when compared to the existing methods.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129439461","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844277
S. Dhivya, D. Dhakchianandan, A. Gowtham, P. Sujatha, A. Kannan
In today's web-enabled world, the communications happening over the network is intensifying at a capacious rate. Not all communications are credible and malpractice can arise anywhere, anytime. If the normal traffic is slightly modified to delude the intrusion detection system, then the traditional systems might not be able to discern the same effectively. Thus, a system that could detect and ferret out the novel attacks has been proposed. Since any number of users can use a web page, maintaining the availability of the resources and allocating them to the active users as per their need is very essential. The multi-thread concept is used to share the resources that each client can use. Attribute Selection Algorithm is used as the feature extraction algorithm in weka, to yield those relevant features pertaining to the user's request and helps in achieving a more accurate result. Memory efficiency is brought in with the cascading binary search tree. The patterns are efficiently stored and hence the search for the presence of an attack is accomplished effectively. An Intrusion Detection System which is memory efficient and effective enough in detecting attacks and reducing the false positives is thus proposed.
{"title":"Memory efficacious pattern matching intrusion detection system","authors":"S. Dhivya, D. Dhakchianandan, A. Gowtham, P. Sujatha, A. Kannan","doi":"10.1109/ICRTIT.2013.6844277","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844277","url":null,"abstract":"In today's web-enabled world, the communications happening over the network is intensifying at a capacious rate. Not all communications are credible and malpractice can arise anywhere, anytime. If the normal traffic is slightly modified to delude the intrusion detection system, then the traditional systems might not be able to discern the same effectively. Thus, a system that could detect and ferret out the novel attacks has been proposed. Since any number of users can use a web page, maintaining the availability of the resources and allocating them to the active users as per their need is very essential. The multi-thread concept is used to share the resources that each client can use. Attribute Selection Algorithm is used as the feature extraction algorithm in weka, to yield those relevant features pertaining to the user's request and helps in achieving a more accurate result. Memory efficiency is brought in with the cascading binary search tree. The patterns are efficiently stored and hence the search for the presence of an attack is accomplished effectively. An Intrusion Detection System which is memory efficient and effective enough in detecting attacks and reducing the false positives is thus proposed.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122474729","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844283
Dhananjay Kumar, S. Srinivas, L. Raj, P. Hariharan, R. A. Kumar
Video streaming over the internet without buffering is a challenging task. The requirements in this field actually include an almost lossless compression of video to be provided to the customer with a minimum bandwidth. In order to maintain a continuous flow of video without any disconnection or large buffering at the receiver, a new algorithm called the Multi-Layered Resolution based Coding with Cross Layer Adaptation (MLRC-CLA) algorithm is proposed in this paper. The input video is coded at different levels of resolution and stored at the video hosting site. The MLRC-CLA algorithm gradually selects the appropriate resolution for the viewer based on the viewer's network bandwidth and sends that particular resolution the viewer. The parameter used in this paper is Peek-Signal to Noise ratio (PSNR).
{"title":"Multilayered resolution based coding for Internet video streaming","authors":"Dhananjay Kumar, S. Srinivas, L. Raj, P. Hariharan, R. A. Kumar","doi":"10.1109/ICRTIT.2013.6844283","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844283","url":null,"abstract":"Video streaming over the internet without buffering is a challenging task. The requirements in this field actually include an almost lossless compression of video to be provided to the customer with a minimum bandwidth. In order to maintain a continuous flow of video without any disconnection or large buffering at the receiver, a new algorithm called the Multi-Layered Resolution based Coding with Cross Layer Adaptation (MLRC-CLA) algorithm is proposed in this paper. The input video is coded at different levels of resolution and stored at the video hosting site. The MLRC-CLA algorithm gradually selects the appropriate resolution for the viewer based on the viewer's network bandwidth and sends that particular resolution the viewer. The parameter used in this paper is Peek-Signal to Noise ratio (PSNR).","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127843754","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844220
M. Sumalatha, C. Selvakumar, G. Rathnam
Enormous amount of data are being stored and transferred between various heterogeneous databases across the globe. Data stored in the databases are vulnerable to threats and attacks. Data loss during transmission and corruption are also inevitable. In order to provide a sustainable storage environment handling such limitations, systems should be reliable and fault tolerant. In this research work, an innovative mechanism which provides secure data storage with recovery mechanisms during faults is developed. Distributed data storage security is rendered by data partitioning technique and the failed processes are handled by self diagnosis and recovery oriented computing provides error tolerance. The experimental analysis shows that this method gives improved security when compared with existing system.
{"title":"Secured data storage and error tolerant design in cloud computing","authors":"M. Sumalatha, C. Selvakumar, G. Rathnam","doi":"10.1109/ICRTIT.2013.6844220","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844220","url":null,"abstract":"Enormous amount of data are being stored and transferred between various heterogeneous databases across the globe. Data stored in the databases are vulnerable to threats and attacks. Data loss during transmission and corruption are also inevitable. In order to provide a sustainable storage environment handling such limitations, systems should be reliable and fault tolerant. In this research work, an innovative mechanism which provides secure data storage with recovery mechanisms during faults is developed. Distributed data storage security is rendered by data partitioning technique and the failed processes are handled by self diagnosis and recovery oriented computing provides error tolerance. The experimental analysis shows that this method gives improved security when compared with existing system.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121209823","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 : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844279
M. Harini, K. Bhairavi, R. Gopicharan, K. Ganapathy, V. Vaidehi
Web enablement of sensors is found to improve healthcare applications. However usage of too many physical sensors are limiting the mobility of the patients and has serious drawbacks like huge power consumption, heavy weight, health hazards and high degree of discomfort. To overcome these problems, this paper proposed a virtual sensor that computes the blood pressure of patients using a limited number of physical sensors. The sensor data are ported to cloud for achieving scalability, elasticity, on-demand service provision and availability. The developed virtual sensor has shown an accuracy of about 95% when tested on patients with normal vital sign parameters.
{"title":"Virtualization of healthcare sensors in cloud","authors":"M. Harini, K. Bhairavi, R. Gopicharan, K. Ganapathy, V. Vaidehi","doi":"10.1109/ICRTIT.2013.6844279","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844279","url":null,"abstract":"Web enablement of sensors is found to improve healthcare applications. However usage of too many physical sensors are limiting the mobility of the patients and has serious drawbacks like huge power consumption, heavy weight, health hazards and high degree of discomfort. To overcome these problems, this paper proposed a virtual sensor that computes the blood pressure of patients using a limited number of physical sensors. The sensor data are ported to cloud for achieving scalability, elasticity, on-demand service provision and availability. The developed virtual sensor has shown an accuracy of about 95% when tested on patients with normal vital sign parameters.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121359626","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
扫码关注我们
求助内容：
应助结果提醒方式：