Privacy protection attracts more and more attention from researchers to users. Due to the unreliability of mobile devices which often leads confidential information such as personal trajectory data divulged. We propose a new trajectory privacy protection method based on Semantic Anonymity Proxy proved to have some excellent characteristics. We alter the traditional ways which used to rely on the center anonymous server, adopting semantic anonymity and proxy request to construct the SAP tree on account of background map model to satisfy the location based services. The comparative results have shown that the new method achieves better performance than the classic ways on higher efficiency and quality.
{"title":"A Trajectory Preserving Method Based on Semantic Anonymity Proxy","authors":"Meng Li, Sheng Cao, Zhiguang Qin","doi":"10.1109/DASC.2013.31","DOIUrl":"https://doi.org/10.1109/DASC.2013.31","url":null,"abstract":"Privacy protection attracts more and more attention from researchers to users. Due to the unreliability of mobile devices which often leads confidential information such as personal trajectory data divulged. We propose a new trajectory privacy protection method based on Semantic Anonymity Proxy proved to have some excellent characteristics. We alter the traditional ways which used to rely on the center anonymous server, adopting semantic anonymity and proxy request to construct the SAP tree on account of background map model to satisfy the location based services. The comparative results have shown that the new method achieves better performance than the classic ways on higher efficiency and quality.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"39 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":"116020465","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}
The purpose of this paper is to give an overview of simulation credibility, Verification, Validation and Accreditation (VV&A), and present a comprehensive life cycle of Credibility Assessment Scale (CAS), assessment methods, the types of interfacing system elements, and the weighting methods. The CAS help the simulation practitioners in defining the requirements, establishing conceptual model, designing the simulation system, investigating solution techniques, programming the simulation model, designing experiments, experimenting, redefining the model, and presenting the simulation results. Practitioners can follow the CAS procedure presented herein and increase the credibility in conducting a simulation study.
{"title":"Research on Assessment Theory of Simulation Credibility","authors":"Zhiwu Guo","doi":"10.1109/DASC.2013.122","DOIUrl":"https://doi.org/10.1109/DASC.2013.122","url":null,"abstract":"The purpose of this paper is to give an overview of simulation credibility, Verification, Validation and Accreditation (VV&A), and present a comprehensive life cycle of Credibility Assessment Scale (CAS), assessment methods, the types of interfacing system elements, and the weighting methods. The CAS help the simulation practitioners in defining the requirements, establishing conceptual model, designing the simulation system, investigating solution techniques, programming the simulation model, designing experiments, experimenting, redefining the model, and presenting the simulation results. Practitioners can follow the CAS procedure presented herein and increase the credibility in conducting a simulation study.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"32 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":"124785940","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}
Yulong Wang, Xiaoxiang Wang, Mingming Li, Zhiguo Liu
Multimedia Broadcast/Multicast Service (MBMS) uses point-to-multipoint transmission mode, which can effectively improve the frequency utilization efficiency of the mobile communication system and becomes a hot research field of mobile communication. However, as the frequency selectivity of the wireless channel, the throughput of the MBMS system is always limited by the user with the worst channel quality. In order to overcome the frequency selective fading, resource allocation methods is widely studied in the research. In this paper, the improved resource allocation algorithm based on user QoS is proposed. Firstly, the subcarriers are allocated according the users' urgency degree guaranteeing the QoS of all users, Secondly, the remaining subcarriers are allocated by the throughput maximization rule, Finally, the system throughput is further improved by the bit loading step with greedy algorithm. Simulation result shows that the proposed resource allocation scheme cannot effectively guarantee the QoS of all users in the group, but also can improve the system throughput as much as possible.
{"title":"A Resource Allocation Scheme for MBMS with QoS Guarantees","authors":"Yulong Wang, Xiaoxiang Wang, Mingming Li, Zhiguo Liu","doi":"10.1109/DASC.2013.125","DOIUrl":"https://doi.org/10.1109/DASC.2013.125","url":null,"abstract":"Multimedia Broadcast/Multicast Service (MBMS) uses point-to-multipoint transmission mode, which can effectively improve the frequency utilization efficiency of the mobile communication system and becomes a hot research field of mobile communication. However, as the frequency selectivity of the wireless channel, the throughput of the MBMS system is always limited by the user with the worst channel quality. In order to overcome the frequency selective fading, resource allocation methods is widely studied in the research. In this paper, the improved resource allocation algorithm based on user QoS is proposed. Firstly, the subcarriers are allocated according the users' urgency degree guaranteeing the QoS of all users, Secondly, the remaining subcarriers are allocated by the throughput maximization rule, Finally, the system throughput is further improved by the bit loading step with greedy algorithm. Simulation result shows that the proposed resource allocation scheme cannot effectively guarantee the QoS of all users in the group, but also can improve the system throughput as much as possible.","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":"125380114","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}
Interoperability between heterogeneous objects of Internet of Things (IoT) and massive data generated in the course of processing bring enormous challenges to application development of Internet of Things. To accommodate changeful application requirements of Internet of Things, a cloud-based development platform for services and bundles is proposed. On the basis of the analysis of cloud-based development, web services and Open Service Gateway Initiative (OSGi) bundles, the design principles and architecture of our platform are specified. After key designs are introduced, our prototype implementation and its evaluation are presented. Our targeted prototype provides a collaborative platform and highly available storage in cloud, both of which are proved to be feasible.
物联网异构对象之间的互操作性以及处理过程中产生的海量数据给物联网的应用开发带来了巨大的挑战。为适应物联网多变的应用需求，提出了一种基于云的服务和包开发平台。在分析基于云的开发、web服务和OSGi (Open Service Gateway Initiative)包的基础上，明确了平台的设计原则和架构。在介绍了关键设计方案后，给出了我们的原型实现和评价。我们的目标原型提供了一个协作平台和高可用的云存储，两者都被证明是可行的。
{"title":"A Cloud-Based Development Platform for Services and Bundles of Internet of Things","authors":"Yingyi Yang, Jin Yang, Fagui Liu, Qingyang Duan","doi":"10.1109/DASC.2013.93","DOIUrl":"https://doi.org/10.1109/DASC.2013.93","url":null,"abstract":"Interoperability between heterogeneous objects of Internet of Things (IoT) and massive data generated in the course of processing bring enormous challenges to application development of Internet of Things. To accommodate changeful application requirements of Internet of Things, a cloud-based development platform for services and bundles is proposed. On the basis of the analysis of cloud-based development, web services and Open Service Gateway Initiative (OSGi) bundles, the design principles and architecture of our platform are specified. After key designs are introduced, our prototype implementation and its evaluation are presented. Our targeted prototype provides a collaborative platform and highly available storage in cloud, both of which are proved to be feasible.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"14 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":"121841249","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}
The knowledge on the internet is uncertain, quickly updated and from multi-sources. The information we extract from a field in webpages is usually one-sided and contains incorrect data. This paper proposed an algorithm to extract data from internet web pages or text documents by using the association strength. The algorithm combines knowledge extraction method of the text mining with the technology of the intelligence analysis to the data. It uses ontology theory to describe the knowledge, and automatically extract the knowledge from the web pages or text documents which is returned by the search engine.
{"title":"A Method of Field Recognizing Based on Association Strength","authors":"Yang Liu, Lingyu Xu, Jie Yu, Yunlan Xue, Han Dong","doi":"10.1109/DASC.2013.90","DOIUrl":"https://doi.org/10.1109/DASC.2013.90","url":null,"abstract":"The knowledge on the internet is uncertain, quickly updated and from multi-sources. The information we extract from a field in webpages is usually one-sided and contains incorrect data. This paper proposed an algorithm to extract data from internet web pages or text documents by using the association strength. The algorithm combines knowledge extraction method of the text mining with the technology of the intelligence analysis to the data. It uses ontology theory to describe the knowledge, and automatically extract the knowledge from the web pages or text documents which is returned by the search engine.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"17 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":"114658582","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}
Friend recommendation is a fundamental problem in online social networks, which aims to recommend new links for each user. In this paper, a new methodology based on graph topology and artificial bee colony is proposed to effective friend recommendation in social networks. In proposed approach, a sub-graph of network is composed by the study user and all the other connected users separately by three degree of separation from the root user. The proposed recommendation system computes four parameters within the generated sub-graph, and suggests the new links for the root user. Artificial bee colony is applied to optimize the relative importance of the weights of each parameter. To verify the proposed methodology, we chose a graph with 1000 members from YouTube. We considered the 20% of all links within the network graph to learning the system using artificial bee colony algorithm. These links were removed from the graph, and a data was generated by using all candidate nodes within the resulted graph, to be a recommend. Then, the generated data were divided into training set and evaluation set. Obtained results demonstrated the robustness of proposed approach with a 36% return rate.
{"title":"Graph-Based Friend Recommendation in Social Networks Using Artificial Bee Colony","authors":"Fatemeh Akbari, A. Tajfar, A. F. Nejad","doi":"10.1109/DASC.2013.108","DOIUrl":"https://doi.org/10.1109/DASC.2013.108","url":null,"abstract":"Friend recommendation is a fundamental problem in online social networks, which aims to recommend new links for each user. In this paper, a new methodology based on graph topology and artificial bee colony is proposed to effective friend recommendation in social networks. In proposed approach, a sub-graph of network is composed by the study user and all the other connected users separately by three degree of separation from the root user. The proposed recommendation system computes four parameters within the generated sub-graph, and suggests the new links for the root user. Artificial bee colony is applied to optimize the relative importance of the weights of each parameter. To verify the proposed methodology, we chose a graph with 1000 members from YouTube. We considered the 20% of all links within the network graph to learning the system using artificial bee colony algorithm. These links were removed from the graph, and a data was generated by using all candidate nodes within the resulted graph, to be a recommend. Then, the generated data were divided into training set and evaluation set. Obtained results demonstrated the robustness of proposed approach with a 36% return rate.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"35 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":"114765098","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}
Yuki Mizutani, Manabu Sato, Yuusuke Kawakita, H. Ichikawa
Energy harvesting wireless sensors are driven by electric power extracted from hidden environmental source of energy, such as imperceptible vibrations of walls and floors. It has been shown that radio transmitter system can be powered by energy harvesters with substituting ring for crystal oscillators, which, however, causes frequency instability in oscillator. In order to receive message from such sensors, a receiver must be able to accurately detect transmitted frequencies that may differ among respective sensors. Fast wideband radio frequency sensing schemes using filter-based energy detectors were proposed. These schemes were designed to detect radio devices operating according to known specifications, this paper proposes a dynamic spectrum sensing scheme using a fast fourier transform (FFT) based energy detector for radio devices without knowing radio frequencies. The experimental and theoretical results of this study demonstrate that dynamic spectrum sensing with an FFT-based energy detector can retrieve signal frequencies faster than traditional schemes. It is also shown that it is possible to calculate a suitable set of parameters for minimizing the total sensing time associated with any given pairing of frequency missing rate and resolution.
{"title":"Dynamic Spectrum Sensing for Energy Harvesting Wireless Sensor","authors":"Yuki Mizutani, Manabu Sato, Yuusuke Kawakita, H. Ichikawa","doi":"10.1109/DASC.2013.101","DOIUrl":"https://doi.org/10.1109/DASC.2013.101","url":null,"abstract":"Energy harvesting wireless sensors are driven by electric power extracted from hidden environmental source of energy, such as imperceptible vibrations of walls and floors. It has been shown that radio transmitter system can be powered by energy harvesters with substituting ring for crystal oscillators, which, however, causes frequency instability in oscillator. In order to receive message from such sensors, a receiver must be able to accurately detect transmitted frequencies that may differ among respective sensors. Fast wideband radio frequency sensing schemes using filter-based energy detectors were proposed. These schemes were designed to detect radio devices operating according to known specifications, this paper proposes a dynamic spectrum sensing scheme using a fast fourier transform (FFT) based energy detector for radio devices without knowing radio frequencies. The experimental and theoretical results of this study demonstrate that dynamic spectrum sensing with an FFT-based energy detector can retrieve signal frequencies faster than traditional schemes. It is also shown that it is possible to calculate a suitable set of parameters for minimizing the total sensing time associated with any given pairing of frequency missing rate and resolution.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"112 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":"114405293","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}
Short-term load forecasting plays a very important role in operating, controlling, and planning of power system. As the load forecasting is vulnerable to various environmental factors, the short-term load forecasting is uncertain and variable. The traditional single forecasting model used to forecast the load of power grid can't comply with the requirements of the power grid management. Combination forecasting model can largely make up for the one-sidedness of the single forecasting methods. In the implementation of combination model, the fixed load forecasting methods also make forecasting results inaccurate, and have a series of problems such as low credibility. In this paper, the thought of dynamic combination is applied in the orderly power consumption management platform, and a combined optimal forecasting model is constructed through automatic screening of the forecasting methods and dynamic collocation of weights. Practice has proved that the combined forecasting method has higher forecasting accuracy than the single forecasting method and it is not only has high forecasting accuracy, but also has good extendibility, quick speed of data processing, simplicity of operation and diversity of display mode.
{"title":"Study and Application of Dynamic Collocation of Variable Weights Combination Forecasting Model","authors":"Ning Cao, J. Huang, Xiaocheng Xie","doi":"10.1109/DASC.2013.97","DOIUrl":"https://doi.org/10.1109/DASC.2013.97","url":null,"abstract":"Short-term load forecasting plays a very important role in operating, controlling, and planning of power system. As the load forecasting is vulnerable to various environmental factors, the short-term load forecasting is uncertain and variable. The traditional single forecasting model used to forecast the load of power grid can't comply with the requirements of the power grid management. Combination forecasting model can largely make up for the one-sidedness of the single forecasting methods. In the implementation of combination model, the fixed load forecasting methods also make forecasting results inaccurate, and have a series of problems such as low credibility. In this paper, the thought of dynamic combination is applied in the orderly power consumption management platform, and a combined optimal forecasting model is constructed through automatic screening of the forecasting methods and dynamic collocation of weights. Practice has proved that the combined forecasting method has higher forecasting accuracy than the single forecasting method and it is not only has high forecasting accuracy, but also has good extendibility, quick speed of data processing, simplicity of operation and diversity of display mode.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"129 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":"114568878","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}
Satellite network has played an important role in providing multicast services for its ability of wide coverage. The performance of satellite multicast can be improved if multi-layer Satellites are used in the architecture. In this paper, combining LEO satellites' advantages on transmitting real-time information with GEO's ability of big computing, a GEO/LEO Double-Layer Multicast Routing Algorithm (DLMRA) is introduced. Using the logical location concept to calculate the first added destination, take the permanent of link into account, our algorithm aims to minimize cost of multicast trees, under the condition of the available bandwidth bound and multicast tree delay bound. Simulation results demonstrate that the performance benefits of the proposed DLMRA in terms of the tree delay, the bandwidth cost by comparison with the other algorithms proposed before.
{"title":"A Multicast Routing Algorithm for GEO/LEO Satellite IP Networks","authors":"Chao Yuan, Xiaoxiang Wang","doi":"10.1109/DASC.2013.132","DOIUrl":"https://doi.org/10.1109/DASC.2013.132","url":null,"abstract":"Satellite network has played an important role in providing multicast services for its ability of wide coverage. The performance of satellite multicast can be improved if multi-layer Satellites are used in the architecture. In this paper, combining LEO satellites' advantages on transmitting real-time information with GEO's ability of big computing, a GEO/LEO Double-Layer Multicast Routing Algorithm (DLMRA) is introduced. Using the logical location concept to calculate the first added destination, take the permanent of link into account, our algorithm aims to minimize cost of multicast trees, under the condition of the available bandwidth bound and multicast tree delay bound. Simulation results demonstrate that the performance benefits of the proposed DLMRA in terms of the tree delay, the bandwidth cost by comparison with the other algorithms proposed before.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"66 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":"114579060","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：