CN113825199A - Satellite network distributed multi-path routing method and system based on ant colony algorithm - Google Patents
Satellite network distributed multi-path routing method and system based on ant colony algorithm Download PDFInfo
- Publication number
- CN113825199A CN113825199A CN202111167817.4A CN202111167817A CN113825199A CN 113825199 A CN113825199 A CN 113825199A CN 202111167817 A CN202111167817 A CN 202111167817A CN 113825199 A CN113825199 A CN 113825199A
- Authority
- CN
- China
- Prior art keywords
- ant
- message
- ant message
- node
- satellite
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/34—Modification of an existing route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/06—Airborne or Satellite Networks
Abstract
The invention discloses a satellite network distributed multi-path routing method and a system based on an ant colony algorithm, wherein the method comprises the following steps: a source satellite node periodically sends a forward Ant message to a destination node, the forward Ant message calculates the probability through an pheromone table, and a next route is selected in a roulette mode; until the forward Ant message reaches a destination address, converting the forward Ant message into a reverse Ant message; the reverse Ant message returns to the source node using the original path and leaves the pheromone along the way. The system is used for implementing the method. The method has the advantages of simple principle, strong applicability, capability of improving routing efficiency and capability and the like.
Description
Technical Field
The invention mainly relates to the technical field of satellite networks, in particular to a satellite network distributed multi-path routing method and system based on an ant colony algorithm.
Background
The satellite network can provide wide geographic coverage and consistent service level, and plays an increasingly important role in the aspect of NGN (next generation network) and the like, especially in the aspect of air-ground integrated information network in the future. In these future networks, as a core framework, satellites connect heterogeneous networks to each other. Many satellites must have inter-satellite links (ISLs). In many constellations, the ISL provides a communication link for the satellite. In order to transmit information reliably and accurately, a feasible and robust routing strategy is needed. Satellite network routing issues have been a very challenging issue due to the mobility and periodicity of the satellite network topology.
Some definitions of current satellite network scenarios: the low earth orbit satellite network model comprises a plurality of orbital planes, each orbital plane has a certain number of LEO low earth orbit satellites, and the earth orbit satellites in the orbits are connected end to end. Each satellite has four ISLs and enables it to communicate with the two nearest inter-and intra-orbital neighbors. A unified space-based network is established to which ground stations can connect to transmit multimedia network messages.
In order to perform efficient routing over a satellite network, a number of routing algorithms have been proposed by practitioners.
One class of schemes is to adopt a connection-oriented network structure, and the dynamic routing problem is staticized by a discrete time network model. Within each equal length interval, the satellite network topology is divided into a series of fixed slices, on which a terrestrial routing algorithm can be applied. However, since the above algorithms only use static and predictive information about the constellation, they can hardly track changes in network traffic due to poor adaptability.
A class of distributed routing algorithms (DDR: distributed datagram routing) is used to solve I P and LEO satellite network combination problems. In order to minimize packet delay, in this algorithm each satellite is represented by discrete geographical coordinates and a routing strategy is implemented separately. However, the DDR algorithm has the disadvantage of poor robustness, and if the satellite node or the isl crashes, its performance will drop dramatically.
Practitioners have developed the concept of IRSN (Internet routing over satellite network) and analyzed the theoretical framework of the combination of Internet and LEO satellite networks. In the IRSN algorithm, IP routing is implemented only in ingress and egress nodes, whereas a conventional satellite routing algorithm is used in internal nodes. However, the optimization of the transmission efficiency in the CARP (constellation address resolution protocol) to the network performance cannot be utilized.
Currently, most routing strategies employ a single path for transmitting data. While the study of single-path routing strategies is relatively mature, in practice, single-path routing typically employs a greedy mechanism and assumes that links are independent. The greedy mechanism will cause network performance degradation when network resources are limited. Compared with a single-path route, the multi-path route has stronger fault-tolerant capability and load balancing capability. For LEO satellite networks, multipath routing may improve ISL survivability and improve link utilization. Also, multipath routing can provide aggregate bandwidth to accommodate more traffic. With the development of network technology, single-path routing becomes ineffective due to the complexity of time and space and the simultaneous facing combinatorial optimization problem. For the multipath routing problem, the architecture is the first problem to solve. Many scholars are concerned with Evolutionary Algorithms (EAs), which provide a natural architecture for multipath routing.
The network routing problem is actually a complex optimization problem. In the past 60 years, great attention has been paid to the process of simulating biological evolution in order to develop an effective solution to the optimization problem. EA is a heuristic algorithm based on the above theory. Cluster intelligence is a novel bionic evolution algorithm, becomes an emerging research frontier and has a history of more than twenty years. A social insect population can be viewed as a distributed system. While each individual is very simple, the entire system, consisting of many individuals, represents a clustered intelligence with highly structured populations. In the system, an individual works in conjunction with other individuals. All individuals collectively perform complex tasks as a whole, which is a task that is difficult for a single individual to accomplish. There are two main areas of research: ant Colony Optimization (ACO) and particle swarm optimization. At present, the group intelligent algorithm has wide application prospect in the fields of combination optimization, network routing, data mining, wireless sensor networks and the like.
ACOs are inspired by the foraging behavior of the ant colony. Social insects such as ants, although not having a view, can find the shortest path from the nest to the food. Through a large number of experiments, scientists have found ants to work with other ants and accomplish complex tasks through pheromones. The collective behavior of the ant colony shows positive feedback: the more ants pass through a path, the more pheromones remain, and ants tend to select a path with more pheromones. Later ants reinforce the pheromone left by previous ants, and eventually all ants focus on the shortest path.
The application of ACO in network routing is reasonably feasible, and the ant searching method from nest to food is similar to the data searching path from source to destination node. The isomorphism of these two processes allows the ant colony exploration and decision system to be used for network routing. Mobile agents (e.g., ants) in an ACO migrate from one node to a neighboring node between a source node and a target node in the network and search for feasible paths and other useful information. The pheromone table storing each pheromone variable shows the state of all paths in the network. The data routing table converted from the pheromone table is responsible for data transmission according to some modified selection policy. Although the use of ACOs in network routing has many advantages, there are some unresolved problems with using ACOs in satellite networks.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: aiming at the technical problems in the prior art, the invention provides the satellite network distributed multi-path routing method and system based on the ant colony algorithm, which have the advantages of simple principle, strong applicability and capability of improving the routing efficiency and capability.
In order to solve the technical problems, the invention adopts the following technical scheme:
a satellite network distributed multi-path routing method based on an ant colony algorithm comprises the following steps:
a source satellite node periodically sends a forward Ant message to a destination node, the forward Ant message calculates the probability through an pheromone table, and a next route is selected in a roulette mode;
until the forward Ant message reaches a destination address, converting the forward Ant message into a reverse Ant message;
the reverse Ant message returns to the source node using the original path and leaves the pheromone along the way.
As a further improvement of the process of the invention: when the reverse Ant message returns to the source node, the reverse Ant message is destroyed in the network; each reverse Ant message has the longest survival time, and when the longest survival time is exceeded, the reverse Ant message is automatically destroyed.
As a further improvement of the process of the invention: and all the satellite nodes maintain the pheromone table, periodically perform attenuation processing and update the routing table according to the pheromone table.
As a further improvement of the process of the invention: each source satellite node s periodically sends a forward Ant message to a specific target node d at a specified time interval t; for the forward Ant message
Represents, where k is an Ant message identifier; the forward Ant message comprises the path information of the Ant message passing through
When sending an Ant message
Only the source satellite node s.
As a further improvement of the process of the invention: the satellite node v calculates the transition probability according to the pheromone table
Neighbor N from satellite node in roulettevThe next hop is selected, the next hop information is added to the path information in the forward Ant message, and the forward Ant message is forwarded to the selected neighbor.
As a further improvement of the process of the invention: in the forwarding process, the path information in the forward Ant message simultaneously serves as a tabu table, and the satellite which passes by is not selected when the next satellite is selected.
As a further improvement of the process of the invention: the forward Ant message simulates data packet forwarding, the forward Ant message has a priority queue same as the data packet, and the forward Ant message moves from a source node to a destination node hop by hop.
As a further improvement of the process of the invention: when the satellite node d is used as a destination node to receive the forward Ant message
It is converted into a reverse Ant message
And follows the path with the forward Ant message
Moving in the opposite direction, returning to the source node s, and leaving the pheromone along the way; and the priority queue used by the reverse Ant message is higher than the data packet.
As a further improvement of the process of the invention: and when the reverse Ant message returns to the previous hop, detecting whether the path before the previous hop has a neighbor node or not, and if so, directly sending the path to the neighbor satellite node at the forefront of the path.
The invention further provides a satellite network distributed multi-path routing system based on the ant colony algorithm, which comprises:
the pheromone processing module is used for managing the pheromone list, calculating the probability according to the pheromone list and updating the routing list;
an Ant message generating module, which is used for generating an Ant message;
an Ant message processing module, which is used for processing and sending an Ant message;
a source satellite node periodically sends a forward Ant message to a destination node, the forward Ant message calculates the probability through an pheromone table, and the forward Ant message is converted into a reverse Ant message after reaching a destination address; the reverse Ant message returns to the source node using the original path and leaves the pheromone along the way.
As a further improvement of the invention:
compared with the prior art, the invention has the advantages that:
the satellite network distributed multi-path routing method and system based on the ant colony algorithm have the advantages of simple principle, strong applicability and capability of improving the routing efficiency and the routing capability. The multi-path routing design enables the network to have stronger fault-tolerant capability and load balancing advantages, and the distributed algorithm design can effectively accelerate the network convergence efficiency. In the invention, the forward Ant message path search and the reverse Ant message left pheromone can ensure the validity of the path. The probability calculation method based on the pheromone and the heuristic factor can enable the algorithm to adapt to different specific satellite network scenes more in need. Compared with the traditional routing algorithm, the method has better end-to-end delay and can track the fast changing topology of the LEO satellite network.
Drawings
Fig. 1 is a schematic diagram of a routing system of the present invention.
Fig. 2 is a schematic diagram of a processing flow of the forward Ant packet policy at the satellite node in a specific application example of the routing method of the present invention.
Fig. 3 is a schematic view of a processing flow of a reverse Ant packet policy at a satellite node in a specific application example of the routing method of the present invention.
Fig. 4 is a schematic diagram of a path optimization strategy of a reverse Ant packet in a specific application example of the routing method of the present invention.
Detailed Description
The invention will be described in further detail below with reference to the drawings and specific examples.
As shown in fig. 1-4, the Ant colony algorithm-based satellite network distributed multi-path routing method of the present invention uses a detection message called Ant message for path search, where the Ant message has two forms, namely a forward Ant message and a reverse Ant message; the method comprises the following steps:
a source satellite node periodically sends a forward Ant message to a destination node, the forward Ant message calculates the probability through an pheromone table, and a next route is selected in a roulette mode;
until the forward Ant message reaches a destination address, converting the forward Ant message into a reverse Ant message;
the reverse Ant message returns to the source node using the original path and leaves the pheromone along the way.
In the process, the probability of selecting the next hop is calculated according to the pheromone amount and the heuristic factor on the satellite, and then the next hop satellite node is selected by using a roulette method. The probability is determined by the pheromone quantity and the heuristic factor on the satellite, and the influence of the pheromone quantity and the heuristic factor on the probability can be adjusted by setting the importance degree parameters of the pheromone quantity and the heuristic factor, so that the individualized requirements of different specific satellite network scenes are adapted.
In the process, the invention adopts a probability calculation method to calculate the next hop probability so as to generate a multi-route table, and updates the route table when receiving the reverse Ant message and when the pheromone is attenuated. The routing table selects one or more neighbors with the maximum probability as the next hop of the routing table, and sets the metric value of the multi-routing table according to the size proportion of the selection probability.
In a specific application example, predictability and periodicity of satellite network topology are advantageous factors that must be considered in satellite routing. If predictable satellite handoff occurs, it can be predicted from ephemeris. The invention can prevent the queue in the satellite node from increasing by using the routing table updating strategy according to the ephemeris switching rule.
As a preferred embodiment, all the satellite nodes maintain the pheromone table, periodically perform attenuation processing, and update the routing table according to the pheromone table.
As a preferred embodiment, in view of the predictability of the satellite network topology, an additional control strategy is introduced that updates the routing table when a known handover occurs. The routing table closely tracks the dynamic topology of the satellite network.
By adopting the scheme of the invention, the influence caused by satellite switching can be minimized.
In a specific application example, firstly, the method initializes the pheromone, and each satellite node s maintains an pheromone table to a target node d; starting with each neighbor satellite i ∈ NsThe amount of pheromone(s) in (b) is all equal,
in a specific application example, each source satellite node s periodically sends a forward Ant message to a specific target node d at a specified time interval t; for the forward Ant message
Represents, where k is an Ant message identifier; the forward Ant message comprises the path information of the Ant message passing through
When sending an Ant message
Only the source satellite node s.
In a specific application example, the forward Ant message simulates forwarding of a data packet, the forward Ant message has a priority queue same as that of the data packet, and the forward Ant message moves from a source node to a destination node hop by hop.
In a specific application example, the satellite node v calculates the transition probability according to the pheromone table
Neighbor N from satellite node in roulettevThe next hop is selected, the next hop information is added to the path information in the forward Ant message, and the forward Ant message is forwarded to the selected neighbor.
In a specific application example, in the forwarding process (moving process) described above, the path information in the forward Ant message also serves as a tabu table, and the satellite that has already passed through is not selected when the next one is selected.
In a specific application example, the probability
The calculation formula of (a) is as follows:
wherein eta isvd(i) Is a heuristic factor which reflects the heuristic degree of selecting the satellite node i from the satellite node v to the next hop of the forward Ant message of the satellite node d, alpha represents the relative importance degree of the pheromone, beta represents the relative importance degree of the heuristic factor,
the larger the value is, the higher the possibility of the path taken before the forward Ant message is selected is, the convergence speed of the algorithm can be accelerated, but the randomness of the path search is reduced, the search range is reduced, and the local optimum is easy to be trapped.
In the specific application example, when the satellite node d is used as a destination node to receive the forward Ant message
It is converted into a reverse Ant message
And follows the path with the forward Ant message
Moving in the opposite direction, returning to the source node s, and leaving the pheromone along the way; wherein the priority queue used by the reverse Ant messageColumns are higher than packets.
When the satellite node v receives the reverse Ant message from the neighbor satellite node
And forwarding the message to the 'last hop' on the Ant message forward path, and updating the pheromone table.
In a specific application example, the update rule is as follows:
wherein, tauvd(i) Representing the amount of information that node v passes through neighbor i to destination node d,
indicating a reverse Ant message
The amount of pheromone remaining, Q being constant, CkFor the Ant message path length
In a specific application example, when the reverse Ant packet returns to the "previous hop", it needs to be noticed that the forward Ant packet cannot guarantee that the forward Ant packet is a shortest path, and when the packet returns to the "previous hop", it needs to detect whether there is a neighboring node in a path before the "previous hop", and if there is a neighboring node, the forward Ant packet directly goes to a neighboring satellite node at the forefront of the path, as shown in fig. 2, so that it can be guaranteed that the forward Ant packet is a relative shortest path.
In a specific application example, all the satellite nodes v also periodically update the pheromone table at a specified time interval t, and the update rule is as follows:
τvd(i)＝(1-ρ)·τvd(i)，i∈Nv
wherein ρ represents the evaporation rate of pheromones, the value range is [0, 1], the smaller the ρ value is, the more pheromones are left on the path, which results in that the invalid path can be continuously searched, the convergence rate of the algorithm is influenced, the larger the ρ value is, the invalid path can be effectively eliminated, but the effective path cannot be ensured not to be abandoned for searching. In a satellite network, the network topology changes frequently, and invalid paths are easily generated, which requires a large p value to be used.
In the specific application example, once the reverse Ant message is sent
Returning to its source node s, they will be destroyed in the network. Each reverse Ant packet has the longest Time To Live (TTL), and if the reverse Ant packets exceed the TTL, they are also automatically destroyed.
The above is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above-mentioned embodiments, and all technical solutions belonging to the idea of the present invention belong to the protection scope of the present invention. It should be noted that modifications and embellishments within the scope of the invention may be made by those skilled in the art without departing from the principle of the invention.
Claims (10)
1. A satellite network distributed multi-path routing method based on an ant colony algorithm is characterized by comprising the following steps:
a source satellite node periodically sends a forward Ant message to a destination node, the forward Ant message calculates the probability through an pheromone table, and a next route is selected in a roulette mode;
until the forward Ant message reaches a destination address, converting the forward Ant message into a reverse Ant message;
the reverse Ant message returns to the source node using the original path and leaves the pheromone along the way.
2. The Ant colony algorithm-based satellite network distributed multi-path routing method according to claim 1, wherein when a reverse Ant message returns to its source node, the reverse Ant message will be destroyed in the network; each reverse Ant message has the longest survival time, and when the longest survival time is exceeded, the reverse Ant message is automatically destroyed.
3. The ant colony algorithm-based satellite network distributed multi-path routing method as claimed in claim 1, wherein all satellite nodes maintain an pheromone table, periodically perform attenuation processing, and update the routing table according to the pheromone table.
4. The Ant colony algorithm-based satellite network distributed multi-path routing method as claimed in any one of claims 1 to 3, wherein each source satellite node s periodically sends a forward Ant message to a specific target node d at a specified time interval t; for the forward Ant message
Represents, where k is an Ant message identifier; the forward Ant message comprises the path information of the Ant message passing through
When sending an Ant message
Only the source satellite node s.
5. The ant colony algorithm-based satellite network distributed multi-path routing method as claimed in claim 4, wherein the satellite nodes v calculate transition probabilities according to an pheromone table
Neighbor N from satellite node in roulettevThe next hop is selected, the next hop information is added to the path information in the forward Ant message, and the forward Ant message is forwarded to the selected neighbor.
6. The Ant colony algorithm-based satellite network distributed multi-path routing method as claimed in claim 5, wherein in the forwarding process, the path information in the forward Ant message simultaneously serves as a tabu table, and a satellite which passes by is not selected when the next satellite is selected.
7. The Ant colony algorithm-based satellite network distributed multi-path routing method according to any one of claims 1-3, wherein the forward Ant message simulates packet forwarding, the forward Ant message has the same priority queue as the data packet, and the forward Ant message moves hop by hop from a source node to a destination node.
8. The Ant colony algorithm-based satellite network distributed multi-path routing method as claimed in any one of claims 1 to 3, wherein when a satellite node d is used as a destination node to receive a forward Ant message
It is converted into a reverse Ant message
And follows the path with the forward Ant message
Moving in the opposite direction, returning to the source node s, and leaving the pheromone along the way; and the priority queue used by the reverse Ant message is higher than the data packet.
9. The Ant colony algorithm-based satellite network distributed multi-path routing method as claimed in any one of claims 1 to 3, wherein when the reverse Ant message returns to the "previous hop", the existence of the neighbor node in the path before the "previous hop" is detected, and if so, the neighbor node is directly reached to the neighbor satellite node at the forefront of the path.
10. A satellite network distributed multi-path routing system based on an ant colony algorithm is characterized by comprising:
the pheromone processing module is used for managing the pheromone list, calculating the probability according to the pheromone list and updating the routing list;
an Ant message generating module, which is used for generating an Ant message;
an Ant message processing module, which is used for processing and sending an Ant message;
a source satellite node periodically sends a forward Ant message to a destination node, the forward Ant message calculates the probability through an pheromone table, and the forward Ant message is converted into a reverse Ant message after reaching a destination address; the reverse Ant message returns to the source node using the original path and leaves the pheromone along the way.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111167817.4A CN113825199A (en) | 2021-09-29 | 2021-09-29 | Satellite network distributed multi-path routing method and system based on ant colony algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111167817.4A CN113825199A (en) | 2021-09-29 | 2021-09-29 | Satellite network distributed multi-path routing method and system based on ant colony algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113825199A true CN113825199A (en) | 2021-12-21 |
Family
ID=78920141
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111167817.4A Pending CN113825199A (en) | 2021-09-29 | 2021-09-29 | Satellite network distributed multi-path routing method and system based on ant colony algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113825199A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN101459914A (en) * | 2008-12-31 | 2009-06-17 | 中山大学 | Wireless sensor network node coverage optimization method based on ant colony algorithm |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
| CN103634842A (en) * | 2013-12-20 | 2014-03-12 | 大连大学 | Inter-group routing method for distributed satellite network |
| CN112333109A (en) * | 2020-11-17 | 2021-02-05 | 重庆邮电大学 | Ant colony optimization-based load balancing routing method in low-orbit satellite network |
-
2021
- 2021-09-29 CN CN202111167817.4A patent/CN113825199A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN101459914A (en) * | 2008-12-31 | 2009-06-17 | 中山大学 | Wireless sensor network node coverage optimization method based on ant colony algorithm |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
| CN103634842A (en) * | 2013-12-20 | 2014-03-12 | 大连大学 | Inter-group routing method for distributed satellite network |
| CN112333109A (en) * | 2020-11-17 | 2021-02-05 | 重庆邮电大学 | Ant colony optimization-based load balancing routing method in low-orbit satellite network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rao et al. | Agent-based load balancing routing for LEO satellite networks | |
| Chen et al. | A routing protocol for hierarchical LEO/MEO satellite IP networks | |
| Jianjun et al. | Compact explicit multi-path routing for LEO satellite networks | |
| Sarkohaki et al. | An efficient routing protocol in mobile ad-hoc networks by using artificial immune system | |
| Basagni et al. | Dynamic source routing for ad hoc networks using the global positioning system | |
| Malhotra et al. | A comprehensive review on recent advancements in routing protocols for flying ad hoc networks | |
| Dong et al. | Load balancing routing algorithm based on extended link states in LEO constellation network | |
| Lu et al. | A survivable routing protocol for two-layered LEO/MEO satellite networks | |
| Liu et al. | Routing for predictable multi-layered satellite networks | |
| Rao et al. | Agent-based multi-service routing for polar-orbit LEO broadband satellite networks | |
| Long et al. | A novel routing algorithm based on multi-objective optimization for satellite networks | |
| Hua et al. | A DTN routing protocol based on hierarchy forwarding and cluster control | |
| CN113825199A (en) | Satellite network distributed multi-path routing method and system based on ant colony algorithm | |
| Yuan-Yuan et al. | Ant routing algorithm for mobile ad-hoc networks based on adaptive improvement | |
| Jalade et al. | Adaptive deep Runge Kutta Garson’s network with node disjoint local repair protocol based multipath routing in MANET | |
| Guo et al. | Delay-cognizant reliable delivery for publish/subscribe overlay networks | |
| Janacik et al. | A survey of ant colony optimization-based approaches to routing in computer networks | |
| Soares et al. | Cooperation in DTN‐Based Network Architectures | |
| Li et al. | A back-tracing partition based on-path caching distribution strategy over integrated LEO satellite and terrestrial networks | |
| Shen et al. | A dynamic modified routing strategy based on load balancing in LEO satellite network | |
| Soyturk et al. | Reliable real-time data acquisition for rapidly deployable mission-critical wireless sensor networks | |
| Aissani et al. | Oriented void avoidance scheme for real-time routing protocols in wireless sensor networks | |
| Yan et al. | SRADR: Network status and reputation adaptive QoS dynamic routing for satellite networks | |
| Lv | An energy efficient routing based on swarm intelligence for wireless sensor networks. | |
| Liu et al. | Routing for predictable leo/meo multi-layered satellite networks |
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 |