CN104243310A - Time evolution diagram routing algorithm based on multi-performance self-adaption pairing heap - Google Patents
Time evolution diagram routing algorithm based on multi-performance self-adaption pairing heap Download PDFInfo
- Publication number
- CN104243310A CN104243310A CN201410429748.3A CN201410429748A CN104243310A CN 104243310 A CN104243310 A CN 104243310A CN 201410429748 A CN201410429748 A CN 201410429748A CN 104243310 A CN104243310 A CN 104243310A
- Authority
- CN
- China
- Prior art keywords
- heap
- node
- pairing
- time
- 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
Classifications
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE 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/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Radio Relay Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a time evolution diagram routing algorithm based on a multi-performance self-adaption pairing heap, and belongs to the technical field of satellite network routing. The time evolution diagram routing algorithm is mainly technically characterized by including the steps of establishing a medium-earth orbit satellite network system which conducts communication in different time slots according to a communication time slot table, establishing a time evolution diagram model of the medium-earth orbit satellite network system according to the communication time slot table of 24 satellites, optimizing the data storage structure of a Dijkstra shortest path algorithm through the multi-performance self-adaption pairing heap, and calculating the optimal routing in the time evolution diagram model through the optimized Dijkstra shortest path algorithm. The data structure of the time evolution diagram routing algorithm is optimized, the multi-performance self-adaption pairing heap is adopted in the time evolution diagram routing algorithm, the algorithm is applied to the medium-earth orbit satellite network system which conducts communication in different time slots, and therefore the network performance index is higher than network performance indexes of other traditional routing algorithms, and the time complexity is remarkably lowered.
Description
Technical field
The invention belongs to satellite network route technology field, especially a kind of temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap.
Background technology
In recent years, along with developing rapidly of satellite network, communication satellite is widely used in every field, such as military affairs, navigation, location, weather forecast, live telecast etc.Satellite network system can be divided into three kinds according to different orbit altitudes, i.e. low orbit (LEO), middle orbit (MEO) and high orbit (GEO) satellite network system.
The limited coverage area of single LEO satellite, and exist between satellite and user and switch problem too frequently.Also there are some fatal defects in GEO satellite, such as long distance causes time delay excessive, and track resources is rare, communication restriction and huge signal fadeout.Based on above reason, MEO satellite can as the compromise selection of GEO satellite and LEO satellite.Compared to GEO satellite system, the loss of MEO satellite system is less, and propagation delay is about 1/4th of GEO, and compared to LEO satellite system, the translational speed of MEO is comparatively slow, and due to its coverage comparatively large, the number of satellite required for MEO constellation is less.Therefore, to a certain extent, MEO satellite network system overcomes the shortcoming of GEO and LEO satellite network system, meanwhile, its service performance, service life, propagation delay time, technology and implement general plan, system complexity and overhead all can control within the scope of a suitable acceptable.As everyone knows, route occupies very important status in such dynamic topology communication network.But the routing algorithm being directed to MEO satellite network now still lacks very much.
MEO satellite network changes in time, and when node motion, its topological structure changes thereupon.Be directed to individual layer satellite network, existing routing algorithm roughly can be divided into two large classes: virtual topology routing algorithm and dummy node routing algorithm.For virtual topology routing algorithm, the running time of satellite network is divided into several time slots, and its topology is counted as changeless in each time slot, but the non-constant of the adaptability of this algorithm to real-time change, such as link congestion or node failure, worse, huge number of satellite makes routing table very large and computing time is high.For dummy node routing algorithm, the physical topology of the earth is covered by the logical topology that dummy node forms, its user density height is uneven, and a current satellite for service that provides of regional bone can not provide one well to cover, the mapping between dummy node and real satellite node does not seem so simple.Consider the feature of above-mentioned problem and the MEO satellite network system based on time-division slot communication, traditional virtual topology and dummy node routing algorithm are inapplicable.They can not meet the communication requirement of the MEO satellite network system set up in the present invention.
In a lot of scientific domain, figure theory has good application, especially in the network route of analysis and design fixed topology.In addition, temporal evolution figure also can capture the evolutionary process of relation between entity figure naturally exactly from dynamic and transient state two aspect.Xuan, Ferreira and Jarry first have studied according to the routing issue in the network of definite timetable dynamic change, the topological structure of network in different time interval can be predicted, and they make use of evolution diagram to catch the variation characteristic of such dynamic network.In the recent period, Monteiro J, Goldman A and ArantesL application evolution diagram assess different ad-hoc and DTN Routing Protocols.In temporal evolution figure theory, a lot of algorithm may be used for seeking shortest path, and most typical in these algorithms is Dijkstra's algorithm (Dijkstra), and it can calculate the optimal path of middle point-to-point transmission of publishing picture.Committed step in dijkstra's algorithm is " search out the minimum adjacent node of source node and delete it from node table ".But the problem of dijkstra's algorithm is, it takes long time switching node table, deletes minimum node and upgrades node table.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, provide a kind of reasonable in design, network performance index is excellent and obviously can reduce the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap of time complexity.
The present invention solves existing technical problem and takes following technical scheme to realize:
Based on a temporal evolution figure routing algorithm for multiple performance self-adapting Pairing Heap, comprise the following steps:
Step 1, structure one are according to the medium earth orbit satellite network system of communication time slot table time-division slot communication;
Step 2, temporal evolution graph model according to the communication time slot table of 24 satellites structure medium earth orbit satellite network system;
Step 3, multiple performance self-adapting Pairing Heap is adopted to optimize the data store organisation of Di Jiesitela shortest path first;
Step 4, in temporal evolution graph model, the Di Jiesitela shortest path first of optimizing application calculates optimum route.
And, described step 1 construction method is: adopt STK simulated environment structure Walker constellation and model trajectory thereof, utilize STK simulated environment generator orbital data message, orbital data information is imported OPNET be applied in medium earth orbit satellite network system, in the medium earth orbit satellite network system of time-division slot communication 24 satellites are run well according to its definitive orbit.
And described Walker constellation is Walker-24/3/1 structure constellation group, configuration application layer, transport layer, network layer, link layer and physical layer in each satellite node; Each satellite node configures a pair positioning transceiving antenna, and gain is 200 decibels in one direction, and gain is 0 in the other direction; The dual-mode antenna of each satellite is automatically changed according to communication time slot table and is pointed to and communicate with other satellite link setups.
And the temporal evolution graph model of described step 2 is the ordered sequence of β subgraph of a Given Graph, each subgraph corresponds to the network topology of certain time slot in network; Each satellite is regarded as network node, and the connection between satellite is regarded as limit, and whole satellite network is regarded as a figure, when building, is labeled on corresponding limit in the time interval connecting existence according to communication time slot table between satellite.
And described Pairing Heap is made up of Pairing Heap node, each node comprises queue element (QE) and predecessor pointers, left child pointers and right child pointers; Described Pairing Heap comprises merging, insertion, reduces key element and deletes least member operation.
And the concrete processing procedure of described step 3 is:
(1) initialization source node identification construct a Pairing Heap node as root node, adds the pointer of root node;
(2) whether terminate according to the information evaluation algorithm of root node, if do not terminated, travel through the adjacent node of present node and accumulate its expense; If terminated, then perform step (5);
(3) if the pairing node of adjacent node is empty, generate one and add information from adjacent node, constructing the pointer relationship between this node and heap node subsequently;
(4) utilize the minimal weight of present node and adjacent node to upgrade the information of Pairing Heap node, and adjust pile structure, return step (2);
(5) according to the heap nodal information way to acquire result of finish node, and all pointer memory headrooms are discharged.
And described step (2) accumulation expense is calculated as follows:
Expense=Σ α time+β jumping figure+δ postpone+γ other
Wherein, α, β, δ, γ are respectively the weighted value of time, jumping figure, delay and other desired properties parameter; Described weighted value is configured according to actual needs, or carries out self-adaptative adjustment according to the throughput in satellite network running, congested, packet loss, delay.
And the concrete processing procedure of described step 4 is: when initialization, have earliest arrival time d (s)=t to source point S
now, and have d (u)=∞ to other all node; Now, source point S is the unique root node in most rickle Q; Then, when most rickle Q non-NULL, its root node is removed and is assigned to the root x of heap Q, and is deleted; Next, if x has one or some neighborss, whether the time calculating first effective edge for its each neighbours v is more than or equal to current time, if it is not present in heap Q, v is inserted heap Q; Subsequently, d (v) and key element thereof is upgraded; After all neighborss of x are all traversed, upgrade heap Q, closed node x; Finally, inserted by x and arrive in path tree T at first, if there is not any node in heap Q, whole algorithm terminates, thus obtains the path tree of the arrival at first T from source point S to other all node.
Advantage of the present invention and good effect are:
The present invention is reasonable in design, by optimizing the data structure of temporal evolution figure routing algorithm, multiple performance self-adapting Pairing Heap is adopted in temporal evolution figure routing algorithm, and be applied to the medium earth orbit satellite network system of time-division slot communication, network performance index is better than other traditional routing algorithms, and significantly reduce time complexity, simultaneously, when network node quantity significantly increases, apply multiple performance self-adapting Pairing Heap as data store organisation than Fibonacci pile up time-optimized aspect performance better.
Accompanying drawing explanation
Fig. 1 is the temporal evolution graph model of satellite A1-A8 in the 1st to the 4th time slot;
Fig. 2 is multiple performance self-adapting Pairing Heap schematic diagram of the present invention;
Fig. 3 is the Dijkstra's algorithm flow chart based on multiple performance self-adapting Pairing Heap of the present invention;
Fig. 4 is Dijkstra's algorithm flow chart in temporal evolution figure;
Fig. 5 be routing algorithm in the present invention with based on the routing algorithm of ATM, the comparison diagram of IP-based routing algorithm in throughput;
Fig. 6 be routing algorithm in the present invention with based on the routing algorithm of ATM, the comparison diagram of IP-based routing algorithm in packet loss;
Fig. 7 be traditional Dijkstra's algorithm, based on Fibonacci heap Dijkstra's algorithm with based on the comparison diagram of Dijkstra's algorithm in average end-to-end delay of multiple performance self-adapting Pairing Heap;
Fig. 8 is based on the Dijkstra's algorithm of Fibonacci heap and the comparison diagram of Dijkstra's algorithm when network node scale increases based on multiple performance self-adapting Pairing Heap.
Embodiment
Below in conjunction with accompanying drawing, the embodiment of the present invention is further described.
Based on a temporal evolution figure routing algorithm for multiple performance self-adapting Pairing Heap, comprise the following steps:
Step 1, structure one are according to the medium earth orbit satellite network system of communication time slot table time-division slot communication.
Because Global coverage aspect pedestrian (Walker) constellation has its specific advantage, therefore, the satellite network model of the present invention's structure adopts Walker constellation.Specifically, it is made up of 24 MEO satellites and three orbital planes, and each orbital plane comprises eight satellites, and all 24 satellites define Walker-24/3/1 structure constellation group.Orbit altitude is 30504.137 kms, and orbit inclination angle is 55 degree, and eccentricity is 0.
Specific to each node, each satellite node comprises application layer, transport layer, network layer, link layer and physical layer.And each satellite comprises a pair antenna, i.e. transmitting antenna and reception antenna.Antenna is directed, has the gain of 200dB in a certain direction, and other any one direction gain be 0.In each time slot, namely in 3 seconds, the transmitting antenna of a satellite and reception antenna point to another satellite simultaneously, and this intercoms mutually to satellite, send and receive data, and in ensuing time slot, the sensing of antenna changes according to set slot table.
Application STK simulated environment constructs Walker constellation and model trajectory thereof.Meanwhile, utilize the orbital data information generated in STK, imported OPNET and be applied in MEO satellite network system, in the MEO satellite network system of time-division slot communication 24 satellites are run well according to its definitive orbit.
Step 2, temporal evolution graph model according to the communication time slot table of 24 satellites structure medium earth orbit satellite network system.
Figure theory is a kind of formally abstract to dynamic network.Briefly, a temporal evolution figure is the ordered sequence of β subgraph of a Given Graph, and the subgraph of each given sequence number corresponds to the network connection topology of certain time slot of same sequence number.
In graph model, satellite is regarded as network node, and the connection between satellite is regarded as limit.Meanwhile, whole satellite network is counted as a figure on abstract sense.
Specific to the medium earth orbit satellite network system in the present invention, the communication time slot table according to following table, the time interval connecting existence between satellite as shown in Figure 1, is labeled on corresponding limit by the temporal evolution process of satellite A1-A8 in the 1st to the 4th time slot.Because { A1, A4} are present in time slot 1, and { A4, A2} are present in time slot 2, and therefore { A1, A4, A2} are not effective paths.
| ? | A1 | A2 | A3 | A4 | A5 | A6 | A7 | A8 |
| 1 | A4 | A7 | A5 | A1 | A3 | A8 | A2 | A6 |
| 2 | A7 | A4 | A6 | A2 | A8 | A3 | A1 | A5 |
| 3 | A3 | A8 | A1 | A6 | A7 | A4 | A5 | A2 |
| 4 | A6 | A5 | A8 | A7 | A2 | A1 | A4 | A3 |
G (V, E) is a given figure, and V represents end points, E representative edge.And the ordered sequence of its subgraph is S
g=G
1(V
1, E
1), G
2(V
2, E
2), G
3(V
3, E
3), G
λ(V
λ, E
λ), namely
evolution diagram is defined as
wherein vertex set is
limit set is
meanwhile, given sequence number is the subgraph G of i
i(V
i, E
i) be when time interval is in T=[t
i-1, t
i] time network topology decompose potential figure, wherein t
0< t
1< < t
τ.Definition Ω is evolution diagram
in a given path, thus
definition Ω
σ=σ
1, σ
2, σ
3, σ
kfor the timetable when every bar limit specified in the Ω of path is traversed.And if only if Ω
σwith Ω,
j=(Ω, Ω is claimed time consistent with T
σ) be a stroke.
Step 3, multiple performance self-adapting Pairing Heap is adopted to optimize the data store organisation of Di Jiesitela shortest path first.
The present invention adopts the data store organisation of Pairing Heap can overcome the inferior position of Fibonacci heap.
Fibonacci heap is set by one group of minimum stacking order and is formed.Each node x comprises one and points to the pointer of its parents and the pointer of one of them child of sensing.All children of x connect into a dual-circulation linked list, are called that x-children shows.Each child in table has two pointers, points to its left brother and right brother respectively.All root vertexes and its left and right pointer connect into a dual-circulation linked list, are called the root table H of heap.In Fibonacci heap, apply dual-circulation linked list have 2 advantages: the first, from dual-circulation linked list, delete a node only needs time O (1); The second, to given two chained lists, they can connect into a dual-circulation linked list in time O (1).
In order to realize, based on the Dijkstra's algorithm of Fibonacci heap, needing structure heap to be used for there is spike end points.Initialization needs " structure heap " operation and one " insertion " operation, and scans needs one " deletion least member " operation each time.Insert a node and need time O (1), extract minimum node action need time lg|V|, V represents end points, and each node can be extracted once, and therefore, time complexity is V*lg|V|." deletion key element " action need time O (1), and every bar limit upgrades once at the most, therefore time complexity is | E|*O (1), E representative edge.So, if application Fibonacci heap, the All Time of heap operation is O (| V|*lg|V|+|E|), and the time of other tasks is O (| V|+|E|), therefore, based on running time of Dijkstra's algorithm of Fibonacci heap being O (| V|*lg|V|+|E|).
But Fibonacci heap has two shortcomings: the first, and programming realization is more difficult; The second, due to its storage organization and four pointers, actual efficiency is so not high in theory.
The present invention adopts the data store organisation of Pairing Heap.Pairing Heap is made up of Pairing Heap node, as shown in Figure 2.Each node comprises queue element (QE) and three pointers, i.e. predecessor pointers, left child pointers and right child pointers.The predecessor pointers of the most left child needs to point to its parents and is used for " deletion key element ", otherwise this node is right brother, and its predecessor pointers points to its left brother.
Pairing Heap has following feature: the first, and for minimum Pairing Heap, root node is its least member; The second, the weight of each heap node is less than its left child; 3rd, the node on same layer is unordered, but is all greater than the parents of the most left child.Above feature makes Pairing Heap be applicable to acquisition descending priority queue.
Comprise in Pairing Heap " merging ", " insertion ", " minimizing key element " and " deletion least member " operates.Wherein, " merging " is that two son heaps are merged into a heap, and this is the basis of other operations.In general, in merging second son heap is an independent node or the heap having a right brother.Merge object be make to have larger root weight son heap become other son heap the most left child.
As shown in Figure 3, the Dijkstra's algorithm based on multiple performance self-adapting Pairing Heap comprises the following steps:
(1) initialization source node identification construct a Pairing Heap node as root node, adds the pointer of root node;
(2) whether terminate according to the information evaluation algorithm of root node, if terminated, then perform step (5); If do not terminated, travel through the adjacent node of present node and accumulate its expense;
Expense=Σ α time+β jumping figure+δ postpone+γ other
Wherein, α, β, δ, γ are respectively the time, jumping figure, the weighted value of delay and other desired properties parameter.The parameter weighting that expense is considered by time, jumping figure, delay and other all needs is sued for peace and is formed, its weight parameter can be configured according to actual needs, or according to the actual conditions in satellite network running, such as throughput, congested, packet loss, delay etc., carry out self-adaptative adjustment.User, when selecting network routed path, can consider multiple performance parameter comprehensively, makes this routing algorithm have adaptive ability to multiple performance parameter.
(3) if the pairing node of adjacent node is empty, generate one and add information from adjacent node, constructing the pointer relationship between this node and heap node subsequently; No person performs step (4);
(4) utilize the minimal weight of present node and adjacent node to upgrade the information of Pairing Heap node, and adjust pile structure; And return step (2);
(5) according to the heap nodal information way to acquire result of finish node, and all pointer memory headrooms are discharged.
In traditional Dijkstra's algorithm, adjacency matrix is used as the most basic data store organisation.When scanning end point array finds minimum end points, whole algorithm need cost O (| V|
2) time.Each arrives set of paths D (X) the earliest and upgrades consumption time constant, so, the whole service time be O (| V|
2+ | E|).When figure be closely scheme time, this algorithm is basic being suitable for.But MEO Walker Constellation Network system belongs to the one of sparse graph, the expense applying this algorithm is too high and efficiency is extremely low.
When Pairing Heap is applied in Dijkstra's algorithm, its time complexity depends on four kinds of operations and decides.Wherein, " merging ", " insertion " and " minimizing " elapsed time constant O (1).And be a problem changed to the analysis of " deletion least member ", but it has the worst a kind of situation to be that root node has N-1 child.Therefore, " deletion least member " in the worst case its time complexity be O (N).Because " twice traversal merges " needs to merge all children, it can reduce the brother on same level.Therefore, that reduce the possibility that worst case occurs, and its to share the time be O (logN).So when utilizing Pairing Heap, the time complexity of the operation relevant to Dijkstra's algorithm is only O (| V|*lg|V||E|).This time is significantly optimized, and it goes for the demand of MEO satellite network topology dynamic change.
Step 4, in temporal evolution graph model, the Di Jiesitela shortest path first of optimizing application calculates optimum route.
In temporal evolution figure, the present invention adopts and arrives path at first as Path selection index, and in Dijkstra's algorithm, it is devoted to find earliest estimated arrival time.In Dijkstra's algorithm, very important point is shortest path, and its forerunner path itself is also the shortest.But the forerunner path arriving path at first might not need also to be arrive at first.Can prove, under such characteristic, at least have one in an evolution diagram and arrive path at first simultaneously.
In order to calculate the path at first arriving other all node when time t from source point S, application Dijkstra's algorithm, detailed step is as follows:
Input: an evolution diagram G, an end points s ∈ V
g, current time t
now, weight parameter α, β, δ, γ;
Export: tree T, gives the earliest arrival time from source point S;
Variable: most rickle Q, a vectorial d including end points
gcover the path of arrival the earliest of each end points;
As shown in Figure 4, during initialization, there is earliest arrival time d (s)=t to source point S
now, and have d (u)=∞ to other all node.Meanwhile, now, source point S is the unique root node in most rickle Q.Then, when most rickle Q non-NULL, its root node is removed and is assigned to the root x of heap Q, and is deleted subsequently.Next, if x has one or some neighborss, whether the time calculating first effective edge for its each neighbours v is more than or equal to current time, if it is not present in heap Q, v is inserted heap Q.Subsequently, d (v) and key element thereof is upgraded.After all neighborss of x are all traversed, upgrade heap Q, closed node x.Finally, x insertion is arrived in path tree T at first.Now, if there is not any node in heap Q, whole algorithm terminates.
Finally, the path tree of the arrival at first T from source point S to other all node is obtained.The path of arrival at first that retrieval arrives node v can be completed by the ancestors finding node v in tree T.Particularly, when calculating first effective edge time in interior loop, need travel time and the transmission time of considering limit.
Realized the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap in medium earth orbit satellite (MEO) network by above four steps, significantly reduce time complexity and significantly improve network communication efficiency.
In order to be described effect of the present invention, adopt the mode of Computer Simulation to send out the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap in medium earth orbit satellite (MEO) network of invention below and carry out modeling, and achieve the simulation to real scene by assignment.Detailed process divides following four steps to carry out:
(1) simulating scenes simulation
In OPNET, build MEO Walker-24/3/1 satellite constellation scene, and communicate according to set slot table between all satellites.Slot table comprises 20 time slots, each time slot 3 second.The whole simulation run time is 1 hour, covers 60 slot cycles.
Simulation objectives mainly comprises two aspects: the first, the routing algorithm in the present invention and other contrast of traditional routing table algorithm in communication performance; The second, multiple performance self-adapting Pairing Heap, Fibonacci heap contrasts with the optimization of traditional data structure in time complexity.
(2) communication performance compares
Select the routing algorithm based on ATM to represent virtual topology routing algorithm, and IP-based routing algorithm represent dummy node routing algorithm.As shown in Figure 5, circle line style represents the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap that the present invention proposes, and the throughput representated by it is apparently higher than based on the routing algorithm (triangle line style) of ATM and IP-based routing algorithm (star-like line style).As shown in Figure 6, solid line type represents the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap that the present invention proposes, and the packet loss aspect representated by it is starkly lower than routing algorithm (dash line) based on ATM and IP-based routing algorithm (dash line).
(3) time complexity compares
As shown in Figure 7, contrast with traditional Dijkstra's algorithm, routing algorithm and the routing algorithm based on multiple performance self-adapting Pairing Heap based on Fibonacci heap more efficiently can calculate the path of arrival at first of point-to-point transmission.Average end-to-end delay is utilized to carry out the efficiency of assessment algorithm, when employing Fibonacci heap or multiple performance self-adapting Pairing Heap can obtain lower end-to-end delay as during data store organisation.
As shown in Figure 8, when the number of network Satellite node significantly increases, adopt end-to-end delay to carry out the efficiency of assessment algorithm, the routing algorithm piled based on Fibonacci and the routing algorithm based on multiple performance self-adapting Pairing Heap are contrasted.Result shows, when satellite node quantity is less, the time of delay of two kinds of algorithms is suitable, but when satellite node increases severely, delay based on the routing algorithm of multiple performance self-adapting Pairing Heap is starkly lower than the routing algorithm based on Fibonacci heap, and advantage increases with number of nodes and obviously increases.
It is emphasized that; embodiment of the present invention is illustrative; instead of it is determinate; therefore the present invention includes the embodiment be not limited to described in embodiment; every other execution modes drawn by those skilled in the art's technical scheme according to the present invention, belong to the scope of protection of the invention equally.
Claims (8)
1., based on a temporal evolution figure routing algorithm for multiple performance self-adapting Pairing Heap, it is characterized in that comprising the following steps:
Step 1, structure one are according to the medium earth orbit satellite network system of communication time slot table time-division slot communication;
Step 2, temporal evolution graph model according to the communication time slot table of 24 satellites structure medium earth orbit satellite network system;
Step 3, multiple performance self-adapting Pairing Heap is adopted to optimize the data store organisation of Di Jiesitela shortest path first;
Step 4, in temporal evolution graph model, the Di Jiesitela shortest path first of optimizing application calculates optimum route.
2. the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap according to claim 1, it is characterized in that: described step 1 construction method is: adopt STK simulated environment structure Walker constellation and model trajectory thereof, utilize STK simulated environment generator orbital data message, orbital data information is imported OPNET be applied in medium earth orbit satellite network system, in the medium earth orbit satellite network system of time-division slot communication 24 satellites are run well according to its definitive orbit.
3. the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap according to claim 2, it is characterized in that: described Walker constellation is Walker-24/3/1 structure constellation group, configuration application layer, transport layer, network layer, link layer and physical layer in each satellite node; Each satellite node configures a pair positioning transceiving antenna, and gain is 200 decibels in one direction, and gain is 0 in the other direction; The dual-mode antenna of each satellite is automatically changed according to communication time slot table and is pointed to and communicate with other satellite link setups.
4. the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap according to claim 1, it is characterized in that: the temporal evolution graph model of described step 2 is the ordered sequence of β subgraph of a Given Graph, each subgraph corresponds to the network topology of certain time slot in network; Each satellite is regarded as network node, and the connection between satellite is regarded as limit, and whole satellite network is regarded as a figure, when building, is labeled on corresponding limit in the time interval connecting existence according to communication time slot table between satellite.
5. the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap according to claim 1, it is characterized in that: described Pairing Heap is made up of Pairing Heap node, each node comprises queue element (QE) and predecessor pointers, left child pointers and right child pointers; Described Pairing Heap comprises merging, insertion, reduces key element and deletes least member operation.
6. the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap according to claim 1, is characterized in that: the concrete processing procedure of described step 3 is:
(1) initialization source node identification construct a Pairing Heap node as root node, adds the pointer of root node;
(2) whether terminate according to the information evaluation algorithm of root node, if do not terminated, travel through the adjacent node of present node and accumulate its expense; If terminated, then perform step (5);
(3) if the pairing node of adjacent node is empty, generate one and add information from adjacent node, constructing the pointer relationship between this node and heap node subsequently;
(4) utilize the minimal weight of present node and adjacent node to upgrade the information of Pairing Heap node, and adjust pile structure, return step (2);
(5) according to the heap nodal information way to acquire result of finish node, and all pointer memory headrooms are discharged.
7. the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap according to claim 6, is characterized in that: described step (2) accumulation expense is calculated as follows:
Expense=Σ α time+β jumping figure+δ postpone+γ other
Wherein, α, β, δ, γ are respectively the weighted value of time, jumping figure, delay and other desired properties parameter; Described weighted value is configured according to actual needs, or carries out self-adaptative adjustment according to the throughput in satellite network running, congested, packet loss, delay.
8. the temporal evolution figure routing algorithm based on multiple performance self-adapting Pairing Heap according to claim 1, is characterized in that: the concrete processing procedure of described step 4 is: when initialization, have earliest arrival time d (s)=t to source point S
now, and have d (u)=∞ to other all node; Now, source point S is the unique root node in most rickle Q; Then, when most rickle Q non-NULL, its root node is removed and is assigned to the root x of heap Q, and is deleted; Next, if x has one or some neighborss, whether the time calculating first effective edge for its each neighbours v is more than or equal to current time, if it is not present in heap Q, v is inserted heap Q; Subsequently, d (v) and key element thereof is upgraded; After all neighborss of x are all traversed, upgrade heap Q, closed node x; Finally, inserted by x and arrive in path tree T at first, if there is not any node in heap Q, whole algorithm terminates, thus obtains the path tree of the arrival at first T from source point S to other all node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410429748.3A CN104243310A (en) | 2014-08-28 | 2014-08-28 | Time evolution diagram routing algorithm based on multi-performance self-adaption pairing heap |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410429748.3A CN104243310A (en) | 2014-08-28 | 2014-08-28 | Time evolution diagram routing algorithm based on multi-performance self-adaption pairing heap |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104243310A true CN104243310A (en) | 2014-12-24 |
Family
ID=52230694
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410429748.3A Pending CN104243310A (en) | 2014-08-28 | 2014-08-28 | Time evolution diagram routing algorithm based on multi-performance self-adaption pairing heap |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104243310A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104869017A (en) * | 2015-04-30 | 2015-08-26 | 北京空间飞行器总体设计部 | Satellite information system topological structure optimization method based on core-degree product |
| CN108964746A (en) * | 2018-08-04 | 2018-12-07 | 西安电子科技大学 | The more topology search shortest route methods of time-varying satellite network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2371663A1 (en) * | 2008-12-12 | 2011-10-05 | Navitime Japan Co., Ltd. | Route searching system, route searching server and route searching method |
| CN102238687A (en) * | 2011-08-05 | 2011-11-09 | 电子科技大学 | Pseudo-three-dimensional wireless sensor network routing method based on geographical position |
| CN102577266A (en) * | 2009-08-12 | 2012-07-11 | 英派尔科技开发有限公司 | Forward-looking probabilistic statistical routing for wireless ad-hoc networks with lossy links |
| CN102571571A (en) * | 2011-12-28 | 2012-07-11 | 南京邮电大学 | Multilayer effective routing method applied to delay tolerant network (DTN) |
-
2014
- 2014-08-28 CN CN201410429748.3A patent/CN104243310A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2371663A1 (en) * | 2008-12-12 | 2011-10-05 | Navitime Japan Co., Ltd. | Route searching system, route searching server and route searching method |
| CN102577266A (en) * | 2009-08-12 | 2012-07-11 | 英派尔科技开发有限公司 | Forward-looking probabilistic statistical routing for wireless ad-hoc networks with lossy links |
| CN102238687A (en) * | 2011-08-05 | 2011-11-09 | 电子科技大学 | Pseudo-three-dimensional wireless sensor network routing method based on geographical position |
| CN102571571A (en) * | 2011-12-28 | 2012-07-11 | 南京邮电大学 | Multilayer effective routing method applied to delay tolerant network (DTN) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104869017A (en) * | 2015-04-30 | 2015-08-26 | 北京空间飞行器总体设计部 | Satellite information system topological structure optimization method based on core-degree product |
| CN108964746A (en) * | 2018-08-04 | 2018-12-07 | 西安电子科技大学 | The more topology search shortest route methods of time-varying satellite network |
| CN108964746B (en) * | 2018-08-04 | 2020-12-08 | 西安电子科技大学 | Time-varying satellite network multi-topology searching shortest routing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7039685B2 (en) | Traffic measurement methods, devices, and systems | |
| Wang et al. | Dynamic service migration in mobile edge-clouds | |
| Caillouet et al. | Efficient data collection and tracking with flying drones | |
| Qasim et al. | An ant colony optimization based approach for minimum cost coverage on 3-D grid in wireless sensor networks | |
| Huang et al. | An optimized snapshot division strategy for satellite network in GNSS | |
| CN111970044A (en) | Satellite network time slot allocation and routing planning method based on Lagrange relaxation | |
| Paul | Graph based M2M optimization in an IoT environment | |
| CN109446385B (en) | Method for establishing network resource equipment map and using method of equipment map | |
| CN104298541A (en) | Data distribution algorithm and data distribution device for cloud storage system | |
| Ji et al. | Observability and estimation in distributed sensor networks | |
| CN109905281A (en) | The group of stars network Telemetry Service transmission method of multipath maximum throughput | |
| CN101932065B (en) | Method for discovering distributed satellite network resources | |
| Wang et al. | Emulation-based study of dynamic service placement in mobile micro-clouds | |
| Shao et al. | PaFiR: Particle Filter Routing–A predictive relaying scheme for UAV-assisted IoT communications in future innovated networks | |
| CN104243310A (en) | Time evolution diagram routing algorithm based on multi-performance self-adaption pairing heap | |
| Li et al. | DTN routing with fixed stations based on the geographic grid approach in an urban environment | |
| Khan et al. | Car rank: An information-centric identification of important smart vehicles for urban sensing | |
| CN114422011B (en) | Low orbit satellite constellation network capacity measuring and calculating method | |
| Du et al. | Time cumulative complexity modeling and analysis for space-based networks | |
| Sharma et al. | Optimal nearest neighbor queries in sensor networks | |
| CN107509234B (en) | Method and system for detecting key nodes of flight ad hoc network based on limited routing information | |
| Jo et al. | A rendezvous point estimation considering drone speed and data collection delay | |
| CN107342807B (en) | Spatial information network resource interchange method based on resource mobility | |
| Babu et al. | Urban delay tolerant network simulator (udtnsim v0. 1) | |
| Iranmanesh et al. | The impact of 5g drones on the performance of a dtn destination based routing protocol |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20180608 |