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.8641250
Yue Zhu, Gongpu Wang, Hengliang Tang, R. He, Yulong Zou
Recently, ambient backscatter has attracted much attention since it enables battery-free devices to communicate with other devices by utilizing environmental radio frequency signals. Existing studies about ambient backscatter often assume flat fading channels. In fact, most practical channels are frequency-selective. Thus, in this paper, we consider the ambient backscatter communication systems over frequency-selective channels and focus on the problem of channel estimation. Specifically, we first adopt the least square (LS) algorithm to obtain the estimates of channel parameters when the tag is in different states. Next, an iterative estimator is proposed to improve the estimation performance. In addition, the Cramér-Rao Lower Bounds (CRLBs) for different channel parameters are derived to evaluate the mean square error (MSE) performance. Finally, simulation results are provided to corroborate the proposed studies.
{"title":"Channel Estimation for Ambient Backscatter Systems over Frequency-Selective Channels","authors":"Yue Zhu, Gongpu Wang, Hengliang Tang, R. He, Yulong Zou","doi":"10.1109/ICCCHINA.2018.8641250","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641250","url":null,"abstract":"Recently, ambient backscatter has attracted much attention since it enables battery-free devices to communicate with other devices by utilizing environmental radio frequency signals. Existing studies about ambient backscatter often assume flat fading channels. In fact, most practical channels are frequency-selective. Thus, in this paper, we consider the ambient backscatter communication systems over frequency-selective channels and focus on the problem of channel estimation. Specifically, we first adopt the least square (LS) algorithm to obtain the estimates of channel parameters when the tag is in different states. Next, an iterative estimator is proposed to improve the estimation performance. In addition, the Cramér-Rao Lower Bounds (CRLBs) for different channel parameters are derived to evaluate the mean square error (MSE) performance. Finally, simulation results are provided to corroborate the proposed studies.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"12 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":"130188249","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.8641231
Xiaoyu Suo, J. Jiao, K. Zhang, Yunyu Sun, Shaohua Wu, Qinyu Zhang
Space information networks (SINs) is viewed as an effective solution to provide broadband access in a seamless and cost-effective manner for future machine-to-machine communications. Moreover, massive multiple-input multiple-output (MIMO) technology over satellites has received a great deal of interests. To solve the problem of pilot collision in the crowded massive MIMO system for SIN, a joint random pilot and multi-slot access (JRPMSA) protocol is proposed. Our JRPMSA protocol allows the failed user equipments (UEs) to reselect a pilot from the remaining pilots in multi-slots, i.e., the pilots that are not selected by any UE or selected by more than one UE in the initial step. The random access satellite estimates and buffers the channel response on each pilot of each UE in multi-slots. By utilizing the and-or tree theory, we analyzed the performance of the JRPMSA protocol, mainly focus on the access failure probability and uplink throughput. Simulation results shows that the proposed JRPMSA protocol can obviously decrease the access failure probability and increase the peak throughput.
{"title":"Joint Random Pilot and Multi-Slot Access in Massive MIMO for Space Information Networks","authors":"Xiaoyu Suo, J. Jiao, K. Zhang, Yunyu Sun, Shaohua Wu, Qinyu Zhang","doi":"10.1109/ICCCHINA.2018.8641231","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641231","url":null,"abstract":"Space information networks (SINs) is viewed as an effective solution to provide broadband access in a seamless and cost-effective manner for future machine-to-machine communications. Moreover, massive multiple-input multiple-output (MIMO) technology over satellites has received a great deal of interests. To solve the problem of pilot collision in the crowded massive MIMO system for SIN, a joint random pilot and multi-slot access (JRPMSA) protocol is proposed. Our JRPMSA protocol allows the failed user equipments (UEs) to reselect a pilot from the remaining pilots in multi-slots, i.e., the pilots that are not selected by any UE or selected by more than one UE in the initial step. The random access satellite estimates and buffers the channel response on each pilot of each UE in multi-slots. By utilizing the and-or tree theory, we analyzed the performance of the JRPMSA protocol, mainly focus on the access failure probability and uplink throughput. Simulation results shows that the proposed JRPMSA protocol can obviously decrease the access failure probability and increase the peak throughput.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"106 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":"122446308","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.8641260
Xiaonan Liu, Guan Gui, Nan Zhao, W. Meng, Zan Li, Yunfei Chen, F. Adachi
Unmanned aerial vehicles (UAVs) can be exploited to provide emergency coverage in disasters, due to its mobility and flexibility. In this paper, we propose multi-antenna precoding design and multi-hop device-to-device (D2D) communication to guarantee the reliable transmission and extend the UAV coverage for downlink in disasters. Firstly, multi-hop D2D links are established to extend the coverage of UAV emergency networks with limited transmit power. In particular, a shortest-path-routing algorithm is proposed to establish the D2D links rapidly with minimum nodes, with closed-form solutions for the number of hops derived. Secondly, the precoding design for the UAV downlink is studied, to optimize the performance of UAV transmission. Due to the non-convexity of the problem, a second-order-cone programming based algorithm is proposed to solve it efficiently. Simulation results show the effectiveness of the proposed schemes for UAV coverage in disasters.
{"title":"UAV Coverage for Downlink in Disasters: Precoding and Multi-hop D2D","authors":"Xiaonan Liu, Guan Gui, Nan Zhao, W. Meng, Zan Li, Yunfei Chen, F. Adachi","doi":"10.1109/ICCCHINA.2018.8641260","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641260","url":null,"abstract":"Unmanned aerial vehicles (UAVs) can be exploited to provide emergency coverage in disasters, due to its mobility and flexibility. In this paper, we propose multi-antenna precoding design and multi-hop device-to-device (D2D) communication to guarantee the reliable transmission and extend the UAV coverage for downlink in disasters. Firstly, multi-hop D2D links are established to extend the coverage of UAV emergency networks with limited transmit power. In particular, a shortest-path-routing algorithm is proposed to establish the D2D links rapidly with minimum nodes, with closed-form solutions for the number of hops derived. Secondly, the precoding design for the UAV downlink is studied, to optimize the performance of UAV transmission. Due to the non-convexity of the problem, a second-order-cone programming based algorithm is proposed to solve it efficiently. Simulation results show the effectiveness of the proposed schemes for UAV coverage in disasters.","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":"122319208","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}
Pub Date : 2018-08-01DOI: 10.1109/ICCCHINA.2018.8641170
Tse-Tin Chan, T. Lok
In this paper, we propose the ideas of signal-aligned network coding (SNC). We present the ideas in two-user time-varying interference channels with limited receiver cooperation. We assume that the receivers are connected to a central processor via wired cooperation links with individual limited capacities. Our SNC scheme determines the precoding matrices of the transmitters so that the transmitted signals are aligned at the receivers. The aligned signals are then decoded into linear combinations of messages by physical-layer network coding strategy. The key idea of our scheme is to ensure that independent linear combinations of messages, also known as network-coded messages, can be decoded at the receivers. Hence the central processor can recover the original messages of the transmitters by solving the linearly independent equations. We prove that our SNC scheme achieves full degrees of freedom (DoF) by utilizing signal alignment and physical-layer network coding. Simulation results show the DoF achieved by our SNC scheme almost doubles that by the orthogonal transmission scheme in two-user time-varying interference channels with limited receiver cooperation. The performance improvement of our SNC scheme mainly comes from efficient utilization of the signal subspaces for conveying independent linear combinations of messages to the central processor.
{"title":"Signal-Aligned Network Coding in Interference Channels with Limited Receiver Cooperation","authors":"Tse-Tin Chan, T. Lok","doi":"10.1109/ICCCHINA.2018.8641170","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641170","url":null,"abstract":"In this paper, we propose the ideas of signal-aligned network coding (SNC). We present the ideas in two-user time-varying interference channels with limited receiver cooperation. We assume that the receivers are connected to a central processor via wired cooperation links with individual limited capacities. Our SNC scheme determines the precoding matrices of the transmitters so that the transmitted signals are aligned at the receivers. The aligned signals are then decoded into linear combinations of messages by physical-layer network coding strategy. The key idea of our scheme is to ensure that independent linear combinations of messages, also known as network-coded messages, can be decoded at the receivers. Hence the central processor can recover the original messages of the transmitters by solving the linearly independent equations. We prove that our SNC scheme achieves full degrees of freedom (DoF) by utilizing signal alignment and physical-layer network coding. Simulation results show the DoF achieved by our SNC scheme almost doubles that by the orthogonal transmission scheme in two-user time-varying interference channels with limited receiver cooperation. The performance improvement of our SNC scheme mainly comes from efficient utilization of the signal subspaces for conveying independent linear combinations of messages to the central processor.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"29 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":"126481695","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.8641257
He Huang, Chaowei Yuan
In this study, product of two independent and non-identically distributed (i.n.i.d.) random variables (RVs) for κ-μ fading distribution and α-μ fading distribution is considered. The novel exact series formulas for the product of two i.n.i.d. fading distributions κ-μ and α-μ are derived instead of Fox H-function to solve the problem that Fox H-function with multiple RVs cannot be implemented in professional mathematical software packages as MATHEMATICA and MAPLE. Exact close-form expressions of probability density function (PDF) and cumulative distribution function (CDF) are deduced to represent provided product expressions and generalized composite multipath shadowing models. At last, these analytical results are validated with Monte Carlo simulations, it shows that for provided κ-μ/α-μ model nonlinear parameter has more important influence than multipath component in PDF and CDF when the ratio between the total power of the dominant components and the total power of the scattered waves is same.
{"title":"Product of κ-μ and α-μ Distributions and Their Composite Fading Distributions","authors":"He Huang, Chaowei Yuan","doi":"10.1109/ICCCHINA.2018.8641257","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641257","url":null,"abstract":"In this study, product of two independent and non-identically distributed (i.n.i.d.) random variables (RVs) for κ-μ fading distribution and α-μ fading distribution is considered. The novel exact series formulas for the product of two i.n.i.d. fading distributions κ-μ and α-μ are derived instead of Fox H-function to solve the problem that Fox H-function with multiple RVs cannot be implemented in professional mathematical software packages as MATHEMATICA and MAPLE. Exact close-form expressions of probability density function (PDF) and cumulative distribution function (CDF) are deduced to represent provided product expressions and generalized composite multipath shadowing models. At last, these analytical results are validated with Monte Carlo simulations, it shows that for provided κ-μ/α-μ model nonlinear parameter has more important influence than multipath component in PDF and CDF when the ratio between the total power of the dominant components and the total power of the scattered waves is same.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"44 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":"128149144","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.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.8641181
Yuyan Zhao, Yanan Liu, G. Boudreau, A. B. Sediq, Xianbin Wang
In order to exploit the potential capacity of 5G, the combination of millimeter-wave (mmWave) and massive multiple input multiple output (MIMO) techniques provides a promising solution through beamforming. However, the extremely high carrier frequency dramatically reduces the channel coherence time, leading to frequent channel estimation and substantially increased overhead for the conventional channel information based beamforming. In this paper, we propose an angle-based beamforming scheme to reduce the overhead of beamforming by increasing the beam serving period. A novel multi-zone beamforming technique is proposed to support users with different distance to base station (BS) adaptively, while the selected users in the same zone could be served for a longer period due to similar angular statistics. The simulation results show that the throughput of our scheme is close to the instantaneous beamforming, while the real minimum serving time of chosen beams is hundreds times of the channel coherence time.
{"title":"A Low Overhead Angle-based Beamforming Using Multi-Pattern Codebooks for mmWave Massive MIMO Systems","authors":"Yuyan Zhao, Yanan Liu, G. Boudreau, A. B. Sediq, Xianbin Wang","doi":"10.1109/ICCCHINA.2018.8641181","DOIUrl":"https://doi.org/10.1109/ICCCHINA.2018.8641181","url":null,"abstract":"In order to exploit the potential capacity of 5G, the combination of millimeter-wave (mmWave) and massive multiple input multiple output (MIMO) techniques provides a promising solution through beamforming. However, the extremely high carrier frequency dramatically reduces the channel coherence time, leading to frequent channel estimation and substantially increased overhead for the conventional channel information based beamforming. In this paper, we propose an angle-based beamforming scheme to reduce the overhead of beamforming by increasing the beam serving period. A novel multi-zone beamforming technique is proposed to support users with different distance to base station (BS) adaptively, while the selected users in the same zone could be served for a longer period due to similar angular statistics. The simulation results show that the throughput of our scheme is close to the instantaneous beamforming, while the real minimum serving time of chosen beams is hundreds times of the channel coherence time.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"77 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":"128988384","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
扫码关注我们
求助内容：
应助结果提醒方式：