CN103024813A - Bundle layer improvement algorithm based on DTN (delay tolerant networks) sensor network - Google Patents
Bundle layer improvement algorithm based on DTN (delay tolerant networks) sensor network Download PDFInfo
- Publication number
- CN103024813A CN103024813A CN2012105172965A CN201210517296A CN103024813A CN 103024813 A CN103024813 A CN 103024813A CN 2012105172965 A CN2012105172965 A CN 2012105172965A CN 201210517296 A CN201210517296 A CN 201210517296A CN 103024813 A CN103024813 A CN 103024813A
- Authority
- CN
- China
- Prior art keywords
- bundle
- node
- transfer
- cost
- network
- 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
Images
Abstract
The invention provides a system structure of a DTN (delay tolerant networks) wireless sensor network based on DTN on the basis of analysis and summary of unique attributes based on the DTN wireless sensor network. On the basis of significance of a bundle layer to the network, systematic research is performed on functions and a structure of a bundle layer protocol, and a protocol implementation scheme based on a functional module is provided. To solve the congestion problem of the wireless sensor network, an end-to-end retransmission algorithm based on the congestion control bundle layer is provided on the basis of existing DTN network congestion control studies, corresponding operation is performed on data according to comparison of the storage cost and transfer cost, data discarding is avoided as far as possible, and efficient and reliable transmission of the data in the wicked environment is guaranteed.
Description
Technical field
The present invention relates to the disconnected DTN(Delay Tolerant Networks based on Rong Chirong) algorithm of wireless sensor network, particularly based on the improvement algorithm of the disconnected binding layer of Rong Chirong.
Background technology
Along with social economy and the reach of science, human to holding the disconnected DTN(Delay Tolerant Networks of slow appearance) the understanding demand of network is also more and more stronger.And these challenge networks of picture wireless sensor network, Ad Hoc network, their common feature be error rate high, postpone long, speed is low, resource-constrained, it is frequent etc. to interrupt, this is different from traditional communication environment maximum.Because the particularity of DTN network, the realization the reliability of the data has been communicated by letter into a study hotspot.
Sensor network is in certain monitoring range, formed by the deployment of microsensor node, and the self-organizing network of the multi-hop that forms by radio communication.In normal circumstances, have many different types of transducers in the sensor network, can be used to the information of the surrounding enviroment such as monitor earthquake, luminous intensity, electromagnetism, noise, temperature, soil constituent.
One of main innovation of DTN network is to have increased a new binding layer, forms a kind of novel network architecture.The binding layer is to be based upon on the transport layer, and it is to realize by the convergence-level adapter in the binding layer, can compatible multiple different host-host protocol.On architecture, bundle the effect that layer has shown convergence-level, then shown the function of application layer for lower-layer protocols, adopt the mode of keeping transmission, and guarantee its safety and reliability in the mode of hop-by-hop.
DTN network isomery does not have unified communication protocol between the territory, can provide end to end operation by spanning network, and we can only realize reliable data retransmission at the binding layer.The packet of finishing present node in the mode of keeping transmission turns, to preserve first the message that receives when receiving packet, draw next redirect link, and confirm that the next-hop node of at present keeping requires the keeping transmission, and confirm to start simultaneously retransmission timer.If next-hop node receive data bag, it returns a response message.If receive the information of response message before retransmission timer is overtime, the keeping request retransmission.
In the keeping transmission, packet is forwarded to next-hop node, store immediately and send a packet after receiving message, send the keeping status report, illustrate that it has finished the transmission keeping of the message of keeping, the relevant information of this node of deletion from internal memory, a complete bundle keeping transmission course is finished; If can not normally transmit, then do not accept the affirmation report of keeping, present node need to resend packet, and the time of here confirming should long enough, makes the host-host protocol of bottom may finish the transmitting of packet.In the process of keeping transmission, the necessary storing message of custodian, until another node is finished the transmission of packet, or the life time of node expires.
Detection method based on congestion control in the sensor network of DTN and the traditional network has a great difference, as the delay that connects end to end, propagate, the reliability of the data,, the disposal ability of the characteristic of channel, node etc., some are applicable to the detection method of traditional wireless senser, no longer applicable in the DTN network, for example, the DTN network connection does not have persistence, can not satisfy the hypothesis of this link continuation of traditional congestion control.At present, the research of binding layer congestion control mainly concentrates on the network congestion problem of individual node, namely traditional " other congestion control of node level ", by detecting the detection of whether finishing individual node, determine when storing forward node, whether to occur congested, and select qualified specific node to solve the problem of congestion control by the keeping transmission.
The another kind of thinking that solves DTN network congestion problem is to implement precautionary measures, prevents the generation of network congestion by some means.Specific practice is: network is only issued the token node of fixed qty, only can the transmission of data with the node of token, and sending after the data token sum can corresponding minimizing, thus the data volume that the control network sends.But this way is the token number that needs the regular update network node to hold, the transmission of meeting restriction of message, the performance that this can improve the load of network and affect process information in the network.
The present invention studies the something in common of DTN network and wireless senser, the realization principle of agreement in the primary study binding layer.The structure of bundle mainly comprises stem namely main in the bundle and payload piece two parts, what it adopted is that the mode that keeping is transmitted transmits data, the keeping transmission is arrived final destination node in the mode of hop-by-hop with transmission of messages, can guarantee like this transmitting of packet.Wherein, the keeping transmission of binding layer can be provided to the reliable hop-by-hop transmission of final destination.According to the keeping transmission mechanism, bundle is with the technical transmission of " storage forwarding ", and the reliability that transmits is then given next node, in the time of just can effectively avoiding Transmission, and the losing of information.
In some cases, the shortage of end-to-end transfer of data monitoring only relies on the keeping transmission mechanism to be not enough to guarantee reliability.When considering transmission plan, should be taken into account custodial node because accident (such as connectivity problem or node failure) can not be transmitted bag before TTL expires, and also do not have in this case other copy, this bundle will be sent never so.Therefore, the mechanism that can effectively process " restrainting missing " problem is indispensable.
By the research to the bundling deal implementation process, found a scheme that gratifying solution " is restrainted missing ", and guaranteed the transmission of critical data.Our target is to guarantee that within the shortest time crucial bundle arrives its final destination, and provides the initial manipulation scheme and to the transmission route of destination.Can in conjunction with the transmitting of point-to-point, guarantee that the keeping transmission mechanism provides end to end service mechanism, with transmission and the fault detect of monitoring critical data.
Summary of the invention
The present invention is based on the wireless senser based on DTN, and congestion control and the end-to-end retransmission mechanism of network combined, and proposes the end-to-end retransmission algorithm based on congestion control binding layer.
The present invention mainly proposes the end-to-end retransmission algorithm based on congestion control binding layer, and algorithm for design flow process and its concrete implementation procedure.
1.1 algorithm design
When node is received the information of bundle of other nodes, at first to carry out congested detection, whether judge congested whether the generation greater than the remaining cache length of node according to the length of bundle; If occur congestedly, then calculate the retain costs of this bundle, and judge whether it has the value of preservation with regard to this node;
Wherein N (t) expression is the number that copies of t moment bundle, and namely the number of copies in network can increase this in the stem of bundle,
TTL l What represent is the residue life span of bundle,
PThe grade of service,
N (t)It is larger,
TTL l With
PLess, illustrate that the necessity of preserving bundle is less, corresponding retain costs is also higher; n
, t, PBe respectively three's normalization coefficient, can change accordingly three's value according to the performance need of network, and then change the significance level of corresponding factor in congestion control;
When node determines to shift, if an optional majority third-party custodial node is selected according to certain standard accordingly with regard to needing so, mainly be to compare by the cost of transfer that bundle is transferred in these nodes; With
Calculating is to the cost of transfer of different nodes in the same bundle, wherein
L Node What represent is the available cache memory length of third party's custodial node, and R represents the distance between two nodes,
L Node With
RLarger, the difficulty that shifts bundle is just larger, and cost of transfer is also just larger; Cost of transfer is then used
Calculate, wherein
L Bundle Expression be the length of the bundle that will shift,
TTL l With
PThe residue life time and the priority that represent respectively bundle,
L Bundle Larger and
TTL l With
PMore hour, the cost that bundle shifts is also just higher; Same, can be by changing corresponding normalization coefficient
Ln, r, l b , t, pSize adjust the significance level of corresponding factor in transfer process;
1.2 algorithm flow
What use when the DTN bundle transmits is the keeping transmission mechanism, mainly depends on selected purpose route; The selection of a non-best route can cause the delay of significant data transmission, should " immediately " pay the bundle that is encapsulated into key; This just needs under any circumstance, all exists relevant bundle can arrive as early as possible the destination;
(1) when node receives new bundle, at first carries out congestion detection, and start timer; Judge the length of restrainting in the bundle whether greater than the available cache memory length of node, if so, then occur congestedly, carry out congestion control, jump to step (2); If not, then directly store this bundle and skip later institute in steps;
(2) calculate the retain costs of restrainting in the bundle receive, and and node in all bundles average retain costs relatively, if the retain costs of bundle jumps to step (3) less than average retain costs; Otherwise jump to step (5);
(3) seek third party's custodial node, the cost of transfer of this node
T Node Minimum so just can shift the bundle in the bundle, if do not have such third party's custodial node then abandon this bundle, skips later step and finishes congested processing; If there is third-party custodial node, jump to step (4);
(4) judge whether the life cycle (TTL) of restrainting in the bundle is expired, if life cycle is effectively, shift bundle; If out of date, then send to node and retransmit (ARQ) signal, transfer to step (1);
(5) select third party's custodial node, and seek the large and little bundle of cost of transfer of retain costs and shift in node queue, cost of transfer herein is
T Bundle
If whether the length of restrainting in the transfer bundle that (6) judgement is selected greater than available buffer storage length, illustrates the transfer bundle failure selected greater than buffer storage length available in third party's custodial node, need to reselect to shift and restraint;
(7) transfer to step (1), until process smoothly the bundle that receives;
1.3 algorithm transmission course
When needs transmit, at first to determine the bundle that should transmit at first according to the calculating of transmission cost, can select according to translating into originally of bundle, simultaneously, if the bundle in this bundle is to shift bundle, then need to report notice to the source node that shifts this bundle, in processing sign corresponding to the index of this bundle, add the mark of processing, just can be to this Shu Jinhang transmission after processing successfully, otherwise select a Shu Jinhang transmission else, need to revise accordingly at the correspondence position of local index after being transmitted.
This patent is by to the research of traditional retransmission mechanism and congestion control, and the mode with end to end retransmission mechanism and congestion control combine proposes a kind of new algorithm.Algorithm can effectively reduce the copy of information in the network, improves network to the congestion control ability, and then improves the utilance of node storage space and the overall performance of network.
Description of drawings
Fig. 1 is algorithm flow chart of the present invention.
Fig. 2 is the algorithm process flow chart.
Fig. 3 is that the rate travel opposite end is to the impact of terminal delay time.
Fig. 4 is that offered load is on the impact of throughput.
Fig. 5 data loss rate is with the variation diagram of network node quantity.
Embodiment:
1, by the research to the bundling deal implementation process, found a scheme that gratifying solution " is restrainted missing ", and guaranteed the transmission of critical data.Our target is to guarantee that within the shortest time crucial bundle arrives its final destination, and provides and think at first operation scheme and to the transmission route of destination.Can in conjunction with the transmitting of point-to-point, guarantee that the keeping transmission mechanism provides end to end service mechanism, with transmission and the fault detect of monitoring critical data.
Initial sender stores data, and stores simultaneously other information such as TTL and creation-time.These information will be stored, and bag arrives the final destination or TTL lost efficacy until receive.Crucial bundle is to use the keeping transmission mechanism to transmit, and has also realized end to end communications status report simultaneously.In the constructive process of each critical packet, final recipient can send transmit mode and report to initial sender and come acknowledge message to transmit whether success.
2, binding layer is taken care of when transmitting bundle, to adopt contact-forward mode between node, a plurality of copies that in node, might have certain bundle, and in based on the end-to-end retransmission mechanism algorithm of the binding layer of congestion control, in order to process congestion problems, bundle is carried out keeping and the transfer of some, the result of transmitting bundle with keeping is identical, therefore when congested with this algorithm process, because keeping transmission, the bundle that has contained transfer in the possible destination node is carried out so the transfer of bundle and will repeatedly be stored same bundle at same node, and this can bring larger pressure to limited resource.
When needs transmit, at first to determine the bundle that should transmit at first according to the calculating of transmission cost, can select according to translating into originally of bundle, if the bundle in this bundle is to shift bundle simultaneously, then need to report notice to the source node that shifts this bundle, in processing sign corresponding to the index of this bundle, add the mark of processing, just can be to this Shu Jinhang transmission after processing successfully, otherwise select a Shu Jinhang transmission else, need to revise accordingly at the correspondence position of local index after being transmitted.
3, Fig. 3 is the rate travel of node and the relation of time delay end to end, if mobile node is 10, maximum rate travel is respectively 1m/s, 2m/s, 4m/s, 9m/s, the time of staying is 0, simulation time is 350s, maximum number of connections is 5, and random number seed is 1, and transmission rate is that per second sends a data grouping.Wherein the BE algorithm is exactly the new algorithm that the present invention proposes, and namely bundlees end to end retransmission mechanism of layer based on congestion control, and the DO algorithm is traditional flooding, namely spreads the routing node drop mechanism.
As can be seen from Figure 3, along with the quickening of node motion speed, propagation delay time also increases thereupon.The average delay of BE algorithm is less than the time delay of DO.When rate travel hour, both time-delay rate of changes are slow.But after mobile speed lived in to increase, the link that causes having set up disconnected, and both time-delays have growth by a relatively large margin.The growth rate of BE algorithm is slower a little than the growth rate of DO.
4, Fig. 4 is the graph of a relation of offered load and throughput, mobile node or 10 are constant, and rate travel is that 2m/s is constant, the time of staying is 0, and simulation time is 400s, 5 of maximum number of connections positions, random seed numerical digit 1, transmission rate are that per second sends 1,4,8,16,20 data grouping.
As can be seen from Figure 4, when the load of network hour, the throughput of two agreements approaches, the throughput of the throughput ratio DO of BE is smaller.When load continued to increase, the throughput increase rate of BE was faster than DO.Because the increase of offered load, the situation that a plurality of copies transmit in network can appear for DO, not only take limited spatial cache, also can cause the congested of network, caused the data transfer rate to descend, and BE utilizes the mechanism of storage forwarding, controlled to a certain extent congested generation, simultaneously, retransmission mechanism can not allow yet and occur too much copy in the network end to end, saved spatial cache, guaranteed that data arrive the probability of destination node.
5, Fig. 5 shown algorithm in network different nodes on the impact of the data loss rate of network.As seen from Figure 5, along with increasing of nodes, algorithm improves degree also in continuous intensification to the Loss Rate of data, this is because in network size hour, data loss rate is subjected to congested impact less, more may be because the scale of network is inadequate, can not guarantee to have enough links and come the transmission of data.With respect to the DO algorithm, the BE algorithm all shows better effect aspect Loss Rate, but in network size hour, the network delay less of DO algorithm, explanation is more suitable in fairly large network based on the end-to-end repeating transmission algorithm of the binding layer of congestion control, and generally be that the network size of wireless senser is all huger in the space, so this algorithm relatively is suitable for the network of this type.
Claims (1)
1. a binding layer improvement algorithm that holds late the link sensor network based on appearance is characterized in that, described algorithm comprises:
1.1 algorithm design
When node is received the information of bundle of other nodes, at first to carry out congested detection, whether judge congested whether the generation greater than the remaining cache length of node according to the length of bundle; If occur congestedly, then calculate the retain costs of this bundle, and judge whether it has the value of preservation with regard to this node;
Wherein N (t) expression is the number that copies of t moment bundle, and namely the number of copies in network can increase this in the stem of bundle,
TTL l What represent is the residue life span of bundle,
PThe grade of service,
N (t)It is larger,
TTL l With
PLess, illustrate that the necessity of preserving bundle is less, corresponding retain costs is also higher; n
, t, PBe respectively three's normalization coefficient, can change accordingly three's value according to the performance need of network, and then change the significance level of corresponding factor in congestion control;
When node determines to shift, if an optional majority third-party custodial node is selected according to certain standard accordingly with regard to needing so, mainly be to compare by the cost of transfer that bundle is transferred in these nodes; With
Calculating is to the cost of transfer of different nodes in the same bundle, wherein
L Node What represent is the available cache memory length of third party's custodial node, and R represents the distance between two nodes,
L Node With
RLarger, the difficulty that shifts bundle is just larger, and cost of transfer is also just larger; Cost of transfer is then used
Calculate, wherein
L Bundle Expression be the length of the bundle that will shift,
TTL l With
PThe residue life time and the priority that represent respectively bundle,
L Bundle Larger and
TTL l With
PMore hour, the cost that bundle shifts is also just higher; Same, can be by changing corresponding normalization coefficient
Ln, r, l b , t, pSize adjust the significance level of corresponding factor in transfer process;
1.2 algorithm flow
What use when the DTN bundle transmits is the keeping transmission mechanism, mainly depends on selected purpose route; The selection of a non-best route can cause the delay of significant data transmission, should " immediately " pay the bundle that is encapsulated into key; This just needs under any circumstance, all exists relevant bundle can arrive as early as possible the destination;
(1) when node receives new bundle, at first carries out congestion detection, and start timer; Judge the length of restrainting in the bundle whether greater than the available cache memory length of node, if so, then occur congestedly, carry out congestion control, jump to step (2); If not, then directly store this bundle and skip later institute in steps;
(2) calculate the retain costs of restrainting in the bundle receive, and and node in all bundles average retain costs relatively, if the retain costs of bundle jumps to step (3) less than average retain costs; Otherwise jump to step (5);
(3) seek third party's custodial node, the cost of transfer of this node
T Node Minimum so just can shift the bundle in the bundle, if do not have such third party's custodial node then abandon this bundle, skips later step and finishes congested processing; If there is third-party custodial node, jump to step (4);
(4) judge whether the life cycle (TTL) of restrainting in the bundle is expired, if life cycle is effectively, shift bundle; If out of date, then send to node and retransmit (ARQ) signal, transfer to step (1);
(5) select third party's custodial node, and seek the large and little bundle of cost of transfer of retain costs and shift in node queue, cost of transfer herein is
T Bundle
If whether the length of restrainting in the transfer bundle that (6) judgement is selected greater than available buffer storage length, illustrates the transfer bundle failure selected greater than buffer storage length available in third party's custodial node, need to reselect to shift and restraint;
(7) transfer to step (1), until process smoothly the bundle that receives;
1.3 algorithm transmission course
When needs transmit, at first to determine the bundle that should transmit at first according to the calculating of transmission cost, can select according to translating into originally of bundle, simultaneously, if the bundle in this bundle is to shift bundle, then need to report notice to the source node that shifts this bundle, in processing sign corresponding to the index of this bundle, add the mark of processing, just can be to this Shu Jinhang transmission after processing successfully, otherwise select a Shu Jinhang transmission else, need to revise accordingly at the correspondence position of local index after being transmitted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210517296.5A CN103024813B (en) | 2012-12-05 | 2012-12-05 | Based on holding the binding layer improvement algorithm that holds late link sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210517296.5A CN103024813B (en) | 2012-12-05 | 2012-12-05 | Based on holding the binding layer improvement algorithm that holds late link sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103024813A true CN103024813A (en) | 2013-04-03 |
| CN103024813B CN103024813B (en) | 2016-05-11 |
Family
ID=47972834
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210517296.5A Active CN103024813B (en) | 2012-12-05 | 2012-12-05 | Based on holding the binding layer improvement algorithm that holds late link sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103024813B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501267A (en) * | 2013-07-04 | 2014-01-08 | 北京科技大学 | Routing algorithm of delay-disruption tolerant network |
| CN103906130A (en) * | 2014-03-18 | 2014-07-02 | 重庆邮电大学 | Congestion control method with node state estimation function |
| CN104158741A (en) * | 2014-09-09 | 2014-11-19 | 中国电子科技集团公司第五十四研究所 | Stratospheric active routing design method based on delay/disruption tolerant network |
| CN105656803A (en) * | 2016-01-25 | 2016-06-08 | 北京交通大学 | Space delay tolerant network congestion control method based on QoS |
| CN107079062A (en) * | 2014-11-11 | 2017-08-18 | 日本电气株式会社 | Wireless terminal, the computer-readable medium and method for storing application program |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100125901A1 (en) * | 2008-11-14 | 2010-05-20 | Raytheon Company | Automatic invocation of dtn bundle protocol |
| CN101741732A (en) * | 2009-11-30 | 2010-06-16 | 中国人民解放军国防科学技术大学 | Extension managing method for network node memory in capacity delay network |
-
2012
- 2012-12-05 CN CN201210517296.5A patent/CN103024813B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100125901A1 (en) * | 2008-11-14 | 2010-05-20 | Raytheon Company | Automatic invocation of dtn bundle protocol |
| CN101741732A (en) * | 2009-11-30 | 2010-06-16 | 中国人民解放军国防科学技术大学 | Extension managing method for network node memory in capacity delay network |
Non-Patent Citations (2)
| Title |
|---|
| 张龙等: "无线容迟与容断传感器网络研究", 《计算机应用研究》 * |
| 樊秀梅等: "容迟/容断网络路由技术研究", 《中兴通讯技术》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501267A (en) * | 2013-07-04 | 2014-01-08 | 北京科技大学 | Routing algorithm of delay-disruption tolerant network |
| CN103906130A (en) * | 2014-03-18 | 2014-07-02 | 重庆邮电大学 | Congestion control method with node state estimation function |
| CN103906130B (en) * | 2014-03-18 | 2017-02-15 | 重庆邮电大学 | Congestion control method with node state estimation function |
| CN104158741A (en) * | 2014-09-09 | 2014-11-19 | 中国电子科技集团公司第五十四研究所 | Stratospheric active routing design method based on delay/disruption tolerant network |
| CN107079062A (en) * | 2014-11-11 | 2017-08-18 | 日本电气株式会社 | Wireless terminal, the computer-readable medium and method for storing application program |
| CN105656803A (en) * | 2016-01-25 | 2016-06-08 | 北京交通大学 | Space delay tolerant network congestion control method based on QoS |
| CN105656803B (en) * | 2016-01-25 | 2018-07-17 | 北京交通大学 | A kind of space delay tolerant network jamming control method based on QoS |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103024813B (en) | 2016-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101696776B1 (en) | Enhanced acknowledgement and retransmission mechanism | |
| CA2419767C (en) | Method for routing ad-hoc signals | |
| US8428558B2 (en) | System and method for routing in a wireless mesh network | |
| US20110026500A1 (en) | Low latency mesh network | |
| CN103024813A (en) | Bundle layer improvement algorithm based on DTN (delay tolerant networks) sensor network | |
| CN101626597B (en) | Hop to hop transmission method based on satellite network | |
| US20100238935A1 (en) | Method for Routing Ad-Hoc Signals | |
| TWI606734B (en) | Node device used in disruption/delay/disconnect tolerant network and communication method | |
| CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
| CN104506280A (en) | Reliable data transmitting method based on time division multiple access space dynamic network | |
| CN110191053B (en) | Wireless ad hoc network multipath routing method based on cognitive learning | |
| CN108092887A (en) | A kind of DSR improves the implementation method of Routing Protocol | |
| WO2023108328A1 (en) | Packet routing in a layer 2 mesh network | |
| Braun et al. | Energy-efficient TCP operation in wireless sensor networks | |
| Seligman | Storage Usage of Custody Transfer in Delay Tolerant Networks with Intermittent Connectivity. | |
| CN101155125B (en) | Method for processing congestion | |
| CN104104605A (en) | Downlink route acquisition and maintenance method and device | |
| CN109391675A (en) | A kind of method for reliable transmission slave aggregation node to sensing node applied to WSN | |
| Doddamani et al. | Delay tolerant network | |
| JP4926113B2 (en) | Mobile router ad hoc network communication system | |
| ES2440242T3 (en) | A packet transmission scheme for improved performance on multi-hop routes of a multi-hop wireless network | |
| CN109600431A (en) | Content incremental transmission method, mobile communication system towards mobile communication network | |
| CN105227470B (en) | Method for routing based on expecting meet nodes in Delay Tolerant Network | |
| Heimlicher et al. | Saft: Reliable transport in mobile networks | |
| US20230189117A1 (en) | Packet routing in a layer 2 mesh network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |