A novel simulation framework based on Service-Oriented Architecture(SOA) is proposed to meet the new requirements for simulation compos ability, this framework is open and is propitious to integration with other systems. A simulation platform is constructed using component-based software engineering to test the feasibility of SOA-based framework, the implementation of simulation service layer and simulation application layer of simulation platform are also expatiated in details. As a case study, a simulation context for warfare simulation is conducted and experiment results shows that this platform provides the capability of simulation compos ability and reuse ability in the level of binary code.
{"title":"SOA-Based Simulation Framework: A Way to Simulation Composability","authors":"Yang Shi, D. Zhang, M. Xiao, Ming-hua Lu","doi":"10.1109/CyberC.2012.46","DOIUrl":"https://doi.org/10.1109/CyberC.2012.46","url":null,"abstract":"A novel simulation framework based on Service-Oriented Architecture(SOA) is proposed to meet the new requirements for simulation compos ability, this framework is open and is propitious to integration with other systems. A simulation platform is constructed using component-based software engineering to test the feasibility of SOA-based framework, the implementation of simulation service layer and simulation application layer of simulation platform are also expatiated in details. As a case study, a simulation context for warfare simulation is conducted and experiment results shows that this platform provides the capability of simulation compos ability and reuse ability in the level of binary code.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"33 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":"124766507","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}
Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. To design a data aggregation scheme, delay and energy efficiencies are two crucial issues that require much consideration. In this paper, we propose a distributed, energy-efficient algorithm for collecting data from all sensor nodes with minimum latency called Delay-minimized Energy-efficient Data Aggregation algorithm (DEDA). The DEDA algorithm minimizes data aggregation latency by building a delay-efficient network structure. At the same time, it also considers the distances between network nodes for saving sensor transmission power and network energy. Energy consumption is also well-balanced between sensors to achieve an acceptable network lifetime. The simulation results show that the scheme could significantly decrease data aggregation delay and obtain a reasonable network lifetime compared with other approaches.
{"title":"Delay-minimized Energy-efficient Data Aggregation in Wireless Sensor Networks","authors":"Huu Nghia Le, V. Zalyubovskiy, Hyunseung Choo","doi":"10.1109/CyberC.2012.73","DOIUrl":"https://doi.org/10.1109/CyberC.2012.73","url":null,"abstract":"Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. To design a data aggregation scheme, delay and energy efficiencies are two crucial issues that require much consideration. In this paper, we propose a distributed, energy-efficient algorithm for collecting data from all sensor nodes with minimum latency called Delay-minimized Energy-efficient Data Aggregation algorithm (DEDA). The DEDA algorithm minimizes data aggregation latency by building a delay-efficient network structure. At the same time, it also considers the distances between network nodes for saving sensor transmission power and network energy. Energy consumption is also well-balanced between sensors to achieve an acceptable network lifetime. The simulation results show that the scheme could significantly decrease data aggregation delay and obtain a reasonable network lifetime compared with other approaches.","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":"127697430","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}
A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments like civil and military applications. The data collected by each sensor is communicated through the network to a single processing centre called base station that uses all reported data to determine characteristics of the environment or detect an event. Clustering sensors into groups, so that sensors communicate information only to local cluster-heads and then the cluster heads communicate the aggregated information to the processing center, may save a lot of energy. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transferred to the base station. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios Enhanced LEACH protocol (En-LEACH) has been adaptable to handle non-uniform energy distribution characteristic of a dynamic sensor network.
{"title":"Design and Evaluation of En-LEACH Routing Protocol for Wireless Sensor Network","authors":"Suyog Pawar, Prabha Kasliwal","doi":"10.1109/CyberC.2012.89","DOIUrl":"https://doi.org/10.1109/CyberC.2012.89","url":null,"abstract":"A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments like civil and military applications. The data collected by each sensor is communicated through the network to a single processing centre called base station that uses all reported data to determine characteristics of the environment or detect an event. Clustering sensors into groups, so that sensors communicate information only to local cluster-heads and then the cluster heads communicate the aggregated information to the processing center, may save a lot of energy. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transferred to the base station. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios Enhanced LEACH protocol (En-LEACH) has been adaptable to handle non-uniform energy distribution characteristic of a dynamic sensor network.","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":"130205973","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}
Wang Chunlei, Fang Lan, Dai Yi-qi, Ming Liang, Miao Qing, Wang Dongxia
Network survivability has the characteristics of complexity, dynamic evolution and uncertainty, which has become one of the most important indicators of evaluating network performance. Network survivability evaluation is a process of confirming the degree to which the network survivability technology and mechanism can defend network threats. Firstly, it needs to extract useful information from the actual system and establish the model, then the model is analyzed and necessary information is extracted. Finally, the survivability characteristics of the network can be measured and evaluated based on the model and extracted information. Current network security research lacks of models and methods which guide network survivability evaluation effectively. In this paper, we firstly describe the elements of network survivability evaluation model and their relationships, then propose a network survivability evaluation model based on evolutionary computation which includes the immune evolutionary algorithm for network survivability metric weight solving and network survivability evaluation method based on multiple criteria decision making. Finally, the correctness and effectiveness of the proposed model is validated through experimental analysis.
{"title":"Network Survivability Evaluation Model Based on Immune Evolution and Multiple Criteria Decision Making","authors":"Wang Chunlei, Fang Lan, Dai Yi-qi, Ming Liang, Miao Qing, Wang Dongxia","doi":"10.1109/CYBERC.2012.37","DOIUrl":"https://doi.org/10.1109/CYBERC.2012.37","url":null,"abstract":"Network survivability has the characteristics of complexity, dynamic evolution and uncertainty, which has become one of the most important indicators of evaluating network performance. Network survivability evaluation is a process of confirming the degree to which the network survivability technology and mechanism can defend network threats. Firstly, it needs to extract useful information from the actual system and establish the model, then the model is analyzed and necessary information is extracted. Finally, the survivability characteristics of the network can be measured and evaluated based on the model and extracted information. Current network security research lacks of models and methods which guide network survivability evaluation effectively. In this paper, we firstly describe the elements of network survivability evaluation model and their relationships, then propose a network survivability evaluation model based on evolutionary computation which includes the immune evolutionary algorithm for network survivability metric weight solving and network survivability evaluation method based on multiple criteria decision making. Finally, the correctness and effectiveness of the proposed model is validated through experimental analysis.","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":"117016895","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}
Cloud Computing is a model that habilitates the access to a group of computer services that are offered according to the needs of the users. Also, layers have been developed in order to sectorize and manage the offered services while maintaining the interrelation between the layers by using ontologies. Referring to the above-mentioned, we suggest creating a new layer in cloud computing that enables you to manage user log-ins to applications that are housed in the cloud. User management is developed through ontologies using the axioms that identify the privileges that users have, the axioms are represented in Ontology Web Language (OWL) and Resource Description Framework (RDF).
{"title":"Service Layer and Axioms for User Access to the Cloud by Means of Ontologies","authors":"Lilliam N. Robinson-Oses, Miguel Vargas-Lombardo","doi":"10.1109/CyberC.2012.27","DOIUrl":"https://doi.org/10.1109/CyberC.2012.27","url":null,"abstract":"Cloud Computing is a model that habilitates the access to a group of computer services that are offered according to the needs of the users. Also, layers have been developed in order to sectorize and manage the offered services while maintaining the interrelation between the layers by using ontologies. Referring to the above-mentioned, we suggest creating a new layer in cloud computing that enables you to manage user log-ins to applications that are housed in the cloud. User management is developed through ontologies using the axioms that identify the privileges that users have, the axioms are represented in Ontology Web Language (OWL) and Resource Description Framework (RDF).","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"78 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":"126948892","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 focuses on I/O optimizations of N-hybrid (New-Form of hybrid), which provides a hybrid file system space constructed on SSD and HDD. Although the promising potentials of SSD, such as the absence of mechanical moving overhead and high random I/O throughput, have drawn a lot of attentions from IT enterprises, its high ratio of cost/capacity makes it less desirable to build a large-scale data storage subsystem composed of only SSDs. In this paper, we present N-hybrid that attempts to integrate the strengths of SSD and HDD, to offer a single, large hybrid file system space. Several experiments were conducted to verify the performance of N-hybrid.
本文主要研究N-hybrid (New-Form of hybrid)的I/O优化，它提供了一个在SSD和HDD上构建的混合文件系统空间。虽然SSD没有机械移动开销和高随机I/O吞吐量等优点吸引了IT企业的关注，但其高成本/容量比使得仅由SSD组成的大规模数据存储子系统不太可取。在本文中，我们提出了N-hybrid，它试图集成SSD和HDD的优势，以提供一个单一的、大的混合文件系统空间。通过实验验证了n -杂交种的性能。
{"title":"Exploiting the Effect of NAND Flash-Memory SSD on Filesystem Design","authors":"Jaechun No, Sung-Soon Park","doi":"10.1109/CyberC.2012.93","DOIUrl":"https://doi.org/10.1109/CyberC.2012.93","url":null,"abstract":"This paper focuses on I/O optimizations of N-hybrid (New-Form of hybrid), which provides a hybrid file system space constructed on SSD and HDD. Although the promising potentials of SSD, such as the absence of mechanical moving overhead and high random I/O throughput, have drawn a lot of attentions from IT enterprises, its high ratio of cost/capacity makes it less desirable to build a large-scale data storage subsystem composed of only SSDs. In this paper, we present N-hybrid that attempts to integrate the strengths of SSD and HDD, to offer a single, large hybrid file system space. Several experiments were conducted to verify the performance of N-hybrid.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"30 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":"121737020","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}
Several studies abound on electromagnetic field (EMF) radiation and its adverse impact on human health with majority of the conclusions resulting from these studies being positive. To this end, a number of sources have been identified to emit levels of EMF radiation such as power transmission lines, base transmitter stations (BTS), mobile phones and many household appliances, some of which have been classified as extremely low frequency (ELF) non-ionizing radiating devices. The global system of mobile telecommunications (GSM) revolution supports to a large extent the proliferation of mobile phones and random BTS siting in developing countries of which EMF emissions can assume very dangerous dimensions for human health. This study is undertaken to investigate the dilemma posed by wireless telecommunication devices that emit EMF radiations e.g. mobile phones and its transceivers, as against their relevance. Correlations were arrived at concerning their indirect effects on human health, from which possible safety measures were proposed and relevant suggestions made.
{"title":"Electromagnetic Wave Effect on Human Health: Challenges for Developing Countries","authors":"B. Anyaka, U. B. Akuru","doi":"10.1109/CyberC.2012.81","DOIUrl":"https://doi.org/10.1109/CyberC.2012.81","url":null,"abstract":"Several studies abound on electromagnetic field (EMF) radiation and its adverse impact on human health with majority of the conclusions resulting from these studies being positive. To this end, a number of sources have been identified to emit levels of EMF radiation such as power transmission lines, base transmitter stations (BTS), mobile phones and many household appliances, some of which have been classified as extremely low frequency (ELF) non-ionizing radiating devices. The global system of mobile telecommunications (GSM) revolution supports to a large extent the proliferation of mobile phones and random BTS siting in developing countries of which EMF emissions can assume very dangerous dimensions for human health. This study is undertaken to investigate the dilemma posed by wireless telecommunication devices that emit EMF radiations e.g. mobile phones and its transceivers, as against their relevance. Correlations were arrived at concerning their indirect effects on human health, from which possible safety measures were proposed and relevant suggestions made.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"67 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":"115149606","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}
E. Canedo, Rafael Timóteo de Sousa Júnior, R. D. O. Albuquerque, Fábio L. L. Mendonça
Cloud computing is being progressively adopted in different business scenarios in order to obtain flexible and reliable computing environments, with several supporting solutions available in the market. Computing systems trust representation have been widely discussed and applied in a lot of information technology scenarios, becoming subject of scientific researches. This paper proposes the development of a trust model to ensure a reliable files exchange among nodes in a private cloud, as well as the calculation process of trust among them, according to the established metrics. The simulation result using CloudSim framework shows the effectiveness of the model in selecting more reliable node in private cloud.
{"title":"File Exchange in a Private Cloud Supported by a Trust Model","authors":"E. Canedo, Rafael Timóteo de Sousa Júnior, R. D. O. Albuquerque, Fábio L. L. Mendonça","doi":"10.1109/CyberC.2012.23","DOIUrl":"https://doi.org/10.1109/CyberC.2012.23","url":null,"abstract":"Cloud computing is being progressively adopted in different business scenarios in order to obtain flexible and reliable computing environments, with several supporting solutions available in the market. Computing systems trust representation have been widely discussed and applied in a lot of information technology scenarios, becoming subject of scientific researches. This paper proposes the development of a trust model to ensure a reliable files exchange among nodes in a private cloud, as well as the calculation process of trust among them, according to the established metrics. The simulation result using CloudSim framework shows the effectiveness of the model in selecting more reliable node in private cloud.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"52 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":"122196197","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}
Coalitions, which allow traders to form teams, can sometimes accomplish tasks more efficiently than individuals. The core has become a popular solution concept in economic applications for researchers in Computer Science, because it provides a way to find stable sets. However, its problems hinder researchers from applying it to a real world market. This paper proposes a new Core Broking Model (CBM), which is based on the core and adopts some other solution concepts to resolve group trading problems in emarkets. It involves bundle selling of composite services from several service providers, offering amount discounts in group buying in the e-marketplace. The CBM successfully creates a win-win-win situation for customers, providers and brokers in e-markets. The comparison between the results of the new model and the core shows that the CBM is superior to the core when applied in e-markets. The results of the simulation presented in this paper demonstrate that the CBM can attract customers and deal with online group trading problems in a large coalition. An extensive evaluation of the CBM has been made and shows that it is effective and efficient.
{"title":"A Core Broking Model for E-Markets","authors":"P. Sun, M. Odetayo, R. Iqbal, Anne E. James","doi":"10.1109/CyberC.2012.49","DOIUrl":"https://doi.org/10.1109/CyberC.2012.49","url":null,"abstract":"Coalitions, which allow traders to form teams, can sometimes accomplish tasks more efficiently than individuals. The core has become a popular solution concept in economic applications for researchers in Computer Science, because it provides a way to find stable sets. However, its problems hinder researchers from applying it to a real world market. This paper proposes a new Core Broking Model (CBM), which is based on the core and adopts some other solution concepts to resolve group trading problems in emarkets. It involves bundle selling of composite services from several service providers, offering amount discounts in group buying in the e-marketplace. The CBM successfully creates a win-win-win situation for customers, providers and brokers in e-markets. The comparison between the results of the new model and the core shows that the CBM is superior to the core when applied in e-markets. The results of the simulation presented in this paper demonstrate that the CBM can attract customers and deal with online group trading problems in a large coalition. An extensive evaluation of the CBM has been made and shows that it is effective and efficient.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116088789","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
扫码关注我们
求助内容：
应助结果提醒方式：