Unlock instant, AI-driven research and patent intelligence for your innovation.

Opportunistic routing method and device based on number of dynamic copies and transmission priorities

A priority and copy technology, applied in the direction of digital transmission system, transmission system, advanced technology, etc., can solve the problems of message delivery rate, end-to-end delay performance degradation, bandwidth overhead and memory overhead reduction, etc.

Active Publication Date: 2021-02-23
CETHIK GRP
View PDF11 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The advantage of this type of algorithm is that it can effectively limit the number of redundant forwarding of messages, reducing bandwidth overhead and memory overhead. The disadvantage is that compared with the flooding algorithm, the message delivery rate and end-to-end delay performance may be reduced

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
  • Opportunistic routing method and device based on number of dynamic copies and transmission priorities
  • Opportunistic routing method and device based on number of dynamic copies and transmission priorities
  • Opportunistic routing method and device based on number of dynamic copies and transmission priorities

Examples

Experimental program
Comparison scheme
Effect test

specific example

[0130] In order to facilitate the understanding of this application's opportunistic routing method based on dynamic replica number and transmission priority, such as Figure 4 As shown, a specific example is provided as follows:

[0131] 1) When the current node s encounters a new node i, the two nodes exchange the carrying vector CV and delivery vector DV, etc., and execute the data update process.

[0132] Such as Figure 5 As shown, the specific steps of the data update process here are as follows: when node i is encountered, the average equivalent contact time of nodes s and i is updated; the contact intensity CD of nodes s and i is calculated s and CD i and well-known set difference d si and dis; respectively calculate the quality metric Q(s) of this node and the quality metric Q(i) of node i.

[0133] The local node s updates the local DV vector according to the DV vector from node i: for each element z in the DV vector of node i, if the local DV vector does not cont...

Embodiment 2

[0162] This embodiment discloses an opportunistic routing device based on the number of dynamic copies and transmission priority, which includes a processor and a memory storing several computer instructions. Steps in an opportunistic routing approach with dynamic replica number and transfer priority.

[0163] For the specific limitations of the opportunistic routing device based on the dynamic number of copies and the transmission priority, refer to the above-mentioned limitation on the opportunistic routing method based on the dynamic number of copies and the transmission priority, which will not be repeated here. Each module in the above-mentioned opportunistic routing device based on the number of dynamic copies and transmission priority can be fully or partially realized by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, and can also be stored in th...

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 an opportunistic routing method and device based on the number of dynamic copies and transmission priorities, and the method comprises the steps: carrying out the exchange of acarrying vector CV and a delivery vector DV when a node s meets a node i in a delay tolerant network, and executing a data updating process; executing a preprocessing process on the message cached bythe node s according to the updated data of the node s, and generating a to-be-sent message list L; sorting the messages in the to-be-sent message list L according to a preset transmission priority to obtain a sorted to-be-sent message list L'; and sending the message according to the sorted to-be-sent message list L'. Transmission of redundant messages is effectively reduced by sending deliveryvectors and carrying vector adjustment messages, bandwidth resources and storage capacity resources of nodes are saved, the number of copies of sent messages is dynamically adjusted by utilizing nodequality attributes, the possibility that high-quality nodes complete data delivery is improved, and the message delivery rate and the end-to-end delay performance of the network are improved on the whole.

Description

technical field [0001] The present application belongs to the technical field of delay tolerant networks, and in particular relates to an opportunistic routing method and device based on dynamic copy number and transmission priority. Background technique [0002] Delay tolerant networks represent a new type of communication. The premise of this communication method is that the network topology changes frequently, and there is no guarantee of a stable and complete route between the source node and the destination node. Since the data can only be exchanged by temporarily establishing communication connections between nodes, the nodes in the delay-tolerant network can only adopt the basic working mechanism of "store-carry-forward". Similar to traditional wireless ad hoc networks, one of the core problems to be solved in delay-tolerant networks is how to design a routing layer algorithm with high efficiency and low overhead. [0003] Most of the existing routing algorithms 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): H04L12/741H04L12/751H04L12/757H04L45/02H04L45/74
CPCH04L45/02H04L45/023H04L45/74Y02D30/70
Inventor 赵明傅晨恩何成东
Owner CETHIK GRP