To meet the increasingly demand of massive storage system, we have designed and implemented a parallel file system called Cappella. It consists of Client, Object Storage Server (OSS) and Metadata Server (MDS). Its I/O performance and data reliability mostly rely on the OSS. In this paper, we present the design and implementation of the OSS. By comparing with existing OSS implementation, our OSS can easily achieve high performance and high reliability by an operation abstraction layer.
{"title":"A High Performance and High Reliability Storage Server for Parallel File System","authors":"Liang Ming, D. Feng, F. Wang, H. Sun, Sen Wu","doi":"10.1109/CyberC.2012.20","DOIUrl":"https://doi.org/10.1109/CyberC.2012.20","url":null,"abstract":"To meet the increasingly demand of massive storage system, we have designed and implemented a parallel file system called Cappella. It consists of Client, Object Storage Server (OSS) and Metadata Server (MDS). Its I/O performance and data reliability mostly rely on the OSS. In this paper, we present the design and implementation of the OSS. By comparing with existing OSS implementation, our OSS can easily achieve high performance and high reliability by an operation abstraction layer.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121075222","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}
X. Chen, Limin Sun, Hongsong Zhu, Y. Zhen, Hongbin Chen
The Internet of Things (IoT) has been considered as the third revolution in the digital technology after the computer and the Internet, and it brings significant advantages to smart grid. Disaster prediction and prevention of power-lines is one of the most difficult problems for electricity transmission companies. Advanced sensing and communication technologies of IoT can effectively avoid or reduce the damage of natural disasters to the power-lines, and hence improve the reliability and stability of power transmission. In this paper, a three-layer architecture model of the Internet of things for smart grid (SG-IoT) is proposed. An overview of the key technologies in SG-IoT is given. An IoT based power-lines online monitoring system is presented.
{"title":"Application of Internet of Things in Power-Line Monitoring","authors":"X. Chen, Limin Sun, Hongsong Zhu, Y. Zhen, Hongbin Chen","doi":"10.1109/CyberC.2012.77","DOIUrl":"https://doi.org/10.1109/CyberC.2012.77","url":null,"abstract":"The Internet of Things (IoT) has been considered as the third revolution in the digital technology after the computer and the Internet, and it brings significant advantages to smart grid. Disaster prediction and prevention of power-lines is one of the most difficult problems for electricity transmission companies. Advanced sensing and communication technologies of IoT can effectively avoid or reduce the damage of natural disasters to the power-lines, and hence improve the reliability and stability of power transmission. In this paper, a three-layer architecture model of the Internet of things for smart grid (SG-IoT) is proposed. An overview of the key technologies in SG-IoT is given. An IoT based power-lines online monitoring system is presented.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122401588","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}
To monitor the healthy status of the buildings, such as buildings and houses, it is necessary to collect the pressure information of these buildings. For the defects of traditional pressure information collection system, the paper designs a system to collect the pressure information of buildings. The presented system combines the IoT and CAN bus to improve the quality of collection. Our system sends the pressure information from sensors to the data processing center through the CAN bus. Because some information collected by sensors is incomplete, so the system will fill the incomplete pressure information before storing the pressure information into the database. Simulation experiments show the system can collect the pressure information of buildings in real time and provide the experts with some useful information.
{"title":"Collection System for Pressure Information of Buildings Based on the IoT and CAN Bus","authors":"Weiyuan Sun, Xing Chen, Fangyi Liu, Liang Zhao","doi":"10.1109/CyberC.2012.53","DOIUrl":"https://doi.org/10.1109/CyberC.2012.53","url":null,"abstract":"To monitor the healthy status of the buildings, such as buildings and houses, it is necessary to collect the pressure information of these buildings. For the defects of traditional pressure information collection system, the paper designs a system to collect the pressure information of buildings. The presented system combines the IoT and CAN bus to improve the quality of collection. Our system sends the pressure information from sensors to the data processing center through the CAN bus. Because some information collected by sensors is incomplete, so the system will fill the incomplete pressure information before storing the pressure information into the database. Simulation experiments show the system can collect the pressure information of buildings in real time and provide the experts with some useful information.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127005303","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}
We consider the security requirements for a broad class of content distribution systems where the content distribution infrastructure is required to strictly abide by access control policies prescribed by owners of content. We propose a security solution that identifies a minimal trusted computing base (TCB) for a content distribution infrastructure, and leverages the TCB to provide all desired assurances regarding the operation of the infrastructure. It is assumed that the contents and access control policies associated with contents are dynamic.
{"title":"An Efficient TCB for a Generic Content Distribution System","authors":"S. Mohanty, A. Velagapalli, M. Ramkumar","doi":"10.1109/CyberC.2012.11","DOIUrl":"https://doi.org/10.1109/CyberC.2012.11","url":null,"abstract":"We consider the security requirements for a broad class of content distribution systems where the content distribution infrastructure is required to strictly abide by access control policies prescribed by owners of content. We propose a security solution that identifies a minimal trusted computing base (TCB) for a content distribution infrastructure, and leverages the TCB to provide all desired assurances regarding the operation of the infrastructure. It is assumed that the contents and access control policies associated with contents are dynamic.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114281937","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}
Wireless sensor nodes are battery-powered communication devices. Their limited capabilities have imposed various constraints to the system design of wireless sensor networks (WSNs). These constraints are interrelated, and are usually in conflict with each other. Clustering is often used to reduce energy consumption in WSNs. However, an arbitrary selection of clustering parameters may lead to severe degradation in other aspects, such as extra delays in data collection processes (DCPs). In this paper, a multi-objective optimization (MOO) framework for cluster-based WSNs is proposed. The proposed framework considers both the energy consumption and the duration of a DCP as its objective functions. Simulation results show that networks optimized using the proposed framework can obtain reasonable trade-offs between the two objectives. Nevertheless, the networks optimized using the proposed framework can obtain non-dominated solutions that cannot be achieved by using energy-aware clustering algorithms.
{"title":"A Multi-Objective Optimization Framework for Cluster-Based Wireless Sensor Networks","authors":"Chi-Tsun Cheng, H. Leung","doi":"10.1109/CyberC.2012.64","DOIUrl":"https://doi.org/10.1109/CyberC.2012.64","url":null,"abstract":"Wireless sensor nodes are battery-powered communication devices. Their limited capabilities have imposed various constraints to the system design of wireless sensor networks (WSNs). These constraints are interrelated, and are usually in conflict with each other. Clustering is often used to reduce energy consumption in WSNs. However, an arbitrary selection of clustering parameters may lead to severe degradation in other aspects, such as extra delays in data collection processes (DCPs). In this paper, a multi-objective optimization (MOO) framework for cluster-based WSNs is proposed. The proposed framework considers both the energy consumption and the duration of a DCP as its objective functions. Simulation results show that networks optimized using the proposed framework can obtain reasonable trade-offs between the two objectives. Nevertheless, the networks optimized using the proposed framework can obtain non-dominated solutions that cannot be achieved by using energy-aware clustering algorithms.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114707805","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}
Advent of 4 G networks, IPv6 and increasing number of subscribers to these indicate that each mobile device will have its own IP address and virtually become a hotspot. In the coming years, systems that track and record our movements will indispensably be integrated in our everyday life. Location-based systems: dashboard navigation systems, Internet enabled smart phones with GPS features, and electronic tags that help us at various locations are extensively in use. In near future, location-aware/ context aware tools will become more common and sophisticated. Increasing number of services (apps)/devices that will track not only the location, but also the context / environment of the user will enter the market. The perils of exposure on Internet and subsequent exploitation have been widely recorded in literature. Some of the services provided do necessitate the knowledge of exact location, context and some personal details, like in case of assistance during accidents, but generally, applications like finding the restaurants or movies playing in an area do not require the exact location and context of the user. When a user's movement in public spaces is tracked and systematically recorded along with the context of his actions, his contextual privacy is under threat. This paper surveys current state of research in this area and analyses the effect of threat on the privacy of context aware system users. Based on the insight, we propose a novel framework to tackle the privacy preservation issue comprehensively: from user perspective as well as service provider perspective.
{"title":"Conceptual Framework and a Critical Review for Privacy Preservation in Context Aware Systems","authors":"A. Pandit, Anup Kumar","doi":"10.1109/CyberC.2012.79","DOIUrl":"https://doi.org/10.1109/CyberC.2012.79","url":null,"abstract":"Advent of 4 G networks, IPv6 and increasing number of subscribers to these indicate that each mobile device will have its own IP address and virtually become a hotspot. In the coming years, systems that track and record our movements will indispensably be integrated in our everyday life. Location-based systems: dashboard navigation systems, Internet enabled smart phones with GPS features, and electronic tags that help us at various locations are extensively in use. In near future, location-aware/ context aware tools will become more common and sophisticated. Increasing number of services (apps)/devices that will track not only the location, but also the context / environment of the user will enter the market. The perils of exposure on Internet and subsequent exploitation have been widely recorded in literature. Some of the services provided do necessitate the knowledge of exact location, context and some personal details, like in case of assistance during accidents, but generally, applications like finding the restaurants or movies playing in an area do not require the exact location and context of the user. When a user's movement in public spaces is tracked and systematically recorded along with the context of his actions, his contextual privacy is under threat. This paper surveys current state of research in this area and analyses the effect of threat on the privacy of context aware system users. Based on the insight, we propose a novel framework to tackle the privacy preservation issue comprehensively: from user perspective as well as service provider perspective.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125093869","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}
By analyzing the defects of traditional scheduling in space missions, sequential mission scheduling architecture, SMSA, is proposed in this paper to cope with progressively increasing number of state modes of spacecrafts and space missions. The improvements of SMSA lie in both methodologies and ideologies, which make it closer to the core of resource and activity scheduling. The key technologies that the scheduling architecture concerns are indicated and the typical process of scheduling is given. With this methodology as well as corresponding software and systems, human work spent in mission scheduling can be remarkably reduced. And also, efficiency in mission scheduling and flexibility of emergency control is increased. SMSA reveals brand new trends of research and development for the upcoming 10 years of China's space explorations.
{"title":"Sequential Scheduling in Space Missions","authors":"Jinjiang Xing, Yan Zhang, Jian Li, Yuncheng Feng","doi":"10.1109/CyberC.2012.57","DOIUrl":"https://doi.org/10.1109/CyberC.2012.57","url":null,"abstract":"By analyzing the defects of traditional scheduling in space missions, sequential mission scheduling architecture, SMSA, is proposed in this paper to cope with progressively increasing number of state modes of spacecrafts and space missions. The improvements of SMSA lie in both methodologies and ideologies, which make it closer to the core of resource and activity scheduling. The key technologies that the scheduling architecture concerns are indicated and the typical process of scheduling is given. With this methodology as well as corresponding software and systems, human work spent in mission scheduling can be remarkably reduced. And also, efficiency in mission scheduling and flexibility of emergency control is increased. SMSA reveals brand new trends of research and development for the upcoming 10 years of China's space explorations.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992542","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}
Clustering techniques are effective techniques in reducing energy consumption in wireless sensor networks (WSNs). A data collection process (DCP) is an operation for a base station (BS) to collect a complete set of data from a WSN. Clustering techniques may, however, introduce bottlenecks to a DCP and cause extra delays. For time-sensitive applications, a delay-aware network structure is necessary. A delay-aware network structure should not only minimize the duration of a single DCP, but also shorten the duration of consecutive DCPs. Furthermore, for better sensing quality, a delay-aware network structure should try to accommodate as many wireless sensor nodes as possible. This paper investigates the trade-offs among the above objective functions in a delay-aware data collection network structure using the concepts of Pareto optimality. The analyses provide an insight into selecting the most suitable network parameters.
{"title":"An Analysis on the Delay-Aware Data Collection Network Structure Using Pareto Optimality","authors":"Chi-Tsun Cheng, C. K. Tse","doi":"10.1109/CyberC.2012.65","DOIUrl":"https://doi.org/10.1109/CyberC.2012.65","url":null,"abstract":"Clustering techniques are effective techniques in reducing energy consumption in wireless sensor networks (WSNs). A data collection process (DCP) is an operation for a base station (BS) to collect a complete set of data from a WSN. Clustering techniques may, however, introduce bottlenecks to a DCP and cause extra delays. For time-sensitive applications, a delay-aware network structure is necessary. A delay-aware network structure should not only minimize the duration of a single DCP, but also shorten the duration of consecutive DCPs. Furthermore, for better sensing quality, a delay-aware network structure should try to accommodate as many wireless sensor nodes as possible. This paper investigates the trade-offs among the above objective functions in a delay-aware data collection network structure using the concepts of Pareto optimality. The analyses provide an insight into selecting the most suitable network parameters.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124457158","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}
Based on the homomorphism of Lee et al, Xiang Guangli et al proposed similar module and implemented encrypting operations of addition, subtraction, multiplication and division over real number domain. There was additive and multiplicative homomorphism heretofore. But their cipher text leaks the information of decimal fraction, sign and relationship of big and small. We propose additive, subtractive, multiplicative and divisive homomorphism over real number domain based on representation of real number by positive integer and Fermat's Little Theorem. We prove the security and correctness of the proposed homomorphism encryption system. The results of instances show that there are no the problems mentioned above in our algorithm.
{"title":"Homomorphism Encryption Algorithm for Elementary Operations over Real Number Domain","authors":"Zhang Tong, Wu Qi, Liu Wen, Chen Liang","doi":"10.1109/CYBERC.2012.35","DOIUrl":"https://doi.org/10.1109/CYBERC.2012.35","url":null,"abstract":"Based on the homomorphism of Lee et al, Xiang Guangli et al proposed similar module and implemented encrypting operations of addition, subtraction, multiplication and division over real number domain. There was additive and multiplicative homomorphism heretofore. But their cipher text leaks the information of decimal fraction, sign and relationship of big and small. We propose additive, subtractive, multiplicative and divisive homomorphism over real number domain based on representation of real number by positive integer and Fermat's Little Theorem. We prove the security and correctness of the proposed homomorphism encryption system. The results of instances show that there are no the problems mentioned above in our algorithm.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120959244","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 proposes an efficient and secure identity based online and off-line aggregate signature scheme with random oracles. An aggregate signature privides a technique for combining n differents signatures of n different messages into one signature of constant length. The proposed scheme can be implimentated on Wireless Sensor Networks application. Security of the proposed scheme is based on difficulty of breaking Bilinear Diffie-Hellman problem (BDHP). The scheme is secure in random oracle models under the assumption of computational infeasibility of solving BDHP. It is existential unforgerable under adaptive-chosen-identity and adaptive-chosen-message attack In On-line/Off-line signature scheme, the signing process can be broken into two phases. The first phase, performed off-line, is independent of the particular message to be signed, while the second phase is performed on-line, once the message is presented.
{"title":"Provably Secure Identity-Based Aggregate Signature Scheme","authors":"J. Kar","doi":"10.1109/CyberC.2012.30","DOIUrl":"https://doi.org/10.1109/CyberC.2012.30","url":null,"abstract":"This paper proposes an efficient and secure identity based online and off-line aggregate signature scheme with random oracles. An aggregate signature privides a technique for combining n differents signatures of n different messages into one signature of constant length. The proposed scheme can be implimentated on Wireless Sensor Networks application. Security of the proposed scheme is based on difficulty of breaking Bilinear Diffie-Hellman problem (BDHP). The scheme is secure in random oracle models under the assumption of computational infeasibility of solving BDHP. It is existential unforgerable under adaptive-chosen-identity and adaptive-chosen-message attack In On-line/Off-line signature scheme, the signing process can be broken into two phases. The first phase, performed off-line, is independent of the particular message to be signed, while the second phase is performed on-line, once the message is presented.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121744137","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
扫码关注我们
求助内容：
应助结果提醒方式：