In this paper, a new Belief Propagation (BP) decoding algorithm named Piggybacking Belief Propagation (PBP) decoding algorithm is proposed for rateless codes based on repeat-accumulate (RA) structure over AWGN channel. The "piggybacking" characteristic of the proposed algorithm is transmitting the Log-Likelihood Ratio (LLR) results calculated from the previous decode attempt to the new decoding process after receiving more information from the channel. Moreover, the proposed algorithm introduces a new stopping criterion to stop the decoding attempt when it is almost impossible to succeed. The stopping criterion is based on the weight change ratio of syndrome. The simulation results show that, compared with the traditional BP decoding algorithm, the proposed algorithm has lower decoding overhead and the a reduced decoding delay.
{"title":"Piggybacking Belief Propagation Decoding for Rateless Codes Based on RA Structure","authors":"Rong Sun, Meng-Di Zhao, Jingwei Liu, Jingyuan Sun, Hao Guan, Zhuyan Zhao","doi":"10.1109/ICCCHINA.2018.8641154","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641154","url":null,"abstract":"In this paper, a new Belief Propagation (BP) decoding algorithm named Piggybacking Belief Propagation (PBP) decoding algorithm is proposed for rateless codes based on repeat-accumulate (RA) structure over AWGN channel. The \"piggybacking\" characteristic of the proposed algorithm is transmitting the Log-Likelihood Ratio (LLR) results calculated from the previous decode attempt to the new decoding process after receiving more information from the channel. Moreover, the proposed algorithm introduces a new stopping criterion to stop the decoding attempt when it is almost impossible to succeed. The stopping criterion is based on the weight change ratio of syndrome. The simulation results show that, compared with the traditional BP decoding algorithm, the proposed algorithm has lower decoding overhead and the a reduced decoding delay.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"92 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":"126546339","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.8641227
Tian Ma, Lei Tian, Jian-hua Zhang, Zhen Zhang
MIMO OTA testing is a promising solution to evaluate terminal performance. Standards like 3GPP and CTIA are investigating different MIMO OTA testing methods, thus test results from different labs are needed. However, there is no standard for MIMO OTA testing with 3D channel model until now. In this paper, we have verified 2D channel model parameters in MPAC and investigated the spatial correlation of 3D channel model by simulating it on channel emulator. The performance comparison between 2D MPAC setup and 3D MPAC setup is shown.
MIMO OTA测试是评估终端性能的一种很有前途的解决方案。3GPP和CTIA等标准正在研究不同的MIMO OTA测试方法，因此需要来自不同实验室的测试结果。然而，目前还没有3D通道模型的MIMO OTA测试标准。本文在MPAC中对二维通道模型参数进行了验证，并在通道模拟器上对三维通道模型进行了仿真，研究了通道模型的空间相关性。给出了二维MPAC设置和三维MPAC设置的性能比较。
{"title":"MIMO OTA Channel Verification and Performance Testing","authors":"Tian Ma, Lei Tian, Jian-hua Zhang, Zhen Zhang","doi":"10.1109/ICCCHINA.2018.8641227","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641227","url":null,"abstract":"MIMO OTA testing is a promising solution to evaluate terminal performance. Standards like 3GPP and CTIA are investigating different MIMO OTA testing methods, thus test results from different labs are needed. However, there is no standard for MIMO OTA testing with 3D channel model until now. In this paper, we have verified 2D channel model parameters in MPAC and investigated the spatial correlation of 3D channel model by simulating it on channel emulator. The performance comparison between 2D MPAC setup and 3D MPAC setup is shown.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"99 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":"123080311","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.8641139
Jianzhi Li, B. Ai, R. He, Mi Yang, Z. Zhong, Y. Hao
In this paper, a massive MIMO channel measurement campaign is conducted at 11 GHz in an indoor lobby environment. The measurements use two types of 256-element virtual uniform rectangular arrays (URAs), i.e., the 4×64 virtual URA and the 64×4 virtual URA. The channel characterization is presented by investigating the typical channel parameters, including average power delay profile (APDP), K factor, root mean square (RMS) delay spread, and coherence bandwidth. Moreover, the channel characteristics in angular domain are investigated by applying the space-alternating generalized expectation-maximization algorithm (SAGE). The extracted MPCs are preliminarily clustered by visual inspection, and related to the interacting objects (IO) in physical environment. To evaluate the directional dispersion at the base station (BS) side, direction spread of departure is estimated based on the SAGE estimates. The results in this paper can help to reveal the propagation mechanisms in massive MIMO channels, and provide a foundation for the design and application of the practical massive MIMO system.
{"title":"Measurement-Based Massive MIMO Channel Characterization in Lobby Environment at 11 GHz","authors":"Jianzhi Li, B. Ai, R. He, Mi Yang, Z. Zhong, Y. Hao","doi":"10.1109/ICCCHINA.2018.8641139","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641139","url":null,"abstract":"In this paper, a massive MIMO channel measurement campaign is conducted at 11 GHz in an indoor lobby environment. The measurements use two types of 256-element virtual uniform rectangular arrays (URAs), i.e., the 4×64 virtual URA and the 64×4 virtual URA. The channel characterization is presented by investigating the typical channel parameters, including average power delay profile (APDP), K factor, root mean square (RMS) delay spread, and coherence bandwidth. Moreover, the channel characteristics in angular domain are investigated by applying the space-alternating generalized expectation-maximization algorithm (SAGE). The extracted MPCs are preliminarily clustered by visual inspection, and related to the interacting objects (IO) in physical environment. To evaluate the directional dispersion at the base station (BS) side, direction spread of departure is estimated based on the SAGE estimates. The results in this paper can help to reveal the propagation mechanisms in massive MIMO channels, and provide a foundation for the design and application of the practical massive MIMO system.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"94 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":"126326545","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.8641109
Dandi Wang, Siye Wang
This paper focuses on outage performance for full-duplex (FD) decode-and-forward (DF) multi-relay networks with low-resolution analog-to-digital converters (ADCs). FD operation enables the relay to transmit and receive over same frequency band concurrently. Therefore, loop interference (LI) caused by signal leakage from transmitter deteriorates system performance. Based on instantaneous end-to-end capacity, we propose two relay selection strategies, including max signal-to-interference-plus-noise ratio (MS) strategy and hybrid relay (HR) strategy. To facilitate comparison, closed-form outage probability expressions are obtained for them and used to analysis. In addition, impact of resolution of ADC are investigated. Final results prove that HR mode is preferable in terms of outage probability. Both number of quantization bits and location of low-resolution ADC have significant impacts on outage performance.
{"title":"Outage Performance for Full-Duplex Decode-and-Forward Relay Cooperative Networks with Low-Resolution ADCs","authors":"Dandi Wang, Siye Wang","doi":"10.1109/ICCCHINA.2018.8641109","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641109","url":null,"abstract":"This paper focuses on outage performance for full-duplex (FD) decode-and-forward (DF) multi-relay networks with low-resolution analog-to-digital converters (ADCs). FD operation enables the relay to transmit and receive over same frequency band concurrently. Therefore, loop interference (LI) caused by signal leakage from transmitter deteriorates system performance. Based on instantaneous end-to-end capacity, we propose two relay selection strategies, including max signal-to-interference-plus-noise ratio (MS) strategy and hybrid relay (HR) strategy. To facilitate comparison, closed-form outage probability expressions are obtained for them and used to analysis. In addition, impact of resolution of ADC are investigated. Final results prove that HR mode is preferable in terms of outage probability. Both number of quantization bits and location of low-resolution ADC have significant impacts on outage performance.","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":"132639703","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.8641111
Haoran Qi, Xingjian Zhang, Yue Gao
Compressive spectrum sensing (CSS) techniques alleviate the demand of high-speed sampling in wideband spectrum sensing for cognitive radio systems. Known existing literature discusses threshold adaption schemes to achieve optimal performance of channel occupancy detection in conventional non-compressive spectrum sensing scenario. However, in the CSS case, it is found that the channel energy statistics and optimal threshold not only depend on noise energy in channel but also compression ratio, the selection of recovery algorithms, etc. Therefore, we postulate a statistical model of channel energy in CSS and propose a practical threshold adaption scheme aiming to achieve constant target false alarm rate. The validity of the postulated channel energy model is verified by learning the parameters of a Mixture Model and aligning with empirical distributions. Finally, performance of the proposed threshold adaption scheme is presented and discussed.
{"title":"Channel Energy Statistics Modeling and Threshold Adaption in Compressive Spectrum Sensing","authors":"Haoran Qi, Xingjian Zhang, Yue Gao","doi":"10.1109/ICCCHINA.2018.8641111","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641111","url":null,"abstract":"Compressive spectrum sensing (CSS) techniques alleviate the demand of high-speed sampling in wideband spectrum sensing for cognitive radio systems. Known existing literature discusses threshold adaption schemes to achieve optimal performance of channel occupancy detection in conventional non-compressive spectrum sensing scenario. However, in the CSS case, it is found that the channel energy statistics and optimal threshold not only depend on noise energy in channel but also compression ratio, the selection of recovery algorithms, etc. Therefore, we postulate a statistical model of channel energy in CSS and propose a practical threshold adaption scheme aiming to achieve constant target false alarm rate. The validity of the postulated channel energy model is verified by learning the parameters of a Mixture Model and aligning with empirical distributions. Finally, performance of the proposed threshold adaption scheme is presented and discussed.","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":"134080649","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.8641202
Jiyang Bai, He Fang, Junghoon Suh, O. Aboul-Magd, E. Au, Xianbin Wang
IEEE 802.11ax, which is the next-generation WLAN standard, aims at providing highly efficient communication in ultra-dense networks. However, due to the high quantity of stations (STAs) in dense deployment scenarios, the potential high collision rate significantly degrades the network efficiency of WLAN. In this paper, we propose an adaptive grouping scheme to overcome this challenge in IEEE 802.11ax using Uplink OFD-MA Random Access (UORA). In order to achieve the optimal utilization efficiency of resource units (RUs), we first analyze the relationship between group size and RU efficiency. Based on this result, an adaptive STA grouping algorithm is proposed to cope with the performance fluctuation of 802.11ax due to remainder stations after grouping. The analysis and simulation results demonstrate that our adaptive grouping algorithm dramatically improves the performance of both the system and each STA in the ultra-dense network.
{"title":"Adaptive Uplink OFDMA Random Access Grouping Scheme for Ultra-Dense Networks in IEEE 802.11ax","authors":"Jiyang Bai, He Fang, Junghoon Suh, O. Aboul-Magd, E. Au, Xianbin Wang","doi":"10.1109/ICCCHINA.2018.8641202","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641202","url":null,"abstract":"IEEE 802.11ax, which is the next-generation WLAN standard, aims at providing highly efficient communication in ultra-dense networks. However, due to the high quantity of stations (STAs) in dense deployment scenarios, the potential high collision rate significantly degrades the network efficiency of WLAN. In this paper, we propose an adaptive grouping scheme to overcome this challenge in IEEE 802.11ax using Uplink OFD-MA Random Access (UORA). In order to achieve the optimal utilization efficiency of resource units (RUs), we first analyze the relationship between group size and RU efficiency. Based on this result, an adaptive STA grouping algorithm is proposed to cope with the performance fluctuation of 802.11ax due to remainder stations after grouping. The analysis and simulation results demonstrate that our adaptive grouping algorithm dramatically improves the performance of both the system and each STA in the ultra-dense network.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"17 5 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":"115725556","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.8641195
Xinquan Huang, A. Liu, Xiaohu Liang
In highly-mobile environments such as Vehicle Ad Hoc Networks (VANETs) or Flying Ad Hoc Networks (FANETs), the status messages that contain information on speed, position, and direction should be transmitted periodically by each vehicle in the network to its neighbors to support situation-based traffic applications. Many analytical models have been proposed to evaluate the MAC layer performance of status message transmission based on the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. However, they either fail to consider lifetime of status messages or assume a random arrival of status messages. In addition, all these models are based on the assumption that distribution of MAC layer states is unchanged with the time, which is not applicable in the periodic broadcast schemes. In this paper, we propose an analytical model where constant arrival intervals and lifetime expiration of messages are simultaneously considered. Moreover, we discard the assumption of unchanged states distribution by introducing a pure death process. The proposed model is verified with simulation data obtained by NS2, and results showed that proposed model can accurately capture the reception probability, collision probability, and discard probability of periodic broadcast messages.
在高度移动的环境中，如车辆自组织网络(VANETs)或飞行自组织网络(FANETs)，包含速度、位置和方向信息的状态信息应由网络中的每辆车定期传输到其邻居，以支持基于情况的交通应用。针对基于CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance)协议的状态消息传输的MAC层性能，提出了许多分析模型。然而，它们要么没有考虑状态消息的生命周期，要么假设状态消息是随机到达的。此外，这些模型都是基于MAC层状态随时间分布不变的假设，这在周期广播方案中是不适用的。在本文中，我们提出了一个分析模型，其中恒定的到达间隔和消息的生命周期到期同时考虑。此外，通过引入纯粹的死亡过程，我们抛弃了状态分布不变的假设。用NS2获得的仿真数据对所提模型进行了验证，结果表明所提模型能够准确地捕捉到周期性广播消息的接收概率、碰撞概率和丢弃概率。
{"title":"An Analytical Model of CSMA/CA Performance For Periodic Broadcast Scheme","authors":"Xinquan Huang, A. Liu, Xiaohu Liang","doi":"10.1109/ICCCHINA.2018.8641195","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641195","url":null,"abstract":"In highly-mobile environments such as Vehicle Ad Hoc Networks (VANETs) or Flying Ad Hoc Networks (FANETs), the status messages that contain information on speed, position, and direction should be transmitted periodically by each vehicle in the network to its neighbors to support situation-based traffic applications. Many analytical models have been proposed to evaluate the MAC layer performance of status message transmission based on the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. However, they either fail to consider lifetime of status messages or assume a random arrival of status messages. In addition, all these models are based on the assumption that distribution of MAC layer states is unchanged with the time, which is not applicable in the periodic broadcast schemes. In this paper, we propose an analytical model where constant arrival intervals and lifetime expiration of messages are simultaneously considered. Moreover, we discard the assumption of unchanged states distribution by introducing a pure death process. The proposed model is verified with simulation data obtained by NS2, and results showed that proposed model can accurately capture the reception probability, collision probability, and discard probability of periodic broadcast messages.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"2009 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":"125603133","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.8641091
Mingyang Yang, Qi Zhang, Yuliang Tu, Hui Yu
As the rapid development of wireless communication, a growing number of communication systems generate multi-priority traffic, and different priority traffic has different requirements on delay and loss rate. Statistical priority-based multiple access protocol (SPMA) can be applied to these systems by virtue of its high-reliability and low-delay characteristics. In this paper, we propose a non-preemptive M/M/1/K queuing model to analyze the performance of different priority traffic in SPMA in terms of the average packet loss rate and the average packet delay. Firstly, we take no account of threshold of channel occupancy. Through analyzing the process of state transition, we can get the steady-state probability of the model. The loss rate and delay can be obtained based on the steady-state probability. Then, we extend to the case in consideration of threshold. Extensive simulations demonstrate that loss rate values and delay values obtained from our analytical model closely match the simulation results under various offered loads. More importantly, our model can enable designers to obtain a better understanding of the effect of protocol parameters on the performance of SPMA.
{"title":"Modeling and Performance Analysis of Statistical Priority-based Multiple Access Protocol","authors":"Mingyang Yang, Qi Zhang, Yuliang Tu, Hui Yu","doi":"10.1109/ICCCHINA.2018.8641091","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641091","url":null,"abstract":"As the rapid development of wireless communication, a growing number of communication systems generate multi-priority traffic, and different priority traffic has different requirements on delay and loss rate. Statistical priority-based multiple access protocol (SPMA) can be applied to these systems by virtue of its high-reliability and low-delay characteristics. In this paper, we propose a non-preemptive M/M/1/K queuing model to analyze the performance of different priority traffic in SPMA in terms of the average packet loss rate and the average packet delay. Firstly, we take no account of threshold of channel occupancy. Through analyzing the process of state transition, we can get the steady-state probability of the model. The loss rate and delay can be obtained based on the steady-state probability. Then, we extend to the case in consideration of threshold. Extensive simulations demonstrate that loss rate values and delay values obtained from our analytical model closely match the simulation results under various offered loads. More importantly, our model can enable designers to obtain a better understanding of the effect of protocol parameters on the performance of SPMA.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"103 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":"124291202","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.8641085
Youbing Hu, Lixin Li, Jiaying Yin, Huisheng Zhang, Wei Liang, Ang Gao, Zhu Han
Antenna selection is often used for physical layer security to implement secure communications. However, due to the rapid changes of the main channel and the feedback delay of the channel state information (CSI), the transmitter obtains outdated CSI, and the outdated CSI leads to the outdated optimal transmit antenna. In order to improve the security of the system based on outdated CSI, in this paper, we propose a deep reinforcement learning framework of Deep Q Network (DQN) to predict the optimal transmit antenna in the multiple input multiple output (MIMO) wiretap channel. The legitimate receiver receives the pilot signals from each transmitting antenna, and the signal-to-noise ratio (SNR) of the pilot signals transmitted by each transmitting antenna can be obtained through maximal ratio combining. And then the legitimate receiver uses the DQN to predict the transmitting antenna at the next moment according to these SNRs. The simulation results show that DQN algorithm can effectively predict the optimal antenna at the next moment, and reduce the secrecy outage probability of MIMO wiretap system, compared with the traditional algorithm.
{"title":"Optimal Transmit Antenna Selection Strategy for MIMO Wiretap Channel Based on Deep Reinforcement Learning","authors":"Youbing Hu, Lixin Li, Jiaying Yin, Huisheng Zhang, Wei Liang, Ang Gao, Zhu Han","doi":"10.1109/ICCCHINA.2018.8641085","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641085","url":null,"abstract":"Antenna selection is often used for physical layer security to implement secure communications. However, due to the rapid changes of the main channel and the feedback delay of the channel state information (CSI), the transmitter obtains outdated CSI, and the outdated CSI leads to the outdated optimal transmit antenna. In order to improve the security of the system based on outdated CSI, in this paper, we propose a deep reinforcement learning framework of Deep Q Network (DQN) to predict the optimal transmit antenna in the multiple input multiple output (MIMO) wiretap channel. The legitimate receiver receives the pilot signals from each transmitting antenna, and the signal-to-noise ratio (SNR) of the pilot signals transmitted by each transmitting antenna can be obtained through maximal ratio combining. And then the legitimate receiver uses the DQN to predict the transmitting antenna at the next moment according to these SNRs. The simulation results show that DQN algorithm can effectively predict the optimal antenna at the next moment, and reduce the secrecy outage probability of MIMO wiretap system, compared with the traditional algorithm.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"181 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":"133847639","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.8641208
Jiajia Wu, Li Wang, Chu Hua, Wei Zhao, Ge Wang, Jianbin Chuan
Wireless distributed storage systems can potentially relieve the burden of the wireless access point caused by the rapidly increasing mobile users and emergence of network services. Specifically, considering the concept of distributed system and user mobility, we demonstrate an erasure code based wireless distributed storage system (WDSS), which is well designed to handle storage capacity limitation, power limitation and data loss caused by the disconnection from wireless users. We realize efficient and reliable content sharing between mobile users, thus increasing wireless service response speed and reducing the pressure of data traffic on the wireless access point. The demonstration of the system consists of 3 components, a WDSS server, a wireless AP and the user application. Furthermore, both openWrt based Wi-Fi access and OpenAirInterface (OAI) based cellular access can be implemented by the wireless AP.
{"title":"An Erasure Code Based Wireless Distributed Storage System Implementation","authors":"Jiajia Wu, Li Wang, Chu Hua, Wei Zhao, Ge Wang, Jianbin Chuan","doi":"10.1109/ICCCHINA.2018.8641208","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641208","url":null,"abstract":"Wireless distributed storage systems can potentially relieve the burden of the wireless access point caused by the rapidly increasing mobile users and emergence of network services. Specifically, considering the concept of distributed system and user mobility, we demonstrate an erasure code based wireless distributed storage system (WDSS), which is well designed to handle storage capacity limitation, power limitation and data loss caused by the disconnection from wireless users. We realize efficient and reliable content sharing between mobile users, thus increasing wireless service response speed and reducing the pressure of data traffic on the wireless access point. The demonstration of the system consists of 3 components, a WDSS server, a wireless AP and the user application. Furthermore, both openWrt based Wi-Fi access and OpenAirInterface (OAI) based cellular access can be implemented by the wireless AP.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"67 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":"122354823","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
扫码关注我们
求助内容：
应助结果提醒方式：