Jiangbo Si, Zihao Cheng, Lei Guan, Zan Li, Jia Shi
{"title":"Performance of Covert Surveillance in Jamming-Aided Eavesdropping System with Channel Uncertainty","authors":"Jiangbo Si, Zihao Cheng, Lei Guan, Zan Li, Jia Shi","doi":"10.1109/GCWkshps45667.2019.9024437","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024437","url":null,"abstract":"A wireless legitimate surveillance system is studied for a proactive eavesdropping scheme, where a full- duplex legitimate monitor eavesdrops a suspicious link by injecting artificial noise (AN) towards the suspicious receiver. Different from the existing work, the suspicious receiver is assumed to be capable of detecting the presence of AN. Once such receiver detects the AN, it stops transmission. Hence, to improve the surveillance performance, AN should be transmitted covertly with low detection probability by the suspicious receiver. To achieve this goal, an optimal problem is first formulated to maximize the eavesdropping rate under covert constraint. Then, according to the derived detection error probability, the optimal detection threshold is determined under Rayleigh fading channels. A novel scheme is proposed to solve the optimization problem under both perfect and imperfect channel state informations (CSIs). Finally, simulation is performed to verify the analyses. It is shown that the imperfect CSI of the suspicious link can benefit the surveillance performance.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130937845","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}
Racha Gouareb, V. Friderikos, H. Aghvami, M. Tatipamula
{"title":"Joint Reactive and Proactive SDN Controller Assignment for Load Balancing","authors":"Racha Gouareb, V. Friderikos, H. Aghvami, M. Tatipamula","doi":"10.1109/GCWkshps45667.2019.9024555","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024555","url":null,"abstract":"In Software Defined Networks (SDN), the controller is considered as a critical network element with respect to the overall operation of the network. The inherent centralized nature of the SDN controller brings sufficient flexibility to network management, but in the case of congestion episodes or failure, the whole system can be affected. In that respect, the spatiotemporal variation of the network traffic affects the network performance by increasing the response time of the control plane when it is overloaded, raising in that respect the issues of reliability and scalability. In this work, we are aiming to tackle the problem of load balancing in the control plane. The proposed approach aims to balance the load among multiple controllers by assigning switches to controllers. By considering both reactive and proactive assignment in a multi-controller setting, two costs are studied. The bi- objective function is composed of the cost of load balancing within controllers and the cost of traffic load migration. The problem of controller assignment is formulated as a Quadratic Programming, constrained by computing resources. Finally, to overcome the curse of dimensionality due to the increasing number of variables, a min-max model is presented as a mixed-integer linear programming problem minimizing the maximum load of controllers. Simulation results shed light on the trade-off between load balancing and migration cost, and the performance evaluation is demonstrating the efficiency of the proposed model compared to previously proposed algorithms in the literature.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"44 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125675149","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}
{"title":"An Evolutionary-Based Algorithm for Smart-Living Applications Placement in Fog Networks","authors":"Raheleh Moallemi, Arash Bozorgchenani, D. Tarchi","doi":"10.1109/GCWkshps45667.2019.9024660","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024660","url":null,"abstract":"Fog computing is an emerging model, complementing the cloud computing platform, introduced to support the Internet of Things (IoT) processing requests at the edge of the network. Smart-living IoT scenarios require the execution of multiple processing tasks at the edge of the network and leveraging on the Fog Computing approach results to be a worthwhile solution. Genetic Algorithms (GA) are a heuristic search and optimization class of techniques inspired by natural evolution. We propose two GA-based approaches for optimizing the processing task placement in a fog computing edge infrastructure aiming to support the Smart-living IoT nodes requests. The numerical results obtained in Matlab show that both GA-based approaches allow to maximize the covered areas while minimizing the resource wastage through the minimization of the overlapping areas.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125880428","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}
{"title":"Sequential Task Scheduling for Mobile Edge Computing Using Genetic Algorithm","authors":"A. Al-Habob, O. Dobre, A. G. Armada","doi":"10.1109/GCWkshps45667.2019.9024374","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024374","url":null,"abstract":"In this paper, we consider sequential task offloading to multiple mobile-edge computing servers to providing ultra-reliable low- latency mobile edge computing. The task consists of a set of sub-tasks, with a general dependency model among sub-tasks. Our objective is to minimize both latency and offloading failure probability by scheduling sub-tasks to servers. We formulate an optimization problem with constraints over binary scheduling decision variables. A genetic algorithm is devised to solve the formulated optimization problems. Simulation results show that the proposed algorithm provides performance close to the optimal solution, which is obtained through exhaustive search.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123076069","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}
{"title":"A Physical Layer Spoofing Attack in Spatial Modulation","authors":"Xiaohui Wang, N. Li, M. Li, Xiaofeng Tao","doi":"10.1109/GCWkshps45667.2019.9024395","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024395","url":null,"abstract":"Spoofing is a general attack in wireless communication and can cause further attacks like denial of service, node hijack and so on. Extensive studies have focused on the performance analysis under specific spoofing attack, or the countermeasures to detect and remove the spoofing attacks. Modulation based spoofing has proven to be an effective attack at the physical layer. Meanwhile, spatial modulation (SM) has high spectral efficiency and low complexity capabilities. And relay cooperation was introduced to further enhance the security of SM, under a basic assumption that all relays are trusted and fully cooperative. However, malicious relay may destroy the advantage of SM. This is the first time that the spoofing problem is studied for SM. We first model the modulation based spoofing attack particular to SM, and then derive the average spoofing- symbol-success-rate (SSSR) to describe the spoofer successfully modify the symbol. Numerical results show that the spoofing attack can badly destroy the communication.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"746 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866143","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}
{"title":"Protocols to Reduce CPS Sensor Traffic Using Smart Indexing and Edge Computing Support","authors":"N. Yazdani, D. Lucani","doi":"10.1109/GCWkshps45667.2019.9024686","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024686","url":null,"abstract":"We propose a new approach for lossless data compression to reduce the amount of data transmitted by Cyber-Physical Systems (CPS) by several-fold. Our approach uses an indexing technique inspired in the concept of generalized deduplication to compress data by a) finding matches of similar (not necessarily equal) data chunks, and b) exploiting data chunks previously stored in the Edge (or Cloud) by the same or even other CPS devices. We propose a mathematical model to predict the gains based on the number of previously received chunks and validate it using simulations. We show that compression factors of 23-fold are possible even with a limited number of previously stored chunks in the Edge. Gains of 2.8-fold over DEFLATE compression on differential samples are possible even for small data chunks (16 B) for synthetic data. Using real-world CPS data sets, we show that our technique can provide gains of up to 2.9. We also show our solution's processing speed in a Raspberry Pi 3 can be as high as 163 MB/s.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127875832","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}
{"title":"Robust Face Super-Resolution via Patch Network of Global Context Prior","authors":"Liang Chen, Yi Wu, Zheng Yang, Wen-Kang Jia","doi":"10.1109/GCWkshps45667.2019.9024453","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024453","url":null,"abstract":"The face image captured in real-world scene is the vital object in visual tasks due to its importance in person identity confirmation. However, the face structures is inherently missing due to the degradations in the imaging process, leading to the severe interference in the face enhancement and subsequent face recognition procedure. To remove the degradations and recover a recognizable face, we propose a novel global facial context prior as the guidance to face super-resolution problem. The global facial context prior expands the local structure prior, which is represented as the local patches, into global-face range by modeling the whole facial patch positions into network scheme empirically according to position distributions. The local structure in neighbored positions provides better guidance for reconstruction than the local structure itself, especially when the size of local distortion is larger than the local patch size in input image, leading to the fact that the local input image patch unable to give informative details. Therefore, the global facial context prior improves the robustness of algorithm in dealing with large-range uneven image distortion, e.g. the occlusion. The quantitative and qualitative evaluation on public database demonstrates the superiority of our algorithm.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121364897","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}
Takamasa Higuchi, Reuben Vince Rabsatt, M. Gerla, O. Altintas, F. Dressler
{"title":"Cooperative Downloading in Vehicular Heterogeneous Networks at the Edge","authors":"Takamasa Higuchi, Reuben Vince Rabsatt, M. Gerla, O. Altintas, F. Dressler","doi":"10.1109/GCWkshps45667.2019.9024655","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024655","url":null,"abstract":"Connected and automated driving vehicles are expected to generate an increasing amount of data traffic, possibly overloading vehicle-to- network (V2N) communication infrastructure in the long run. In this paper, we investigate the potential of local collaboration among vehicles to mitigate the load on V2N (e.g., cellular) communication networks. Vehicles in the vicinity use vehicle-to-vehicle (V2V) communications to form a group, called vehicular micro cloud, and each of them downloads a subset of data segments that comprise an original data content. The downloaded data segments are cached and shared with other group members by way of V2V networks. This enables the group of vehicles to collectively serve as a virtual content delivery server, which complements cloud / edge computing infrastructure. In order to maximize the benefit of cooperation, we design a light-weight local coordination mechanism for vehicles to agree on non-overlapping subsets of data segments that they request from a remote server. Our simulation results show that coordination among vehicles improves the efficiency of cooperative download, reducing the data traffic on cellular networks.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128926322","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}
Masashi Hirabe, R. Zenkyu, Hiroaki Miyamoto, K. Ikuta, E. Sasaki
{"title":"40 M Transmission of OAM Mode and Polarization Multiplexing in E-Band","authors":"Masashi Hirabe, R. Zenkyu, Hiroaki Miyamoto, K. Ikuta, E. Sasaki","doi":"10.1109/GCWkshps45667.2019.9024495","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024495","url":null,"abstract":"This paper presents the development of prototype radio equipment for orbital angular momentum (OAM) mode and polarization multiplexing transmission in E-band, as well as the results of a field trial using the prototype. The equipment consists of a radio frequency unit (RF UNIT) and a base-band unit (BB UNIT). The RF UNIT has a uniform circular array with eight elements and E-band frequency converters for each element. The BB UNIT for the transmitter has OAM mode multiplexers and digital modulators, and one of the receivers has an adaptive OAM mode de-multiplexer and digital demodulators which can operate in real-time. Sixteen multiplexing transmissions (eight OAM modes and two polarizations) over a link distance of 40 m with 256 QAM and spectral efficiency of 85.7 bps/Hz have been achieved.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393693","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}
{"title":"A Novel Indoor Coverage Measurement Scheme Based on FRFT and Gaussian Process Regression","authors":"Shaochuan Wu, Xiaokang Zhou, Yulong Gao","doi":"10.1109/GCWkshps45667.2019.9024373","DOIUrl":"https://doi.org/10.1109/GCWkshps45667.2019.9024373","url":null,"abstract":"Techniques like femtocells are widely used to extend service coverage in indoors and other areas that are unreachable for traditional radio access technologies. In this paper, we consider the indoor coverage measurement problem. We formulate this problem into two parts: the sampling and the reconstruction of received signal strength (RSS) field. Traditional methods cannot solve the RSS fluctuation problem efficiently and require a large number of sensor nodes. To this end, we propose a novel indoor coverage measurement scheme to tackle these problems. First, a fractional Fourier transform (FRFT) based method is proposed to mitigate RSS fluctuation during the sampling process. Then, Gaussian process regression (GPR) is used to reduce the number of sensor nodes being deployed. And a new kernel for GPR is designed to better accomplish the RSS reconstruction task. Simulation analysis shows the proposed scheme can achieve greater advantages in terms of accuracy and flexibility compared with other baselines.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114197080","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}