Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555904
Yi Song, Weiwei Yang, Zhongwu Xiang, Yueming Cai
As one of the key technologies of the fifth generation communication, millimeter wave has abundant available bandwidth, which can meet the explosive growth of mobile data demand. In this paper, we study the problem of secure communication in a millimeter wave wiretap network. Two transmission protocols are designed to achieve the secure transmission in a sector zone. We give a comprehensive investigation of secrecy performance by analyzing each protocol in terms of secrecy outage probability (SOP), connection outage probability (COP) and secrecy throughput. Particularly, for the secrecy guard zone protocol, we analyze the influence of transmit power on secrecy performance and the results demonstrate that it is very important to set transmit power properly. For the secrecy guard zone protocol with artificial noise, in addition to analyzing the influence of transmit power on each performance metric, we also analyze the effect of transmit power allocation factor on the secrecy throughput, the results reveal that the power allocation of the AN and the information signal need to be properly set for increasing the secrecy throughput. Moreover, the influence of different millimeter wave frequency on the performance metric is also analyzed. Finally numerical results are provided to verify our theoretical analysis.
{"title":"Secure Transmission Design of Millimeter-Wave Wiretap Channel with Guard Zone and Artificial Noise","authors":"Yi Song, Weiwei Yang, Zhongwu Xiang, Yueming Cai","doi":"10.1109/WCSP.2018.8555904","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555904","url":null,"abstract":"As one of the key technologies of the fifth generation communication, millimeter wave has abundant available bandwidth, which can meet the explosive growth of mobile data demand. In this paper, we study the problem of secure communication in a millimeter wave wiretap network. Two transmission protocols are designed to achieve the secure transmission in a sector zone. We give a comprehensive investigation of secrecy performance by analyzing each protocol in terms of secrecy outage probability (SOP), connection outage probability (COP) and secrecy throughput. Particularly, for the secrecy guard zone protocol, we analyze the influence of transmit power on secrecy performance and the results demonstrate that it is very important to set transmit power properly. For the secrecy guard zone protocol with artificial noise, in addition to analyzing the influence of transmit power on each performance metric, we also analyze the effect of transmit power allocation factor on the secrecy throughput, the results reveal that the power allocation of the AN and the information signal need to be properly set for increasing the secrecy throughput. Moreover, the influence of different millimeter wave frequency on the performance metric is also analyzed. Finally numerical results are provided to verify our theoretical analysis.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832661","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-10-01DOI: 10.1109/WCSP.2018.8555903
Feng Liu, Yue Wang, Jian Wei, Z. Gan, Z. Cui
Precise vehicle retrieval, which means ascertaining all instances for a given query vehicle image, is a challenging task as different vehicles will share the same visual attributes. To solve this problem, a novel color image retrieval method based on improved fast affine matching is proposed, which combines color constants and hue and saturation (H-S) color features of special marks to perform the fine-grained retrieval of images. The proposed method overcomes the influence of illumination variation and deformation on vehicle images. Furthermore, with full use of vehicle annual inspection labels, vehicle retrieval can be separated from excessive reliance on vehicle license plates. We evaluate our proposed method on the ReIDcar dataset, which includes many low-quality vehicle images in a series of experiments, and the large-scale image dataset VehicleID. Experimental results demonstrate that the retrieval rate outperforms other traditional methods, verifying the feasibility and effectiveness of the proposed method. Experimental results demonstrate that the proposed method is superior to other synopsis methods in the processing speed and retrieval accuracy.
{"title":"Vehicle Precise Retrieval via Color Image Retrieval Method Based on Improved Fast-Match","authors":"Feng Liu, Yue Wang, Jian Wei, Z. Gan, Z. Cui","doi":"10.1109/WCSP.2018.8555903","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555903","url":null,"abstract":"Precise vehicle retrieval, which means ascertaining all instances for a given query vehicle image, is a challenging task as different vehicles will share the same visual attributes. To solve this problem, a novel color image retrieval method based on improved fast affine matching is proposed, which combines color constants and hue and saturation (H-S) color features of special marks to perform the fine-grained retrieval of images. The proposed method overcomes the influence of illumination variation and deformation on vehicle images. Furthermore, with full use of vehicle annual inspection labels, vehicle retrieval can be separated from excessive reliance on vehicle license plates. We evaluate our proposed method on the ReIDcar dataset, which includes many low-quality vehicle images in a series of experiments, and the large-scale image dataset VehicleID. Experimental results demonstrate that the retrieval rate outperforms other traditional methods, verifying the feasibility and effectiveness of the proposed method. Experimental results demonstrate that the proposed method is superior to other synopsis methods in the processing speed and retrieval accuracy.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114936048","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-10-01DOI: 10.1109/WCSP.2018.8555851
Penghui Lai, Shilian Wang, Cong Peng, Yanmin Ma, K. Gao, Chun Yang
Continuous phase modulation (CPM) has been widely used in telecommunication and aeronautical telemetry system due to its high power and spectral efficiency. Non-coherent detection is a kind of feasible CPM detection method if there is large phase noise or residual carrier frequency offset. Near-optimal non-coherent sequence detection, which is based on Viterbi algorithm, has a performance close to that of maximum-likelihood sequence detection (MLSD). However, near-optimal non-coherent detection of CPM is very complicated to be implemented, and it is even more difficult to achieve a high speed due to feedback in the process of calculating branch metrics, add-compare-select (ACS), updating the beginning phase and phase reference symbol. In this paper, we first review near-optimal non-coherent detection of CPM, and then we present a high speed design of FPGA implementation for near-optimal non-coherent detection of a 64 state, 4-ary, length-3T raised cosine (3RC) CPM on Xilinx XC7VX690T device. In our scheme, the frequency pulse truncation is used to simplify the CPM detection. We propose a feedback processing in parallel for different states of CPM trellis to achieve a low latency. Furthermore, we develop a recursive implementation architecture for the process of updating the beginning phase. We achieve the CPM bit rate of 25Mbps for the on-chip processing clock of 100MHz. The results of simulation shows near-optimal non-coherent detection performs much better the coherent detection when residual carrier frequency offset or phase noise exists. It is found that the implementation can achieve a degradation in the Eb/N0 from computer simulation of as small as 0.3 dB for an average BER=10-5.
{"title":"Design and Implementation for Near-optimal Noncoherent Sequence Detection of CPM","authors":"Penghui Lai, Shilian Wang, Cong Peng, Yanmin Ma, K. Gao, Chun Yang","doi":"10.1109/WCSP.2018.8555851","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555851","url":null,"abstract":"Continuous phase modulation (CPM) has been widely used in telecommunication and aeronautical telemetry system due to its high power and spectral efficiency. Non-coherent detection is a kind of feasible CPM detection method if there is large phase noise or residual carrier frequency offset. Near-optimal non-coherent sequence detection, which is based on Viterbi algorithm, has a performance close to that of maximum-likelihood sequence detection (MLSD). However, near-optimal non-coherent detection of CPM is very complicated to be implemented, and it is even more difficult to achieve a high speed due to feedback in the process of calculating branch metrics, add-compare-select (ACS), updating the beginning phase and phase reference symbol. In this paper, we first review near-optimal non-coherent detection of CPM, and then we present a high speed design of FPGA implementation for near-optimal non-coherent detection of a 64 state, 4-ary, length-3T raised cosine (3RC) CPM on Xilinx XC7VX690T device. In our scheme, the frequency pulse truncation is used to simplify the CPM detection. We propose a feedback processing in parallel for different states of CPM trellis to achieve a low latency. Furthermore, we develop a recursive implementation architecture for the process of updating the beginning phase. We achieve the CPM bit rate of 25Mbps for the on-chip processing clock of 100MHz. The results of simulation shows near-optimal non-coherent detection performs much better the coherent detection when residual carrier frequency offset or phase noise exists. It is found that the implementation can achieve a degradation in the Eb/N0 from computer simulation of as small as 0.3 dB for an average BER=10-5.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122780323","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}
Mobile edge computing (MEC) has been considered as a promising technology to reduce the energy consumption and task execution latency of smart mobile devices (SMDs). To improve the number of user access and spectrum efficiency, we exploit non-orthogonal multiple access (NOMA) into the MEC system. NOMA will cause mutual interference between users, which will increase user’s transmission latency. Therefore, we formulate an optimization problem which minimizes the average latency of the NOMA-based MEC system via jointly optimizing user clustering, resource allocation and transmission power. To solve the optimization problem, we first propose heuristic algorithms to solve user clustering and resource allocation. Then, we propose an iterative power optimization algorithm based on particle swarm optimization (PSO). Simulation results show that the proposed optimization strategy can effectively reduce the average latency of the system.
{"title":"Joint User Clustering, Resource Allocation and Power Control for NOMA-based Mobile Edge Computing","authors":"Xianbang Diao, Jianchao Zheng, Yueming Cai, X. Dong, Xiaoyi Zhang","doi":"10.1109/WCSP.2018.8555861","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555861","url":null,"abstract":"Mobile edge computing (MEC) has been considered as a promising technology to reduce the energy consumption and task execution latency of smart mobile devices (SMDs). To improve the number of user access and spectrum efficiency, we exploit non-orthogonal multiple access (NOMA) into the MEC system. NOMA will cause mutual interference between users, which will increase user’s transmission latency. Therefore, we formulate an optimization problem which minimizes the average latency of the NOMA-based MEC system via jointly optimizing user clustering, resource allocation and transmission power. To solve the optimization problem, we first propose heuristic algorithms to solve user clustering and resource allocation. Then, we propose an iterative power optimization algorithm based on particle swarm optimization (PSO). Simulation results show that the proposed optimization strategy can effectively reduce the average latency of the system.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122490078","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-10-01DOI: 10.1109/WCSP.2018.8555948
Ailing Xiao, Xiaoming Tao, Li Wang, Jie Liu, Jianhua Lu
With the popularity of smart handheld devices, mobile streaming video has multiplied the global network traffic in recent years. To guarantee the best user experience, dynamic adaptive streaming over HTTP (DASH) is adopted as the de facto industrial technology, which can flexibly select the “proper” bitrate for each next video segment with the varying network throughput. In this paper, we propose a client-side buffer driven rate adaptation strategy which improves the real-time quality of experience (QoE) by answering to users’ differentiated QoE requirements at different buffer states. According to whether the downloaded video content is enough to resist bad network conditions, we define a startup state and a steady state of the buffer and take different rate adaptation goals for each state. For the startup one, filling the buffer as soon as possible helps improve users’ QoE the most. While for the steady state, our strategy aims at providing users with undisturbed viewing experience, which needs major concern over both the video quality and the rebuffering. Simulation results have shown that our strategy can effectively reduce the occurrence of rebufferings caused by the mismatch between requested video rates and varying network bandwidth, and attains standout performance on users’ QoE compared with classical rate adaption methods.
近年来，随着智能手持设备的普及，移动流媒体视频使全球网络流量成倍增长。为了保证最佳的用户体验，采用了动态自适应流over HTTP (dynamic adaptive streaming over HTTP, DASH)作为事实上的工业技术，它可以根据不同的网络吞吐量灵活地为下一个视频片段选择“合适”的比特率。本文提出了一种客户端缓存驱动的速率自适应策略，通过满足用户在不同缓存状态下的差异化QoE需求，提高实时体验质量。根据下载的视频内容是否足以抵抗恶劣的网络条件，我们定义了缓冲区的启动状态和稳定状态，并对每种状态采取不同的速率适应目标。对于启动阶段，尽快填充缓冲区最有助于提高用户的QoE。而对于稳态，我们的策略旨在为用户提供不受干扰的观看体验，这需要主要关注视频质量和再缓冲。仿真结果表明，我们的策略可以有效地减少由于请求视频速率与网络带宽不匹配而导致的重复缓冲的发生，并且与经典的速率自适应方法相比，在用户QoE方面取得了突出的性能。
{"title":"Two-State Buffer Driven Rate Adaptation Strategy for Improving Video QoE over HTTP","authors":"Ailing Xiao, Xiaoming Tao, Li Wang, Jie Liu, Jianhua Lu","doi":"10.1109/WCSP.2018.8555948","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555948","url":null,"abstract":"With the popularity of smart handheld devices, mobile streaming video has multiplied the global network traffic in recent years. To guarantee the best user experience, dynamic adaptive streaming over HTTP (DASH) is adopted as the de facto industrial technology, which can flexibly select the “proper” bitrate for each next video segment with the varying network throughput. In this paper, we propose a client-side buffer driven rate adaptation strategy which improves the real-time quality of experience (QoE) by answering to users’ differentiated QoE requirements at different buffer states. According to whether the downloaded video content is enough to resist bad network conditions, we define a startup state and a steady state of the buffer and take different rate adaptation goals for each state. For the startup one, filling the buffer as soon as possible helps improve users’ QoE the most. While for the steady state, our strategy aims at providing users with undisturbed viewing experience, which needs major concern over both the video quality and the rebuffering. Simulation results have shown that our strategy can effectively reduce the occurrence of rebufferings caused by the mismatch between requested video rates and varying network bandwidth, and attains standout performance on users’ QoE compared with classical rate adaption methods.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122864782","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-10-01DOI: 10.1109/WCSP.2018.8555711
Yifan Duan, Changyang She, Guodong Zhao, Tony Q. S. Quek
In the fifth generation (5G) wireless communications, ultra-reliable and low-latency communications (URLLC) service that deliveries short packets will coexist with enhanced mobile broadband (eMBB) service with long packets. In this work, we study how to analyze delay and optimize offloading scheme of short packets in a mobile edge computing (MEC) system with both URLLC and eMBB services. To reduce computing delay for short packets, a processor-sharing (PS) server is deployed in the MEC system, where the total computing ability is equally allocated to all the packets in the server. As such, short packets can bypass long packets in the server. We derive a closed-form expression of the complimentary cumulative distribution function of latency experienced by short packets in the PS server, and minimize the end-to-end (E2E) delay of short packets by optimizing offloading probabilities subject to the reliability requirement. Simulation results validate our analysis and show that the PS server outperforms two kinds of first-come-first-serve servers in the scenarios with both short and long packets.
{"title":"Delay Analysis and Computing Offloading of URLLC in Mobile Edge Computing Systems","authors":"Yifan Duan, Changyang She, Guodong Zhao, Tony Q. S. Quek","doi":"10.1109/WCSP.2018.8555711","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555711","url":null,"abstract":"In the fifth generation (5G) wireless communications, ultra-reliable and low-latency communications (URLLC) service that deliveries short packets will coexist with enhanced mobile broadband (eMBB) service with long packets. In this work, we study how to analyze delay and optimize offloading scheme of short packets in a mobile edge computing (MEC) system with both URLLC and eMBB services. To reduce computing delay for short packets, a processor-sharing (PS) server is deployed in the MEC system, where the total computing ability is equally allocated to all the packets in the server. As such, short packets can bypass long packets in the server. We derive a closed-form expression of the complimentary cumulative distribution function of latency experienced by short packets in the PS server, and minimize the end-to-end (E2E) delay of short packets by optimizing offloading probabilities subject to the reliability requirement. Simulation results validate our analysis and show that the PS server outperforms two kinds of first-come-first-serve servers in the scenarios with both short and long packets.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114493880","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-10-01DOI: 10.1109/WCSP.2018.8555898
Lisheng Fan, Xianfu Lei, Nan Zhao, P. Fan, G. Karagiannidis
In this paper, we study a stochastic multi-user multi-relay network, where the data transmission can be overheard by multiple eavesdroppers. The users, relays and eavesdroppers are assumed to arrive at the network subject to homogeneous poisson point process (PPP). Cache equipped at the relays and users can pre-store part of file contents, which can help enhance the transmission security. Hence, it is of vital importance to design an effective secure probabilistic caching strategy to ensure the security of content transmission. To this end, we first consider several cache-aided transmission modes of self-fetch, D2D-transmission, relay-transmission, and source-transmission. We then study the network secrecy performance by analyzing the expression of secure cache throughput and an analytical lower bound. In order to maximize the secure cache throughput, we further optimize the probabilistic caching strategy by using a heuristic algorithm. Numerical results are provided to demonstrate that the proposed strategy outperforms the conventional caching strategies.
{"title":"Secure Probabilistic Caching for Stochastic Multi-User Multi-Relay Networks","authors":"Lisheng Fan, Xianfu Lei, Nan Zhao, P. Fan, G. Karagiannidis","doi":"10.1109/WCSP.2018.8555898","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555898","url":null,"abstract":"In this paper, we study a stochastic multi-user multi-relay network, where the data transmission can be overheard by multiple eavesdroppers. The users, relays and eavesdroppers are assumed to arrive at the network subject to homogeneous poisson point process (PPP). Cache equipped at the relays and users can pre-store part of file contents, which can help enhance the transmission security. Hence, it is of vital importance to design an effective secure probabilistic caching strategy to ensure the security of content transmission. To this end, we first consider several cache-aided transmission modes of self-fetch, D2D-transmission, relay-transmission, and source-transmission. We then study the network secrecy performance by analyzing the expression of secure cache throughput and an analytical lower bound. In order to maximize the secure cache throughput, we further optimize the probabilistic caching strategy by using a heuristic algorithm. Numerical results are provided to demonstrate that the proposed strategy outperforms the conventional caching strategies.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117043542","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-10-01DOI: 10.1109/WCSP.2018.8555614
Yao Zhang, Haotong Cao, Yongan Guo, Longxiang Yang
In this paper, the performance of downlink cell-free massive multiple-input multiple-output (mMIMO) system with short-term power constraints is investigated. To maximize the sum downlink user signal-interference-noise-ratio (SINR), this paper proposes a sequential convex approximation (SCA) power optimization algorithm for cell-free mMIMO with normalized conjugate beamforming (CB) precoder. This proposed SCA algorithm is proved to be a second order cone programming (SOCP). Then, under the condition that the achievable data SINR is greater than or equal to a certain quality of service (QoS) threshold, a new sum power minimization algorithm is presented. It also can be reformulated as a SOCP. Numerical results indicate that the achievable sum downlink SINR monotonically increases at each iteration and the sum SINR tends to a stable value after 7 iterations. In addition, the power minimization algorithm works well in satisfying target users’ SINR constraints and minimizing the sum downlink transmission power.
{"title":"SCA Power optimization in Cell-Free Massive MIMO with Short-Term Power Constraints","authors":"Yao Zhang, Haotong Cao, Yongan Guo, Longxiang Yang","doi":"10.1109/WCSP.2018.8555614","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555614","url":null,"abstract":"In this paper, the performance of downlink cell-free massive multiple-input multiple-output (mMIMO) system with short-term power constraints is investigated. To maximize the sum downlink user signal-interference-noise-ratio (SINR), this paper proposes a sequential convex approximation (SCA) power optimization algorithm for cell-free mMIMO with normalized conjugate beamforming (CB) precoder. This proposed SCA algorithm is proved to be a second order cone programming (SOCP). Then, under the condition that the achievable data SINR is greater than or equal to a certain quality of service (QoS) threshold, a new sum power minimization algorithm is presented. It also can be reformulated as a SOCP. Numerical results indicate that the achievable sum downlink SINR monotonically increases at each iteration and the sum SINR tends to a stable value after 7 iterations. In addition, the power minimization algorithm works well in satisfying target users’ SINR constraints and minimizing the sum downlink transmission power.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126669824","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-10-01DOI: 10.1109/WCSP.2018.8555678
Yang Cao, Nan Zhao, Yunfei Chen, Minglu Jin, Lisheng Fan, Z. Ding, F. Yu
Non-orthogonal multiple access (NOMA) is a promising approach for 5G. However, the privacy between users may be compromised due to the superposition of all users’ signals to successive interference cancellation (SIC) receivers. In this paper, we propose a scheme based on beamforming optimization for the downlink NOMA that can enhance the security of a specific private user while guaranteeing other users' quality of service (QoS). Specifically, we intend to maximize the secrecy rate of the private user, under the constraint that the other users’ QoS is satisfied. Owing to the non-convexity, we first convert it into convex forms and then, an iterative algorithm based on the concave-convex procedure is proposed to attain their solutions. Extensive simulation results are presented to evaluate the effectiveness of the proposed scheme.
{"title":"Privacy Protection via Beamforming Optimization in MISO NOMA Networks","authors":"Yang Cao, Nan Zhao, Yunfei Chen, Minglu Jin, Lisheng Fan, Z. Ding, F. Yu","doi":"10.1109/WCSP.2018.8555678","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555678","url":null,"abstract":"Non-orthogonal multiple access (NOMA) is a promising approach for 5G. However, the privacy between users may be compromised due to the superposition of all users’ signals to successive interference cancellation (SIC) receivers. In this paper, we propose a scheme based on beamforming optimization for the downlink NOMA that can enhance the security of a specific private user while guaranteeing other users' quality of service (QoS). Specifically, we intend to maximize the secrecy rate of the private user, under the constraint that the other users’ QoS is satisfied. Owing to the non-convexity, we first convert it into convex forms and then, an iterative algorithm based on the concave-convex procedure is proposed to attain their solutions. Extensive simulation results are presented to evaluate the effectiveness of the proposed scheme.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124214479","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-10-01DOI: 10.1109/WCSP.2018.8555683
Tianyu Lu, Haibo Dai, Baoyun Wang
For wireless virtual reality (VR) over small cell networks (SCN), the latency between user’s dynamic head rotation and the synchronous change in head-mounted display (HMD) influences quality of experience (QoE). In this paper, to assess VR user’s QoE, we specify mean opinion score (MOS) as a metric of latency. With the goal of maximizing system-wide MOS, the stochastic game approach is leveraged for investigating resource allocation problem. For problem solution, a distributed multi-agent learning algorithm is proposed, which can converge to a pure-strategy Nash equilibrium (NE). Numerical results demonstrate the excellent performance of our proposed algorithm.
{"title":"QoE-Orientated Resource Allocation for Wireless VR over Small Cell Networks","authors":"Tianyu Lu, Haibo Dai, Baoyun Wang","doi":"10.1109/WCSP.2018.8555683","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555683","url":null,"abstract":"For wireless virtual reality (VR) over small cell networks (SCN), the latency between user’s dynamic head rotation and the synchronous change in head-mounted display (HMD) influences quality of experience (QoE). In this paper, to assess VR user’s QoE, we specify mean opinion score (MOS) as a metric of latency. With the goal of maximizing system-wide MOS, the stochastic game approach is leveraged for investigating resource allocation problem. For problem solution, a distributed multi-agent learning algorithm is proposed, which can converge to a pure-strategy Nash equilibrium (NE). Numerical results demonstrate the excellent performance of our proposed algorithm.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116169477","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
扫码关注我们
求助内容：
应助结果提醒方式：