{"title":"A Sorted Feedback Non-linear Quantization Algorithm for Lattice Reduction Aided MIMO Detection","authors":"Yanhua Sun, Hao Wang, Yan-hua Zhang","doi":"10.1109/CMC.2010.104","DOIUrl":"https://doi.org/10.1109/CMC.2010.104","url":null,"abstract":"Lattice reduction technology has been proved to improve MIMO system performance recently, but the complexity of optimum quantization algorithm is high due to constellation biased distribution caused by signal transformation. In this paper, a sorted feedback non-linear quantization (SFQ) scheme is proposed, which considers both the border of transformed constellation and the correlations between signal elements, and the elements are selected to be quantized according to quantization errors. The simulation results show that the performance of lattice reduction aided (LRA) MIMO detectors based on the proposed quantization scheme is superior to that of LRA MIMO detectors based on non-sorted feedback and independent element-wise quantization schemes. The proposed algorithm can approach the performance of maximum likelihood detection in polynomial complexity in a flat block fading channel.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133168423","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":"Design of General Chebyshev Filter for Optimizing the Band-Edge Sensitivity","authors":"Yongzhong Zhu, K. Guan","doi":"10.1109/CMC.2010.42","DOIUrl":"https://doi.org/10.1109/CMC.2010.42","url":null,"abstract":"A new technique is presented for maximizing the band-edge selectivity of general Chebyshev filters with minimum filter order. Based on maximizing the band-edge selectivity, the frequencies of extreme values of magnitude characteristic in the stopband are calculated in the closed form. The transmission zeros are obtained by solving a set of non-linear equations. Synthesis and design examples are given to verify the presented procedure.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133824259","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 Sun, Zhenhong Guo, Min-Hsiung Hu, Haixia Zhang, D. Yuan
{"title":"Frame Detection of OFDM System with Periodic Pattern Preamble","authors":"Jian Sun, Zhenhong Guo, Min-Hsiung Hu, Haixia Zhang, D. Yuan","doi":"10.1109/CMC.2010.331","DOIUrl":"https://doi.org/10.1109/CMC.2010.331","url":null,"abstract":"This paper deals with frame detection of OFDM system with periodic pattern preamble transmitted over frequency-selective channels. The systems utilizing such periodic pattern preamble include IEEE 802.11a/g/n and IEEE 802.16, etc. By applying Log-likelihood ratio testing, two different approaches to considering statistical characteristics of channels have been used to derive two simpler frame detectors. Both detectors and their approximation at high signal noise ratio are insensitive to frequency offset and the latter is more computationally effective. An approximated method to analyze statistical characteristics of detector is derived. Neyman-Person rule is used to obtain detection decision threshold. Finally, computer simulations are conducted to evaluate the detection performance of presented detectors.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115381082","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 Model Based on Hybrid Support Vector Machine and Self-Organizing Map for Anomaly Detection","authors":"Fei Wang, Yuwen Qian, Yue-wei Dai, Zhiquan Wang","doi":"10.1109/CMC.2010.9","DOIUrl":"https://doi.org/10.1109/CMC.2010.9","url":null,"abstract":"For solving the problem of less information getting about unknown intrusions in anomaly detection, a model based on hybrid SVM/SOM is proposed. Firstly, C-SVM is used to find out the anomalous connections, and then, a packet filtering scheme is used to remove the known intrusions, which is performed by one-class SVM, after that, the identified unknown intrusions are projected onto the output grid by SOM. Finally, the experimental results, which use kddcup99 dataset, show high detection rate with low false rate and can get more information about the unknown intrusion.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114460093","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 Self-Synchronized Image Hash Algorithm","authors":"Di Wu, X. Niu","doi":"10.1109/CMC.2010.233","DOIUrl":"https://doi.org/10.1109/CMC.2010.233","url":null,"abstract":"Image searching and authentication have become important issues for the digital world. Image hashing technique has been proposed to meet them. In this paper, a self-synchronized image hashing algorithm resistant to rotation is presented. In the algorithm, the features of the image are extracted by Scale Invariant Feature Transform(SIFT) algorithm. Then a cyclic matrix are generated from the features. Thus, the rotation is translated into the elementary transformation of the matrix. At last, the hash value is calculated by the eigenvalue decomposition. Because the eigenvalues are invariant to the elementary transformation, the rotation is compensated. Thus this algorithm is very robust to rotation attack. Benefited from the efficient image representation capability of SIFT, the robustness and discrimination of proposed method are improved. The experimental results prove that the proposed method is robust to the simple attacks.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114960069","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":"SSTM: A State Based IMS Service Triggering Mechanism","authors":"Wang Fangyi, Li Xia, Zou Hua","doi":"10.1109/CMC.2010.297","DOIUrl":"https://doi.org/10.1109/CMC.2010.297","url":null,"abstract":"In the current IP Multimedia Subsystem (IMS), the service triggering is mainly executed by the Serving-Call Session Control Function (S-CSCF) according to the information included in the initial Filter Criteria (iFC) which is stored in the Home Subscriber Server (HSS). In this paper, after analyzing the defects of the current mechanism, we propose a new service triggering mechanism: State based Service Triggering Mechanism (SSTM). It aims at triggering services more dynamically in real time, and decreasing the load of the S-CSCF. In this mechanism, we mainly introduce a User Service Triggering Management entity (USTM) which is in the charge of service triggering according to the service state information returned by ASs. After all of the improvements we have done, this mechanism can easily meet the requirements of providing lots of rich and colorful IMS services, and can effectively prevent the weak point of current IMS static service invocation.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122075012","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":"Unlinkable Multi-party Concurrent Signatures","authors":"X. Tan, Yiming Zhao","doi":"10.1109/CMC.2010.60","DOIUrl":"https://doi.org/10.1109/CMC.2010.60","url":null,"abstract":"The concept of concurrent signatures was first introduced by Chen et al. at Eurocrypt 2004. In a concurrent signature scheme, users produce ambiguous signatures that are only verifiable by the users themselves but not by any other outsiders until the release of an extra secret called the keystone. Once the keystone was released, all the signatures become binding to their signers concurrently and anyone can verify the signatures. Since then, a few concurrent signature schemes have been proposed. Tonien et al. constructed the first multi-party concurrent signature scheme at ISC 2006. In this paper, for the first time we construct an unlinkable multi-party concurrent signature scheme. After the release of the keystone, the concurrent signatures can be converted to ordinary signatures that don’t contain any information of keystone to remain unlinkable. This property offers a stronger notion of anonymity than previous schemes.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124491413","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}
Ying Zhang, Fachao Deng, Zhen Chen, Y. Xue, Chuang Lin
{"title":"UTM-CM: A Practical Control Mechanism Solution for UTM System","authors":"Ying Zhang, Fachao Deng, Zhen Chen, Y. Xue, Chuang Lin","doi":"10.1109/CMC.2010.267","DOIUrl":"https://doi.org/10.1109/CMC.2010.267","url":null,"abstract":"Since emerged in 2004, Unified Threat Management (UTM) has been used widely to enhance network security protection. Typical UTM device integrates multiple security technologies, therefore its control and management involves various interfaces, message formats, communication protocols, and security policies and so on. Therefore, it is a big challenge to design and implement the configuration and management of security technologies in UTM. To address this issue, this paper proposes a practical UTM control mechanism that features ease-to-use, scalability, interoperability, high-efficiency and reliability. The solution, called UTM-Configuration and Management (UTM-CM), has been implemented and its performance was evaluated.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125805339","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":"Application of Probabilistic Decision Fusion to Network Coding over Turbo-Coded Multiple-Access Relay Channels","authors":"Lun-Chung Peng, K. Lay","doi":"10.1109/CMC.2010.144","DOIUrl":"https://doi.org/10.1109/CMC.2010.144","url":null,"abstract":"This paper proposes a scheme for combining the soft decisions made in network coding. The soft decisions are expressed in the form of probabilities. We call our scheme of combining those probabilistic soft decisions by the name of “probabilistic decision fusion.” This scheme can improve the BER (bit error rate) performance in network coding in general. In particular, we apply it to a turbo-coded multiple access relay channel (MARC) to show its effectiveness. Three systems found in the literature are used for comparison with our scheme. Experimental results show that the incorporation of probabilistic decision fusion lowers the BER indeed, as compared to reference schemes.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124888595","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 Improved OFDM Channel Estimation Based on CMMB","authors":"Fuyuan Lai, Xiaobo Jiang, C. Liang","doi":"10.1109/CMC.2010.153","DOIUrl":"https://doi.org/10.1109/CMC.2010.153","url":null,"abstract":"In this paper, the OFDM channel estimate method based on China Mobile Multimedia Broadcasting (CMMB) system is investigated. Wireless communication systems incorporating coherent OFDM requires the estimation and tracking of the time-varying channel response for accurate demodulation of data at the receiver. In pilot-symbol-assisted (PSA) OFDM systems, the MMSE estimator is a good channel estimation technique given that channel statistics are known. However, the major drawback of the MMSE estimator is its high computational complexity, which grows with number of pilots. The LMMSE estimator has lower computational complexity than the MMSE, and better performance than the LS. However, the LMMSE estimator directly applied for CMMB system performances worse than the LS. In comprehensive consideration of performance and computational complexity, an improved method is proposed. Simultaneously, the improved DFT-based estimator is simplified. The simulation is based on CMMB system. Simulation results show that our improved channel estimator performs better than the original one.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129787745","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}