Shimaa A. Naser, P. Sofotasios, S. Muhaidat, M. Al-Qutayri
{"title":"Rate-Splitting Multiple Access for Indoor Visible Light Communication Networks","authors":"Shimaa A. Naser, P. Sofotasios, S. Muhaidat, M. Al-Qutayri","doi":"10.1109/WCNCW49093.2021.9419979","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9419979","url":null,"abstract":"Visible light communication (VLC) has been emerged as a technology that can increase the channel capacity in the next generations of wireless technologies by exploiting the largely unutilized, licence-free and huge visible light portion of the electromagnetic spectrum. In order to enable high-speed short-range wireless communications, VLC utilizes the installed high-switching rate light emitting diodes (LEDs) in the ceilings of indoor environments, which are primarily used for illumination, to modulate the signals into visible light intensity. However, VLC suffers from several limitations, such as the limited modulation bandwidth and the coverage area of LEDs that degrade the overall system spectral efficiency (SE). In this respect, the present contribution proposes rate splitting multiple access (RSMA) for multi-cell indoor VLC systems as a mean to enhance the overall system SE and energy efficiency (EE) as well as to provide ubiquitous indoor coverage and to address user mobility issues. Moreover, we utilize coordinated beamforming to design the precoders of the common and the private streams in each cell aiming to enhance the performance of cell-edge users. Finally, the formulated sum of the mean squared error optimization problem is solved sub-optimally using an alternating optimization approach. Extensive computer simulations demonstrate that RSMA improves the overall system performance in terms of the SE and EE compared to the recently used multiple access techniques, such as space division multiple access with coordinated beamforming which constitutes a special case of it.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128674970","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":"Privacy Preserved Secure Offloading in the Multi-access Edge Computing Network","authors":"Yang Sun, N. Li, Xiaofeng Tao","doi":"10.1109/WCNCW49093.2021.9419987","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9419987","url":null,"abstract":"Mobile edge computing (MEC) emerges recently to help process the computation-intensive and delay-sensitive applications of resource limited mobile devices in support of MEC servers. Due to the wireless offloading, MEC faces many security challenges, like eavesdropping and privacy leakage. The anti-eavesdropping offloading or privacy preserving offloading have been studied in existing researches. However, both eavesdropping and privacy leakage may happen in the meantime in practice. In this paper, we propose a privacy preserved secure offloading scheme aiming to minimize the energy consumption, where the location privacy, usage pattern privacy and secure transmission against the eavesdropper are jointly considered. We formulate this problem as a constrained Markov decision process (CMDP) with the constraints of secure offloading rate and pre-specified privacy level, and solve it with reinforcement learning (RL). It can be concluded from the simulation that this scheme can save the energy consumption as well as improve the privacy level and security of the mobile device compared with the benchmark scheme.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130998417","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}
Jianguo Yu, Yongxu Zhu, Haitao Zhao, R. Cepeda-Lopez, T. Dagiuklas, Yue Gao
{"title":"Dynamic Coverage Path Planning of Energy Optimization in UAV-enabled Edge Computing Networks","authors":"Jianguo Yu, Yongxu Zhu, Haitao Zhao, R. Cepeda-Lopez, T. Dagiuklas, Yue Gao","doi":"10.1109/WCNCW49093.2021.9419992","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9419992","url":null,"abstract":"Unmanned Aerial Vehicle (UAV)-enabled Base Stations (BS) are flexible and can effectively communicate with ground sensors distributed in the field, which is often used to solve the problem of data acquisition. However, the flight path setting and energy consumption of UAV-enabled BS are difficult to solve. In this paper, Q learning approach has been used to optimize the energy consumption of coverage path planning for UAV-enabled edge computing networks. This network is used to connect the virtual sensor data with the real UAV-enabled BS flight, so that capabilities are provided to the edges. Experiments demonstrate that the proposed algorithm is convergent, and in the same environment, reducing the energy consumption as compared with other state-of-the-art solutions in this area.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125319863","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}
Xuewan Zhang, G. Han, Dalong Zhang, B. Shim, Di Zhang
{"title":"Sparse Vector Coding-based Superimposed Transmission for Short Packet URLLC","authors":"Xuewan Zhang, G. Han, Dalong Zhang, B. Shim, Di Zhang","doi":"10.1109/WCNCW49093.2021.9420001","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9420001","url":null,"abstract":"Sparse vector coding (SVC) based on position indices is emerging as a key enabler for short packet ultra-reliable and low latency communications (URLLC), since it can achieve better block error rate (BLER) performance and lower transmission latency. In this paper, we propose a SVC-based superimposed transmission (SVC-ST) scheme to further enhance the transmission reliability of SVC. At the encoding side, a portion of transmission bits is represented by non-zero position indices of sparse vector. The remaining bits are equally split into multiple streams and then mapped into the related positions of sparse vector via quadrature amplitude modulation (QAM) with constellation rotation. After random spreading, a transmission vector superimposed by multiple QAM signals is formed on frequency resource blocks. Different from SVC scheme, the non-zero position indices and related elements of sparse vector in SVC-ST scheme are respectively represented different bit information. For the SVC-ST decoding, multipath matching pursuit (MMP)-based soft decoding (MMP-SD) scheme is adopted to recover the transmission packet. Simulation results indicate that the proposed SVC-ST scheme outperforms existing SVC schemes in terms of BLER performance.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126976447","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}
Yuwei Ren, Jiuyuan Lu, Andrian Beletchi, Yin Huang, I. Karmanov, D. Fontijne, C. Patel, Hao Xu
{"title":"Hand gesture recognition using 802.11ad mmWave sensor in the mobile device","authors":"Yuwei Ren, Jiuyuan Lu, Andrian Beletchi, Yin Huang, I. Karmanov, D. Fontijne, C. Patel, Hao Xu","doi":"10.1109/WCNCW49093.2021.9419978","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9419978","url":null,"abstract":"We explore the feasibility of AI assisted hand-gesture recognition using 802.11ad 60GHz (mmWave) technology in smartphones. Range-Doppler information (RDI) is obtained by using pulse Doppler radar for gesture recognition. We built a prototype system, where radar sensing and WLAN communication waveform can coexist by time-division duplex (TDD), to demonstrate the real-time hand-gesture inference. It can gather sensing data and predict gestures within 100 milliseconds. First, we build the pipeline for the real-time feature processing, which is robust to occasional frame drops in the data stream. RDI sequence restoration is implemented to handle the frame dropping in the continuous data stream, and also applied to data augmentation. Second, different gestures RDI are analyzed, where finger and hand motions can clearly show distinctive features. Third, five typical gestures (swipe, palm-holding, pull-push, finger-sliding and noise) are experimented with, and a classification framework is explored to segment the different gestures in the continuous gesture sequence with arbitrary inputs. We evaluate our architecture on a large multi-person dataset and report > 95% accuracy with one CNN + LSTM model. Further, a pure CNN model is developed to fit to on-device implementation, which minimizes the inference latency, power consumption and computation cost. And the accuracy of this CNN model is more than 93% with only 2.29K parameters.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114277892","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}
Jeonghun Park, Jinseok Choi, N. Lee, W. Shin, H. Poor
{"title":"Sum Spectral Efficiency Optimization for Rate Splitting in Downlink MU-MISO: A Generalized Power Iteration Approach","authors":"Jeonghun Park, Jinseok Choi, N. Lee, W. Shin, H. Poor","doi":"10.1109/WCNCW49093.2021.9420033","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9420033","url":null,"abstract":"In this paper, we consider a downlink multiple-input multiple-output (MIMO) system, where a rate splitting approach is applied to serve multiple users more efficiently. We formulate a sum spectral efficiency maximization problem with respect to precoders when noisy channel state information is available at the transmitter. Finding even a suboptimal solution is a very challenging task by its non-convexity and non-smoothness. To resolve this challenge, we first approximate the non-smooth minimum function by using a LogSumExp technique, and reformulate the problem as a form of the product of Rayleigh quotients, considering channel estimation error. Then we derive the first-order optimality condition. A key observation of the obtained condition is that it can be cast as a nonlinear eigenvector-dependent eigenvalue problem so that finding a leading eigenvector is equivalent to finding a local optimal solution. To this end, we propose an algorithm inspired by a power iteration method, referred to as a generalized power iteration for rate splitting. Simulation results show that the proposed method enhances the achievable performance when channel acquisition error exists.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123072328","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":"DOA Estimation with a Combination of Iterative MUSIC and SBL in Low SNR Conditions","authors":"Mengfan Zhou, Hui Tian, Shaoshuai Fan","doi":"10.1109/WCNCW49093.2021.9419990","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9419990","url":null,"abstract":"This paper proposes a two-stage direction-of-arrival (DOA) estimation method combining Multiple Signal Classification (MUSIC) with Sparse Bayesian Learning (SBL) algorithm. In the first stage, we take advantage of the divergence of noise power spectrum and have designed an iterative MUSIC method. Performing MUSIC iteratively, we can obtain an angle set, including all estimates of DOA. Then, we transfer the angle set to the next stage to pick the correct values out. In the second stage, the angle set acquired from the iterative MUSIC is utilized to constitute the dictionary matrix used in SBL, which can decrease the computational complexity effectively. Simulations indicate that the proposed method can achieve high estimation accuracy even when the Signal-to-Noise Ratio(SNR) is below 0dB with a DOA gap of 3 degrees, outperforming the conventional MUSIC and SBL algorithm.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"14 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127594417","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}
Zhihao Li, Yu Lin, W. Cai, Feng Ke, Ying-Po Lee, Liping Yang
{"title":"Caching Strategy Based on Data Freshness with Helpers in D2D Wireless Network","authors":"Zhihao Li, Yu Lin, W. Cai, Feng Ke, Ying-Po Lee, Liping Yang","doi":"10.1109/WCNCW49093.2021.9420016","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9420016","url":null,"abstract":"Recently, device-to-device (D2D) wireless network has become a research hotspot, which can reduce the traffic through the network. In the network, by caching popular files in the memory of end users, the users can obtain requested contents with lower energy consumption. Helper is defined as a dedicated device with large caching capacity, with helpers in a D2D wireless networks, the performance can be significantly improved. However, the data freshness has not been considered in previous works using helpers in D2D wireless network. In this paper, taking data freshness into consideration and aiming at reducing energy consumption, the access route for user content requests is formulated and a content access and updating strategy with helpers is proposed. In this strategy, a helper can improve service quality for adjacent users with low energy consumption and high data freshness. Simulation results demonstrate that our proposed strategy can reduce the system energy consumption while ensuring the content freshness.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122424253","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}
Yingyang Chen, Miaowen Wen, E. Başar, Yik-Chung Wu, Li Wang, Weiping Liu
{"title":"Network Cost Minimization for Reconfigurable Intelligent Surface aided Edge Caching","authors":"Yingyang Chen, Miaowen Wen, E. Başar, Yik-Chung Wu, Li Wang, Weiping Liu","doi":"10.1109/WCNCW49093.2021.9419999","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9419999","url":null,"abstract":"In this paper, a new RIS-aided edge caching system is proposed, where a network cost minimization problem is formulated to optimize content placement at cache units, active beamforming at base station and passive phase shifting at RIS. After decoupling the content placement with the hybrid beamforming, we propose an alternating optimization algorithm to tackle the active beamforming and passive phase shifting. For active beamforming, we transform the problem into a semidefinite programming (SDP). For passive phase shifting, we propose a block coordinate descent method and a conjugate gradient algorithm to deal with the non-convex unit-modulus constraints. Numerical results show that our RIS-aided edge caching design can effectively decrease the network cost in terms of backhaul capacity and power consumption.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129199168","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}
Srikanth Bommaraveni, S. Gautam, T. Vu, S. Chatzinotas
{"title":"On the Exploration and Exploitation Trade-off in Cooperative Caching-enabled Networks","authors":"Srikanth Bommaraveni, S. Gautam, T. Vu, S. Chatzinotas","doi":"10.1109/WCNCW49093.2021.9419984","DOIUrl":"https://doi.org/10.1109/WCNCW49093.2021.9419984","url":null,"abstract":"Edge-caching is considered as a promising solution to address network congestion and to reduce delivery latency by bringing relevant contents close to users. In this context, the commonly used notion involves the storage of the most popular contents in the cache, while consequently increasing the cache hit ratio (CHR). In the majority of prior works, the content popularity is assumed to be perfectly known and often a priori. However, in reality, the content popularity has to be explored especially for uncertain contents, such as new entrants and items with fast time-varying popularity. In this paper, we develop a framework to analyze the joint exploration and exploitation trade-off by caching both popular and uncertain contents to enable more efficient content caching. Particularly, we formulate an optimization problem to maximize the trade-off between exploration and exploitation subject to the storage capacity, guaranteed CHR and back-haul energy budget constraints. Furthermore, we solve the formulated mixed-integer combinatorial problem by using branch-and-bound method and relaxing the binary to box constraints. The superiority in performance of the proposed method over the state-of-the-art solution is demonstrated in terms of the CHR and back-haul energy on a realistic Movie-lens dataset.","PeriodicalId":262379,"journal":{"name":"2021 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336445","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}