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

筛选
英文 中文
High-Efficient Ranging Algorithms for Wireless Sensor Network 无线传感器网络的高效测距算法
Zijian Zhang, Hanying Zhao, Yuan Shen
{"title":"High-Efficient Ranging Algorithms for Wireless Sensor Network","authors":"Zijian Zhang, Hanying Zhao, Yuan Shen","doi":"10.1109/WCSP.2019.8928120","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928120","url":null,"abstract":"Obtaining precise internode range information with high-efficiency is essential for the Internet of Things. Two-way ranging (TWR) algorithm and its variants are widely used for measuring time-of-flight (ToF) among wireless transceivers. However, these algorithms are inefficient for large-scale networks, due to high resource consumption and long latency. In this paper, for active nodes and passive nodes, we propose the network-based TWR (NB-TWR) and the network-based passive ranging (NB-PR) algorithms, respectively, which realize all internode ToFs measuring with the minimum frames. Through theoretical analysis, we show that the ranging errors of the proposed methods are much lower than those of traditional algorithms. Our results can serve as guidelines for wireless networks to realize network ranging with high precision and limited resource consumption.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132736648","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
Joint Caching and Trajectory Design for Cache-Enabled UAV in Vehicular Networks 车载网络中高速缓存无人机联合缓存与轨迹设计
Huaqing Wu, Jianying Chen, Feng Lyu, Li Wang, X. Shen
{"title":"Joint Caching and Trajectory Design for Cache-Enabled UAV in Vehicular Networks","authors":"Huaqing Wu, Jianying Chen, Feng Lyu, Li Wang, X. Shen","doi":"10.1109/WCSP.2019.8927963","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927963","url":null,"abstract":"Cache-enabled unmanned aerial vehicles (UAVs) are envisioned as a key enabler to flexibly serve the ground traffic demand while eliminating the limited wireless backhaul links. However, how to utilize UAVs in highly dynamic vehicular networks is not well studied yet challenging with limited UAV energy and storage capacity. In this paper, considering the vehicle mobility and content requests, we study the problem of proactive content placement, trajectory design, and content delivery for cache-enabled UAV. This problem is formulated as an optimization problem aiming at maximizing the overall network throughput improvement under the UAV energy constraint, which is non-convex and difficult to solve. To tackle this problem, we propose an efficient algorithm with a two-layered structure. First, given a content placement strategy, we devise a time-based graph decomposition method to jointly optimize the content delivery and trajectory design. Next, with the optimized content delivery and trajectory, we then leverage the particle swarm optimization (PSO) algorithm to further optimize the content placement. Numerical results show that the proposed scheme can efficiently solve the joint optimization problem and adapt to the dynamic network conditions.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133362463","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}
引用次数: 8
Millimeter Wave Channel Estimation Based on Clustering Block Sparse Bayesian Learning 基于聚类块稀疏贝叶斯学习的毫米波信道估计
Jiawen Liu, Xiaohui Li, Kun Fang, Tao Fan
{"title":"Millimeter Wave Channel Estimation Based on Clustering Block Sparse Bayesian Learning","authors":"Jiawen Liu, Xiaohui Li, Kun Fang, Tao Fan","doi":"10.1109/WCSP.2019.8928086","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928086","url":null,"abstract":"The clustering block sparse Bayesian learning (CB-SBL) algorithm for millimeter wave (mmWave) channel estimation is proposed in this paper. Exploiting the correlation between the mmWave channel, the algorithm adopts the structure prioritization clustering method to cope with the sparse coefficients of the channel space in the mmWave system. The dependence of mmWave channel adjacent estimation coefficients is improved by processing the hyperparameters of the neighborhood, which is used to avoid the suboptimal solutions caused by the entanglement of hyperparameters. The mmWave channel estimation accuracy is improved in this way. Meanwhile the proposed algorithm also avoids the vulnerability of parameter choice in block sparse Bayesian learning (BSBL), which improves the robustness of mmWave channel estimation. The simulation results show that the mmWave channel estimation based on CBSBL outperforms the recently proposed algorithms.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125628660","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
Mitigation of Strong Background Radiation with Attenuation Diversity for Vehicular Visible Light Communication 基于衰减分集的车载可见光通信强背景辐射抑制
Chengpeng Tu, Weijie Liu, Zhengyuan Xu
{"title":"Mitigation of Strong Background Radiation with Attenuation Diversity for Vehicular Visible Light Communication","authors":"Chengpeng Tu, Weijie Liu, Zhengyuan Xu","doi":"10.1109/WCSP.2019.8928070","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928070","url":null,"abstract":"Orthogonal frequency division multiplexing (OFD-M)based outdoor visible light communication (VLC)technology has a broad prospect in the future intelligent transportation systems (ITSs), but it's prone to the problem of receiving signal saturation distortion. So we proposed a receiver architecture with an adjustable attenuator to mitigate the saturation distortion caused by strong solar irradiance in a commercial avalanche photodiode (APD)module. The simulation results show that the proposed receiver architecture has a good performance in the outdoor VLC system for both asymmetrically clipped optical OFDM (ACO-OFDM)modulation and direct current-biased optical OFDM (DCO-OFDM)modulation. Experimental results show that the proposed scheme has excellent performance in practical systems while utilizing DCO-OFDM modulation, and the bit error rate (BER)is reduced from 0.3 to 10−3under strong background light interference, which verified the feasibility of our proposed receiver architecture.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122917336","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}
引用次数: 4
Efficient and Privacy-Preserving Edit Distance Query Over Encrypted Genomic Data 加密基因组数据的高效且隐私保护的编辑距离查询
Yandong Zheng, Rongxing Lu, Jun Shao, Yonggang Zhang, Hui Zhu
{"title":"Efficient and Privacy-Preserving Edit Distance Query Over Encrypted Genomic Data","authors":"Yandong Zheng, Rongxing Lu, Jun Shao, Yonggang Zhang, Hui Zhu","doi":"10.1109/WCSP.2019.8927885","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927885","url":null,"abstract":"Genomic data have seen tremendous growth recently due to the advancement in DNA sequencing technologies and are being generated at an ever-higher velocity. The similarity between two genomic data records can be measured by the edit distance, which has significant applications in disease diagnosis and treatment. At the same time, due to the limited storage and computational resources at the local data owner, a typical solution for the edit distance computation is to outsource the genomic data to a powerful cloud. However, as the genomic data are sensitive and the cloud server is not fully trusted, there are privacy considerations during the edit distance computation. Apart from data privacy, efficiency also needs to be taken into consideration. In order to deal with the privacy and efficiency issues, in this paper, we propose an efficient and privacy-preserving edit distance computation scheme for a single data owner and single cloud server scenario. In specific, we first design an index technique to reduce the computational cost and communication overhead of the genomic data outsourcing, and introduce a fast edit distance computation technique to speed up the edit distance query. Then, we propose an efficient and privacy-preserving edit distance computation scheme by deploying the homomorphic encryption technique, which can well preserve the private information including genomic data records and edit distances. Besides, security analysis shows that the proposed scheme is privacy-preserving and performance evaluation validates the efficiency of the proposed scheme.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123054842","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}
引用次数: 2
A Novel Method for Refocusing Maritime Targets in SAR Images 一种新的SAR图像海洋目标重聚焦方法
Di Cheng, Bo Yuan, C. Chen, Weidong Chen
{"title":"A Novel Method for Refocusing Maritime Targets in SAR Images","authors":"Di Cheng, Bo Yuan, C. Chen, Weidong Chen","doi":"10.1109/WCSP.2019.8927956","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927956","url":null,"abstract":"Synthetic Aperture Radar (SAR) imaging of maritime targets is possible to be defocused or blurred due to targets' sailing movement and complex motions caused by sea wave. To refocus maritime moving targets, Inverse Synthetic Aperture Radar (ISAR) based sub-aperture technology is often used. However, the quality and resolution of refocused images decrement is likely to happen under this condition. To obtain high-resolution and high-quality images via short apertures, a novel ISAR-based method is proposed utilizing the joint optimization of all sub-aperture images. Two priors, the low rank property among all sub-aperture images as well as the target sparsity in one sub-aperture image, are introduced in this paper. The effectiveness of the proposed method is verified on Gaofeng-3 spotlight SAR images of maritime targets.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124046229","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
Capacity Enhancement Using Cooperative Distributed Antenna System in Downlink High-Speed Train Environments 高速列车下行环境下协同分布式天线系统的容量增强
Yue Xin, Zhonghua Liang, Yimeng Bai, Chenhui Zhai, Wei Li
{"title":"Capacity Enhancement Using Cooperative Distributed Antenna System in Downlink High-Speed Train Environments","authors":"Yue Xin, Zhonghua Liang, Yimeng Bai, Chenhui Zhai, Wei Li","doi":"10.1109/WCSP.2019.8927995","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927995","url":null,"abstract":"In order to improve the system capacity of distributed antenna system (DAS) in downlink high-speed train (HST) environments, this paper presents a power allocation scheme for remote antenna units (RAUs) based on the cooperative distributed antenna system (CDAS). The investigated power allocation scheme exploits the channel state information (CSI) between RAUs and vehicle-mounted relay (VMR). Based on the CDAS-CSI power allocation, a corresponding RAU selection algorithm is introduced to quickly find the suboptimal solution that maximizes the channel capacity and to optimize the number of RAUs in CDAS. Simulation results show that the CDAS-CSI power allocation greatly improves the downlink system capacity compared to the cases of non-cooperation among RAUs and equal power allocation among RAUs.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127873680","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
Symbol-level Precoding for Multiuser Visible Light Communication 多用户可见光通信的符号级预编码
Xiaoting Ma, Xianqing Jin, Jiajun Deng, Meiyu Jin, Chen Gong, Zhengyuan Xu
{"title":"Symbol-level Precoding for Multiuser Visible Light Communication","authors":"Xiaoting Ma, Xianqing Jin, Jiajun Deng, Meiyu Jin, Chen Gong, Zhengyuan Xu","doi":"10.1109/WCSP.2019.8927881","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927881","url":null,"abstract":"Visible light communication (VLC) is a promising technique for future high speed wireless networks due to its advantages including high data rate and spectral efficiency. For practical multiuser VLC systems, there are severe interferences between different users. To mitigate the interference, a novel symbol-level precoding scheme that utilizes the constructive interference is investigated to enhance the transmission performance. Numerical results show that the scheme outperforms the conventional schemes, whilst the simulated bit error rate (BER) with the scheme agrees well with the analytical solution. Moreover, an experiment is conducted to verify its effectiveness in an VLC system with 2 LEDs and 2 users. Experimental results show that the communication radius with the symbol-level precoding scheme can be improved by approximately 0.1m and 0.2m compared with ZF precoding and no precoding, respectively.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121461554","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
A Stackelberg Game for Cooperative Cognitive Wireless Powered Communication Networks with Multiple Primary Users 多主用户协同认知无线通信网络的Stackelberg博弈
Qun Li, Ding Xu
{"title":"A Stackelberg Game for Cooperative Cognitive Wireless Powered Communication Networks with Multiple Primary Users","authors":"Qun Li, Ding Xu","doi":"10.1109/WCSP.2019.8928010","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928010","url":null,"abstract":"We consider a cooperative cognitive wireless powered communication network consisting of a cognitive base station (CBS), multiples secondary users (SUs) and multiple wireless powered primary users (PUs). A two stage protocol is adopted, in which the CBS transmits information bearing signals and the PUs harvest energy from these RF signals first, and then the PUs transmit information based on the harvested energy. We assume that the CBS prices the energy transferred to the PUs. The interaction between the CBS and the PUs is modeled as a Stackelberg game, in which the CBS acts as a leader to determine the prices and the time allocation, while the PUs act as followers to determine the required transmit power of the CBS. An algorithm is proposed to achieve the Stackelberg equilibrium. It is shown that the proposed algorithm outperforms the equal-time benchmark algorithm in terms of the utility of the CBS, and is inferior to the equal-time benchmark algorithm in terms of the average utility of the PUs.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115419043","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
Privacy-Protected Certificateless Aggregate Signature Scheme in VANET VANET中保护隐私的无证书聚合签名方案
Nan Zhao, Guoan Zhang
{"title":"Privacy-Protected Certificateless Aggregate Signature Scheme in VANET","authors":"Nan Zhao, Guoan Zhang","doi":"10.1109/WCSP.2019.8928040","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928040","url":null,"abstract":"We propose a certificateless aggregate signature (CLAS) scheme for privacy protection based on the certificateless public key cryptosystem and aggregate signature aiming at the common problems of communication security and efficiency in vehicular ad hoc network (VANET). The scheme can resist two different types of adversary attacks under the random oracle model and satisfy the unforgeability of communication messages as well as traceability and anonymity of vehicles. The scheme avoids the key escrow problem and certificate management. Based on the bilinear pairing operations, the aggregation verification of multiple messages is realized through aggregation signature. We quantitatively analyze the computational overhead of the scheme and define a new variable of computational efficiency. Our scheme is proved to be more efficient when V2I communication is carried out in urban roads compared with other schemes.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114346114","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}
引用次数: 9
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学术官方微信