2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)最新文献

筛选
英文 中文
Low-Complexity Factor Graph-Based Iterative Detection for RRC-SEFDM Signals 基于低复杂度因子图的RRC-SEFDM信号迭代检测
Yuanfang Feng, Yunsi Ma, Zhengdai Li, Chaoxing Yan, N. Wu
{"title":"Low-Complexity Factor Graph-Based Iterative Detection for RRC-SEFDM Signals","authors":"Yuanfang Feng, Yunsi Ma, Zhengdai Li, Chaoxing Yan, N. Wu","doi":"10.1109/WCSP.2018.8555909","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555909","url":null,"abstract":"Spectrally efficient frequency division multiplexing (SEFDM) is a promising technique for the next generation wireless communication due to its high spectral efficiency. Conventional SEFDM detectors suffer from the challenging tradeoff between computational complexity and bit error rate (BER) performance. In this paper, we propose a low-complexity iterative detector using Gaussian message passing (GMP) on factor graph for coded root raised cosine (RRC) shaped SEFDM signals. By ignoring the weak intersymbol interference (ISI) imposed by packing sub-carrier interval, the detection of SEFDM signals is reformulated into a linear state-space model and a corresponding Forney-style factor graph (FFG) is constructed. Then, we derive messages updating expressions based on GMP rules, which enable low-complexity parametric message passing. Since the Gaussian approximation employed on the cycle-free factor graph, the computational complexity of the proposed algorithm increases linearly with the number of sub-carriers. Simulation results show that the coded RRC-SEFDM system with the proposed factor graph-based iterative detection can improve the transmission rate up to 40% with about 0.5 dB $E_{b}/N_{0}$ loss.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"27 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":"124925195","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}
引用次数: 7
MEC Architectures in 4G and 5G Mobile Networks 4G和5G移动网络中的MEC架构
Jianmin Zhang, Zhouyun Wu, Weiliang Xie, Fengyi Yang
{"title":"MEC Architectures in 4G and 5G Mobile Networks","authors":"Jianmin Zhang, Zhouyun Wu, Weiliang Xie, Fengyi Yang","doi":"10.1109/WCSP.2018.8555652","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555652","url":null,"abstract":"Multi-access Edge Computing (MEC) can provide the intelligent platform or environment for services with the requirements of lower latency, higher bandwidth, and higher computation complexity, thereby attracting more attention in the future network. Intuitively, MEC can be applied to 4G and 5G mobile networks respectively, however the corresponding MEC architectures will be entirely different because of the difference between 4G and 5G network architectures. Therefore, this paper firstly presents the 4G MEC architecture and deeply discusses the existing problems in field trials and future deployment, e.g. charging, lawful interception, etc. Considering the above problems, the 5G MEC integrated architecture is proposed in this paper, which takes the network and service functions into account simultaneously. Meanwhile, the network function, especially for the traffic offloading mechanism, is emphatically analyzed and discussed. In addition, some suggestions are also presented for promotion of 5G MEC.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"43 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":"123654177","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}
引用次数: 3
Energy Efficiency Optimization in Energy Harvesting Incremental Relay System 能量收集增量式继电器系统的能效优化
Donghui Liu, Ming Zhao, Wuyang Zhou
{"title":"Energy Efficiency Optimization in Energy Harvesting Incremental Relay System","authors":"Donghui Liu, Ming Zhao, Wuyang Zhou","doi":"10.1109/WCSP.2018.8555571","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555571","url":null,"abstract":"In this paper, according to the energy efficiency (EE) definition based on packet transmission, we analyze the energy efficiency in energy harvesting incremental relay system with energy harvesting constraints. Our purpose is to maximize energy efficiency of source node while making full use of relay’s harvested energy. First, we consider the energy efficiency of point-to-point link with multilevel quadrature amplitude modulation (MQAM) and derive the energy efficiency definition based on packet transmission. Next, the energy efficiency optimization problem in incremental relay system is formulated. To solve the problem, we discuss two factors that affect energy efficiency: transmission power and packet length. Furthermore, we propose a joint transmission power and packet length iterative optimization algorithm and give an intuitive analysis of convergence. Finally, simulations have been carried out to verify the benefits of the proposed algorithm, which can significantly improve energy efficiency compared with only transmission power optimized scheme or only packet length optimized scheme.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"24 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":"123717581","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}
引用次数: 5
PAPR-Aware Beam Division Multiple Access for mmWave Massive MIMO Systems 毫米波大规模MIMO系统的papr感知波分多址
Guanchong Niu, Man-On Pun
{"title":"PAPR-Aware Beam Division Multiple Access for mmWave Massive MIMO Systems","authors":"Guanchong Niu, Man-On Pun","doi":"10.1109/WCSP.2018.8555947","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555947","url":null,"abstract":"Beam division multiple access (BDMA) has recently been proposed for massive multiple-input multiple-output (MIMO) systems by simultaneously transmitting multiple users’ data streams via different beams. Despite its many advantages, BDMA may suffer from a larger peak-to-average-power ratio (PAPR) as the number of transmit antennas increases. In this work, we propose to explicitly incorporate the PAPR constraints into the BDMA design by jointly performing hybrid analog-digital precoding and user-beam scheduling. More specifically, the proposed scheme designs the digital precoder with explicit PAPR constraints. In addition, to facilitate the hybrid precoder design, the proposed scheme opportunistically schedules users who are near orthogonal in the analog beam domain. To efficiently compute the optimal hybrid precoder and user-beam scheduling, we develop a greedy algorithm that first opportunistically selects users before their corresponding hybrid precoders are derived with explicit PAPR constraints. Simulation results confirm the effectiveness of proposed PAPR- aware BDMA scheme.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"25 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":"121858192","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}
引用次数: 0
Reinforcement Learning Based Safety Message Broadcasting in Vehicular Networks 基于强化学习的车载网络安全信息广播
Xiaosha Chen, S. Leng, Fan Wu
{"title":"Reinforcement Learning Based Safety Message Broadcasting in Vehicular Networks","authors":"Xiaosha Chen, S. Leng, Fan Wu","doi":"10.1109/WCSP.2018.8555733","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555733","url":null,"abstract":"The automatic driving has drawn the widespread attention in both academic and industrial field. The vehicular safety message broadcast plays a significant role in the automatic driving. However, the unique features and transmission requirements of vehicular safety messages are often ignored in the design and analysis of the relevant protocols. This paper focuses on the improvement of safety message broadcasting in vehicular networks with reinforcement learning. In the scenarios with or without road side unit (RSU), we propose the distributed and centralized reinforcement learning based exponential backoff (RLEB) algorithm, respectively. Those vehicles with the dedicated short range communication (DSRC) unit can implement the proposed algorithm with little computation and communication resources. Simulation results show that the proposed algorithms decrease the delays of safety message broadcasting in different scenarios. Furthermore, the centralized proposed algorithm can provide the fairness among vehicles in terms of channel access opportunity.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"54 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":"122633659","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}
引用次数: 1
Prefix Caching for Video Streaming in Wireless D2D Networks 无线D2D网络视频流的前缀缓存
Hongwei Hou, M. Tao
{"title":"Prefix Caching for Video Streaming in Wireless D2D Networks","authors":"Hongwei Hou, M. Tao","doi":"10.1109/WCSP.2018.8555897","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555897","url":null,"abstract":"This paper introduces a new prefix caching strategy for video streaming in wireless device-to-device (D2D) networks. Each user caches several initial sequential segments of video files and can share their cached parts via D2D communications. Moreover, video playing and downloading happen simultaneously. We evaluate the system performance by playback delay rather than traditional download delay. Specifically, we formulate the average playback delay minimization problem in terms of cache placement. By relaxing the integer constraints of the decision variables, the original problem becomes convex and then we can find a lower bound of the optimal solution. Next we propose a greedy algorithm to solve the original minimization problem. And extensive simulation results reveal that our proposed video caching strategy has great performance in comparison with heuristic benchmark schemes.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"28 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":"121635212","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}
引用次数: 0
Task Assignment with Precedence Constraint over Networks: A Case Study of Computation-Communication Convergence 网络上具有优先约束的任务分配:计算-通信融合的一个案例研究
Zheng Cai, Zhaoyang Zhang, Xiaoming Chen, Wei Wang
{"title":"Task Assignment with Precedence Constraint over Networks: A Case Study of Computation-Communication Convergence","authors":"Zheng Cai, Zhaoyang Zhang, Xiaoming Chen, Wei Wang","doi":"10.1109/WCSP.2018.8555594","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555594","url":null,"abstract":"We study the task assignment problem of an application composed of multiple tasks in a general heterogeneous processor network or network with computing nodes, considering both the communication delay between processors and the precedence constraints between tasks. The problem of scheduling tasks over the network to minimize total application runtime is formulated, which is shown to be a NP-hard mixed integer program. To solve it, we propose a heuristic algorithm called Binary Relaxation and Discretization Heuristic (BRDH) which is conducted in two steps. First, we obtain a binary-relaxed version of the original problem, and then, we recover the discrete value of the original problem by task sorting. Through simulations, we show the impacts of task number, processor number and communication delay on the total application runtime. Furthermore, through comparison with traditional entire application offloading strategies widely used in current cloud computing and edge computing, our distributed computation offloading strategy shows significant advantage.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"117 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":"123340988","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}
引用次数: 1
Location Verification based on Radio Irregularity: Sequential Evaluation and Performance Assessment 基于无线电不规则性的位置验证:顺序评估与性能评估
N. Jiang, Hazem Sallouha, P. Xu, Xuzhe Wang, S. Pollin
{"title":"Location Verification based on Radio Irregularity: Sequential Evaluation and Performance Assessment","authors":"N. Jiang, Hazem Sallouha, P. Xu, Xuzhe Wang, S. Pollin","doi":"10.1109/WCSP.2018.8555939","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555939","url":null,"abstract":"In this paper Location Verification System based on Radio Irregularity and Sequential Evaluation (LVS-RISE) is proposed as a novel system to improve the performance of the Location Verification System based on Radio Irregularity (LVS-RI). LVS-RISE utilizes a sliding window and voting scheme to detect the attack from malicious nodes at the same distance. Hence, LVS-RISE can limit the ambiguity of malicious nodes detection when compared with LVS-RI. To assess the performance of LVS-RISE in compared with LVS-RI both simulation and experimental results are presented. Our simulation results show that, with the same threshold of detection, LVS-RISE achieves better performance when compared with LVS-RI. Moreover, the experiments in real environment indicate that an assistant node is necessary for LVS-RI and LVS-RISE if the node to be detected is moving.","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":"123840186","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}
引用次数: 1
Vital Sign Integrated Tracking by Predictive KNN and Kalman Filter with UWB Radars 基于预测KNN和卡尔曼滤波的超宽带雷达生命体征综合跟踪
Yibo Yu, Wenfeng Yin, Lei Li, Lin Zhang
{"title":"Vital Sign Integrated Tracking by Predictive KNN and Kalman Filter with UWB Radars","authors":"Yibo Yu, Wenfeng Yin, Lei Li, Lin Zhang","doi":"10.1109/WCSP.2018.8555864","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555864","url":null,"abstract":"Ultra-wideband (UWB) radar is an effective tool for indoor tracking. By applying multiple radars in tracking, distance observations are obtained in different positions and the surveillance area is enlarged. However, even based on multiple radars, occlusions among targets still exist and cause loss of distance observations. Besides, imprecise initial positions introduce interferences at the beginning of tracking. This paper proposes a tracking approach to solve the problems. Firstly, the proposed approach integrates vital signs for target matching and provides precise initial positions for multiple targets tracking. Secondly, the proposed approach designs a predictive K-Nearest Neighbor method in both the raging stage and the data fusion stage, so as to reduce deviations in antenna-to-target distances and supplement the lost data. Experiments validate the effectiveness of the proposed approach in tracking multiple targets with a max average deviation 0.276m.","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":"131358711","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}
引用次数: 5
Low Probability of Intercept Radar Waveform Recognition Based on Dictionary Leaming 基于字典学习的低概率拦截雷达波形识别
Huan Wang, M. Diao, Lipeng Gao
{"title":"Low Probability of Intercept Radar Waveform Recognition Based on Dictionary Leaming","authors":"Huan Wang, M. Diao, Lipeng Gao","doi":"10.1109/WCSP.2018.8555906","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555906","url":null,"abstract":"Low probability of intercept (LPI) radar waveform recognition is a challenging task in modern radar and electronic warfare (EW) systems. To solve the problem of incomplete information and the need for human experience in the existing feature-based radar recognition methods, a robust and automatic LPI radar waveform recognition method based on Choi-Williams time-frequency distribution (CWD) and dictionary learning in the complex electromagnetic environment is proposed. First, the received signals are transformed to obtain the time-frequency matrix by CWD. Next, bilinear interpolation technique and row-orthogonal Cauchy random matrix are used for Iossless compression. Next, the label consistent k-singular value decomposition algorithm (LC-KSVD) is used to learn an over-complete dictionary and obtain the structure parameters of a linear classifier jointly. Finally, with the sparse code and the linear classifier, the type of test signals can be estimated. The superiority of the proposed method is universally applicable and does not need to rely on any human experience. Simulation results demonstrate that the proposed method has an excellent recognition rate at a low signal-to-noise ratio (SNR).","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"52 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":"126283554","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信