Pub Date : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9129396
Juanjuan Ren, Xianfu Lei, P. Diamantoulakis, Qingchun Chen, G. Karagiannidis
In this paper, we investigate a secure relaying network with simultaneous wireless information and power transfer (SWIPT). It is assumed that Alice wants to send confidential information to Bob under the existence of a passive eavesdropper (Eve), while the relay is equipped with a data buffer and an energy storage device. More specifically, we aim at achieving higher secrecy throughput, while retaining the stability of the data and energy queues. To achieve this with acceptable complexity, we transform the original long-term stochastic optimization problem into a series of online subproblems using the framework of Lyapunov optimization. The proposed scheme shows that the optimal time switching factor is 0 or 1, which is different from the conventional secure relaying network with SWIPT. In addition, simulation results verify that the proposed scheme can improve the secrecy throughput compared with the baseline scheme.
{"title":"Secure Transmission Scheme Design for SWIPT in Buffer-aided Relay Networks","authors":"Juanjuan Ren, Xianfu Lei, P. Diamantoulakis, Qingchun Chen, G. Karagiannidis","doi":"10.1109/VTC2020-Spring48590.2020.9129396","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9129396","url":null,"abstract":"In this paper, we investigate a secure relaying network with simultaneous wireless information and power transfer (SWIPT). It is assumed that Alice wants to send confidential information to Bob under the existence of a passive eavesdropper (Eve), while the relay is equipped with a data buffer and an energy storage device. More specifically, we aim at achieving higher secrecy throughput, while retaining the stability of the data and energy queues. To achieve this with acceptable complexity, we transform the original long-term stochastic optimization problem into a series of online subproblems using the framework of Lyapunov optimization. The proposed scheme shows that the optimal time switching factor is 0 or 1, which is different from the conventional secure relaying network with SWIPT. In addition, simulation results verify that the proposed scheme can improve the secrecy throughput compared with the baseline scheme.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115388219","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9128942
Yao Zhang, Haotong Cao, Meng Zhou, Xu Qiao, Shengchen Wu, Longxiang Yang
In this paper, we consider a downlink cell-free massive multi-input multi-output (mMIMO) system, assuming few-bit analog-digital converters (ADCs) and digital-analog converters (DACs) are implemented at the access points (APs). Leveraging on the linear additive quantization noise model (AQNM), we derive a tight approximate rate expression, which provides insights into the impacts of the imperfect quantization error and channel estimation error. Thanks to the trackable result, we quantitatively compare the performance differences between the two quantization models, namely the AQNM and the Bussgang theorem. In particular, the AQNM can offer analytical tractability for few-bit quantization while the Bussgang theorem only characterizes 1-bit quantization since the multi-bit quantization under the Bussgang theorem is difficult to deal with. Simulation results show that under the same 1-bit quantization, the rate performance with the Bussgang theorem is roughly identical to the case of the AQNM.
{"title":"Cell-Free Massive MIMO with Few-bit ADCs/DACs: AQNM versus Bussgang","authors":"Yao Zhang, Haotong Cao, Meng Zhou, Xu Qiao, Shengchen Wu, Longxiang Yang","doi":"10.1109/VTC2020-Spring48590.2020.9128942","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9128942","url":null,"abstract":"In this paper, we consider a downlink cell-free massive multi-input multi-output (mMIMO) system, assuming few-bit analog-digital converters (ADCs) and digital-analog converters (DACs) are implemented at the access points (APs). Leveraging on the linear additive quantization noise model (AQNM), we derive a tight approximate rate expression, which provides insights into the impacts of the imperfect quantization error and channel estimation error. Thanks to the trackable result, we quantitatively compare the performance differences between the two quantization models, namely the AQNM and the Bussgang theorem. In particular, the AQNM can offer analytical tractability for few-bit quantization while the Bussgang theorem only characterizes 1-bit quantization since the multi-bit quantization under the Bussgang theorem is difficult to deal with. Simulation results show that under the same 1-bit quantization, the rate performance with the Bussgang theorem is roughly identical to the case of the AQNM.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115437549","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9129421
Myungsup Kim, Do-Young Kwak, Ji-Won Jung, Ki-Man Kim, Wanjin Kim
The next 6th generation (6G) mobile communication technologies should solve the out-of-band emission problem of cyclic prefix (CP) orthogonal frequency division multiplexing (OFDM) that the 4th generation technology did not solve in order to use frequency resources efficiently. In this study, we propose the spectral encapsulation (SE) that shapes the spectrum of OFDM signals. We also derive the orthogonalizing matrix and thoroughly analyze its characteristic. Since vector (v) SE-OFDM is a spectral shaping technique based on zero insertion without using any long filter, it can be applied to even short OFDM symbols. We build the precoder with the accurate orthogonal matrix and show that it has perfect blocking at the frequency bandwidth boundaries. Since the information transmission part of the proposed vSE-OFDM is the same as the CP-OFDM, it maintains the bit error rate (BER) performance of CP-OFDM as it is, and the complexity can be significantly improved because it can be implemented using IFFT.
{"title":"Spectral Encapsulation to Block the Out-of-Band Emission of OFDM Signals for Future Communications","authors":"Myungsup Kim, Do-Young Kwak, Ji-Won Jung, Ki-Man Kim, Wanjin Kim","doi":"10.1109/VTC2020-Spring48590.2020.9129421","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9129421","url":null,"abstract":"The next 6th generation (6G) mobile communication technologies should solve the out-of-band emission problem of cyclic prefix (CP) orthogonal frequency division multiplexing (OFDM) that the 4th generation technology did not solve in order to use frequency resources efficiently. In this study, we propose the spectral encapsulation (SE) that shapes the spectrum of OFDM signals. We also derive the orthogonalizing matrix and thoroughly analyze its characteristic. Since vector (v) SE-OFDM is a spectral shaping technique based on zero insertion without using any long filter, it can be applied to even short OFDM symbols. We build the precoder with the accurate orthogonal matrix and show that it has perfect blocking at the frequency bandwidth boundaries. Since the information transmission part of the proposed vSE-OFDM is the same as the CP-OFDM, it maintains the bit error rate (BER) performance of CP-OFDM as it is, and the complexity can be significantly improved because it can be implemented using IFFT.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116988455","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9128752
Hang Gao, Weiwei Xia, Feng Yan, Lianfeng Shen
The problem of cloud resource scheduling in smart grid is one of the hot spots in recent years. Different from most existing studies that focus on the scenario with a single service provider, this paper studies cloud resource scheduling with multiple service providers and multiple residential users. The users in this scenario can make service selection dynamically according to the service price. In turn, the price of the service providers’ resource is affected by the users’ selection. The interactive decision problem between the users and the service providers is modeled as a hierarchical game. At the lower-level, we use the evolutionary game to simulate the service selection of residential users. At the upper-level, non-cooperative game is used to simulate the competition among service providers. Then, we prove that the upper and lower level can reach the Nash equilibrium and the evolutionary equilibrium, respectively. Furthermore, we design a hierarchical game based cloud resource scheduling algorithm (HCRSA) for the proposed game framework. Simulation results show that both the upper and lower level can converge to their equilibrium after a few iterations. Compared with traditional resource scheduling method, the proposed HCRSA algorithm effectively reduces users’ payment and reaches a balance between supply and demand.
{"title":"Optimal Cloud Resource Scheduling in Smart Grid: A Hierarchical Game Approach","authors":"Hang Gao, Weiwei Xia, Feng Yan, Lianfeng Shen","doi":"10.1109/VTC2020-Spring48590.2020.9128752","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9128752","url":null,"abstract":"The problem of cloud resource scheduling in smart grid is one of the hot spots in recent years. Different from most existing studies that focus on the scenario with a single service provider, this paper studies cloud resource scheduling with multiple service providers and multiple residential users. The users in this scenario can make service selection dynamically according to the service price. In turn, the price of the service providers’ resource is affected by the users’ selection. The interactive decision problem between the users and the service providers is modeled as a hierarchical game. At the lower-level, we use the evolutionary game to simulate the service selection of residential users. At the upper-level, non-cooperative game is used to simulate the competition among service providers. Then, we prove that the upper and lower level can reach the Nash equilibrium and the evolutionary equilibrium, respectively. Furthermore, we design a hierarchical game based cloud resource scheduling algorithm (HCRSA) for the proposed game framework. Simulation results show that both the upper and lower level can converge to their equilibrium after a few iterations. Compared with traditional resource scheduling method, the proposed HCRSA algorithm effectively reduces users’ payment and reaches a balance between supply and demand.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117132712","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}
The popularization and rapid development of distributed energy becomes a trend of the times. Distributed energy prosumers should be able to trade with each other to reduce losses, increase efficiency, flexibility and economy. The traditional centralized power settlement scheme is not suitable for the utilization on the situation of distributed energy transaction settlement. Energy internet as the next generation energy system integrating cuttingedge information technologies with energy system could realize peerto- peer energy services. The distributed interactive concept of the energy trading is highly consistent with the principle of blockchain. In this paper, aiming at the problems of information disunity, trust system difficult to establish, power deviation waste and cost advance caused by power pre-sale, a power transaction asynchronous settlement system for microgrid is proposed based on blockchain technology. The experiment results illustrate that the system obtains promising performance by reasonable set grid structure which could meet the requirements of practical applications.
{"title":"Blockchain based Power Transaction Asynchronous Settlement System","authors":"Songpu Ai, Diankai Hu, Tong Zhang, Yunpeng Jiang, Chunming Rong, Junwei Cao","doi":"10.1109/VTC2020-Spring48590.2020.9129593","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9129593","url":null,"abstract":"The popularization and rapid development of distributed energy becomes a trend of the times. Distributed energy prosumers should be able to trade with each other to reduce losses, increase efficiency, flexibility and economy. The traditional centralized power settlement scheme is not suitable for the utilization on the situation of distributed energy transaction settlement. Energy internet as the next generation energy system integrating cuttingedge information technologies with energy system could realize peerto- peer energy services. The distributed interactive concept of the energy trading is highly consistent with the principle of blockchain. In this paper, aiming at the problems of information disunity, trust system difficult to establish, power deviation waste and cost advance caused by power pre-sale, a power transaction asynchronous settlement system for microgrid is proposed based on blockchain technology. The experiment results illustrate that the system obtains promising performance by reasonable set grid structure which could meet the requirements of practical applications.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124886038","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9129498
A. L. Emmanuel, Xavier N Fernando, Fatima Hussain, Wisam Farjow
LoRa is a promising wireless technology for various sensing and positioning applications in Smart Cities. LoRa uses Chirp Spread Spectrum (CSS) with different Spreading Factors (SF) to handle varying intensities of multipath reflections and interference. However, the standard LoRaWAN uses the pure ALOHA algorithm that suffers from both Intra-SF collisions and Inter-SF collisions which limit it to mostly low density environment. In this work, we optimize the transmission parameters of a LoRaWAN system in high density Smart City traffic environment using golden section search and parabolic interpolation. Our approach of optimum distribution of spreading factors not only significantly improves the success rate, but also enable more nodes to use lower spreading which results in lower delay.
{"title":"Optimization of Spreading Factor Distribution in High Density LoRa Networks","authors":"A. L. Emmanuel, Xavier N Fernando, Fatima Hussain, Wisam Farjow","doi":"10.1109/VTC2020-Spring48590.2020.9129498","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9129498","url":null,"abstract":"LoRa is a promising wireless technology for various sensing and positioning applications in Smart Cities. LoRa uses Chirp Spread Spectrum (CSS) with different Spreading Factors (SF) to handle varying intensities of multipath reflections and interference. However, the standard LoRaWAN uses the pure ALOHA algorithm that suffers from both Intra-SF collisions and Inter-SF collisions which limit it to mostly low density environment. In this work, we optimize the transmission parameters of a LoRaWAN system in high density Smart City traffic environment using golden section search and parabolic interpolation. Our approach of optimum distribution of spreading factors not only significantly improves the success rate, but also enable more nodes to use lower spreading which results in lower delay.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125102004","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9129394
Jian He, Jiangzhou Wang, Huiling Zhu, N. Gomes, Wenchi Cheng, Peng Yue, Xiang Yi
Rapid deployment is crucial for building up drone aided emergency communications to ensure the coverage and service support after the disaster. The chaos in the post-disaster area, such as the number of ground users and scattered locations, makes difficult on the decision of drone deployment. In this paper, an unsupervised machine learning method is conducted for drone deployment in drone aided emergency communications. Considering the importance of sustainable services for drones, the drone deployment problem is formulated with the aim of minimizing the total power of drones with all users’ coverage while maintaining their rate requirements, with constraints on drones’ coverage area, capacity and limited power. The problem is solved by two steps. A modified k-means clustering algorithm is proposed to obtain the number of drones and an optimal altitude and minimum transmit power algorithm is then derived. Simulation results show that although the number of drones obtained by the modified algorithm is more than that of the original k-means algorithm, all users are served and the minimum power of drones is guaranteed by proposed algorithms.
{"title":"Machine Learning based Network Planning in Drone Aided Emergency Communications","authors":"Jian He, Jiangzhou Wang, Huiling Zhu, N. Gomes, Wenchi Cheng, Peng Yue, Xiang Yi","doi":"10.1109/VTC2020-Spring48590.2020.9129394","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9129394","url":null,"abstract":"Rapid deployment is crucial for building up drone aided emergency communications to ensure the coverage and service support after the disaster. The chaos in the post-disaster area, such as the number of ground users and scattered locations, makes difficult on the decision of drone deployment. In this paper, an unsupervised machine learning method is conducted for drone deployment in drone aided emergency communications. Considering the importance of sustainable services for drones, the drone deployment problem is formulated with the aim of minimizing the total power of drones with all users’ coverage while maintaining their rate requirements, with constraints on drones’ coverage area, capacity and limited power. The problem is solved by two steps. A modified k-means clustering algorithm is proposed to obtain the number of drones and an optimal altitude and minimum transmit power algorithm is then derived. Simulation results show that although the number of drones obtained by the modified algorithm is more than that of the original k-means algorithm, all users are served and the minimum power of drones is guaranteed by proposed algorithms.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125116595","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9128687
Farah Haidar, Joseph Kamel, I. B. Jemaa, Arnaud Kaiser, B. Lonc, P. Urien
European and North American governments are actively working on improving road safety and traffic efficiency. To this end, their corresponding standardization bodies: ETSI and IEEE are developing the Cooperative Intelligent Transport Systems (C-ITS). In this system, vehicles and road side units communicate in order to enable new services and propose cooperative safety applications. However, the system is vulnerable to new types of threats if not adequately secured. The security and privacy protection is crucial to the user acceptance of such new system. Currently, the ETSI and IEEE proposed using a specific vehicular Public Key Infrastructure (PKI) to protect the C-ITS system. The PKI can protect the system against external attackers but it still vulnerable to internal attacks. Registered vehicles with valid certificates can still disturb the system by misusing its applications. The aim of misbehavior detection is to detect and mitigate the effect of internal attackers. The current misbehavior detection architecture includes a local embedded component and a cloud component. In this paper, we propose a misbehavior reports dataset of derived from the local embedded detection of misbehaving entities. This dataset can be used to further develop and evaluate the cloud component. The set includes different road topology, varying attacker penetration rates and attack scenarios.
{"title":"DARE: A Reports Dataset for Global Misbehavior Authority Evaluation in C-ITS","authors":"Farah Haidar, Joseph Kamel, I. B. Jemaa, Arnaud Kaiser, B. Lonc, P. Urien","doi":"10.1109/VTC2020-Spring48590.2020.9128687","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9128687","url":null,"abstract":"European and North American governments are actively working on improving road safety and traffic efficiency. To this end, their corresponding standardization bodies: ETSI and IEEE are developing the Cooperative Intelligent Transport Systems (C-ITS). In this system, vehicles and road side units communicate in order to enable new services and propose cooperative safety applications. However, the system is vulnerable to new types of threats if not adequately secured. The security and privacy protection is crucial to the user acceptance of such new system. Currently, the ETSI and IEEE proposed using a specific vehicular Public Key Infrastructure (PKI) to protect the C-ITS system. The PKI can protect the system against external attackers but it still vulnerable to internal attacks. Registered vehicles with valid certificates can still disturb the system by misusing its applications. The aim of misbehavior detection is to detect and mitigate the effect of internal attackers. The current misbehavior detection architecture includes a local embedded component and a cloud component. In this paper, we propose a misbehavior reports dataset of derived from the local embedded detection of misbehaving entities. This dataset can be used to further develop and evaluate the cloud component. The set includes different road topology, varying attacker penetration rates and attack scenarios.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123240285","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9129219
Mateen Ashraf, L. Vandendorpe
This paper studies a cooperative wireless powered communication network system. The communication between uplink users and hybrid access point is supported by energy harvesting relays. In contrast to the exiting works, we assume that the uplink users also harvest energy from the energy signal transmitted by the hybrid access point. Furthermore, it is assumed that the relays employ decode and forward relaying protocol for relaying the users information to the access point. We propose an optimization problem whose aim is to maximize the average sum throughput of the system. It is proved that the proposed optimization problem is convex. Karush Kuhn Tucker (KKT) conditions are used to find the optimal time allocations for the energy signal transmission and information signal transmissions. The proposed scheme for finding the optimal time allocation does not require instantaneous channel state information therefore significant reduction in the feedback information can be achieved by using the proposed scheme. The simulation results show that the proposed time allocation can significantly improve the performance of the system.
{"title":"Sum of Average Throughput Maximization in Energy Harvesting Cooperative Wireless Communication","authors":"Mateen Ashraf, L. Vandendorpe","doi":"10.1109/VTC2020-Spring48590.2020.9129219","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9129219","url":null,"abstract":"This paper studies a cooperative wireless powered communication network system. The communication between uplink users and hybrid access point is supported by energy harvesting relays. In contrast to the exiting works, we assume that the uplink users also harvest energy from the energy signal transmitted by the hybrid access point. Furthermore, it is assumed that the relays employ decode and forward relaying protocol for relaying the users information to the access point. We propose an optimization problem whose aim is to maximize the average sum throughput of the system. It is proved that the proposed optimization problem is convex. Karush Kuhn Tucker (KKT) conditions are used to find the optimal time allocations for the energy signal transmission and information signal transmissions. The proposed scheme for finding the optimal time allocation does not require instantaneous channel state information therefore significant reduction in the feedback information can be achieved by using the proposed scheme. The simulation results show that the proposed time allocation can significantly improve the performance of the system.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123529861","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 : 2020-05-01DOI: 10.1109/VTC2020-Spring48590.2020.9128765
You-Zong Yu, D. Lin
To estimate the probability of an event, conventional Monte Carlo (MC) needs $100/P_{mathrm {e}}$ simulation runs to attain a 10% precision, where $P_{mathrm {e}}$ is the probability of the event. It therefore encounters difficulty in simulation-based evaluation of packet error rates for ultra-reliable communication under its stringent requirement. Many fast simulation techniques for evaluating the probability of rare events have been proposed. However, a more efficient method for coded communication systems that can adaptively exploit the code structure and concentrate the generated noise vectors to the error-prone regions is desirable. We propose a method which seeks to adaptively learn a certain optimal histogram of the noise vectors and generate the noise vectors accordingly. The said histogram is a one-dimensional function and hence is easy to work with. The adaptation mechanism is code-agnostic. Simulation with cyclic redundancy check-aided polar coding in additive white Gaussian noise shows an approximately 10-100 times speed-up compared to conventional MC.
{"title":"Fast Simulation of Ultra-Reliable Coded Communication System via Adaptive Shaping of Noise Histogram","authors":"You-Zong Yu, D. Lin","doi":"10.1109/VTC2020-Spring48590.2020.9128765","DOIUrl":"https://doi.org/10.1109/VTC2020-Spring48590.2020.9128765","url":null,"abstract":"To estimate the probability of an event, conventional Monte Carlo (MC) needs $100/P_{mathrm {e}}$ simulation runs to attain a 10% precision, where $P_{mathrm {e}}$ is the probability of the event. It therefore encounters difficulty in simulation-based evaluation of packet error rates for ultra-reliable communication under its stringent requirement. Many fast simulation techniques for evaluating the probability of rare events have been proposed. However, a more efficient method for coded communication systems that can adaptively exploit the code structure and concentrate the generated noise vectors to the error-prone regions is desirable. We propose a method which seeks to adaptively learn a certain optimal histogram of the noise vectors and generate the noise vectors accordingly. The said histogram is a one-dimensional function and hence is easy to work with. The adaptation mechanism is code-agnostic. Simulation with cyclic redundancy check-aided polar coding in additive white Gaussian noise shows an approximately 10-100 times speed-up compared to conventional MC.","PeriodicalId":348099,"journal":{"name":"2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125408525","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
扫码关注我们
求助内容：
应助结果提醒方式：