2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery最新文献

筛选
英文 中文
An Overlay-Based Approach for Replacing Failed Sensors by Mobile Robots 移动机器人替换失效传感器的一种基于叠加的方法
Jian Wang, Xiumei Wu, Na Guo, C. Ullrich, Heng Luo
{"title":"An Overlay-Based Approach for Replacing Failed Sensors by Mobile Robots","authors":"Jian Wang, Xiumei Wu, Na Guo, C. Ullrich, Heng Luo","doi":"10.1109/CYBERC.2010.38","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.38","url":null,"abstract":"Wireless sensor networks (WSN) are desirable to offer continuous services even in the case of sensor failures. Deploying redundant sensors or mobile sensors to guarantee service continuity may not be cost-effective. In contrast, this paper resorts to mobile robots that replace failed sensors in an on-demand manner. A rendezvous overlay is proposed on the top of wireless sensor networks in order to efficiently collect and disseminate sensor failure reports. Also optimal overlay size for sensor networks is presented. Simulation results show that our overlay-based approach outperforms two existing algorithms (i.e. dynamic distributed algorithm and centralized algorithm) with regard to the message overhead.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117140441","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}
引用次数: 1
A Web Services Status Monitoring Technology for Distributed System Management in the Cloud 云环境下分布式系统管理的Web服务状态监控技术
Chia-Feng Lin, Ruey-Shyang Wu, S. Yuan, Ching-Tsorng Tsai
{"title":"A Web Services Status Monitoring Technology for Distributed System Management in the Cloud","authors":"Chia-Feng Lin, Ruey-Shyang Wu, S. Yuan, Ching-Tsorng Tsai","doi":"10.1109/CYBERC.2010.97","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.97","url":null,"abstract":"Web services define standard interfaces those provide good solution for enterprise integration. Recently, many researches focus on creating management standards to manage Web services. Web Services Distributed Management (WSDM) is one of the industry standards. However, to implement the WSDM interfaces needs to understand server Web service standards. It increases the complexity and difficulty to build the management system. In this research, we had simplified the Web service management effort between services using hook technology. Our management systems provide message flow oriented management atomically without modifying service code. Enterprise can control all flows and review them at any time. Finally, we evaluate the overhead for our proposed technology. Enterprise can build a quickly, efficient and extensible management system in the Web services environment.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122654911","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}
引用次数: 11
Fast Scalar Multiplication for Elliptic Curve Cryptography in Sensor Networks with Hidden Generator Point 隐生成点传感器网络中椭圆曲线密码的快速标量乘法算法
Xu Huang, P. Shah, D. Sharma
{"title":"Fast Scalar Multiplication for Elliptic Curve Cryptography in Sensor Networks with Hidden Generator Point","authors":"Xu Huang, P. Shah, D. Sharma","doi":"10.1109/CYBERC.2010.51","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.51","url":null,"abstract":"Cryptographic algorithms are becoming popular due to their applicability and suitability for use in constrained environment such as mobile sensor information applications. It is well known in these applications, both computing resources and power availability are limiting factors. Hence, it is expecting to have cryptographic algorithms with low power consuming, less computing, and high security for mobile sensor networks. Elliptic curve cryptography (ECC) is an emerging favorite because requires less computational power, communication bandwidth, and memory when compared to other cryptosystems. In this paper we present our new design, a hidden generator point, which offers an improvement in protection from the man-in-middle (MinM) attack which is a major vulnerability for the sensor networks. Even though there are other ways to implement hidden generator point, which are on the way to be published in our future paper, the presented algorisms can show the hidden generator point does work. Also, a new algorithm based on ones complement for fast scalar multiplication is first introduced, which yields a 12.5% improvement in efficiency in comparison with the results of other common complementary algorithms reported.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123293745","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}
引用次数: 11
A Study on Large-Scale Wireless Mesh Networks Cooperating with High-Speed External Networks - Improvement of Performance Deterioration Due to Increasing Network Scale 大规模无线网状网络与高速外部网络的协同研究——网络规模增大导致的性能下降的改善
K. Imai, Hisao Yamamoto
{"title":"A Study on Large-Scale Wireless Mesh Networks Cooperating with High-Speed External Networks - Improvement of Performance Deterioration Due to Increasing Network Scale","authors":"K. Imai, Hisao Yamamoto","doi":"10.1109/CYBERC.2010.100","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.100","url":null,"abstract":"In wireless mesh networks, not only the connections from mobile terminals to access nodes but also the connections between access nodes are constructed by multi-hop wireless communication. The performance in these networks decreases as the network scale grows because the end-to-end delay and packet loss also increase. Moreover, two or more networks will unite geographically as the scale of each mesh network expands. Therefore, plural gateway nodes connected to outside networks exist in such large-scale wireless mesh networks. This paper proposes routing algorithms which construct multi-hop routes between access nodes that use outside networks collectively. The outside networks between the gateway nodes are used as bypass routes. The purpose of this scheme is to prevent the performance deterioration due to the increase of network scale. New route metrics that do not depend on the location conditions of the gateway nodes are introduced to RA-OLSR to maintain flexibility. Performance evaluations of the end-to-end delay and packet loss are shown by computer simulations.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121650987","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}
引用次数: 2
Method and System of Performance Monitoring to Detect VDSL Service Degradation VDSL服务退化检测的性能监测方法与系统
C. Yang, Chi-Ming Chen, David Lu, Xidong Wu, R. Savoor
{"title":"Method and System of Performance Monitoring to Detect VDSL Service Degradation","authors":"C. Yang, Chi-Ming Chen, David Lu, Xidong Wu, R. Savoor","doi":"10.1109/CYBERC.2010.92","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.92","url":null,"abstract":"This paper presents an automated means to predicatively detect service degradation signatures or symptoms of VDSL (Very High Bit-rate Digital Line Subscriber) based on performance monitoring measurements. It describes a management structure and methodology for trouble sectionalization and isolation to verify and confirm problem locations. This paper also provides new computing techniques to determine loop and tap lengths based on loop attenuation at different tones. These computing techniques effectively lower the computing time so that the computing program can be deployed to support real time applications and process large numbers of lines in backend during automated processes. To improve the fault detection, we also include the methodology of SELT (Single Ended Loop Testing) as part of the performance monitoring process. With our methodology and management structure, the detection rate is 95% and false positive is ~0.01%. As a result, the implementation of automated performance monitoring capabilities to support Service Assurance (SA) operations has been generally satisfactory.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124113439","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}
引用次数: 1
Parallel ISODATA Clustering of Remote Sensing Images Based on MapReduce 基于MapReduce的遥感图像并行ISODATA聚类
Bo Li, Hui Zhao, Zhenhua Lv
{"title":"Parallel ISODATA Clustering of Remote Sensing Images Based on MapReduce","authors":"Bo Li, Hui Zhao, Zhenhua Lv","doi":"10.1109/CYBERC.2010.75","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.75","url":null,"abstract":"The ISODATA clustering algorithm is regarded as a common method in the field of analyzing remote sensing images. It is very effective to generate a preliminary overview of images. These kinds of clustering methods are currently done in personal computers. However, with the development of remote sensing technology, the spatial resolutions are increasing rapidly and the sizes of the data are becoming larger. Clustering large amounts of images is considerably time-consuming in personal computers because of the limitation of both hardware and software resources. Researchers have developed many kinds of variants of the ISODATA algorithm executing in parallel, and most of them are implemented by using MPI. Generally, writing programs in MPI requires sophisticated skills of the user. Different with the former studies, we propose in this paper to parallel ISODATA clustering algorithm on Map Reduce, another parallel programming model that is very easy to use. The algorithm is mainly divided into two steps defined by the framework of Map Reduce, and they are detailed by pseudo-codes. To improve the accuracies of the color values, the color space CIELAB is used instead of RGB. The experiment results demonstrates that our proposed algorithm possess a robust scalability and the computational time substantially reduced through increasing the number of nodes and it may inspire new solutions of other similar problems.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128421290","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}
引用次数: 53
Hierarchical Copy Algorithm for Xen Live Migration Xen实时迁移的分层复制算法
Zhaobin Liu, W. Qu, Tao Yan, Haitao Li, Keqiu Li
{"title":"Hierarchical Copy Algorithm for Xen Live Migration","authors":"Zhaobin Liu, W. Qu, Tao Yan, Haitao Li, Keqiu Li","doi":"10.1109/CYBERC.2010.71","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.71","url":null,"abstract":"With the increasing number of technology areas using Virtual Machine (VM) platforms, challenges exist in Virtual Machine migrating from one physical host to another. This paper presents the design and implementation of a novel Hierarchical Copy Algorithm (HCA) for Xen live VM migration. Based on the memory characteristics which will be transferred, the measuring time of working sets is shifted to the earlier migration stage. Furthermore, dirty page is recorded from “0/1” token to precise modification times. Experimental results illustrate that our HCA approach can shorten both the total migration time and downtime obviously under high dirty page rate environment.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134491426","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}
引用次数: 28
Comment on an Improved Signature without Using One-Way Hash Functions 对不使用单向哈希函数的改进签名的评论
Lu-Xiong Xu, Chenglian Liu, Na Wang
{"title":"Comment on an Improved Signature without Using One-Way Hash Functions","authors":"Lu-Xiong Xu, Chenglian Liu, Na Wang","doi":"10.1109/CYBERC.2010.87","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.87","url":null,"abstract":"In 2005, Zhang and Wang proposed an improved signature scheme without using one-way hash functions. Even they used bit wise exclusive-or to against multiplicative attack, and the exclusive-or is easy to implement, and more fast. But they may have misused order of operation in mathematical precedence. In this comment, we would like to point out an error in the related work and scheme as follows.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133219152","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}
引用次数: 5
Modified Least Cost Method for Grid Resource Allocation 网格资源分配的改进最小代价法
Syed Nasir Mehmood Shah, A. Mahmood, A. Oxley
{"title":"Modified Least Cost Method for Grid Resource Allocation","authors":"Syed Nasir Mehmood Shah, A. Mahmood, A. Oxley","doi":"10.1109/CYBERC.2010.47","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.47","url":null,"abstract":"A ‘Grid’ is an infrastructure for resource sharing. It is used for large-scale data processing, many of the applications being scientific ones. The processing of a job on a conventional network takes place on a single computer, whereas the processing of a job on a Grid may be split between several computers. A Grid is, therefore, capable of running applications that are too demanding for a stand-alone computer or a conventional network of computers. The resources making up a Grid need to be managed to provide a good quality of service. Availability is complicated by the fact that a single application may request multiple resource types from multiple locations. Grid resource allocation is regarded as a vital component of a Grid infrastructure. Many methods have been developed for Grid resource allocation. In this paper, we propose a new Grid resource allocation method (Modified Least Cost Method) that assigns tasks to computing nodes in a way that is close to the optimum. The proposed method is an advanced form of the Least Cost Method. In this paper we evaluate Modified Least Cost Method for Grid resource allocation scenario. This paper also proposes a Linear Programming (LP) model for Grid scheduling and includes a comparative performance analysis of our proposed Resource Allocation method with the existing ones.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124329990","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}
引用次数: 18
M&M: A Multi-channel MAC Protocol with Multiple Channel Reservation for Wireless Sensor Networks 无线传感器网络中具有多通道保留的多通道MAC协议
Jinbao Li, Desheng Zhang
{"title":"M&M: A Multi-channel MAC Protocol with Multiple Channel Reservation for Wireless Sensor Networks","authors":"Jinbao Li, Desheng Zhang","doi":"10.1109/CYBERC.2010.29","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.29","url":null,"abstract":"In this paper, a multi-channel MAC protocol, called M&M, with multiple channel reservation is proposed to tackle the channel conflict problem. M&M is fully distributed with no requirements of time synchronization or multi-radio, so it is very practical to implement M&M in resource-constrained sensor nodes. M&M can make nodes to choose one actually idle channel for communications from all assumed idle channels. Therefore, M&M can greatly alleviate, if not completely eliminate, packet collisions resulted by the channel conflict, and thus conserve more energy to prolong the lifetime of WSNs. To investigate the values of multiple channel reservation, extensive simulation and real test bed experiments are conducted. The results show that when the number of channels becomes larger or loads are heavy, M&M improves energy efficiency and throughput significantly.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126164083","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信