CN110191486A - A kind of moving machine meeting method for controlling network congestion based on message coverage rate - Google Patents
A kind of moving machine meeting method for controlling network congestion based on message coverage rate Download PDFInfo
- Publication number
- CN110191486A CN110191486A CN201910399846.XA CN201910399846A CN110191486A CN 110191486 A CN110191486 A CN 110191486A CN 201910399846 A CN201910399846 A CN 201910399846A CN 110191486 A CN110191486 A CN 110191486A
- Authority
- CN
- China
- Prior art keywords
- message
- coverage rate
- node
- network
- ack
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
Abstract
The invention discloses a kind of, and the moving machine based on message coverage rate understands method for controlling network congestion, and the spread condition of message in a network is dynamically indicated by coverage rate, carries out control operation to transmission, storage, the discarding of message in a network according to spread condition；This method includes following strategy: drop policy, and when the caching deficiency of node, the message that coverage rate is big in the node is preferentially deleted according to drop policy；ACK active deleting mechanism removes the message being successfully transmitted in caching using ACK active deleting mechanism in message transmission phase；Queuing mechanism based on coverage rate sorts to message queue to be sent according to message coverage rate size using the queuing mechanism based on message coverage rate, preferential to send the small message of coverage rate, is more than the message of given threshold value for coverage rate, then not forwards.The present invention can dynamically adjust transmission, discarding and the active deletion strategy of message in a network, so that message dilivery rate is higher, and network load rate is lower.
Description
Technical field
The present invention relates to mobile agency meeting network fields more particularly to a kind of mobile opportunistic network based on message coverage rate to gather around
Fill in control method.
Background technique
As the perception, calculating and communication capacity of various mobile devices constantly enhance, the movement of these equipment composition is utilized
Opportunistic network can carry out quick sensing to equipment ambient enviroment.Simultaneously as the characteristic that equipment in network is constantly mobile, causes
Network topology structure in this perceptive mode also can frequently change, and the communication mode of conventional wireless sensing network is difficult to effectively transport
Row.Therefore, the mode that a kind of " storage-carrying-forwarding " is used in mobile opportunistic network, by way of multi-hop relay come
Transmitting and forwarding message.
In mobile opportunistic network network topology structure frequently change, node intermittent contacts the characteristics of, cause to disappear in network
The success rate of breath transmission is low, propagation delay time is long.In moving machine meeting algorithm network routing based on more copies, disappear present in network
Breath number can be greater than the message count actually generated in network.Although this can improve the delivery success rate of message to a certain extent,
However excessive message copy can constitute severe challenge to nodal cache and the limited mobile opportunistic network of bandwidth, and network is caused to be gathered around
Fill in phenomenon.Since nodes bandwidth and caching are limited, the design for Congestion Control Algorithm is mobile opportunistic network
In an important research field.The scientific research institution with international aspect domestic in recent years to the research of mobile opportunistic network increasingly
More, in the meeting in many international network fields, participant proposes many important research achievements.It is some studies have shown that
In mobile opportunistic network, the appropriate number of copies for increasing message can increase message dilivery rate, but increased message copy can occupy
The memory space of nodes, and consume the more energy of node.However more copies mean when congestion occurs for node, section
Point can abandon message from its buffer area, without will lead to the disappearance of the message in the entire network.Therefore, in more copy feelings
Under condition, network needs message replication management strategy and message deletion strategy to handle the storage congestion of node.
Summary of the invention
The technical problem to be solved in the present invention is that for the defects in the prior art, providing a kind of based on message coverage rate
Moving machine can method for controlling network congestion.
The technical solution adopted by the present invention to solve the technical problems is:
The present invention provides a kind of moving machine meeting method for controlling network congestion based on message coverage rate, in mobile opportunistic network
Message transmission between middle carry out node calculates the coverage rate of message in a network, dynamically indicates message in net by coverage rate
Spread condition in network carries out control operation to transmission, storage, the discarding of message in a network according to spread condition；This method
Including following strategy:
Drop policy preferentially deletes that coverage rate in the node is big to disappear according to drop policy when the caching deficiency of node
Breath；
ACK active deleting mechanism is removed in caching using ACK active deleting mechanism and has successfully been sent out in message transmission phase
The message sent；
Queuing mechanism based on coverage rate, using the queuing mechanism based on message coverage rate to message queue to be sent according to
The sequence of message coverage rate size, it is preferential to send the small message of coverage rate, it is more than the message of given threshold value for coverage rate, then refuses
Forwarding.
Further, it is whole to indicate that the number of nodes for holding the message in network accounts for for the message coverage rate in this method of the invention
The ratio of a network total node number reflects the diffusion of message in a network；Its calculation formula is:
Wherein,For message mkCoverage rate in a network,To hold message m in networkkNumber of nodes, N is net
Network interior joint sum；
When calculating message coverage rate, to reduce node computation complexity, the update message covering table S after two nodes meet
When, node will not calculate simultaneously and update message coverage rate in table；Only calculated when message queueing and message delete the stage；
And when calculating, it can be arranged and update interval time thresholdTime, only be greater than update interval apart from upper primary renewal time
When time thresholdTime, message coverage rate can be just recalculated, otherwise directly takes the last meter in message covering table S
The value of calculation；When two nodes meet, respective message covering table S is first exchanged, and updates the S table of oneself, is taken by each node
The message covering meter of band calculates the coverage rate of any message.
Further, the message in this method of the invention covers table S, including each message id in network, and message generates
Time createTime, message coverage rate R, the last message coverage rate renewal time T disappear in each of message covering table
Breath is also associated with a node and holds table Q, includes the section in table Q for recording the node in network to the information of holding of the message
Whether point holds message flag flag, and holds record renewal time t.
Further, this method of the invention further includes the method holding table to node and being updated:
Assuming that about message m in node a and node bkNode to hold table be respectively Qa, Qb, node a traversal list Qb, for
Table QbIn each node i, if the node i is in table QaMiddle presence then compares the time t of node i update, if table QbIn t
Greater than middle QaT, illustrate table QbIn renewal time later, at this time use table QbIn hold mark flag, renewal time, t was gone more
New QaIn about node i hold mark flag and renewal time t, if the node i is in table QaIn be not present, then directly by Qb
In about the information of node i be added to QaIn.
Further, this method of the invention further includes the method being updated to message covering table:
When two nodes meet, respective message covering table S is first exchanged, and updates the S table of oneself, for node a,
When it gets the message covering table S for the node b that meetsbWhen table, S is first traversedbTable；For SbMiddle there are each message id, if should
Message id exists in the message covering table S of oneselfaIn table, then it represents that the partial information of itself existing message id only needs at this time
It is updated, if message id is not present in the table S of itselfaIn, then directly by the phase about message id in the node b that meets
Close the table S that information directly replicated and be added to itselfaIn.
Further, the drop policy in this method of the invention specifically:
Drop policy is to select the maximum message of coverage rate from local cache first, then based on message coverage rate
It is compared again with the new coverage rate for receiving message；If the coverage rate of message is greater than new reception message in the local cache selected
Coverage rate, then by the message selected in local delete, receive new information put it into local cache；Otherwise, rejection is new
Message.
Further, the ACK active deleting mechanism in this method of the invention specifically:
ACK active deleting mechanism is the ack table that Successful transmissions message is opened in each node local maintenance one, saves in table every
The message id of a Successful transmissions and generation time createTime of message；Whenever one message of node Successful transmissions to purpose section
When point, message id and message are generated time createTime and are added in the ack table of respective local by transmitting terminal and receiving end；
It when two nodes meet, exchanges first and updates respective ack table, then delete in local cache and be present in disappearing in ack table
Breath.
Further, the queuing mechanism based on coverage rate in this method of the invention specifically:
The message prioritization that queuing mechanism based on coverage rate is used to make coverage rate small is sent, and increases its diffusion in a network
Speed；Correspondingly, the big message delay of coverage rate sends or do not send, the copy sum of message in a network is reduced, is reduced
Network load；It is more than the message of certain value for coverage rate, illustrates that sufficient diffusion has been obtained in it in a network, at this point,
Stop such message to continue to spread.
The beneficial effect comprise that: the moving machine of the invention based on message coverage rate can web impact factor side
Method can dynamically adjust transmission, discarding and the active of message in a network by calculating the coverage rate of different messages in a network
Deletion strategy, so that message dilivery rate is higher, and network load rate is lower.
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples, in attached drawing:
Fig. 1 is that message coverage rate table S of the present invention updates algorithm flow chart；
Fig. 2 is message drop policy algorithm flow chart of the present invention；
Fig. 3 is that node of the present invention holds table Q update algorithmic procedure figure；
Fig. 4 is that message coverage rate R of the present invention updates algorithmic procedure figure；
Fig. 5 is the queuing and copy control algolithm procedure chart when message is sent；
Fig. 6 is message drop policy algorithmic procedure figure of the present invention；
Fig. 7 is ACK active deleting mechanism algorithmic procedure figure of 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.
The moving machine meeting method for controlling network congestion based on message coverage rate of the embodiment of the present invention, by being covered to message
Calculating for rate carrys out the spread condition of dynamic estimation message in a network, further according to spread condition to message transmission in a network,
The stages such as storage, discarding are controlled.The algorithm and traditional DF, DO algorithm based on caching and the MaxProp based on scheduling
Algorithm is compared, and is had a clear superiority in terms of message dilivery rate and network load rate.
Based on the congestion avoidance algorithm of message coverage rate, each node maintenance one opens message covering table S, table S packet in network
Each message id in network is included, message generates time createTime, message coverage rate R, and the last message coverage rate updates
Time T.In addition to this, each message in message covering table is also associated with a node and holds table Q, for recording in network
Node includes whether the node holds message flag flag in table Q to the information of holding of the message, and holds record renewal time
t.Its renewal process is referring to Fig. 3, it is assumed that about message m in node a and node bkNode to hold table be respectively Qa, Qb, node a
Traversal list Qb, for table QbIn each node i, if the node i is in table QaThe time t of node i update is then compared in middle presence,
If table QbIn t be greater than middle QaT, illustrate table QbIn renewal time later, at this time use table QbIn hold mark flag,
Renewal time t goes to update QaIn about node i hold mark flag and renewal time t.If the node i is in table QaIn do not deposit
Then directly by QbIn about the information of node i be added to QaIn.
As shown in Figure 1, first exchanging respective message covering table S when two nodes meet, and the S table of oneself is updated, for
For node a, when it gets the S for the node b that meetsbWhen table, S is first traversedbTable.For SbMiddle there are each message id, if should
Message id exists in the S of oneselfaIn table, then it represents that the partial information of itself existing message id need to only carry out more it at this time
Newly, if message id is not present in the table S of itselfaIn, then it is directly that the relevant information about message id in the node b that meets is direct
Replicate and be added to the table S of itselfaIn.
In addition, when node a generates message mkWhen, the message coverage rate table S that node a is carried with other nodes in network is not
In the presence of the information about message, need to create at this time about message mkInformation.Message id is specifically included, message generates the time
CreateTime, message coverage rate R (original state is set to 1/ | N |), the last message coverage rate renewal time T (is initially set
For present system time) and node hold table Q (only one record about node a of original state, message held in table Q
Flag is true, holds renewal time and is set to present system time).Finally, by generated and message mkRelevant information adds
It adds in the S table of itself.
After having updated the message covering table S of node a and b, meter can be covered by the message that each node carries
Calculate the coverage rate of any message.
Message mkCoverage rate indicate that the number of nodes for holding the message in network accounts for the ratio of whole network total node number, instead
The diffusion of message in a network is reflected.Message coverage rate calculation formula is as follows:
WhereinFor message mkCoverage rate in a network,To hold message m in networkkNumber of nodes, N is network
Interior joint sum.Its renewal process is referring to fig. 4.
Although being met in addition, single node can not know the coverage condition of each message in a network by node
Message covering table afterwards is intercoursed and is updated, and approximate can reflect the diffusion of message in network.It is covered calculating message
When lid rate, to reduce node computation complexity, in update message covering table after two nodes meet, node will not be calculated simultaneously simultaneously
Update message coverage rate in table.Only when message queueing and message delete the stage, on-demand computing.And when calculating, update can be set
Interval time thresholdTime had only been greater than update interval time thresholdTime apart from upper primary renewal time
When, message coverage rate can be just recalculated, otherwise, directly takes the last value calculated in message covering table.
Based on the queuing mechanism of message coverage rate, the message prioritization that coverage rate can be allowed small is sent, and increases it in a network
Diffusion velocity.Correspondingly, the big message delay of coverage rate sends or do not send, it is total that the copy of message in a network can be reduced
Number reduces network load.It is more than that certain value (is assumed to be R for coverage ratemax) message, illustrate that it has been obtained in a network
Sufficient diffusion continues to spread at this point, should stop such message.Specific message queueing and copy control strategy are referring to figure
5.When node a and node b meet, respective message covering table is updated first, message coverage rate in set is greater than given
Threshold value RmaxMessage, it is removed from transmission table.Then start to be lined up local message by message coverage rate.Covering
Rate is small before queue, preferential to send.
As shown in Fig. 2, the drop policy based on message coverage rate can select the maximum message of coverage rate from local cache,
It is compared again with the new coverage rate for receiving message.If the coverage rate of message is greater than new reception message in the local cache selected
Coverage rate, then by the message selected in local delete, receive new information put it into local cache；Otherwise, rejection is new
Message.Node local cache size is got first, if new information size is more than node local cache size, is directly refused
Receive message.Then local remaining cache size is obtained, all message in traversal caching select a coverage rate maximum every time
Message, and be compared with new information, the message coverage rate such as selected is less than the coverage rate of new information, then rejection newly disappears
Breath, otherwise, deletes the message and more new node remaining cache, then proceedes to selection message deletion until there is enough spaces can be with
Until accommodating new information.Specific strategy is referring to Fig. 6.
In ACK active deleting mechanism, the ack table of Successful transmissions message is opened in each node local maintenance one, is saved in table every
The message id of a Successful transmissions and generation time createTime of message.Whenever one message of node Successful transmissions to purpose section
When point, message id and message are generated time createTime and are added in the ack table of respective local by transmitting terminal and receiving end.
It when two nodes meet, exchanges first and updates respective ack table, then delete in local cache and be present in disappearing in ack table
Breath.Specific strategy exchanges respective ack table with b referring to Fig. 7, first node a and the element in other side's table is added to oneself
Ack table.Then node a traverses local ack table, for element in table, first checks for whether the message has expired, expires
It is deleted from ack table then, otherwise, the message is deleted from local cache.
To sum up, the invention discloses a kind of, and the moving machine based on message coverage rate understands Congestion Control Algorithm, by right
Message coverage rate calculate come the spread condition of dynamic estimation message in a network, further according to spread condition to message in a network
The stages such as transmission, storage, discarding controlled.The algorithm is with traditional DF, DO algorithm based on caching and based on scheduling
MaxProp algorithm is compared, and is had a clear superiority in terms of message dilivery rate and network load rate.
It should be understood that for those of ordinary skills, it can be modified or changed according to the above description,
And all these modifications and variations should all belong to the protection domain of appended claims of the present invention.
Claims (8)
1. a kind of moving machine meeting method for controlling network congestion based on message coverage rate, which is characterized in that in mobile opportunistic network
Message transmission between middle carry out node calculates the coverage rate of message in a network, dynamically indicates message in net by coverage rate
Spread condition in network carries out control operation to transmission, storage, the discarding of message in a network according to spread condition；This method
Including following strategy:
Drop policy preferentially deletes the message that coverage rate is big in the node according to drop policy when the caching deficiency of node；
ACK active deleting mechanism, in message transmission phase, using what is be successfully transmitted in ACK active deleting mechanism removing caching
Message；
Queuing mechanism based on coverage rate, using the queuing mechanism based on message coverage rate to message queue to be sent according to message
The sequence of coverage rate size, it is preferential to send the small message of coverage rate, it is more than the message of given threshold value for coverage rate, then not turns
Hair.
2. the moving machine meeting method for controlling network congestion according to claim 1 based on message coverage rate, which is characterized in that
Message coverage rate in this method indicates that the number of nodes for holding the message in network accounts for the ratio of whole network total node number, reflection
The diffusion of message in a network；Its calculation formula is:
Wherein,For message mkCoverage rate in a network,To hold message m in networkkNumber of nodes, N be network in
Node total number；
When calculating message coverage rate, to reduce node computation complexity, in update message covering table S after two nodes meet,
Node will not calculate simultaneously and update message coverage rate in table；Only calculated when message queueing and message delete the stage；And
When calculating, it can be arranged and update interval time thresholdTime, only when apart from upper primary renewal time update interval was greater than
Between thresholdTime when, can just recalculate message coverage rate, otherwise directly take in message covering table S the last calculating
Value；When two nodes meet, respective message covering table S is first exchanged, and updates the S table of oneself, is carried by each node
Message covering meter calculate any message coverage rate.
3. the moving machine meeting method for controlling network congestion according to claim 2 based on message coverage rate, which is characterized in that
Message in this method covers table S, including each message id in network, and message generates time createTime, message coverage rate
R, the last message coverage rate renewal time T, each message in message covering table are also associated with a node and hold table Q,
For recording the node in network to the information of holding of the message, include whether the node holds message flag flag in table Q, and
Hold record renewal time t.
4. the moving machine meeting method for controlling network congestion according to claim 3 based on message coverage rate, which is characterized in that
This method further includes the method holding table to node and being updated:
Assuming that about message m in node a and node bkNode to hold table be respectively Qa, Qb, node a traversal list Qb, for table Qb
In each node i, if the node i is in table QaMiddle presence then compares the time t of node i update, if table QbIn t be greater than
Middle QaT, illustrate table QbIn renewal time later, at this time use table QbIn hold mark flag, renewal time t go update Qa
In about node i hold mark flag and renewal time t, if the node i is in table QaIn be not present, then directly by QbMiddle pass
Q is added in the information of node iaIn.
5. the moving machine meeting method for controlling network congestion according to claim 3 based on message coverage rate, which is characterized in that
This method further includes the method being updated to message covering table:
When two nodes meet, respective message covering table S is first exchanged, and updates the S table of oneself, for node a, when it
Get the message covering table S for the node b that meetsbWhen table, S is first traversedbTable；For SbMiddle there are each message id, if the message
Id exists in the message covering table S of oneselfaIn table, then it represents that the partial information of itself existing message id, it at this time only need to be to it
It is updated, if message id is not present in the table S of itselfaIn, then directly the correlation about message id in the node b that meets is believed
Breath directly replicates and is added to the table S of itselfaIn.
6. the moving machine meeting method for controlling network congestion according to claim 1 based on message coverage rate, which is characterized in that
Drop policy in this method specifically:
Drop policy is to select the maximum message of coverage rate from local cache first based on message coverage rate, then again and
The new coverage rate for receiving message is compared；If the coverage rate of message is greater than covering for new reception message in the local cache selected
Lid rate then deletes the message selected in local, receives new information and puts it into local cache；Otherwise, new information is rejected.
7. the moving machine meeting method for controlling network congestion according to claim 1 based on message coverage rate, which is characterized in that
ACK active deleting mechanism in this method specifically:
ACK active deleting mechanism is the ack table that Successful transmissions message is opened in each node local maintenance one, saved in table it is each at
The message id of the function transmission and generation time createTime of message；Whenever one message of node Successful transmissions to destination node
When, message id and message are generated time createTime and are added in the ack table of respective local by transmitting terminal and receiving end；When
It when two nodes meet, exchanges first and updates respective ack table, then delete in local cache and be present in the message in ack table.
8. the moving machine meeting method for controlling network congestion according to claim 1 based on message coverage rate, which is characterized in that
The queuing mechanism based on coverage rate in this method specifically:
The message prioritization that queuing mechanism based on coverage rate is used to make coverage rate small is sent, and increases its diffusion speed in a network
Degree；Correspondingly, the big message delay of coverage rate sends or do not send, the copy sum of message in a network is reduced, net is reduced
Network load；It is more than the message of certain value for coverage rate, illustrates that sufficient diffusion has been obtained in it in a network, at this point, stopping
Only such message continues to spread.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910399846.XA CN110191486A (en) | 2019-05-14 | 2019-05-14 | A kind of moving machine meeting method for controlling network congestion based on message coverage rate |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910399846.XA CN110191486A (en) | 2019-05-14 | 2019-05-14 | A kind of moving machine meeting method for controlling network congestion based on message coverage rate |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110191486A true CN110191486A (en) | 2019-08-30 |
Family
ID=67716254
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910399846.XA Pending CN110191486A (en) | 2019-05-14 | 2019-05-14 | A kind of moving machine meeting method for controlling network congestion based on message coverage rate |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110191486A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111083037A (en) * | 2019-10-22 | 2020-04-28 | 贝壳技术有限公司 | Method, device, medium and electronic equipment for realizing instant messaging |
| CN111970200A (en) * | 2020-08-27 | 2020-11-20 | 华中师范大学 | Probability routing method based on utility value |
| CN115348223A (en) * | 2022-08-11 | 2022-11-15 | 黑龙江大学 | Opportunistic network cache management method based on message grouping |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN107040961A (en) * | 2017-06-15 | 2017-08-11 | 吉林大学 | A kind of wireless sensor network jamming control method |
| EP3442182A1 (en) * | 2017-08-07 | 2019-02-13 | Nokia Solutions and Networks Oy | Joint dropping or marking of data packets for traffic congestion control |
-
2019
- 2019-05-14 CN CN201910399846.XA patent/CN110191486A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN107040961A (en) * | 2017-06-15 | 2017-08-11 | 吉林大学 | A kind of wireless sensor network jamming control method |
| EP3442182A1 (en) * | 2017-08-07 | 2019-02-13 | Nokia Solutions and Networks Oy | Joint dropping or marking of data packets for traffic congestion control |
Non-Patent Citations (1)
| Title |
|---|
| 范为仁: "移动机会网络中的路由算法与拥塞控制策略研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111083037A (en) * | 2019-10-22 | 2020-04-28 | 贝壳技术有限公司 | Method, device, medium and electronic equipment for realizing instant messaging |
| CN111083037B (en) * | 2019-10-22 | 2022-02-01 | 贝壳技术有限公司 | Method, device, medium and electronic equipment for realizing instant messaging |
| CN111970200A (en) * | 2020-08-27 | 2020-11-20 | 华中师范大学 | Probability routing method based on utility value |
| CN111970200B (en) * | 2020-08-27 | 2022-02-01 | 华中师范大学 | Probability routing method based on utility value |
| CN115348223A (en) * | 2022-08-11 | 2022-11-15 | 黑龙江大学 | Opportunistic network cache management method based on message grouping |
| CN115348223B (en) * | 2022-08-11 | 2023-09-01 | 黑龙江大学 | Opportunistic network cache management method based on message grouping |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Routing in a delay tolerant network | |
| Silva et al. | A survey on congestion control for delay and disruption tolerant networks | |
| US7620010B2 (en) | Wireless communications apparatus, and routing control and packet transmission technique in wireless network | |
| CN110191486A (en) | A kind of moving machine meeting method for controlling network congestion based on message coverage rate | |
| US8831023B2 (en) | Low latency mesh network | |
| CN103384252B (en) | The method and apparatus of preventing network equipment from attacking, the network equipment | |
| CN109922513A (en) | A kind of OLSR method for routing and system based on moving projection and latency prediction | |
| La et al. | Distribution of path durations in mobile ad hoc networks and path selection | |
| Moetesum et al. | An adaptive and efficient buffer management scheme for resource-constrained delay tolerant networks | |
| Vardalis et al. | Exploiting the potential of DTN for energy-efficient internetworking | |
| CN110267321A (en) | Greedy multicast route protocol design method in three-dimensional scenic | |
| KR20120069449A (en) | Apparatus and method for providing light weight multicast of data distribution service | |
| CN102497325B (en) | DTN routing method based on reliable information distribution | |
| Gawas et al. | Cross layer multi QoS metric routing for multimedia traffic in 802.11 E over MANETs | |
| Merlin et al. | Latency-aware forwarding for IRON: Latency support for back-pressure forwarding | |
| CN109039934A (en) | A kind of space DTN method for controlling network congestion and system | |
| CN108881049A (en) | A kind of congestion control policy based on Epidemic routing | |
| Lü et al. | Adaptive swarm-based routing in communication networks | |
| Minkenberg et al. | Adaptive routing for convergence enhanced Ethernet | |
| Daniel et al. | Swarm intelligence based routing technique for call blocking in heterogeneous mobile adhoc network using link stability factor and buffering technique for QoS | |
| Zhong et al. | Research and Implementation of AOMDV Multipath Routing Protocol | |
| CN110099410A (en) | For facing the DTN distributed caching method and equipment of empty wagons earth mat | |
| Ziane et al. | Inductive routing based on dynamic end-to-end delay for mobile networks | |
| CN105188086B (en) | A kind of delay-tolerant network congestion-preventing approach of the nodal cache release towards Epidemic routing algorithm | |
| Gupta et al. | QoS support in mobile ad-hoc networks |
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 |