Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10072512
P. Kong, B. Li, Yong-heng Wang, Xiao Huang, Kaibo Shi, D. Ma, Bo Ran, Jitao Huang
With the development of future mobile communication, how to provide better quality of service for latency-sensitive services by mobile edge computing (MEC) in unmanned aerial vehicle (UAV) is a hot issue. Therefore, this paper considers the cooperation of multi- UAV to establish a mobile edge computing network and proposes an optimized delay scheme under the cooperative computing of multi-UAV. In this network, two main works are done. The first work is to model the computational delay of the tasks after the block. The second work is to optimize the computational delay through the deep deterministic policy gradient (DDPG) algorithm. Finally, the simulation results showcase that the proposed scheme has high reliability from the reward function. When subtasks are transmitted and computed, optimal allocate bandwidth and computing resources can be obtained by minimizing the computing delay in the proposed scheme.
{"title":"Multi-UAV Cooperative Computational Latency Modeling and DDPG Optimization","authors":"P. Kong, B. Li, Yong-heng Wang, Xiao Huang, Kaibo Shi, D. Ma, Bo Ran, Jitao Huang","doi":"10.1109/ICCT56141.2022.10072512","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10072512","url":null,"abstract":"With the development of future mobile communication, how to provide better quality of service for latency-sensitive services by mobile edge computing (MEC) in unmanned aerial vehicle (UAV) is a hot issue. Therefore, this paper considers the cooperation of multi- UAV to establish a mobile edge computing network and proposes an optimized delay scheme under the cooperative computing of multi-UAV. In this network, two main works are done. The first work is to model the computational delay of the tasks after the block. The second work is to optimize the computational delay through the deep deterministic policy gradient (DDPG) algorithm. Finally, the simulation results showcase that the proposed scheme has high reliability from the reward function. When subtasks are transmitted and computed, optimal allocate bandwidth and computing resources can be obtained by minimizing the computing delay in the proposed scheme.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123530585","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10073263
Rui-Zhe Xu, Ruifeng Li, Da Li, Erping Li
In this paper, the pin map scenario is modeled as a parallel-plate structure for electromagnetic leakage analysis by approximating the solder balls as cylinders. The boundary field and internal field distribution under multiple radiation coupling sources with different amplitudes and phases are analyzed by the T-matrix method based on virtual PMC cylinders. Simulations show that the calculation results are accurate and much faster than those obtained by the commercial software.
{"title":"Electromagnetic Analysis in PINMAP Assignment Optimization Based on T-matrix Method","authors":"Rui-Zhe Xu, Ruifeng Li, Da Li, Erping Li","doi":"10.1109/ICCT56141.2022.10073263","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10073263","url":null,"abstract":"In this paper, the pin map scenario is modeled as a parallel-plate structure for electromagnetic leakage analysis by approximating the solder balls as cylinders. The boundary field and internal field distribution under multiple radiation coupling sources with different amplitudes and phases are analyzed by the T-matrix method based on virtual PMC cylinders. Simulations show that the calculation results are accurate and much faster than those obtained by the commercial software.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123766887","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10072684
Jun Tao, Huan-pin Chen, Xingxing She, Huamin Liu
VPN network is widely used at present, among which L2TP VPDN can better solve the problem of decentralized users accessing private networks, but users accessing through a variety of network types and multiple ISP will have higher time prices and occupy more bandwidth resources. Aiming at these drawbacks, a multi access L2TP VPDN network model named ILP is proposed, which has the characteristics of security and low cost. The simulation experiment of the new model is carried out, and the experimental results are analyzed by Waxman mathematical model, which shows that the results of the network simulation experiment are excellent. Finally, according to ILP model, the actual network is constructed, and all parameters operate normally.
{"title":"A Multi Access VPDN Network Model","authors":"Jun Tao, Huan-pin Chen, Xingxing She, Huamin Liu","doi":"10.1109/ICCT56141.2022.10072684","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10072684","url":null,"abstract":"VPN network is widely used at present, among which L2TP VPDN can better solve the problem of decentralized users accessing private networks, but users accessing through a variety of network types and multiple ISP will have higher time prices and occupy more bandwidth resources. Aiming at these drawbacks, a multi access L2TP VPDN network model named ILP is proposed, which has the characteristics of security and low cost. The simulation experiment of the new model is carried out, and the experimental results are analyzed by Waxman mathematical model, which shows that the results of the network simulation experiment are excellent. Finally, according to ILP model, the actual network is constructed, and all parameters operate normally.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124151525","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10072483
Himadri Mukherjee, M. Marciano, Ankita Dhar, K. Roy
Technology has found its way into disparate spheres of music, from production to performance. Researchers have attempted to automate multitudinous aspects in this domain. One of the interests has been towards the automated generation of music pieces itself. Bass grooves are an integral part of most music pieces. It makes a piece sound complete and bridges the gap between the percussion and melody sections. Thus, it is essential for machines to understand bass grooves for automated music analysis and production. Automatically distinguishing bass grooves is difficult and it aggravates even more for polyphonic music. In polyphonic music, the bass grooves tend to be at a lower volume and its frequency range has profound overlap with the percussion section which contributes to the complexity of identification. In this paper, a system is presented to distinguish bass grooves in the presence of drums. Experiments were performed with 7 grooves totaling 4473 clips which were modeled using MFCC-based features. The highest accuracy of 97.38% was obtained using multi-layer perceptron (MLP)-based classification.
{"title":"Feeling the Groove: Identification of Bass patterns from polyphonic audio","authors":"Himadri Mukherjee, M. Marciano, Ankita Dhar, K. Roy","doi":"10.1109/ICCT56141.2022.10072483","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10072483","url":null,"abstract":"Technology has found its way into disparate spheres of music, from production to performance. Researchers have attempted to automate multitudinous aspects in this domain. One of the interests has been towards the automated generation of music pieces itself. Bass grooves are an integral part of most music pieces. It makes a piece sound complete and bridges the gap between the percussion and melody sections. Thus, it is essential for machines to understand bass grooves for automated music analysis and production. Automatically distinguishing bass grooves is difficult and it aggravates even more for polyphonic music. In polyphonic music, the bass grooves tend to be at a lower volume and its frequency range has profound overlap with the percussion section which contributes to the complexity of identification. In this paper, a system is presented to distinguish bass grooves in the presence of drums. Experiments were performed with 7 grooves totaling 4473 clips which were modeled using MFCC-based features. The highest accuracy of 97.38% was obtained using multi-layer perceptron (MLP)-based classification.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121799875","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10073340
Wenlong Xu, Tiankui Zhang, Liwei Yang
The cooperation of multiple unmanned aerial vehicles (UAVs) is investigated to provide auxiliary computing services for ground users. First, the system cost is defined considering the energy consumption of the UAV, the energy consumption of the user, and the delay of the user at the same time. Take into account the dynamic allocation of bandwidth by the user and the dynamic allocation of computational resources by the UAV, the flight trajectory of UAVs, the offloading object and the offloading ratio of users are jointly optimized to minimize the system cost. Due to the dynamic and long-term feature of the problem, it is described as a Markov decision process. A joint computing offloading and trajectory algorithm is proposed based on the PPO in deep reinforcement learning. Simulation results show the convergence of the proposed algorithm. The proposed algorithm has superior performance compared with the benchmark algorithms.
{"title":"Joint Computing Offloading and Trajectory for Multi-UAV Enabled MEC Systems","authors":"Wenlong Xu, Tiankui Zhang, Liwei Yang","doi":"10.1109/ICCT56141.2022.10073340","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10073340","url":null,"abstract":"The cooperation of multiple unmanned aerial vehicles (UAVs) is investigated to provide auxiliary computing services for ground users. First, the system cost is defined considering the energy consumption of the UAV, the energy consumption of the user, and the delay of the user at the same time. Take into account the dynamic allocation of bandwidth by the user and the dynamic allocation of computational resources by the UAV, the flight trajectory of UAVs, the offloading object and the offloading ratio of users are jointly optimized to minimize the system cost. Due to the dynamic and long-term feature of the problem, it is described as a Markov decision process. A joint computing offloading and trajectory algorithm is proposed based on the PPO in deep reinforcement learning. Simulation results show the convergence of the proposed algorithm. The proposed algorithm has superior performance compared with the benchmark algorithms.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121907649","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10073105
Zuxiang Zheng, Dongdong Wang, Lizhe Liu, Bin Wang, Chenhua Sun
In this paper, we propose a robust random access preamble detection scheme for 5G integrated low-earth-orbit (LEO) satellite. By converting the traditional frequency domain detection to time domain detection and adjusting the starting time and interval of the time domain detection window according to the large round-trip delay differences of LEO satellite systems, this scheme can directly adopt the preamble format of terrestrial 5G, and achieve the correct preamble detection and the accurate TA (Timing Advance) estimation without relying on the navigation and positioning systems, which are used to provide necessary information for TA pre-compensation based LEO satellite preamble detection scheme. In addition, the optimal detection threshold expression, which is applicable to all preamble formats, is derived from a group of threshold coefficient curves which is acquired from the estimated value of detection threshold and noise power. Simulation results show that, compared with the TA pre-compensation LEO satellite preamble detection scheme, the proposed scheme shows 1dB performance improvement at the same detection success rate under different condition of normalized carrier frequency offset (NCFO) without the help of navigation and positioning systems.
{"title":"Robust Random Access Preamble Detection Scheme for 5G Integrated LEO Satellite Communication Systems","authors":"Zuxiang Zheng, Dongdong Wang, Lizhe Liu, Bin Wang, Chenhua Sun","doi":"10.1109/ICCT56141.2022.10073105","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10073105","url":null,"abstract":"In this paper, we propose a robust random access preamble detection scheme for 5G integrated low-earth-orbit (LEO) satellite. By converting the traditional frequency domain detection to time domain detection and adjusting the starting time and interval of the time domain detection window according to the large round-trip delay differences of LEO satellite systems, this scheme can directly adopt the preamble format of terrestrial 5G, and achieve the correct preamble detection and the accurate TA (Timing Advance) estimation without relying on the navigation and positioning systems, which are used to provide necessary information for TA pre-compensation based LEO satellite preamble detection scheme. In addition, the optimal detection threshold expression, which is applicable to all preamble formats, is derived from a group of threshold coefficient curves which is acquired from the estimated value of detection threshold and noise power. Simulation results show that, compared with the TA pre-compensation LEO satellite preamble detection scheme, the proposed scheme shows 1dB performance improvement at the same detection success rate under different condition of normalized carrier frequency offset (NCFO) without the help of navigation and positioning systems.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123736602","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10073226
Kuang Luo, Lu Ou, Chuangfeng Zhang, Ming Zhang, Jinxin Li, Shaolin Liao
Efficient Numerical Singular Integral (NSI) methods have been developed for both 1D and 2D electromagnetics problems, in both the Cartesian and polar coordinates. Through a special type of integration by parts, rigorous mathematics derivation has been performed to decompose the original singular integrals into sum of non-singular integrals that can be evaluated numerically. It can be shown that it is more convenient to evaluate the line-type singularity in the Cartesian coordinate; while it is better to evaluate the point-type singularity in the polar coordinate. Also, numerical schemes to find the order of singularity has been presented. Finally, to validate the 2D numerical singular integral methods, the electromagnetic scattering problem of a 2D reflecting ellipse antenna has been simulated through the Ping-Pong algorithm developed by the authors.
{"title":"Numerical Singular Integral Methods for Computational Electromagnetics","authors":"Kuang Luo, Lu Ou, Chuangfeng Zhang, Ming Zhang, Jinxin Li, Shaolin Liao","doi":"10.1109/ICCT56141.2022.10073226","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10073226","url":null,"abstract":"Efficient Numerical Singular Integral (NSI) methods have been developed for both 1D and 2D electromagnetics problems, in both the Cartesian and polar coordinates. Through a special type of integration by parts, rigorous mathematics derivation has been performed to decompose the original singular integrals into sum of non-singular integrals that can be evaluated numerically. It can be shown that it is more convenient to evaluate the line-type singularity in the Cartesian coordinate; while it is better to evaluate the point-type singularity in the polar coordinate. Also, numerical schemes to find the order of singularity has been presented. Finally, to validate the 2D numerical singular integral methods, the electromagnetic scattering problem of a 2D reflecting ellipse antenna has been simulated through the Ping-Pong algorithm developed by the authors.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122369247","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10073352
Zhongyi Wang, Jin Shang, Yimeng Zhang, Fengyu Wang, Wenjun Xu
Luby Transform (LT) codes are key technologies to solve multiple access in future 6G wireless networks, and performance analysis is a significant part of such multiple access schemes. In this paper, we present a low-complexity performance analysis scheme for finite-length LT codes. First, matrix model is proposed to describe LT encode and belief-propagation (BP) decoder. Then, the degree distribution change during decoding is investigated based on the matrix model and the low-complexity performance analysis scheme is proposed. Numerical results show that the proposed analysis scheme significantly outperforms other schemes with low data length and precisely predicts the error probability of LT codes under the large or small overhead with high data length.
{"title":"A Low-Complexity Analysis of Finite-Length LT Codes Based on Degree Distribution Evolution","authors":"Zhongyi Wang, Jin Shang, Yimeng Zhang, Fengyu Wang, Wenjun Xu","doi":"10.1109/ICCT56141.2022.10073352","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10073352","url":null,"abstract":"Luby Transform (LT) codes are key technologies to solve multiple access in future 6G wireless networks, and performance analysis is a significant part of such multiple access schemes. In this paper, we present a low-complexity performance analysis scheme for finite-length LT codes. First, matrix model is proposed to describe LT encode and belief-propagation (BP) decoder. Then, the degree distribution change during decoding is investigated based on the matrix model and the low-complexity performance analysis scheme is proposed. Numerical results show that the proposed analysis scheme significantly outperforms other schemes with low data length and precisely predicts the error probability of LT codes under the large or small overhead with high data length.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122614368","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10073084
Yindong Xiao, Bo Peng, Ke Liu, Zaiming Fu, Cong Hu
Digital noise signal synthesis methods have good scalability and flexibility, and can be divided into table look-up and transform methods depending on the implementation method. The accuracy of noise distribution synthesized by the look-up table method is limited by the storage depth, on the other hand, the maximum synthesis speed of the transform method is limited by the hardware computation speed. In this paper, we propose a new implementation method for digital noise signal synthesis, which divides the noise output into high probability intervals and low probability intervals by probability. The high probability interval noise generation is based on the look-up table method, and the low probability interval noise generation is based on the transformation method for real-time computation. The method is validated experimentally in terms of distribution accuracy, storage space occupation and output speed. The results show that the method has higher output accuracy than the look-up table method and faster output speed compared to the transformation method.
{"title":"A Digital Noise Signal Synthesis Method Based on a Combination of Table Look-up and Transformation","authors":"Yindong Xiao, Bo Peng, Ke Liu, Zaiming Fu, Cong Hu","doi":"10.1109/ICCT56141.2022.10073084","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10073084","url":null,"abstract":"Digital noise signal synthesis methods have good scalability and flexibility, and can be divided into table look-up and transform methods depending on the implementation method. The accuracy of noise distribution synthesized by the look-up table method is limited by the storage depth, on the other hand, the maximum synthesis speed of the transform method is limited by the hardware computation speed. In this paper, we propose a new implementation method for digital noise signal synthesis, which divides the noise output into high probability intervals and low probability intervals by probability. The high probability interval noise generation is based on the look-up table method, and the low probability interval noise generation is based on the transformation method for real-time computation. The method is validated experimentally in terms of distribution accuracy, storage space occupation and output speed. The results show that the method has higher output accuracy than the look-up table method and faster output speed compared to the transformation method.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128088614","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}
Pub Date : 2022-11-11DOI: 10.1109/ICCT56141.2022.10072739
Juncai Chen, Fan Wu, Ke Zhang, Xiaoyan Huang, S. Leng
A well-known issue in NR-V2X Mode 2 is the packet collision that results from two or more vehicles selecting the same resource block (RB) for transmission through distributed competition in the scenarios without a centralized coordinator. Consequently, it may lead to serious safety problems if the collided RB is used to send safety information by the vehicles. In this paper, we propose an intelligent reflecting surface (IRS)-assisted semi-persistent scheduling (SPS) scheme to resolve the RB conflicts by utilizing the IRS to enhance the signal reflection sent from the vehicle selected to occupy the RB. To this end, we propose a weighted sum-rate maximization model to jointly determine the vehicle selection and the IRS reflection control. In order to achieve a trade-off between the efficiency of RBs and the coordination of contending vehicles, we conceive an evaluation method to assess the transmission rate weights among the contending vehicles, which considering both wireless resource occupation and services urgency. In addition, we develop a joint conflict resolution and IRS reflection control(JCRIRC) algorithm based on DDPG to approximate the optimal solution. Simulation results verify the improvement of RB utilization and take wireless resource occupation and services urgency into account.
{"title":"IRS-Assisted Weighted Sum-Rate Maximization Semi-persistent Scheduling in NR-V2X","authors":"Juncai Chen, Fan Wu, Ke Zhang, Xiaoyan Huang, S. Leng","doi":"10.1109/ICCT56141.2022.10072739","DOIUrl":"https://doi.org/10.1109/ICCT56141.2022.10072739","url":null,"abstract":"A well-known issue in NR-V2X Mode 2 is the packet collision that results from two or more vehicles selecting the same resource block (RB) for transmission through distributed competition in the scenarios without a centralized coordinator. Consequently, it may lead to serious safety problems if the collided RB is used to send safety information by the vehicles. In this paper, we propose an intelligent reflecting surface (IRS)-assisted semi-persistent scheduling (SPS) scheme to resolve the RB conflicts by utilizing the IRS to enhance the signal reflection sent from the vehicle selected to occupy the RB. To this end, we propose a weighted sum-rate maximization model to jointly determine the vehicle selection and the IRS reflection control. In order to achieve a trade-off between the efficiency of RBs and the coordination of contending vehicles, we conceive an evaluation method to assess the transmission rate weights among the contending vehicles, which considering both wireless resource occupation and services urgency. In addition, we develop a joint conflict resolution and IRS reflection control(JCRIRC) algorithm based on DDPG to approximate the optimal solution. Simulation results verify the improvement of RB utilization and take wireless resource occupation and services urgency into account.","PeriodicalId":294057,"journal":{"name":"2022 IEEE 22nd International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129604611","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：