{"title":"Loopy Belief Propagation Algorithm in Distributed Wireless Cooperative Spectrum Sensing","authors":"Xiang Fan, Zhiping Shi","doi":"10.1109/CMC.2011.103","DOIUrl":"https://doi.org/10.1109/CMC.2011.103","url":null,"abstract":"Considering the date fusion in distributed cognitive radio networks, this paper studies the loopy belief propagation (LBP) algorithm to make the data fusion in distributed network with loops, and also gives a weighted modified LBP. This paper considers the effect of a shadow fading in the wireless channel model, and also exists malicious nodes, which may give the false result. The key idea is to model the network of secondary users as Markov random fields and to apply the loopy belief propagation algorithm or the weighted loopy belief propagation algorithm to facilitate decision fusion in a distributed manner. The paper shown that weighted LBP can solve the deep shadow fading and malicious nodes more effectively. Finally, a simulation with MATLAB has been done and verifies the results.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132899844","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":"Throughput Analysis in Cooperative Sensing Networks over Imperfect Reporting Channel","authors":"Weiwei Cui, Haifeng Zhao, X. Mu","doi":"10.1109/CMC.2011.23","DOIUrl":"https://doi.org/10.1109/CMC.2011.23","url":null,"abstract":"Spectrum sensing is an essential functionality that enables cognitive radios (CR) to detect spectral holes and to opportunistically use under-utilized frequency bands without causing harmful interference to primary users. In this paper, we study the fundamental tradeoff between sensing capability and achievable throughput of CR users. By assuming the reporting channel is a binary symmetric channel (BSC) with an error probability, the problem of throughput tradeoff is investigated and the relationship between the throughput, the sensing time and the number of cognitive radios is researched. By simulation we can know that the throughput becomes a single peak function with the increasing number of cognitive radios and that the performance of cooperative spectrum sensing is limited by the probability of reporting errors.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114783703","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":"FFT-HQ Channel Estimating Algorithm in MB-OFDM UWB System","authors":"Jianqiang Li, Zhihua Bao, Shibing Zhang","doi":"10.1109/CMC.2011.97","DOIUrl":"https://doi.org/10.1109/CMC.2011.97","url":null,"abstract":"Channel estimation is an essential technique for the orthogonal frequency division multiplexing (OFDM) based ultra-wide band (UWB) system. In this paper, a novel channel estimating method, fast Fourier transform-Hannan-Quinn(FFT-HQ) algorithm, is proposed. Based on the estimated channel response, the algorithm weighted the eigenvalue of the estimated channel response and obtained the length of rectangular window. Therefore, the windowed UWB channel response is found. The simulations showed that the FFT-HQ algorithm has 1~2 dB margins over FFT-based algorithm.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123483182","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":"Practicality Analysis of the Self-Healing Group Key Distribution Schemes for Resource-Constricted Wireless Sensor Networks","authors":"Qiuhua Wang","doi":"10.1109/CMC.2011.113","DOIUrl":"https://doi.org/10.1109/CMC.2011.113","url":null,"abstract":"A number of self-healing group key distribution schemes have been proposed recently, however, though practicality analysis and simulation of the commonly used self-healing group key distribution schemes, we show that almost none of the existing schemes are suitable for large-scale and resource-constricted wireless sensor networks in real-world applications, and it is still an urgent requirement to develop an efficient self-healing group key distribution scheme with robust security, tolerant communication and storage overhead simultaneously for resource-constricted wireless sensor networks.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123705087","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":"Research on the Improvements on Atallah's Algorithm: A New Improved Algorithm on Atallah","authors":"Shan Liu, Lijun Cao, Maohua Liu, J. Liu","doi":"10.1109/CMC.2011.45","DOIUrl":"https://doi.org/10.1109/CMC.2011.45","url":null,"abstract":"In this paper, we give a new algorithm evolving from Atallah's algorithm proposed in 1984, and we make many improvements: First, combining replaced sewing in order to simplify the third step, Second, we delete the fourth step. And we simplify the construction of the auxiliary graph, avoiding the second time to find Euler tour and the introduction of a mass storage array. The improvements make it quicker and simpler to find the Euler tour of an Euler graph, and the improvements don't increase time and space complexity of Atallah's algorithm.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124040042","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":"Improving Data Transmission in Web Applications via the Translation between XML and JSON","authors":"Guanhua Wang","doi":"10.1109/CMC.2011.25","DOIUrl":"https://doi.org/10.1109/CMC.2011.25","url":null,"abstract":"This paper analyzes the form of two data serializing approaches used in web applications, XML and JSON. Considering that though both widely used, highly-efficient data transmission between these two methods is still a problem in application development. The features of these two data objects were analyzed and it was point out that how to translate correctly between these two objects. A recursive algorithm used to translate between these two types of data serializing forms was given based on the multi-tree data structure of XML and JSON objects. The efficiency of this algorithm was proved by translation experiments. When applied in web applications, this paper gives how to add the translation method in system structures of the applications. It gives how this method can improve system structure and the performance of the web applications.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130019061","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":"Observation and Analysis on Spam Sending Behavior","authors":"Chun-Chao Yeh, Tsung-Yu Wang, H. Fu","doi":"10.1109/CMC.2011.128","DOIUrl":"https://doi.org/10.1109/CMC.2011.128","url":null,"abstract":"Due to Internet, people prefer using emails instead of traditional post mails, because of its simple and easy to use. Meanwhile unsolicited emails (spam) become a serious problem, as sending bulk emails are almost cost free in terms of time and money. Spam not only reduces system performance of mail servers but also annoys mail receivers. Nowadays attacks from Internet usually have strong links with embedding malicious codes/links in spam mails. In this research study, we collected a large number of spam to observe and analyze spam sending behavior. For each spam, we gathered source IPs, the URLs in the spam, and web pages of the URL. Basing on the collected spam, we studied the spam sending behavior.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128783598","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":"Elastic Wave Signal Attenuation Characteristics in Layered Earth Channel","authors":"Jianjun Hao, Yuan Zhao","doi":"10.1109/CMC.2011.129","DOIUrl":"https://doi.org/10.1109/CMC.2011.129","url":null,"abstract":"In this paper, by analyzing the principles of elastic wave propagation in earth crust layer, the total attenuation model of longitudinal wave in simplified parallel layered earth medium channel is achieved, then a parallel layered channel and quasi-parallel layered channel model developed respectively. The propagation simulation is carried out using ray-trace method, the results show: (1) attenuation degraded with the incident angle increased, (2) whether in parallel layered earth medium or quasi-parallel earth medium, the variation of incident angle has slight effect on transmission attenuation, but can cause an enlarged arrived position offset, (3) medium absorption attenuation is lower than interface reflection loss of about 20dB at frequency of 1500Hz.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126821767","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":"Power Consumption of Virtual Machine Live Migration in Clouds","authors":"Qiang Huang, Fengqian Gao, Rui Wang, Zhengwei Qi","doi":"10.1109/CMC.2011.62","DOIUrl":"https://doi.org/10.1109/CMC.2011.62","url":null,"abstract":"Virtualization Technology has been employed increasingly widely in modern data centers in order to improve its energy efficiency. In particular, the capability of virtual machine(VM) migration brings multiple benefits for such as resources(CPU, memory, et al.) distribution, energy aware consolidation. However, the migration of virtual machines itself brings extra power consumption. For this reason, a better understanding of its effect on system power consumption is highly desirable. In this paper, we present a power consumption evaluation on the effects of live migration of VMs. Results show that the power overhead of migration is much less in the scenario of employing the strategy of consolidation than the regular deployment without using consolidation. Our results are based on the typical physical server, the power of which is linear model of CPU utilization percentage.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125629233","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":"High-Speed Architecture Design and Implementation for SMS4-GCM","authors":"Meng Zhao, Guochu Shou, Yihong Hu, Zhigang Guo","doi":"10.1109/CMC.2011.66","DOIUrl":"https://doi.org/10.1109/CMC.2011.66","url":null,"abstract":"A new and high-efficiency encryption and authentication algorithm, SMS4-GCM, based on cryptographic algorithm SMS4 and block cipher operating mode GCM is proposed. Design using full pipeline architecture and implementation on FPGA are presented in detail, and the results show that the maximal processing rate of SMS4-GCM can reach up to 22.248 Gbps which can meet the demands of high-speed network's applications.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128078307","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}