Contact graph routing algorithm based on stochastic linear network coding in deep space communication

A random linear, network coding technology, applied in the field of communication, can solve the problems of asymmetric forward and reverse link transmission rates, harsh deep space communication environment, few communication opportunities, etc., to improve the reliability of the first transmission, enhance the Network robustness, the effect of reducing the number of retransmissions

Active Publication Date: 2018-12-18
STATE GRID CHONGQING ELECTRIC POWER CO ELECTRIC POWER RES INST +2
View PDF5 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Except for the moon, the one-way propagation delay from the earth to other celestial bodies ranges from 2.2 minutes to 7 hours. Reliable transmission poses great challenges
[0004] (2) The link is interrupted intermittently
[0005] (3) The transmission rates of forward and reverse links in deep space are seriously asymmetric
This asymmetric link makes reliable interaction between nodes very difficult, and it is difficult to obtain information about network topology changes in real time.
[0006] (4) Node resources are limited
Nodes in deep space are sparse, and communication opportunities are few. Satellite nodes are affected by factors such as weight, size, power supply facilities, and cost. The number, storage space, and processing capacity of nodes are severely limited.
[0007] (5) The path loss is serious, the signal-to-noise ratio at the receiving end is extremely low, and the bit error rate is high
[0008] To sum up, the deep space communication environment is extremely harsh, which is not conducive to the reliable transmission of data

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Contact graph routing algorithm based on stochastic linear network coding in deep space communication
  • Contact graph routing algorithm based on stochastic linear network coding in deep space communication
  • Contact graph routing algorithm based on stochastic linear network coding in deep space communication

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0077] Embodiment 1: as Figure 1 to Figure 10 Shown; a contact graph routing algorithm based on stochastic linear network coding in deep space communication, which includes:

[0078] S1: The source node uses random linear network coding to process the data packets to be sent, and limits the number of coded packets sent according to the link state information;

[0079] S2: The source node selects multiple link disjoint paths according to the predicted contact graph, and transmits the encoded packets on multiple paths;

[0080] S3: Directly forward the received data packet at the intermediate node with an in-degree greater than 1, and re-encode it before forwarding;

[0081] S4: The destination node performs decoding prediction after receiving a certain number of data packets, and feeds back the data packets that cannot be successfully decoded to the previous hop node set, and the previous hop node set gives priority to sending encoded packets that are helpful for the destinat...

Embodiment 2

[0128] Embodiment 2: as Figure 1 to Figure 9 Shown; a contact graph routing algorithm based on stochastic linear network coding in deep space communication, which includes: multipath path finding, source node coding, partial intermediate node recoding and destination node decoding prediction.

[0129] First, the source node uses random linear network coding to process the data packets to be sent, and limits the number of coded packets sent according to the link state information, ensuring that the destination node can decode successfully and reduce the waste of network resources.

[0130] Secondly, the source node selects multiple link disjoint paths according to the predicted contact graph, and transmits the encoded packets on multiple paths, effectively utilizing the contact opportunities between nodes.

[0131] Thirdly, the received data packets are directly forwarded at the intermediate nodes with an in-degree greater than 1 to reduce the data processing amount of the int...

Embodiment 3

[0200] Embodiment 3, network coding is mainly divided into intra-stream coding and inter-stream coding. Intra-stream encoding mainly encodes the data generated by the same source node. By dividing the data packets of the same data stream into segments of the same size, and then dividing each segment into m data packets of the same size and performing encoding iterations on them, the receiving end only needs to It needs to receive more than m linearly independent coding packets to completely decode the original data packet of this segment with a high probability, improve the fault tolerance performance of the network, and exchange the reliability of data transmission through the computational complexity of the algorithm. Inter-stream coding refers to encoding multiple data packets generated by different data streams at the intermediate node, and multicasting the encoded packets, so that multiple receiving nodes can decode the data packets they need, reducing data traffic. The n...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a contact graph routing algorithm based on random linear network coding in deep space communication. The contact graph routing algorithm comprises the following steps: a sourcenode processes a data packet to be sent by adopting random linear network coding; the source node selects a plurality of link disjoint paths according to the predicted contact graph and transmits theencoded packets on the plurality of paths. the received data packet is directly forwarded at the intermediate node and re-encoded before forwarding; the destination node receives the data packets anddecodes them, and feeds back the packets which cannot be decoded successfully to the last hop node set, the last hop node set sends the encoded packets which are helpful to the destination node decoding, so that the destination node can decode the packets quickly and reduce the transmission delay. The invention adopts random linear network coding to send the original data, and controls the redundant data packets in the network through the link state to ensure that the destination node can be decoded while reducing the waste of network resources and reducing the decoding waiting time delay ofthe node.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a contact graph routing algorithm based on random linear network coding in deep space communication. Background technique [0002] In the "Radio Regulations" formulated by the World Radio Management Conference, the distance from the earth 2×10 6 The space within km is called near space, and the space beyond this distance is called deep space. my country's aerospace industry directly defines the vast space from the earth to the moon as deep space. Deep space communication covers all communication between probes and planets in space. Compared with ground communication, the characteristics of deep space communication mainly include: [0003] (1) The distance between nodes is long, and the propagation delay is huge and time-varying. The periodic movement of the satellite makes the propagation delay between nodes change, and the link is interrupted intermittently. Except for...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04W40/02H04W40/12H04W40/24H04L1/00H04L1/18
CPCH04L1/0056H04L1/1816H04W40/02H04W40/125H04W40/246H04W40/248
Inventor 梁花徐鑫朱珠李洋韩世海晏尧雷娟张森戴豪礽张伟景钰文於舰徐瑞林陈涛宫林胡晓锐籍勇亮
Owner STATE GRID CHONGQING ELECTRIC POWER CO ELECTRIC POWER RES INST
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products