{"title":"Performance evaluation of active queue management using a hybrid approach","authors":"Chin-ling Chen, Chia-Chun Yu","doi":"10.4304/jcp.7.5.1196-1203","DOIUrl":"https://doi.org/10.4304/jcp.7.5.1196-1203","url":null,"abstract":"We propose a hybrid active queue management (AQM) scheme, Proportional Rate-based Control (PRC), which aims to maintain the queue length around the target level by 1) dropping the packet whose arrival rate exceeding maximum desired rate; 2) using virtual queue to control the packet whose arrival rate above minimum desired rate. We compare the performance of PRC through simulation with several well-known AQM schemes such as RED, DRED, SRED, AVQ and VRC. The study shows that the proposed scheme is more effective at stabilizing the queue size and has lower loss rate than others. Another appealing feature of the proposed scheme is that the system responds quickly and accurately to changing network conditions.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132764370","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":"Analysis and application of environment-aware access control model","authors":"Lijun Dong, Xiaojun Kang, Jun Song","doi":"10.1109/CYBERC.2009.5342194","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342194","url":null,"abstract":"Traditionally access control models focus on access decisions by the static attributes such as identities, group names, memberships, and so on. Some dynamic outside environment factors are ignored. In this paper, we introduce the EAAC model which extends traditional RBAC to include the notion of both environments and behaviors by introducing a new conception that embodies the dynamic environmental factors. The basic analysis and application of EAAC is discussed in this paper. We bring forward a formalized tool based on Petri net, by which an instance of our prototype is analyzed.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772857","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":"The application of the data mining based on adaptive immune algorithm for power transformer, fault diagnosis","authors":"Lin Jikeng, Wu Congmin, Wang Dongtao","doi":"10.1109/CYBERC.2009.5342144","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342144","url":null,"abstract":"Adaptive Immune Algorithm based data mining (AIA-Data Mining) is presented for fault diagnosis of power transformer. The information entropy is used for the production of the initial population, which leads to convergence speed of the algorithm to be faster than that of the initial population produced by random. On the basis of that, the bi-level search Mechanism of the AIA further speeds up extraction of the decision-making table for the transformer fault diagnosis from the samples. Results from examples show that the method proposed is effective and feasible.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"383 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132779008","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":"Reed-Solomon feasibility in mobile transport","authors":"S. Siikavirta, J. Manner, Le Wang","doi":"10.1109/CYBERC.2009.5342179","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342179","url":null,"abstract":"Forward error corrections have taken much attention lately due the invention of the patented LT- and Raptor-codes. With these new class of forward error corrections, it is possible to encode and decode data in linear running time. Reed-Solomon however is relatively slow to calculate both on the encoding and decoding side. But Reed-Solomon has it's own benefits: it's free of patents, several implementations exists and it does not need more redundant data than the erasure percentage, so it performs optimally when we consider network usage. In this paper we evaluate the Reed-Solomon algorithm usage for mobile device transport protocols. Paper presents comprehensive analysis of speed and energy consumption of the Reed-Solomon in mobile device. There is also analysis of memory usage and algorithm requirements for the protocol. Our results shows that it is possible to use Reed-Solomon scheme as a transport layer erasure correction even on mobile phones without special-purpose hardware.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128964000","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":"ANN-based data mining for the detection of the most influential variables causing mismatch of super-heater outlet temperatures in a thermo-plant","authors":"Lin Jikeng, W. Xudong, S. Tso","doi":"10.1109/CYBERC.2009.5342152","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342152","url":null,"abstract":"ANN-based data-mining techniques are introduced to detect the most influential variables causing the mismatch of super-heater outlet steam temperatures. The strategies are: (1) Rough set selection: the rough variables set most likely to have possible effects on the mismatch of the outlet steam temperatures is deduced from about 3000 variables available in the power system data-base, by correlation analysis.(2) Relation capturing with ANN: the variables in the rough set are used as the input of an ANN, with the samples being appropriately chosen to train the ANN. (3) Sensitivity calculation of each ANN input for each training sample. (4) Influential variables set extraction: the criterion is to derive the sub-set characterized by the outstanding variables with the largest average of absolute sensitivity values. The influential variable set thus obtained, not intuitively known prior to the investigation, is found to be consistent with the general understanding of the power-plant engineers.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115633044","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":"Modeling the contexts without distracting the perspectives of the agents in distributed reasoning","authors":"Kyung Wook Baek, C. H. Lyu, S. Han, H. Youn","doi":"10.1109/CYBERC.2009.5342176","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342176","url":null,"abstract":"Context-awareness service is one of the key features of ubiquitous paradigm. To intelligently and sensitively deal with the dynamic environment, a methodology effectively enabling the agent-based distributed reasoning needs to be developed. The existing modeling approaches focus on scenario-based acquisition, management, and representation of context. However, they are difficult to be adapted to agent-based distributed reasoning. In this paper we propose a modeling approach for distributed reasoning which permits merging of different perspectives of context models without the distraction of individual aspects. Moreover, a context-awareness engine is developed to support agent-based context-awareness service. The effectiveness of the proposed methodology is verified by computer simulation which reveals that the proposed approach allows much more accurate and stable reasoning than the earlier scheme.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128487755","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 fully robust fuzzy extractor","authors":"Yang Bo, Sun Aidong, Zhang Wenzheng","doi":"10.1109/CYBERC.2009.5342191","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342191","url":null,"abstract":"Cryptography traditionally relies on uniformly distributed and precisely reproducible random strings for its secrets, however, it is difficult to create, store, and reliably retrieve such strings. To securely derive cryptographic keys from a noisy input such as biometric data, two primitives are introduced by Y. Dodis et.al.: a secure sketch which allows recovery of a noisy input given a “close” approximation thereof, and a fuzzy extractor which extracts a uniformly distributed string from this noisy input in an error-tolerant manner. Both primitives work by constructing a “public” string which is used to encode the information needed for error-tolerant reconstruction of the original input and subsequent extraction. The public string, when transmitted over an insecure channel or stored in an insecure storage, can be modified by an adversary. A robust secure sketch and a robust fuzzy extractor mean that the public string can be authenticated by a receiver, if the authenticity of public string is verified by using, in some way, recovered string in secure sketch or extracted string in fuzzy extractor, we say that the authentication has circularity in it. In this paper, we propose a fully robust fuzzy extractor based on an error-correcting code, in which the public string can be authenticated by the receiver using his own a part of string that is close to sender's string under some metric, thus the circularity in authentication can be broken fully. The security is proven in standard model.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126714807","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":"DERACL: A distributed energy-efficient routing algorithm based on cross-layer design","authors":"Feng Zheng, Hanrong Lu, Weijiang Wang, Qiang Sun","doi":"10.1109/CYBERC.2009.5342199","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342199","url":null,"abstract":"This paper proposes a distributed energy-efficient routing algorithm for mobile Ad Hoc networks (MANETs). We adopt the cross-layer design paradigm. The distance from the source node to the destination node is estimated based on the received signal strength indication(RSSI) of the packets and is used to adaptively adjust the backoff time of the MAC layer. A distance threshold and a packet count threshold are used to schedule the transmissions of packets in the Network layer. The algorithm is distributed and works without needing any global network information or control packet. Experimental results show that the routing algorithm is energy-efficient and drastically alleviates the Broadcast Storm Problem.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123073113","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":"Exponential random geometric graph process models for mobile wireless networks","authors":"Y. Shang","doi":"10.1109/CYBERC.2009.5342212","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342212","url":null,"abstract":"In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential first order autoregres-sive (AR(1)) process. The transition probability matrix and stationary distribution are derived for the Markov chains in terms of network connectivity and the number of components. We characterize an algorithm for the hitting time regarding disconnectivity. In addition, we also study static topological properties including connectivity, degree distributions and the largest nearest neighbor distance associated with the random graph process. Both closed form results and limit theorems are provided.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115501203","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":"The implementation and performance analysis of mobile multicast in WLAN, environments","authors":"Xin Li, Jianfeng Guan, Huachun Zhou, Yajuan Qin, Hong-ke Zhang","doi":"10.1109/CYBERC.2009.5342173","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342173","url":null,"abstract":"With the development of Mobile IPv6 and multicast technology, mobile multicast becomes a research hotspot. Based on two basic mobile multicast methods, the Bi-directional Tunnel (BT) method and the Remote Subscription (RS) method, some mobile multicast schemes have been proposed. However, most of them evaluate the performance by means of analysis and simulation, but lack of testing the performance in a real test-bed. So in this paper, we implemented several mobile multicast schemes and evaluated their performance in our test-bed. The experimental results show that (1) the mobility management protocols have an important impact on the BT-based methods; (2) the distribution of multicast delivery tree affects the performance of RS-based methods.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127502092","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}