In recent years, several random key pre-distribution schemes have been proposed for wireless sensor networks. However, the problem of key and node revocation has received fewer attentions. In this paper, we present a novel random key revocation protocol, which is suitable for large scale networks and removes compromised information efficiently. The proposed revocation protocol can guarantee network security and has less memory consumption and communication overhead. With the combination of centralized and distributed revocations, the protocol achieves both timeliness and accuracy for revocation. The simulation results show that our protocol has better performance than existing protocols in terms of increasing revocation validity and revocation velocity, and prolonging the network lifetime.
{"title":"A New Efficient Random Key Revocation Protocol for Wireless Sensor Networks","authors":"Yi Jiang, Ruonan Zhang, Xiaojiang Du","doi":"10.1109/PDCAT.2013.43","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.43","url":null,"abstract":"In recent years, several random key pre-distribution schemes have been proposed for wireless sensor networks. However, the problem of key and node revocation has received fewer attentions. In this paper, we present a novel random key revocation protocol, which is suitable for large scale networks and removes compromised information efficiently. The proposed revocation protocol can guarantee network security and has less memory consumption and communication overhead. With the combination of centralized and distributed revocations, the protocol achieves both timeliness and accuracy for revocation. The simulation results show that our protocol has better performance than existing protocols in terms of increasing revocation validity and revocation velocity, and prolonging the network lifetime.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129825726","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}
With the widespread use of multi-core processors, task scheduling for multi-core processors has become a hot issue. Many researches have been done on task scheduling from various perspectives. However, the existing task scheduling algorithms still have some drawbacks, such as low processor utilization rate, high complexity, and so on. This paper presents a task scheduling algorithm for multi-core processors, which is based on priority queue and task duplication. In the proposed algorithm, the Directed A cyclic Graph (DAG) is used to build a task model. Based on the model, task critical degree, task reminder, task execution time and the average communication time are all considered as the priority metrics. A priority based task dispatching list is set up by comprehensive analysis and calculating the priority for each task. Then interval insertion and task duplication strategies are employed to map tasks to processors, which can decrease the communication cost, improve the processor utilization rate and shorten the schedule length. Our experiments show that the proposed algorithm has better performance and lower complexity than the existing scheduling algorithms.
{"title":"A Task Scheduling Algorithm for Multi-core Processors","authors":"Xuanxia Yao, P. Geng, Xiaojiang Du","doi":"10.1109/PDCAT.2013.47","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.47","url":null,"abstract":"With the widespread use of multi-core processors, task scheduling for multi-core processors has become a hot issue. Many researches have been done on task scheduling from various perspectives. However, the existing task scheduling algorithms still have some drawbacks, such as low processor utilization rate, high complexity, and so on. This paper presents a task scheduling algorithm for multi-core processors, which is based on priority queue and task duplication. In the proposed algorithm, the Directed A cyclic Graph (DAG) is used to build a task model. Based on the model, task critical degree, task reminder, task execution time and the average communication time are all considered as the priority metrics. A priority based task dispatching list is set up by comprehensive analysis and calculating the priority for each task. Then interval insertion and task duplication strategies are employed to map tasks to processors, which can decrease the communication cost, improve the processor utilization rate and shorten the schedule length. Our experiments show that the proposed algorithm has better performance and lower complexity than the existing scheduling algorithms.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131586358","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}
Railway dangerous goods tracing is a typical application of the sensor network. Application correlation among the sensor, carriage and train is a graph relationship which can be described by using RDF frameworks. It requires data management system to manage a large scale of ever-increasing RDF data, and support semantic access for monitoring the safety state of the environment inside the carriage. For these problems, this paper proposes RDF data query and management method based on HBase and structure index, and optimization method of query engine. The method is enforced by rewriting SPARQL statements according of correlation degree between them, and at querying time, "structure-level" index is used to identify the groups of RDF data, then the "data-level" data matching utilizes the proposed scalable storage mechanism based on hash-oriented multiple table partition of data entity class. As shown in our experiments, our approach can effectively reduce the semantic query time, enhance storage scalability and effective support multi-criteria query of sensor data.
{"title":"RDF Data Query and Management Method Based on HBase and Structure Index in Railway Sensor Application","authors":"Menglun Yang, Baopeng Zhang, Yidong Li","doi":"10.1109/PDCAT.2013.13","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.13","url":null,"abstract":"Railway dangerous goods tracing is a typical application of the sensor network. Application correlation among the sensor, carriage and train is a graph relationship which can be described by using RDF frameworks. It requires data management system to manage a large scale of ever-increasing RDF data, and support semantic access for monitoring the safety state of the environment inside the carriage. For these problems, this paper proposes RDF data query and management method based on HBase and structure index, and optimization method of query engine. The method is enforced by rewriting SPARQL statements according of correlation degree between them, and at querying time, \"structure-level\" index is used to identify the groups of RDF data, then the \"data-level\" data matching utilizes the proposed scalable storage mechanism based on hash-oriented multiple table partition of data entity class. As shown in our experiments, our approach can effectively reduce the semantic query time, enhance storage scalability and effective support multi-criteria query of sensor data.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126895701","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 this paper, we describe an efficient projective rectification method that can be applied to trinocular rectification to improve the visual appearance of stereo vision. This method expends the matrix-based correcting homographic approach which has been proposed recently. In order to implement trinocular rectification, firstly, we obtain triplet images from the target objects through three cameras. The triplet images can be treated as two pairs and the homographies can project different image planes onto new planes. As a result, the rectification becomes the problems of seeking the common plane, and applying transformation or homography to images. Finally, through the proposed solution the trinocular rectification is accomplished. At the same time, Distortion reduction makes the rectified images more realistic.
{"title":"An Efficient Projective Rectification for Trinocular Stereo Vision","authors":"Qing Zhu, Dan Luo","doi":"10.1109/PDCAT.2013.34","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.34","url":null,"abstract":"In this paper, we describe an efficient projective rectification method that can be applied to trinocular rectification to improve the visual appearance of stereo vision. This method expends the matrix-based correcting homographic approach which has been proposed recently. In order to implement trinocular rectification, firstly, we obtain triplet images from the target objects through three cameras. The triplet images can be treated as two pairs and the homographies can project different image planes onto new planes. As a result, the rectification becomes the problems of seeking the common plane, and applying transformation or homography to images. Finally, through the proposed solution the trinocular rectification is accomplished. At the same time, Distortion reduction makes the rectified images more realistic.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121862789","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}
C. R. Valêncio, Andrielson Ferreira Da Silva, D. Guimaraes, A. Cansian, M. L. Tronco, A. R. Pinto
The increase in the demand for computing resources with scalable infrastructure and easily managed has stimulated the emergence of IaaS - Infrastructure-as-a-Service - providers in public clouds, as well as the creation of open source IaaS solutions for institutions that prefer to implant their own private cloud. Aiming at expanding the cost-benefit, it is often necessary to integrate public and private cloud services. However, the wide variety of interfaces for communication with the services provided by each solution may impair the management of these clouds by the current environment management tool. In this context, is proposed a management tool for private and hybrid clouds, referred to as GBD IaaS Manager, which offers as original contribution, support for migration of virtual elements to these environments, allowing for a better utilization of computing resources and the load balancing among private and hybrid clouds.
{"title":"GBD IAAS Manager: A Tool for Managing Infrastructure-as-a-Service for Private and Hybrid Clouds","authors":"C. R. Valêncio, Andrielson Ferreira Da Silva, D. Guimaraes, A. Cansian, M. L. Tronco, A. R. Pinto","doi":"10.1109/PDCAT.2013.39","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.39","url":null,"abstract":"The increase in the demand for computing resources with scalable infrastructure and easily managed has stimulated the emergence of IaaS - Infrastructure-as-a-Service - providers in public clouds, as well as the creation of open source IaaS solutions for institutions that prefer to implant their own private cloud. Aiming at expanding the cost-benefit, it is often necessary to integrate public and private cloud services. However, the wide variety of interfaces for communication with the services provided by each solution may impair the management of these clouds by the current environment management tool. In this context, is proposed a management tool for private and hybrid clouds, referred to as GBD IaaS Manager, which offers as original contribution, support for migration of virtual elements to these environments, allowing for a better utilization of computing resources and the load balancing among private and hybrid clouds.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133689746","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}
Chao-Tung Yang, Jung-Chun Liu, Wen-Hung Hsu, Hsin-Wen Lu, W. Chu
Currently, most health care systems used among divisions in medical centers still adopt the Excel file format for a variety of scales statistics, such as the clinical self-care ability scale for Functional Independence Measure. Although people can further analyze Excel files using other statistical analysis software, such as SAS, SPSS, and STATA, they cannot effectively share the archived data in Excel among divisions. We propose to do format conversion on these data and store them in a database. As the collection of Excel files cannot be shared with ease, we plan to use HBase, a non-relational database, to further integrate data. The purpose of this paper is to construct complete import tools and solutions based on HBase to facilitate easy access of data in HBase. Besides, a visual interface is also used to manage HBase to implement user friendly client connection tools for the HBase database.
{"title":"Implementation of Data Transform Method into NoSQL Database for Healthcare Data","authors":"Chao-Tung Yang, Jung-Chun Liu, Wen-Hung Hsu, Hsin-Wen Lu, W. Chu","doi":"10.1109/PDCAT.2013.38","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.38","url":null,"abstract":"Currently, most health care systems used among divisions in medical centers still adopt the Excel file format for a variety of scales statistics, such as the clinical self-care ability scale for Functional Independence Measure. Although people can further analyze Excel files using other statistical analysis software, such as SAS, SPSS, and STATA, they cannot effectively share the archived data in Excel among divisions. We propose to do format conversion on these data and store them in a database. As the collection of Excel files cannot be shared with ease, we plan to use HBase, a non-relational database, to further integrate data. The purpose of this paper is to construct complete import tools and solutions based on HBase to facilitate easy access of data in HBase. Besides, a visual interface is also used to manage HBase to implement user friendly client connection tools for the HBase database.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133375371","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 this paper, a Discrete Wavelet Transform (DWT) based perfect secure and high capacity image steganography method is presented. This method is used for steganography of the pictorial messages in a cover image (carrier data). First, the message data and the cover image data are transformed using Haar filters based DWT, and then, the message DWT coefficients are embedded to the cover image DWT coefficients. Therefore, some DWT based different message data embedding approaches are studied. The robustness and image brightness are considered as the main criteria. Hence, the PSNR is considered as an objective criteria and the image brightness is considered as a subjective criteria for evaluation. The simulations results confirm that not only the proposed method is a high capacity image steganography method, but also using this method, the cover image data remains unchanged. Furthermore, if the message data size to be increased, after the message data extraction, there will be existing high PSNR cover image data.
{"title":"A DWT Based Perfect Secure and High Capacity Image Steganography Method","authors":"M. Farahani, A. Pourmohammad","doi":"10.1109/PDCAT.2013.56","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.56","url":null,"abstract":"In this paper, a Discrete Wavelet Transform (DWT) based perfect secure and high capacity image steganography method is presented. This method is used for steganography of the pictorial messages in a cover image (carrier data). First, the message data and the cover image data are transformed using Haar filters based DWT, and then, the message DWT coefficients are embedded to the cover image DWT coefficients. Therefore, some DWT based different message data embedding approaches are studied. The robustness and image brightness are considered as the main criteria. Hence, the PSNR is considered as an objective criteria and the image brightness is considered as a subjective criteria for evaluation. The simulations results confirm that not only the proposed method is a high capacity image steganography method, but also using this method, the cover image data remains unchanged. Furthermore, if the message data size to be increased, after the message data extraction, there will be existing high PSNR cover image data.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131788516","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}
Recently, the development of cloud computing has received considerable attention. For cloud service providers, packing VMs onto a small number of servers is an effective way to reduce energy costs, so as to improve the efficiency of the data center. However allocating too many VMs on a physical machine may cause some hot spots which violate the SLA of applications. Load balancing of the entire system is hence needed to guarantee the SLA. In this paper, we present a simulated-annealing load balancing algorithm for solving the resource allocation and scheduling problem in a cloud computing environment. Experimental results show that this method is able to achieve load balancing, and performs better than the round robin and basic simulated-annealing algorithms.
{"title":"Simulated-Annealing Load Balancing for Resource Allocation in Cloud Environments","authors":"Zongqin Fan, Hong Shen, Yanbo Wu, Yidong Li","doi":"10.1109/PDCAT.2013.7","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.7","url":null,"abstract":"Recently, the development of cloud computing has received considerable attention. For cloud service providers, packing VMs onto a small number of servers is an effective way to reduce energy costs, so as to improve the efficiency of the data center. However allocating too many VMs on a physical machine may cause some hot spots which violate the SLA of applications. Load balancing of the entire system is hence needed to guarantee the SLA. In this paper, we present a simulated-annealing load balancing algorithm for solving the resource allocation and scheduling problem in a cloud computing environment. Experimental results show that this method is able to achieve load balancing, and performs better than the round robin and basic simulated-annealing algorithms.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"34 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114022797","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 this paper, we present a novel in-domain neighborhood approach to clarify the dynamic load balancing problem on a heterogeneous network and to solve many practical problems. The distributed system consists of a network of workstations with different domains, speeds and capacities. Since the number of workstations and the diameter of the network affect the convergences rate, our approach introduces the in-domain relation that classifies the entire network into sub-networks called domains. The algorithm runs in each workstation in order to reach the fairness state in-domain and in entire network rapidly. In this paper, our approach is applied to a cafeteria system as a case study, each workstation is viewed as a cafeteria where the maximum number of orders that can be submitted to one cafeteria corresponds to the capacity of that cafeteria workstation, the communication channels are modeled between the in-domain cafeterias, and the workload is represented as orders. An algorithm is presented to simulate the migration of the orders between in-domain cafeterias and to distribute a proportion of the excessive workload of heavily loaded node to lightly loaded node by considering the capacity of each node such that when the algorithm terminates, the effective-load in all cafeterias is the same. Therefore, each workstation receives an amount of workload proportional to its total capacity. This framework is analyzed mathematically, and it is proved that the proposed algorithm converges and achieves the fairness state.
{"title":"In-Domain Neighborhood Approach to Heterogeneous Dynamic Load Balancing in Real World Network","authors":"E. Daraghmi, S. Yuan","doi":"10.1109/PDCAT.2013.17","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.17","url":null,"abstract":"In this paper, we present a novel in-domain neighborhood approach to clarify the dynamic load balancing problem on a heterogeneous network and to solve many practical problems. The distributed system consists of a network of workstations with different domains, speeds and capacities. Since the number of workstations and the diameter of the network affect the convergences rate, our approach introduces the in-domain relation that classifies the entire network into sub-networks called domains. The algorithm runs in each workstation in order to reach the fairness state in-domain and in entire network rapidly. In this paper, our approach is applied to a cafeteria system as a case study, each workstation is viewed as a cafeteria where the maximum number of orders that can be submitted to one cafeteria corresponds to the capacity of that cafeteria workstation, the communication channels are modeled between the in-domain cafeterias, and the workload is represented as orders. An algorithm is presented to simulate the migration of the orders between in-domain cafeterias and to distribute a proportion of the excessive workload of heavily loaded node to lightly loaded node by considering the capacity of each node such that when the algorithm terminates, the effective-load in all cafeterias is the same. Therefore, each workstation receives an amount of workload proportional to its total capacity. This framework is analyzed mathematically, and it is proved that the proposed algorithm converges and achieves the fairness state.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123026704","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}
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Simon problem more efficiently by a method with higher observation probability.
{"title":"Study on Quantum Parallel Processing by Adiabatic Quantum Computation in Simon Problem","authors":"S. Nakayama, Gang Peng, I. Iimura","doi":"10.1109/PDCAT.2013.20","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.20","url":null,"abstract":"Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Simon problem more efficiently by a method with higher observation probability.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128637008","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
扫码关注我们
求助内容：
应助结果提醒方式：