Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641201
Ziyu Wang, Zhiqing Wei, Z. Feng
This paper mainly studies the effect of scale-free characteristics on capacity in three-dimensional wireless social networks. The network capacity is related to three parameters: social concentration factor α, communication activity factor β and clustering factor γ. According to the connection degree of the scale-free features, namely, the size of the social group, all nodes are divided into two types: ’social-butterfly’ nodes and normal nodes. The capacity of two kinds of nodes is related to different parameters. The number of ’social-butterfly’ nodes is small de facto, and the capacity of normal nodes is more complicated according to the community characteristics of the network. We have proposed the theoretical capacity of two kinds of nodes under evenly bandwidth allocation respectively. Meanwhile, we simulated the variation of the threshold q0 under different n and α. We found that q0 is close to 66:7% of the maximum number of group members, which is groudbreaking.
{"title":"Capacity of Three-Dimensional Scale Free Wireless Networks","authors":"Ziyu Wang, Zhiqing Wei, Z. Feng","doi":"10.1109/ICCCHINA.2018.8641201","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641201","url":null,"abstract":"This paper mainly studies the effect of scale-free characteristics on capacity in three-dimensional wireless social networks. The network capacity is related to three parameters: social concentration factor α, communication activity factor β and clustering factor γ. According to the connection degree of the scale-free features, namely, the size of the social group, all nodes are divided into two types: ’social-butterfly’ nodes and normal nodes. The capacity of two kinds of nodes is related to different parameters. The number of ’social-butterfly’ nodes is small de facto, and the capacity of normal nodes is more complicated according to the community characteristics of the network. We have proposed the theoretical capacity of two kinds of nodes under evenly bandwidth allocation respectively. Meanwhile, we simulated the variation of the threshold q0 under different n and α. We found that q0 is close to 66:7% of the maximum number of group members, which is groudbreaking.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581298","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641236
Xiaoxi Li, Chi Zhang
In the past decade, autonomous driving technologies have experienced a significant growth. In order to meet the increasing data transmission demands from autonomous vehicles (AVs), a novel network paradigm connecting AVs with the Internet is needed. In this paper, we first present the Software-Defined Autonomous Vehicle Networks (SD-AVN) framework to bridge the gap by introducing Software Defined Networking (SDN) and fog computing technologies. With SDN, we focus on a centralized routing problem in SD-AVN, and our intent is to minimize the overall transmission cost by reducing the usage of 5G base stations (BSs). Motivated by this, we formulate the global routing problem as a mixed integer programming (MIP) problem and develop an online log-competitive approximation algorithm to solve it. After that, we also explain that the computation-intensive routing tasks can be distributed to different fog controllers to reduce the scheduling time and end-to-end delay. Experimental results validate the effectiveness of the proposed algorithm in comparison with other two routing heuristics.
{"title":"Online Data Traffic Steering in Software-Defined Autonomous Vehicle Networks","authors":"Xiaoxi Li, Chi Zhang","doi":"10.1109/ICCCHINA.2018.8641236","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641236","url":null,"abstract":"In the past decade, autonomous driving technologies have experienced a significant growth. In order to meet the increasing data transmission demands from autonomous vehicles (AVs), a novel network paradigm connecting AVs with the Internet is needed. In this paper, we first present the Software-Defined Autonomous Vehicle Networks (SD-AVN) framework to bridge the gap by introducing Software Defined Networking (SDN) and fog computing technologies. With SDN, we focus on a centralized routing problem in SD-AVN, and our intent is to minimize the overall transmission cost by reducing the usage of 5G base stations (BSs). Motivated by this, we formulate the global routing problem as a mixed integer programming (MIP) problem and develop an online log-competitive approximation algorithm to solve it. After that, we also explain that the computation-intensive routing tasks can be distributed to different fog controllers to reduce the scheduling time and end-to-end delay. Experimental results validate the effectiveness of the proposed algorithm in comparison with other two routing heuristics.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121769752","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641171
Wenjing Zhao, Gongpu Wang, S. Atapattu, B. Ai
Ambient backscatter exploits radio frequency (RF) signals to enable passive devices such as tags or sensors to communicate with readers, which has fascinating application for Internet of Things (IoT). The majority of the existing studies assume that channel state information (CSI) is perfectly acquired. Nevertheless, in ambient backscatter systems, the environmental RF signals are unknown at reader and thus may not serve as pilots. Therefore, the traditional channel estimators that routinely require pilots are not acceptable. In this paper, we focus on the problem of channel estimation with no pilots in ambient backscatter systems with multiple-antenna reader. Specifically, a blind channel estimator based on the eigenvalue decomposition (EVD) of the covariance matrix of the received signals is proposed, and the corresponding Cramér-Rao lower bounds (CRLBs) are derived. Simulation results are also provided to corroborate theoretical analysis.
{"title":"Blind Channel Estimation in Ambient Backscatter Communication Systems with Multiple-Antenna Reader","authors":"Wenjing Zhao, Gongpu Wang, S. Atapattu, B. Ai","doi":"10.1109/ICCCHINA.2018.8641171","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641171","url":null,"abstract":"Ambient backscatter exploits radio frequency (RF) signals to enable passive devices such as tags or sensors to communicate with readers, which has fascinating application for Internet of Things (IoT). The majority of the existing studies assume that channel state information (CSI) is perfectly acquired. Nevertheless, in ambient backscatter systems, the environmental RF signals are unknown at reader and thus may not serve as pilots. Therefore, the traditional channel estimators that routinely require pilots are not acceptable. In this paper, we focus on the problem of channel estimation with no pilots in ambient backscatter systems with multiple-antenna reader. Specifically, a blind channel estimator based on the eigenvalue decomposition (EVD) of the covariance matrix of the received signals is proposed, and the corresponding Cramér-Rao lower bounds (CRLBs) are derived. Simulation results are also provided to corroborate theoretical analysis.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125804569","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641163
Kun Duan, H. Du, Zujian Wu
This paper investigates the hybrid beamforming for multi-user millimeter wave (mmWave) multiple-input-multiple-output (MIMO) systems under the sub-connected architecture where each antenna is only connected to a unique radio frequency (RF) chain. Based on the perfect knowledge of the channel state information (CSI), the analog combiner for each user is achieved by using the singular value decomposition (SVD), and the analog and digital precoder is achieved by minimizing the Frobenius norm of the matrix of difference between the unconstrained precoder matrix and products of the hybrid RF and baseband precoders via the alternating optimization approach. Simulation results show that the performance of our proposed method over the existing SVD-based approaches in terms of achievable sum rate with different scales of transmit and receive antenna array, especially in the low signal to noise ratio (SNR) regime.
{"title":"Hybrid Alternating Precoding and Combining Design for mmWave Multi-User MIMO Systems","authors":"Kun Duan, H. Du, Zujian Wu","doi":"10.1109/ICCCHINA.2018.8641163","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641163","url":null,"abstract":"This paper investigates the hybrid beamforming for multi-user millimeter wave (mmWave) multiple-input-multiple-output (MIMO) systems under the sub-connected architecture where each antenna is only connected to a unique radio frequency (RF) chain. Based on the perfect knowledge of the channel state information (CSI), the analog combiner for each user is achieved by using the singular value decomposition (SVD), and the analog and digital precoder is achieved by minimizing the Frobenius norm of the matrix of difference between the unconstrained precoder matrix and products of the hybrid RF and baseband precoders via the alternating optimization approach. Simulation results show that the performance of our proposed method over the existing SVD-based approaches in terms of achievable sum rate with different scales of transmit and receive antenna array, especially in the low signal to noise ratio (SNR) regime.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125806175","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641205
Jing Qian, Aaron N. Parks, Joshua R. Smith, F. Gao
Existing Ambient Backscatter systems make use of two-state ASK or PSK scattering to communicate data among low-power transceivers, where data are transferred at the rate of only one bit per symbol period. Motivated by improving data rate between two transceivers in the Internet of Things and with the low-power constraint, we investigate the situation where the backscattering device employs M-ary PSK modulation. We derive the multi-level energy detector at the receiving device from the multiple hypotheses testing and compute the closed-form expressions of thresholds and symbol error rate. Numerical simulation results are provided to verify the theoretical studies.
{"title":"Multi-level Energy Detection for Ambient Backscatter System with M-PSK Modulation","authors":"Jing Qian, Aaron N. Parks, Joshua R. Smith, F. Gao","doi":"10.1109/ICCCHINA.2018.8641205","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641205","url":null,"abstract":"Existing Ambient Backscatter systems make use of two-state ASK or PSK scattering to communicate data among low-power transceivers, where data are transferred at the rate of only one bit per symbol period. Motivated by improving data rate between two transceivers in the Internet of Things and with the low-power constraint, we investigate the situation where the backscattering device employs M-ary PSK modulation. We derive the multi-level energy detector at the receiving device from the multiple hypotheses testing and compute the closed-form expressions of thresholds and symbol error rate. Numerical simulation results are provided to verify the theoretical studies.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123773606","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641223
Zhixiang Deng, Qian Sang, Yuan Gao, Changchun Cai
In this paper, we exploit the potential benefits of machine learning in enhancing physical layer security in cooperative wireless networks. We focus on the case where multiple relays adopt amplify-and-forward (AF) relaying to forward information from the source to the destination. It is assumed that the global channel state information (CSI) of the legitimate links and wiretap links is available to the source. The optimal relay is selected to improve physical layer security against eavesdropping. By modeling the problem of the relay selection as a multi-class classification problem, a neural network (NN) based scheme is proposed to select the optimal relay which guarantees the perfect secrecy performance of the relay cooperative communication system. Compared with the conventional relay selection scheme, the simulation results show that our proposed scheme not only achieves almost the same secrecy performance, but also has advantage of relatively small feedback overhead. The work presented here provides insights into the new design of relay selection based on machine learning.
{"title":"Optimal Relay Selection for Wireless Relay Channel with External Eavesdropper: a NN-based Approach","authors":"Zhixiang Deng, Qian Sang, Yuan Gao, Changchun Cai","doi":"10.1109/ICCCHINA.2018.8641223","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641223","url":null,"abstract":"In this paper, we exploit the potential benefits of machine learning in enhancing physical layer security in cooperative wireless networks. We focus on the case where multiple relays adopt amplify-and-forward (AF) relaying to forward information from the source to the destination. It is assumed that the global channel state information (CSI) of the legitimate links and wiretap links is available to the source. The optimal relay is selected to improve physical layer security against eavesdropping. By modeling the problem of the relay selection as a multi-class classification problem, a neural network (NN) based scheme is proposed to select the optimal relay which guarantees the perfect secrecy performance of the relay cooperative communication system. Compared with the conventional relay selection scheme, the simulation results show that our proposed scheme not only achieves almost the same secrecy performance, but also has advantage of relatively small feedback overhead. The work presented here provides insights into the new design of relay selection based on machine learning.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124989811","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641218
Yiran Yang, Yi Wang, Ren-gang Wang, Shiqiang Chu
Mobile edge computing (MEC) allows mobile devices to offload computing tasks to nearby base stations or wireless access points, and empowers users to have more resources in the new-generation mobile communications. However, with the limited storage and computing capacity of MEC servers, the rather complex resource allocation among multiple servers brings many problems such as transmission delay and low reliability. In this paper, we propose a resource allocation method in a collaborative space, which sets a MEC server as the core server to store and provide the most prevalent resources to other servers. According to the actual application with MEC, a goal optimization of transmission delay is given. Simulation results show that the proposed method can decrease the transmission delay compared with traditional method.
{"title":"A resource allocation method based on the core server in the collaborative space for mobile edge computing","authors":"Yiran Yang, Yi Wang, Ren-gang Wang, Shiqiang Chu","doi":"10.1109/ICCCHINA.2018.8641218","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641218","url":null,"abstract":"Mobile edge computing (MEC) allows mobile devices to offload computing tasks to nearby base stations or wireless access points, and empowers users to have more resources in the new-generation mobile communications. However, with the limited storage and computing capacity of MEC servers, the rather complex resource allocation among multiple servers brings many problems such as transmission delay and low reliability. In this paper, we propose a resource allocation method in a collaborative space, which sets a MEC server as the core server to store and provide the most prevalent resources to other servers. According to the actual application with MEC, a goal optimization of transmission delay is given. Simulation results show that the proposed method can decrease the transmission delay compared with traditional method.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125573364","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641251
Md. Sazzad Hossen, A. Jamalipour
Using the attributes of software-defined networking (SDN) platform, we propose an adaptive traffic steering scheme for the ultra-dense heterogeneous cellular networks. The proposed traffic steering scheme maximizes the utilization of network radio resources. In this paper, a SDN-based cellular network is proposed to assist steering scheme by providing real-time networks and user’s state information. After the cell condition is identified depending on resource utilization, three case scenarios are considered in the heterogeneous cellular networks (HetNets). In each scenario, proposed traffic steering algorithm makes a decision matrix for the user’s redistribution. Finally, the selected users perform the steering operation. Our proposed scheme ensures that, radio resource utilization can be maximized by redistributing the users in the available radio resources. Comprehensive system level simulations have been conducted. It is shown that the proposed traffic steering scheme increases network resource utilization and reduces the number of users transferred.
{"title":"Network Resource Optimization in SDN-based Cellular Networks: A Traffic Steering Approach","authors":"Md. Sazzad Hossen, A. Jamalipour","doi":"10.1109/ICCCHINA.2018.8641251","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641251","url":null,"abstract":"Using the attributes of software-defined networking (SDN) platform, we propose an adaptive traffic steering scheme for the ultra-dense heterogeneous cellular networks. The proposed traffic steering scheme maximizes the utilization of network radio resources. In this paper, a SDN-based cellular network is proposed to assist steering scheme by providing real-time networks and user’s state information. After the cell condition is identified depending on resource utilization, three case scenarios are considered in the heterogeneous cellular networks (HetNets). In each scenario, proposed traffic steering algorithm makes a decision matrix for the user’s redistribution. Finally, the selected users perform the steering operation. Our proposed scheme ensures that, radio resource utilization can be maximized by redistributing the users in the available radio resources. Comprehensive system level simulations have been conducted. It is shown that the proposed traffic steering scheme increases network resource utilization and reduces the number of users transferred.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127446583","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641166
S. Soleimani, Xiaofeng Tao, Yuhong Li
As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.
{"title":"Cooperative Group Caching Strategy in Content-Centric Wireless Ad Hoc Networks","authors":"S. Soleimani, Xiaofeng Tao, Yuhong Li","doi":"10.1109/ICCCHINA.2018.8641166","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641166","url":null,"abstract":"As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126300269","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641127
Lisu Yu, Jingxian Wu, P. Fan
In this paper, we study the modeling and performance of the downlink of fiber-wireless communication (FWC) systems, where a central unit (CU) is connected through optical links to multiple radio access points (RAPs), which provide wireless coverage to mobile users. For a FWC system that relies on mm-wave wireless signals, a large number of spatially distributed RAPs are usually employed to compensate for the high propagation loss of mm-wave signals. Radio-frequency-over-fiber (RFoF) and baseband-over-fiber (BBoF) are two commonly used techniques for FWC systems. We aim at comparing the performances between RFoF and BBoF systems, such as to identify the operation scenario that one is better than the other, or vice versa. The analysis is performed by modeling the effects of the components on the complete signal path in both RFoF and BBoF systems, such as baseband unit, digital-to-analog converter (DAC), radio-frequency (RF) unit, electrical-optical interfaces, optical fiber, power amplifier, etc. The two systems are compared in terms of total power consumption, noise power, and outage probability. It is demonstrated that the RFoF system outperforms its BBoF counterpart for systems with shorter fiber length (e.g. less than 15.8 km), lower transmission power, and more RAPs, which are all desired properties for future wireless communication systems.
{"title":"BBoF v.s. RFoF in Fiber-Wireless Communication Systems","authors":"Lisu Yu, Jingxian Wu, P. Fan","doi":"10.1109/ICCCHINA.2018.8641127","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641127","url":null,"abstract":"In this paper, we study the modeling and performance of the downlink of fiber-wireless communication (FWC) systems, where a central unit (CU) is connected through optical links to multiple radio access points (RAPs), which provide wireless coverage to mobile users. For a FWC system that relies on mm-wave wireless signals, a large number of spatially distributed RAPs are usually employed to compensate for the high propagation loss of mm-wave signals. Radio-frequency-over-fiber (RFoF) and baseband-over-fiber (BBoF) are two commonly used techniques for FWC systems. We aim at comparing the performances between RFoF and BBoF systems, such as to identify the operation scenario that one is better than the other, or vice versa. The analysis is performed by modeling the effects of the components on the complete signal path in both RFoF and BBoF systems, such as baseband unit, digital-to-analog converter (DAC), radio-frequency (RF) unit, electrical-optical interfaces, optical fiber, power amplifier, etc. The two systems are compared in terms of total power consumption, noise power, and outage probability. It is demonstrated that the RFoF system outperforms its BBoF counterpart for systems with shorter fiber length (e.g. less than 15.8 km), lower transmission power, and more RAPs, which are all desired properties for future wireless communication systems.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128996093","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：