Jatin Luthra, Arjun Choudhary, Abhishek Sharma, D. Jayakody
{"title":"ARUSH:Automated Runtime Universal Scanner for Hybrid Cloud computing","authors":"Jatin Luthra, Arjun Choudhary, Abhishek Sharma, D. Jayakody","doi":"10.1109/GCWkshps52748.2021.9682093","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9682093","url":null,"abstract":"With the shift of leading companies to the cloud, so comes the risk of data leaks and breaches because of many possible misconfigurations in the setup of various cloud computing environments. Though many solutions have come up, each is platform-specific, and none of them targets multiple or hybrid cloud platforms all together. This work proposes one such solution where three major public cloud platforms are supported, and the main focus is on the storage services provided by them. Since there is no such open-source solution that supports multiple cloud platforms, the program in this work is supposed to provide such a solution. Each cloud platform provides native SDK libraries for issuing API calls to the platform. These API calls aim to query the currently employed configuration for the storage services at the very least if not change. The solution can combine all the libraries into a single driver program. The program can facilitate security management of storage accounts across multiple as well hybrid cloud services and opens possibilities for automation and routine security and audit checks.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"21 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76955571","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":"Secrecy Rate Comparison of Key-based Encrypted Data Transmission and Keyless Secure Transmission","authors":"Ziyao Yu, Zijie Ji, Phee Lep Yeoh","doi":"10.1109/GCWkshps52748.2021.9682116","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9682116","url":null,"abstract":"This paper compares the secrecy rate of two general PHY security approaches of keyless secure transmission (ST) and key-based encrypted data transmission (EDT) in a multiple-input single-output, single eavesdropper (MISOSE) system. Specifically, closed-form approximations of the secrecy rate for both schemes are derived for the same coherence interval and under uncertain eavesdropper location. Our results highlight that the secrecy rate of ST is highly dependent on the propagation distance between the transmitter and the eavesdropper, whilst EDT is more impacted by the coherence interval and transmit power. Numerical simulations based on the IMT-2020 channel model are presented to support our analytical results. Our results clearly highlight different regions where ST or EDT can achieve a higher secrecy rate based on the eavesdropper location relative to the transmitter and receiver in an 11 m × 5 m area.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73741153","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":"Simultaneous Environment Sensing and Channel Knowledge Mapping for Cellular-Connected UAV","authors":"Yijia Huang, Yong Zeng","doi":"10.1109/GCWkshps52748.2021.9682178","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9682178","url":null,"abstract":"Cellular-connected unmanned aerial vehicle (UAV), as a promising application of extending cellular service from ground to low-altitude three-dimensional (3D) airspace, has received significant attention recently. However, its practical realization faces some critical challenges, such as the noncontinuous 3D cellular coverage in the sky, as well as the complex physical and radio environment when operating in urban area. In this paper, by exploiting the UAV’s highly controllable mobility, we study the UAV trajectory design problem to minimize the weighted sum of mission completion time and expected communication outage duration, while ensuring obstacle avoidance in complex environment. The formulated problem involves intractable cost function and constraint, which can not be solved by standard optimization techniques. To this end, we first study the performance upper bound based on the Dijkstra’s shortest path algorithm under the ideal assumption that the perfect physical environment information and radio channel knowledge are available. For the practical scenario in the absence of such information, a novel framework with simultaneous environment sensing and channel knowledge mapping is proposed, which aims to construct both the physical environment and radio propagation maps to facilitate the reinforcement learning based path design. Numerical results show that the proposed technique can effectively avoid the coverage holes and physical obstacles, and approaches to the performance upper bound that assumes the perfect physical and radio environment information.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"50 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73933442","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":"DigiLogue: Ultra-Fast and Ultra-Power-Efficient Signal Processing for Tbps Wireless Systems","authors":"K. Nikitopoulos, Mahmoud Mojarrad Kiasaraei","doi":"10.1109/GCWkshps52748.2021.9682067","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9682067","url":null,"abstract":"Unlocking new wireless applications such as mobile extended reality and holographic telepresence necessitates ultra-power efficient systems that are able to support data rates of hundreds of gigabits per second. Utilizing the multi-gigahertz bandwidth that is currently available in higher frequencies (e.g., millimeter-wave or terahertz) is a promising pathway in this direction. However, exploiting such ultra-wide bandwidths by using conventional transceiver processing brings us in front of significant challenges in terms of power consumption and signal processing speed. For example, the power consumption of high-precision and ultra-high-speed digital-to-analogue and analogue-to-digital converters (DAC/ADC) for ultra-wide band-widths becomes impractical. At the same time, conventional, state-of-the-art signal processing functionalities, like detection and decoding are becoming not only too power-hungry but also too complex to meet the corresponding latency requirements of ultra-fast systems. In order to overcome these challenges, we herein propose a shift towards \"DigiLogue\" transceiver processing, according to which, computationally intensive and power-hungry digital signal processing tasks take place directly in the analogue domain, avoiding traditional signal up/down-conversion and ADC/DACs, but still preserving the performance of traditional, near-optimal, digital transceiver algorithms. In this context, we give the first example of a simple to realize joint detection/decoding scheme that outperforms existing analogue-domain approaches and reaches the performance of digitally optimal solutions with power consumption that can be up to two orders of magnitude less.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"7 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82029496","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":"Delayed Bit-Interleaved Polar Coded Modulation with Superposition Gray Labeling","authors":"Xiaowei Wu, Min Qiu, Jinhong Yuan","doi":"10.1109/GCWkshps52748.2021.9682041","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9682041","url":null,"abstract":"We present a delayed bit-interleaved polar coded modulation (D-BIPCM) scheme. Particularly, we consider uniform quadrature amplitude modulation (QAM) and without iterative detection and decoding. We propose a superposition constellation labeling, which treats an M-QAM constellation as the superposition of two Gray-labeled QAM constellations of smaller sizes. The delay indices for D-BIPCM are then designed based on the proposed labeling. The labeling and delay indices joint design accelerates the polarization under a fixed codeword length and consequently improves the error performance of D-BIPCM. Both performance analysis and simulation results show that the proposed design outperforms Gray labeling QAM-based BIPCM and D-BIPCM with the delay indices optimized from the capacity’s perspective.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"14 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89740459","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}
Meiling Chen, Jing Shao, Sixu Guo, Li Su, Haitao Du
{"title":"Convoy_DTN: A Security Interaction Engine Design For Digital Twin Network","authors":"Meiling Chen, Jing Shao, Sixu Guo, Li Su, Haitao Du","doi":"10.1109/GCWkshps52748.2021.9682031","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9682031","url":null,"abstract":"A digital twin is a real-time representation of physical assets in a digital world. In future 6G networks, digital twin as the key technology will be widely used in intelligent manufacturing, smart city and scientific research etc., forwarding the whole society towards a \"digital twin\" world combining virtualization and reality. Just like the real network, the Digital Twin Network (DTN) will also face security risks and various attacks. In the DTN, the wrong instruction distribution from the twin network to physical network will directly affect the real world and cause chaos, so it is necessary to ensure the security of interaction interface. In this paper, we propose a security interaction engine named Digital Twin Protection Function (DTPF) to guarantee the confidentiality, integrity, stability and non-reputation of messages during DTN policy distribution, which can provide a reference for securing the development of DTN.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"61 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81038619","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":"Stochastic Flipping Decoding for Short Polar Codes","authors":"Yuzhou Shang, Zhaoyang Zhang","doi":"10.1109/GCWkshps52748.2021.9681994","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9681994","url":null,"abstract":"Polar codes are considered a promising candidate for URLLC. Due to the inevitable decoding delay and error propagation brought by successive cancellation (SC) based decoders, the ordered statistic decoding (OSD) algorithm, which has a parallel structure, raises much attention in polar decoding, especially for the short codelength cases. However, the OSD algorithm contains many unnecessary attempts for different error patterns (EPs), increasing the complexity and decoding delay. To address this issue, we propose a novel stochastic flipping decoding (SFD) algorithm. Instead of processing all EPs in the search space, each time, the proposed SFD decoder only processes a small set of EPs generated by stochastic flipping and then chooses the one that has the best distance to get the new reference codeword. The flipping probability vector depends on how the flip of each bit potentially affects the overall distance, and it is updated progressively towards all-zero. The complexity of the algorithm can be further reduced by eliminating all the duplicated EPs. Numerical results show that improved SFD with adequately selected parameters outperforms OSD while the search space of these two algorithms is close.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"65 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78643073","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":"Understanding Exploration and Exploitation of Q-Learning Agents in B5G Network Management","authors":"Sayantini Majumdar, R. Trivisonno, G. Carle","doi":"10.1109/GCWkshps52748.2021.9682129","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9682129","url":null,"abstract":"Auto-scaling is a lifecycle management approach that automatically scales resources (CPU, memory etc.) based on incoming load to optimize resource utilization. Centralized orchestration, although optimal, comes at the cost of high signaling overhead. Alternatively, decentralized RL-based approaches such as Q-Learning (QL) are envisaged to be more suitable for the strict latency and overhead requirements of B5G/6G use cases, while also minimizing the number of resource allocation conflicts encountered in a distributed setting. Before QL agents can take optimal auto-scaling decisions, they need to explore or evaluate their actions based on the feedback they receive from the environment. The faster they learn, the sooner they could begin to exploit their knowledge. However, it is not clear when these agents have explored long enough to start taking management actions. This paper focuses on understanding when the exploration should end such that agents may start exploiting built knowledge. In our approach, we posit that the knowledge accrued by the agents in their Q-tables should indicate whether to explore or exploit. Hence, we conceive Knowledge Indicators (KIs) derived from their Q-tables. These KIs enable agents to learn autonomously, thereby enabling adjustment of the exploration parameter epsilon in the epsilon-greedy approach. Convergence results and corresponding impact on the system performance validate the proposed approach. This work has the potential to speed up the convergence of QL agents, thereby providing critical hints to operators targeting live deployments of B5G/6G decentralized network management.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83522696","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":"Enhancing Physical Layer Security in Internet of Things via Feedback: Revisit","authors":"Haonan Yuan, Chuanchuan Yang, Bin Dai","doi":"10.1109/GCWkshps52748.2021.9681997","DOIUrl":"https://doi.org/10.1109/GCWkshps52748.2021.9681997","url":null,"abstract":"Physical layer security (PLS) in the down-link transmission of Internet of Things (IoT) systems is modeled as the compound wiretap channel (C-WTC). Recently, it has been shown that channel feedback helps to enhance the secrecy capacity of the C-WTC, where the channel feedback is used to generate secret keys protecting the transmitted message from being eavesdropped by the eavesdropper. In this paper, we show that for the Gaussian compound wiretap channel (GC-WTC), a hybrid feedback scheme that combines the existing secret-key type feedback and a variation of the classical Schalkwijk-Kailath (SK) type feedback scheme, performs better than the already existing one in the literature. The study of this paper offers a new option for the enhancement of the PLS in IoT systems.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82526970","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}