Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Routing Algorithm Based on Forwarding Probability

A technology of forwarding probability and algorithm, applied in the field of routing algorithm based on forwarding probability, can solve the problems of limited node energy, increased message transmission delay, sparse node distribution, etc.

Active Publication Date: 2020-08-04
DAWNING INFORMATION IND BEIJING +1
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] However, the existing copy control routing algorithm has a lot of blindness when allocating message copy quotas. The source node will allocate a certain copy quota for any node it meets, without considering the message forwarding ability of the meeting node. The nodes in the DTN network have the characteristics of sparse distribution and limited energy of the nodes, so that there will be nodes in the DTN that only move in local areas and nodes that are about to run out of energy or have exhausted their capabilities. The allocation of message copy quotas to the above types of nodes will greatly affect the transmission performance of messages. In addition, the routing strategy will wait until the destination node is encountered before forwarding message copies during the waiting phase. There is a passive problem, which will Increase message transmission delay

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
  • A Routing Algorithm Based on Forwarding Probability
  • A Routing Algorithm Based on Forwarding Probability
  • A Routing Algorithm Based on Forwarding Probability

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0042] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. All other embodiments obtained by persons of ordinary skill in the art based on the embodiments of the present invention belong to the protection scope of the present invention.

[0043] According to an embodiment of the present invention, a forwarding probability routing algorithm is provided.

[0044] Such as figure 1 As shown, the routing algorithm according to the embodiment of the present invention includes: wherein, the distributing phase includes:

[0045] Step S101, the source node A and the relay node B carrying the message M meet, and the source node A and the relay node B exchange their respective forwarding probability vector values ​​to update the forward...

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 present invention proposes a routing algorithm based on forwarding probability, through which the blindness in allocating message copy quotas and the passivity of message copy forwarding are avoided, and message delivery can be completed with fewer times of copying and forwarding, so the routing algorithm The algorithm has a higher message transmission success rate, lower transmission delay when the node cache is relatively large, and higher routing performance.

Description

technical field [0001] The present invention relates to the field of communication, in particular to a routing algorithm based on forwarding probability. Background technique [0002] So far, the networks we have encountered (whether wired or wireless) are based on the following assumptions: there is an end-to-end path between the data source and the destination for the duration of the communication; the maximum round-trip time between nodes will not be too large. Long, the packet loss rate is small. However, there are still a class of networks that do not satisfy the above assumptions in practice, such as deep space network (very long delay), satellite network (periodic connection), sparse mobile ad hoc network (frequent interruption), etc., the existing network architecture and None of the protocols are suitable for this type of network. Such networks are collectively referred to as challenged networks. [0003] In 1998, NASA started research on the Deep Space Network (...

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 Patents(China)
IPC IPC(8): H04L12/721H04L12/751H04L45/02
CPCH04L45/02H04L45/14
Inventor 夏爽张晋锋王盈盈赵欢
Owner DAWNING INFORMATION IND BEIJING
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com