CN109039934A - A kind of space DTN method for controlling network congestion and system - Google Patents
A kind of space DTN method for controlling network congestion and system Download PDFInfo
- Publication number
- CN109039934A CN109039934A CN201810940501.6A CN201810940501A CN109039934A CN 109039934 A CN109039934 A CN 109039934A CN 201810940501 A CN201810940501 A CN 201810940501A CN 109039934 A CN109039934 A CN 109039934A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- congestion
- probability
- space
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of space DTN method for controlling network congestion and systems, belong to technical field of satellite communication.The method of the present invention are as follows: in the DTN network of space, if node vjWith node viIt meets, and message will be from node vjIt is transmitted to node vi, then according to node viIt caches occupied state and neighbor node quantity estimates node viCongestion probability after receiving message；Node viMessage is rejected with congestion probability, if node viMessage is rejected, then node viRefuse information input, node vjContinue to save message, waiting meets at trial transmission message next time；Otherwise node viReceived message input.The invention also achieves a kind of space DTN network congestion control systems；Technical solution of the present invention is used for space DTN network, can effectively reduce the generation of node congestion, and reduce the drop probability of whole network message, improves network performance.
Description
Technical field
The invention belongs to technical field of satellite communication, more particularly, to a kind of space DTN method for controlling network congestion and
System.
Background technique
In space in DTN (Delay Tolerant Networks, i.e. time delay tolerant network) network, due to space environment
Middle spacecraft node mostly uses aerospace grade chip, and the storage resource of each node is limited, whithin a period of time, the part in network
Node may undertake more information transmission tasks for other nodes, this may cause the slow of message race node
Deposit (Buffer) resource.Especially in deep space communication, time delay is bigger end to end, message may need by it is one section longer when
Between storage can just be forwarded to next-hop, this makes the cache management (including caching distribution, cache management strategy etc.) of node
Seem extremely important；
In addition, in DTN protocol architecture, what is taken to the transmission of message is " storage-carrying-forwarding " strategy, when not having
When encountering suitable relay node and cannot send the message received in time, node can only cache these message.However, due to sky
Between DTN nodes storage resource be it is limited, when received message has exceeded buffer memory capacity, congestion will occur.
Message drop policy used by traditional congestion control method is unsuitable for space DTN network, because very big in a time delay
In the DTN network of space, it is too high to retransmit message cost.Therefore, the jamming control method of space DTN network must aim in congestion
The loss ratio of message is reduced when generation.Since the touch opportunity between space nodes is limited, after congestion occurs, limited section is utilized
Touch opportunity between point may be difficult to alleviate congestion, so, congestion control policy preferably carries out before congestion occurs, with as far as possible
Prevent that nodal cache from exhausting and has to abandon message.
Summary of the invention
Aiming at the above defects or improvement requirements of the prior art, the present invention provides a kind of space DTN web impact factors
Method and system, its object is to when a new message arrives, according to the neighbor node of the locally available caching of space nodes and it
The probability of congestion occurs for quantity, estimation node, thus the message then reached with probability refusal solves existing space DTN net
The technical issues of network congestion control.
To achieve the above object, the present invention provides a kind of space DTN method for controlling network congestion, the method includes with
Lower step:
(1) in the DTN network of space, if node vjWith node viIt meets, and message will be from node vjIt is transmitted to node vi,
Then according to node viIt caches occupied state and neighbor node quantity estimates node viCongestion probability after receiving message；
(2) it is used for node viMessage is rejected with congestion probability, if node viMessage is rejected, then is entered step
(3), (4) are otherwise entered step；
(3) node viRefuse information input, node vjContinue to save message, waiting meets at trial transmission message next time；
(4) node viReceived message input.
Further, described according to node viIt caches occupied state and neighbor node quantity estimates node viReceive message
Congestion probability afterwards specifically:
Wherein, Pr iFor node viCongestion probability after receiving message；Node viCaching total amount is Ki, caching surplus is ki；Section
Point viWith miA neighbors, and the message count that each neighbors carries is not less than ki；If the capacity and list of single cache unit
A message it is equal in magnitude.
It is another aspect of this invention to provide that the present invention provides a kind of space DTN network congestion control system, the system
It specifically includes:
Congestion probability estimation module is used in the DTN network of space, if node vjWith node viIt meets, and message will be from section
Point vjIt is transmitted to node vi, then according to node viIt caches occupied state and neighbor node quantity estimates node viAfter receiving message
Congestion probability；
Probability selection module is used for node viMessage is rejected with congestion probability, if node viMessage is rejected, then
Refuse information input module is executed, received message input module is otherwise executed；
Refuse information input module is used for node viRefuse information input, node vjContinue to save message, wait next time
Meet at trial transmission message；
Received message input module is used for node viReceived message input.
Further, described according to node viIt caches occupied state and neighbor node quantity estimates node viReceive message
Congestion probability afterwards specifically:
Wherein, Pr iFor node viCongestion probability after receiving message；Node viCaching total amount is Ki, caching surplus is ki；Section
Point viWith miA neighbors, and the message count that each neighbors carries is not less than ki；If the capacity and list of single cache unit
A message it is equal in magnitude.
In general, through the invention it is contemplated above technical scheme is compared with the prior art, have following technology special
Sign and the utility model has the advantages that
The status information of the whole network is obtained since space DTN network node is more difficult, congestion control mechanism should be saved based on space
The local information of point, and it is best independent of Routing Protocol, can easily be merged with Routing Protocol realization, because of the invention skill
Art scheme proposes that one is delayed in the DTN network of space based on node from the cache management angle in the DTN network communications scenarios of space
The congestion avoidance algorithm for depositing state and neighbor node number shows that this jamming control method can effectively reduce by emulation
The generation of node congestion, and the drop probability of whole network message is reduced, improve network performance.
Detailed description of the invention
Fig. 1 is the flow diagram of the method for the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, not
For limiting the present invention.As long as in addition, technical characteristic involved in the various embodiments of the present invention described below that
Not constituting conflict between this can be combined with each other.
As shown in Figure 1, the method for the present invention specifically:
If node viWith miA neighbor node, caching total amount are Ki, the capacity of single cache unit and single message it is big
It is small equal.In moment t, if node viCaching surplus be ki, and the message count that each neighbor node carries is not less than ki, then
Since t, node viHaveKind is likely to be received kiA message, and node viIt is possible that receiving 0 to kiA message,
Therefore total possible number of reception message is
As node viReceive kiA message, then node viCaching exhaust, congestion, therefore node v occursiCongestion occurs
Probability are as follows:
If mi=1, i.e. node viOnly one neighbor node, then node viReceived all message are both from this neighbour
Node, under such situation, node viThe probability of congestion occurs are as follows:
Comprehensively consider above two situation, node viThe probability that congestion occurs can be expressed as:
Since the communication opportunity of space DTN network is limited, may delay without available communication opportunity after congestion generation
Congestion is solved, therefore, congestion control preferably carries out before congestion occurs.In the present invention, by establishing early detection congestion mechanism, when
When thering are other nodes to send message, node viThe probability of congestion occurs for estimation, and is new according to rejection with this congestion probability
The message arrived, even estimation obtain node the probability of congestion occurs being 0.8, then the probability that the message newly arrived is rejected is exactly 0.8,
Caching of node is managed with this, so that node is avoided congestion as much as possible.Congestion probabilityWith caching surplus kiRelationship
It can be exported by (4) formula:
By (5) it is found that Pr iWith kiIt is negatively correlated, kiIt is bigger, then node viThe probability that congestion occurs is smaller, newly arrives message quilt
Received probability is bigger.
The detailed process of the method for the present invention is as shown in following steps:
The above content as it will be easily appreciated by one skilled in the art that the foregoing is merely illustrative of the preferred embodiments of the present invention,
It is not intended to limit the invention, any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention,
It should all be included in the protection scope of the present invention.
Claims (4)
1. a kind of space DTN method for controlling network congestion, which is characterized in that the described method comprises the following steps:
(1) in the DTN network of space, if node vjWith node viIt meets, and message will be from node vjIt is transmitted to node vi, then basis
Node viIt caches occupied state and neighbor node quantity estimates node viCongestion probability after receiving message；
(2) node viMessage is rejected with congestion probability, if node viReject message, then enter step (3), otherwise into
Enter step (4)；
(3) node viRefuse information input, node vjContinue to save message, waiting meets at trial transmission message next time；
(4) node viReceived message input.
2. a kind of space DTN method for controlling network congestion according to claim 1, which is characterized in that described according to node vi
It caches occupied state and neighbor node quantity estimates node viCongestion probability after receiving message specifically:
Wherein,For node viCongestion probability after receiving message；Node viCaching total amount is Ki, caching surplus is ki；Node vi
With miA neighbors, and the message count that each neighbors carries is not less than ki；If the capacity of single cache unit with individually disappear
What is ceased is equal in magnitude.
3. a kind of space DTN network congestion control system, which is characterized in that the system comprises:
Congestion probability estimation module is used in the DTN network of space, if node vjWith node viIt meets, and message will be from node vj
It is transmitted to node vi, then according to node viIt caches occupied state and neighbor node quantity estimates node viGathering around after receiving message
Fill in probability；
Probability selection module is used for node viMessage is rejected with congestion probability, if node viMessage is rejected, then is executed
Otherwise refuse information input module executes received message input module；
Refuse information input module is used for node viRefuse information input, node vjContinue to save message, waiting is met next time
It is attempting to transmit message；
Received message input module is used for node viReceived message input.
4. a kind of space DTN network congestion control system according to claim 3, which is characterized in that described according to node vi
It caches occupied state and neighbor node quantity estimates node viCongestion probability after receiving message specifically:
Wherein,For node viCongestion probability after receiving message；Node viCaching total amount is Ki, caching surplus is ki；Node vi
With miA neighbors, and the message count that each neighbors carries is not less than ki；If the capacity of single cache unit with individually disappear
What is ceased is equal in magnitude.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810940501.6A CN109039934B (en) | 2018-08-17 | 2018-08-17 | Space DTN network congestion control method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810940501.6A CN109039934B (en) | 2018-08-17 | 2018-08-17 | Space DTN network congestion control method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109039934A true CN109039934A (en) | 2018-12-18 |
| CN109039934B CN109039934B (en) | 2020-09-18 |
Family
ID=64630848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810940501.6A Active CN109039934B (en) | 2018-08-17 | 2018-08-17 | Space DTN network congestion control method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109039934B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110099410A (en) * | 2019-05-28 | 2019-08-06 | 北京航空航天大学 | For facing the DTN distributed caching method and equipment of empty wagons earth mat |
| CN110351200A (en) * | 2019-08-16 | 2019-10-18 | 东北大学秦皇岛分校 | A kind of opportunistic network jamming control method based on forwarding task immigration |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110211535A1 (en) * | 2008-10-23 | 2011-09-01 | Norihito Fujita | Network communication system, node device, routing method and routing program |
| US20110227757A1 (en) * | 2010-03-16 | 2011-09-22 | Telcordia Technologies, Inc. | Methods for context driven disruption tolerant vehicular networking in dynamic roadway environments |
| CN104159256A (en) * | 2014-08-29 | 2014-11-19 | 大连大学 | Congestion control method based on delay tolerant satellite network |
| CN104270324A (en) * | 2014-10-16 | 2015-01-07 | 中国电子科技集团公司第五十四研究所 | Congestion control method suitable for limited satellite network |
| CN106953803A (en) * | 2017-02-28 | 2017-07-14 | 北京科技大学 | A kind of improvement probabilistic routing method based on deep space delay-tolerant network |
| CN108156090A (en) * | 2018-03-15 | 2018-06-12 | 北京邮电大学 | Based on the optimal arrival rate method for routing of satellite DTN web impact factors |
-
2018
- 2018-08-17 CN CN201810940501.6A patent/CN109039934B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110211535A1 (en) * | 2008-10-23 | 2011-09-01 | Norihito Fujita | Network communication system, node device, routing method and routing program |
| US20110227757A1 (en) * | 2010-03-16 | 2011-09-22 | Telcordia Technologies, Inc. | Methods for context driven disruption tolerant vehicular networking in dynamic roadway environments |
| CN104159256A (en) * | 2014-08-29 | 2014-11-19 | 大连大学 | Congestion control method based on delay tolerant satellite network |
| CN104270324A (en) * | 2014-10-16 | 2015-01-07 | 中国电子科技集团公司第五十四研究所 | Congestion control method suitable for limited satellite network |
| CN106953803A (en) * | 2017-02-28 | 2017-07-14 | 北京科技大学 | A kind of improvement probabilistic routing method based on deep space delay-tolerant network |
| CN108156090A (en) * | 2018-03-15 | 2018-06-12 | 北京邮电大学 | Based on the optimal arrival rate method for routing of satellite DTN web impact factors |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110099410A (en) * | 2019-05-28 | 2019-08-06 | 北京航空航天大学 | For facing the DTN distributed caching method and equipment of empty wagons earth mat |
| CN110099410B (en) * | 2019-05-28 | 2021-02-05 | 北京航空航天大学 | DTN distributed caching method and device for temporary empty vehicle ground network |
| CN110351200A (en) * | 2019-08-16 | 2019-10-18 | 东北大学秦皇岛分校 | A kind of opportunistic network jamming control method based on forwarding task immigration |
| CN110351200B (en) * | 2019-08-16 | 2022-07-01 | 东北大学秦皇岛分校 | Opportunistic network congestion control method based on forwarding task migration |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109039934B (en) | 2020-09-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8831023B2 (en) | Low latency mesh network | |
| CN108540204B (en) | Satellite network topology generation method using fast convergence ant colony algorithm | |
| CN108173766B (en) | Multi-service hierarchical topological routing method based on differentiated QoS | |
| CN102883397B (en) | Data forwarding method of delay/disruption tolerant network (DTN) facing space environment | |
| CN113691598B (en) | Cooperative caching method for satellite-ground converged network | |
| CN108449270A (en) | Buffer memory management method priority-based in opportunistic network | |
| CN110351200B (en) | Opportunistic network congestion control method based on forwarding task migration | |
| CN107846706A (en) | A kind of coding cognitive radio mesh network multipaths footpath method for routing of Congestion Avoidance | |
| CN105407048A (en) | Delay tolerant network node cache management method facing epidemic and probabilistic hybrid routing | |
| CN109039934A (en) | A kind of space DTN method for controlling network congestion and system | |
| CN111132236B (en) | Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol | |
| CN106506373A (en) | A kind of delay-tolerant network route and cache management strategy based on non-cooperation game theory | |
| Rashid et al. | Integrated sized-based buffer management policy for resource-constrained delay tolerant network | |
| CN110191486A (en) | A kind of moving machine meeting method for controlling network congestion based on message coverage rate | |
| Zheng et al. | A QoS Routing Protocol for Mobile Ad Hoc Networks Based on Multipath. | |
| CN116782330A (en) | Method and medium for selecting path in SD-UANET by considering load and link change | |
| CN115604311B (en) | Cloud fusion computing system oriented to service network and self-adaptive routing method | |
| CN105228196A (en) | A kind of delay-tolerant network nodal cache management method being applicable to the Effect-based operation weight of many copies route | |
| CN103312619B (en) | A kind of deletion simultaneously and the jamming control method of Transfer Message | |
| CN102497325B (en) | DTN routing method based on reliable information distribution | |
| CN105072046A (en) | Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node | |
| CN105188088B (en) | Caching method and device based on content popularit and node replacement rate | |
| CN105263122B (en) | A kind of radio transmission optimization method based on RS coding | |
| CN105188086B (en) | A kind of delay-tolerant network congestion-preventing approach of the nodal cache release towards Epidemic routing algorithm | |
| CN106454940A (en) | Load balancing method in wireless mesh network |
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 |