Tingting Yan
Tingting Yan has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Shengbo Hu
School of Big Data and Computer Science and the Institute of Intelligent Information Processing, Guizhou Normal University, Guiyang, China
6 shared publications - Jinrong Mo
Institute of Intelligent Information Processing, Guizhou Normal University, Guiyang 550001, China
3 shared publications - Lv Ye
College of Electronic and Optical Engineering and the College of Flexible Electronics (Future Technology), Nanjing University of Posts and Telecommunications, Nanjing, China
2 shared publications Bo Hu
School of Big Data and Computer Science Guizhou Normal University Guiyang China
1 shared publicationDi He
Shanghai Key Laboratory of Navigation and Location‐based Services Shanghai Jiao Tong University Shanghai P.R. China
1 shared publication- Ding Du
School of Big Data and Computer Science, Guizhou Normal University, Guiyang, China
1 shared publication
Latest Publications
- Open Access
Caching Policy in Low Earth Orbit Satellite Mega-Constellation Information-Centric Networking for Internet of Things
Information-Centric Networking (ICN) is the emerging next-generation internet paradigm. The Low Earth Orbit (LEO) satellite mega-constellation based on ICN can achieve seamless global coverage and provide excellent support for Internet of Things (IoT) services. Additionally, in-network caching, typically characteristic of ICN, plays a paramount role in network performance. Therefore, the in-network caching policy is one of the hotspot problems. Especially, compared to caching traditional internet content, in-networking caching IoT content is more challenging, since the IoT content lifetime is small and transient. In this paper, firstly, the framework of the LEO satellite mega-constellation Information-Centric Networking for IoT (LEO-SMC-ICN-IoT) is proposed. Then, introducing the concept of “viscosity”, the proposed Caching Algorithm based on the Random Forest (CARF) policy of satellite nodes combines both content popularity prediction and satellite nodes location prediction, for achieving good cache matching between the satellite nodes and content. And using the matching rule, the Random Forest (RF) algorithm is adopted to predict the matching relationship among satellite nodes and content for guiding the deployment of caches. Especially, the content is cached in advance at the future satellite to maintain communication with the current ground segment at the time of satellite switchover. Additionally, the policy considers both the IoT content lifetime and the freshness. Finally, a simulation platform with LEO satellite mega-constellation based on ICN is developed in Network Simulator 3 (NS-3). The simulation results show that the proposed caching policy compared with the Leave Copy Everywhere (LCE), the opportunistic (OPP), the Leave Copy down (LCD), and the probabilistic algorithm which caches each content with probability 0.5 (prob 0.5) yield a significant performance improvement, such as the average number of hops, i.e., delay, cache hit rate, and throughput.
Open AccessCaching Policy in Low Earth Orbit Satellite Mega-Constellation Information-Centric Networking for Internet of Things
Information-Centric Networking (ICN) is the emerging next-generation internet paradigm. The Low Earth Orbit (LEO) satellite mega-constellation based on ICN can achieve seamless global coverage and provide excellent support for Internet of Things (IoT) services. Additionally, in-network caching, typically characteristic of ICN, plays a paramount role in network performance. Therefore, the in-network caching policy is one of the hotspot problems. Especially, compared to caching traditional internet content, in-networking caching IoT content is more challenging, since the IoT content lifetime is small and transient. In this paper, firstly, the framework of the LEO satellite mega-constellation Information-Centric Networking for IoT (LEO-SMC-ICN-IoT) is proposed. Then, introducing the concept of “viscosity”, the proposed Caching Algorithm based on the Random Forest (CARF) policy of satellite nodes combines both content popularity prediction and satellite nodes location prediction, for achieving good cache matching between the satellite nodes and content. And using the matching rule, the Random Forest (RF) algorithm is adopted to predict the matching relationship among satellite nodes and content for guiding the deployment of caches. Especially, the content is cached in advance at the future satellite to maintain communication with the current ground segment at the time of satellite switchover. Additionally, the policy considers both the IoT content lifetime and the freshness. Finally, a simulation platform with LEO satellite mega-constellation based on ICN is developed in Network Simulator 3 (NS-3). The simulation results show that the proposed caching policy compared with the Leave Copy Everywhere (LCE), the opportunistic (OPP), the Leave Copy down (LCD), and the probabilistic algorithm which caches each content with probability 0.5 (prob 0.5) yield a significant performance improvement, such as the average number of hops, i.e., delay, cache hit rate, and throughput.
- 7 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (4) , 3848-3853
Analysis of the Cutoff Wavenumber for Arbitrarily Shaped Waveguides Using Method of Dipole Representations With an Excitation Source
In this study, a new meshless technique named the method of dipole representation (MDPR) is proposed for numerically solving cutoff wavenumbers (eigenfrequency) of arbitrarily shaped waveguides with an excitation source. MDPR belongs to the de-singularized method like the method of auxiliary sources. Based on the solution of the 2D Laplace boundary-value problem with rational functions (dipole representation) as basis functions, this study gives the form of dipole representation for the problem under consideration. In MDPR, determining the location of the singularities (called poles in this study) is crucial, and a placement scheme for pole location is given by exponential clustering. Numerical results show that the proposed method can effectively solve the arbitrarily shaped waveguide eigenvalue problem. It also shows that MDPR can achieve root-exponential convergence.
- 7 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (4) , 3848-3853
Analysis of the Cutoff Wavenumber for Arbitrarily Shaped Waveguides Using Method of Dipole Representations With an Excitation Source
In this study, a new meshless technique named the method of dipole representation (MDPR) is proposed for numerically solving cutoff wavenumbers (eigenfrequency) of arbitrarily shaped waveguides with an excitation source. MDPR belongs to the de-singularized method like the method of auxiliary sources. Based on the solution of the 2D Laplace boundary-value problem with rational functions (dipole representation) as basis functions, this study gives the form of dipole representation for the problem under consideration. In MDPR, determining the location of the singularities (called poles in this study) is crucial, and a placement scheme for pole location is given by exponential clustering. Numerical results show that the proposed method can effectively solve the arbitrarily shaped waveguide eigenvalue problem. It also shows that MDPR can achieve root-exponential convergence.
- Open Access
- 7 December 2023
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 59 (23)
Cutoff wavenumber analysis of arbitrarily shaped waveguides using regularized method of fundamental solutions with excitation sources
The method of fundamental solutions with excitation source (MFS‐ES) is a reliable method for determining the eigenvalues of a two‐dimensional hollow waveguide. However, the accuracy in MFS‐ES is extremely dependent on the choice of the auxiliary boundary. In this work, to avoid the problem, a regularized MFS‐ES (RMFS‐ES) is proposed. First, to overcome the shortcomings of MFS, a regularized method of fundamental Solutions (RMFS) is proposed by borrowing the ideas of singular boundary method (SBM) and single layer regularized meshless method (SRMM). Second, the expressions for the fundamental solutions at the singularities are given by utilizing the subtraction and adding‐back technique (SAB). Third, the excitation source method is introduced to overcome the problem that the RMFS may also have spurious frequencies. Finally, to improve the accuracy of RMFS‐ES in solving polygonal waveguide eigenvalue, a wedge scheme (WS) is given. Numerical results show that the meshless RMFS‐ES is a promising numerical method for waveguide eigenvalue problems.
- 7 December 2023
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 59 (23)
Open AccessCutoff wavenumber analysis of arbitrarily shaped waveguides using regularized method of fundamental solutions with excitation sources
The method of fundamental solutions with excitation source (MFS‐ES) is a reliable method for determining the eigenvalues of a two‐dimensional hollow waveguide. However, the accuracy in MFS‐ES is extremely dependent on the choice of the auxiliary boundary. In this work, to avoid the problem, a regularized MFS‐ES (RMFS‐ES) is proposed. First, to overcome the shortcomings of MFS, a regularized method of fundamental Solutions (RMFS) is proposed by borrowing the ideas of singular boundary method (SBM) and single layer regularized meshless method (SRMM). Second, the expressions for the fundamental solutions at the singularities are given by utilizing the subtraction and adding‐back technique (SAB). Third, the excitation source method is introduced to overcome the problem that the RMFS may also have spurious frequencies. Finally, to improve the accuracy of RMFS‐ES in solving polygonal waveguide eigenvalue, a wedge scheme (WS) is given. Numerical results show that the meshless RMFS‐ES is a promising numerical method for waveguide eigenvalue problems.
- Open Access
- 10 March 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-21
Optimization of Transmitter-Receiver Pairing of Spaceborne Cluster Flight Netted Radar for Area Coverage and Target Detection
In this paper, we investigate the optimization problem of the transmitter-receiver pairing of spaceborne cluster flight netted radar (SCFNR) for area coverage and target detection. First of all, we propose the novel concept of SCFNR integrated cluster flight spacecraft with netted radar, the mobility model for bistatic radar pair with twin-satellite mode, and formulate the radar-target distance distribution function and radar-target distance product distribution function with geometric probability method. Secondly, by dividing surveillance region into grids, we define the 0-1 grid coverage matrix for bistatic radar and the transmitter-receiver pairing matrix for SCFNR with using radar equation and the radar-target distance distribution function, and we describe the optimal problem of transmitter-receiver pairing of SCFNR for area coverage and target detection by defining K-grid coverage matrix. Thirdly, we propose a new algorithm integrated particle swarm optimization with Hungarian algorithm (PSO-HA) to address the optimal problem, which is actually one-to-one pairing problem. Finally, we validate the effectiveness and reasonability of the proposed algorithm through numerical analysis.
- 10 March 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-21
Open AccessOptimization of Transmitter-Receiver Pairing of Spaceborne Cluster Flight Netted Radar for Area Coverage and Target Detection
In this paper, we investigate the optimization problem of the transmitter-receiver pairing of spaceborne cluster flight netted radar (SCFNR) for area coverage and target detection. First of all, we propose the novel concept of SCFNR integrated cluster flight spacecraft with netted radar, the mobility model for bistatic radar pair with twin-satellite mode, and formulate the radar-target distance distribution function and radar-target distance product distribution function with geometric probability method. Secondly, by dividing surveillance region into grids, we define the 0-1 grid coverage matrix for bistatic radar and the transmitter-receiver pairing matrix for SCFNR with using radar equation and the radar-target distance distribution function, and we describe the optimal problem of transmitter-receiver pairing of SCFNR for area coverage and target detection by defining K-grid coverage matrix. Thirdly, we propose a new algorithm integrated particle swarm optimization with Hungarian algorithm (PSO-HA) to address the optimal problem, which is actually one-to-one pairing problem. Finally, we validate the effectiveness and reasonability of the proposed algorithm through numerical analysis.
- Open Access
- 17 February 2020
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2020, 1-11
Transmit Power Allocation with Connectivity Probability for Multi-QoS in Cluster Flight Spacecraft Network
In this paper, we investigate the transmit power allocation problem to minimize the average packet error rate at the access point in the cluster flight spacecraft network, which adopts the CSMA/CA channel access mechanism. First, the node mobility, nodal distance distribution, and probabilistic adjacency matrix were formulated for cluster flight spacecraft network based on twin-satellite mode. Then, the optimization-theoretic model described the optimized transmit power allocation strategy and its implementation algorithm was proposed. And the problem of minimizing the packet error rate of the cluster flight spacecraft network system can be converted into maximizing the expectation of the binary probabilistic adjacency matrix, i.e., maximizing the sum of the nondiagonal elements in the probabilistic adjacency matrix. Due to discreteness of nodal distance distribution, Monte Carlo method was applied to solve the transmit power allocation problem. Yet importantly, the influence of node transmit power on the QoS performance of cluster flight spacecraft network was simulated and analyzed under the assumption of finite overall network transmit power and low traffic load. Finally, the results show that the pocket error rate increases with the provided traffic load, but the pocket error rate hardly changes with the same traffic load in different sequential time slots of any orbital hyperperiod or in the same time slot of different orbital hyperperiods, and by maximizing the sum of the nondiagonal elements in the probabilistic adjacency matrix, the pocket error rate minimum is achieved for a given total network transmit power at any time slot for cluster flight spacecraft network.
- 17 February 2020
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2020, 1-11
Open AccessTransmit Power Allocation with Connectivity Probability for Multi-QoS in Cluster Flight Spacecraft Network
In this paper, we investigate the transmit power allocation problem to minimize the average packet error rate at the access point in the cluster flight spacecraft network, which adopts the CSMA/CA channel access mechanism. First, the node mobility, nodal distance distribution, and probabilistic adjacency matrix were formulated for cluster flight spacecraft network based on twin-satellite mode. Then, the optimization-theoretic model described the optimized transmit power allocation strategy and its implementation algorithm was proposed. And the problem of minimizing the packet error rate of the cluster flight spacecraft network system can be converted into maximizing the expectation of the binary probabilistic adjacency matrix, i.e., maximizing the sum of the nondiagonal elements in the probabilistic adjacency matrix. Due to discreteness of nodal distance distribution, Monte Carlo method was applied to solve the transmit power allocation problem. Yet importantly, the influence of node transmit power on the QoS performance of cluster flight spacecraft network was simulated and analyzed under the assumption of finite overall network transmit power and low traffic load. Finally, the results show that the pocket error rate increases with the provided traffic load, but the pocket error rate hardly changes with the same traffic load in different sequential time slots of any orbital hyperperiod or in the same time slot of different orbital hyperperiods, and by maximizing the sum of the nondiagonal elements in the probabilistic adjacency matrix, the pocket error rate minimum is achieved for a given total network transmit power at any time slot for cluster flight spacecraft network.
- Open Access
- 2 October 2018
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2018, 1-12
Path Formation Time in the Noise-Limited Fractionated Spacecraft Network with FDMA
Connectivity and path formation time are very important for the design and optimization in fractionated spacecraft network. Taking frequency division multiple access (FDMA) with subcarrier binary phase-shift keying (BPSK) modulation as an example, this paper focuses on the issues of constraint to orbital elements and path formation time for the noise-limited fractionated spacecraft network percolating. First, based on the proposed evolution of the dynamic topology graph in the fractionated spacecraft network, we prove the constraint condition of orbital elements for noise-limited fractionated spacecraft network percolating, and the definition of path formation time is provided and the mobility model is established. Next, we study the relationship between first docking time and spatial initial distribution and the relationship between first separating time and spatial initial distribution. These relationships provide an important basis for the orbit design in the fractionated spacecraft network. Finally, the numerical results show that the network topology for fractionated spacecraft is time-varying and dynamic. The path formation time and hop length scale linearly with path length within each orbital hyperperiod and change periodically. Besides, the time constant gradually tends to a stable value with path formation time increasing, that is, path length. These results powerfully support percolation theory further under the environment of the noise-limited fractionated spacecraft network.
- 2 October 2018
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2018, 1-12
Open AccessPath Formation Time in the Noise-Limited Fractionated Spacecraft Network with FDMA
Connectivity and path formation time are very important for the design and optimization in fractionated spacecraft network. Taking frequency division multiple access (FDMA) with subcarrier binary phase-shift keying (BPSK) modulation as an example, this paper focuses on the issues of constraint to orbital elements and path formation time for the noise-limited fractionated spacecraft network percolating. First, based on the proposed evolution of the dynamic topology graph in the fractionated spacecraft network, we prove the constraint condition of orbital elements for noise-limited fractionated spacecraft network percolating, and the definition of path formation time is provided and the mobility model is established. Next, we study the relationship between first docking time and spatial initial distribution and the relationship between first separating time and spatial initial distribution. These relationships provide an important basis for the orbit design in the fractionated spacecraft network. Finally, the numerical results show that the network topology for fractionated spacecraft is time-varying and dynamic. The path formation time and hop length scale linearly with path length within each orbital hyperperiod and change periodically. Besides, the time constant gradually tends to a stable value with path formation time increasing, that is, path length. These results powerfully support percolation theory further under the environment of the noise-limited fractionated spacecraft network.