{"title":"A blind identify algorithm for weak signals in chaotic noise","authors":"Wang Yingchun, Zhou Yefei, Zhou Chenghua","doi":"10.1109/CYBERC.2009.5342187","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342187","url":null,"abstract":"For a kind of weak harmonic wave signal in chaotic noise, this paper proposes a new blind identify algorithm which based on generalized regression neural network (GRNN) to estimate parameters of chaotic system, and then apply reiteration blind deconvolution method to remove remains noise in the system, and extract weak signal from chaotic background. From 2597 observation points, we obtain mean deviation as 0.0112, and peak value signal-noise ratio as −44.77dB. Simulation result shows efficiency of the algorithm.","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":"130944147","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":"Time synchronization with fast asynchronous diffusion in wireless sensor network","authors":"Jonggoo Bae, B. Moon","doi":"10.1109/CYBERC.2009.5342158","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342158","url":null,"abstract":"Time Synchronization is the most important component in wireless sensor network (WSN). Since, it improves energy efficiency, lifetime, robustness, precision and so on. The final goal of WSN is Smart Dust. So, WSN devices can't use expensive crystals. Although diversity algorithms were proposed for Time Synchronization, most of the algorithm have disadvantage when they get out from their assumptions. Especially, Byzantine Failure and malicious node occurred in local environment, make a bad effect on time synchronization. Therefore, we need to consider time synchronization in global aspect to avoid environment problems. This paper proposes the supplement algorithm for time synchronization in global aspect, and evaluates the algorithms with NS2. This performance is better by 10 percents than existing algorithm.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"43 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":"116715478","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":"Protect digital images based on matrix norm quantization of digital, watermarking algorithm","authors":"Liu Xin, Lv Xiaoqi, Luo Qiang","doi":"10.1109/CYBERC.2009.5342154","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342154","url":null,"abstract":"As a protection and authentication technology, digital watermarking technology has been used in the image field. In this paper, a digital watermarking algorithm is proposed based on integer wavelet transform to protect digital images and estimate its integrity and authenticity. Using matrix norm quantization, watermarks are embedded into low-frequency, medium-frequency and high-frequency detail sub-bands of images' integer wavelet domain. Based on this, we develop a blind-testing watermarking algorithm. Experimental results show that the developed algorithm achieves robustness and sensitivity. It can also exactly locate the distorted area. Therefore, this is an effective multiple digital watermarking algorithm.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"19 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":"128993757","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 experimental data reorganization and information synthesis: Take radiation refrigeration experiment for example","authors":"Li Xianxia, D. Hua, Li Ying, Wang Xiao","doi":"10.1109/CYBERC.2009.5342181","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342181","url":null,"abstract":"Experimental data mining is very important in the information discovery. Lots of data analysis is conducted in order to build the relative expression or correlation. However, the implicit parameters or implicit procedure parameters are usually ignored because a number of clear functions about the data exist. In fact, some new knowledge desired for the specific physical process and properties can be gotten by rebuilding the relationship among the experiment data. This paper presents a new data mining method to analysis the data completely and precisely, Data Reorganization and Information Synthesis, and its effect is proved through an actual experiment, radiation refrigeration experiment.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"4 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":"127616972","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}
Hongju Cheng, Guolong Chen, N. Xiong, Xiaofang Zhuang
{"title":"Static channel assignment algorithm in multi-channel wireless mesh networks","authors":"Hongju Cheng, Guolong Chen, N. Xiong, Xiaofang Zhuang","doi":"10.1109/CYBERC.2009.5342166","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342166","url":null,"abstract":"In this paper we have considered the channel assignment problem in multi-channel multi-radio wireless mesh networks. The problem is to assign channels to links in the network with the original topology preservation, and aim at minimizing the overall network interference which is proved to be NP-hard. We have first illustrated that the conversion from the channel assignment problem to the Max k-cut or Min k-partition problem cannot correctly evaluate the network interference because of the broadcasting characteristic of the wireless communication in wireless networks. In this paper we have developed a centralized heuristic algorithm for the channel assignment due to the NP-hardness of the problem. Extensive simulation results have demonstrated that our algorithm has good performance in both dense and sparse networks compared with related works. The theoretic and experiment results have shown that the proposed algorithms serve as a practical solution to the channel assignment problem in the multi-channel multi-radio wireless mesh networks.","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":"115441788","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 single-antenna dual-carrier selection technique for frequency selective fading channels","authors":"Jingli Li, Gang Zhao, Xiangqian Liu","doi":"10.1109/CYBERC.2009.5342193","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342193","url":null,"abstract":"This paper presents a novel diversity technique for single-antenna systems in frequency-selective channels. Assuming that the channel band is divided into multiple subchannels, symbols are transmitted on two frequency hopped subchannels simultaneously. To keep the total transmission power constant, the signal power in each of the two subchannels is reduced to half of what would be in single channel transmission. At the receiver selection diversity is collected by decoding the subchannel with a large gain. Furthermore, channel diversity can be obtained by combining complex-field coding (CFC) with the dual carrier selection design. We show that the effect of our design is similar to that of orthogonal frequency division multiplexing (OFDM), but ours achieves higher data transmission rate and collects selection diversity at the expense of increased implementation complexity. Numerical simulations are provided to validate the theoretical analysis.","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":"125561812","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":"Geometric form diagnosis of Ni60 alloy by laser cladding based on fuzzy neural network","authors":"S. Gao, Yefei Zhou, Chenghua Zhou","doi":"10.1109/CYBERC.2009.5342186","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342186","url":null,"abstract":"Geometric form of Ni60 alloy fabricated by laser cladding is analyzed by a new diagnosis algorithm in which Back-propagation is combined with fuzzy classifier. In some complexity environments, the classic BP neural network appears limitation in classification. The proposed approach in this paper uses fuzzy model to the neural network structure. It considers classify variance and energy function to adjust convergence of the network. With the improved nonlinear mapping property, the proposed approach achieves perfect results with change all this term to identification ratio of 100% in our experiments, while that of the classical experiment is 57% accordingly.","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":"129947208","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":"Lifetime-aware geographic routing in wireless sensor networks","authors":"Gang Zhao, Jingli Li, Xiangqian Liu, Anup Kumar","doi":"10.1109/CYBERC.2009.5342185","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342185","url":null,"abstract":"Maximizing the lifetime of wireless sensor networks under constrained resources is an interesting problem that has gained increasing attention. Most methods assume an ideal link layer model when increasing the lifetime of wireless sensor networks and energy saving techniques using geographic routing remains largely unexplored. Based on a realistic link layer model, we propose a novel geographic routing algorithm to prolong the lifetime of wireless sensor networks. In our method, a packet is forwarded to the optimal neighbor by evaluating of each neighbor's characteristic based on four important factors: PRR (Packet Reception Rate), forwarding history, progress and remaining energy. Simulation and comparison results show that our algorithm can greatly increase the lifetime of wireless sensor networks.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"49 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":"132733799","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":"Three dimensional node positioning algorithm for wireless sensor networks","authors":"Wenhui Zhao, Yu Jiang, Daxin Liu","doi":"10.1109/CYBERC.2009.5342150","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342150","url":null,"abstract":"Many applications of wireless sensor network are applied in three dimensional environments. The primary problem to be solved in these applications is three dimensional nodes positioning. In this paper, a new range-free three dimensional node positioning algorithm is proposed to address this problem. The implementation of the new algorithm is introduced. Simulation results show the new algorithm can accomplish node positioning process in three dimensional environments with low average positioning error.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"48 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":"130940138","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 novel mobile IPv6 header compression algorithm of wireless sensor network","authors":"Yang Xue-zhou, Tang Zhi-ling, Li Si-min","doi":"10.1109/CYBERC.2009.5342208","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342208","url":null,"abstract":"This paper proposes a novel mobile IPv6 header compression algorithm based on the draft RFC4944 issued by IETF. The algorithm improves the compression ratio of the IPv6 header through address assignment and coding arithmetic. The simulation shows that the compression rate can reach to 98.5% which is much better than the method proposed by the draft RFC4944. By taking audio transmission as the example to test, it is proved that the algorithm supports real-time traffic of mobile wireless sensor network (WSN).","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"28 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":"114375276","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}