{"title":"Monitoring system of urban population traffic based on mobile network signaling","authors":"Jiangtao Luo, Z. Shu, Yunfeng Zhou","doi":"10.1109/ICCCHINA.2014.7008298","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008298","url":null,"abstract":"Online monitoring of population traffic within a certain region plays a significant role in modern city administration and public security, and it is also a difficult task to fulfil using traditional methods. In this paper, a system is reported, which has realized fast estimation of snapshot population and residence time distribution within a certain region, based on mobile network signaling. The system architecture is presented and some key implementation issues are addressed. As examples, results in two typical regions are demonstrated and thoroughly compared. One is a historical attraction, and the other is a traffic junction in the central business area. The system has currently come into operation in Beijing and begun serving several municipal departments including tourism, administration and public security.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127838837","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}
Yanan Ma, Yiqing Zhou, Virgile Garcia, Hongchao Chen, Jinglin Shi
{"title":"Maximum projection based interference alignment in MIMO interference systems","authors":"Yanan Ma, Yiqing Zhou, Virgile Garcia, Hongchao Chen, Jinglin Shi","doi":"10.1109/ICCChina.2014.7008236","DOIUrl":"https://doi.org/10.1109/ICCChina.2014.7008236","url":null,"abstract":"Interference alignment (IA) consolidates interference signals into a small subspace and makes the interference-free detection possible for useful signals. Most existing IA precoders such as CJ-IA are designed to maximize the degree of freedom (DoF), which does not necessarily result in optimized system performance such as receiving signal-to-noise ratio (SNR). In this paper, based on CJ-IA, a maximum projection based IA (MP-IA) precoding scheme is proposed to maximize the desired signal strength at receivers, which brings optimized SNR, sum-rate and bit error rate (BER) performance. It is shown in simulations that the proposed MP-IA outperforms existing schemes in terms of desired signal strength, sum-rate and BER.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"225 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120886728","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":"Interference coordination in small cell networks using coalition formation game","authors":"Yaohua Sun, Biling Zhang, M. Peng, Chengdan Sun","doi":"10.1109/ICCCHINA.2014.7008355","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008355","url":null,"abstract":"Small cell networks (SCNs) have been presented as an efficient way to improve the capacity of wireless networks. However, dense deployment of small cell base stations (SBSs) can cause severe intra-tier interference which prevents the system from achieving high spectrum efficiency. Therefore, the investigation on interference coordination in SCNs is essential. In this paper, we formulate the interference coordination problem as a coalition formation game in characteristic form and a centralized coalition formation algorithm is introduced. The proposed algorithm is able to avoid the emergence of partition loop which will lead to the instability of the algorithm. Moreover, the performance of the proposed algorithm in terms of convergence and stability is also investigated. Simulation results show that the proposed coalition formation algorithm yields significant gains, in aggregate spectrum efficiency, reaching up to 21.91% compared with non-cooperative case for a network of N = 13 SBSs.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122838539","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}
Wen J. Li, Tingting Zhang, Yuan Shen, A. Molisch, Qinyu Zhang
{"title":"Robust resource allocation in wireless localization networks","authors":"Wen J. Li, Tingting Zhang, Yuan Shen, A. Molisch, Qinyu Zhang","doi":"10.1109/ICCCHINA.2014.7008318","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008318","url":null,"abstract":"Reliable and accurate position estimation of “agent” nodes is essential for many wireless applications. Typically agents perform position estimation through ranging with respect to “anchor” nodes with known positions. In range-based localization techniques, system accuracy and energy efficiency are affected by both transmit power and signal bandwidth. We thus investigate the joint power and bandwidth allocation (JPBA) problems in wireless localization networks. We first formulate a general optimization model, which is proved to be non-convex. An approximate algorithm based on single condensation method is proposed to solve the problem. We then formulate the robust counterpart of the problem in the presence of uncertainty of the agents' positions. An low complexity method is also proposed to solve the robust JPBA problem. Numerical results validate the accuracy and robustness of the proposed algorithms.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124213466","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 effective passive suppression mechanism for achieving wireless full duplex","authors":"Maohua Zhao, Shaoshuai Gao","doi":"10.1109/ICCCHINA.2014.7008345","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008345","url":null,"abstract":"Full duplex communication is able to enhance the spectrum efficiency of wireless channels, one important step of which is the passive suppression technology. To improve the performance of the passive suppression, we have studied different antenna configuration modes, which are based on the electromagnetic interference theory. Making full use of the fading characteristic of antennas, we figure out an effective layout mode to obtain the maximum passive suppression. The measurement results reveal that the average passive self-interference suppression can achieve 52.6 dB. The tests were conducted under various conditions and their combinations, i.e., (a) modulation, (b) polarization, (c) distance, and (d) laying. Test results show that with the help of digital suppression, the total suppression performance can be more than 90dB, which is able to meet the requirements of full duplex communications.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115880271","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":"CRMS: A centralized replication management scheme for cloud storage system","authors":"Kangxian Huang, Dagang Li, Yongyue Sun","doi":"10.1109/ICCCHINA.2014.7008299","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008299","url":null,"abstract":"As distributed storage clusters have been used more and more widely in recent years, data replication management, which is the key to data availability, has become a hot research topic. In storage clusters, internal network bandwidth is usually a scarce resource. Misplaced replicas may take up too much network bandwidth and greatly deteriorate the overall performance of the cluster. Aiming to reduce the internal network traffic and to improve load balancing of distributed storage clusters, we developed a centralized replication management scheme referred to as CRMS. A model is proposed to capture the relationships of block access probability, replica location and network traffic. Based on this model, the replica placement problem is formulated as a 0-1 programming optimization problem. Based on the feasible solution to this problem, a heuristic is proposed to process the replica adjustments step by step. Our CRMS is evaluated by using the access history from a distributed storage cluster of Xunlei Inc., one of the leading Internet companies in China. The experimental results show that CRMS can greatly reduce the amount of internal network bandwidth consumption, while keeping the cluster's storage usage in balance.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"376 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132000072","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":"Content extraction based on statistic and position relationship between title and content","authors":"Mingdong Li, P. Xu, Chencheng Yang","doi":"10.1109/ICCCHINA.2014.7008295","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008295","url":null,"abstract":"Web page content extraction is a fundamental step in the application of data mining which supplies pure data source with little noise. The original web page with fully embedded with contentirrelevant information such as JavaScript and advertisements is mixed with noise. The purity of the data makes a difference in application. Consequently, a web information extraction model based on statistical and positional relationship between the title and content is proposed in this paper. The exact localization of title will promote the precision of content extraction and inversely the accurate extracted content will have a positive feedback to ensure the right title is extracted. First and foremost, each text node is compared to the content selected from the tag of title to get the score of similarity. We can get the final score of each separate node by summing up its node attribute score. The node with the highest score will be regarded as the accurate title at present. According to the position of title, we narrow the scope of main content which is distributed after the title. With the help of statistical information of the web page we then traverse the DOM tree to obtain the content contained in the node with maximal weight. Experimental results prove that the algorithm is much better than that of previous extraction rules and applicable to extract main content from web pages.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114305295","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":"Ameliorated joint synchronization and localization for 3D underwater sensor networks","authors":"Yuhan Dong, Teng Yang, Xuedan Zhang","doi":"10.1109/ICCCHINA.2014.7008316","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008316","url":null,"abstract":"Both time synchronization and localization are critical issues for wireless sensor networks (WNSs) especially for Underwater Sensor Networks (USNs). In this paper, we have proposed an ameliorated joint synchronization and localization (AJSL) algorithm for 3D USNs using iterative weighted least square (IWLS) estimator. This algorithm takes advantage of projection technique with measurable depth information and inherent relationship between synchronization and localization. The closed-form expression of mean square error (MSE) is also derived and facilitates performance evaluation. Numerical results suggest that the proposed joint algorithm outperforms traditional separated approaches with the same communication cost and the joint scheme with less output latency.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114507257","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":"Minimum outage routing in cooperative multi-hop networks","authors":"Pouyan Ahmadi, Monireh Dabaghchian, B. Jabbari","doi":"10.1109/ICCCHINA.2014.7008379","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008379","url":null,"abstract":"We consider the joint routing and cooperation diversity problem in multi-hop networks, for which we seek to optimize the end-to-end outage. Simplifying the network structure via partitioning and identifying a set of nodes in each partition, we devise a routing strategy based on cooperative relays in decode-and-forward mode. In particular, this sub-optimal routing algorithm yields the best possible path between the source and destination pragmatically considering the outage probability as the optimization metric. To reduce the amount of required channel state information and the path computation complexity, we introduce a simplified realization, referred to as L-relay ad-hoc, in which a relay selection method based on channel gains is applied at each hop. We evaluate the performance of the proposed methods under practical conditions. Simulation results show that the proposed sub-optimal strategy can perform very closely to the optimal strategy with less channel information requirement, and the L-relay ad-hoc method can also demonstrate a good performance with significantly reduced complexity.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114694635","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}
Daohua Zhu, Jiaheng Wang, A. L. Swindlehurst, Chunming Zhao
{"title":"An optimal resource reuse strategy for QoS-awared device-to-device communications","authors":"Daohua Zhu, Jiaheng Wang, A. L. Swindlehurst, Chunming Zhao","doi":"10.1109/ICCCHINA.2014.7008281","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008281","url":null,"abstract":"Device-to-device (D2D) communication is a promising technique for improving the spectral efficiency of cellular networks. In this paper, we consider joint optimization of pair assignment and power control for D2D pairs reusing downlink cellular resources, and aim to maximize the aggregate rate of D2D communications while guaranteeing the quality of service (QoS) of the cellular users. By transforming the original difficult problem into an equivalent form, we are able to analytically characterize the optimal power control and pair assignment for the D2D and cellular users. Based on these results, we then propose an efficient algorithm to obtain the jointly optimal power control and pair assignment strategy. The numerical results show the superiority of our proposed method over existing ones.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117248240","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}