{"title":"Bayesian Mixture Model for Features-Preservation Clustering","authors":"Xinming Guo","doi":"10.1109/ICCSN.2009.138","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.138","url":null,"abstract":"The paper introduces feature preservation clustering which can handle the problems of privacy preservation and distributed computing. First, the Bayesian Mixture Model(BMM) are stated and some terminologies are de-fined. Second, Variational approximation inference for BMM is stated in detail. Third, base on the variational approximation inference, we design a distributed and paralleled algorithm for features preservation clustering.Finally, some datasets from UCI are chosen for experiment,Compared with K-means, the results show BMM algorithm does work better and BMM can work distributed and parallelled,so BMM can protect privacy information more and can save time.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128834394","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}
Xiaoqiang Qiao, Hang-sheng Zhao, Yusheng Li, Yongxiang Liu
{"title":"A New Iterative Channel Estimation Scheme for V-BLAST MIMO-OFDM Systems","authors":"Xiaoqiang Qiao, Hang-sheng Zhao, Yusheng Li, Yongxiang Liu","doi":"10.1109/ICCSN.2009.61","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.61","url":null,"abstract":"A new iterative channel estimation scheme for V-BLAST MIMO-OFDM systems is proposed in this paper. The channel estimation consists of two parts. Firstly, we use pilot-symbol-aided (PSA) method to interpolate the channel, and get the initial channel estimation of the systems. Then, with Turbo iterative decoding, we feedback the information bits to the channel estimator and the EM algorithm is used for iterative channel estimation. The simulation results show that the channel estimation performance of the systems is improved greatly as the number of iterations increases.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123315067","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 P2P Security Model Based on Trust and Availability","authors":"Liu Yihe","doi":"10.1109/ICCSN.2009.27","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.27","url":null,"abstract":"In order to overcome the existing deficiencies that studies pure trust mechanism in the current P2P research, the concept of the availability grade and the reputation grade such as the subject and the object are introduced. A new P2P access control model based on trust and availability is defined, which strategies are compatible and expansion of the existing access control strategy, by used the existing access control strategies and model ideas, and it applies to any of the P2P network environment. It is a security model after analysis and discussion, which is positive on researched on the P2P access control.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115930596","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 Scalable and Cooperative Caching Scheme in a Distributed VOD System","authors":"Jing Li, Jian Yang, H. Xi","doi":"10.1109/ICCSN.2009.98","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.98","url":null,"abstract":"In distributed streaming media server clusters, by adopting cooperative caching technique, the free cache memory of all the servers in the cluster can be used more efficiently. It will help raise the hit rate of the cache and reduce disk accesses, resulting in the improvement of the overall throughput of cluster. In this paper, a novel distributed caching model called Scalable and Cooperative Caching (SCC) is presented. SCC makes use of each server to perform the caching task and redirects the request to the proper server in the cluster to make the cache scheme more efficient. This way, SCC can provide high scalability and throughput in clustered servers with a reasonably small amount of communication among hosts. Simulation results show that SCC is an effective caching strategy providing significant performance gains in clustered video servers.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125366424","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":"Optimal Structure Analysis for Ubiquitous Access of Mobile Collectors in Clustered Sensor Networks","authors":"Bo Sun, Canfeng Chen, Jian Ma","doi":"10.1109/ICCSN.2009.68","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.68","url":null,"abstract":"One important application of wireless sensor networks is data storage for the ubiquitous access of mobile collectors. Events are detected and their readings are disseminated in the sensor network, where sensors store the coded form of received data for the access of mobile collectors. Clustering is an effective method to reduce the data dissemination cost in this application. In clustered networks, data are only disseminated inside cluster, and sensors encode the data of its own cluster. However, the probability of recovering all the original data decreases in clustered networks. This paper first analyzes the optimal network structure to minimize the overall energy consumption of sensor network under the constraint of successful decoding probability. An optimization model is proposed and equal clustered networks are strictly proved to be optimal in our model. We also prove that clustering sharply decreases the successful data decoding probability, and show that increasing the mobile collector’s sample size will significantly improve the decoding efficiency.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126551960","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}
Wenjun Liu, Yue Sun, Yang Bai, Jiguo Yu, Baoxiang Cao
{"title":"DCR: An Energy-Efficient Distributed Clustering and Routing Protocol for Wireless Sensor Networks","authors":"Wenjun Liu, Yue Sun, Yang Bai, Jiguo Yu, Baoxiang Cao","doi":"10.1109/ICCSN.2009.175","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.175","url":null,"abstract":"In resent years many routing protocols have been proposed for wireless sensor networks, among which the adaptive routing protocols are very attractive because their low routing overhead. In this paper we propose an energy efficient distributed clustering and routing protocol (DCR). It mainly includes distributed nodes clustering and distributed multi-hop routing. In clustering stage, we introduce an uneven clustering mechanism. Cluster heads which are closer to the base station (BS) have smaller cluster size than those farther from BS, thus they can preserve some energy for the inter-cluster data forwarding. In distributed routing stage, each cluster head chooses its next-hop neighbor for inter-cluster communication independently according to the distance to BS and its residual energy. The simulation results demonstrate that DCR significantly minimizes energy consumption of nodes and extends the network lifetime compared with some existing clustering protocols.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598369","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}
S. V. Viraktamath, G. V. Attimarad, V. Gejji, Ravi H.
{"title":"Error Control Mechanisms using CODEC","authors":"S. V. Viraktamath, G. V. Attimarad, V. Gejji, Ravi H.","doi":"10.1109/ICCSN.2009.142","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.142","url":null,"abstract":"Today’s communication system is susceptible to many types of errors and interferences. There are different types of error detection and correction mechanisms proposed by many authors. One of the important methods of error control is by means of encoding/decoding techniques at source/destination. In this context, we propose an evaluation process of convolutional encoder and decoder (CODEC), for the various constraint lengths and for different generator polynomials, for the given messages considering burst errors and distributed errors in the received messages. The ½ rate and hard decision coding is considered in this paper. Performance evaluation in terms of error correction capability of CODEC is shown through simulation using two burst error recovery techniques.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916616","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 a Database System for Linking Geo-Scientific Data","authors":"Zhao Di","doi":"10.1109/ICCSN.2009.77","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.77","url":null,"abstract":"There are many ways to represent the earth surface in geo-information systems (GIS) reflecting different interests and applications. But multiple representations of corresponding or similar real world objects often result in discrepancies and inconsistencies. To give an improved access to such different data sets and to enhance the data quality, data integration is applied. Additionally to identifying and linking corresponding geometric objects, it becomes possible to propagate geometric changes between the different geo-scientific databases automatically. In this paper, we discuss the schema design for the imports from the component databases and the results from matching and the meta data controlling for the matching process. Integration methods are compiled and classified in the database literature and the integration database system shall provide a choice of integration rules and methods developed by specialists from the geo-scientific application fields. Results of the project can support matching of spatial objects of comparable types by integrated database.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123546467","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":"Unspecific Event Detection in Wireless Sensor Networks","authors":"Chongming Zhang, Chunmei Wang, Dazhi Li, Xiaoping Zhou, Chuanshan Gao","doi":"10.1109/ICCSN.2009.149","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.149","url":null,"abstract":"Event detection has always been an important application in the practical deployment of Wireless Sensor Networks (WSNs). Although threshold based event detection method works well in some cases when significant characteristics exist for specific event, it has some limitations in many other application scenarios when we do not know much priori knowledge on incoming event. Inspired by the latest development of time series data mining technology, a flexible approach is proposed for unspecific event discovery in this paper. Event is defined as a pattern that is infrequent appeared. An algorithm is developed to find event patterns efficiently. We show how this approach outperforms threshold based method in Castalia simulation environment.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114941615","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 Clustering Algorithm Based on Communication Facility with Deterministic Cluster-Size in WSN","authors":"Yuhua Liu, Jingju Gao, Longquan Zhu, Xiaoxu Li","doi":"10.1109/ICCSN.2009.32","DOIUrl":"https://doi.org/10.1109/ICCSN.2009.32","url":null,"abstract":"With the energy constrained nature of wireless sensors, it is a substantial design issue to make efficient use of battery power in order to increase their lifetime. Focuses on reducing energy consumption of wireless sensor network, this paper proposed CABCF-DCS (clustering algorithm based on communication facility with deterministic cluster-size) algorithm. By changing the cluster-size of the cluster based on CABCF (clustering algorithm based on communication facility) algorithm, the new algorithm achieves the purpose of saving energy ultimately. Simulation results validate the energy efficiency of the new algorithm.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122815374","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}