Pub Date : 2025-02-01DOI: 10.23919/JCN.2025.000004
Chen Chen;Fengfan Yang;Hongjun Xu;Lawrence Muthama Paul
In this manuscript, inspired by the special construction of generalized Reed-Solomon (GRS) codes, we prove that any linear block code can be contained by a high-dimensional GRS code from the perspective of the isomorphism between the code space and the polynomial space. Then, a new code family, named quasi-GRS codes, is constructed, which can exactly contain a GRS code of lower 1-dimensional (1-D) and be contained by a higher 1-D GRS code. Furthermore, the exhaustive search approach is developed to assist in selecting the quasi-GRS code with the optimal code weight distribution. In addition, a multi-step simplified maximum likelihood decoding (MSS-MLD) is proposed to efficiently decode the quasi-GRS coding scheme, whose decoding complexity is significantly reduced at an acceptable performance loss compared to the optimal MLD. From the Monte-Carlo simulation, the optimized quasi-GRS coding scheme outperforms the existing non-binary Bose-Chaudhuri-Hocquenghem (BCH) coding scheme with a similar code rate by a margin of over 1 dB at the high signal-to-noise (SNR) region under identical channel conditions.
{"title":"Optimized design of quasi-GRS codes with multi-step simplified MLD","authors":"Chen Chen;Fengfan Yang;Hongjun Xu;Lawrence Muthama Paul","doi":"10.23919/JCN.2025.000004","DOIUrl":"https://doi.org/10.23919/JCN.2025.000004","url":null,"abstract":"In this manuscript, inspired by the special construction of generalized Reed-Solomon (GRS) codes, we prove that any linear block code can be contained by a high-dimensional GRS code from the perspective of the isomorphism between the code space and the polynomial space. Then, a new code family, named quasi-GRS codes, is constructed, which can exactly contain a GRS code of lower 1-dimensional (1-D) and be contained by a higher 1-D GRS code. Furthermore, the exhaustive search approach is developed to assist in selecting the quasi-GRS code with the optimal code weight distribution. In addition, a multi-step simplified maximum likelihood decoding (MSS-MLD) is proposed to efficiently decode the quasi-GRS coding scheme, whose decoding complexity is significantly reduced at an acceptable performance loss compared to the optimal MLD. From the Monte-Carlo simulation, the optimized quasi-GRS coding scheme outperforms the existing non-binary Bose-Chaudhuri-Hocquenghem (BCH) coding scheme with a similar code rate by a margin of over 1 dB at the high signal-to-noise (SNR) region under identical channel conditions.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 1","pages":"40-49"},"PeriodicalIF":2.9,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10923676","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.23919/JCN.2025.000002
Ken Long;Hongjun Liu
Hybrid precoding is a crucial technique for massive multiple-input multiple-output (MIMO) systems owing to its capability to offer an adequate beamforming gain while reducing the hardware cost. However, the nonconvex objective functions and constraints pose great challenges to hybrid precoders design. The conventional precoding method that contains a two-step process including channel estimation and precoding design based on such estimate is not necessarily optimal to tackle this problem. In this article, a transformer-empowered approach waiving high-dimensional channel estimation is proposed to design precoders with the goal of simplifying the complicated hybrid precoding problem into the optimization of neural network structure. Specifically, the proposed approach learns channel sensing from uplink pilots and then operates downlink hybrid precoding depended on interleaved-polymerization-transformer-based analog precoding network (IPTAP-Net) which decomposes on a peruser basis and conventional linear digital precoding algorithm to reduce computational complexity in multi-user systems. Simulations show that the proposed methodology acquires remarkable performance improvement and strong robustness, as compared to state-of-the-art hybrid precoding schemes. Furthermore, proposed approach develops a generalizable talent for manifold multi-user cells.
{"title":"Transformer-enabled hybrid precoding for TDD large-scale antenna arrays systems with channel sensing","authors":"Ken Long;Hongjun Liu","doi":"10.23919/JCN.2025.000002","DOIUrl":"https://doi.org/10.23919/JCN.2025.000002","url":null,"abstract":"Hybrid precoding is a crucial technique for massive multiple-input multiple-output (MIMO) systems owing to its capability to offer an adequate beamforming gain while reducing the hardware cost. However, the nonconvex objective functions and constraints pose great challenges to hybrid precoders design. The conventional precoding method that contains a two-step process including channel estimation and precoding design based on such estimate is not necessarily optimal to tackle this problem. In this article, a transformer-empowered approach waiving high-dimensional channel estimation is proposed to design precoders with the goal of simplifying the complicated hybrid precoding problem into the optimization of neural network structure. Specifically, the proposed approach learns channel sensing from uplink pilots and then operates downlink hybrid precoding depended on interleaved-polymerization-transformer-based analog precoding network (IPTAP-Net) which decomposes on a peruser basis and conventional linear digital precoding algorithm to reduce computational complexity in multi-user systems. Simulations show that the proposed methodology acquires remarkable performance improvement and strong robustness, as compared to state-of-the-art hybrid precoding schemes. Furthermore, proposed approach develops a generalizable talent for manifold multi-user cells.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 1","pages":"23-31"},"PeriodicalIF":2.9,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10923678","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.23919/JCN.2025.000003
Lili Guo;Shibing Zhang;Xuan Zhu;Xiaodong Ji
This paper investigates optimal trajectory design for an unmanned aerial vehicle (UAV) enabled two-way relaying, where a fixed-wing UAV employs an amplify-and-forward protocol to assist data exchange between two ground users. With the aim of maximizing the system energy efficiency (EE), an optimization problem corresponding to the UAV's trajectory design is formulated, where the UAV's initial/final speed and location constraints in addition to the acceleration constraint of the UAV are considered. The initial optimization problem is intractable due to its non-concave objective function and nonconvex constraints. To this end, slack variables are introduced, and then the successive convex approximation (SCA) method and the Dinkelbach's algorithm are applied to transform it into a convex optimization problem, which is solved by a proposed iterative algorithm. Simulation results show that the proposed iterative algorithm converges quite quickly, and with the trajectory design, the two-way UAV relaying is much more superior than the compared benchmark schemes in terms of EE.
{"title":"Energy efficient trajectory design for fixed-wing UAV enabled two-way amplify-and-forward relaying","authors":"Lili Guo;Shibing Zhang;Xuan Zhu;Xiaodong Ji","doi":"10.23919/JCN.2025.000003","DOIUrl":"https://doi.org/10.23919/JCN.2025.000003","url":null,"abstract":"This paper investigates optimal trajectory design for an unmanned aerial vehicle (UAV) enabled two-way relaying, where a fixed-wing UAV employs an amplify-and-forward protocol to assist data exchange between two ground users. With the aim of maximizing the system energy efficiency (EE), an optimization problem corresponding to the UAV's trajectory design is formulated, where the UAV's initial/final speed and location constraints in addition to the acceleration constraint of the UAV are considered. The initial optimization problem is intractable due to its non-concave objective function and nonconvex constraints. To this end, slack variables are introduced, and then the successive convex approximation (SCA) method and the Dinkelbach's algorithm are applied to transform it into a convex optimization problem, which is solved by a proposed iterative algorithm. Simulation results show that the proposed iterative algorithm converges quite quickly, and with the trajectory design, the two-way UAV relaying is much more superior than the compared benchmark schemes in terms of EE.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 1","pages":"32-39"},"PeriodicalIF":2.9,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10923674","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.23919/JCN.2024.000071
Jihyeon Min;Youngil Park
Automotive Ethernet has emerged as a communication protocol to meet the escalating demands in applications such as advanced driver assistance systems (ADAS), autonomous driving, and connected vehicles. This technology surpasses the capabilities of the traditional controller area network (CAN) by providing higher bandwidth and supporting bidirectional communication, which is essential for real-time applications and the easy expansion of networks through Ethernet switches. Furthermore, automotive Ethernet guarantees packet transmission within the bounded latency, achieving low packet latency and jitter, and low packet loss through time-sensitive networking (TSn), a set of standards within the IEEE 802 network, which ensures the operation of time-critical applications. TSN also helps for automotive Ethernet, which requires reliability to deliver messages from time-critical applications without errors or loss. Among TSN standards, frame replication and elimination for reliability (FRER) stands out as a technology that provides redundancy. Although FRER is useful in detecting data loss, it consumes significant bandwidth and works only in a mesh topology. Therefore, it is difficult to be used in the bus type automotive Ethernet such as 10BASE-T1S. The bus topology presents a problem wherein if a segment of the cable becomes damaged, communication throughout the entire network becomes impossible. In this paper, we propose a fault-tolerant redundancy protocol for within the 10BASE-T1S bus topology. Our method involves adapting the physical layer collision avoidance (PLCA) protocol, originally utilized in the 10BASE-T1S bus topology, for operation in a ring-type connection. This approach offers the advantage of maintaining compatibility with the existing PLCA protocol in use. We verify the effectiveness of our proposed method through simulations and hardware emulation, confirming its ability to restore network functionality in the event of hard faults, such as cable disconnections and node failures.
{"title":"Fault recovery of 10BASE-T1S automotive ethernet with bus/ring hybrid topology","authors":"Jihyeon Min;Youngil Park","doi":"10.23919/JCN.2024.000071","DOIUrl":"https://doi.org/10.23919/JCN.2024.000071","url":null,"abstract":"Automotive Ethernet has emerged as a communication protocol to meet the escalating demands in applications such as advanced driver assistance systems (ADAS), autonomous driving, and connected vehicles. This technology surpasses the capabilities of the traditional controller area network (CAN) by providing higher bandwidth and supporting bidirectional communication, which is essential for real-time applications and the easy expansion of networks through Ethernet switches. Furthermore, automotive Ethernet guarantees packet transmission within the bounded latency, achieving low packet latency and jitter, and low packet loss through time-sensitive networking (TSn), a set of standards within the IEEE 802 network, which ensures the operation of time-critical applications. TSN also helps for automotive Ethernet, which requires reliability to deliver messages from time-critical applications without errors or loss. Among TSN standards, frame replication and elimination for reliability (FRER) stands out as a technology that provides redundancy. Although FRER is useful in detecting data loss, it consumes significant bandwidth and works only in a mesh topology. Therefore, it is difficult to be used in the bus type automotive Ethernet such as 10BASE-T1S. The bus topology presents a problem wherein if a segment of the cable becomes damaged, communication throughout the entire network becomes impossible. In this paper, we propose a fault-tolerant redundancy protocol for within the 10BASE-T1S bus topology. Our method involves adapting the physical layer collision avoidance (PLCA) protocol, originally utilized in the 10BASE-T1S bus topology, for operation in a ring-type connection. This approach offers the advantage of maintaining compatibility with the existing PLCA protocol in use. We verify the effectiveness of our proposed method through simulations and hardware emulation, confirming its ability to restore network functionality in the event of hard faults, such as cable disconnections and node failures.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 1","pages":"1-9"},"PeriodicalIF":2.9,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10923679","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.23919/JCN.2025.000001
Hyunsoo Lee;Soyi Jung;Soohyun Park
With the rapid development of autonomous mobility technologies, drones are now widely used in many applications, including military domain. Particularly in battlefield conditions, designing a deep reinforcement learning (DRL)-based autonomous control algorithm presents significant challenges due to the need for real-time and adjustable nonlinear trajectory planning. Therefore, this paper introduces a novel situation-aware DRL-based autonomous nonlinear drone mobility control algorithm tailored for cyber-physical loitering munition applications. The proposed DRL-based drone mobility control algorithm is crafted with a focus on real-time situation-aware operations, enabling it to navigate through many obstacles encountered on the battlefield efficiently. For efficient observation and intuitive fast understanding of time-varying real-time situations, this paper presents an algorithm that works on a cyber-physical virtual battlefield environment using Unity. In detail, our proposed DRL-based nonlinear drone mobility control algorithm utilizes situation-aware sensing components that are implemented with a Raycast function in Unity virtual scenarios. Based on the gathered situation-aware information, the drone can autonomously and nonlinearly adjust its trajectory during flight. Thus, this approach is obviously beneficial for avoiding obstacles in complex and unpredictable battlefields. Our visualization- based performance evaluation shows that the proposed algorithm outperforms other mobility control algorithms, with an average performance nearly twice as high when the obstacle density is 50%. This superiority is further evidenced by the detailed trajectory planning presented.
{"title":"Situation-aware deep reinforcement learning for autonomous nonlinear mobility control in cyber-physical loitering munition systems","authors":"Hyunsoo Lee;Soyi Jung;Soohyun Park","doi":"10.23919/JCN.2025.000001","DOIUrl":"https://doi.org/10.23919/JCN.2025.000001","url":null,"abstract":"With the rapid development of autonomous mobility technologies, drones are now widely used in many applications, including military domain. Particularly in battlefield conditions, designing a deep reinforcement learning (DRL)-based autonomous control algorithm presents significant challenges due to the need for real-time and adjustable nonlinear trajectory planning. Therefore, this paper introduces a novel situation-aware DRL-based autonomous nonlinear drone mobility control algorithm tailored for cyber-physical loitering munition applications. The proposed DRL-based drone mobility control algorithm is crafted with a focus on real-time situation-aware operations, enabling it to navigate through many obstacles encountered on the battlefield efficiently. For efficient observation and intuitive fast understanding of time-varying real-time situations, this paper presents an algorithm that works on a cyber-physical virtual battlefield environment using Unity. In detail, our proposed DRL-based nonlinear drone mobility control algorithm utilizes situation-aware sensing components that are implemented with a Raycast function in Unity virtual scenarios. Based on the gathered situation-aware information, the drone can autonomously and nonlinearly adjust its trajectory during flight. Thus, this approach is obviously beneficial for avoiding obstacles in complex and unpredictable battlefields. Our visualization- based performance evaluation shows that the proposed algorithm outperforms other mobility control algorithms, with an average performance nearly twice as high when the obstacle density is 50%. This superiority is further evidenced by the detailed trajectory planning presented.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 1","pages":"10-22"},"PeriodicalIF":2.9,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10923673","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.23919/JCN.2025.000011
{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2025.000011","DOIUrl":"https://doi.org/10.23919/JCN.2025.000011","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 1","pages":"56-58"},"PeriodicalIF":2.9,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10923681","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-01DOI: 10.23919/JCN.2025.000009
{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2025.000009","DOIUrl":"https://doi.org/10.23919/JCN.2025.000009","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"27 1","pages":"51-55"},"PeriodicalIF":2.9,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10923683","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-01DOI: 10.23919/JCN.2024.000066
Xianli Sun;Linghua Zhang;Qiqing Zhai;Peng Zheng
How to comprehend the relationship between information spreading and individual behavior adoption is an essential problem in complex networks. To this end, a novel two-layer model to depict the diffusion of green behavior under the impact of positive and negative information is proposed. Positive information motivates people to adopt green behavior, while negative information reduces the adoption of green behavior. In the model, the physical contact layer describes the green behavior diffusion, and the information layer describes the positive and negative information spreading. Moreover, the social interactions of individuals in two layers change with time and are illustrated by an activity-driven model. Then, we develop the probability transition equations and derive the green behavior threshold. Next, experiments are carried out to confirm the preciseness and theoretical predictions of the new model. It reveals that the prevalence of green behavior can be promoted by restraining the negative information transmission rate and recovery rate of the green nodes while facilitating the positive information transmission rate and green behavior transmission rate. Additionally, reducing the positive information recovery rate and the recovery rate of the green nodes, and increasing the rates of forgetting negative information are beneficial for encouraging the outbreak of green behavior. Furthermore, in the physical contact layer, higher contact capacity and greater activity heterogeneity significantly facilitate green behavior spreading. In the information layer, smaller contact capacity and weaker activity heterogeneity promote diffusion when negative information dominates, whereas larger contact capacity and stronger activity heterogeneity are beneficial when positive information prevails.
{"title":"Green behavior diffusion with positive and negative information in time-varying multiplex networks","authors":"Xianli Sun;Linghua Zhang;Qiqing Zhai;Peng Zheng","doi":"10.23919/JCN.2024.000066","DOIUrl":"https://doi.org/10.23919/JCN.2024.000066","url":null,"abstract":"How to comprehend the relationship between information spreading and individual behavior adoption is an essential problem in complex networks. To this end, a novel two-layer model to depict the diffusion of green behavior under the impact of positive and negative information is proposed. Positive information motivates people to adopt green behavior, while negative information reduces the adoption of green behavior. In the model, the physical contact layer describes the green behavior diffusion, and the information layer describes the positive and negative information spreading. Moreover, the social interactions of individuals in two layers change with time and are illustrated by an activity-driven model. Then, we develop the probability transition equations and derive the green behavior threshold. Next, experiments are carried out to confirm the preciseness and theoretical predictions of the new model. It reveals that the prevalence of green behavior can be promoted by restraining the negative information transmission rate and recovery rate of the green nodes while facilitating the positive information transmission rate and green behavior transmission rate. Additionally, reducing the positive information recovery rate and the recovery rate of the green nodes, and increasing the rates of forgetting negative information are beneficial for encouraging the outbreak of green behavior. Furthermore, in the physical contact layer, higher contact capacity and greater activity heterogeneity significantly facilitate green behavior spreading. In the information layer, smaller contact capacity and weaker activity heterogeneity promote diffusion when negative information dominates, whereas larger contact capacity and stronger activity heterogeneity are beneficial when positive information prevails.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 6","pages":"650-665"},"PeriodicalIF":2.9,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10834484","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142937881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-01DOI: 10.23919/JCN.2024.000076
{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2024.000076","DOIUrl":"https://doi.org/10.23919/JCN.2024.000076","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 6","pages":"716-718"},"PeriodicalIF":2.9,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10834495","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142937982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-01DOI: 10.23919/JCN.2024.000053
Shixun Wu;Miao Zhang;Kanapathippillai Cumanan;Kai Xu;Zhangli Lan
In this paper, mobile terminal (MT) tracking based on time of arrival (TOA), angle of departure (AOD), and angle of arrival (AOA) measurements with one base station is investigated. The main challenge is the unknown propagation environment, such as line-of-sight (LOS), non-line-of-sight (NLOS) modeled as one-bounce scattering or mixed LOS/NLOS propagations, which may result in heterogeneous measurements. For LOS scenario, a linear Kalman filter (LKF) algorithm is adopted through analyzing and deriving the estimated error of MT. For NLOS scenario, as the position of scatterer is unknown, a nonlinear range equation is formulated to measure the actual AOD/AOA measurements and the position of scatterer, and three different algorithms: The extended Kalman filter (EKF), unscented Kalman filter (UKF) and an approximated LKF are developed. For mixed LOS/NLOS scenario, the modified interacting multiple model LKF (M-IMM-LKF) and the identified LKF algorithms (I-LKF) are utilized to address the issue of the frequent transition between LOS and NLOS propagations. In comparison with EKF and UKF algorithms, the simulation results and running time comparisons show the superiority and effectiveness of the LKF algorithm in LOS and NLOS scenarios. Both M-IMM-LKF and I-LKF algorithms are capable to significantly reduce the localization errors, and better than three existing algorithms.
{"title":"Single base station tracking approaches with hybrid TOA/AOD/AOA measurements in different propagation environments","authors":"Shixun Wu;Miao Zhang;Kanapathippillai Cumanan;Kai Xu;Zhangli Lan","doi":"10.23919/JCN.2024.000053","DOIUrl":"https://doi.org/10.23919/JCN.2024.000053","url":null,"abstract":"In this paper, mobile terminal (MT) tracking based on time of arrival (TOA), angle of departure (AOD), and angle of arrival (AOA) measurements with one base station is investigated. The main challenge is the unknown propagation environment, such as line-of-sight (LOS), non-line-of-sight (NLOS) modeled as one-bounce scattering or mixed LOS/NLOS propagations, which may result in heterogeneous measurements. For LOS scenario, a linear Kalman filter (LKF) algorithm is adopted through analyzing and deriving the estimated error of MT. For NLOS scenario, as the position of scatterer is unknown, a nonlinear range equation is formulated to measure the actual AOD/AOA measurements and the position of scatterer, and three different algorithms: The extended Kalman filter (EKF), unscented Kalman filter (UKF) and an approximated LKF are developed. For mixed LOS/NLOS scenario, the modified interacting multiple model LKF (M-IMM-LKF) and the identified LKF algorithms (I-LKF) are utilized to address the issue of the frequent transition between LOS and NLOS propagations. In comparison with EKF and UKF algorithms, the simulation results and running time comparisons show the superiority and effectiveness of the LKF algorithm in LOS and NLOS scenarios. Both M-IMM-LKF and I-LKF algorithms are capable to significantly reduce the localization errors, and better than three existing algorithms.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 6","pages":"617-631"},"PeriodicalIF":2.9,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10834482","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：