2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)最新文献

筛选
英文 中文
Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions 重传LPWA网络中信道选择的上置信度
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2019-02-27 DOI: 10.1109/WCNCW.2019.8902891
Rémi Bonnefoi, Lilian Besson, Julio Manco-Vásquez, C. Moy
{"title":"Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions","authors":"Rémi Bonnefoi, Lilian Besson, Julio Manco-Vásquez, C. Moy","doi":"10.1109/WCNCW.2019.8902891","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902891","url":null,"abstract":"In this paper, we propose and evaluate different learning strategies based on Multi-Arm Bandit (MAB) algorithms. They allow Internet of Things (IoT) devices to improve their access to the network and their autonomy, while taking into account the impact of encountered radio collisions. For that end, several heuristics employing Upper-Confident Bound (UCB) algorithms are examined, to explore the contextual information provided by the number of retransmissions. Our results show that approaches based on UCB obtain a significant improvement in terms of successful transmission probabilities. Furthermore, it also reveals that a pure UCB channel access is as efficient as more sophisticated learning strategies.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115273841","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
Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix 基于矩的峰均功率比定界及酉矩阵约简
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2019-02-18 DOI: 10.1109/WCNCW.2019.8902899
H. Tsuda
{"title":"Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix","authors":"H. Tsuda","doi":"10.1109/WCNCW.2019.8902899","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902899","url":null,"abstract":"Reducing Peak-to-Average Power Ratio (PAPR) is a significant task in OFDM systems. To evaluate the efficiency of PAPR-reducing methods, the complementary cumulative distribution function (CCDF) of PAPR is often used. In the situation where the central limit theorem can be applied, an approximate form of the CCDF has been obtained. On the other hand, in general situations, the bound of the CCDF has been obtained under some assumptions. In this paper, we derive the bound of the CCDF with no assumption about modulation schemes. Therefore, our bound can be applied with any codewords and that our bound is written with fourth moments of codewords. Further, we propose a method to reduce the bound with unitary matrices. With this method, it is shown that our bound is closely related to the CCDF of PAPR.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116919765","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
Multi-Channel Access Solutions for 5G New Radio 5G新无线电的多通道接入解决方案
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2019-01-28 DOI: 10.1109/WCNCW.2019.8902668
N. Mahmood, D. Laselva, David Palacios, Mustafa Emara, Miltiades Filippou, Dong Min Kim, Isabel de la Bandera
{"title":"Multi-Channel Access Solutions for 5G New Radio","authors":"N. Mahmood, D. Laselva, David Palacios, Mustafa Emara, Miltiades Filippou, Dong Min Kim, Isabel de la Bandera","doi":"10.1109/WCNCW.2019.8902668","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902668","url":null,"abstract":"Multi-channel access is a family of multi-service radio resource management solutions that enable a user equipment to aggregate radio resources from multiple sources. The objective is multi-fold: throughput enhancement through access to a larger bandwidth tailored for enhanced mobile broadband, reliability improvement by increasing the diversity order and/or coordinated transmission/reception tailored for ultra-reliable low latency communication service classes, as well as flexibility and load balancing improvement by decoupling the downlink and the uplink access points, for both service classes. This paper presents several multi-channel access solutions for 5G New Radio multi-service scenarios. In particular, throughput enhancement and latency reduction concepts like multi-connectivity, carrier aggregation, downlink-uplink decoupled access and coordinated multi-point connectivity are discussed. Moreover, novel design solutions exploiting these concepts are proposed. Numerical evaluation of the introduced solutions indicates significant performance gains over state-of-the-art schemes; for example, our proposed component carrier selection mechanism leads to a median throughput gain of up to 100% by means of an implicit load balance. Therefore, the proposed multi-channel access solutions have the potential to be key multi-service enablers for 5G New Radio.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114491821","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
Enabling End-to-End Secure Connectivity for Low-Power IoT Devices with UAVs 为带有无人机的低功耗物联网设备实现端到端安全连接
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2018-11-10 DOI: 10.1109/WCNCW.2019.8902746
Archana Rajakaruna, Ahsan Manzoor, P. Porambage, Madhusanka Liyanage, M. Ylianttila, A. Gurtov
{"title":"Enabling End-to-End Secure Connectivity for Low-Power IoT Devices with UAVs","authors":"Archana Rajakaruna, Ahsan Manzoor, P. Porambage, Madhusanka Liyanage, M. Ylianttila, A. Gurtov","doi":"10.1109/WCNCW.2019.8902746","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902746","url":null,"abstract":"The proliferation of the Internet of Things (IoT) technologies have strengthen the self-monitoring and autonomous characteristics of the sensor networks deployed in numerous application areas. The recent developments of the edge computing paradigms have also enabled on-site processing and managing the capabilities of sensor networks. In this paper, we introduce a system model that enables end-to-end secure connectivity between low-power IoT devices and UAVs, that helps to manage the data processing tasks of heterogeneous wireless sensor networks. The performance of proposed solution is analyzed by using simulation results. Moreover, in order to demonstrate the practical usability of the proposed solution, the prototype implementation is presented using commercial off-the-shelf devices.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132306963","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}
引用次数: 11
Adaptive Task Allocation for Mobile Edge Learning 移动边缘学习的自适应任务分配
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2018-11-09 DOI: 10.1109/WCNCW.2019.8902527
Umair Mohammad, Sameh Sorour
{"title":"Adaptive Task Allocation for Mobile Edge Learning","authors":"Umair Mohammad, Sameh Sorour","doi":"10.1109/WCNCW.2019.8902527","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902527","url":null,"abstract":"This paper aims to establish a new optimization paradigm to efficiently execute distributed learning tasks on wireless edge nodes with heterogeneous computing and communication capacities. We will refer to this new paradigm as “Mobile Edge Learning (MEL)”. The problem of adaptive task allocation for MEL is considered in this paper with the aim to maximize the learning accuracy, while guaranteeing that the total times of data distribution/aggregation over heterogeneous channels, and local computation on heterogeneous nodes, are bounded by a preset duration. The problem is first formulated as a quadratically-constrained integer linear problem. Being NP-hard, the paper relaxes it into a non-convex problem over real variables. We then propose a solution based on deriving analytical upper bounds on the optimal solution of this relaxed problem using KKT conditions. The merits of this proposed solution is exhibited by comparing its performances to both numerical approaches and the equal task allocation approach.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042187","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}
引用次数: 30
Superimposed Frame Synchronization Optimization for Finite Blocklength Regime 有限块长度域的叠加帧同步优化
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2018-10-17 DOI: 10.1109/WCNCW.2019.8902552
A. Nguyen, R. L. Bidan, F. Guilloud
{"title":"Superimposed Frame Synchronization Optimization for Finite Blocklength Regime","authors":"A. Nguyen, R. L. Bidan, F. Guilloud","doi":"10.1109/WCNCW.2019.8902552","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902552","url":null,"abstract":"Considering a short frame length, which is typical in Ultra-Reliable Low-Latency and massive Machine Type Communications, a trade-off exists between improving the performance of frame synchronization (FS) and improving the performance of information throughput. In this paper, we consider the case of continuous transmission over AWGN channels where the synchronization sequence is superimposed to the data symbols, as opposed to being added as a frame header. The advantage of this superposition is that the synchronization length is as long as the frame length. On the other hand, its power has to be traded-off not to degrade the code performance. We first provide the analysis of FS error probability using an approximation of the probability distribution of the overall received signal. Numerical evaluations show the tightness of our analytic results. Then we optimize the fraction of power allocated to the superimposed synchronization sequence in order to maximize the probability of receiving a frame without synchronization errors nor decoding errors. Comparison of the theoretical model predictions to a practical setup show very close optimal power allocation policies.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114068195","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
Carrier-Sense Multiple Access for Heterogeneous Wireless Networks Using Deep Reinforcement Learning 基于深度强化学习的异构无线网络载波感知多址接入
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2018-10-16 DOI: 10.1109/WCNCW.2019.8902705
Yiding Yu, S. Liew, Taotao Wang
{"title":"Carrier-Sense Multiple Access for Heterogeneous Wireless Networks Using Deep Reinforcement Learning","authors":"Yiding Yu, S. Liew, Taotao Wang","doi":"10.1109/WCNCW.2019.8902705","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902705","url":null,"abstract":"This paper investigates a new class of carrier-sense multiple access (CSMA) protocols that employ deep reinforcement learning (DRL) techniques for heterogeneous wireless networking, referred to as carrier-sense deep-reinforcement learning multiple access (CS-DLMA). Existing CSMA protocols, such as the medium access control (MAC) of WiFi, are designed for a homogeneous network environment in which all nodes adopt the same protocol. Such protocols suffer from severe performance degradation in a heterogeneous environment where there are nodes adopting other MAC protocols. This paper shows that DRL techniques can be used to design efficient MAC protocols for heterogeneous networking. In particular, in a heterogeneous environment with nodes adopting different MAC protocols (e.g., CS-DLMA, TDMA, and ALOHA), a CS-DLMA node can learn to maximize the sum throughput of all nodes. Furthermore, compared with WiFi’s CSMA, CS-DLMA can achieve both higher sum throughput and individual throughputs when co-existing with other MAC protocols. Last but not least, a salient feature of CS-DLMA is that it does not need to know the operating mechanisms of the co-existing MACs. Neither does it need to know the number of nodes using these other MACs.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116248133","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}
引用次数: 11
Low-Complexity Detection of M-ary PSK Faster-than-Nyquist Signaling 比nyquist信令更快的m - mary PSK低复杂度检测
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2018-10-12 DOI: 10.1109/WCNCW.2019.8902619
E. Bedeer, H. Yanikomeroglu, M. Ahmed
{"title":"Low-Complexity Detection of M-ary PSK Faster-than-Nyquist Signaling","authors":"E. Bedeer, H. Yanikomeroglu, M. Ahmed","doi":"10.1109/WCNCW.2019.8902619","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902619","url":null,"abstract":"Faster-than-Nyquist (FTN) signaling is a promising non-orthogonal physical layer transmission technique to improve the spectral efficiency of future communication systems but at the expense of intersymbol-interference (ISI). In this paper, we investigate the detection problem of FTN signaling and formulate the sequence estimation problem of any M-ary phase shift keying (PSK) FTN signaling as an optimization problem that turns out to be non-convex and nondeterministic polynomial time (NP)-hard to solve. We propose a novel algorithm, based on concepts from semidefinite relaxation (SDR) and Gaussian randomization, to detect any M-ary PSK FTN signaling in polynomial time complexity regardless of the constellation size M or the ISI length. Simulation results show that the proposed algorithm strikes a balance between the achieved performance and the computational complexity. Additionally, results show the merits of the proposed algorithm in improving the spectral efficiency when compared to Nyquist signaling and the state-of-the-art schemes from the literature. In particular, when compared to Nyquist signaling at the same error rate and signal-to-noise ratio, our scheme provides around 17% increase in the spectral efficiency at a roll-off factor of 0.3.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117008171","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
Towards Mobility-Aware Proactive Caching for Vehicular Ad hoc Networks 面向车辆自组织网络的移动感知主动缓存
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2018-10-02 DOI: 10.1109/WCNCW.2019.8902903
Yousef AlNagar, Sameh Hosny, A. El-Sherif
{"title":"Towards Mobility-Aware Proactive Caching for Vehicular Ad hoc Networks","authors":"Yousef AlNagar, Sameh Hosny, A. El-Sherif","doi":"10.1109/WCNCW.2019.8902903","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902903","url":null,"abstract":"Harnessing information about the user mobility pattern and daily demand can enhance the network capability to improve the quality of experience (QoE) at Vehicular Ad- Hoc Networks (VANETs). Proactive caching, as one of the key features offered by 5G networks, has lately received much interest. However, more research is still needed to convey large-sized multimedia content including video, audio and pictures to the high speed moving vehicles. In this paper, we study the gains achieved by proactive caching in Roadside Units (RSUs) where we take into consideration the effect of the vehicle velocity on the optimal caching decision. Information about the user demand and mobility is harnessed to cache some files in RSUs, which will communicate with vehicles traversing along the visited roads before the actual demand. Our main objective is to minimize the total network latency. Towards this objective, we formulate two optimization problems for non-cooperative and cooperative caching schemes to find the optimal caching policy to decide which files to be cached by the RSUs. Due to the complexity of these problems, we propose a sub-optimal caching policy for each scheme. We compare the performance of the optimal caching policy to that of the sub-optimal caching policy. Numerical results show that proactive caching has a significant performance gain when compared to the baseline reactive scenario. Moreover, results reveal that the cooperative caching scheme is more efficient than the non-cooperative scheme.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124547179","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}
引用次数: 17
Time and Frequency Varying Noise Floor Estimation for Spectrum Usage Measurement 频谱利用率测量的时变和变频噪声本底估计
2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW) Pub Date : 2018-01-18 DOI: 10.1109/WCNCW.2019.8902886
Hiroki Iwata, K. Umebayashi, Ahmed Al-Tahmeesschi, M. López-Benítez, Janne J. Lehtomäki
{"title":"Time and Frequency Varying Noise Floor Estimation for Spectrum Usage Measurement","authors":"Hiroki Iwata, K. Umebayashi, Ahmed Al-Tahmeesschi, M. López-Benítez, Janne J. Lehtomäki","doi":"10.1109/WCNCW.2019.8902886","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902886","url":null,"abstract":"We investigate noise floor (NF) estimation for FFT-ED (Energy Detection based on FFT)-based spectrum usage measurement in the context of smart spectrum access (SSA), in which spectrum usage information of primary users (PUs), such as channel occupancy rate (COR), will be exploited by secondary users (SUs). In FFT-ED, the NF has to be estimated to set a decision threshold for ED appropriately. In general, the NF is frequency-dependent and its level changes with time leading to the need of estimating the NF regularly while performing the spectrum usage measurement. In this paper, we propose an NF estimation method which exploits prior information regarding the shape of NF and forward consecutive mean excision (FCME) algorithm. Numerical and experimental evaluations show the proposed method enables an accurate NF estimation considering the time and frequency dependencies of the NF. Moreover, we show the proposed method can obtain the almost desired detection performance, but can not the comparative method (the original FCME method).","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128535841","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学术官方微信