CN114024891B - Naive Bayesian-assisted contact graph routing method and storage medium - Google Patents

Naive Bayesian-assisted contact graph routing method and storage medium Download PDF

Info

Publication number
CN114024891B
CN114024891B CN202111159351.3A CN202111159351A CN114024891B CN 114024891 B CN114024891 B CN 114024891B CN 202111159351 A CN202111159351 A CN 202111159351A CN 114024891 B CN114024891 B CN 114024891B
Authority
CN
China
Prior art keywords
node
probability
local node
routing method
state
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
CN202111159351.3A
Other languages
Chinese (zh)
Other versions
CN114024891A (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.)
Harbin Juche Technology Co ltd
Harbin Engineering University
Original Assignee
Harbin Juche Technology Co ltd
Harbin Engineering University
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 Harbin Juche Technology Co ltd, Harbin Engineering University filed Critical Harbin Juche Technology Co ltd
Priority to CN202111159351.3A priority Critical patent/CN114024891B/en
Publication of CN114024891A publication Critical patent/CN114024891A/en
Application granted granted Critical
Publication of CN114024891B publication Critical patent/CN114024891B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computing arrangements based on specific mathematical models
    • G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • 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

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Optimization (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computing Systems (AREA)
  • Evolutionary Computation (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Artificial Intelligence (AREA)
  • Algebra (AREA)
  • Probability & Statistics with Applications (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to the technical field of space communication, in particular to a naive Bayesian-assisted contact diagram routing method and a storage medium. The technical scheme of the invention comprises the following steps: 1. according to a contact database proposed by the node expansion CGR, recording the local node state as a snapshot; 2. calculating potential unreliability probability between any node pair formed by the local node and the adjacent node by using a naive Bayes method; 3. calculating the unreliability probability of the local node; 4. selecting adjacent nodes with minimum unreliable probability and predicted recovery time interval products to transmit data; 5. and importing the current state of each node and the data transmission result into an own extended contact database for updating. The present invention also provides a computer readable storage medium storing a computer program for executing the inventive arrangements. By applying the contact diagram routing method provided by the invention, the link reliability and the data transmission efficiency are improved, and the basic requirement of space communication data transmission is met.

Description

Naive Bayesian-assisted contact graph routing method and storage medium
Technical Field
The invention relates to the technical field of space communication, in particular to a naive Bayesian-assisted contact diagram routing method and a storage medium.
Background
The space communication network is different from the traditional communication network scene, such as a circuit switching network, and has the characteristics of high path delay of a communication link, low transmission data rate, possibility of long-time interruption and unstable state of connection between communication nodes, and the like, so that the routing algorithm of the traditional communication network is generally established on the basis of stable link connection and small delay and cannot be suitable for the space communication scene. In order to solve the data transmission problem of the space communication network, a Delay Tolerant Network (DTN) is designed, a Binding Layer (BL) is added between a transmission layer and an application layer on the basis of a traditional TCP/IP communication protocol, and data transmission is realized in a store-and-forward mode.
The DTN network architecture comprises a routing algorithm, congestion control, network security and the like, wherein the routing algorithm provides a transmission direction for a data packet, is an extremely important ring in the DTN, and can improve transmission efficiency and throughput through rapid and reliable path planning by an excellent routing algorithm.
The contact map routing (CGR) algorithm is a distributed routing algorithm based on priori knowledge in a space communication scene, and is used for finding a plurality of effective and short-time routing paths between a source router node and a target router so as to better solve the problems of low data delivery rate, high average time delay, insufficient on-board resources and the like in space communication when a large amount of data is transmitted.
However, as space communication continues to progress to deep space, space interference will become more and more severe, so that the conventional CGR algorithm fails based on a priori knowledge, and the problem of path planning failure will occur. Under the deep space communication scene, the traditional CGR algorithm has low path planning reliability and low data delivery rate, and is difficult to meet the normal data transmission requirement, so that the path planning reliability of the CGR algorithm is improved, the data delivery efficiency is improved, and the problem in the field needs to be solved.
Disclosure of Invention
Aiming at the problem that the reliability and the data delivery rate of the traditional CGR algorithm are low under strong space interference, the invention provides a naive Bayesian-assisted contact diagram routing method, so as to make up for the defects of the traditional CGR and improve the data transmission reliability and the transmission efficiency under a deep space communication scene.
The contact map routing method based on naive Bayesian assistance provided by the invention comprises the following steps:
(1) According to a contact database proposed by node expansion CGR, recording the state of a local node as a snapshot, establishing a state vector S to represent the node snapshot, and adding an attribute ln into the vector S to form a new state vector X, wherein ln represents a node pair index of a transmission data packet;
(2) Assuming that the data is along a candidate of local node and neighboring nodeLink selection
Figure BDA0003289512810000021
Transmission, said->
Figure BDA0003289512810000022
wherein Lln Representing a set of all candidate links formed by the local node and the adjacent nodes, wherein k represents a link sequence number, k is not less than 1 and not more than M, M represents the number of the adjacent nodes, and then the node snapshot Sc is updated to be +.>
Figure BDA0003289512810000023
Calculating potential unreliability probability between any node pair l 'n' formed by local node and adjacent node according to naive Bayes method>
Figure BDA0003289512810000024
/>
(3) Based on the obtained probability of unreliability
Figure BDA0003289512810000025
Calculating the unreliability probability of the local node +.>
Figure BDA0003289512810000026
(4) The best neighbor node to transmit data with the local node is determined according to the following formula:
Figure BDA0003289512810000027
the best neighboring node is taken as the next transmission node, wherein
Figure BDA0003289512810000028
For the expected recovery time interval.
(5) And updating the current node state, taking the current local node state and the data transmission link selection result as retransmission requests, and importing the retransmission requests into the self-expanding contact database for updating.
Further, the local node state in step (1) includes: the distance from the local node to the adjacent node, the bit error rate, the input/output rate and the retransmission request.
Further, the state vector S and the state vector X in the step (1) are respectively expressed as follows:
Figure BDA0003289512810000029
Figure BDA00032895128100000210
where i represents an ith node snapshot, i.e., a snapshot of when the node is to send an ith data packet, L is the total number of attributes of the node,
Figure BDA00032895128100000211
is the value of the j-th attribute.
Further, the probability of potential unreliability between the local node calculated according to the naive Bayesian method and any node pair l 'n' formed by the adjacent nodes in the step (2)
Figure BDA00032895128100000212
Is obtained according to the following formula:
Figure BDA00032895128100000213
where y=1 indicates that no data packet is transmitted between node pair l 'n', i.e. the local node does not select this node to transmit data,<S k ，l′n′>indicating that node pair l 'n' is in state S k 。
Further, the probability of unreliability of the local node in step (3)
Figure BDA00032895128100000214
Is obtained according to the following formula:
Figure BDA0003289512810000031
wherein ll'n′ Is the ratio of the traffic between node pairs i 'n' to the total traffic in the entire network,
Figure BDA0003289512810000032
wherein H is the number of data packets to be sent by the local node,
Figure BDA0003289512810000033
wherein ,Mi The number of the adjacent nodes can be forwarded when the ith data packet is sent, and N is the total number of the sent data packets.
Further, the predicted recovery time interval described in step (4)
Figure BDA0003289512810000034
Is obtained according to the following formula:
Figure BDA0003289512810000035
/>
wherein ,
Figure BDA0003289512810000036
to the estimated time of arrival generated from the standard CGR, t c Is the current time.
Further, P (y=1) represents the probability of unreliability of the transmitted packet at the local node, and is obtained according to the following formula:
Figure BDA0003289512810000037
further, the process is that<S k ,l'n'>Y=1) tableShowing a node pair l 'n' in state S in the absence of a transmitted packet k Is obtained according to the following formula:
Figure BDA0003289512810000038
further, the process is that<S k ,l'n'>) Indicating that node pair l 'n' is in state S k Is obtained according to the following formula:
Figure BDA0003289512810000039
wherein ,
Figure BDA0003289512810000041
p (l 'n') is the probability that a data transmission occurs between l 'n',
Figure BDA0003289512810000042
in order to implement the above method, the present invention further provides a computer readable storage medium, specifically for storing a computer program, where the computer program performs the naive bayes-based contact map routing method described above.
Compared with the prior art, the invention has the following beneficial effects:
1. the extended node contact database records the information which plays a key role in the link transmission efficiency, such as the distance between nodes, the bit error rate, the input and output rate, the retransmission request and the like in a node snapshot mode, and more comprehensively and effectively records the historical state information of the nodes so as to better evaluate the reliability of the current node according to the periodic track information in the past;
2. the invention uses a naive Bayes method, and can more accurately select the optimal link by comprehensively comparing the unreliable probability calculation of each candidate link with less influence on limited storage resources;
3. the node reliability obtained by naive Bayes learning is combined with the earliest recovery time obtained by the standard CGR, a brand-new route selection strategy is generated, the reliability of a link is considered, the efficiency of data transmission is considered, the severe space environment is adapted, and the basic requirement of space communication data transmission is met.
Drawings
Fig. 1 is a flowchart of a naive bayes-assisted contact map routing method according to the present invention.
Detailed Description
The technical solution of the present invention can be better understood with reference to fig. 1 and the following specific examples, which are provided for further illustration of the technical solution of the present invention, but should not be construed as limiting the present invention.
Example 1:
referring to fig. 1 for illustrating the present embodiment, the present embodiment provides a naive bayes-assisted contact map routing method, which includes the following steps:
(1) According to a contact database proposed by node expansion CGR, recording the state of a local node as a snapshot, establishing a state vector S to represent the node snapshot, and adding an attribute ln to the vector S to represent a node pair index of a transmission data packet;
(2) Assuming that data is along a candidate link formed by a local node and a neighboring node
Figure BDA0003289512810000043
Transmission, said->
Figure BDA0003289512810000044
wherein Lln Representing a set of all candidate links formed by the local node and the adjacent nodes, wherein k represents a link sequence number, k is not less than 1 and not more than M, M represents the number of the adjacent nodes, and then the node snapshot Sc is updated to be +.>
Figure BDA0003289512810000051
According to naive BayesCalculating potential unreliability probability between any node pair l 'n' formed by the local node and the adjacent node>
Figure BDA0003289512810000052
(3) Based on the obtained probability of unreliability
Figure BDA0003289512810000053
Calculating the unreliability probability of the local node +.>
Figure BDA0003289512810000054
(4) The best neighbor node to transmit data with the local node is determined according to the following formula:
Figure BDA0003289512810000055
the best neighboring node is taken as the next transmission node, wherein
Figure BDA0003289512810000056
For the expected recovery time interval.
(5) And updating the current node state, taking the current local node state and the data transmission link selection result as retransmission requests, and importing the retransmission requests into the self-expanding contact database for updating.
The embodiment combines two parameters of node reliability and earliest recovery time, considers the reliability of a link and the efficiency of data transmission, and selects the adjacent nodes with high reliability and high transmission efficiency for data transmission, so that the success rate of data delivery can be effectively improved, and the method is suitable for severe space environment.
Example 2:
the present embodiment is further defined on the naive bayes-assisted contact map routing method described in embodiment 1, where the local node state described in step (1) includes: the distance from the local node to the adjacent node, the bit error rate, the input/output rate and the retransmission request; the state vector S and the state vector X are respectively expressed as follows:
Figure BDA0003289512810000057
Figure BDA0003289512810000058
where i represents an ith node snapshot, i.e., a snapshot of when the node is to send an ith data packet, L is the total number of attributes of the node,
Figure BDA0003289512810000059
is the value of the j-th attribute.
The local node state information plays a key role in link transfer efficiency, is recorded more comprehensively and effectively in the form of node snapshot, and can evaluate the reliability of the current node according to the periodical track information in the past better.
Example 3:
the present embodiment is a further limitation of the naive bayes-assisted contact map routing method described in embodiment 1, in which the probability of potential unreliability between any node pair l 'n' formed by the local node and the neighboring node calculated according to the naive bayes method described in step (2)
Figure BDA00032895128100000510
Is obtained according to the following formula:
Figure BDA00032895128100000511
where y=1 indicates that no data packet is transmitted between node pair l 'n', i.e. the local node does not select this node to transmit data,<S k ，l′n′>indicating that node pair l 'n' is in state S k 。
Specifically, P (y=1) represents the probability of unreliability of the transmitted packet at the local node, and is obtained according to the following formula:
Figure BDA0003289512810000061
wherein I{Y(i) =1 } is an indication function, Y (i) The function value is 1 when=1 holds, otherwise is 0.
In particular, the P is<S k ,l'n'>Y=1) indicates that the node pair l 'n' is in state S without a packet being transmitted k Is obtained according to the following formula:
Figure BDA0003289512810000062
wherein ,
Figure BDA0003289512810000063
Figure BDA0003289512810000064
in particular, the P is<S k ,l'n'>) Indicating that node pair l 'n' is in state S k Is obtained according to the following formula:
Figure BDA0003289512810000065
wherein ,
Figure BDA0003289512810000066
p (l 'n') is the probability that a data transmission occurs between l 'n',
Figure BDA0003289512810000071
/>
the method calculates the unreliable probability of the data transmitted between the local node and each adjacent node, and applies a naive Bayes method, the method has a firm mathematical basis, and the algorithm logic is simple, is easy to realize and has small influence on limited storage resources.
Example 4:
this embodiment is a further limitation of the naive bayes-assisted contact map routing method described in embodiment 1, in which the probability of unreliability of the local node described in step (3)
Figure BDA0003289512810000072
Is obtained according to the following formula:
Figure BDA0003289512810000073
wherein ll 'n' is the ratio of traffic between node pairs l 'n' to the total traffic in the entire network,
Figure BDA0003289512810000074
wherein H is the number of data packets to be sent by the local node,
Figure BDA0003289512810000075
wherein ,Mi The number of the adjacent nodes can be forwarded when the ith data packet is sent, and N is the total number of the sent data packets.
According to the embodiment, the unreliable probability of the local node is obtained through the traffic ratio among the node pairs and the unreliable probability of the transmission among the node pairs, and the unreliable probability is used as an important parameter for selecting the optimal adjacent node so as to accurately reflect the reliability of the data transmission of the local node.
Example 5:
the embodiment isFurther defining the naive bayes-assisted contact map routing method of embodiment 1, in this embodiment, the predicted reclamation time interval described in step (4)
Figure BDA0003289512810000076
Is obtained according to the following formula:
Figure BDA0003289512810000077
wherein ,
Figure BDA0003289512810000078
to the estimated time of arrival generated from the standard CGR, t c Is the current time.
The predicted recovery time interval obtained by this embodiment, as another important parameter for evaluating the best neighboring node, reflects the transmission efficiency of the local node for transmitting data, and in combination with the unreliability probability of the local node obtained in embodiment 4, can more accurately select the best link with high reliability and high transmission efficiency.
Example 6:
the present embodiment provides a computer readable storage medium, specifically for storing a computer program that performs the naive bayes-based contact map routing method of any of embodiments 1-5.
Simulation verification is carried out on the method provided by the invention: the STK is utilized to build a GEO/LEO double-layer satellite communication system, orbit data is imported into an omnet++ software platform on which a Dtnsim module is installed, wherein LEO layer 48 (6*8) and GEO layer 3 (1*3) are respectively arranged on ground stations, beijing, new York, berlin, kanghillra, basil and Brazil Chai Weier, and compared with the data delivery success rate of a traditional CGR routing algorithm and a CGR routing algorithm based on Bayesian assistance, the test result shows that the data delivery success rate is improved from 82.7% to 94.5%, and is improved by 11.8%.
The results prove that the success rate of data delivery is obviously improved compared with the traditional CGR routing algorithm under the condition of strong space interference by using the method provided by the invention, and the basic requirement of space communication data transmission can be met.

Claims (8)

1. A naive bayes-assisted contact map routing method, comprising the steps of:
(1) According to a contact database proposed by node expansion CGR, recording the state of a local node as a snapshot, establishing a state vector S to represent the node snapshot, and adding an attribute ln into the vector S to form a new state vector X, wherein ln represents a node pair index of a transmission data packet;
(2) Assuming that data is along a candidate link formed by a local node and a neighboring node
Figure FDA0004102817920000011
Transmission, said->
Figure FDA0004102817920000012
wherein Lln Representing a set of all candidate links formed by the local node and the adjacent nodes, wherein k represents a link sequence number, k is not less than 1 and not more than M, M represents the number of the adjacent nodes, and then the node is snapped S c Updated to->
Figure FDA0004102817920000013
Calculating potential unreliability probability between any node pair l 'n' formed by local node and adjacent node according to naive Bayes method>
Figure FDA0004102817920000014
Probability of potential unreliability between any node pair l 'n' of the local node and the neighboring node described in step (2)
Figure FDA0004102817920000015
Is obtained according to the following formula:
Figure FDA0004102817920000016
where y=1 indicates that no data packet is transmitted between node pair l 'n', i.e. the local node does not select this node to transmit data,<S k ，l′n′>indicating that node pair l 'n' is in state S k ；
(3) Based on the obtained probability of unreliability
Figure FDA0004102817920000017
Calculating the unreliability probability of the local node +.>
Figure FDA0004102817920000018
Probability of unreliability of the local node described in step (3)
Figure FDA0004102817920000019
Is obtained according to the following formula:
Figure FDA00041028179200000110
wherein ll'n′ Is the ratio of the traffic between node pairs i 'n' to the total traffic in the entire network,
Figure FDA00041028179200000111
wherein H is the number of data packets to be sent by the local node,
Figure FDA00041028179200000112
wherein ,Mi The number of the adjacent nodes can be forwarded when the ith data packet is sent, and N is the total number of the sent data packets;
(4) The best neighbor node to transmit data with the local node is determined according to the following formula:
Figure FDA0004102817920000021
the best neighboring node is taken as the next transmission node, wherein
Figure FDA0004102817920000022
For a predicted recovery time interval;
(5) And updating the current node state, taking the current local node state and the data transmission link selection result as retransmission requests, and importing the retransmission requests into the self-expanding contact database for updating.
2. The naive bayes-based assisted contact map routing method of claim 1, wherein the local node state in step (1) comprises: the distance from the local node to the adjacent node, the bit error rate, the input/output rate and the retransmission request.
3. The naive bayes-based assisted contact map routing method of claim 1, wherein the state vector S and the state vector X in step (1) are respectively represented as follows:
Figure FDA0004102817920000023
Figure FDA0004102817920000024
where i represents an ith node snapshot, i.e., a snapshot of when the node is to send an ith data packet, L is the total number of attributes of the node,
Figure FDA0004102817920000025
is the value of the j-th attribute.
4. The naive bayes-based assisted contact map routing method of claim 1, wherein said projected recovery time interval in step (4)
Figure FDA0004102817920000026
Is obtained according to the following formula:
Figure FDA0004102817920000027
wherein ,
Figure FDA0004102817920000028
to the estimated time of arrival generated from the standard CGR, t c Is the current time.
5. The naive bayes-based assisted contact map routing method according to claim 1, wherein P (y=1) represents an unreliability probability of a transmitted packet at a local node, and is obtained according to the following formula:
Figure FDA0004102817920000029
6. the naive bayes-assisted contact map routing method of claim 1 wherein P # -<S k ,l'n'>Y=1) indicates that the node pair l 'n' is in state S without a packet being transmitted k Is obtained according to the following formula:
Figure FDA00041028179200000210
7. the naive-based of claim 1The Bayesian aided contact map routing method is characterized in that the method comprises the following steps of<S k ,l'n'>) Indicating that node pair l 'n' is in state S k Is obtained according to the following formula:
Figure FDA0004102817920000031
wherein ,
Figure FDA0004102817920000032
p (l 'n') is the probability that a data transmission occurs between l 'n',
Figure FDA0004102817920000033
8. a computer readable storage medium storing a computer program for performing the naive bayes-based contact map routing method of any of claims 1-7.
CN202111159351.3A 2021-09-30 2021-09-30 Naive Bayesian-assisted contact graph routing method and storage medium Active CN114024891B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111159351.3A CN114024891B (en) 2021-09-30 2021-09-30 Naive Bayesian-assisted contact graph routing method and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111159351.3A CN114024891B (en) 2021-09-30 2021-09-30 Naive Bayesian-assisted contact graph routing method and storage medium

Publications (2)

Publication Number Publication Date
CN114024891A CN114024891A (en) 2022-02-08
CN114024891B true CN114024891B (en) 2023-05-26

Family

ID=80055373

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111159351.3A Active CN114024891B (en) 2021-09-30 2021-09-30 Naive Bayesian-assisted contact graph routing method and storage medium

Country Status (1)

Country Link
CN (1) CN114024891B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108965879A (en) * 2018-08-31 2018-12-07 杭州电子科技大学 A kind of Space-time domain adaptively just perceives the measure of distortion

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10257655B2 (en) * 2016-05-13 2019-04-09 Raytheon Company Contact graph generation for mobile and ground station nodes
CN108076158B (en) * 2018-01-08 2020-07-03 苏州大学 Minimum load route selection method and system based on naive Bayes classifier
CN112803988B (en) * 2021-01-25 2022-08-02 哈尔滨工程大学 Hybrid contact graph routing method based on link error rate prediction

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108965879A (en) * 2018-08-31 2018-12-07 杭州电子科技大学 A kind of Space-time domain adaptively just perceives the measure of distortion

Also Published As

Publication number Publication date
CN114024891A (en) 2022-02-08

Similar Documents

Publication Publication Date Title
Araniti et al. Contact graph routing in DTN space networks: overview, enhancements and performance
CN109041010B (en) Vehicle-mounted delay tolerant network data forwarding method based on half-naive Bayes classifier
CN112803988B (en) Hybrid contact graph routing method based on link error rate prediction
CN112261681B (en) Low earth orbit satellite DTN network routing path selection method and system
Yang et al. TCSC: A novel file distribution strategy in integrated LEO satellite-terrestrial networks
Peng et al. FNTAR: A future network topology-aware routing protocol in UAV networks
CN116248164A (en) Fully distributed routing method and system based on deep reinforcement learning
CN107360093A (en) Unmanned plane and satellite hybrid network communication routing method and system
Yi et al. Satellite constellation of MEO and IGSO network routing with dynamic grouping
CN113258982A (en) Satellite information transmission method, device, equipment, medium and product
Wen et al. Delay‐Constrained Routing Based on Stochastic Model for Flying Ad Hoc Networks
Madoery et al. Routing heterogeneous traffic in delay-tolerant satellite networks
CN114024891B (en) Naive Bayesian-assisted contact graph routing method and storage medium
Wu et al. A novel DTN routing algorithm in the GEO-relaying satellite network
CN110417572B (en) Method for predicting message transfer node based on target node meeting probability
CN115297045B (en) Low-orbit satellite network-oriented flooding topology construction method, device and storage medium
Wan et al. A hybrid multiple copy routing algorithm in space delay-tolerant networks
Dana et al. Backup path set selection in ad hoc wireless network using link expiration time
CN116938322B (en) Networking communication method, system and storage medium of space-based time-varying topology
Lent Evaluation of cognitive routing for the interplanetary internet
Sarangi Malicious Attacks Detection Using Trust Node Centric Weight Management Algorithm in Vehicular Platoon
Bhering et al. Multipath Selection Mechanism for Wireless Video-Surveillance Systems.
Bhagyavathi et al. A novel method for multipath routing using cross layer approach in vehicular adhoc networks
Sinha et al. Challenged networks to challenged computing: an untapped potential for future space exploration
Teixeira et al. Preemptive network selection for v2v communication

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