{"title":"Green Fog Offloading Strategy for Heterogeneous Wireless Edge Networks","authors":"Yung-Lin Hsu, Hung-Yu Wei, M. Bennis","doi":"10.1109/GLOCOMW.2018.8644285","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644285","url":null,"abstract":"Multi-access/Mobile Edge Computing (MEC) and fog computing are promising techniques to satisfy low latency requirements for emerging next generation applications. Moving computation entities closer to a user could reduce the overall serving latency. In terms of green communications, given the latency constraint, how to minimize the power consumption at the user equipment (UE) and the edge node (EN) sides is important. Considering several edge nodes, partially offloading a user's task to one or more edge nodes is key. In this paper, a multi-node partial task offloading MEC scenario is discussed, in which UEs locally compute the task and share the remainder with other edge nodes. In addition, a green task distribution algorithm which minimizes the system power consumption is proposed, considering queueing, transmitting and computing delay. The simulation results show that the proposed algorithm minimizes the power consumption while meeting the latency requirements, and the power saving efficiency outperforms a binary offloading strategy. Moreover, the coupling effects between the latency requirements, offloading signal strength within the edge nodes, computation capability of edge nodes and the number of subcarriers used to transmit the offloading task are discussed.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128111800","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}
Zijun Han, X. Wen, Wei Zheng, Zhaoming Lu, Tao Lei
{"title":"Artificial Intelligence Based Handoff Management for Dense WLANs: A Deep Learning Approach","authors":"Zijun Han, X. Wen, Wei Zheng, Zhaoming Lu, Tao Lei","doi":"10.1109/GLOCOMW.2018.8644319","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644319","url":null,"abstract":"The traditional handoff management scheme in Wireless Local Area Network (WLAN) generates noticeable delays during the handoff process, resulting in discontinuity of service, which is more evident in dense WLANs. Inspired by the Software Defined Network (SDN), prior works put forward many feasible seamless handoff mechanisms to ensure the service continuity. However, when to trigger the handoff and which access point (AP) to reconnect to are still tricky problems. In this paper, we present RNN-HM, a novel handoff management scheme based on deep learning, specifically recurrent neural network (RNN). The proposed scheme enables the network to learn from the actual users' behaviors and the network status from the scratch. Centralized control over the handoff is eventually realized using SDN, setting the network free from parameter configurations. A preprocessing data representation leveraging the signal-to-interference-plus-noise ratio (SINR) is introduced to characterize the system state. Numerical results through simulation demonstrate that RNN-HM can effectively improve the data rate during the handoff process, outperforming the traditional scheme.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128113396","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":"Content Delivery in Mobility-Aware D2D Caching Networks","authors":"Badiaa Gabr, Sameh Hosny, M. Nafie","doi":"10.1109/GLOCOMW.2018.8644159","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644159","url":null,"abstract":"The massive data exchange between base stations and network backhaul creates a strong overhead on mobile networks, especially at peak times. This motivates researchers to think about the proactive caching concept which depends mainly on caching some of the expected data items during off-peak times. The caching problem consists of two distinct phases, placement phase and delivery phase. In this work, we consider a mobility-aware device-to-device (D2D) caching network. We assume that data contents were already cached in users devices during the content placement phase and we focus on the content delivery phase. The social relationships between users allows us to predict their meeting probabilities at some places. Moreover, the similarity in users interest increases the probability of finding requested data items at nearby users and hence increases the hit probability. This motivates us to study the effect of sociality and interest similarity on the content delivery. We study how to minimize users average cost by obtaining the requested data items from nearby users, via D2D communication, instead of going back to the base station. Dynamic programming is used to find an optimal content delivery policy. Due to the complexity of the optimal policy, we introduce a suboptimal algorithm and compare between them. We show, through numerical results, that the proposed algorithm has a significant performance, compared to the optimal content delivery policy, for a large enough number of time slots.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125601977","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":"Ordered Sequence Detection and Robust Design for Pulse Interval Modulation","authors":"Shuaishuai Guo, Kihong Park, Mohamed-Slim Alouini","doi":"10.1109/GLOCOMW.2018.8644163","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644163","url":null,"abstract":"This paper proposes an ordered sequence detection (OSD) for digital pulse interval modulation (DPIM) applied in optical wireless communications (OWC). To detect a packet consisting of $L$-chips, the computational complexity of OSD is of the order $mathcal{O}(Llog_{2}L)$. Moreover, this paper also proposes a robust pulse interval modulation (RPIM) scheme based on OSD. In RPIM, the last of every $K$ symbols is with more power to transmit information and simultaneously to provide a built-in barrier signal. In this way, error propagation is bounded in a slot of $K$ symbols. Together with interleaver and forward error correction (FEC) codes, the bit error rate (BER) can be greatly reduced. We derive the approximate uncoded BER performance of conventional DPIM with OSD and the newly proposed RPIM with OSD based on order statistic theory. Simulations are conducted to collaborate on theoretical analysis and show that RPIM with OSD considerably outperforms existing DPIM with optimal threshold detection in either uncoded or coded systems over various channels.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132073648","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":"Human Activity Recognition Using Deep Learning Networks with Enhanced Channel State Information","authors":"Zhenguo Shi, J. A. Zhang, R. Xu, Gengfa Fang","doi":"10.1109/GLOCOMW.2018.8644435","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644435","url":null,"abstract":"Channel State Information (CSI) is widely used for device free human activity recognition. Feature extraction remains as one of the most challenging tasks in a dynamic and complex environment. In this paper, we propose a human activity recognition scheme using Deep Learning Networks with enhanced Channel State information (DLN-eCSI). We develop a CSI feature enhancement scheme (CFES), including two modules of background reduction and correlation feature enhancement, for preprocessing the data input to the DLN. After cleaning and compressing the signals using CFES, we apply the recurrent neural networking (RNN) to automatically extract deeper features and then the softmax regression algorithm for activity classification. Extensive experiments are conducted to validate the effectiveness of the proposed scheme.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129986419","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}
Christian Brauers, R. Kays, J. Klein, Jianshuang Xu
{"title":"Modeling Differential Screen-Camera Data Transmission for Parallel Video Presentation","authors":"Christian Brauers, R. Kays, J. Klein, Jianshuang Xu","doi":"10.1109/GLOCOMW.2018.8644133","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644133","url":null,"abstract":"Optical data transmission from display to camera is a promising new communication concept, which could be a very good solution for wireless communication in different cases. It seems attractive for many conceivable scenarios to maintain the primary function of a screen – displaying a video playback – while transmitting data imperceptible for human viewers. In the DaViD (Data Transmission Using Video Devices) project, we are developing a high-rate data transmission scheme on said display-camera link. To find the optimum parameters for such a transmission, thorough knowledge of the optical channel is needed. In this paper, we introduce a model of our display-camera transmission system, focusing on the peculiarities of an optical free-space channel with display-to-camera projection. We analyze the impact of data overlay onto video content, the influence of non-optimal camera alignment and the need for display-camera synchronization. We employ this channel description in the model of our data transmission system, whose current demonstration setup achieves net data rates of over 10 Mbit/s.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130062442","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}
A. Mehbodniya, Julian Webber, K. Yano, T. Kumagai, M. Flanagan
{"title":"Gibbs Sampling Aided Throughput Improvement for Next-Generation Wi-Fi","authors":"A. Mehbodniya, Julian Webber, K. Yano, T. Kumagai, M. Flanagan","doi":"10.1109/GLOCOMW.2018.8644188","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644188","url":null,"abstract":"Wireless communications, and in particular wireless local area network (WLAN) technology, has undergone a tremendous evolution in the past decades. After the release of the WLAN standard IEEE 802.11a/b in 1999, Wi-Fi technology soon became pervasive, thanks mainly to its deployment on the unlicensed ISM band. However, high traffic, especially in hotspots and areas with dense deployment of Wi-Fi access points (APs) (e.g., stations, airports, etc.) has caused major issues and a severe degradation of communications quality. The latest WLAN standards (e.g., 802.11ac, 802.11ax) have largely succeeded in improving the link quality and data rate by adopting state-of-the-art PHY layer technologies, e.g., OFDMA, MU-MIMO. However, improvement of the MAC layer in these standards is not noticeable due to restrictions such as hardware limitation and backward compatibility issues for legacy APs. As an effort to improve the MAC layer for the next-generation WLAN standard, in this paper we propose a simple algorithm with low computational complexity for channel selection in Wi-Fi networks. The main idea is to take advantage of the potential of the IEEE 802.11ax MAC to avoid major standard modifications. For this purpose, we employ the channel utilization ratio (CUR), which is measured periodically by each AP based on its channel sensing. Time-averaged CUR values are weighted based on a Gibbs sampling approach and a probability associated to each channel is updated. Finally, a channel is selected based on the aforementioned probabilities in predefined time slots. Simulation results show that the proposed approach can improve the system throughput by up to 5% and transmission delay by up to 20%.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131466515","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":"Hierarchical Codebook and Beam Alignment for UAV Communications","authors":"Lu Yang, Wei Zhang","doi":"10.1109/GLOCOMW.2018.8644072","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644072","url":null,"abstract":"Base station (BS) to unmanned aerial vehicles (UAV) communications is an enabling technology that supports emerging UAV-related applications. In this paper, we study a hybrid beamforming technology for BS-to-UAV backhaul communications. First, we propose an efficient beam tracking scheme that is tailored for UAV system with high mobility. The proposed scheme does not require any knowledge of the moving pattern and/or trajectory of UAV, but only needs a few training overhead. Based on our proposed beam tracking scheme, the wider beamwidth requires less training overhead but results in lower beamforming gain. We then investigate this trade-off effect by optimizing the beamwidth to provide the maximum flying range for UAV. We show that in most practical scenarios, narrower beam allows larger flying range of UAV with a fixed speed, which means the maximum flying range of UAV can be achieved with the narrowest beamwidth. Simulation results are provided to validate our analysis.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132810123","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}
R. Soua, Ion Turcanu, Florian Adamsky, Detlef Führer, T. Engel
{"title":"Multi-Access Edge Computing for Vehicular Networks: A Position Paper","authors":"R. Soua, Ion Turcanu, Florian Adamsky, Detlef Führer, T. Engel","doi":"10.1109/GLOCOMW.2018.8644392","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644392","url":null,"abstract":"With the emergence of self-driving technology and the ever-increasing demand of bandwidth-hungry applications, providing the required latency, security and computational capabilities is becoming a challenging task. Although being evolving, traditional vehicular radio access technologies, namely WLAN/IEEE 802.11p and cellular networks cannot meet all the requirements of future Cooperative, Connected and Automated Mobility (CCAM). In addition, current vehicular architectures are not sufficiently flexible to support the highly heterogeneous landscape of emerging communication technologies, such as mmWave, Cellular Vehicle-to-Everything (C-V2X), and Visible Light Communication (VLC). To this aim, Multi-access Edge Computing (MEC) has been recently proposed to enhance the quality of passengers experience in delay-sensitive applications. In this paper, we discuss the in-premises features of MEC and the need of supporting technologies, such as Software Defined Networking (SDN) and Network Function Virtualization (NFV), to fulfil the requirements in terms of responsiveness, reliability and resiliency. The latter is of paramount importance for automated services, which are supposed to be always-on and always-available. We outline possible solutions for mobility-aware computation offloading, dynamic spectrum sharing, and interference mitigation. Also, by revealing MEC-inherent security vulnerabilities, we argue for the need of adequate security and privacy-preserving schemes in MEC-enabled vehicular architectures.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133679058","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":"Quantum Walks with Entangled Coins and Walkers in Superposition","authors":"S. Venegas-Andraca","doi":"10.1109/GLOCOMW.2018.8644206","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644206","url":null,"abstract":"We introduce a generalization of quantum walks with entangled coins consisting of a model of discrete quantum walks with coin pairs under various degrees of entanglement and walkers in quantum superposition as initial states. We introduce novel position probability distributions that may be used for algorithm development based on quantum-mechanical phenomena. Also, we numerically show that the skewness of position probability distribution produced by using coin initial state with various degrees of entanglement cannot be easily inferred.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132447309","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}