With introduction of online transaction the fraudulent activities through World Wide Web have increased rapidly. It's not only affecting common people but also making them lose huge amount of money. Online transaction basically takes place between merchant and customer, and in this case neither customer nor the card needs to be present at the time of transaction so merchant does not know that whether the customer in the other end is an authorized person or fraudster, so it may lead to an unusual transaction. This kind of online transaction can be easily done using stolen credit card information of a cardholder. To detect status of the current transaction it is imperative to analyze all the previous transactions made by a genuine card holder to know the kind of pattern he/she uses. Based on these patterns new transaction can be categorized as either fraud or legal. There are few data mining techniques which help us to detect a certain pattern on complex and large data sets. In this paper it is proposed to compare Decision Tree, Multi-Layer Perceptron (MLP) and Chebyshev functional link artificial neural network (CFLANN) in terms of their classification accuracy and elapsed time for credit card fraud detection.
{"title":"A Comparative Study of Chebyshev Functional Link Artificial Neural Network, Multi-layer Perceptron and Decision Tree for Credit Card Fraud Detection","authors":"M. Mishra, Rajashree Dash","doi":"10.1109/ICIT.2014.25","DOIUrl":"https://doi.org/10.1109/ICIT.2014.25","url":null,"abstract":"With introduction of online transaction the fraudulent activities through World Wide Web have increased rapidly. It's not only affecting common people but also making them lose huge amount of money. Online transaction basically takes place between merchant and customer, and in this case neither customer nor the card needs to be present at the time of transaction so merchant does not know that whether the customer in the other end is an authorized person or fraudster, so it may lead to an unusual transaction. This kind of online transaction can be easily done using stolen credit card information of a cardholder. To detect status of the current transaction it is imperative to analyze all the previous transactions made by a genuine card holder to know the kind of pattern he/she uses. Based on these patterns new transaction can be categorized as either fraud or legal. There are few data mining techniques which help us to detect a certain pattern on complex and large data sets. In this paper it is proposed to compare Decision Tree, Multi-Layer Perceptron (MLP) and Chebyshev functional link artificial neural network (CFLANN) in terms of their classification accuracy and elapsed time for credit card fraud detection.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"67 1","pages":"228-233"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82551345","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}
The rapid growth of elderly population is a global concern and a burden on healthcare services as special health challenges appear for this segment of the population. An innovative way of patient monitoring is possible due to the recent advancements in electronics that have emerged with a number of devices which can provide continuous, real time remote healthcare monitoring to the patients even if they are freely moving around and not in hospital beds. The constant miniaturization of these electronic devices has made it possible to wear these sensors either on the clothing or body or even implanted inside the body. An unprecedented growth of smart phones and Internet technology all over the world would be a boon in this area. The recorded information, sent by these wearable sensors can be collected locally using some PDA or mobile phone. These collected medical data values may be analyzed in brief against the stored threshold values using an app on the mobile phone in real time. Collective Information may be transmitted to a centralized server periodically or immediately in case of emergency medical response required in life critical situations. The submitted medical information is used for clinical diagnosis & experts' advice and long term storage in healthcare database for future references. In this paper we discuss architecture of the Healthcare System and asses the security issues and privacy concerns while collecting patient medical data from sensors to mobile device and further submitting this data to the centralized server. The security and privacy protection of sensitive and private patient medical data is a major unsolved concern and a break into the system is possible. We also discuss the other challenges in the implementation of WBAN and provide a conclusion.
{"title":"Security Issues and Privacy Concerns in the Implementation of Wireless Body Area Network","authors":"Manoj Kumar","doi":"10.1109/ICIT.2014.73","DOIUrl":"https://doi.org/10.1109/ICIT.2014.73","url":null,"abstract":"The rapid growth of elderly population is a global concern and a burden on healthcare services as special health challenges appear for this segment of the population. An innovative way of patient monitoring is possible due to the recent advancements in electronics that have emerged with a number of devices which can provide continuous, real time remote healthcare monitoring to the patients even if they are freely moving around and not in hospital beds. The constant miniaturization of these electronic devices has made it possible to wear these sensors either on the clothing or body or even implanted inside the body. An unprecedented growth of smart phones and Internet technology all over the world would be a boon in this area. The recorded information, sent by these wearable sensors can be collected locally using some PDA or mobile phone. These collected medical data values may be analyzed in brief against the stored threshold values using an app on the mobile phone in real time. Collective Information may be transmitted to a centralized server periodically or immediately in case of emergency medical response required in life critical situations. The submitted medical information is used for clinical diagnosis & experts' advice and long term storage in healthcare database for future references. In this paper we discuss architecture of the Healthcare System and asses the security issues and privacy concerns while collecting patient medical data from sensors to mobile device and further submitting this data to the centralized server. The security and privacy protection of sensitive and private patient medical data is a major unsolved concern and a break into the system is possible. We also discuss the other challenges in the implementation of WBAN and provide a conclusion.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"123 1","pages":"58-62"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89267370","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}
A hybrid technique for fault distance estimation in a distribution line with wind farm is presented in this paper. Here, one cycle of post fault current samples are taken for fault location from the distributed generation end. The collected samples are then decomposed by wavelet transform and thereafter six statistical features are extracted from the reconstructed detail coefficients of the current signal. Further best features are selected from the total feature set by forward feature selection method. These selected features are then fed as input to the artificial neural network for fault location. In the proposed method, the simulation conditions for the test pattern are completely different from the train one in order to make it robust. Simulation result shows that the proposed hybrid fault location method gives high accuracy for the distribution system.
{"title":"Artificial Intelligence Based Fault Location in a Distribution System","authors":"P. Ray, D. Mishra","doi":"10.1109/ICIT.2014.10","DOIUrl":"https://doi.org/10.1109/ICIT.2014.10","url":null,"abstract":"A hybrid technique for fault distance estimation in a distribution line with wind farm is presented in this paper. Here, one cycle of post fault current samples are taken for fault location from the distributed generation end. The collected samples are then decomposed by wavelet transform and thereafter six statistical features are extracted from the reconstructed detail coefficients of the current signal. Further best features are selected from the total feature set by forward feature selection method. These selected features are then fed as input to the artificial neural network for fault location. In the proposed method, the simulation conditions for the test pattern are completely different from the train one in order to make it robust. Simulation result shows that the proposed hybrid fault location method gives high accuracy for the distribution system.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"73 1","pages":"18-23"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86404467","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}
This paper presents a novel exploration process of an optimal fault tolerant data path based on user specified power and delay budget during high level synthesis (HLS) that is capable of masking error occurred through single and multi cycle transient faults. The exploration framework is driven through bio-mimicking of E. Coli bacterium lifecycle. The major novelties of this approach are as follows: a) novel multi-cycle fault tolerant algorithm, b) novel design space exploration (DSE) approach that combines proposed fault tolerant algorithm along with user specified conflicting power-delay constraint that guides this intractable search problem to reach an optimal solution, c) novel double modular redundant (DMR) system with equivalent circuit scheme that performs the equivalent function of extracting the correct output as conventionally done using the concept of triple modular redundant (TMR) and voter. Results indicated an average improvement in quality of results (QoR) of >24% and reduction in hardware usage of > 57 % were obtained compared to a recent similar approach.
{"title":"Error Masking of Transient Faults: Exploration of a Fault Tolerant Datapath Based on User Specified Power and Delay Budget","authors":"A. Sengupta, Saumya Bhadauria","doi":"10.1109/ICIT.2014.15","DOIUrl":"https://doi.org/10.1109/ICIT.2014.15","url":null,"abstract":"This paper presents a novel exploration process of an optimal fault tolerant data path based on user specified power and delay budget during high level synthesis (HLS) that is capable of masking error occurred through single and multi cycle transient faults. The exploration framework is driven through bio-mimicking of E. Coli bacterium lifecycle. The major novelties of this approach are as follows: a) novel multi-cycle fault tolerant algorithm, b) novel design space exploration (DSE) approach that combines proposed fault tolerant algorithm along with user specified conflicting power-delay constraint that guides this intractable search problem to reach an optimal solution, c) novel double modular redundant (DMR) system with equivalent circuit scheme that performs the equivalent function of extracting the correct output as conventionally done using the concept of triple modular redundant (TMR) and voter. Results indicated an average improvement in quality of results (QoR) of >24% and reduction in hardware usage of > 57 % were obtained compared to a recent similar approach.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"60 1","pages":"345-350"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88255548","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}
Subhas Barman, Samiran Chattopadhyay, D. Samanta, Sujoy Bag, G. Show
Fingerprint matching is the main module of fingerprint-based person authentication system. Accuracy of fingerprint matching is an important objective of this type authentication system. Multiple features are used for better matching accuracy but more features add more computational complexity as well as time and space complexity. In this paper, we proposed an approach of fingerprint based authentication system where fingerprint matching is carried out using spacial information (distance) of minutiae points only. This approach is simple and it needs very small space to store templates. We have used an indexing technique to speed up the matching process. In our experiment, we have used FVC2004 fingerprint data-set as input data and investigated the false non-match ratio and false matching ratio for DB2, DB3 and DB4 also.
{"title":"An Efficient Fingerprint Matching Approach Based on Minutiae to Minutiae Distance Using Indexing with Effectively Lower Time Complexity","authors":"Subhas Barman, Samiran Chattopadhyay, D. Samanta, Sujoy Bag, G. Show","doi":"10.1109/ICIT.2014.46","DOIUrl":"https://doi.org/10.1109/ICIT.2014.46","url":null,"abstract":"Fingerprint matching is the main module of fingerprint-based person authentication system. Accuracy of fingerprint matching is an important objective of this type authentication system. Multiple features are used for better matching accuracy but more features add more computational complexity as well as time and space complexity. In this paper, we proposed an approach of fingerprint based authentication system where fingerprint matching is carried out using spacial information (distance) of minutiae points only. This approach is simple and it needs very small space to store templates. We have used an indexing technique to speed up the matching process. In our experiment, we have used FVC2004 fingerprint data-set as input data and investigated the false non-match ratio and false matching ratio for DB2, DB3 and DB4 also.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"31 1","pages":"179-183"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88323431","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}
Depression a latest epidemic of modern era has always drawn the attention of researcher's to find & evaluate the level, causes & prevention. According to psychiatrists it's not a psychological disorder but it creates the stimulation & simulation of co-ordination failure. The worst case of the leading depression level may contemplates a person to attempt suicide, loss of energy, insomnia etc. This epidemic causes severe personal and public health challenges. Each year thousands of millions of people are suffering from depression and a few receives adequate treatment. Keeping view at the trend of predicting, this paper has been proposed & tried to find out the persons affected by depression and their level of illness. The work is self motivated. Here the concept of apriori algorithm & association rule mining is used in order to extract the information from a large collection of database of concerned persons.
{"title":"A Model for Prediction of Human Depression Using Apriori Algorithm","authors":"L. Jena, N. K. Kamila","doi":"10.1109/ICIT.2014.65","DOIUrl":"https://doi.org/10.1109/ICIT.2014.65","url":null,"abstract":"Depression a latest epidemic of modern era has always drawn the attention of researcher's to find & evaluate the level, causes & prevention. According to psychiatrists it's not a psychological disorder but it creates the stimulation & simulation of co-ordination failure. The worst case of the leading depression level may contemplates a person to attempt suicide, loss of energy, insomnia etc. This epidemic causes severe personal and public health challenges. Each year thousands of millions of people are suffering from depression and a few receives adequate treatment. Keeping view at the trend of predicting, this paper has been proposed & tried to find out the persons affected by depression and their level of illness. The work is self motivated. Here the concept of apriori algorithm & association rule mining is used in order to extract the information from a large collection of database of concerned persons.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"27 1","pages":"240-244"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90735571","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}
In wireless networks, secure authentication protocol should enable a legitimate roaming user to get roaming services from foreign server when he/she is away from home domain. However, a basic authentication protocol requires participation of home server, foreign server and roaming user during the authentication between roaming user and foreign server. Recently, two-party based anonymous authentication protocols have been proposed, which does not require home server's participation, to protect identity, location and route information of the roaming users. But, the available anonymous authentication protocols are not efficient due to the shortcomings in security and high computational cost. This paper addresses those problems and proposes a novel two-party based anonymous authentication protocol for the roaming users, named PAPAR. PAPAR uses pairing-based cryptography to secure and to provide computationally efficient authentication. Further, PAPAR uses pseudo identities to ensure user anonymity. Moreover, PAPAR efficiently mitigates the effect of DoS (Denial of Service) attack by using light computational operations, such as Message Authentication Code. Comparison and experimental results show that PAPAR outperforms the existing works in terms of security and computational cost.
{"title":"PAPAR: Pairing Based Authentication Protocol with Anonymous Roaming for Wireless Mesh Networks","authors":"Nazatul Haque Sultan, N. Sarma","doi":"10.1109/ICIT.2014.36","DOIUrl":"https://doi.org/10.1109/ICIT.2014.36","url":null,"abstract":"In wireless networks, secure authentication protocol should enable a legitimate roaming user to get roaming services from foreign server when he/she is away from home domain. However, a basic authentication protocol requires participation of home server, foreign server and roaming user during the authentication between roaming user and foreign server. Recently, two-party based anonymous authentication protocols have been proposed, which does not require home server's participation, to protect identity, location and route information of the roaming users. But, the available anonymous authentication protocols are not efficient due to the shortcomings in security and high computational cost. This paper addresses those problems and proposes a novel two-party based anonymous authentication protocol for the roaming users, named PAPAR. PAPAR uses pairing-based cryptography to secure and to provide computationally efficient authentication. Further, PAPAR uses pseudo identities to ensure user anonymity. Moreover, PAPAR efficiently mitigates the effect of DoS (Denial of Service) attack by using light computational operations, such as Message Authentication Code. Comparison and experimental results show that PAPAR outperforms the existing works in terms of security and computational cost.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"26 1","pages":"155-160"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87931333","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}
Optical Burst Switching (OBS) is considered as an efficient switching paradigm for building the next generation optical Internet. This review has been motivated by the need for techniques that are capable of supporting the future bandwidth requirement of next-generation applications and services of Internet Protocol (IP) networks. The authors have discussed the basic concepts of OBS paradigm and outlined the signaling and scheduling issues related to OBS networks. Further, a brief summary on the issues that are essential for provisioning Quality-of-Service (QoS) in OBS networks has been outlined. Finally, an analytical model is presented to provide Burst Loss Probability (BLP) guarantees between every pair of source-destination nodes in the network.
{"title":"A Review of Optical Burst Switching in Wavelength Division Multiplexing Networks","authors":"Ravi Sankar Barpanda, A. K. Turuk, B. Sahoo","doi":"10.1109/ICIT.2014.50","DOIUrl":"https://doi.org/10.1109/ICIT.2014.50","url":null,"abstract":"Optical Burst Switching (OBS) is considered as an efficient switching paradigm for building the next generation optical Internet. This review has been motivated by the need for techniques that are capable of supporting the future bandwidth requirement of next-generation applications and services of Internet Protocol (IP) networks. The authors have discussed the basic concepts of OBS paradigm and outlined the signaling and scheduling issues related to OBS networks. Further, a brief summary on the issues that are essential for provisioning Quality-of-Service (QoS) in OBS networks has been outlined. Finally, an analytical model is presented to provide Burst Loss Probability (BLP) guarantees between every pair of source-destination nodes in the network.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"39 1","pages":"142-147"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87002164","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}
In recent years, Cloud computing has been receiving great attention from various business and research organizations as it promises to provide large storage facilities and highly managed remote services. Due to its characteristics like on-demand self service, rapid elasticity, ubiquitous network access and resource pooling, it shows high potential for providing e-Healthcare solutions. It can offer various financial and functional benefits to e-Healthcare which includes providing storage flexibility for the rapidly growing healthcare data, reduced cost, better accessibility, improved quality of care and enhancement in medical research. However at the same time, it faces many technical challenges like privacy, reliability, security etc. In the Cloud based ehealthcare environment where the patient's data is transferred between entities, maintaining the security of data becomes a priority. Cryptographic techniques can only provide a secure channel of communication but it fails to provide security at end points. Security attacks may be accomplished by the malicious insider at the end points. A malicious insider may modify the patient's data resulting in a false examination. The paper provides a detective approach for such attacks in the healthcare organizations. Our work is focused with the detection of insider attacks for preventing false examination of patient's health records and assuring the accountability of data usage. Watermarking can be used for detection of modification by an insider attack but does not provide accountability of data usage. Hence our approach combines the functionalities of cryptographic techniques and watermarking together with an accountability framework for providing transparency of patient's data usage.
{"title":"Detection of Insider Attacks in Cloud Based e-Healthcare Environment","authors":"Gaurav Garkoti, S. K. Peddoju, B. Raman","doi":"10.1109/ICIT.2014.43","DOIUrl":"https://doi.org/10.1109/ICIT.2014.43","url":null,"abstract":"In recent years, Cloud computing has been receiving great attention from various business and research organizations as it promises to provide large storage facilities and highly managed remote services. Due to its characteristics like on-demand self service, rapid elasticity, ubiquitous network access and resource pooling, it shows high potential for providing e-Healthcare solutions. It can offer various financial and functional benefits to e-Healthcare which includes providing storage flexibility for the rapidly growing healthcare data, reduced cost, better accessibility, improved quality of care and enhancement in medical research. However at the same time, it faces many technical challenges like privacy, reliability, security etc. In the Cloud based ehealthcare environment where the patient's data is transferred between entities, maintaining the security of data becomes a priority. Cryptographic techniques can only provide a secure channel of communication but it fails to provide security at end points. Security attacks may be accomplished by the malicious insider at the end points. A malicious insider may modify the patient's data resulting in a false examination. The paper provides a detective approach for such attacks in the healthcare organizations. Our work is focused with the detection of insider attacks for preventing false examination of patient's health records and assuring the accountability of data usage. Watermarking can be used for detection of modification by an insider attack but does not provide accountability of data usage. Hence our approach combines the functionalities of cryptographic techniques and watermarking together with an accountability framework for providing transparency of patient's data usage.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"98 1","pages":"195-200"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85773241","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}
Energy saving is extremely important in portable and hand-held devices like laptop and mobile phones. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery life. One promising technique that provides the best of both low-power and high-performance processors in the real time systems is Dynamic Voltage and Frequency Scaling (DVS). In this paper, we are working on the problem of power optimization for periodic independent real-time tasks that are scheduled over multiprocessors. Theoretically, Real Time tasks are specified with Worst Case Execution Time (WCET). During the operation of the system, the Actual Execution Time (AET) of a task could be a lot smaller than its WCET. We present an Adaptive real time DVS algorithm (Art-DVS) based on AET of tasks. It adapts two state-of-the-art scheduling algorithms Pre-DVS and Post-DVS. Simulation results show that the proposed Art-DVS algorithm performs satisfactorily on energy consumption in comparison to the previous approaches.
{"title":"RT-DVS for Power Optimization in Multiprocessor Real-Time Systems","authors":"B. Naik, Shirshendu Das, H. Kapoor","doi":"10.1109/ICIT.2014.59","DOIUrl":"https://doi.org/10.1109/ICIT.2014.59","url":null,"abstract":"Energy saving is extremely important in portable and hand-held devices like laptop and mobile phones. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery life. One promising technique that provides the best of both low-power and high-performance processors in the real time systems is Dynamic Voltage and Frequency Scaling (DVS). In this paper, we are working on the problem of power optimization for periodic independent real-time tasks that are scheduled over multiprocessors. Theoretically, Real Time tasks are specified with Worst Case Execution Time (WCET). During the operation of the system, the Actual Execution Time (AET) of a task could be a lot smaller than its WCET. We present an Adaptive real time DVS algorithm (Art-DVS) based on AET of tasks. It adapts two state-of-the-art scheduling algorithms Pre-DVS and Post-DVS. Simulation results show that the proposed Art-DVS algorithm performs satisfactorily on energy consumption in comparison to the previous approaches.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"7 1","pages":"24-29"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75853377","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
扫码关注我们
求助内容：
应助结果提醒方式：