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

A Congestion Control Method for Deleting and Transferring Messages Simultaneously

A technology for transferring messages and congestion control, applied in digital transmission systems, electrical components, transmission systems, etc., can solve problems such as reducing the arrival rate of messages, and achieve the effect of ensuring the arrival rate

Active Publication Date: 2016-08-24
江苏安岚特智能科技有限公司
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Both discarding and transferring messages are to reduce node congestion, but simply discarding messages will reduce the message arrival rate, and this strategy requires a reasonable selection of messages to be deleted

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 Congestion Control Method for Deleting and Transferring Messages Simultaneously
  • A Congestion Control Method for Deleting and Transferring Messages Simultaneously
  • A Congestion Control Method for Deleting and Transferring Messages Simultaneously

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The principles and features of the present invention are described below in conjunction with the accompanying drawings, and the examples given are only used to explain the present invention, and are not intended to limit the scope of the present invention.

[0025] figure 1 Shown is the process of the traditional congestion control method using the message deletion strategy. When a node is congested, it selects the message to be deleted according to the corresponding strategy, such as the Drop-front strategy: simply discard the first received message; the Drop-oldest strategy : Drop the message with the minimum remaining time to live; Drop-last strategy: Drop the latest message received in the buffer space; Drop-youngest strategy: Drop the message with the largest remaining time to live. When selecting a message for transfer, the forwarding priority is calculated according to the cost of the message reaching the destination node and the number of times the message is fo...

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 relates to a congestion control method. The method comprises steps: when a node is congested, calculating the storage value of each message of a congestion node, and deleting the message with the minimum storage value; utilizing the congestion node to select the message with the minimum transmission probability so as to report a message transmission request to an adjacent node; if the idle buffer memory space of the adjacent node can satisfy the requirement of the message to be transferred and the storage value of the message to be transferred is more than the minimum value of the storage values of other messages in the adjacent node, calculating the receiving vale of the message to be transferred in the adjacent node and replying to the congestion node; and after the congestion node receives the reply of the adjacent node, transferring the message to be transferred to the adjacent node with the maximum receiving value, and deleting the message. By utilizing the method, the message arrival rate can be obviously improved, and the end-to-end delay of the message is reduced to a proper extent.

Description

technical field [0001] The invention relates to a congestion control method for simultaneously deleting and transferring messages in an opportunistic network. Congested nodes delete messages with minimum storage value and transfer messages with minimum forwarding probability to neighboring nodes. It is mainly used to improve the arrival rate of messages and reduce the end-to-end delay of messages to a certain extent. It belongs to the field of wireless network technology. Background technique [0002] An opportunistic network is a new type of self-organizing network. The links between nodes are frequently broken, and it is difficult for the communicating parties to find a complete end-to-end link. The nodes use the "store-carry-forward" method to transfer messages. Congestion control is one of the key technologies of opportunistic networks. When nodes are congested, messages should be reasonably selected to be deleted; secondly, some messages should be transferred to nodes ...

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/801
Inventor 张登银崔磊杨敏
Owner 江苏安岚特智能科技有限公司
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