Mei Wang, Jiaoling Zhou, Yue Li, Xiaoling Xia, Jiajin Le
Data reusing is an important way to save storage capacity and improve query efficiency in the management of massive data. The column-store architecture stores data from the same column continuously, which greatly improves the performance of 'read optimization' application and moreover increases the feasibility and flexibility of data reusing. In this paper, we propose a novel reusing method based on the column-store data warehouse. Firstly, we propose an improved iMAP method based on the schema mapping technique to generate as more candidate reusable columns as possible and then conduct further filter on these candidate data, which greatly reduces the complexity of reusable data detection. Based on the column-store architecture, we then propose the reuse implement at the storage layer. The method for query execution based on reusable data is provided finally. The experiment results conducted on the real data sets indicate that the presented strategy can reduce the storage space and query execution time efficiently.
{"title":"A Data Reusing Strategy Based on Column-Stores","authors":"Mei Wang, Jiaoling Zhou, Yue Li, Xiaoling Xia, Jiajin Le","doi":"10.1109/DASC.2013.56","DOIUrl":"https://doi.org/10.1109/DASC.2013.56","url":null,"abstract":"Data reusing is an important way to save storage capacity and improve query efficiency in the management of massive data. The column-store architecture stores data from the same column continuously, which greatly improves the performance of 'read optimization' application and moreover increases the feasibility and flexibility of data reusing. In this paper, we propose a novel reusing method based on the column-store data warehouse. Firstly, we propose an improved iMAP method based on the schema mapping technique to generate as more candidate reusable columns as possible and then conduct further filter on these candidate data, which greatly reduces the complexity of reusable data detection. Based on the column-store architecture, we then propose the reuse implement at the storage layer. The method for query execution based on reusable data is provided finally. The experiment results conducted on the real data sets indicate that the presented strategy can reduce the storage space and query execution time efficiently.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258106","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}
Lien-Chun Wang, Wei-Ting Cho, Y. Chiu, Chin-Feng Lai
This study proposes a non-invasive smart meter system that considers the power use habits of users unfamiliar with electric appliances, and can be used by inserting the smart meter into an electrical circuit. This study also creates a database mechanism, appliance recognition classification, and a waveform recognition method, in order to solve the large data volume problem in current appliance recognition systems. In comparison to other appliance recognition systems, the low-end embedded system chip used in this study has low power consumption, as well as high expandability and ease of use. This experiment is different from the research environments of other appliance recognition systems by considering parallel multi-appliance recognition and general users' habit of using power. This study will not make any assumption of power utilization in the experiment. The total system recognition rate is 84.42%, and the total recognition rate of a single electric appliance is 93.82%, proving the high feasibility of this study.
{"title":"A Parallel Multi-appliance Recognition for Smart Meter","authors":"Lien-Chun Wang, Wei-Ting Cho, Y. Chiu, Chin-Feng Lai","doi":"10.1109/DASC.2013.110","DOIUrl":"https://doi.org/10.1109/DASC.2013.110","url":null,"abstract":"This study proposes a non-invasive smart meter system that considers the power use habits of users unfamiliar with electric appliances, and can be used by inserting the smart meter into an electrical circuit. This study also creates a database mechanism, appliance recognition classification, and a waveform recognition method, in order to solve the large data volume problem in current appliance recognition systems. In comparison to other appliance recognition systems, the low-end embedded system chip used in this study has low power consumption, as well as high expandability and ease of use. This experiment is different from the research environments of other appliance recognition systems by considering parallel multi-appliance recognition and general users' habit of using power. This study will not make any assumption of power utilization in the experiment. The total system recognition rate is 84.42%, and the total recognition rate of a single electric appliance is 93.82%, proving the high feasibility of this study.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133215991","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}
For mountain landslide, This paper proposes an intelligent early-warning system for landslides based on ZigBee network. It adopts Cortex-M3 architecture of the chip as the embedded core control processor to improve system integration, data processing capabilities, the ZigBee uses CC2530 as the hardware foundation to construct ZIGBEE wireless sensor network, and then uses GPRS as the technological manner to remotely convey data transmission and early warning information. The results show that the system is completely functional. And it has versatility and good scalability, can overcome the traditional monitoring method of single function which efficiency is low and cost is high, it can effectively achieve the landslide monitoring and prevention of the adverse geological conditions under the mountains.
{"title":"Intelligent Early-Warning System for Landslides Based on the ZigBee Network","authors":"Jian Xu, Yuanhong Wang, Yu Zhang, Shushan Yang","doi":"10.1109/DASC.2013.60","DOIUrl":"https://doi.org/10.1109/DASC.2013.60","url":null,"abstract":"For mountain landslide, This paper proposes an intelligent early-warning system for landslides based on ZigBee network. It adopts Cortex-M3 architecture of the chip as the embedded core control processor to improve system integration, data processing capabilities, the ZigBee uses CC2530 as the hardware foundation to construct ZIGBEE wireless sensor network, and then uses GPRS as the technological manner to remotely convey data transmission and early warning information. The results show that the system is completely functional. And it has versatility and good scalability, can overcome the traditional monitoring method of single function which efficiency is low and cost is high, it can effectively achieve the landslide monitoring and prevention of the adverse geological conditions under the mountains.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134482043","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 propose a novel hybrid Dense-Sparse Network-on-Chip (DSNOC) design that takes advantage of both dense and sparse networks. The NoC paradigm is introduced to solve the communication bottleneck and improve system scalability for multicore processors with hundreds or even thousands of cores. Dense mesh network has been used widely in NoCs due to the simplicity of the design and implementation. However the scalability of dense network can be a bottleneck in systems with high traffic volume. Sparse network has been proposed to provide higher bandwidth and better scalability than the dense network, while the size of the interconnection system becomes impractical for large systems. By combining the benefits of both networks, system performance and efficiency can be improved with a proper hybrid design. We analyse and investigate router utilization and traffic distribution of typical mesh networks. The hybrid solution is explored with theoretical analysis and implementation considerations. Experiments are performed by using a full system simulation environment. The evaluation results show that, compared with the dense network, the average network latency and energy delay product of DSNOC are improved by 10.3% and 33% respectively.
{"title":"DSNOC: A Hybrid Dense-Sparse Network-on-Chip Architecture for Efficient Scalable Computing","authors":"T. Xu, V. Leppänen, M. Forsell","doi":"10.1109/DASC.2013.119","DOIUrl":"https://doi.org/10.1109/DASC.2013.119","url":null,"abstract":"In this paper, we propose a novel hybrid Dense-Sparse Network-on-Chip (DSNOC) design that takes advantage of both dense and sparse networks. The NoC paradigm is introduced to solve the communication bottleneck and improve system scalability for multicore processors with hundreds or even thousands of cores. Dense mesh network has been used widely in NoCs due to the simplicity of the design and implementation. However the scalability of dense network can be a bottleneck in systems with high traffic volume. Sparse network has been proposed to provide higher bandwidth and better scalability than the dense network, while the size of the interconnection system becomes impractical for large systems. By combining the benefits of both networks, system performance and efficiency can be improved with a proper hybrid design. We analyse and investigate router utilization and traffic distribution of typical mesh networks. The hybrid solution is explored with theoretical analysis and implementation considerations. Experiments are performed by using a full system simulation environment. The evaluation results show that, compared with the dense network, the average network latency and energy delay product of DSNOC are improved by 10.3% and 33% respectively.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133941913","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}
Yi Lin, Xiangyang Gong, Wendong Wang, Xinpeng Wei, Lei Zhu
Tunneling technology has been widely applied in the network, but the lack of effective congestion exposure in the tunnel, seriously affect the performance of the tunnel technology. This document will focus on the tunnel scenario, to design a tunnel congestion exposure and feedback model, and the tunnel congestion marking scheme and congestion information feedback scheme. First, the document describes Tunneling Protocol, Secondly describes the congestion problems in the tunnel, Thirdly proposes a basic tunnel congestion exposure model, Finally, proposes the detail of tunnel congestion marking and feedback scheme for the model. Modifying the ECN tunnel rules of RFC3168 and RFC6040, congestion marking scheme can be applied to the feedback model. Congestion feedback scheme use GRE (Generic Routing Encapsulation) header format extension to carry the feedback information. Content and format of Congestion feedback, and the transmission of feedback information are also discussed in the document.
{"title":"Tunnel Congestion Exposure and Feedback","authors":"Yi Lin, Xiangyang Gong, Wendong Wang, Xinpeng Wei, Lei Zhu","doi":"10.1109/DASC.2013.123","DOIUrl":"https://doi.org/10.1109/DASC.2013.123","url":null,"abstract":"Tunneling technology has been widely applied in the network, but the lack of effective congestion exposure in the tunnel, seriously affect the performance of the tunnel technology. This document will focus on the tunnel scenario, to design a tunnel congestion exposure and feedback model, and the tunnel congestion marking scheme and congestion information feedback scheme. First, the document describes Tunneling Protocol, Secondly describes the congestion problems in the tunnel, Thirdly proposes a basic tunnel congestion exposure model, Finally, proposes the detail of tunnel congestion marking and feedback scheme for the model. Modifying the ECN tunnel rules of RFC3168 and RFC6040, congestion marking scheme can be applied to the feedback model. Congestion feedback scheme use GRE (Generic Routing Encapsulation) header format extension to carry the feedback information. Content and format of Congestion feedback, and the transmission of feedback information are also discussed in the document.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129660266","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}
Junshi Wang, Xiaohang Wang, Letian Huang, T. Mak, Guangjun Li
As technology scaling, reliability has became one of the key challenges of Network-on-Chip (NoC). Many fault-tolerant routing algorithms for NoC are developed to overcome fault components and provide reliable transmission. But proposed routing algorithms do not pay enough attention to find the shortest paths, which increases latency and power consumption. In this paper, a fault-tolerant routing algorithm using new component states diffusion method based on Farthest Reachable Router (FRR) is proposed. This algorithm can reduce latency by finding the shortest paths between source and destination routers. Experiment results verify that FRR routing algorithm can tolerate 79% fault patterns within 3 × 3 and reduce latency by 16-44% compared with FON.
{"title":"A Fault-Tolerant Routing Algorithm for NoC Using Farthest Reachable Routers","authors":"Junshi Wang, Xiaohang Wang, Letian Huang, T. Mak, Guangjun Li","doi":"10.1109/DASC.2013.54","DOIUrl":"https://doi.org/10.1109/DASC.2013.54","url":null,"abstract":"As technology scaling, reliability has became one of the key challenges of Network-on-Chip (NoC). Many fault-tolerant routing algorithms for NoC are developed to overcome fault components and provide reliable transmission. But proposed routing algorithms do not pay enough attention to find the shortest paths, which increases latency and power consumption. In this paper, a fault-tolerant routing algorithm using new component states diffusion method based on Farthest Reachable Router (FRR) is proposed. This algorithm can reduce latency by finding the shortest paths between source and destination routers. Experiment results verify that FRR routing algorithm can tolerate 79% fault patterns within 3 × 3 and reduce latency by 16-44% compared with FON.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128893998","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}
Wonsik Lee, Seoungjae Cho, Wei Song, Kyhyun Um, Kyungeun Cho
It is essential for smart house researchers to have large datasets from actual environments. However, not all researchers have sufficient budgets to build test beds. These researchers need a simulator that can synthesize realistic sensory datasets. To solve this problem, we propose the 'UbiSim' simulator for activity recognition research. UbiSim provides a 3D graphical user interface to enable spatial perception using multiple sensors, including those that detect motion, pressure, vibration, temperature, and contact, along with RFID tags and receivers. The sensors are designed to verify collisions in a virtual space as a means to operate with minimal computational costs. Our proposed methods were tested in a virtual environment. The results show that the smart house simulator achieves real-time performance.
{"title":"UbiSim: Multiple Sensors Mounted Smart House Simulator Development","authors":"Wonsik Lee, Seoungjae Cho, Wei Song, Kyhyun Um, Kyungeun Cho","doi":"10.1109/DASC.2013.105","DOIUrl":"https://doi.org/10.1109/DASC.2013.105","url":null,"abstract":"It is essential for smart house researchers to have large datasets from actual environments. However, not all researchers have sufficient budgets to build test beds. These researchers need a simulator that can synthesize realistic sensory datasets. To solve this problem, we propose the 'UbiSim' simulator for activity recognition research. UbiSim provides a 3D graphical user interface to enable spatial perception using multiple sensors, including those that detect motion, pressure, vibration, temperature, and contact, along with RFID tags and receivers. The sensors are designed to verify collisions in a virtual space as a means to operate with minimal computational costs. Our proposed methods were tested in a virtual environment. The results show that the smart house simulator achieves real-time performance.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"27 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128260335","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 interesting of researchers to develop the scheduling of multiprocessor and distributed system in hard real time embedded systems, we present a new locking protocol called Minimizing multiple-Priority Inversion Protocol (MPIP), in this protocol, we proposed a novel mechanism to turn from preemptive to non-preemptive state to minimize multiple-priority inversion caused by low priority task on local processor. We focus on distributed locking semaphore and we showed its ability to lock the shared memory, thus, working in Multi-processor environment. We assumed all shared resources as global to avoid resource nested. With properties of our protocol, we define a new upper bound blocking time. We submit our proposal to experimental evaluation to compare it with MPCP protocol in term of hard real time schedulability.
{"title":"Minimizing Multiple-Priority Inversion Protocol in Hard Real Time System","authors":"Furkan Rabee, Yong Liao, Maolin Yang","doi":"10.1109/DASC.2013.62","DOIUrl":"https://doi.org/10.1109/DASC.2013.62","url":null,"abstract":"With the interesting of researchers to develop the scheduling of multiprocessor and distributed system in hard real time embedded systems, we present a new locking protocol called Minimizing multiple-Priority Inversion Protocol (MPIP), in this protocol, we proposed a novel mechanism to turn from preemptive to non-preemptive state to minimize multiple-priority inversion caused by low priority task on local processor. We focus on distributed locking semaphore and we showed its ability to lock the shared memory, thus, working in Multi-processor environment. We assumed all shared resources as global to avoid resource nested. With properties of our protocol, we define a new upper bound blocking time. We submit our proposal to experimental evaluation to compare it with MPCP protocol in term of hard real time schedulability.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129082138","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 network consists of a large number of nodes with limited energy. As the wireless sensor nodes' battery cannot be replaced, therefore, reducing energy consumption, improve the node survival rate of the wireless sensor networks is one of the key issues. In this paper after analyzing the present routing protocol based on clustering, it proposes a new improved routing protocol which is cluster-based low-power adaptive routing protocol based on cluster head when transferring data using multi-hop technology in order to evenly assign the cluster head energy and realize load balance. Simulation results show that the improved scheme is better in prolonging the network lifetime.
{"title":"Multi-hop Transmission Applied in Wireless Network","authors":"Wensheng Zou","doi":"10.1109/DASC.2013.143","DOIUrl":"https://doi.org/10.1109/DASC.2013.143","url":null,"abstract":"Wireless sensor network consists of a large number of nodes with limited energy. As the wireless sensor nodes' battery cannot be replaced, therefore, reducing energy consumption, improve the node survival rate of the wireless sensor networks is one of the key issues. In this paper after analyzing the present routing protocol based on clustering, it proposes a new improved routing protocol which is cluster-based low-power adaptive routing protocol based on cluster head when transferring data using multi-hop technology in order to evenly assign the cluster head energy and realize load balance. Simulation results show that the improved scheme is better in prolonging the network lifetime.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123114328","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 network measurement, one-way delay is an important network performance indicators, during the measurement, to synchronize the time of different nodes has a great influence on the results of measurement, especially in the large-scale network measurement. This paper propose a time synchronization stability comparison method based on NTP after research the time synchronization technology. In the one-way delay measurement, in order to eliminate measurement errors caused by the frequency difference between nodes, this paper propose a one-way delay corrective algorithm based on forward and reverse delay measurement after research existing time corrective algorithm. Finally, the measurement platform deployed in Planetlab and measure one-way delay. The measurement select more stable nodes based on NTP stability comparison algorithm, and correct one-way delay measurement results through clock corrective algorithm mentioned above. Experiments show that the results of corrective measurement algorithm are more accurate.
{"title":"The One-Way Delay Measurement Algorithm on to Time Synchronization of NTP","authors":"Ruijie Ou, Wenyu Chen, LinLi Guo, WeiShun Li","doi":"10.1109/DASC.2013.92","DOIUrl":"https://doi.org/10.1109/DASC.2013.92","url":null,"abstract":"In network measurement, one-way delay is an important network performance indicators, during the measurement, to synchronize the time of different nodes has a great influence on the results of measurement, especially in the large-scale network measurement. This paper propose a time synchronization stability comparison method based on NTP after research the time synchronization technology. In the one-way delay measurement, in order to eliminate measurement errors caused by the frequency difference between nodes, this paper propose a one-way delay corrective algorithm based on forward and reverse delay measurement after research existing time corrective algorithm. Finally, the measurement platform deployed in Planetlab and measure one-way delay. The measurement select more stable nodes based on NTP stability comparison algorithm, and correct one-way delay measurement results through clock corrective algorithm mentioned above. Experiments show that the results of corrective measurement algorithm are more accurate.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114743312","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
扫码关注我们
求助内容：
应助结果提醒方式：