Ruiqi Liu, Leyi Zhang, Tianqi Mao, K. Guan, Yin Xu
{"title":"Integrated Sensing and Communication for 6G: Motivation, Enablers and Standardization","authors":"Ruiqi Liu, Leyi Zhang, Tianqi Mao, K. Guan, Yin Xu","doi":"10.1109/ICCCWorkshops57813.2023.10233791","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233791","url":null,"abstract":"Integrated sensing and communication (ISAC) has become a very popular technology as well as a usage scenario since recently. The potential advantages of doubling the spectral and energy efficiency as well as minimizing the hardware cost, at least theoretically, make ISAC a promising candidate for the 6th generation (6G) wireless networks. In this paper, we describe and analyze the motivation of adopting ISAC into future networks from a practical perspective. Key technology challenges and enablers are also introduced, followed by a standardization forecast based on the latest progress and trends in international standardization bodies.","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":"133242163","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 Communications for Wireless-Powered Full-Duplex Cooperative NOMA Systems: A User Selection and Friendly Jamming Approach","authors":"Yuan Ren, Jing Ren, Xuewei Zhang, G. Lu","doi":"10.1109/ICCCWorkshops57813.2023.10233802","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233802","url":null,"abstract":"This paper studies the secure communications of a wireless-powered full-duplex cooperative non-orthogonal multiple access (CoNOMA) system with a source node, a group of near users, a far user and an external eavesdropper. In particular, the eavesdropper intends to wiretap the transmitted signals from the source. Two of the near users are picked up, served as a wireless-powered relay and a wireless friendly jammer, respectively. We propose a user selection and cooperative jamming based secure transmission scheme. Specifically, the source transmits a superimposed signal to the selected near user. The selected near user, who is employed as a relay, can harvest energy from the radio frequency signals and decode the information simultaneously. The harvested energy are then utilized to forward the signal to the far user. The jammer also collects energy from the source, and emits artificial noise by using the harvested energy to confuse the eavesdropper. Based on the proposed scheme, the closed-form expression for secrecy outage probability (SOP) and effective secrecy throughput (EST) are derived. The correctness of our theoretical analysis is verified by Monte-Carlo simulations, and the superiority of the proposed scheme in improving the system secure performance is also validated.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"83 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":"122967593","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}
Weijia Han, Yangyingzi Zhang, Yanan Chong, Hu Wang, Zihao Li, Wei He, Xiao Ma
{"title":"Quantitative Analysis of GoP Structure for Scalable Video Coding: an Information Theory Perspective","authors":"Weijia Han, Yangyingzi Zhang, Yanan Chong, Hu Wang, Zihao Li, Wei He, Xiao Ma","doi":"10.1109/ICCCWorkshops57813.2023.10233776","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233776","url":null,"abstract":"As the demand for real-time video streaming fast rising, the scalable video coding (SVC) is widely recognized in both academic and industrial societies. In SVC, group-of-picture (GoP) structure is a base unit consisting of a sequence of frames and its structure contains a periodic relationship among them. Hence, the GoP structure not only determines the efficiency of SVC encoder, but also impacts on the video quality of a decoder output. However, the conventional representation systems could not clearly represent the GoP structure for both the encoder and decoder. Additionally, there is lack of theoretical study on the achievable performance of the encoder/decoder. To address this, this paper focuses on quantitative analysis of the GoP structure from the perspective of information theory. We propose to represent the GoP structure by introducing and extending the probabilistic graphic model which is proposed as a methodology in machine learning society. By the proposed representation system, the information compression of video is formulated for the encoder/decoder with closed-form expression. Based on this, we quantify the video information for GoP and propose a methodology to optimize the achievable performance of a given GoP in the view of information theory. The proposed representation and optimization methods are valuable to design an efficient GoP structure.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"89 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":"115911594","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":"Cooperative Vehicle Identification for Safe Connected Autonomous Driving","authors":"Zuoyin Tang, Jianhua He, Jiawei Zheng","doi":"10.1109/ICCCWorkshops57813.2023.10233781","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233781","url":null,"abstract":"5G connected autonomous vehicles (CAVs) is a key to address the challenges faced by autonomous driving with enhanced perception and cooperation on driving. To achieve reliable cooperation for safety critical CAV driving applications, an important but rarely studied issue is identifying communication vehicles of interests from sensed vehicles (ICSV). Wrong vehicle identification may cause unsafe driving decisions and lead to potential accidents. In this paper we study the ICSV problem for safe cooperative autonomous driving. We present a location based baseline method for ICSV and discuss its potential problems. Then we propose a cooperative method to improve reliability and accuracy. In the proposed method vehicle registration number (VRN) is used for vehicle identification. And multiple CAVs can cooperate on both sensing and identifying communication vehicles from their detected ones. VRNs can be hashed before sharing to protect privacy, and are compared to the shared ones for vehicle identification. Experiment results show that the approach is feasible and can have a very low false positive rate.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"629 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":"116405713","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}
Xiaodong Li, Yangfei Lin, Zhaoyang Du, Rui Yin, Celimuge Wu
{"title":"Multi-robot Cooperative Transport Simulation System","authors":"Xiaodong Li, Yangfei Lin, Zhaoyang Du, Rui Yin, Celimuge Wu","doi":"10.1109/ICCCWorkshops57813.2023.10233718","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233718","url":null,"abstract":"Multi-robot systems have gained significant attention in recent years due to their potential for collaborative handling and operations. Designing an effective simulation system for multi-robot environments is crucial for enabling research and development in this field, while minimizing risks and costs associated with real robot testing. This paper presents a Multi-Robot Collaborative Transport (MRCT) simulation system that integrates the Robot Operating System (ROSI) with the Gazebo software environment. The system employs the FastDDS communication framework for task allocation and control, enabling efficient distribution of tasks among robots. A dual-robot model is developed for collaborative handling, with two robots equipped with manipulators working together to accomplish transport tasks. The performance of the simulation system is evaluated by comparing the trajectory of transported objects with that of the dual-robot system. The results demonstrate the exceptional performance and accuracy of the MRCT system.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"75 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":"124742621","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 Low-Complexity Euclidean Distance Based BP Detection Algorithm for OTFS System","authors":"Xue Li, Qin Huang, Furong Yu, Zulin Wang","doi":"10.1109/ICCCWorkshops57813.2023.10233709","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233709","url":null,"abstract":"It is complex to detect orthogonal time frequency space (OTFS) signals in scenarios with a large number of channel paths or fractional Doppler shifts. Thus, this paper proposes an efficient belief propagation (BP) detection algorithm for OTFS signals based on Euclidean distance. Instead of involving all the combinations of input symbols, the proposed detection only considers the most reliable combination according to Euclidean distance. Simulation results show that the proposed detection algorithm achieves better bit error rate (BER) performance while requiring less computation complexity compared with the message passing (MP) algorithm.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"64 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":"124234080","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":"Online Convex Optimization for Dynamic RAN Slicing with Quality of Service","authors":"Kasra Khalafi, Jianbing Ni, N. Lu","doi":"10.1109/ICCCWorkshops57813.2023.10233710","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233710","url":null,"abstract":"With the emergence of 5G and beyond networks, simultaneous resource allocation to a diverse range of services and applications across various industries has been a trending topic. Achieving efficient resource allocation for different services and applications requires a unified abstraction of available resources, which is commonly known as Network Slicing. However, allocating resources among slices becomes a non-trivial problem due to the limited resources and unpredictable requirements of different services. In this paper, we study a dynamic RAN slicing framework incorporating multiple base stations, where workload distribution, radio spectrum and computing resource allocation decisions are made to meet diverse Quality of Service (QoS) requirements. Specifically, delay-tolerant and delay-sensitive services are considered. The unit resource allocation costs are considered to be time-varying. Furthermore, the unit resource allocation costs and QoS requirements are considered to be unknown before making workload distribution and resource allocation decisions. We propose an Online Convex Optimization (OCO) approach for the RAN slicing framework in order to minimize the overall cost and satisfy the QoS constraints in the long run. Simulation results and comparison with two baselines demonstrate that our algorithm outperforms the baselines while satisfying QoS constraints in long-term.","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":"129403529","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":"Construction of Instantly Decodable Network Codes for Semi-online Feedback Broadcast Transmission","authors":"Limin Wen, Q. T. Sun, Shaoteng Liu","doi":"10.1109/ICCCWorkshops57813.2023.10233742","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233742","url":null,"abstract":"Instantly decodable network coding (IDNC) is a class of network coding schemes with low coding complexities for wireless broadcast. Most studies of IDNC in the literature focus on the fully-online feedback mode, and Maximum Weight Vertex Search (MWVS) is an efficient algorithm to generate IDNC packets with the best-known completion delay performance. In this paper, we investigate IDNC for semi-online feedback transmission, in which the sender generates and broadcasts INDC packets round by round and collects feedback only after every round. Even though MWVS can be exploited to construct an IDNC scheme for semi-online feedback transmission, we demonstrate by an explicit example that such one may not have the optimal completion delay. We then modify MWVS so as to improve the completion delay performance of the constructed IDNC scheme. Moreover, we reveal that compared with the uncoded scheme, IDNC schemes constructed by existing fully-online feedback algorithms may not reduce the expected number of transmission rounds. We then design an efficient algorithm to construct IDNC schemes with fewer transmission rounds. Numerical analyses demonstrate an approximately 10% performance gain of the IDNC scheme constructed by our proposed algorithms over the one constructed by MWVS in terms of both completion delay and transmission rounds.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"6 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":"126969593","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":"Low Overhead Pilot Design for Channel Estimation in MIMO-OTFS Systems","authors":"Qiwei Ren, Qiyishu Li, Zhikun Xu, Zhengang Pan","doi":"10.1109/ICCCWorkshops57813.2023.10233823","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233823","url":null,"abstract":"In this paper, we study the pilot design for channel estimation in orthogonal time-frequency space based multiple-input multiple-output (MIMO-OTFS) systems. Firstly, we propose a low overhead pilot pattern, which is accurately designed according to the maximum Doppler and delay spread of the channel. Then, based on the proposed pilot pattern, the channel estimation and data detection are performed. For threshold-based channel estimation, an optimal threshold is determined by simulation. In addition, the bit error rate (BER) performance of the system is provided. It can be observed that the proposed pilot scheme can work well in both medium Doppler and high Doppler cases. The overhead of the proposed scheme is about 11% lower than that of the traditional pilot scheme, which thereby increases the data rate. Further, the impact of some key parameters on system performance is discussed. It is concluded that the performance of the channel estimation is robust to the data signal-to-noise ratio (SNR).","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"66 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":"128867633","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}
Xianghe Wang, Zezhao Meng, Xiangwang Hou, Jun Du, Ruiqi Liu, Yong Ren
{"title":"Reinforcement Learning Based Obstacle Avoidance for AUV Swarm in Dynamic Ocean Environment","authors":"Xianghe Wang, Zezhao Meng, Xiangwang Hou, Jun Du, Ruiqi Liu, Yong Ren","doi":"10.1109/ICCCWorkshops57813.2023.10233813","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233813","url":null,"abstract":"As an essential component of 6G communication, the Internet of Underwater Things (IoUT) plays a crucial role in supporting various maritime activities. Due to the IoUT devices’ wide-area distribution and constrained transmit power, autonomous underwater vehicles (AUVs) have become extensively employed for data collection in underwater environments. Ensuring the reliability of underwater tasks, the autonomous obstacle avoidance of AUV swarms has emerged as a critical research area. The Multi-Agent Deep Deterministic Policy Gradient algorithm (MADDPG), which employs centralized training and distributed execution, is an effective method to address this problem. However, current studies often overlook the complex dynamic underwater environment, including the interference caused by ocean currents on AUV movement and the observation noise of objects in the ocean. To adapt to the interference of ocean currents on AUV movement, we establish a two-dimensional motion model for AUVs. This model enables us to transform the output of MADDPG into propulsion force and steering gear control force, effectively accounting for ocean current disturbances. To tackle the observation noise of obstacles in underwater environment, we first assume the obstacle is moving in uniform linear motion, and then use the Kalman filtering algorithm to process the observed signals. Our simulation results demonstrate the superiority of our scheme.","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":"127923737","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}