Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641107
Zixuan Huang, K. Zhang, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang
Ultra-reliable low latency communication (URLLC) is defined by the the third generation partnership project (3GPP) for the fifth generation (5G) mobile systems. In order to realize the stringent requirements of ultra-high reliability and low latency, the data block length needs to be small. However, most of the state-of-art channel codes are designed and optimized for long block length. Analog fountain code (AFC) is a capacity-approaching self-adaptive code on wireless channels with linear encoding/decoding complexity. In this paper, we study the optimization of AFC in the finite length regime. We first analyze the effect of average degree on decoding performance of AFC in the finite length regime. Then, based on the characteristic of weight coefficient in AFC, we proposed a joint design of weight optimization (WO) progressive edge growth (PEG)-AFC algorithm to improve the decoding performance in the finite length regime, named PEG-AFC algorithm. Simulation results show that the proposed PEG-AFC algorithm can achieve lower bit error rate (BER) in a wide range of signal to noise ratio (SNR).
{"title":"An Efficient Construction Method for Ultra-Reliable Finite Length Analog Fountain Codes","authors":"Zixuan Huang, K. Zhang, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641107","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641107","url":null,"abstract":"Ultra-reliable low latency communication (URLLC) is defined by the the third generation partnership project (3GPP) for the fifth generation (5G) mobile systems. In order to realize the stringent requirements of ultra-high reliability and low latency, the data block length needs to be small. However, most of the state-of-art channel codes are designed and optimized for long block length. Analog fountain code (AFC) is a capacity-approaching self-adaptive code on wireless channels with linear encoding/decoding complexity. In this paper, we study the optimization of AFC in the finite length regime. We first analyze the effect of average degree on decoding performance of AFC in the finite length regime. Then, based on the characteristic of weight coefficient in AFC, we proposed a joint design of weight optimization (WO) progressive edge growth (PEG)-AFC algorithm to improve the decoding performance in the finite length regime, named PEG-AFC algorithm. Simulation results show that the proposed PEG-AFC algorithm can achieve lower bit error rate (BER) in a wide range of signal to noise ratio (SNR).","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"25 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":"115496434","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.8641169
Ye Zhu, Xiaoqi Qin, Ping Zhang
Device-to-device (D2D) multicast communication is considered as a promising technology to realize the innovative content-aware applications in the fifth generation (5G) networks, such as multimedia multicast service and group-based machine type communications (MTC) applications. Under such scenarios, mobile devices (MDs) that are interested in the same content can be clustered as a group and transmit cooperatively via multiple hops to achieve efficient content distribution. Such multi-hop multicast transmission helps to relief traffic pressure in cellular networks and improve the quality of service for cell edge users. However, it requires careful design of the clustering scheme to ensure delay performance and energy efficiency. In this paper, we propose a multicast clustering algorithm for multi-hop communications. As for each hop, we select a combination of nodes to act as cluster heads (CHs) and multicast the content to a group of next-hop users by jointly considering achievable multicast data rate, remaining operation time and end-to-end delay. In the case of overlapping clusters, we propose a cluster member (CM) reassignment criteria to minimize transmission redundancy. Simulation results show that the performance of our proposed clustering algorithm is competitive in terms of delay and robustness.
{"title":"An Efficient Multicast Clustering Scheme for D2D Assisted Offloading in Cellular Networks","authors":"Ye Zhu, Xiaoqi Qin, Ping Zhang","doi":"10.1109/ICCCHINA.2018.8641169","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641169","url":null,"abstract":"Device-to-device (D2D) multicast communication is considered as a promising technology to realize the innovative content-aware applications in the fifth generation (5G) networks, such as multimedia multicast service and group-based machine type communications (MTC) applications. Under such scenarios, mobile devices (MDs) that are interested in the same content can be clustered as a group and transmit cooperatively via multiple hops to achieve efficient content distribution. Such multi-hop multicast transmission helps to relief traffic pressure in cellular networks and improve the quality of service for cell edge users. However, it requires careful design of the clustering scheme to ensure delay performance and energy efficiency. In this paper, we propose a multicast clustering algorithm for multi-hop communications. As for each hop, we select a combination of nodes to act as cluster heads (CHs) and multicast the content to a group of next-hop users by jointly considering achievable multicast data rate, remaining operation time and end-to-end delay. In the case of overlapping clusters, we propose a cluster member (CM) reassignment criteria to minimize transmission redundancy. Simulation results show that the performance of our proposed clustering algorithm is competitive in terms of delay and robustness.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"85 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":"116971073","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.8641238
Yuhan Wang, J. Jiao, Qiwen Li, Shaohua Wu, Qinyu Zhang
The increasing demand for high data rate services over the integrated satellite-terrestrial network has pushed for the development of millimeter-wave (mmWave) band high throughput satellites (HTS) with multibeams. However, existing multibeam HTS is with predetermined beam connection. Considering the mmWave channel is much more sensitive to the weather conditions than the conventional S/C/X band channels, it is important to allocate the limited transmission power to the beams that connect to the ground station in good state. Moreover, due to the huge distance and long propagation delay in the integrated satellite-terrestrial networks, the multibeam HTS can only obtain delayed Channel State Information (CSI) from feedback. In this paper, we model this problem as a Partially Observable Markov Decision Process (POMDP), and propose a power allocation optimization over two identical Gilbert-Elliott beams HTS communication, which can partly mitigate the negative effects of adverse weather conditions. The key thresholds for selecting the optimal power allocation method in the multibeam HTS communications are derived. The effectiveness and potentialities of our proposed scheme is verified through simulation results.
{"title":"Power Allocation Optimization of Multibeam Satellites for Integrated Satellite-Terrestrial Networks","authors":"Yuhan Wang, J. Jiao, Qiwen Li, Shaohua Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641238","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641238","url":null,"abstract":"The increasing demand for high data rate services over the integrated satellite-terrestrial network has pushed for the development of millimeter-wave (mmWave) band high throughput satellites (HTS) with multibeams. However, existing multibeam HTS is with predetermined beam connection. Considering the mmWave channel is much more sensitive to the weather conditions than the conventional S/C/X band channels, it is important to allocate the limited transmission power to the beams that connect to the ground station in good state. Moreover, due to the huge distance and long propagation delay in the integrated satellite-terrestrial networks, the multibeam HTS can only obtain delayed Channel State Information (CSI) from feedback. In this paper, we model this problem as a Partially Observable Markov Decision Process (POMDP), and propose a power allocation optimization over two identical Gilbert-Elliott beams HTS communication, which can partly mitigate the negative effects of adverse weather conditions. The key thresholds for selecting the optimal power allocation method in the multibeam HTS communications are derived. The effectiveness and potentialities of our proposed scheme is verified through simulation results.","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":"125513132","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.8641136
Qi Liu, Hui Tian, Gaofeng Nie, Hao Wu
Wireless self-backhaul technology is an effective solution to the backhaul bottleneck of 5G Heterogeneous Networks (HetNets). To effectively utilize the spectrum resource as well as reduce the transmission load of backhaul links, we propose a joint Context-aware Data Caching and Resource Allocation (CDCRA) scheme for self-backhauled HetNets aiming at maximizing the total system throughput. Context-aware technology combined with many-to-many matching theory is utilized for data caching in small base stations (SBSs). Then interference management based on graph theory is considered when allocating spectrum resource for both access links and backhaul links. Different comparison schemes are designed to verify the performance of our proposed scheme. Simulation results indicate that the total system throughput is significantly improved by CDCRA scheme comparing with other data caching and resource allocation schemes.
{"title":"Context-aware Data Caching and Resource Allocation in HetNets with Self-backhaul","authors":"Qi Liu, Hui Tian, Gaofeng Nie, Hao Wu","doi":"10.1109/ICCCHINA.2018.8641136","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641136","url":null,"abstract":"Wireless self-backhaul technology is an effective solution to the backhaul bottleneck of 5G Heterogeneous Networks (HetNets). To effectively utilize the spectrum resource as well as reduce the transmission load of backhaul links, we propose a joint Context-aware Data Caching and Resource Allocation (CDCRA) scheme for self-backhauled HetNets aiming at maximizing the total system throughput. Context-aware technology combined with many-to-many matching theory is utilized for data caching in small base stations (SBSs). Then interference management based on graph theory is considered when allocating spectrum resource for both access links and backhaul links. Different comparison schemes are designed to verify the performance of our proposed scheme. Simulation results indicate that the total system throughput is significantly improved by CDCRA scheme comparing with other data caching and resource allocation schemes.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"10 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":"126955233","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}
This paper proposes a receiver based on diversity combining to improve the performance of asymmetrically clipped optical single-carrier frequency-division multiplexing (ACO-SCFDM) for intensity-modulated and direct-detection (IM/DD) optical transmission systems. Furthermore, a simplified encoding with low computational complexity of O(N) is proposed at the receiver. The simulation results indicate that the proposed receiver for ACO-SCFDM outperforms the conventional receiver by 1.5dB at the 7% forward error correction (FEC) limit.
{"title":"Diversity Combining for ACO-SCFDM in Intensity-Modulated and Direct-Detection Systems","authors":"Shuangyue Liu, Ji Zhou, Mengqi Guo, Xizi Tang, Tiantian Zhang, Jia Qi, Xuekai Xu, Yueming Lu, Yaojun Qiao","doi":"10.1109/ICCCHINA.2018.8641179","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641179","url":null,"abstract":"This paper proposes a receiver based on diversity combining to improve the performance of asymmetrically clipped optical single-carrier frequency-division multiplexing (ACO-SCFDM) for intensity-modulated and direct-detection (IM/DD) optical transmission systems. Furthermore, a simplified encoding with low computational complexity of O(N) is proposed at the receiver. The simulation results indicate that the proposed receiver for ACO-SCFDM outperforms the conventional receiver by 1.5dB at the 7% forward error correction (FEC) limit.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"155 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":"115996068","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.8641200
Peng Yuan, Zhihua Yang, Qinyu Zhang, Ye Wang
Recently, a variety of time-varying graphs, such as space-time graph and event-driven graph, are widely employed for modelling the dynamic topologies of satellite Disruption-Tolerant Networking (DTN) network with periodic orbital motions of satellite platforms. As the major criterion of delivering a file of targeted data, however, Task-based End-to-end Delivery Delay (TEDD) is hardly evaluated by using the current methods of graphs due to their intrinsic incapability in precision. In this paper, a topology-driven Updated Discrete Graph (UDG) is proposed for confining the low bound of TEDD with a given delivery task by using a tailored edges capacity. In particular, a Minimum TEDD Routing Strategy (MTRS) is designed through solving a correspondingly integral Min-Max optimization problem. The simulation results verifies the advantage of MTRS for TEDD compared with two typical graph algorithms under a group of specific satellite network scenarios.
{"title":"A Minimum Task-Based End-to-end Delivery Delay Routing Strategy With Updated Discrete Graph for Satellite Disruption-Tolerant Networks","authors":"Peng Yuan, Zhihua Yang, Qinyu Zhang, Ye Wang","doi":"10.1109/ICCCHINA.2018.8641200","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641200","url":null,"abstract":"Recently, a variety of time-varying graphs, such as space-time graph and event-driven graph, are widely employed for modelling the dynamic topologies of satellite Disruption-Tolerant Networking (DTN) network with periodic orbital motions of satellite platforms. As the major criterion of delivering a file of targeted data, however, Task-based End-to-end Delivery Delay (TEDD) is hardly evaluated by using the current methods of graphs due to their intrinsic incapability in precision. In this paper, a topology-driven Updated Discrete Graph (UDG) is proposed for confining the low bound of TEDD with a given delivery task by using a tailored edges capacity. In particular, a Minimum TEDD Routing Strategy (MTRS) is designed through solving a correspondingly integral Min-Max optimization problem. The simulation results verifies the advantage of MTRS for TEDD compared with two typical graph algorithms under a group of specific satellite network scenarios.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"20 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":"116113186","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.8641217
Zhongwu Xiang, Weiwei Yang, Yueming Cai, Yunpeng Cheng, Heng Wu, M. Wang
This paper investigates physical layer security (PLS) of uplink non-orthogonal multiple access (NOMA) in Internet of Things (IoT) networks, where two devices transmit secret information to base station or access point simultaneously under the intercepting of an eavesdropper (Eve). The new closed-form expressions of joint connection outage probability (JCOP), joint secrecy outage probability (JSOP) and sum secrecy throughput (SST) are derived over Nakagami-m fading channels to indicate the impact of parameters, i.e., transmit power and codeword rates, on secrecy performance. Simulation results are obtained to verify our analysis and allow an easy design of transmit power and wiretap code rates which maximizes the SST.
{"title":"Secrecy Performance Analysis of Uplink NOMA in IoT Networks","authors":"Zhongwu Xiang, Weiwei Yang, Yueming Cai, Yunpeng Cheng, Heng Wu, M. Wang","doi":"10.1109/ICCCHINA.2018.8641217","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641217","url":null,"abstract":"This paper investigates physical layer security (PLS) of uplink non-orthogonal multiple access (NOMA) in Internet of Things (IoT) networks, where two devices transmit secret information to base station or access point simultaneously under the intercepting of an eavesdropper (Eve). The new closed-form expressions of joint connection outage probability (JCOP), joint secrecy outage probability (JSOP) and sum secrecy throughput (SST) are derived over Nakagami-m fading channels to indicate the impact of parameters, i.e., transmit power and codeword rates, on secrecy performance. Simulation results are obtained to verify our analysis and allow an easy design of transmit power and wiretap code rates which maximizes the SST.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"26 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":"122071430","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.8641167
Zejin Li, Shaohua Wu, M. Ma, J. Jiao, Weiqiang Wu, Qinyu Zhang
The Distributed Compressive Video Sensing (DCVS) system combines advantages of compressive sensing and distributed video coding to adapt to the limited-resource video sensing and transmission environment. To improve the reconstruction quality of non key frame which is also called CS frame , the reconstructed key (K) frames are used to generate side information (SI) frames of the CS frames. Therefore, the quality of SI frames greatly affects the reconstruction results of CS frames. However, in conventional distributed compressed video sensing schemes, the quality of SI frames does not achieve the ideal. Because of this, in the current study, a new motion estimation (ME) method called High Efficiency Video Coding motion estimation (HEVC-ME) is proposed for generating more accurate SI to improve the reconfiguration effect of CS frames. In the proposed HEVC-ME, a better estimation result is obtained by performing motion estimation with coding units (CU) of different sizes and using the SATD function as the rate-distortion function, and the generated SI frame retains more detailed information. In addition, we propose an motion estimation (MV) prediction algorithm that further utilizes the motion correlation between adjacent coding units within the video frame on the basis of HEVC-ME. Before the ME, the search starting point is compensated to obtain a more accurate search range to enhance the quality of the SI frame. Experimental results demonstrate that the overall performance of the proposed scheme surpasses that of traditional methods.
分布式压缩视频感知(DCVS)系统结合了压缩感知和分布式视频编码的优点，以适应资源有限的视频感知和传输环境。为了提高非关键帧(也称为CS帧)的重构质量，利用重构后的关键帧(K)生成CS帧的边信息帧(SI)。因此，SI帧的质量对CS帧的重建效果影响很大。然而，在传统的分布式压缩视频感知方案中，SI帧的质量并不能达到理想的效果。因此，本研究提出了一种新的运动估计方法——高效视频编码运动估计(High Efficiency Video Coding motion estimation, HEVC-ME)，用于生成更精确的SI，以提高CS帧的重构效果。在本文提出的HEVC-ME中，采用不同大小的编码单元(CU)进行运动估计，并使用SATD函数作为速率失真函数，获得了较好的估计结果，生成的SI帧保留了更详细的信息。此外，我们提出了一种运动估计(MV)预测算法，该算法在HEVC-ME的基础上进一步利用视频帧内相邻编码单元之间的运动相关性。在进行ME之前，对搜索起点进行了补偿，得到了更精确的搜索范围，提高了SI帧的质量。实验结果表明，该方法的总体性能优于传统方法。
{"title":"Improved Distributed Compressive Video Sensing Based on HEVC Motion Estimation","authors":"Zejin Li, Shaohua Wu, M. Ma, J. Jiao, Weiqiang Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641167","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641167","url":null,"abstract":"The Distributed Compressive Video Sensing (DCVS) system combines advantages of compressive sensing and distributed video coding to adapt to the limited-resource video sensing and transmission environment. To improve the reconstruction quality of non key frame which is also called CS frame , the reconstructed key (K) frames are used to generate side information (SI) frames of the CS frames. Therefore, the quality of SI frames greatly affects the reconstruction results of CS frames. However, in conventional distributed compressed video sensing schemes, the quality of SI frames does not achieve the ideal. Because of this, in the current study, a new motion estimation (ME) method called High Efficiency Video Coding motion estimation (HEVC-ME) is proposed for generating more accurate SI to improve the reconfiguration effect of CS frames. In the proposed HEVC-ME, a better estimation result is obtained by performing motion estimation with coding units (CU) of different sizes and using the SATD function as the rate-distortion function, and the generated SI frame retains more detailed information. In addition, we propose an motion estimation (MV) prediction algorithm that further utilizes the motion correlation between adjacent coding units within the video frame on the basis of HEVC-ME. Before the ME, the search starting point is compensated to obtain a more accurate search range to enhance the quality of the SI frame. Experimental results demonstrate that the overall performance of the proposed scheme surpasses that of traditional methods.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"10 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":"117296591","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.8641145
K. Guo, K. An, D. Guo, Yu-zhen Huang, Bangning Zhang
This paper investigates the joint effects of hardware impairments (HIs) and imperfect channel state information (CSI) on the cognitive satellite-terrestrial relay networks (CSTRN) with multiple primary users (PUs). The satellite links are assumed to follow the Shadowed-Rician (SR) fading, while the terrestrial links follow the Rayleigh fading. Specifically, we derive the closed-form expressions of the outage probability (OP) and throughout for the considered CSTRN which is interfered by the multiple adjacent terrestrial primary users’ (PUs) interference. Moreover, in order to evaluate the effect of HIs and outdated CSI on the system performance at high signal-to-noise ratios (SNRs), the asymptotic analysis is also presented. Furthermore, computer simulation results are presented to validate the correctness of our analytical results.
{"title":"Cognitive Satellite Terrestrial Relay Networks with Hardware Impairments and Outdated CSI","authors":"K. Guo, K. An, D. Guo, Yu-zhen Huang, Bangning Zhang","doi":"10.1109/ICCCHINA.2018.8641145","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641145","url":null,"abstract":"This paper investigates the joint effects of hardware impairments (HIs) and imperfect channel state information (CSI) on the cognitive satellite-terrestrial relay networks (CSTRN) with multiple primary users (PUs). The satellite links are assumed to follow the Shadowed-Rician (SR) fading, while the terrestrial links follow the Rayleigh fading. Specifically, we derive the closed-form expressions of the outage probability (OP) and throughout for the considered CSTRN which is interfered by the multiple adjacent terrestrial primary users’ (PUs) interference. Moreover, in order to evaluate the effect of HIs and outdated CSI on the system performance at high signal-to-noise ratios (SNRs), the asymptotic analysis is also presented. Furthermore, computer simulation results are presented to validate the correctness of our analytical results.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"30 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":"117303293","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.8641160
Zexu Li, L. Liu, Yong Li, M. Peng
A joint resource slicing (JRS) method for the uplink of an OFDMA-based cloud RAN is proposed in this paper. We try to maximize the system utilization by joint subcarrier, power and fronthual rate allocation, while considering different requirements for multiple slices. We define weighted utilization functions which consider the combination of data rate and power consumption. Therefore, the customization can be achieved by adjusting the value of weights for each slice. This method is then formulated as an optimization problem which is solved by using dual decomposition method. Besides, a suboptimal solution which reduces computational complexity is also provided in this paper. Simulation results indicate that our JRS method can improve resource utilization while achieving isolation and customization between slices compared with static reservation method.
{"title":"Joint Resource Slicing for Uplink in OFDMA-Based Cloud RAN","authors":"Zexu Li, L. Liu, Yong Li, M. Peng","doi":"10.1109/ICCCHINA.2018.8641160","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641160","url":null,"abstract":"A joint resource slicing (JRS) method for the uplink of an OFDMA-based cloud RAN is proposed in this paper. We try to maximize the system utilization by joint subcarrier, power and fronthual rate allocation, while considering different requirements for multiple slices. We define weighted utilization functions which consider the combination of data rate and power consumption. Therefore, the customization can be achieved by adjusting the value of weights for each slice. This method is then formulated as an optimization problem which is solved by using dual decomposition method. Besides, a suboptimal solution which reduces computational complexity is also provided in this paper. Simulation results indicate that our JRS method can improve resource utilization while achieving isolation and customization between slices compared with static reservation method.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"34 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":"127700220","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
扫码关注我们
求助内容：
应助结果提醒方式：