发布求助
文献互助 智能选刊 最新文献

2020 IEEE Wireless Communications and Networking Conference (WCNC)最新文献

筛选
英文 中文
Robust Self-Protection Against Application-Layer (D)DoS Attacks in SDN Environment SDN环境下针对应用层DoS攻击的鲁棒自我防护
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120472
Chafika Benzaïd, M. Boukhalfa, T. Taleb
{"title":"Robust Self-Protection Against Application-Layer (D)DoS Attacks in SDN Environment","authors":"Chafika Benzaïd, M. Boukhalfa, T. Taleb","doi":"10.1109/WCNC45663.2020.9120472","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120472","url":null,"abstract":"The expected high bandwidth of 5G and the envisioned massive number of connected devices will open the door to increased and sophisticated attacks, such as application-layer DDoS attacks. Application-layer DDoS attacks are complex to detect and mitigate due to their stealthy nature and their ability to mimic genuine behavior. In this work, we propose a robust application-layer DDoS self-protection framework that empowers a fully autonomous detection and mitigation of the application-layer DDoS attacks leveraging on Deep Learning (DL) and SDN enablers. The DL models have been proven vulnerable to adversarial attacks, which aim to fool the DL model into taking wrong decisions. To overcome this issue, we build a DL-based application-layer DDoS detection model that is robust to adversarial examples. The performance results show the effectiveness of the proposed framework in protecting against application-layer DDoS attacks even in the presence of adversarial attacks.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"126 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":"121450538","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}
引用次数: 15
Time Switching Protocol for Multi-Antenna SWIPT Systems 多天线SWIPT系统的时间交换协议
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120833
Seowoo Kang, Hoon Lee, S. Hwang, Inkyu Lee
{"title":"Time Switching Protocol for Multi-Antenna SWIPT Systems","authors":"Seowoo Kang, Hoon Lee, S. Hwang, Inkyu Lee","doi":"10.1109/WCNC45663.2020.9120833","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120833","url":null,"abstract":"In this paper, we investigate simultaneous wireless information and power transfer (SWIPT) where a multi-antenna transmitter conveys information and energy simultaneously to a multi-antenna receiver equipped with time switching (TS) circuits for an energy harvesting (EH) mode and an information decoding (ID) mode. In contrast with conventional uniform TS (UTS) structure where all the receive antennas at the receiver apply a single TS circuit, to improve the SWIPT performance, we suggest a general dynamic TS (DTS) receiver architecture which consists of an individual TS circuit for each antenna. We aim to analyze the achievable rate-energy (R-E) tradeoff of the DTS system by jointly optimizing the covariance matrices at the transmitter and the time durations for the EH and the ID modes of the receive antennas. To determine the boundary points of the R-E region, we suggest the globally optimal algorithm for the rate maximization problem via convex optimization techniques. Numerical examples verify the efficacy of the proposed DTS over conventional UTS methods.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"7 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":"114696190","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
Multi-Channel Delay Sensitive Scheduling for Convergecast Network 汇聚网络的多通道时延敏感调度
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120790
Daoud Burghal, K. Kim, Jianlin Guo, P. Orlik, T. Hori, T. Sumi, Yukimasa Nagai
{"title":"Multi-Channel Delay Sensitive Scheduling for Convergecast Network","authors":"Daoud Burghal, K. Kim, Jianlin Guo, P. Orlik, T. Hori, T. Sumi, Yukimasa Nagai","doi":"10.1109/WCNC45663.2020.9120790","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120790","url":null,"abstract":"Motivated by an increasing interest in wireless networking in mission-critical applications, and a recent amendment of the time slotted channel hopping to IEEE 802.15.4, the multichannel delay sensitive scheduling is investigated in the many-to-one network, which is also known as the convergecast network. In such a network, each node has data to be transmitted to a gateway through multi-hop communications. As a realistic setting, packet release time at each node is not assumed to be uniform. Under this assumption, the goal of this work is to design a scheduling scheme that minimizes the schedule length and maximum end-to-end delay, in which the former is essential for repetitive data acquisition, whereas the later improves the freshness of the acquired data. To achieve the scheduling goal, the problem is formulated as a multi-objective integer programming. To obtain a feasible solution and gain an insight into the problem, a lower bound on the schedule length is derived. Based on that, a new scheduling scheme is designed to minimize the two objectives simultaneously. Link level simulations verify the performance improvement of the proposed scheme over the existing schemes.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"116 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":"128075778","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
Wireless Fingerprint Aided Spectrum Sensing in Cellular Cognitive Radio Networks 蜂窝认知无线网络中的无线指纹辅助频谱传感
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120852
Xin Wang, Siji Chen, Bin Shen, Taiping Cui
{"title":"Wireless Fingerprint Aided Spectrum Sensing in Cellular Cognitive Radio Networks","authors":"Xin Wang, Siji Chen, Bin Shen, Taiping Cui","doi":"10.1109/WCNC45663.2020.9120852","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120852","url":null,"abstract":"Apart from the received signal energy, geo-location information plays an important role in ameliorating spectrum sensing performance. In this paper, a novel wireless fingerprint (WFP) aided spectrum sensing scheme is proposed. Assisted by the wireless fingerprint database (WFPD), secondary user equipments (SUEs) first identify their locations in the cellular cognitive radio network (CCRN) and then ascertain the white licensed spectrum for opportunistic access. The SUEs can pinpoint their geographical locations via time of arrival (TOA) estimate over the signals received from their surrounding base-stations (BSs). In view of the fact that locations of the primary user (PU) transmitters are either readily known or practically unavailable, the SUEs can search the WFPD or perform support vector machine (SVM) algorithm to determine the availability of the licensed spectrum, according to the locations of themselves and the PU transmitters (PUTs). In addition, to alleviate the deficiency of single SU based sensing, a joint prediction mechanism is proposed on the basis of cooperations of multiple SUs that are geographically nearby. Simulations verify that the proposed scheme achieves higher detection probability and demands less energy consumption than conventional spectrum sensing algorithms.","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":"128132989","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
Vehicle platooning schemes considering V2V communications: A joint communication/control approach 考虑V2V通信的车辆队列方案:一种联合通信/控制方法
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120759
T. Gonçalves, V. Varma, S. Elayoubi
{"title":"Vehicle platooning schemes considering V2V communications: A joint communication/control approach","authors":"T. Gonçalves, V. Varma, S. Elayoubi","doi":"10.1109/WCNC45663.2020.9120759","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120759","url":null,"abstract":"This article addresses communication and control aspects of platooning systems with the related challenges introduced by the overlap of both areas. The main objective is to provide a dynamic control mechanism where the parameters of the well-known Predicted Cooperative Adaptive Cruise Control (PCACC) are adapted based on the observed quality of the V2V (Vehicle-to-Vehicle) communication links. Different from the state of the art, our main design goal is the minimization of inter-vehicular distances while being robust in terms of an extremely low probability of emergency braking. A new adaptive control scheme based on the offline optimization of the control gains is proposed. We evaluate the new approach in a highway scenario and show the improvements obtained by the dynamic adaptation of the control parameters over static control strategies.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"95 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":"121939334","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
Cooperative Localization in Wireless Sensor Networks with AOA Ranging Measurements 基于AOA测距测量的无线传感器网络协同定位
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120806
Xianbo Jiang, Shengchu Wang
{"title":"Cooperative Localization in Wireless Sensor Networks with AOA Ranging Measurements","authors":"Xianbo Jiang, Shengchu Wang","doi":"10.1109/WCNC45663.2020.9120806","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120806","url":null,"abstract":"This paper researches the cooperative localization in wireless sensor networks (WSNs) with $2pi/pi$-periodic angle-of-arrival (AOA) ranging measurements. When the orientation angles of the antenna arrays at WSN nodes are known, a ranging link loss is defined based on the tan-relationships between AOA observations and xy-minus coordinates of two neighboring nodes. Subsequently, the positioning problem under $2pi$-periodic AOAs is converted as a convex optimization problem about minimizing total ranging-link loss through optimizing agent positions, which is resolved by the gradient-descent (GD) method. Under $pi$-periodic AOAs, additional 0/1 integers are introduced to indicate the front-or-back impinging directions. By relaxing 0/1 integers as continuous variables within $[0,1]$, the positioning problem is relaxed as a nonconvex optimization one about minimizing total link loss over the agent positions and indicating variables, which is solved by the projected GD (PGD) method. Finally, Type-I least-square (LS) localizer is developed for WSNs with both $2pi$ and $pi$-periodic AOAs. When the orientation angles are unknown, Type-II LS localizer is developed by combining Type-I LS localizer with a maximum-likelihood (ML) orientation estimator, which alternatively updates agent positions and orientation angles. Simulation results validate that the proposed LS-type localizers outperform existing localizers.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"33 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":"121946170","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
Binary Power Optimality for Two Link Full-Duplex Network 双链路全双工网络的二进制功率最优性
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120530
Shalanika Dayarathna, R. Senanayake, J. Evans
{"title":"Binary Power Optimality for Two Link Full-Duplex Network","authors":"Shalanika Dayarathna, R. Senanayake, J. Evans","doi":"10.1109/WCNC45663.2020.9120530","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120530","url":null,"abstract":"In this paper, we analyse the optimality of binary power allocation in a network that includes full-duplex communication links. Considering a network with four communicating nodes, two of them operating in half-duplex mode and the other two in full-duplex mode, we prove that binary power allocation is optimum for the full-duplex nodes when maximizing the sum rate. We also prove that, for half-duplex nodes binary power allocation is not optimum in general. However, for the two special cases, 1) the low signal-to-noise-plus-interference (SINR) regime and, 2) the approximation by the arithmetic mean-geometric mean inequality, binary power allocation is optimum for the approximated sum rate even for the half-duplex nodes. We further analyse a third special case using a symmetric network for which the optimum power allocation is binary, under a sufficient condition. Numerical examples are included to illustrate the accuracy of the results.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"68 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":"128182630","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
WCNC 2020 Preface
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/wcnc45663.2020.9120677
{"title":"WCNC 2020 Preface","authors":"","doi":"10.1109/wcnc45663.2020.9120677","DOIUrl":"https://doi.org/10.1109/wcnc45663.2020.9120677","url":null,"abstract":"","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"83 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":"115766771","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
Robust Federated Learning Under Worst-Case Model 最坏情况下的鲁棒联邦学习
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120713
F. Ang, Li Chen, Weidong Wang
{"title":"Robust Federated Learning Under Worst-Case Model","authors":"F. Ang, Li Chen, Weidong Wang","doi":"10.1109/WCNC45663.2020.9120713","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120713","url":null,"abstract":"Federated learning provides a communication- efficient training process via alternating between local training and averaging updated local model. Nevertheless, it requires perfectly acquisition of the model which is hard to achieve in wireless communication practically, and the noise will cause serious effect on federated learning. To tackle this challenge, we propose a robust design for federated learning to decline the effect of noise. Considering the noise in communication steps, we first formulate the problem as the parallel optimization for each node under worst-case model. We utilize the sampling-based successive convex approximation algorithm to develop a feasible training scheme, due to the unavailable maxima noise condition and non-convex issue of the objective function. In addition, the convergence rate of proposed design are analyzed from a theoretical point of view. Finally, the prediction accuracy improvement and loss function value reduction of the proposed design are demonstrated via simulation.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"33 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":"115832946","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
An EPEC Analysis among Mobile Edge Caching, Content Delivery Network and Data Center 移动边缘缓存、内容传递网络和数据中心的EPEC分析
2020 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2020-05-01 DOI: 10.1109/WCNC45663.2020.9120613
Yue Yu, Xiao Tang, Yiyong Zha, Yunfei Zhang, Tiecheng Song, Zhu Han
{"title":"An EPEC Analysis among Mobile Edge Caching, Content Delivery Network and Data Center","authors":"Yue Yu, Xiao Tang, Yiyong Zha, Yunfei Zhang, Tiecheng Song, Zhu Han","doi":"10.1109/WCNC45663.2020.9120613","DOIUrl":"https://doi.org/10.1109/WCNC45663.2020.9120613","url":null,"abstract":"Mobile edge caching (MEC), content delivery network (CDN) and data center (DC) serve Internet content providers (ICPs) with different advantages and disadvantages. In this paper, we propose an equilibrium problem with equilibrium constraints (EPEC) to investigate the delivery strategies for files and pricing mechanisms for MEC, CDN, and DC. At the upper level, MEC and CDN predict the files’ rational delivery strategies and set the delivery price for each byte to provide the content delivery service. DC serves as origin servers to provide free content delivery service. At the lower level, the files observe the price strategy and determine their delivery strategies. In the proposed EPEC problem, there exist Nash equilibriums, which are coupled with each other, at both the upper level and lower level. We adopt a block coordinate descent (BCD) method to find the equilibrium solutions at both the upper level and lower level. Simulation results show that our proposed approach yields high utilities at the equilibrium.","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":"131968048","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
首页 上一页 下一页 尾页
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学术官方微信