CN114640621B - Routing method based on uncertain link parameters in low-orbit satellite network - Google Patents

Routing method based on uncertain link parameters in low-orbit satellite network Download PDF

Info

Publication number
CN114640621B
CN114640621B CN202210260192.4A CN202210260192A CN114640621B CN 114640621 B CN114640621 B CN 114640621B CN 202210260192 A CN202210260192 A CN 202210260192A CN 114640621 B CN114640621 B CN 114640621B
Authority
CN
China
Prior art keywords
link
satellite node
satellite
path
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210260192.4A
Other languages
Chinese (zh)
Other versions
CN114640621A (en
Inventor
亢小苗
李云
鲜永菊
彭德义
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202210260192.4A priority Critical patent/CN114640621B/en
Publication of CN114640621A publication Critical patent/CN114640621A/en
Application granted granted Critical
Publication of CN114640621B publication Critical patent/CN114640621B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/185Space-based or airborne stations; Stations for satellite systems
    • H04B7/1851Systems using a satellite or space-based relay
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/121Shortest path evaluation by minimising delays
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/122Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/123Evaluation of link metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/124Shortest path evaluation using a combination of metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/125Shortest path evaluation based on throughput or bandwidth
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Radio Relay Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention belongs to the technical field of satellite communication, and particularly relates to a routing method based on uncertain link parameters in a low-orbit satellite network; the method comprises the following steps: acquiring a satellite network topological graph, and selecting a source satellite node and a destination satellite node; calculating the shortest path between the source satellite node and the destination satellite node and marking the shortest path; judging whether the source satellite node and the destination satellite node are positioned at the same position on the orbit, if so, taking the marked shortest path as an optimal path; otherwise, selecting satellite nodes capable of forming a quadrilateral around the shortest path; describing uncertain parameters of links in a satellite network by adopting a membership function; according to the uncertain parameters, calculating the comprehensive evaluation values of all links in the quadrangle; selecting a path with the lowest comprehensive evaluation value of the link as an optimal route; the invention considers complex satellite network environment, and searches the path by reducing the search space of the route, thereby improving the route efficiency.

Description

Routing method based on uncertain link parameters in low-orbit satellite network
Technical Field
The invention belongs to the technical field of satellite communication, and relates to a routing method based on uncertain link parameters in a low-orbit satellite network.
Background
Satellite networks are an important component of celestial integration networks, and with the rapid development of communication technologies, satellite networks have been widely used in people's daily lives. Such as: telemedicine, weather forecast, disaster relief, and the like. The Low Orbit satellite network (LEO) has become a hot point of research at home and abroad due to the characteristics of wide coverage, low transmission delay, small propagation loss, strong anti-destruction capability, flexible and changeable networking mode and the like. Since the LEO satellite constellation consists of a plurality of satellites, the path selection between the source node and the destination node becomes diversified when the satellites cooperatively complete data transmission in the network, and thus, research on the routing problem is critical. Furthermore, LEO satellites operate in complex outer space environments, which can lead to uncertainty in link information, such as: the inter-satellite links are interfered by electromagnetic waves, noise and the like to cause the phenomenon of packet loss; dynamic changes in satellite topology can result in poor stability of inter-satellite links, which can lead to uncertainty in inter-satellite distance, and thus uncertainty in delay information; on the other hand, the evaluation criteria of the link information by people also have uncertainty, and different evaluation criteria can be provided under different scenes and requirements. Traditional satellite routing strategies are all calculated based on determined link conditions, often ignoring the spatial environment in which the satellite is located. Therefore, in view of the problem of uncertainty of link information in satellite networks, a routing method based on uncertain link parameters is needed.
Disclosure of Invention
Aiming at the defects existing in the prior art, the invention provides a routing method based on uncertain link parameters in a low-orbit satellite network, which comprises the following steps:
s1: acquiring a satellite network topological graph, and selecting a source satellite node and a destination satellite node;
s2: calculating the shortest path between the source satellite node and the destination satellite node by adopting a Bresenham algorithm and marking the shortest path;
s3: judging whether the source satellite node and the destination satellite node are positioned at the same position on the orbit, if so, taking the marked shortest path as an optimal path; otherwise, executing the step S4;
s4: selecting satellite nodes capable of forming a quadrangle around the shortest path according to the position of the source satellite node, the position of the target satellite node and the shortest path;
s5: describing uncertain parameters of links in a satellite network by adopting a membership function;
s6: according to the uncertain parameters, calculating the comprehensive evaluation values of all links in the quadrangle by adopting a Dijkstra algorithm; and selecting a path with the lowest link comprehensive evaluation value as an optimal route according to the link comprehensive evaluation value.
Preferably, the process of calculating the shortest path between the source satellite node and the destination satellite node using Bresenham's algorithm includes:
s21: calculating a coordinate difference value between a source satellite node and a target satellite node, and if the coordinate difference value of the abscissa is larger than the coordinate difference value of the ordinate, selecting the abscissa direction as a path moving direction; if the coordinate difference value of the horizontal coordinate is smaller than the coordinate difference value of the vertical coordinate, selecting the vertical coordinate direction as the path moving direction;
s22: connecting a source satellite node and a target satellite node to determine a straight line, calculating the distance between the ordinate of the satellite node in the path moving direction and the straight line, selecting the satellite node with the shortest distance as a next-hop satellite node, and taking the next-hop satellite node as a new source satellite node;
s23: steps S21-S22 are repeated until the next hop satellite node is the destination satellite node.
Preferably, the process of describing the uncertain parameters of the links in the satellite network by using the membership function comprises the following steps: constructing a membership function of the link transmission delay according to the propagation delay of the data packet between satellite nodes and the tolerance range of the current network to the transmission delay; constructing a membership function of the link packet loss rate according to the packet loss rate standard value of the ideal link and the maximum value of the link packet loss rate; constructing a membership function of the residual broadband of the link according to the available bandwidth of the link; and constructing a link comprehensive evaluation function according to the membership function of the link transmission delay, the membership function of the link packet loss rate and the membership function of the link residual broadband.
Further, the membership function of the link transmission delay is:
wherein Tp ij Representing the transmission delay of a data packet from satellite node i to satellite node j, TD min Representing the minimum transmission delay which can be tolerated by the current network, TD max Indicating the maximum transmission delay that the current network can tolerate.
Further, the membership function of the link packet loss rate is:
wherein L is ij Indicating packet loss rate of link (i, j), L mid Representing the standard value of the packet loss rate of an ideal link, L max Representing the maximum value of the link packet loss rate.
Further, the membership function of the remaining broadband of the link is:
wherein B is ij Representing the available bandwidth of link (i, j), B max Represents the maximum value of the available bandwidth of link (i, j) within the previous Δt time, B min Representing the minimum available bandwidth for the link for the previous Δt time.
Further, the link comprehensive evaluation function is:
min Ls sd
wherein Ls is sd A comprehensive path evaluation value from the source satellite node s to the destination satellite node d; p (s, d) represents the set of paths from the source satellite node s to the destination satellite node d, le ij A path evaluation value between the source satellite node s and the destination satellite node d; d (D) ij Representing transmission delay between satellite nodes i and j, and D represents a path highest delay threshold; b (B) ij Representing the residual bandwidth between satellite nodes i, j, B representing the path minimum available bandwidth threshold; l (L) ij The packet loss rate between satellite nodes i, j is represented, L represents the path highest packet loss rate threshold,representing link transmission delay membership function, +.>Representing the link remaining broadband membership function, +.>And representing a link packet loss rate membership function.
The beneficial effects of the invention are as follows: the invention uses membership function in fuzzy theory to describe the uncertain parameters in satellite network, namely transmission delay, residual bandwidth and packet loss rate; evaluating the comprehensive information of the link according to the transmission delay, the residual bandwidth and the packet loss rate, and establishing a routing model taking the link cost as an optimization target; solving a routing model by adopting a Bresenham linear algorithm and a Dijkstra algorithm, so as to find an optimal path meeting the requirements; the invention considers complex satellite network environment, and searches the path by reducing the search space of the route, thereby improving the route efficiency.
Drawings
FIG. 1 is a flow chart of a routing method based on uncertain link parameters in a low-orbit satellite network according to the present invention;
FIG. 2 is a schematic diagram of an iridium satellite system network model in the present invention;
fig. 3 is a schematic diagram of an inter-satellite link according to the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention provides a routing method based on uncertain link parameters in a low-orbit satellite network, as shown in figure 1, the method comprises the following steps:
s1: acquiring a satellite network topological graph, and selecting a source satellite node and a destination satellite node;
s2: calculating the shortest path between the source satellite node and the destination satellite node by adopting a Bresenham algorithm and marking the shortest path;
s3: judging whether the source satellite node and the destination satellite node are positioned at the same position on the orbit, if so, taking the marked shortest path as an optimal path; otherwise, executing the step S4;
s4: selecting satellite nodes capable of forming a quadrangle around the shortest path according to the position of the source satellite node, the position of the target satellite node and the shortest path;
s5: describing uncertain parameters of links in a satellite network by adopting a membership function;
s6: according to the uncertain parameters, calculating the comprehensive evaluation values of all links in the quadrangle by adopting a Dijkstra algorithm; and selecting a path with the lowest link comprehensive evaluation value as an optimal route according to the link comprehensive evaluation value.
A preferred embodiment of the routing method based on uncertain link parameters in the low-orbit satellite network according to the present invention is as follows:
the invention is suitable for the low orbit satellite LEO network, and preferably, an iridium satellite system is used as a satellite network model. As shown in fig. 2, the iridium satellite system is composed of 66 satellites distributed on 6 polar orbit planes, the orbit height is 780km, and the orbit inclination angle is 86.4 °. In the present system model, each LEO satellite has 4 inter-satellite links, except for the polar region and the absence of inter-orbital inter-satellite links at the reverse gap: an inter-satellite link between two co-orbits and an inter-satellite link between two off-orbits, wherein the inter-satellite link between the co-orbits always exists and the inter-satellite link between the off-orbits moves with the movement of the satellite.
The time variability of the network topology is shielded by adopting a virtual topology strategy, a satellite network topology graph G (V, E) is obtained, wherein V=M×N represents M satellite orbits in a satellite constellation, each orbit has N satellites, E represents a set of inter-satellite links between satellites, and E (i, j) represents the inter-satellite links between nodes i to j, wherein i, j E V.
Calculating the shortest path between the source satellite node and the destination satellite node by adopting a Bresenham algorithm and marking the shortest path; the process of calculating the shortest path is:
calculating a coordinate difference value between a source satellite node and a target satellite node, and marking as follows: Δx=x d -x s And Δy=y d -y s If the |Deltax| is not less than the |Deltay|, selecting the x-axis direction as the path moving direction; otherwise, selecting the y axis as the path moving direction;
connecting a source satellite node and a target satellite node to determine a straight line, calculating the distance between the ordinate of the satellite node in the path moving direction and the straight line, selecting the satellite node with the shortest distance as a next-hop satellite node, and taking the next-hop satellite node as a new source satellite node;
the above-mentioned process is repeatedly executed until the next-hop satellite node is the destination satellite node.
The shortest path between a source satellite node and a destination satellite node is obtained through the steps; judging whether the source satellite node and the destination satellite node are at the same position on the orbit, for example, the first satellite on the first orbit and the first satellite on the second orbit are at the same position on the orbit, or the same satellite on the same orbit is at the same position; if the source satellite node and the destination satellite node are at the same position on the orbit, the marked shortest path is used as the optimal path, otherwise, the following processing is carried out:
selecting satellite nodes capable of forming a quadrangle around the shortest path according to the position of the source satellite node, the position of the target satellite node and the shortest path; as shown in fig. 3, assuming that node 1 is a source satellite node, node 19 is a destination satellite node, and paths 1-5-6-10-14-15-19 are shortest paths obtained by Bresenham's algorithm. Then, it is determined that the quadrangle formed by the selected satellite nodes is the part shown by the rectangular frame in the figure according to the positions of the source satellite node and the destination satellite node.
The membership function in the fuzzy theory is adopted to describe uncertain parameters of links in a satellite network, and the method is specifically described as follows:
constructing a membership function of the link transmission delay according to the propagation delay of the data packet between satellite nodes and the tolerance range of the current network to the transmission delay; the membership function of the link transmission delay is expressed as:
wherein Tp ij Representing the transmission delay of a data packet from satellite node i to satellite node j, TD min Representing the minimum transmission delay which can be tolerated by the current network, TD max Indicating the maximum transmission delay that the current network can tolerate. When Tp ij Less than or equal to TD min When inter-satellite linksIn the disconnected state, the membership degree is 0; when Tp ij Less than or equal to TD max When the membership degree is 1, the current link completely accords with the standard of the optimal link; when Tp ij Less than or equal to TD max At the same time with Tp ij The membership of the transmission delay is lower and lower, i.e. the degree of conforming to the optimal link is lower and lower; when Tp ij Greater than TD max And when the membership is 0, the transmission standard of the optimal link is completely not met.
Constructing a membership function of the link packet loss rate according to the packet loss rate standard value of the ideal link and the maximum value of the link packet loss rate; the membership function of the link packet loss rate is expressed as:
wherein L is ij Indicating packet loss rate of link (i, j), L mid Representing the standard value of the packet loss rate of an ideal link, L max Representing the maximum value of the link packet loss rate. When L ij Less than L mid When the membership is 1, namely the current link accords with the standard of the optimal link; when L ij Greater than L mid And is less than L max At the same time with L ij The membership degree of the packet loss rate is linearly reduced; when L ij Greater than L max And when the membership is 0, the current link completely fails to meet the transmission standard.
Constructing a membership function of the residual broadband of the link according to the available bandwidth of the link; the membership function of the remaining wideband of the link is expressed as:
wherein B is ij Representing the available bandwidth of link (i, j), assuming that the maximum available bandwidth of link (i, j) in the previous Δt time is B max The minimum value of the available bandwidth of the link in the previous delta t time is B min Then the average available bandwidth of link (i, j) isWhen the residual bandwidth B of the link ij Less than B mid At the same time with B ij The increase of (1) means that the membership degree is higher and higher, and the degree conforming to the optimal link is higher and higher; when B is ij Greater than B max And when the membership is 1, namely the current link completely accords with the standard of the optimal link.
Constructing a link comprehensive evaluation function according to the membership function of the link transmission delay, the membership function of the link packet loss rate and the membership function of the link residual broadband; the link comprehensive evaluation function is expressed as:
min Ls sd
wherein Ls is sd A comprehensive path evaluation value from the source satellite node s to the destination satellite node d; p (s, d) represents the set of paths from the source satellite node s to the destination satellite node d, le ij A path evaluation value between the source satellite node s and the destination satellite node d; d (D) ij Representing transmission delay between satellite nodes i and j, and D represents a path highest delay threshold; b (B) ij Representing the space between satellite nodes i, jResidual bandwidth, B, represents the path's lowest available bandwidth threshold; l (L) ij The packet loss rate between satellite nodes i, j is represented, L represents the path highest packet loss rate threshold,representing link transmission delay membership function, +.>Representing the link remaining broadband membership function, +.>And representing a link packet loss rate membership function.
According to the uncertain parameters, calculating the comprehensive evaluation values of all links in the quadrangle by adopting a Dijkstra algorithm; and selecting a path with the lowest link comprehensive evaluation value as an optimal route according to the link comprehensive evaluation value.
The invention adopts membership functions in the fuzzy theory to describe uncertain link parameters such as transmission delay, residual bandwidth, packet loss rate and the like in a satellite network respectively; then, according to the ideal point theory, the comprehensive information of the link is evaluated according to the 'approach' degree between the current information of the link and the membership function of the ideal point, and a satellite network model based on the link cost is established; solving a routing model by adopting a Bresenham linear algorithm and a Dijkstra algorithm, so as to find an optimal path meeting the requirements; the invention considers complex satellite network environment, and searches the path by reducing the search space of the route, thereby improving the route efficiency.
While the foregoing is directed to embodiments, aspects and advantages of the present invention, other and further details of the invention may be had by the foregoing description, it will be understood that the foregoing embodiments are merely exemplary of the invention, and that any changes, substitutions, alterations, etc. which may be made herein without departing from the spirit and principles of the invention.

Claims (2)

1. A method of routing in a low-orbit satellite network based on uncertain link parameters, comprising:
s1: acquiring a satellite network topological graph, and selecting a source satellite node and a destination satellite node;
s2: calculating the shortest path between the source satellite node and the destination satellite node by adopting a Bresenham algorithm and marking the shortest path;
s3: judging whether the source satellite node and the destination satellite node are positioned at the same position on the orbit, if so, taking the marked shortest path as an optimal path; otherwise, executing the step S4;
s4: selecting satellite nodes capable of forming a quadrangle around the shortest path according to the position of the source satellite node, the position of the target satellite node and the shortest path;
s5: describing uncertain parameters of links in a satellite network by adopting a membership function; comprising the following steps:
constructing a membership function of the link transmission delay according to the transmission delay of the data packet between satellite nodes and the tolerance range of the current network to the transmission delay; constructing a membership function of the link packet loss rate according to the packet loss rate standard value of the ideal link and the maximum value of the link packet loss rate; constructing a membership function of the residual broadband of the link according to the available bandwidth of the link; constructing a link comprehensive evaluation function according to the membership function of the link transmission delay, the membership function of the link packet loss rate and the membership function of the link residual broadband;
the membership function of the link transmission delay is:
wherein Tp ij Representing the transmission delay of a data packet from satellite node i to satellite node j, TD min Representing the minimum transmission delay which can be tolerated by the current network, TD max Representing the maximum transmission delay which can be tolerated by the current network;
the membership function of the link packet loss rate is:
wherein L is ij Indicating packet loss rate of link (i, j), L mid Representing the standard value of the packet loss rate of an ideal link, L max Representing the maximum value of the link packet loss rate;
the membership function of the remaining wideband of the link is:
wherein B is ij Representing the available bandwidth of link (i, j), B max Represents the maximum value of the available bandwidth of link (i, j) within the previous Δt time, B min Representing the minimum available bandwidth for the link for the previous Δt time;
the comprehensive evaluation function of the link is as follows:
min Ls sd
wherein Ls is sd A comprehensive path evaluation value from the source satellite node s to the destination satellite node d; p (s, d) represents the set of paths from the source satellite node s to the destination satellite node d, le ij A path evaluation value between the source satellite node s and the destination satellite node d; d (D) ij Representing transmission delay between satellite nodes i and j, and D represents a path highest delay threshold; b represents the path lowest available bandwidth threshold; l represents the path highest packet loss rate threshold,representing link transmission delay membership function, +.>Representing the link remaining broadband membership function, +.>Representing a link packet loss rate membership function;
s6: according to the uncertain parameters, calculating the comprehensive evaluation values of all links in the quadrangle by adopting a Dijkstra algorithm; and selecting a path with the lowest link comprehensive evaluation value as an optimal route according to the link comprehensive evaluation value.
2. The method of claim 1, wherein the step of calculating the shortest path between the source satellite node and the destination satellite node using Bresenham's algorithm comprises:
s21: calculating a coordinate difference value between a source satellite node and a target satellite node, and if the coordinate difference value of the abscissa is larger than the coordinate difference value of the ordinate, selecting the abscissa direction as a path moving direction; if the coordinate difference value of the horizontal coordinate is smaller than the coordinate difference value of the vertical coordinate, selecting the vertical coordinate direction as the path moving direction;
s22: connecting a source satellite node and a target satellite node to determine a straight line, calculating the distance between the ordinate of the satellite node in the path moving direction and the straight line, selecting the satellite node with the shortest distance as a next-hop satellite node, and taking the next-hop satellite node as a new source satellite node;
s23: steps S21-S22 are repeated until the next hop satellite node is the destination satellite node.
CN202210260192.4A 2022-03-16 2022-03-16 Routing method based on uncertain link parameters in low-orbit satellite network Active CN114640621B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210260192.4A CN114640621B (en) 2022-03-16 2022-03-16 Routing method based on uncertain link parameters in low-orbit satellite network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210260192.4A CN114640621B (en) 2022-03-16 2022-03-16 Routing method based on uncertain link parameters in low-orbit satellite network

Publications (2)

Publication Number Publication Date
CN114640621A CN114640621A (en) 2022-06-17
CN114640621B true CN114640621B (en) 2023-10-13

Family

ID=81949606

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210260192.4A Active CN114640621B (en) 2022-03-16 2022-03-16 Routing method based on uncertain link parameters in low-orbit satellite network

Country Status (1)

Country Link
CN (1) CN114640621B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115361049B (en) * 2022-07-04 2024-05-17 西安电子科技大学 Routing method and device based on direction constraint and electronic equipment

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1006678A1 (en) * 1998-12-04 2000-06-07 ICO Services Ltd. Communications apparatus and method in satellite system for interference mitigation using user and interferer position
CN105119823A (en) * 2015-08-21 2015-12-02 北京空间飞行器总体设计部 NGEO satellite routing algorithm based on fuzzy theory
CN106792961A (en) * 2016-11-18 2017-05-31 华东师范大学 A kind of double-deck topology method based on satellite communication network design
CN110336751A (en) * 2019-07-26 2019-10-15 南京邮电大学 Low-track satellite network routing policy based on membership function
CN111246532A (en) * 2020-01-09 2020-06-05 南京凯瑞得信息科技有限公司 System and method for selecting communication mode of deep sea integration networking
CN112566142A (en) * 2020-12-02 2021-03-26 电子科技大学 QoS guarantee-based LEO satellite network reliability routing method
CN113055079A (en) * 2021-03-12 2021-06-29 重庆邮电大学 Fuzzy logic-based routing method in low-earth-orbit satellite network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030157934A1 (en) * 2002-02-01 2003-08-21 Qilian Liang Method, system, device and computer program product for bandwidth utilization and signal strength-based handover initiation in a wireless communications network

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1006678A1 (en) * 1998-12-04 2000-06-07 ICO Services Ltd. Communications apparatus and method in satellite system for interference mitigation using user and interferer position
CN105119823A (en) * 2015-08-21 2015-12-02 北京空间飞行器总体设计部 NGEO satellite routing algorithm based on fuzzy theory
CN106792961A (en) * 2016-11-18 2017-05-31 华东师范大学 A kind of double-deck topology method based on satellite communication network design
CN110336751A (en) * 2019-07-26 2019-10-15 南京邮电大学 Low-track satellite network routing policy based on membership function
CN111246532A (en) * 2020-01-09 2020-06-05 南京凯瑞得信息科技有限公司 System and method for selecting communication mode of deep sea integration networking
CN112566142A (en) * 2020-12-02 2021-03-26 电子科技大学 QoS guarantee-based LEO satellite network reliability routing method
CN113055079A (en) * 2021-03-12 2021-06-29 重庆邮电大学 Fuzzy logic-based routing method in low-earth-orbit satellite network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"基于不确定链路参数的卫星网络路由算法";周剑;《系统工程与电子技术》;全文 *
Shang Mengqi."Fuzzy-based analysis of thermal effects on component failure for LEO satellites".《2021 IEEE 2nd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE)》.2021,全文. *
基于模糊逻辑的GEO多波束卫星移动通信系统切换策略研究;王继业;喻火根;;通信技术(第10期);全文 *
柏倩."基于不确定理论的卫星网络负载均衡路由策略研究".《中国优秀硕士学位论文全文数据库信息科技辑》.2021,全文. *

Also Published As

Publication number Publication date
CN114640621A (en) 2022-06-17

Similar Documents

Publication Publication Date Title
Darehshoorzadeh et al. Underwater sensor networks: A new challenge for opportunistic routing protocols
CN111953399B (en) Inter-satellite routing method in low-earth-orbit satellite communication network
CN110391983B (en) Distributed congestion avoidance routing algorithm for satellite-ground integrated network
CN109005108B (en) Space network route planning method and system
CN106054875B (en) A kind of distributed robots dynamic network connectivity control method
CN113315569B (en) Satellite reliability routing method and system with weighted link survival time
CN114640621B (en) Routing method based on uncertain link parameters in low-orbit satellite network
CN109586966B (en) Unmanned system network topology connectivity recovery method and system
CN110161861B (en) Aircraft ad hoc network routing decision method and device based on fuzzy neural network
CN112600609A (en) Network capacity estimation method of satellite network system
CN107276663B (en) Satellite network snapshot route optimization method
CN110932969B (en) Advanced metering system AMI network anti-interference attack routing algorithm for smart grid
Peng et al. FNTAR: A future network topology-aware routing protocol in UAV networks
CN113258982A (en) Satellite information transmission method, device, equipment, medium and product
Choudhary et al. Dynamic topology control algorithm for node deployment in mobile underwater wireless sensor networks
CN115087064A (en) Cross-domain high-availability routing method and system for measurement and control communication access network
Ouyang et al. Network Coding-Based Multi-Path Transmission for LEO Satellite Networks With Domain Cluster
CN109819496A (en) A kind of marine more mobile heterogeneous platform short-distance networking methods
CN110519820B (en) Routing method applied to cluster unmanned aerial vehicle communication
Banaei et al. On asymptotic statistics for geometric routing schemes in wireless ad hoc networks
Gnawali et al. Data centric, position-based routing in space networks
Soatti et al. Weighted consensus algorithms for distributed localization in cooperative wireless networks
CN115297045B (en) Low-orbit satellite network-oriented flooding topology construction method, device and storage medium
CN106506361A (en) A kind of underwater sound sensing network routing algorithm and system using mediation potential field
CN110972206B (en) Multi-hop routing method for realizing routing path of 5G Internet of things network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant