2020 IEEE Wireless Communications and Networking Conference (WCNC)最新文献_第10页

Fine-grained Analysis and Optimization of Flexible Spatial Difference in User-centric Network 用户中心网络柔性空间差异的细粒度分析与优化

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120499

Danyang Wu, Hongtao Zhang

{"title":"Fine-grained Analysis and Optimization of Flexible Spatial Difference in User-centric Network","authors":"Danyang Wu, Hongtao Zhang","doi":"10.1109/WCNC45663.2020.9120499","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120499","url":null,"abstract":"In user-centric network, traditional typical user analysis method based on spatial average results is no longer applicable due to the flexible spatial difference, which is the large fluctuations in user performance with spatial location. Especially because of power control leading to keen spatial competition, the spatial difference becomes much significantly, so that fine-grained analysis method is needed to evaluate its performance. This paper analyzes the spatial difference in user-centric network with power control through meta distribution from many different fine-grained perspectives to reveal that power control improves the performance not only in the sense of the spatial average, but also in the complete spatial distribution. Specifically, the complementary cumulative distribution function (CCDF) of the conditional transmitting success probability, the mean local delay and the 5%-tile users performance are given to depict power control effect on the individual links. This analysis provides the optimal values of the area and intensity for power control deployment in user-centric network. Numerical results show that after applying power control the users of high coverage probability can be improved at most by 38%, the mean local delay decreases by 2x and 4x gains can be obtained as for the 5%-tile user’s performance.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"84 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":"129910408","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 Low-Complexity Algorithm for Cell Identity Detection in NB-IoT Physical Layer 一种低复杂度的NB-IoT物理层小区身份检测算法

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120525

Hung-Ying Chang, Jian-Bin Chang, Chao-Yu Chen

引用次数: 1

Distributed V2V Computation Offloading Based on Dynamic Pricing Using Deep Reinforcement Learning 基于深度强化学习动态定价的分布式V2V计算卸载

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120816

Jinming Shi, Jun Du, Jian Wang, Jian Yuan

{"title":"Distributed V2V Computation Offloading Based on Dynamic Pricing Using Deep Reinforcement Learning","authors":"Jinming Shi, Jun Du, Jian Wang, Jian Yuan","doi":"10.1109/WCNC45663.2020.9120816","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120816","url":null,"abstract":"Vehicular computation offloading is a promising paradigm that improves the computing capability of vehicles to support autonomous driving and various on-board infotainment services. Comparing with accessing the remote cloud, distributed vehicle-to-vehicle (V2V) computation offloading is more efficient and suitable for delay-sensitive tasks by taking advantage of vehicular idle computing resources. Due to the high dynamic vehicular environment and the variation of available vehicular computing resources, it is a great challenge to design an effective task offloading mechanism to efficiently utilize vehicular computing resources. In this paper, we investigate the computation task allocation among vehicles, and propose a distributed V2V computation offloading framework, in which wireless channel states and variation of idle computing resources are both considered. Specially, we formulate the task allocation problem as a sequential decision making problem, which can be solved by using deep reinforcement learning. Considering that vehicles with idle computing resources may not share their computing resources voluntarily, we thus propose a dynamic pricing scheme that motivates vehicles to contribute their computing resources according to the price they receive. The performance of designed task allocation mechanism is validated by simulation results which reveal the effectiveness of our mechanism compared to the other algorithms.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 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":"128527122","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}

引用次数: 13

End-to-end Throughput Optimization in Multi-hop Wireless Networks with Cut-through Capability 具有直通能力的多跳无线网络的端到端吞吐量优化

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120679

Shengbo Liu, Liqun Fu

{"title":"End-to-end Throughput Optimization in Multi-hop Wireless Networks with Cut-through Capability","authors":"Shengbo Liu, Liqun Fu","doi":"10.1109/WCNC45663.2020.9120679","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120679","url":null,"abstract":"In-band full-duplex (FD) technique can efficiently improve the end-to-end throughput of a multi-hop network via enabling multi-hop FD amplify-and-forward relaying (cut-through) transmission. This paper investigates the optimal hop size of a cut-through transmission and spatial reuse to achieve the maximum achievable end-to-end throughput of a multi-hop network. In particular, we consider spatial reuse and establish an interference model for a string-topology multi-hop network with x-hop cut-through transmission, and show that the maximum achievable end-to-end throughput is a function of x and the spatial separation between two concurrently active cut-through transmissions. Through extensive numerical studies, we show that the achievable date rate of a cut-through transmission drastically decreases along with the increase of the hop size x. Furthermore, we find that the 2-hop cut-through transmission mode can always achieve the maximum end-to-end throughput using Shannon Capacity formula if the spatial reuse is properly addressed. On the other hand, the results show that the 5-hop cut-through transmission mode can obtain the maximum end-to-end throughput with discrete channel rates when the self-interference cancellation is perfect and the hop distance is small.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"30 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":"127632235","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

Performance Analysis of Temporal Correlation in Finite-Area UAV Networks with LoS/NLoS 具有LoS/NLoS的有限区域无人机网络时间相关性性能分析

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120822

Ruixin Jin, Liyun Yang, Hongtao Zhang

{"title":"Performance Analysis of Temporal Correlation in Finite-Area UAV Networks with LoS/NLoS","authors":"Ruixin Jin, Liyun Yang, Hongtao Zhang","doi":"10.1109/WCNC45663.2020.9120822","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120822","url":null,"abstract":"In the existing works, the finite-area distribution of Unmanned Aerial Vehicle (UAV) and the effects of LoS and NLoS in air-to-ground channels have not been modeled when analyzing the temporal correlation in UAV networks, which makes the current analyses unsuitable for the practical deployment in hotspots. This paper analyzes the temporal correlation by deriving the expression of the interference correlation and joint coverage probability in mobile UAV networks, where all UAVs move independently in a finite area and the channel fading is calculated based on air-to-ground channel model with LoS and NLoS. Specifically, the temporal correlation is measured by incorporating the fluctuations caused by probability variation of LoS and the reliable network topology caused by finite mobility into the wireless channels. Furthermore, the non-uniform distribution caused by random mobility of UAVs is considered over different time slots. The results show that the interference correlation decreases as the moving distance of UAVs increases, and the decreasing interference correlation offsets part of the decrease in joint coverage probability caused by increasing moving distance of UAVs.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"174 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113973039","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

Location-Privacy-Aware Service Migration in Mobile Edge Computing 移动边缘计算中的位置隐私感知服务迁移

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120551

Weixu Wang, Shuxin Ge, Xiaobo Zhou

{"title":"Location-Privacy-Aware Service Migration in Mobile Edge Computing","authors":"Weixu Wang, Shuxin Ge, Xiaobo Zhou","doi":"10.1109/WCNC45663.2020.9120551","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120551","url":null,"abstract":"To cope with user mobility and resource constraints of the edge servers, various service migration policies have been proposed in mobile edge computing (MEC) to achieve a trade-off between user-perceived delay and the service migration cost by moving the service to the user as close as possible. However, there is a risk of user location privacy leakage if a malicious eavesdropper tracks the service migration trajectory. In this paper, we investigate service migration in MEC by taking the risk of location privacy leakage into account. More specifically, we define the total cost of the system as the combination of the migration cost, user-perceived delay and the risk of location privacy leakage. We formulate the service migration problem as a Markov decision process, and propose an efficient algorithm to find the optimal solution that minimize the long-term total cost. Finally, the simulations based on real-world taxi traces in San Francisco show that the proposed method can make service migration decisions effectively protect the location privacy of users, as well as achieves a lower total cost than other baseline methods.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"300 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114000809","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}

引用次数: 12

Multi-BS association and Pilot Allocation via Pursuit Learning 基于追求学习的多bs关联与试点分配

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120561

Naufan Raharya, Wibowo Hardjawana, Obada Al-Khatib, B. Vucetic

{"title":"Multi-BS association and Pilot Allocation via Pursuit Learning","authors":"Naufan Raharya, Wibowo Hardjawana, Obada Al-Khatib, B. Vucetic","doi":"10.1109/WCNC45663.2020.9120561","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120561","url":null,"abstract":"Pilot contamination (PC) interference causes an inaccurate user equipment’s (UE) channel estimations and significant signal-to-interference ratio (SINR) degradations. To combat the PC effect and to maximize network spectral efficiency, pilot allocation can be combined with multi-Base Station (BS) association and then solved by using learning algorithm efficiently. However, current methods separate the pilot allocation and multi-BS association in the network. This results in suboptimal network spectral efficiency performance and can cause an outage where some UEs are not allocated pilots due to the limited availability of pilots at each BS. In this paper, we propose a multi-BS association and pilot allocation optimization via pursuit learning. Here, we design a parallel pursuit learning algorithm that decomposes the optimization function into smaller entities called learning automata. Each learning automaton computes the joint pilot allocation and BS association solution in parallel, by using the reward from the environment. Simulation results show that our scheme outperforms the existing schemes and does not cause an outage.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"38 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":"122421892","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

Zero-touch coordination framework for Self-Organizing Functions in 5G 5G自组织功能的零接触协调框架

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120799

Diego Fernando Preciado Rojas, Faiaz Nazmetdinov, A. Mitschele-Thiel

{"title":"Zero-touch coordination framework for Self-Organizing Functions in 5G","authors":"Diego Fernando Preciado Rojas, Faiaz Nazmetdinov, A. Mitschele-Thiel","doi":"10.1109/WCNC45663.2020.9120799","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120799","url":null,"abstract":"Traditional mobile network services are built by chaining together multiple functional boxes on which creation of new services is rather static. With the advent of 5G technology the ability to offer agile on-demand services to the users is mandatory. Therefore lifecycle operations such as service initial deployment, configuration changes, upgrades, scale-out, scale-in, optimization, self-healing etc. should be fully automated steps. Self-Organized Networks Functions (SF) were proposed to provide self-adaptation capabilities to mobile networks on different fronts: configuration, optimization and healing and somehow reduce the error-prone human intervention.Nevertheless, conventional design of these SFs was based on single objective optimization approaches where SFs were considered as standalone agents aiming at one very specific local objective (e.g. reduce the interference or increase the coverage). Thus, complex inter-dependencies between SFs were at some extent unattended, so when more than one function is acting on the network, conflicts are inevitable. A well-studied conflict happens when Mobility Load Balancing (MLB) and Mobility Robustness optimization (MRO) functions are simultaneously set up: without coordination, performance degradation is expected because of the cross-dependencies between both SFs. To cope with these underlying conflicts, we propose a zero-touch coordination framework based on Machine Learning (ML) to automatically learn the dynamics between the selected SFs and assist the network optimization task.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"63 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":"133083586","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

Advanced Hardware Architectures for Turbo Code Decoding Beyond 100 Gb/s Turbo码解码超过100 Gb/s的先进硬件架构

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120779

Stefan Weithoffer, Oliver Griebel, Rami Klaimi, C. A. Nour, N. Wehn

{"title":"Advanced Hardware Architectures for Turbo Code Decoding Beyond 100 Gb/s","authors":"Stefan Weithoffer, Oliver Griebel, Rami Klaimi, C. A. Nour, N. Wehn","doi":"10.1109/WCNC45663.2020.9120779","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120779","url":null,"abstract":"In this paper, we present two new hardware architectures for Turbo Code decoding that combine functional, spatial and iteration parallelism. Our first architecture is the first fully pipelined iteration unrolled architecture that supports multiple frame sizes. This frame flexibility is achieved by providing a set of interleavers designed to achieve a hardware implementation with a reduced routing overhead. The second architecture efficiently utilizes the dynamics of the error rate distribution for different decoding iterations and is comprised of two stages. First, a fully pipelined iteration unrolled decoder stage applied for a pre-determined number of iterations and a second stage with an iterative afterburner-decoder activated only for frames not successfully decoded by the first stage. We give post place & route results for implementations of both architectures for a maximum frame size of K = 128 and demonstrate a throughput of 102.4 Gb/s in 2S nm FDSOI technology. With an area efficiency of 6.19 and 7.15 Gb/s/m$m^{2}$ our implementations clearly outperform state of the art.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"13 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":"133423267","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}

引用次数: 6

Filter Bank Multicarrier Transmission Based on the Discrete Hartley Transform 基于离散哈特利变换的滤波器组多载波传输

2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120467

Chin-Liang Wang, Hong Pan, Chia-Tung Tuan

引用次数: 1