Pub Date : 2022-12-09DOI: 10.1109/ICCC56324.2022.10066046
Dai Jia, Junli Jia
In the broadcast scenario, how to use feedback chan-nel is always a hot research topic. If receivers have independent feedback channel, it will waste a lot of frequency or time slot resources. Whereas, if all receivers share the same channel to transmit feedback message, a feedback storm will occur, which causes the transmitter to be unable to confirm which receiver has successfully received the information packet. In order to make use of receivers feedback message, in this paper, we propose a novel fountain codes based on superposition feedback. By analyzing the intensity of received superposition feedback signal, the probability of information packet can be recovered by all receivers is calculated, which can be used to adjust the selection probability of information packets. Simulation results show that the proposed fountain codes in broadcast scenario can significantly reduce the overhead compared to traditional fountain codes.
{"title":"Fountain Codes with Superposition Feedback","authors":"Dai Jia, Junli Jia","doi":"10.1109/ICCC56324.2022.10066046","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10066046","url":null,"abstract":"In the broadcast scenario, how to use feedback chan-nel is always a hot research topic. If receivers have independent feedback channel, it will waste a lot of frequency or time slot resources. Whereas, if all receivers share the same channel to transmit feedback message, a feedback storm will occur, which causes the transmitter to be unable to confirm which receiver has successfully received the information packet. In order to make use of receivers feedback message, in this paper, we propose a novel fountain codes based on superposition feedback. By analyzing the intensity of received superposition feedback signal, the probability of information packet can be recovered by all receivers is calculated, which can be used to adjust the selection probability of information packets. Simulation results show that the proposed fountain codes in broadcast scenario can significantly reduce the overhead compared to traditional fountain codes.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116540748","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}
Aiming at the problem of outliers and errors in the process of point cloud plane fitting, a point cloud plane fitting method combining random sampling consensus algorithm and an improved eigenvalue algorithm is proposed. The random sampling consensus algorithm is used to eliminate outliers, and the improved robust eigenvalue algorithm is used to fit the remaining effective points and calculate the plane parameters. The experimental results show that compared with the traditional eigenvalue method, least squares method and RANSAC algorithm, this method can improve the estimation accuracy of parameters, and is more suitable for fitting point cloud data with different outliers and errors. It is an ideal plane fitting method.
{"title":"Point Cloud Plane Fitting Based on RANSAC and Robust Eigenvalue Method","authors":"Liaomo Zheng, Ruiduan Wang, Shiyu Wang, Xinjun Liu, Shipei Guo","doi":"10.1109/ICCC56324.2022.10065838","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10065838","url":null,"abstract":"Aiming at the problem of outliers and errors in the process of point cloud plane fitting, a point cloud plane fitting method combining random sampling consensus algorithm and an improved eigenvalue algorithm is proposed. The random sampling consensus algorithm is used to eliminate outliers, and the improved robust eigenvalue algorithm is used to fit the remaining effective points and calculate the plane parameters. The experimental results show that compared with the traditional eigenvalue method, least squares method and RANSAC algorithm, this method can improve the estimation accuracy of parameters, and is more suitable for fitting point cloud data with different outliers and errors. It is an ideal plane fitting method.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117080443","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-12-09DOI: 10.1109/ICCC56324.2022.10066021
Yu Shi, Xiaoliang Wang, Weikun He
The number of wind farms has increased rapidly in the past few years. Some studies have shown that wind farms interfere with weather radar and air traffic control surveillance radar. The radar echo signal of fast-rotating wind turbine blades has a wide Doppler spectrum, and the general radar clutter processing methods cannot remove wind turbine clutters with such characteristics, which interferes with the target detection performance of nearby radar equipment seriously. The study of statistical characteristics of the echo signal of wind turbines could provide basis for detection, recognition, elimination of wind turbine clutters. This paper provides statistical models of radial velocity and spectrum width for wind turbines based on Level II data of the WSR-88D weather radar. The orientation of blades' rotation plane has impact on statistical analysis result. In order to solve this problem, we employ the wind direction information to estimate the orientation of blades' rotation plane and we analysis the statistical characteristics in some particular orientation. The real data are utilized to obtain the empirical probability density function and then different probability density functions are used to fit the empirical probability density function. The K-S test and root mean square error are employed to compare the performance of different statistical models. Through the statistical analysis of four different types of wind turbine, the preferable statistical model for radial velocity and spectrum width are obtained.
{"title":"Statistical Analysis of Radial Velocity and Spectrum Width for Wind Turbines Radar Echo","authors":"Yu Shi, Xiaoliang Wang, Weikun He","doi":"10.1109/ICCC56324.2022.10066021","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10066021","url":null,"abstract":"The number of wind farms has increased rapidly in the past few years. Some studies have shown that wind farms interfere with weather radar and air traffic control surveillance radar. The radar echo signal of fast-rotating wind turbine blades has a wide Doppler spectrum, and the general radar clutter processing methods cannot remove wind turbine clutters with such characteristics, which interferes with the target detection performance of nearby radar equipment seriously. The study of statistical characteristics of the echo signal of wind turbines could provide basis for detection, recognition, elimination of wind turbine clutters. This paper provides statistical models of radial velocity and spectrum width for wind turbines based on Level II data of the WSR-88D weather radar. The orientation of blades' rotation plane has impact on statistical analysis result. In order to solve this problem, we employ the wind direction information to estimate the orientation of blades' rotation plane and we analysis the statistical characteristics in some particular orientation. The real data are utilized to obtain the empirical probability density function and then different probability density functions are used to fit the empirical probability density function. The K-S test and root mean square error are employed to compare the performance of different statistical models. Through the statistical analysis of four different types of wind turbine, the preferable statistical model for radial velocity and spectrum width are obtained.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115302923","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-12-09DOI: 10.1109/ICCC56324.2022.10065798
Jiaxin Yang, Xiaofei Li, Weiqi Zhang, T. Hu, Jun Zhang, Shuohao Li
Real-world data often exhibit a long-tailed distribution with severe class imbalance. In such cases, the majority class dominates the deep learning training, which changes the decision boundary of the minority class and reduces the classification accuracy. In this paper, we propose a novel location-based scene reconstruction(LSR) data augmentation method for long-tail recognition. This approach uses a gradient localization method to increase the scenes of tail class samples and enhance the discrimination of the model between head and tail classes, thus the accuracy of long-tail recognition is improved. Experiments on two benchmark datasets show that the LSR method achieves state-of-the-art performance on the long-tail recognition task. More importantly, our method can be easily combined with other classification methods and improves the performance of these traditional classification methods
{"title":"Location-Based Scene Reconstruction for Long-Tail Recognition","authors":"Jiaxin Yang, Xiaofei Li, Weiqi Zhang, T. Hu, Jun Zhang, Shuohao Li","doi":"10.1109/ICCC56324.2022.10065798","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10065798","url":null,"abstract":"Real-world data often exhibit a long-tailed distribution with severe class imbalance. In such cases, the majority class dominates the deep learning training, which changes the decision boundary of the minority class and reduces the classification accuracy. In this paper, we propose a novel location-based scene reconstruction(LSR) data augmentation method for long-tail recognition. This approach uses a gradient localization method to increase the scenes of tail class samples and enhance the discrimination of the model between head and tail classes, thus the accuracy of long-tail recognition is improved. Experiments on two benchmark datasets show that the LSR method achieves state-of-the-art performance on the long-tail recognition task. More importantly, our method can be easily combined with other classification methods and improves the performance of these traditional classification methods","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"17 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115472841","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-12-09DOI: 10.1109/ICCC56324.2022.10065916
Qiuping Jiang, Chenyu Zhang, Wei Zheng, X. Wen
Applying deep reinforcement learning in wireless networks has been a hot topic in the field of non-orthogonal multiple access. Most present works focus on the design of algorithms and ignore one of the practical problems when deploying them in actual networks: the computing delay, which may lead to performance deterioration. In this paper, we focus on DDPG applied in energy-constrained CR-NOMA networks with delays and propose a multi-threads scheme to assist the main agent to select action in time. We first discuss the workflow of the proposed scheme, and then restore the impaired Markovianity due to the introduction of subthreads by enhancing the state space in MRP. Test results show that the proposed scheme can significantly improve the performance of DDPG in CR-NOMA networks with delays.
{"title":"Research on Delay DRL in Energy-Constrained CR-NOMA Networks based on Multi-Threads Markov Reward Process","authors":"Qiuping Jiang, Chenyu Zhang, Wei Zheng, X. Wen","doi":"10.1109/ICCC56324.2022.10065916","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10065916","url":null,"abstract":"Applying deep reinforcement learning in wireless networks has been a hot topic in the field of non-orthogonal multiple access. Most present works focus on the design of algorithms and ignore one of the practical problems when deploying them in actual networks: the computing delay, which may lead to performance deterioration. In this paper, we focus on DDPG applied in energy-constrained CR-NOMA networks with delays and propose a multi-threads scheme to assist the main agent to select action in time. We first discuss the workflow of the proposed scheme, and then restore the impaired Markovianity due to the introduction of subthreads by enhancing the state space in MRP. Test results show that the proposed scheme can significantly improve the performance of DDPG in CR-NOMA networks with delays.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122152016","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}
The pre-coding algorithm is used to reduce channel interference in visible light communication (VLC) system in this paper. After comparing the traditional ZF, MMSE and THP precoding algorithms, it is found that the optimal anti-interference scheme of the system is THP algorithm in 4 x 4 sender and receiver systems. Based on this, the paper proposes an optimized THP algorithm, which alters the row sequence of channel matrix $H$ and controls the emitter power. Simulation results show that the bit error rate (BER) of the system under the power-based THP algorithm is between 10–5 and 10–4, which greatly improves the performance of the system.
{"title":"Sorting and Power Allocation-Based THP Precoding Algorithm in VLC System","authors":"Furong Zhu, Liwei Yang, Wencong Lai, Junning Zhang, Xue Liang, Yanling Cai","doi":"10.1109/ICCC56324.2022.10065730","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10065730","url":null,"abstract":"The pre-coding algorithm is used to reduce channel interference in visible light communication (VLC) system in this paper. After comparing the traditional ZF, MMSE and THP precoding algorithms, it is found that the optimal anti-interference scheme of the system is THP algorithm in 4 x 4 sender and receiver systems. Based on this, the paper proposes an optimized THP algorithm, which alters the row sequence of channel matrix $H$ and controls the emitter power. Simulation results show that the bit error rate (BER) of the system under the power-based THP algorithm is between 10–5 and 10–4, which greatly improves the performance of the system.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122751007","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-12-09DOI: 10.1109/ICCC56324.2022.10065873
Wentian Fan, Yingmei Chen, Qingyi Zhao, Chao Guo, En Zhu, Zhengfei Hu
This paper presents a compact 56 Gb/s 4-level pulse amplitude modulation (PAM4) SerDes receiver, which employs a half rate architecture. By employing a LC voltage control oscillator (LC-VCO) based clock and data recovery (CDR), the jitter of the receiver is greatly reduced, and the complexity and noise of the system are also decreased. The CDR is implemented in a type-II bang-bang phase-locked loop (BBPLL) topology. To reduce the locking time and improve the stability of CDR, all of the PAM4 signal transitions with the central crossover point chosen by a waveform filter are utilized to extract the phase error. The receiver is designed in a 40-nm CMOS technology and supplied with 1.1 V and the core circuit occupy an area of 0.13 mm2. The simulation results show that the proposed PAM4 receiver can work at 56 Gbit/s with 172 mW consumption.
{"title":"A 56 Gb/s Half-Rate PAM4 SerDes Receiver with LC-VCO Based CDR in 40-nm CMOS Technology","authors":"Wentian Fan, Yingmei Chen, Qingyi Zhao, Chao Guo, En Zhu, Zhengfei Hu","doi":"10.1109/ICCC56324.2022.10065873","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10065873","url":null,"abstract":"This paper presents a compact 56 Gb/s 4-level pulse amplitude modulation (PAM4) SerDes receiver, which employs a half rate architecture. By employing a LC voltage control oscillator (LC-VCO) based clock and data recovery (CDR), the jitter of the receiver is greatly reduced, and the complexity and noise of the system are also decreased. The CDR is implemented in a type-II bang-bang phase-locked loop (BBPLL) topology. To reduce the locking time and improve the stability of CDR, all of the PAM4 signal transitions with the central crossover point chosen by a waveform filter are utilized to extract the phase error. The receiver is designed in a 40-nm CMOS technology and supplied with 1.1 V and the core circuit occupy an area of 0.13 mm2. The simulation results show that the proposed PAM4 receiver can work at 56 Gbit/s with 172 mW consumption.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122855480","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-12-09DOI: 10.1109/ICCC56324.2022.10066016
Ximing Zhang, Yuanbo Wang, Hui Zhao, Xuewu Fan
In this paper, we propose a two-stages visual tracking method mainly based on two branches including image deblurring and visual tracking. Our main motivation is to achieve the robust visual tracking when the tracker is suffering fast motion blur. Firstly, we present the hierarchical model based on Spatial Pyramid Matching that performs the fine-to-coarse deblurring and exploits localized-to-coarse operations. After achieving the deblurred images, the proposed method use transformer framework with spatial and channel attention for extracting features in order to obtain the spatial and channel features simultaneously to obtain the fast visual tracking with the balance of accuracy and robustness. We first train the one-stage deblurring network in the dataset of Gopro. Then, we train the second stage visusal tracking branch. Lastly, we conduct extensive ablation studies to demonstrate the effectiveness of the proposed tracker, which obtains currently the outperforming results on large tracking benchmarks, we also validate the effectiveness of our method against the fast motion blurring.
{"title":"Seeing Clear before Visual Tracking","authors":"Ximing Zhang, Yuanbo Wang, Hui Zhao, Xuewu Fan","doi":"10.1109/ICCC56324.2022.10066016","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10066016","url":null,"abstract":"In this paper, we propose a two-stages visual tracking method mainly based on two branches including image deblurring and visual tracking. Our main motivation is to achieve the robust visual tracking when the tracker is suffering fast motion blur. Firstly, we present the hierarchical model based on Spatial Pyramid Matching that performs the fine-to-coarse deblurring and exploits localized-to-coarse operations. After achieving the deblurred images, the proposed method use transformer framework with spatial and channel attention for extracting features in order to obtain the spatial and channel features simultaneously to obtain the fast visual tracking with the balance of accuracy and robustness. We first train the one-stage deblurring network in the dataset of Gopro. Then, we train the second stage visusal tracking branch. Lastly, we conduct extensive ablation studies to demonstrate the effectiveness of the proposed tracker, which obtains currently the outperforming results on large tracking benchmarks, we also validate the effectiveness of our method against the fast motion blurring.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123907241","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-12-09DOI: 10.1109/ICCC56324.2022.10065623
F. Chen, Qianzhu Wang, Yongyi Ran
Battery pack is the core component of the low orbit (LEO) satellite energy storage system. The rapid depletion of satellite node battery energy due to overload in the network and the increase in depth of discharge (DOD) will shorten the battery life cycle and severely reduce the satellite operational life. This paper proposes a dynamic routing algorithm to maximize satellite battery life in LEO satellite networks. By building a multi-objective optimization problem aimed at maximizing the satellite battery life and minimizing the end - to-end delay and packet loss rate. Satellite network routing is considered as a Markov Decision Process (MDP), while combining deep learning with reinforcement learning to learn a routing strategy by utilizing the former's powerful perception capability and the latter's decision making capability to balance the inter-satellite battery usage and reduce the satellite battery cycle life consumption. Simulation results show that the proposed algorithm can avoid over-discharge of satellites throughout the satellite network cycle, effectively extend the satellite lifetime, and ensure low end-to-end delay and packet loss rate.
{"title":"Dynamic Routing Algorithm for Maximizing Battery Life in LEO Satellite Networks","authors":"F. Chen, Qianzhu Wang, Yongyi Ran","doi":"10.1109/ICCC56324.2022.10065623","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10065623","url":null,"abstract":"Battery pack is the core component of the low orbit (LEO) satellite energy storage system. The rapid depletion of satellite node battery energy due to overload in the network and the increase in depth of discharge (DOD) will shorten the battery life cycle and severely reduce the satellite operational life. This paper proposes a dynamic routing algorithm to maximize satellite battery life in LEO satellite networks. By building a multi-objective optimization problem aimed at maximizing the satellite battery life and minimizing the end - to-end delay and packet loss rate. Satellite network routing is considered as a Markov Decision Process (MDP), while combining deep learning with reinforcement learning to learn a routing strategy by utilizing the former's powerful perception capability and the latter's decision making capability to balance the inter-satellite battery usage and reduce the satellite battery cycle life consumption. Simulation results show that the proposed algorithm can avoid over-discharge of satellites throughout the satellite network cycle, effectively extend the satellite lifetime, and ensure low end-to-end delay and packet loss rate.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123982531","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-12-09DOI: 10.1109/ICCC56324.2022.10065617
Zhaobing Sun, Lifeng Wang, Dianxiong Liu
Large-scale Flying Ad Hoc Network (FANET) is subject to serious interference. There is internal mutual interference and external malicious interference to it. Some existing channel access methods require exchanging information between unmanned aerial vehicles (UAVs), while others consider only one type of interference. In this paper, we study the problem of distributed channel access in the FANET with limited channel resources, where internal co-channel interference and external malicious interference are considered. A non-cooperative game is designed to characterize the interaction between UAVs. We prove that the proposed game is an exact potential game, which guarantees at least one pure strategy Nash equilibrium (NE). We propose a distributed channel access algorithm based on the stochastic learning automata. By independent strategy updates, UAV s can quickly achieve global convergence under different interference scenarios. The simulation results show that the utilities are close to the best NE, demonstrating that the proposed algorithm can effectively avoid interference and fully use the limited channel resources.
{"title":"Distributed Channel Access in Flying Ad Hoc Network: A Potential Game Perspective","authors":"Zhaobing Sun, Lifeng Wang, Dianxiong Liu","doi":"10.1109/ICCC56324.2022.10065617","DOIUrl":"https://doi.org/10.1109/ICCC56324.2022.10065617","url":null,"abstract":"Large-scale Flying Ad Hoc Network (FANET) is subject to serious interference. There is internal mutual interference and external malicious interference to it. Some existing channel access methods require exchanging information between unmanned aerial vehicles (UAVs), while others consider only one type of interference. In this paper, we study the problem of distributed channel access in the FANET with limited channel resources, where internal co-channel interference and external malicious interference are considered. A non-cooperative game is designed to characterize the interaction between UAVs. We prove that the proposed game is an exact potential game, which guarantees at least one pure strategy Nash equilibrium (NE). We propose a distributed channel access algorithm based on the stochastic learning automata. By independent strategy updates, UAV s can quickly achieve global convergence under different interference scenarios. The simulation results show that the utilities are close to the best NE, demonstrating that the proposed algorithm can effectively avoid interference and fully use the limited channel resources.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125184358","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
扫码关注我们
求助内容：
应助结果提醒方式：