Pub Date : 2021-11-25DOI: 10.1109/icicn52636.2021.9674007
Bin Zhang, Nan Cui, Zhihao Li, C. Cao, Xiuwei Mao, Xianfeng Tang, Xiaoguang Zhang
We propose a new polarization mode dispersion (PMD) model for broadband channel optical fiber transmission system, which can reflect the statistical characteristics of time and frequency variations of PMD in the optical fiber. Then we analyze the influence of PMD on broadband channel communication system based on the proposed model.
{"title":"A New Temporal and Spectral Evolution Polarization Mode Dispersion Model in Broadband Fiber Channel","authors":"Bin Zhang, Nan Cui, Zhihao Li, C. Cao, Xiuwei Mao, Xianfeng Tang, Xiaoguang Zhang","doi":"10.1109/icicn52636.2021.9674007","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9674007","url":null,"abstract":"We propose a new polarization mode dispersion (PMD) model for broadband channel optical fiber transmission system, which can reflect the statistical characteristics of time and frequency variations of PMD in the optical fiber. Then we analyze the influence of PMD on broadband channel communication system based on the proposed model.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131364103","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}
This paper mainly focuses on the autonomous exploration of unknown environments for mobile robots with deep reinforcement learning (DRL). To accurately model the environment, an exploration graph is constructed. Then, we propose a novel S-GRU network combing graph convolutional network (GCN) and gated recurrent units (GRU) based on the exploration graph to extract hybrid features. Both the spatial information and the historical information can be extracted by using S-GRU, which could help the optimal action selection by employing DRL. Specifically, In S-GRU, one GRU is performed to extract the inner information related to the historical trajectory, and another is used to combine the current and historical inner information as the current state feature. Simulation experimental results show that our approach is better than GCN-based and information entropy-based approaches on effectiveness, accuracy, and generalization.
{"title":"Deep Reinforcement Learning Based Autonomous Exploration under Uncertainty with Hybrid Network on Graph","authors":"Zhiwen Zhang, Chenghao Shi, Zhiwen Zeng, Hui Zhang","doi":"10.1109/icicn52636.2021.9673941","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673941","url":null,"abstract":"This paper mainly focuses on the autonomous exploration of unknown environments for mobile robots with deep reinforcement learning (DRL). To accurately model the environment, an exploration graph is constructed. Then, we propose a novel S-GRU network combing graph convolutional network (GCN) and gated recurrent units (GRU) based on the exploration graph to extract hybrid features. Both the spatial information and the historical information can be extracted by using S-GRU, which could help the optimal action selection by employing DRL. Specifically, In S-GRU, one GRU is performed to extract the inner information related to the historical trajectory, and another is used to combine the current and historical inner information as the current state feature. Simulation experimental results show that our approach is better than GCN-based and information entropy-based approaches on effectiveness, accuracy, and generalization.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114089619","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 : 2021-11-25DOI: 10.1109/icicn52636.2021.9673860
Wei-hwa Chang, Fei Du, Yijing Wang
In network security, as malicious URLs increase and change, their detection has gradually become more important. The existing malicious URL detection methods lack the description of location and context semantics. This paper proposes a malicious URL based on the BERT model. The URL detection method first uses the preprocessing method to solve the problem of a large number of random characters forming words in the URL, uses special symbols as a separator to segment the URL, and then trains the BERT model to extract the short string characteristics of the URL and classify it. The experimental results show that the method’s accuracy is 98.30%, the recall rate is 95.21%, and the F1 value is 94.33%.
{"title":"Research on Malicious URL Detection Technology Based on BERT Model","authors":"Wei-hwa Chang, Fei Du, Yijing Wang","doi":"10.1109/icicn52636.2021.9673860","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673860","url":null,"abstract":"In network security, as malicious URLs increase and change, their detection has gradually become more important. The existing malicious URL detection methods lack the description of location and context semantics. This paper proposes a malicious URL based on the BERT model. The URL detection method first uses the preprocessing method to solve the problem of a large number of random characters forming words in the URL, uses special symbols as a separator to segment the URL, and then trains the BERT model to extract the short string characteristics of the URL and classify it. The experimental results show that the method’s accuracy is 98.30%, the recall rate is 95.21%, and the F1 value is 94.33%.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115879481","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 : 2021-11-25DOI: 10.1109/icicn52636.2021.9673909
B. Zheng, K. Zhuo, Huaxin Wu, Tiecheng Xie
In order to achieve the parallel transmission of multiple service types in flying ad hoc networks (FANET) with the limited wireless channel resource, and meet the requirement of high-reliability and ultra-low-delay for the highest priority service, a novel multi-priority queueing mechanism is proposed for channel threshold based multiple access (CTMA) protocol. Firstly, according to the principle of CTMA protocol, we model the mechanism as a multi-priority M/G/1 queueing system with server’s probabilistic vacations in terms of queueing theory. Then we propose two priority queueing schemes for different priority types in detail, and derive some performance metrics, such as packet’s average sojourn time, etc., for both schemes theoretically. Results are compared and verified through simulations finally. Results show that the preemptive-resume mechanism for the highest priority service in Scheme 2 gains a large improvement in the performance of the highest priority service at the expense of a little performance of other priority services.
{"title":"Multi-priority Queueing Mechanism for Channel Threshold based Multiple Access in FANETs","authors":"B. Zheng, K. Zhuo, Huaxin Wu, Tiecheng Xie","doi":"10.1109/icicn52636.2021.9673909","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673909","url":null,"abstract":"In order to achieve the parallel transmission of multiple service types in flying ad hoc networks (FANET) with the limited wireless channel resource, and meet the requirement of high-reliability and ultra-low-delay for the highest priority service, a novel multi-priority queueing mechanism is proposed for channel threshold based multiple access (CTMA) protocol. Firstly, according to the principle of CTMA protocol, we model the mechanism as a multi-priority M/G/1 queueing system with server’s probabilistic vacations in terms of queueing theory. Then we propose two priority queueing schemes for different priority types in detail, and derive some performance metrics, such as packet’s average sojourn time, etc., for both schemes theoretically. Results are compared and verified through simulations finally. Results show that the preemptive-resume mechanism for the highest priority service in Scheme 2 gains a large improvement in the performance of the highest priority service at the expense of a little performance of other priority services.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123313367","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 : 2021-11-25DOI: 10.1109/icicn52636.2021.9673832
Shuyu Wang, Huixiang Zhang, Quanjun Pei, Pengfei Wang, Xiaohui Li
As a typical internal network, the video private network carries various video image resources and involves a large amount of citizen privacy. To prevent potential internal security threats, it is necessary to carry out continuous identity authentication for operators in the video private network. In this paper, a continuous authentication system based on keystroke and mouse dynamics is proposed. The keystroke and mouse operations of users are collected to extract their operating behavior characteristics. An artificial neural network model for each user is constructed for identity authentication. To achieve continuous identity authentication, a novel trust model is present to evaluate users’ identities dynamically. The experimental results show that the proposed method can identify impostors after an average of 115 actions and classify genuine users as impostors only after an average of more than 1,000 actions.
{"title":"Continuous Authentication Based on Keystroke and Mouse Dynamics in Video Private Network","authors":"Shuyu Wang, Huixiang Zhang, Quanjun Pei, Pengfei Wang, Xiaohui Li","doi":"10.1109/icicn52636.2021.9673832","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673832","url":null,"abstract":"As a typical internal network, the video private network carries various video image resources and involves a large amount of citizen privacy. To prevent potential internal security threats, it is necessary to carry out continuous identity authentication for operators in the video private network. In this paper, a continuous authentication system based on keystroke and mouse dynamics is proposed. The keystroke and mouse operations of users are collected to extract their operating behavior characteristics. An artificial neural network model for each user is constructed for identity authentication. To achieve continuous identity authentication, a novel trust model is present to evaluate users’ identities dynamically. The experimental results show that the proposed method can identify impostors after an average of 115 actions and classify genuine users as impostors only after an average of more than 1,000 actions.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124887050","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 : 2021-11-25DOI: 10.1109/icicn52636.2021.9673829
Chaoyang Wang, Feng Yan
Terahertz (THz) communication is considered to be a promising technology in B5G communication systems. Efficient resource allocation algorithms play an important role in THz communication systems. In this paper, a graph theory based resource allocation algorithm is proposed for THz communication networks. The resource allocation is formulated into an optimization problem, which is a Mixed-Integer Nonlinear Programming (MINLP) problem. We thus divide it into subchannel allocation and power allocation problems. In the subchannel allocation problem, we transform it into a bipartite graph optimal matching problem, and propose a network flow algorithm to solve it. In the power allocation problem, we optimize the power allocation of each subchannel by penalty function method on the basis of subchannel allocation. Simulation results show that the proposed scheme has better performance than that based on long-user-central-window (LUCW) principle.
{"title":"Graph Theory based Resource Allocation Algorithm in Terahertz Communication Networks","authors":"Chaoyang Wang, Feng Yan","doi":"10.1109/icicn52636.2021.9673829","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673829","url":null,"abstract":"Terahertz (THz) communication is considered to be a promising technology in B5G communication systems. Efficient resource allocation algorithms play an important role in THz communication systems. In this paper, a graph theory based resource allocation algorithm is proposed for THz communication networks. The resource allocation is formulated into an optimization problem, which is a Mixed-Integer Nonlinear Programming (MINLP) problem. We thus divide it into subchannel allocation and power allocation problems. In the subchannel allocation problem, we transform it into a bipartite graph optimal matching problem, and propose a network flow algorithm to solve it. In the power allocation problem, we optimize the power allocation of each subchannel by penalty function method on the basis of subchannel allocation. Simulation results show that the proposed scheme has better performance than that based on long-user-central-window (LUCW) principle.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122347265","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 : 2021-11-25DOI: 10.1109/icicn52636.2021.9673999
Jia-chao Wang, Xiao Ma, Dan Li, Weijia Han
The development of wireless communication technology requires higher security of wireless channel transmission. In wireless communication systems, active eavesdropping is a common method. Eavesdroppers send signals while eavesdropping, which provides the possibility for detection. Aiming at the problem of how to find the target position, this paper proposes a cooperative method to suppress eavesdropping nodes by using multi-agent method (SECM) in reinforcement learning. In our work, we introduce a UAV agent with a ranger of vision, which can find eavesdropping nodes through electromagnetic information and track their positions in real time. The UAV shares the eavesdropper’s position with the mobile jammer. Furthermore, fixed jammers are added in the scene to cooperate with the mobile jammer to pursue and form a cooperative strategy. The strategy can optimize the suppression efficiency. The simulation results show that the cooperative suppression eavesdropping algorithm proposed in this paper has better performance in detection than traditional Q-learning algorithm.
{"title":"Reinforcement Learning for Suppressing Eavesdroppers in Wireless Communication System","authors":"Jia-chao Wang, Xiao Ma, Dan Li, Weijia Han","doi":"10.1109/icicn52636.2021.9673999","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673999","url":null,"abstract":"The development of wireless communication technology requires higher security of wireless channel transmission. In wireless communication systems, active eavesdropping is a common method. Eavesdroppers send signals while eavesdropping, which provides the possibility for detection. Aiming at the problem of how to find the target position, this paper proposes a cooperative method to suppress eavesdropping nodes by using multi-agent method (SECM) in reinforcement learning. In our work, we introduce a UAV agent with a ranger of vision, which can find eavesdropping nodes through electromagnetic information and track their positions in real time. The UAV shares the eavesdropper’s position with the mobile jammer. Furthermore, fixed jammers are added in the scene to cooperate with the mobile jammer to pursue and form a cooperative strategy. The strategy can optimize the suppression efficiency. The simulation results show that the cooperative suppression eavesdropping algorithm proposed in this paper has better performance in detection than traditional Q-learning algorithm.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123815889","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}
Direction-of-Arrival (DOA) estimation is a basic and important problem in sensor array signal processing. In order to solve this problem, many algorithms have been proposed. Among them, the Stochastic Maximum Likelihood (SML) algorithm has become one of the most concerned algorithms because of its high DOA accuracy. However, the computational complexity of SML algorithm is very high, so Gauss-Newton algorithm is used as the analytical algorithm of SML in this paper. The traditional Gauss-Newton algorithm used in DOA estimation has some defects: (1) over reliance on the choice of initial values (2) fall into local optimum easily. In order to solve these defects and further reduce the computational complexity, this paper proposes a new DOA estimation algorithm based on PSO-Gauss-Newton. First of all, a limited solution space is proposed based on the precondition that the estimated signal must be non-negative definite. Then, according to the idea of PSO(Particle Swarm Optimization) algorithm, multiple scattering points are randomly distributed in the limited solution space. Each initial particle performs Gauss-Newton algorithm iteration separately. Finally, the global optimal solution is determined by comparison of all the convergence values. Simulation results the computational complexity of this algorithm is almost comparable to that of MUSIC algorithm.
{"title":"A New DOA Estimation Algorithm Based on PSO-Gauss-Newton","authors":"Xuerong Cui, Rongrong Zhou, Haihua Chen, Yucheng Zhang, Shibao Li, Jingyao Zhang","doi":"10.1109/icicn52636.2021.9673931","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673931","url":null,"abstract":"Direction-of-Arrival (DOA) estimation is a basic and important problem in sensor array signal processing. In order to solve this problem, many algorithms have been proposed. Among them, the Stochastic Maximum Likelihood (SML) algorithm has become one of the most concerned algorithms because of its high DOA accuracy. However, the computational complexity of SML algorithm is very high, so Gauss-Newton algorithm is used as the analytical algorithm of SML in this paper. The traditional Gauss-Newton algorithm used in DOA estimation has some defects: (1) over reliance on the choice of initial values (2) fall into local optimum easily. In order to solve these defects and further reduce the computational complexity, this paper proposes a new DOA estimation algorithm based on PSO-Gauss-Newton. First of all, a limited solution space is proposed based on the precondition that the estimated signal must be non-negative definite. Then, according to the idea of PSO(Particle Swarm Optimization) algorithm, multiple scattering points are randomly distributed in the limited solution space. Each initial particle performs Gauss-Newton algorithm iteration separately. Finally, the global optimal solution is determined by comparison of all the convergence values. Simulation results the computational complexity of this algorithm is almost comparable to that of MUSIC algorithm.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127836945","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}
Nowadays, agricultural production needs to improve the quality and yield of crops by monitoring their growth environment. The monitoring locations have the characteristics of wide distribution, high density, and large quantity. Thus, a networking method suitable for agricultural environmental monitoring is required. LoRa wireless communication technology has the advantages of long range and strong diffraction ability, while its date rate is low. NRF24L01P is a single-chip wireless transceiver working in the 2.4 to 2.5 GHz ISM band. It has the advantages of high data rate, low energy consumption and cost effectiveness, but the communication range is short. By the combination of the two technologies, this article proposes a scalable hybrid networking method based on the needs of agricultural environment monitoring. This method takes the advantage of LoRa and NRF24L01P networking and is suitable for agricultural environmental data collection. The collected data is finally uploaded to the cloud via WiFi so that end users can remotely access the agricultural data. The experimental results show that the proposed hybrid network can improve the data collection efficiency and data transmission distance.
{"title":"A Scalable Hybrid Network for Agriculture Environment Monitoring","authors":"Susheng Ding, Junbao Zheng, Lurong Jiang, Wei Li, Meng Li, Fengcheng Mei","doi":"10.1109/icicn52636.2021.9674009","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9674009","url":null,"abstract":"Nowadays, agricultural production needs to improve the quality and yield of crops by monitoring their growth environment. The monitoring locations have the characteristics of wide distribution, high density, and large quantity. Thus, a networking method suitable for agricultural environmental monitoring is required. LoRa wireless communication technology has the advantages of long range and strong diffraction ability, while its date rate is low. NRF24L01P is a single-chip wireless transceiver working in the 2.4 to 2.5 GHz ISM band. It has the advantages of high data rate, low energy consumption and cost effectiveness, but the communication range is short. By the combination of the two technologies, this article proposes a scalable hybrid networking method based on the needs of agricultural environment monitoring. This method takes the advantage of LoRa and NRF24L01P networking and is suitable for agricultural environmental data collection. The collected data is finally uploaded to the cloud via WiFi so that end users can remotely access the agricultural data. The experimental results show that the proposed hybrid network can improve the data collection efficiency and data transmission distance.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128740281","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 : 2021-11-25DOI: 10.1109/icicn52636.2021.9673885
Haocun Wu, Jiangtao Xu, Longtao Wang, Linping Teng, Si Lv, F. Pang, Xianglong Zeng
We summarize two kinds of mode-locked fiber lasers (MLFLs) that generate intra-cavity optical vortex beams (OVBs) based on long period fiber gratings (LPFGs) and implement extra-cavity hybrid mode control with another kind of all-fiber mode converter called acoustically-induced fiber grating (AIFG). Firstly, the LPFG we used works at the turn-around point (TAP). Since mode conversion through TAP-LPFG can produce the complete set of eigenmodes of LP11 mode, OVBs are then generated by inducing a phase difference of $pi/2$ to the eigenmodes. Secondly, the 1.94 W average-power mode-locked pulses come from a MLFL in the dissipative soliton resonance (DSR) regime. The linear cavity is formed by two fiber loop mirrors (FLMs) whose splitting ratios are 50/50 and 5/95. The 5/95 FLM operates as a nonlinear optical loop mirror (NOLM) which aims at initiating stable DSR. The output fundamental mode is then fully or partially converted to high-order mode (HOM) through AIFG. Mode patterns are captured through an optical imaging system. Taking the advantage of all-fiber mode converters, our approach may expand the diversity of mode control under high-power condition and other researches in high-power fiber lasers.
{"title":"Mode-Locked Vortex Fiber Laser Based on High-Order Mode Conversion","authors":"Haocun Wu, Jiangtao Xu, Longtao Wang, Linping Teng, Si Lv, F. Pang, Xianglong Zeng","doi":"10.1109/icicn52636.2021.9673885","DOIUrl":"https://doi.org/10.1109/icicn52636.2021.9673885","url":null,"abstract":"We summarize two kinds of mode-locked fiber lasers (MLFLs) that generate intra-cavity optical vortex beams (OVBs) based on long period fiber gratings (LPFGs) and implement extra-cavity hybrid mode control with another kind of all-fiber mode converter called acoustically-induced fiber grating (AIFG). Firstly, the LPFG we used works at the turn-around point (TAP). Since mode conversion through TAP-LPFG can produce the complete set of eigenmodes of LP11 mode, OVBs are then generated by inducing a phase difference of $pi/2$ to the eigenmodes. Secondly, the 1.94 W average-power mode-locked pulses come from a MLFL in the dissipative soliton resonance (DSR) regime. The linear cavity is formed by two fiber loop mirrors (FLMs) whose splitting ratios are 50/50 and 5/95. The 5/95 FLM operates as a nonlinear optical loop mirror (NOLM) which aims at initiating stable DSR. The output fundamental mode is then fully or partially converted to high-order mode (HOM) through AIFG. Mode patterns are captured through an optical imaging system. Taking the advantage of all-fiber mode converters, our approach may expand the diversity of mode control under high-power condition and other researches in high-power fiber lasers.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129089960","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
扫码关注我们
求助内容：
应助结果提醒方式：