Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062538
Chun'e Ku, Heng-Yang Zhang, X. Shi, Kezhong Jin, Zhenzhou Tang
Network Coding has attracted significant attention in recent years, and it has been widely applied in broadcast, multicast and unicast. Nevertheless, the study on network coding in convergecast is still in the theoretical analysis and the simulation stage. In order to investigate the network coding gain of convergecast in realistic wireless sensor networks, a network coding-based convergecast scheme is realized in this paper. The experiment is conducted in the basic size of convergecast whose size is limited below four, which is for the purpose of eliminating as much interference from the large size of convergecast network as possible. Performed in traditional convergecast scheme and network coding convergecast scheme, the experiment on collection rate and energy consumption are evaluated under different link delivery ratios and scales of convergecast network. The experiment results show that network coding is certain to introduce benefit in the case of poor link equality. However, it is inferior to the traditional scheme when the wireless link delivery ratio is high enough due to the conscious overhearing and the prerequisite of successful decoding.
{"title":"Performance evaluation of Network Coding-based convergecast in realistic wireless sensor networks","authors":"Chun'e Ku, Heng-Yang Zhang, X. Shi, Kezhong Jin, Zhenzhou Tang","doi":"10.1109/CCIOT.2014.7062538","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062538","url":null,"abstract":"Network Coding has attracted significant attention in recent years, and it has been widely applied in broadcast, multicast and unicast. Nevertheless, the study on network coding in convergecast is still in the theoretical analysis and the simulation stage. In order to investigate the network coding gain of convergecast in realistic wireless sensor networks, a network coding-based convergecast scheme is realized in this paper. The experiment is conducted in the basic size of convergecast whose size is limited below four, which is for the purpose of eliminating as much interference from the large size of convergecast network as possible. Performed in traditional convergecast scheme and network coding convergecast scheme, the experiment on collection rate and energy consumption are evaluated under different link delivery ratios and scales of convergecast network. The experiment results show that network coding is certain to introduce benefit in the case of poor link equality. However, it is inferior to the traditional scheme when the wireless link delivery ratio is high enough due to the conscious overhearing and the prerequisite of successful decoding.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116912284","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062521
Yue Pan, Yue Li, Junxing Zhang
In this paper, a data acquisition scheme that is reactive to network congestion is proposed for Internet of Things (IoT). It adjusts data acquisition rates according to the congestion level in a distributed manner, thereby alleviating and avoiding congestion as much as possible. It also makes its best effort to deliver information of high priorities in a timely manner and ensure uninterrupted sensing. Our experiments demonstrate that the scheme offers a much higher delivery rate of the high-priority data compared with the original scheme when the network undergoes different levels of congestion.
{"title":"Congestion-aware data acquisition for Internet of Things","authors":"Yue Pan, Yue Li, Junxing Zhang","doi":"10.1109/CCIOT.2014.7062521","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062521","url":null,"abstract":"In this paper, a data acquisition scheme that is reactive to network congestion is proposed for Internet of Things (IoT). It adjusts data acquisition rates according to the congestion level in a distributed manner, thereby alleviating and avoiding congestion as much as possible. It also makes its best effort to deliver information of high priorities in a timely manner and ensure uninterrupted sensing. Our experiments demonstrate that the scheme offers a much higher delivery rate of the high-priority data compared with the original scheme when the network undergoes different levels of congestion.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114484649","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062513
Zhaohua Liu, Jingjing Zhao, Xiao-Hua Li, Weng-Hooi Tan
A parallelized cooperative multiple particles swarm optimization algorithm with immunity mechanism based on the multi-core architecture is proposed for large scale optimization problem in this paper, named M-PCPSO-I. A novel memory information sharing scheme is designed for particles and facilitates communication among different swarms in the population space. The global best individuals selected from sub-swarms are saved in the leader set and promoted by using the improved immune clonal selection operator. The M-PCPSO-I algorithm is paralleling implementation on a share-memory computer system through the multi-core architecture. The high dimension problem results validated the proposed algorithm have good computational performance, and also the computational efficiency is greatly enhanced by multi-core parallelization.
{"title":"Multi-core based parallelized cooperative PSO with immunity for large scale optimization problem","authors":"Zhaohua Liu, Jingjing Zhao, Xiao-Hua Li, Weng-Hooi Tan","doi":"10.1109/CCIOT.2014.7062513","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062513","url":null,"abstract":"A parallelized cooperative multiple particles swarm optimization algorithm with immunity mechanism based on the multi-core architecture is proposed for large scale optimization problem in this paper, named M-PCPSO-I. A novel memory information sharing scheme is designed for particles and facilitates communication among different swarms in the population space. The global best individuals selected from sub-swarms are saved in the leader set and promoted by using the improved immune clonal selection operator. The M-PCPSO-I algorithm is paralleling implementation on a share-memory computer system through the multi-core architecture. The high dimension problem results validated the proposed algorithm have good computational performance, and also the computational efficiency is greatly enhanced by multi-core parallelization.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"19 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120923157","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062517
Lu Lu, Yin Fulian, Chai Jianping, Lin Jie-cong
The traditional ratings survey method has various problems under the environment of `media integration', such as the form unitarily and no in-depth analysis. For these problems, this paper presents a comprehensive cross-platform television program evaluation system. This comprehensive evaluation system has the characteristics of multi-service targets, multi-platform, multi-method, multi-dimensional, and multi-evaluate content. It can evaluate TV shows more scientifically and comprehensively compared with the existing program evaluation method.
{"title":"Comprehensive evaluation of cross-platform TV shows research","authors":"Lu Lu, Yin Fulian, Chai Jianping, Lin Jie-cong","doi":"10.1109/CCIOT.2014.7062517","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062517","url":null,"abstract":"The traditional ratings survey method has various problems under the environment of `media integration', such as the form unitarily and no in-depth analysis. For these problems, this paper presents a comprehensive cross-platform television program evaluation system. This comprehensive evaluation system has the characteristics of multi-service targets, multi-platform, multi-method, multi-dimensional, and multi-evaluate content. It can evaluate TV shows more scientifically and comprehensively compared with the existing program evaluation method.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116493158","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062497
Nitesh Aggarwal, Cp Gupta, Iti Sharma
Capability of operating over encrypted data makes Fully Homomorphic Encryption(FHE)the Holy Grail for secure data processing applications. Though many applications need only secret keys, FHE has not been achieved properly through symmetric cryptography. Major hurdle is the need to refresh noisy ciphertexts which essentially requires public key and bootstrapping. We introduce a refreshing procedure to make a somewhat homomorphic scheme, fully homomorphic without requiring bootstrapping. Our scheme uses symmetric keys and has performance superior to existing public-key schemes.
{"title":"Fully Homomorphic symmetric scheme without bootstrapping","authors":"Nitesh Aggarwal, Cp Gupta, Iti Sharma","doi":"10.1109/CCIOT.2014.7062497","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062497","url":null,"abstract":"Capability of operating over encrypted data makes Fully Homomorphic Encryption(FHE)the Holy Grail for secure data processing applications. Though many applications need only secret keys, FHE has not been achieved properly through symmetric cryptography. Major hurdle is the need to refresh noisy ciphertexts which essentially requires public key and bootstrapping. We introduce a refreshing procedure to make a somewhat homomorphic scheme, fully homomorphic without requiring bootstrapping. Our scheme uses symmetric keys and has performance superior to existing public-key schemes.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132181225","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062506
Xiaolong Jia, M. Zhu
Virtualization is vital important in server consolidation. Using virtualization technology, a single physical machine can provide multiple isolated virtual machine for users, which will improve the overall system resources usage. However, In virtualization environment, Non-Uniform Memory Access Architecture (NUMA) problem is also a very important parameter that affects server's performance. To solve NUMA problem, many solutions have been proposed to reduce its performance impact on virtual machines and improve the overall system performance. Hardware Single Root I/O Virtualization (SR-IOV) is a solution for high performance network processing, but when SR-IOV technology is running on a NUMA platform, it also generates the traditional problem about NUMA.
{"title":"Research on significance of VCPU scheduling for SR-IOV on NUMA platform","authors":"Xiaolong Jia, M. Zhu","doi":"10.1109/CCIOT.2014.7062506","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062506","url":null,"abstract":"Virtualization is vital important in server consolidation. Using virtualization technology, a single physical machine can provide multiple isolated virtual machine for users, which will improve the overall system resources usage. However, In virtualization environment, Non-Uniform Memory Access Architecture (NUMA) problem is also a very important parameter that affects server's performance. To solve NUMA problem, many solutions have been proposed to reduce its performance impact on virtual machines and improve the overall system performance. Hardware Single Root I/O Virtualization (SR-IOV) is a solution for high performance network processing, but when SR-IOV technology is running on a NUMA platform, it also generates the traditional problem about NUMA.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130737091","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062515
Jianchang Tang, Xinhuai Tang
Different personalized recommendation algorithms are suitable for different scenarios. In this paper, we use artificial neural networks to implement an adaptive framework. When we add different recommendation algorithms into it and train it with the data from a given scenario, it can calculate the weight of each algorithm, choose suitable algorithms and give a more accurate prediction rating.
{"title":"An adaptive framework for personalized recommendation algorithms","authors":"Jianchang Tang, Xinhuai Tang","doi":"10.1109/CCIOT.2014.7062515","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062515","url":null,"abstract":"Different personalized recommendation algorithms are suitable for different scenarios. In this paper, we use artificial neural networks to implement an adaptive framework. When we add different recommendation algorithms into it and train it with the data from a given scenario, it can calculate the weight of each algorithm, choose suitable algorithms and give a more accurate prediction rating.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123330371","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062510
Hsin-Tse Lu, Chia Hung Kao, P. Wu, Yi-Hsuan Lee
Private cloud storage solutions, such as Oxygen Cloud and COSA (Cloud Object Storage Appliance), which provide file synchronization and sharing with high performance and integral security for enterprises. Those solutions have welldefined functions for integrating with enterprise environment. However, not all enterprises have enough resource to deploy, maintain and manage their own services. On the other hand, application service providers are searching for efficient and automatic service based on these storage solutions for more profits. In this paper, we propose a hosted private storage architecture based on COSA (Cloud Object Storage Appliance) and CAKE (Cloud Application Kernel Environment). In this architecture, each appliance hosted in a data center with Internet connectivity, storage pool and hypervisor(s); and a portal machine can provide self-service and monitoring features to enterprise and application service provider. The design and the implementation of the hosted private cloud storage solution are also described in this paper.
{"title":"Towards a hosted private cloud storage solution for application service provider","authors":"Hsin-Tse Lu, Chia Hung Kao, P. Wu, Yi-Hsuan Lee","doi":"10.1109/CCIOT.2014.7062510","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062510","url":null,"abstract":"Private cloud storage solutions, such as Oxygen Cloud and COSA (Cloud Object Storage Appliance), which provide file synchronization and sharing with high performance and integral security for enterprises. Those solutions have welldefined functions for integrating with enterprise environment. However, not all enterprises have enough resource to deploy, maintain and manage their own services. On the other hand, application service providers are searching for efficient and automatic service based on these storage solutions for more profits. In this paper, we propose a hosted private storage architecture based on COSA (Cloud Object Storage Appliance) and CAKE (Cloud Application Kernel Environment). In this architecture, each appliance hosted in a data center with Internet connectivity, storage pool and hypervisor(s); and a portal machine can provide self-service and monitoring features to enterprise and application service provider. The design and the implementation of the hosted private cloud storage solution are also described in this paper.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121630611","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 : 2014-12-01DOI: 10.1109/cciot.2014.7062539
Tao Chi, Hanshi Wang, Lizhen Liu, Wei Song, Chao Du
{"title":"Text similarity calculation method based on ontology model","authors":"Tao Chi, Hanshi Wang, Lizhen Liu, Wei Song, Chao Du","doi":"10.1109/cciot.2014.7062539","DOIUrl":"https://doi.org/10.1109/cciot.2014.7062539","url":null,"abstract":"","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122917835","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 : 2014-12-01DOI: 10.1109/CCIOT.2014.7062504
Haoxiang Mao, B. Huang
Virtualization is becoming an important part of cloud computing and high performance calculation. In the virtualized system, the scheduler plays an important role in effecting the performance of whole system. Traditional scheduler that focus on the fairness of VMs would cause problems in I/O performance and latency. In order to eliminate the I/O latency issue, we propose a virtual machine scheduling model based on multiprocessor system. We also implement a prototype in Xen 4.3.0 and evaluate it with several benchmarks. Experiment results demonstrate that our scheduling model can improve the I/O performance effectively. The bandwidth of disk increase by 53.6% and that of network increase by 39.4%. Meanwhile, our method does not change the scheduling algorithm of CPU-intensive VM so that the scheduling fairness is ensured.
{"title":"I/O-intensive scheduling in multiprocessor virtualized system","authors":"Haoxiang Mao, B. Huang","doi":"10.1109/CCIOT.2014.7062504","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062504","url":null,"abstract":"Virtualization is becoming an important part of cloud computing and high performance calculation. In the virtualized system, the scheduler plays an important role in effecting the performance of whole system. Traditional scheduler that focus on the fairness of VMs would cause problems in I/O performance and latency. In order to eliminate the I/O latency issue, we propose a virtual machine scheduling model based on multiprocessor system. We also implement a prototype in Xen 4.3.0 and evaluate it with several benchmarks. Experiment results demonstrate that our scheduling model can improve the I/O performance effectively. The bandwidth of disk increase by 53.6% and that of network increase by 39.4%. Meanwhile, our method does not change the scheduling algorithm of CPU-intensive VM so that the scheduling fairness is ensured.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123772681","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
扫码关注我们
求助内容：
应助结果提醒方式：