{"title":"Distributed Cluster-Based Fault-Tolerant Topology Control for Space Information Networks","authors":"Ning Ye, Zhiliang Zhu, Jun Liu, Jiping Shi","doi":"10.1109/CYBERC.2010.46","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.46","url":null,"abstract":"Space information networks are a new type of self-organizing networks constituted by communication and information systems of land, sea, air and space. The performances of space information networks are closely related to their distinguishing characteristics such as large scale, high component complexity and high link redundancy. The paper proposed a distributed cluster-based and fault-tolerant topology control algorithm to construct a more efficient and failure-resistant topology for space information networks. Within each cluster, nodes discover local topology and compute appropriate transmitted powers reaching all nodes in their close vicinity through k optimal vertex-disjoint paths to achieve k-connectivity of the whole cluster. Between each pair of adjacent clusters, k disjoint links connecting the two clusters are maintained by finding out optimal matching of weighted bipartite graphs formed by topology of border nodes and their connections, which arranges inter-cluster relaying optimally. In the third phase, nodes adjust their transmitted power according to the logical topology generated by intra-cluster and inter-cluster topology control. Simulation results show performances such as invulnerability, reliability and validity are enhanced under the proposed topology control algorithm.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127693496","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}
Jian Wang, Xiumei Wu, Na Guo, C. Ullrich, Heng Luo
{"title":"Discouraging Improper Exploitation against Seeds in BitTorrent Swarms","authors":"Jian Wang, Xiumei Wu, Na Guo, C. Ullrich, Heng Luo","doi":"10.1109/CYBERC.2010.50","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.50","url":null,"abstract":"Bit Torrent is arguably the most prevalent file sharing protocol on the Internet. In Bit Torrent swarms, seeds usually offer file chunks for free and thus induce free-riding behavior. Some anti-Bit Torrent companies even launch targeted attacks against the seeds. This paper proposes a batch mechanism for proper functioning of the seeds. It applies symmetric-key encryption and chunk mixing to plain chunks of the file, and enforces chunk recipients to do exchanges before they are able to obtain plain chunks. As a result, free-riding behavior and malicious attacks are discouraged. Also, the robustness of the batch mechanism is analyzed in detail under both fully and partial colluding scenarios.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133447717","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}
{"title":"Swarm-Based Knowledge Discovery for Intrusion Behavior Discovering","authors":"Xiaohui Cui, Justin M. Beaver, T. Potok","doi":"10.1109/CYBERC.2010.56","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.56","url":null,"abstract":"In this research, we developed a technique, the Swarm-based Visual Data Mining approach (SVDM), that will help user to gain insight into the Intrusion Detection System (IDS) alert event data stream, come up with new hypothesis, and verify the hypothesis via the interaction between the human and the system. This novel malicious user detection system can efficiently help security officer detect anomaly behaviors of malicious user in the high dimensional time dependent state spaces. This system's visual representations exploit the human being's innate ability to recognize patterns and utilize this ability to help security manager understand the relationships between seemingly discrete security breaches.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132126097","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}
{"title":"Orthogonal Modulation Based Cross-Layer Approach for Energy Efficiency in Wireless Sensor Networks","authors":"Qiuling Tang, Huan Wen, Changyin Sun, L. Deng","doi":"10.1109/CYBERC.2010.32","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.32","url":null,"abstract":"Energy conservation is a critical problem in wireless sensor networks (WSNs). Cross-layer design can provide energy efficiency through joint energy management and optimization. In this paper, based on two orthogonal modulation schemes- frequency shift keying (FSK) and pulse position modulation (PPM), we put forward a multi-layer energy efficiency optimal joint design approach for WSNs. Considering one of main parameters of modulation – constellation size as global variable, the design unifies the energy-efficient factors in hardware layer, link layer, MAC layer and routing layer, which accordingly include battery discharge nonlinearity, node circuit multi-mode operation, signal low-power transmit, a variable-length TDMA scheme and multi/single-hop routing. The total energy consumption across the layers and its minimization problem are hence formulated. Then, a string-star hybrid network derived from controlled deployments is taken as an example to numerically analyze and optimize the design. The results show that PPM-based design is more energy-efficient than FSK-based design in all our observed deployment scenarios. The energy-saving can be up to 75% for PPM-based design and 51% for FSK-based design, respectively.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123366835","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}
{"title":"Adaptive Routing in Delay-Tolerant Mobile Sensor Network","authors":"B. Wu, F. Lin, Jiliu Zhou","doi":"10.1109/CYBERC.2010.24","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.24","url":null,"abstract":"Pervasive information gathering has became more and more important in people’s daily life during the last decade. However, in some critical network scenarios such as Delay-Tolerant Mobile Sensor Network (DT-MSN), due to the sparse connectivity, node mobility and limited buffer, the traditional approaches for collecting information application may not work effectively without a stable end-to-end path from sensor nodes to the sink. In this paper, we propose a new carrier-based routing scheme based on nodal mobility pattern, named SAR-DM (Self-Adaptive Routing for DT-MSN). In our scheme, the popular areas that sensor nodes visit, called hotspots, are classified dynamically, and each class is attached with a mobile-assisted carrier to help data transmission between nodes and sink. We provide an analysis of the regularity of nodes movement by replaying real mobility model. The simulation results show that our scheme performs better than Message Ferry approach, and adapts well under different circumstances.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122963680","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}
{"title":"Standard Additive Model in Data Mining","authors":"Do-Thanh Sang, Dong-Min Woo, Dong-Chul Park","doi":"10.1109/CYBERC.2010.16","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.16","url":null,"abstract":"The habitual purpose of data mining is prediction, one of the most direct real-world applications. There are many technologies available to data mining in literature and they achieved some results with reasonable accuracies. This paper designs and implements an advanced model based on fuzzy inference system, namely Standard Additive Model (SAM) for forecasting the output of any record given the input variables only from the database, the age of abalone in particular. SAM offers an optimum solution for the prediction and can be definitely an alternative approach for conventional models such as neural networks. The experimental result comparison to multi-layer perceptron neural network (MLPNN) is provided in same context.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122520392","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}
{"title":"An IPv6-Based Traffic Balancing Scheme for Multiple Mobile Data Collectors in Wireless Sensor Networks","authors":"Wanming Luo, Baoping Yan, Jiliang Wu","doi":"10.1109/CYBERC.2010.25","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.25","url":null,"abstract":"The converge cast traffic pattern ???many-to-one data communication??? of wireless sensor networks leads to high load at nodes that are aggregating data. Therefore, we need to distribute the entire traffic load by deploying multiple data collectors and each node should select a collector node to access. Additionally, with the progress of IPv6-based wireless sensor networks, advantages of IPv6 protocols can be considered to address the above problem. In this paper, we propose an IPv6-based traffic balancing scheme for multiple mobile data collectors in wireless sensor networks, which can distribute the traffic load on multiple mobile data collectors based on IPv6 any cast and pseudo-mobility (IPv6APM). The scheme has the advantages of seamless compatibility with current protocol, higher scalability, short delay time, no topological constraint compared to other approaches. We also present our simulation work and discuss performance comparison between the scheme and other load balancing mechanisms. The results show that the scheme has very advanced performance and scalability.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129328695","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}
{"title":"A Distributed Text Mining System for Online Web Textual Data Analysis","authors":"Bin Zhou, Yan Jia, Chunyang Liu, Xu Zhang","doi":"10.1109/CYBERC.2010.11","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.11","url":null,"abstract":"Real world Web mining applications usually have different requirements, such as massive data processing, low system latency, and high scalability. In order to meet these different requirements, we proposed a distributed text mining system with a layered architecture that divides the system functions into three layers, namely, the crawling and storage layer, the basic mining layer, and the analysis service layer. Message-oriented middleware are used between these layer components and services to make the communication in a loosely-coupled way. To conquer the data-intensive and storage failure problems, a distributed file system is used to store and manage the raw text data and various indexes. As a case study and example, the design and implementation of an experimental online topic detection application, which can be scaled to handle thousands of Internet news and forum channels and perform online analysis, is also discussed.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128845906","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}
{"title":"An Efficient Tree-Based Geocast Routing Algorithm for Connecting Heterogeneous Networks","authors":"Yi Zhao, Xingming Wang, Ung Heo, Jaeho Choi","doi":"10.1109/CYBERC.2010.67","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.67","url":null,"abstract":"This paper describes a new tree-based routing method which can be used to connect heterogeneous networks. In the proposed method, a source node located in one network sends packets to a group of nodes in another network. In our scenario, a source node normally belongs to a mobile ad hoc network, while a group of nodes consists of sensor nodes in the specified geographical region. The source node sends a packet to destination nodes in order to aggregate sensor data. Our protocol attains energy efficiency and accuracy by incorporating a metric for constructing the tree according to routes. The metric is calculated using parameters such as power and neighborhood connectivity. Before constructing a tree, hello messages are sent, depending on local mobility, for updating the list of neighbors. After constructing the tree, the link lifetime is evaluated periodically in order to maintain the freshness of a link along the route. In order to verify the performance of the proposed scheme, we conducted a set of computer simulations using the OPNET modeler. We measured the performance of the system in terms of delay, packet loss and accuracy of packet delivery. Results are compared to those of a conventional method. The results show that the proposed method improves efficiency by as much as 20% compared with that of a conventional method.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121285863","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}
{"title":"3D Fuzzy Vault Based on Palmprint","authors":"Hailun Liu, Dongmei Sun, Ke Xiong, Z. Qiu","doi":"10.1109/CYBERC.2010.49","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.49","url":null,"abstract":"Biometric cryptosystem has emerged as a promising solution in information security. Fuzzy vault is a widely accepted scheme that binding biometric data and cryptography effectively. In vault encoding, random chaff points which are not on the polynomial are added to protect genuine points. In vault decoding, query biometric data is generated to retrieve the genuine points by measuring the distance between the registered data and query data. However, because of the within-class differences and randomness of chaff points, it is difficult to distinguish the genuine data from chaff data. This paper proposes a novel 3D fuzzy vault scheme that selects unused data from template feature vector and inserts it into the genuine points. In our scheme, every point in the vault has three dimensions, two of which could be used for distance measurement. The precision of the data matching is improved by the new inserted data and genuine points could be recognized more accurately. Experimental results based on HA-BJTU database show the better performances compared to traditional fuzzy vault.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129379260","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}