{"title":"The QoS Guaranteed Routing Strategy in Low Earth Orbit Satellite Constellations","authors":"Chenxi Hou, Yan Zhu","doi":"10.1109/ICCCWorkshops57813.2023.10233775","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233775","url":null,"abstract":"The low earth orbit (LEO) satellite communications play an important role in the sixth generation (6G) communications. How to achieve the quality of service (QoS) guaranteed traffic routing is always a research hotspot. However, due to the characteristics performed in the LEO satellite network, i.e., the four-link connection between the central satellite and its four adjacent satellites, connection switches caused by dynamic network topology, and different link rates between the same orbit and different orbits, the mainstream traffic routing methods will either cause the traffic congestion in the main stem, or the high computational complexity, which hinders their deployment and application in practice. To solve above problems, we propose a QoS guaranteed routing strategy, which assures the routing delay and link overhead of meeting engineering requirements. In this strategy, considering the above characteristics, we respectively propose the traffic priority division method, per hop QoS guaranteed technology and QoS guaranteed routing algorithm to guarantee differentiated traffic end-to-end QoS requirements. The simulation results show the superiority of our proposed method in terms of the lower delay, link cost, and computational complexity compared with existing literature.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127936470","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}
Xiaoxi Yu, Md. Noor-A.-Rahim, Lijun Deng, Zhaojie Yang, Y. L. Guan
{"title":"Syndrome-Based HARQ Schemes for Anytime Codes","authors":"Xiaoxi Yu, Md. Noor-A.-Rahim, Lijun Deng, Zhaojie Yang, Y. L. Guan","doi":"10.1109/ICCCWorkshops57813.2023.10233766","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233766","url":null,"abstract":"Anytime code is a new class of error-correcting code with arbitrarily long coding memory (by design) so that its decoding performance can be improved by an expanding decoding window size (i.e., decoding delay). The anytime code has been shown to help stabilize an unstable system over noisy channels. Among practical anytime codes, spatially coupled repeat-accumulate (SC-RA) anytime codes have been proven to provide outstanding asymptotic performance while offering a simple encoding process. However, in the finite block-length regime, high erasure/error floors are observed for the SC-RA anytime codes even as the decoding window size (decoding delay) is enlarged. In this paper, to alleviate the high erasure/error floors problem, novel syndrome-based hybrid automatic repeat request (HARQ) schemes are designed for the SC-RA anytime codes over the binary erasure channel (BEC) and the binary input additive white Gaussian noise (BI-AWGN) channel, respectively. Simulation results show that the proposed syndrome-based HARQ schemes offer better decoding performance and spectral efficiency than the prior-art anytime code HARQ schemes.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130689505","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}
Shaowei Zhang, Siyuan Shao, Haiming Wang, Nan Hu, Xiaodong Xu, Yan Li, Jingjing Chen
{"title":"Long Short-Term Memory Fully Convolutional Network-Based Passing-Object Detection and Its Application to WLAN Sensing","authors":"Shaowei Zhang, Siyuan Shao, Haiming Wang, Nan Hu, Xiaodong Xu, Yan Li, Jingjing Chen","doi":"10.1109/ICCCWorkshops57813.2023.10233733","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233733","url":null,"abstract":"Wireless sensing technology is the cornerstone of realizing an intelligent environment. As an application of wireless sensing, the research significance of passing-object detection has been verified. This paper proposes a sensing method for passing-object detection, in which the channel state information (CSI) is combined with long short-term memory fully convolutional network (LSTM-FCN). In the method, the CSI is firstly extracted from the multiple antennas and multiple subcarriers, and the transmission waveform is based on the frame structure of the IEEE 802.11ac protocol. Then, the principal components analysis (PCA) is applied to reduce the dimension of CSI data. At the model train stage, the LSTM-FCN is applied to train the first principal component information of CSI data. The proposed method is implemented and validated with extensive experiments in indoor corridor environments, and the verified accuracy of the model exceeds 96%.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130965871","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":"Space-Air-Ground Integrated Heterogeneous Network Slicing with Native Intelligence","authors":"Yushuang Hu, Nanxiang Shi, Lu Lu, Chutian Wang","doi":"10.1109/ICCCWorkshops57813.2023.10233779","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233779","url":null,"abstract":"This paper proposes a Space-Air-Ground integrated heterogeneous network slicing scheme with native intelligence, employing a Distributed Weighted Classification Method for network entity classification and the corresponding distributed network organization and network slicing dyeing. Instances of network slicing dyeing mechanisms in scenarios of high security, high data rate, and low latency are given. Performance evaluation shows that the proposed scheme outperforms the typical network slicing based on standardization in all three scenarios.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130060809","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":"On Disjoint Difference Sets and Their Associated QC-LDPC Codes with Large Girth","authors":"Guohua Zhang, Mengdi Ni, Yi Fang","doi":"10.1109/ICCCWorkshops57813.2023.10233824","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233824","url":null,"abstract":"The disjoint difference set (DDS) has been utilized in recent years to construct quasi-cyclic (QC) low-density parity-check (LDPC) codes without small cycles. However, the existing DDS-based QC-LDPC codes have no all-zero circulants, which limits the decoding performance of such codes to some extent. In this paper, two new types of DDS-based QC-LDPC codes are proposed, which contain all-zero circulants and possess girth at least eight and girth at least ten, respectively. Numerical simulations show that the new codes have good performance in AWGN channels. Besides, a new result on existence for DDSs and two novel deterministic constructions for DDSs are put forward.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133735191","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":"Error-and-Erasure Decoding of Product-Like Codes With BCH and SPC Components","authors":"Mingyang Zhu, Ming Jiang, Chunming Zhao, Lijie Hu","doi":"10.1109/ICCCWorkshops57813.2023.10233816","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233816","url":null,"abstract":"We study a class of product-like codes, which is constructed by Bose-Chaudhuri-Hocquenghem (BCH) and single-parity-check (SPC) component codes. We propose a low-complexity error-and-erasure decoding (EaED) algorithm for these codes, where EaED is adopted for both BCH and SPC component codes and thus only ternary messages are exchanged between component decoders. To improve the performance, channel log-likelihood ratios are used to prevent miscorrections, which increases negligible computational complexity and decoder data flow. By properly selecting components, we can construct low-floor BCH-SPC product and staircase codes with a smaller blocklength (or decoding-window size) and a faster speed of convergence compared with the conventional product-like codes with both BCH components. Moreover, the simulation results verified that BCH-SPC product-like codes can outperform the conventional ones in some realistic cases.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125158002","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}
Jin Wang, Wei Zhao, Jing Jiang, Zexi Zeng, Feiyue Shi
{"title":"5G PRS Positioning Based on the Improved Sparrow Search Algorithm","authors":"Jin Wang, Wei Zhao, Jing Jiang, Zexi Zeng, Feiyue Shi","doi":"10.1109/ICCCWorkshops57813.2023.10233745","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233745","url":null,"abstract":"5G New Radio (NR) introduces the positioning reference signal (PRS) for acquiring measurement information such as the time or angle to facilitate downlink positioning. The time difference of arrival (TDOA) is a typical method for 5G NR positioning. In response to the low solving accuracy and slow convergence in traditional iterative or non-iterative TDOA algorithms, a 5G PRS signal positioning method based on the improved sparrow search algorithm (ISSA) is proposed in this paper. In combination with the characteristics of the 5G PRS signal, a model for downlink TDOA location is established. The initial positioning result is introduced into the ISSA algorithm to reduce the search times and optimize the fitness function. Consequently, the positioning accuracy is improved. Moreover, the ISSA algorithm is used to verify the positioning performance of the 5G PRS signal under different parameter configurations. The simulation results show that the proposed algorithm effectively reduces the positioning error.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131372992","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":"Task Offloading and Resource Allocation Method for Edge Computing in Intelligent Coal Mining","authors":"Weijun Cheng, Xiaoshi Liu, Gaofeng Nie","doi":"10.1109/ICCCWorkshops57813.2023.10233730","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233730","url":null,"abstract":"In the mining industry, the intelligentization of coal mining is the future development trend. However, the traditional centralized Internet of Things network model struggles to meet the interaction demands of intelligent devices in the context of intelligent coal mining. To address the the problem, we study the optimization strategies for underground edge computing based on the 6G network’s distributed architecture. We construct an intelligent coal mining edge computing architecture, considering the revenue maximization problem for multi-tasking with different requirements in underground scenarios. Finally, we propose a Joint Task Offloading and Resource Allocation for Revenue Maximization algorithm. Simulation experiments verify the advantages of our algorithm, including fast convergence speed and high system revenue.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114511842","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}
Fan Jiang, Guangxue He, Lei Liu, Heyu Su, Chaowei Wang
{"title":"A Task Offloading and Resource Allocation Strategy Based on Improved WSO for Internet of Vehicles","authors":"Fan Jiang, Guangxue He, Lei Liu, Heyu Su, Chaowei Wang","doi":"10.1109/ICCCWorkshops57813.2023.10233793","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233793","url":null,"abstract":"In this paper, we investigate a task offloading and resource allocation strategy concerning multi-access edge computing (MEC) servers and multi-vehicles in the Internet of Vehicles (IoV). Aiming at dealing with resource allocation issues involved with the task offloading procedure, we first formulate the task offloading problem to minimize the average cost. Next, the improved War Strategy optimization (WSO) algorithm is introduced to solve the resource allocation issue. In particular, combined with stringent delay and energy requirements, the improved WSO algorithm is employed in several iterations processes to achieve optimal offloading decisions and resource allocation policies. Simulation results further demonstrate that the proposed strategy significantly reduces the average cost and improves the task offloading efficiency in the IoV compared with benchmark schemes.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114394864","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":"Channel Estimation Based on Model-Driven Residual Networks for Zero-Padded OTFS","authors":"Xinlong Wei, Li Li, Yi Jin","doi":"10.1109/ICCCWorkshops57813.2023.10233760","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233760","url":null,"abstract":"Orthogonal time frequency space (OTFS) has been a potential option for high-mobility communication scenarios due to its strong Doppler resilience. In our previous work, considering the practical rectangular pulse shaping and fractional Doppler shifts, a novel pilot pattern for Zero-Padded OTFS channel estimation was proposed, which can significantly reduce the pilot power of the embedded pilot scheme based on compressed sensing. To further improve the accuracy of the channel estimation, this paper presents a simplified model-driven residual network (ResNet) to refine the initial results. The proposed ResNet has a smaller input size and thus, lower training complexity by leveraging the beneficial features of the delay-Doppler (DD) domain channel. Simulation results demonstrate that the proposed simplified ResNet outperforms the preliminary estimator in terms of normalized mean square error (NMSE) performance. And the former can obtain more than 5 dB and 4.5 dB gain over the latter in the embedded pilot case and our proposed pilot pattern, respectively. The results also show that the channel estimation of the proposed ResNet can improve signal detection performance.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122617415","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}