Jinxing Li, Youping Zhao, Jing Zhang, Rui Jiang, C. Tao, Z. Tan
{"title":"Radio channel measurement and characterization for wireless communications in tunnels","authors":"Jinxing Li, Youping Zhao, Jing Zhang, Rui Jiang, C. Tao, Z. Tan","doi":"10.1109/ICCCHINA.2014.7008339","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008339","url":null,"abstract":"There is an increasing demand on wireless communications in subway tunnels to provide video surveillance and sensory data for security, maintenance and train control, and to offer various communication or entertainment services (e.g., Internet, etc.) to passengers as well. The wireless channel in tunnels is quite unique due to the confined space and the waveguide effects. Modeling the channel characteristics in tunnels is critically important to design or optimize subway wireless communication systems. This paper investigates the key radio channel characteristics of a subway tunnel in Beijing, China, such as the path loss, root mean square (RMS) delay spread, K-factor, channel stationarity, RMS Doppler spread, and channel capacity. Our field measurements show that channel characteristics in tunnels are highly location-dependent and there exists a dominant path in line-of-sight (LOS) scenarios as well as in non-line-of-sight (NLOS) scenarios, which is quite different from that in the land mobile communications. In the straight section of the subway tunnel, the measured path loss exponents at 2.45 GHz and 5.7GHz are 1.58 and 1.62, respectively.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"19 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":"123999464","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":"Failure dependency-based protection scheme for multi-segment fiber-wireless (FiWi) access network","authors":"Yejun Liu, Lei Guo, Pengchao Han, Yinpeng Yu","doi":"10.1109/ICCCHINA.2014.7008260","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008260","url":null,"abstract":"Survivability is an urgent issue for the deployment of multi-segment (Fiber-Wireless) FiWi access network due to its larger network scale and various failure scenarios. Some approaches were proposed to protect passive optical network by deploying backup fibers, which have been extended to multisegment FiWi. However, most of the previous works ignore the failure dependency of different fiber links, e.g., Shared-Risk Link Group (SRLG), which may lead to the simultaneous failures of multiple segments. In this paper, we focus on the survivability of multi-segment FiWi against single SRLG failure and propose a new protection scheme called Backup Resource Configuration based on Failure Dependency (BRCFD). A failure probability model is proposed to estimate the failure probability of each single segment and the failure dependency of each segment pair. In BRCFD, we deal with the full protection of each segment whose failure probability exceeds the specified threshold, aiming to minimize the consumption of backup capacity and the deployment cost of backup fibers. Simulation results demonstrate that our BRCFD scheme can effectively reduce the consumption of backup resource.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"IA-20 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":"126559796","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":"Congestion game with inter-cell interference for cell selection in heterogeneous cellular network","authors":"Wenli Liao, Lusheng Wang, Jie Li","doi":"10.1109/ICCCHINA.2014.7008348","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008348","url":null,"abstract":"Along with the fast development of heterogeneous cellular network (HCN), each user could select the best cell for communication at any time anywhere. Different from network selection in heterogeneous wireless networks, cells in HCN might use the same portion of spectrum, causing inter-cell interference. In this paper, we study on a two-tier cellular network architecture with one femtocell deployed in one macrocell. We model the cell selection problem as congestion games with innegligible inter-cell interference between the macrocell and the femtocell. Based on theoretical analysis, we prove three theorems for pure strategy Nash equilibria. In the end, numerical results demonstrate the correctness of the theorems.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"25 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":"131982758","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":"Perspectives on high frequency small cell with ultra dense deployment","authors":"Hualei Wang, Z. Pan, I. Chih-Lin","doi":"10.1109/ICCCHINA.2014.7008329","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008329","url":null,"abstract":"Mobile Internet and Internet of Thing (IoT) have been widely recognized as the two major driven forces of next generation mobile systems (IMT-2020 or 5G). Key performance indicators (KPI) of 5G are identified to satisfy the needs of these applications, such as 10Gbps peak data and 1000× capacity increase. A common census has been reached in industry that high frequency and ultra dense small cell (5G small cell) is expected for some critical KPIs. In this paper, perspectives on 5G small cell are presented, mainly focusing on new waveform design and some thoughts resulted from ultra dense deployment. Specifically, the design principles and feasible range of frame parameters and frame structure are discussed, with an exemplary numerology. Finally, this paper points out that it will be line-of-Sight (LOS) dominated communication environment if ultra dense deployed.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"43 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":"132819182","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 transmit antenna coding scheme for spatial modulation","authors":"Zhi Li, Fengxiang Wang, Xiang Cheng, B. Jiao","doi":"10.1109/ICCCHINA.2014.7008290","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008290","url":null,"abstract":"Spatial modulation (SM) is performed in both spatial and signal domains. The spatial-domain modulation involves the coding process of transmit antennas (TAs). The traditional coding method uses natural binary code, which leads to relatively poor bit error rate (BER) performance in spatial correlated channels. In this paper, we propose a simple yet efficient TA coding scheme by utilizing Gray code for SM. Considering a uniform linear array (ULA), due to the fact that the correlation of two adjacent TAs far exceeds that of the other TA pairs, the BER brought out by TA indices decision can be effectively mitigated by utilizing Gray code. Simulation results show that the proposed coding scheme can effectively mitigate the bit error due to incorrect decision and thus improve the BER.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"13 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":"124558078","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":"Low-complexity user scheduling in the downlink massive MU-MIMO system with linear precoding","authors":"Ou Bai, Hui Gao, Tiejun Lv, C. Yuen","doi":"10.1109/ICCCHINA.2014.7008306","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008306","url":null,"abstract":"In this paper, we investigate low-complexity user scheduling schemes for the downlink (DL) massive multiuser multiple-input multiple-output (MU-MIMO) system, where an M-antenna (M is very large) base station (BS) serves K (K > 2) N-antenna (N > 1) users with linear transceivers. Establishing the theoretical foundation of our scheduling schemes, we first investigate the asymptotic sum-rates of this system with both singular value decomposition (SVD) and regularized zero-forcing (RZF) precoders. In particular, we assume that both M and N go to infinity with a bounded ratio to perform the theoretical derivations with random matrix theory (RMT). In addition, the influence of imperfect channel estimation is also considered. Interestingly, the analysis indicates the existence of an optimal number of served users K1 in terms of asymptotic sum-rate, which motivates our low complexity user scheduling schemes. Unlike the conventional schemes with complicated computations and instantaneous channel state information, our user scheduling schemes are based on semi-analytical solutions with only statistic CSI. Simulation results validate our theoretical derivations and show the advantages of our schemes in the massive MU-MIMO system.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"63 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":"114398431","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":"Transmit beamforming and admission control for multicast with uncertain user partition","authors":"B. Hu, Cunqing Hua, Cailian Chen, X. Guan","doi":"10.1109/ICCCHINA.2014.7008235","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008235","url":null,"abstract":"In this paper, we consider the multicast beamforming problem in a downlink wireless system. Then, an optimization problem is formulated to find the optimal user-group assignment scheme and beamforming weight vectors, such that the number of admitted users is maximized with the minimum transmit power under the quality of service (QoS) requirement constraints of each individual user. Unfortunately, the constraints are nonlinear since they consist of the products of binary variables and continuous variables. As a solution, the big-M approach is adopted to transform the problem to a mixed integer quadratically constrained quadratic programming (MI-QCQP) problem. Then, an optimal and a suboptimal algorithm are proposed based on the branch and bound (BnB) method. In addition, a heuristic algorithm is designed in order to trade off the performance between computational complexity and accuracy. Simulation results are provided to demonstrate the performance of the proposed algorithms in terms of the number of admitted users and energy consumption.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"102 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":"114716940","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 alignment scheme for three-cell constant cellular interfering networks","authors":"Yuanyuan Zhang, Xiang-chuan Gao, Zhongxu Wang, Zhengcang Zhu","doi":"10.1109/ICCCHINA.2014.7008353","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008353","url":null,"abstract":"This paper investigates the design of interference alignment (IA) for a three-cell constant cellular interfering network, where three base stations in the cellular network simultaneously transmit signals to a group of users in their own cells while causing interference to each other. While determining the existence of IA with reaching the degrees of freedom (DoF) outer bound is still a very challenging problem. We propose an efficient alignment scheme for this system, where the transmit beamforming matrices are jointly designed in loop structure. We theoretically derive the antenna source of this system. Numerical results show that our proposed IA scheme requires less antenna source in contrast to that of the existing IA schemes, while the total achievable DoF of the system is identical.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"4 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":"123946031","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":"Mobile routing in elastic optical networks","authors":"I. Szczesniak, A. Jajszczyk, A. Pach","doi":"10.1109/ICCCHINA.2014.7008252","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008252","url":null,"abstract":"With the continuing growth of wireless high-bitrate services, the progressing integration of wireless and optical networks, and the eventual deployment of elastic optical networks, there is a need to support the mobile routing in the elastic optical networks. We propose a mobile routing algorithm which, in comparison with the two baseline routing algorithms, requires the lowest number of new links to configure when the connection is reconfigured, and achieves the highest probability of completing a connection. The performance evaluation was carried out with 1200 simulation runs.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 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":"126852947","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":"Energy-efficiency and spectrum-efficiency tradeoff in coordinated small-cell networks","authors":"Xu Zhang, Sheng Zhou, Z. Niu, Xiaokang Lin","doi":"10.1109/ICCCHINA.2014.7008279","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2014.7008279","url":null,"abstract":"Small-cell networks play an important role in next generation mobile networks. Multiple antennas can be employed at the small-cell base stations (SBS) to further improve the spectrum-efficiency. However, the increased number of antenna elements induces more energy consumption, i.e., there exists a tradeoff between the energy-efficiency and the spectrum-efficiency. In this paper, the network performance is analyzed which takes the coordinated scheduling into account. The coordination relationship among neighboring SBSs is modeled by a coordination graph. The coordinated scheduling is achieved by finding the maximum independent set of the graph. By deriving the average size of the maximum independent set, the network throughput is obtained. Simulation results validate the derivation. Then, the tradeoff between the energy-efficiency and the spectrum-efficiency is analyzed. It is found that the single-antenna SBSs are not energy-efficiency as the density of SBSs increases.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"75 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":"126285959","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}