Pub Date : 2022-09-27DOI: 10.1109/ISCIT55906.2022.9931282
Lei Liu, Chenyun Shi, Xiao-pei Wu
Electroencephalogram (EEG), a non-invasive method of brain signal acquisition, is an important part of the research of motor-imagery brain-computer interface (MI-BCI). However, the collected EEG dataset are often contaminated by various kinds of noise and artifacts. Furthermore, noisy labeled samples are often generated due to fatigue and distraction of subject in data acquisition. These low-quality samples will deteriorate the performance of MI - BCI. Therefore, the data cleaning technique is needed in EEG-based BCI research. In this paper, the feasibility and performance of confident learning (CL) for detecting low-quality samples in motor imagery EEG (MI-EEG) data was studied. We found that the CL method, while very effective in image data cleaning, is not suitable for EEG processing due to the impact of artifacts in MI-EEG data. So, we proposed to use the simplified infomax (slnfomax) independent component analysis (ICA) as the preprocessing step to improve the signal to noise ratio (SNR) of MI-EEG. The experimental results on benchmark MI-EEG datasets via convolutional neural network (CNN) demonstrated that, compared with CL only, the combination of sInfomax and CL can achieve more reliable results in low-quality MI-EEG data selection.
{"title":"Low Quality Samples Detection in Motor Imagery EEG Data by Combining Independent Component Analysis and Confident Learning","authors":"Lei Liu, Chenyun Shi, Xiao-pei Wu","doi":"10.1109/ISCIT55906.2022.9931282","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931282","url":null,"abstract":"Electroencephalogram (EEG), a non-invasive method of brain signal acquisition, is an important part of the research of motor-imagery brain-computer interface (MI-BCI). However, the collected EEG dataset are often contaminated by various kinds of noise and artifacts. Furthermore, noisy labeled samples are often generated due to fatigue and distraction of subject in data acquisition. These low-quality samples will deteriorate the performance of MI - BCI. Therefore, the data cleaning technique is needed in EEG-based BCI research. In this paper, the feasibility and performance of confident learning (CL) for detecting low-quality samples in motor imagery EEG (MI-EEG) data was studied. We found that the CL method, while very effective in image data cleaning, is not suitable for EEG processing due to the impact of artifacts in MI-EEG data. So, we proposed to use the simplified infomax (slnfomax) independent component analysis (ICA) as the preprocessing step to improve the signal to noise ratio (SNR) of MI-EEG. The experimental results on benchmark MI-EEG datasets via convolutional neural network (CNN) demonstrated that, compared with CL only, the combination of sInfomax and CL can achieve more reliable results in low-quality MI-EEG data selection.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114825866","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 issue of the relative positioning of unmanned aerial vehicles (UAVs) within formation in a GPS-suppressed environment, we propose a relative positioning method based on monocular vision. Firstly, such a method is used to identify UAVs online by a detection model and calculate their actual positions by only using visual information without auxiliary tags or other sensor information. Secondly, we improve the detection speed of this model by pruning redundant channels to meet the requirements of real-time detection when it is transplanted to the onboard computer with limited computing power. To adapt to this relative positioning method, we redesign an autonomous tracking controller with visual information as inputs. Finally, simulation experiments are carried out to verify the feasibility of the proposed method.
{"title":"Monocular-Vision-Based Positioning Method for UAV Formation","authors":"Yiming Jia, Jinglei Li, Shuai Zhang, Qinghai Yang, Wenqiang Gao, K. Kwak","doi":"10.1109/ISCIT55906.2022.9931313","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931313","url":null,"abstract":"Aiming at the issue of the relative positioning of unmanned aerial vehicles (UAVs) within formation in a GPS-suppressed environment, we propose a relative positioning method based on monocular vision. Firstly, such a method is used to identify UAVs online by a detection model and calculate their actual positions by only using visual information without auxiliary tags or other sensor information. Secondly, we improve the detection speed of this model by pruning redundant channels to meet the requirements of real-time detection when it is transplanted to the onboard computer with limited computing power. To adapt to this relative positioning method, we redesign an autonomous tracking controller with visual information as inputs. Finally, simulation experiments are carried out to verify the feasibility of the proposed method.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117249909","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-09-27DOI: 10.1109/ISCIT55906.2022.9931284
Tianci Zhao, Changwen Zheng, Qingmeng Zhu, Hao He
With the great popularity of Transformers, there has been many works using Transformers to explore the temporal association properties of objects between different video frames. However, due to the large-scale variation of visual entities and the high resolution of pixels in images, the original Transformers take so long time for both training and inference. Based on Swin Transformer, we propose SwinTransTrack, a novel shift-window encoder and decoder model. Different from the original model, we fuse low-rank adaptation to achieve feature dimension enhancement and propose a new shifted-window decoder network to obtain accurate displacement to associate trajectories. Finally, We conducted extensive quantitative experiments on different MOT datasets, MOT17 and MOT20. The experimental results show that SwinTransTrack achieves 75.5 MOTA on MOT17 and 67.5 MOTA on MOT20, leading both MOT competitions.
{"title":"SwinTransTrack: Multi-object Tracking Using Shifted Window Transformers","authors":"Tianci Zhao, Changwen Zheng, Qingmeng Zhu, Hao He","doi":"10.1109/ISCIT55906.2022.9931284","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931284","url":null,"abstract":"With the great popularity of Transformers, there has been many works using Transformers to explore the temporal association properties of objects between different video frames. However, due to the large-scale variation of visual entities and the high resolution of pixels in images, the original Transformers take so long time for both training and inference. Based on Swin Transformer, we propose SwinTransTrack, a novel shift-window encoder and decoder model. Different from the original model, we fuse low-rank adaptation to achieve feature dimension enhancement and propose a new shifted-window decoder network to obtain accurate displacement to associate trajectories. Finally, We conducted extensive quantitative experiments on different MOT datasets, MOT17 and MOT20. The experimental results show that SwinTransTrack achieves 75.5 MOTA on MOT17 and 67.5 MOTA on MOT20, leading both MOT competitions.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125532676","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-09-27DOI: 10.1109/ISCIT55906.2022.9931228
Adam Dziomdziora, D. Taibi
A sedentary lifestyle and lack of sports favor the occurrence of many civilization diseases. To address the problem, the UN set 17 Sustainable Development Goals to be achieved glob-ally by 2030. They assume an enduring improvement in the life quality of present and future generations. One of the UN objects is “Goal 3: Good health and well-being”, focusing on ensuring a healthy life for all people and promoting well-being. An active lifestyle improves health by reducing the number and frequency of illnesses. This paper aims to develop an Artificial Intelligence (AI) system to provide training recommendations and evaluate decision-making algorithms for running pace adjustment and training distance fitting based on fuzzy logic. The data collected from running sessions enabled the construction of an AI system based on the data from the sports watch and personal feelings from the athlete regarding his emotions during each kilometer of the run. Comparing the system indications with information from the user due to fuzzy inference allowed a runner to increase endurance. Hence, using the provided recommendations, training can be intensified and training sensations - maintained.
{"title":"Running Pace Adjustment and Training Distance Fitting with Fuzzy Logic and Machine Learning","authors":"Adam Dziomdziora, D. Taibi","doi":"10.1109/ISCIT55906.2022.9931228","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931228","url":null,"abstract":"A sedentary lifestyle and lack of sports favor the occurrence of many civilization diseases. To address the problem, the UN set 17 Sustainable Development Goals to be achieved glob-ally by 2030. They assume an enduring improvement in the life quality of present and future generations. One of the UN objects is “Goal 3: Good health and well-being”, focusing on ensuring a healthy life for all people and promoting well-being. An active lifestyle improves health by reducing the number and frequency of illnesses. This paper aims to develop an Artificial Intelligence (AI) system to provide training recommendations and evaluate decision-making algorithms for running pace adjustment and training distance fitting based on fuzzy logic. The data collected from running sessions enabled the construction of an AI system based on the data from the sports watch and personal feelings from the athlete regarding his emotions during each kilometer of the run. Comparing the system indications with information from the user due to fuzzy inference allowed a runner to increase endurance. Hence, using the provided recommendations, training can be intensified and training sensations - maintained.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114550356","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-09-27DOI: 10.1109/ISCIT55906.2022.9931190
Junhua Duan, Yucheng Huang, Zhu Yi-an, Dong Zhong
In recent years, with the rapid growth of knowledge graphs, knowledge reasoning technology is in great demand for research. The knowledge graph is a heterogeneous network with a graph structure. Graph Convolutional Network (GCN) is an extension of traditional Convolutional Neural Network (CNN) in non-Euclidean space, very suitable for processing complex graph data. In this paper, a attention-based relational graph convolutional network (AR-GCN) is proposed. When aggregating neighbor information, the weight of neighbor nodes is adaptively assigned through the attention mechanism, so that nodes can focus on different neighbor information and enhance the accuracy of feature representation. According to the topological characteristics of different knowledge graphs, two attention mechanisms are proposed. The experimental results show that AR-GCN outperforms R-GCN in entity classification and link prediction tasks, further showing that it has stronger characterization ability.
{"title":"Attention-Based Relational Graph Convolutional Network for Knowledge Graph Reasoning","authors":"Junhua Duan, Yucheng Huang, Zhu Yi-an, Dong Zhong","doi":"10.1109/ISCIT55906.2022.9931190","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931190","url":null,"abstract":"In recent years, with the rapid growth of knowledge graphs, knowledge reasoning technology is in great demand for research. The knowledge graph is a heterogeneous network with a graph structure. Graph Convolutional Network (GCN) is an extension of traditional Convolutional Neural Network (CNN) in non-Euclidean space, very suitable for processing complex graph data. In this paper, a attention-based relational graph convolutional network (AR-GCN) is proposed. When aggregating neighbor information, the weight of neighbor nodes is adaptively assigned through the attention mechanism, so that nodes can focus on different neighbor information and enhance the accuracy of feature representation. According to the topological characteristics of different knowledge graphs, two attention mechanisms are proposed. The experimental results show that AR-GCN outperforms R-GCN in entity classification and link prediction tasks, further showing that it has stronger characterization ability.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124219818","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-09-27DOI: 10.1109/ISCIT55906.2022.9931267
Liuqiaoyu Mo, Xiaofang Deng, Miao Ye, Lin Zheng, Hongmei Zhang
Nowadays, location data sharing has become an important way for people to share their lives and exchange for location-based services. The release of location data maximizes the value of the data, but also leads to personal privacy leakage. Existing research work on differential privacy-based data publish scheme use a grouping mechanism to improve the utility of release data. However, it requires more pre-defined parameters, besides, its data protection process does not adequately consider data variation characteristics. In this paper, we propose a location data continuous release privacy protection framework, called LDCR, which provides $w$ -event privacy protection for the release of location aggregated data. We define data change rate, which captures the data trends utilizing the change in the tilt angle of the data slope at adjacent moments. Meanwhile, we design a grouping mechanism based on data change rate to reduce the number of pre-defined parameters, and a privacy budget allocation mechanism that adapt to data changes to improve the rationality of privacy budget application. Experimental results show that our proposed mechanism can provide privacy protection for the continuous release of location data while ensuring data utility.
{"title":"Continuous Release of Location Data Based on Differential Privacy","authors":"Liuqiaoyu Mo, Xiaofang Deng, Miao Ye, Lin Zheng, Hongmei Zhang","doi":"10.1109/ISCIT55906.2022.9931267","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931267","url":null,"abstract":"Nowadays, location data sharing has become an important way for people to share their lives and exchange for location-based services. The release of location data maximizes the value of the data, but also leads to personal privacy leakage. Existing research work on differential privacy-based data publish scheme use a grouping mechanism to improve the utility of release data. However, it requires more pre-defined parameters, besides, its data protection process does not adequately consider data variation characteristics. In this paper, we propose a location data continuous release privacy protection framework, called LDCR, which provides $w$ -event privacy protection for the release of location aggregated data. We define data change rate, which captures the data trends utilizing the change in the tilt angle of the data slope at adjacent moments. Meanwhile, we design a grouping mechanism based on data change rate to reduce the number of pre-defined parameters, and a privacy budget allocation mechanism that adapt to data changes to improve the rationality of privacy budget application. Experimental results show that our proposed mechanism can provide privacy protection for the continuous release of location data while ensuring data utility.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117057542","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-09-27DOI: 10.1109/ISCIT55906.2022.9931298
Baohao Chen, Lin Tian, Yifeng Zhu, Renxin Li, Zhenghui Ru, Ruoyan Ma
This article presents a new circular-polarized transmitting antenna for a simultaneous wireless information and power transfer (SWIPT) system with polarization separation. Compared to the traditional power and information separation approaches in SWIPT, the polarization separation is more practical and flexible. Based on this separation architecture, we design a novel circular-polarized (CP) antenna in the transmitting part of the system. The antenna has the wideband operation range. The final design of the antenna has an overall size of 35. 5mm x 35.5mm x 34.7mm. In addition, the impedance bandwidth and axial ratio (AR) bandwidth are 51 %(2.09-3.51 GHz) and 53%(2.39-4.14GHz). Over the operating band, the antenna obtains stable gains for around 8dBi. The antenna is able to satisfy the demands of information and power transfer simultaneously.
本文提出了一种新型的圆极化发射天线，用于具有极化分离的同时无线信息与电力传输系统。与SWIPT中传统的功率和信息分离方法相比，极化分离更具实用性和灵活性。基于这种分离结构，我们在系统发射部分设计了一种新型圆极化(CP)天线。该天线具有宽带工作范围。天线的最终设计总体尺寸为35。5mm x 35.5mm x 34.7mm。阻抗带宽为51% (2.09 ~ 3.51 GHz)，轴比带宽为53%(2.39 ~ 4.14GHz)。在工作频带上，天线获得约8dBi的稳定增益。该天线能够同时满足信息传输和功率传输的要求。
{"title":"A Novel Circular-Polarized Antenna for SWIPT System with Polarization Separation","authors":"Baohao Chen, Lin Tian, Yifeng Zhu, Renxin Li, Zhenghui Ru, Ruoyan Ma","doi":"10.1109/ISCIT55906.2022.9931298","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931298","url":null,"abstract":"This article presents a new circular-polarized transmitting antenna for a simultaneous wireless information and power transfer (SWIPT) system with polarization separation. Compared to the traditional power and information separation approaches in SWIPT, the polarization separation is more practical and flexible. Based on this separation architecture, we design a novel circular-polarized (CP) antenna in the transmitting part of the system. The antenna has the wideband operation range. The final design of the antenna has an overall size of 35. 5mm x 35.5mm x 34.7mm. In addition, the impedance bandwidth and axial ratio (AR) bandwidth are 51 %(2.09-3.51 GHz) and 53%(2.39-4.14GHz). Over the operating band, the antenna obtains stable gains for around 8dBi. The antenna is able to satisfy the demands of information and power transfer simultaneously.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129347649","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-09-27DOI: 10.1109/ISCIT55906.2022.9931232
Zongshuai Zhang, Lin Tian, Qian Sun, Ni Hui, Jiaying Huang
Compared with the traditional distributed radio access network (D-RAN), the processing resources utilization of the centralized radio access network (C-RAN) can be improved due to the sharing of processing resources, achieving the statistical multiplexing gain (SMG). In this paper, we focus on analyzing the SMG and the factors that impact the SMG, which could provide guidance for the 5G/6G system design. Firstly, considering that the configuration of radio resources has impact on the utilization of processing resources for practical C-RAN, the SMG model based on processing resources utilization is established and the constraint of radio resources is introduced into our model. Then, the specific expression of the SMG is derived based on the temporal-spatial distribution of data traffic. The impacts of traffic fluctuation and radio resources configuration on the SMG are analyzed. Both analysis and simulation results show that the SMG increases as the spatial fluctuation of traffic increases, but the rate of growth will slow down due to the limitation of radio resources. Moreover, we find that the improvement of channel quality or the increase in the number of radio resources configuration will bring a higher SMG. Finally, the SMGs of the target areas are estimated based on the practical traffic distribution data.
{"title":"Statistical Multiplexing Gain Analysis Based on Resource Utilization for Practical C-RAN","authors":"Zongshuai Zhang, Lin Tian, Qian Sun, Ni Hui, Jiaying Huang","doi":"10.1109/ISCIT55906.2022.9931232","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931232","url":null,"abstract":"Compared with the traditional distributed radio access network (D-RAN), the processing resources utilization of the centralized radio access network (C-RAN) can be improved due to the sharing of processing resources, achieving the statistical multiplexing gain (SMG). In this paper, we focus on analyzing the SMG and the factors that impact the SMG, which could provide guidance for the 5G/6G system design. Firstly, considering that the configuration of radio resources has impact on the utilization of processing resources for practical C-RAN, the SMG model based on processing resources utilization is established and the constraint of radio resources is introduced into our model. Then, the specific expression of the SMG is derived based on the temporal-spatial distribution of data traffic. The impacts of traffic fluctuation and radio resources configuration on the SMG are analyzed. Both analysis and simulation results show that the SMG increases as the spatial fluctuation of traffic increases, but the rate of growth will slow down due to the limitation of radio resources. Moreover, we find that the improvement of channel quality or the increase in the number of radio resources configuration will bring a higher SMG. Finally, the SMGs of the target areas are estimated based on the practical traffic distribution data.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127110054","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-09-27DOI: 10.1109/ISCIT55906.2022.9931198
Xu Zhang, Pan Liu, Tengfei Hui, Xiongfei Li, Jiahong Li
A Dynamic Sub carrier Allocation with Strict Service Rate Control algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system. Aiming at eliminating the service rate waste and improving the spectral efficiency in heterogeneous traffic environment, the strict service rate constraint (SSRC) algorithms is designed by directly introducing the service rate constraint into the objective functions. Furthermore, a first in first out (FIFO) queuing model is found on the cross-layer pattern with finite space. By taking the strict service rate constraint as the necessary condition for optimality, the SSRC algorithm achieved approximate average delay and loss probability performance as max-delay-utility (MDU) algorithm, significantly outperformed the traditional algorithms such as the proportional fair (PF) algorithm and the modified largest weighted delay first (MI-LWDF) algorithm with much lower service rate waste probability. Thus, the SSRC algorithm effectively eliminated the service rate waste without the scheduling performance loss.
{"title":"Dynamic Subcarrier Allocation with Strict Service Rate Control for Cross-Layer Utility Maximization in SC-FDMA System","authors":"Xu Zhang, Pan Liu, Tengfei Hui, Xiongfei Li, Jiahong Li","doi":"10.1109/ISCIT55906.2022.9931198","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931198","url":null,"abstract":"A Dynamic Sub carrier Allocation with Strict Service Rate Control algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system. Aiming at eliminating the service rate waste and improving the spectral efficiency in heterogeneous traffic environment, the strict service rate constraint (SSRC) algorithms is designed by directly introducing the service rate constraint into the objective functions. Furthermore, a first in first out (FIFO) queuing model is found on the cross-layer pattern with finite space. By taking the strict service rate constraint as the necessary condition for optimality, the SSRC algorithm achieved approximate average delay and loss probability performance as max-delay-utility (MDU) algorithm, significantly outperformed the traditional algorithms such as the proportional fair (PF) algorithm and the modified largest weighted delay first (MI-LWDF) algorithm with much lower service rate waste probability. Thus, the SSRC algorithm effectively eliminated the service rate waste without the scheduling performance loss.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131933594","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-09-27DOI: 10.1109/ISCIT55906.2022.9931201
Hong Shen, Yannan Luo, Yu Xu, Tiankui Zhang
This paper studies the completion time minimization of unmanned aerial vehicle (UAV) for content delivery in cache-enabled multi-UAV networks. Due to the limited cache space of UAV, uncached contents need to be fetched from the ground base station (GBS) via wireless backhaul, which causes additional delay to mission completion. To reduce the content delivery time, we formulate a non-convex minimization problem by optimizing cache placement, content scheduling, bandwidth allocation and UAVs' trajectories, which, however, is challenging to tackle. To handle this, the problem is decomposed into four subproblems, and we prove that the subproblem of cache placement is NP-hard for the sake of seeking the appropriate solving methods. Then block coordinate descent (BCD) and convex approximation is used to obtain a suboptimal solution to the primal problem. Numerical results show that our algorithm effectively decreases the completion time of content delivery and outperforms the benchmark schemes.
{"title":"Completion Time Minimization for Content Delivery in Cache-Enabled Multi-UAV Networks","authors":"Hong Shen, Yannan Luo, Yu Xu, Tiankui Zhang","doi":"10.1109/ISCIT55906.2022.9931201","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931201","url":null,"abstract":"This paper studies the completion time minimization of unmanned aerial vehicle (UAV) for content delivery in cache-enabled multi-UAV networks. Due to the limited cache space of UAV, uncached contents need to be fetched from the ground base station (GBS) via wireless backhaul, which causes additional delay to mission completion. To reduce the content delivery time, we formulate a non-convex minimization problem by optimizing cache placement, content scheduling, bandwidth allocation and UAVs' trajectories, which, however, is challenging to tackle. To handle this, the problem is decomposed into four subproblems, and we prove that the subproblem of cache placement is NP-hard for the sake of seeking the appropriate solving methods. Then block coordinate descent (BCD) and convex approximation is used to obtain a suboptimal solution to the primal problem. Numerical results show that our algorithm effectively decreases the completion time of content delivery and outperforms the benchmark schemes.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128222085","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
扫码关注我们
求助内容：
应助结果提醒方式：