CN103024813B - Based on holding the binding layer improvement algorithm that holds late link sensor network - Google Patents
Based on holding the binding layer improvement algorithm that holds late link sensor network Download PDFInfo
- Publication number
- CN103024813B CN103024813B CN201210517296.5A CN201210517296A CN103024813B CN 103024813 B CN103024813 B CN 103024813B CN 201210517296 A CN201210517296 A CN 201210517296A CN 103024813 B CN103024813 B CN 103024813B
- Authority
- CN
- China
- Prior art keywords
- bundle
- node
- transfer
- network
- length
- 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.)
- Expired - Fee Related
Links
- 230000006872 improvement Effects 0.000 title description 3
- 230000005540 biological transmission Effects 0.000 claims abstract description 40
- 238000012546 transfer Methods 0.000 claims abstract description 31
- 238000000034 method Methods 0.000 claims description 22
- 230000007246 mechanism Effects 0.000 claims description 13
- 230000008569 process Effects 0.000 claims description 13
- 238000012545 processing Methods 0.000 claims description 12
- 238000001514 detection method Methods 0.000 claims description 6
- 238000004321 preservation Methods 0.000 claims description 6
- 238000010606 normalization Methods 0.000 claims description 4
- 230000008859 change Effects 0.000 claims description 3
- 238000013461 design Methods 0.000 claims description 3
- 238000011160 research Methods 0.000 abstract description 6
- 238000007306 functionalization reaction Methods 0.000 abstract 1
- 230000009897 systematic effect Effects 0.000 abstract 1
- 238000004891 communication Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 3
- 238000012790 confirmation Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Does the present invention analyze and has summed up the disconnected DTN(Delay based on Rong Chirong? Tolerant? Networks) particular attribute of wireless sensor network, has proposed the architecture of this network based on DTN on this basis. The binding layer of importance based on to(for) network, has carried out systematic research to the function and structure of binding layer protocol, and has proposed a kind of agreement implementation based on functionalization module. In order to solve the congestion problems in wireless sensor network, the present invention has proposed a kind of end-to-end retransmission algorithm based on congestion control binding layer on the basis of existing DTN network congestion control research, according to retain costs and cost of transfer relatively carried out to corresponding operating to data, avoid as far as possible the abandoning of data, ensured in rugged environment to data efficiently, transmission reliably.
Description
Technical field
The present invention relates to disconnected DTN (DelayTolerantNetworks) wireless sensor network based on Rong ChirongAlgorithm, particularly the improvement algorithm based on the disconnected binding layer of Rong Chirong.
Background technology
Along with social economy and the reach of science, the mankind are to holding the disconnected DTN (DelayTolerant of slow appearanceNetworks) the understanding demand of network is also more and more stronger. And as wireless sensor network, AdHoc networkThese challenge network, their common feature be error rate high, postpone long, speed is low, resource-constrained, inDisconnected frequent etc., this is different from traditional communication environment maximum. Due to the particularity of DTN network, realThe reliability of existing data has been communicated by letter into a study hotspot.
Sensor network is in certain monitoring range, formed by the deployment of microsensor node, andThe self-organizing network of the multi-hop forming by radio communication. In normal circumstances, in sensor network, haveMany different types of sensors, can be used to monitor earthquake, luminous intensity, electromagnetism, noise, temperature, soilThe information of the surrounding enviroment such as composition.
One of main innovation of DTN network is to have increased a new binding layer, forms a kind of novel networkArchitecture. Binding layer is to be based upon on transport layer, and it is to come by the convergence-level adapter in binding layerRealize, can compatible multiple different host-host protocol. In architecture, binding layer has shown convergence-levelAct on, shown the function of application layer for lower-layer protocols, adopt the mode of keeping transmission, and withThe mode of hop-by-hop ensures its safety and reliability.
DTN network isomery does not have unified communication protocol between territory, can provide behaviour end to end by spanning networkDo, we can only realize reliable data retransmission at binding layer. The mode of transmitting with keeping completes present nodePacket turns, and is first to preserve the message receiving when receiving packet, draws next redirect link,And confirm that the next-hop node of taking care of at present requires keeping transmission, and confirm to start retransmission timer simultaneously. IfNext-hop node receives packet, and it returns to a response message. If receive response before retransmission timer is overtimeThe information of message, keeping request retransmission.
In keeping transmission, packet is forwarded to next-hop node, stores immediately and sends one after receiving messageIndividual packet, sends keeping status report, illustrates that it has completed the transmission keeping of the message of keeping, from interiorDeposit the relevant information of middle this node of deletion, a complete bundle keeping transmitting procedure completes; If can notNormal forwarding, does not accept the confirmation report of keeping, and present node need to resend packet, and at thisIn time of confirming should long enough, make the host-host protocol of bottom may complete the transmitting of packet. ProtectingIn the process of pipe transmission, the necessary storing message of custodian, until another node completes the transmission of packet, orThe life time of node expires.
In sensor network based on DTN and traditional network, the detection method of congestion control has a great difference,As the reliability of the delay that connects end to end, propagates, data,, the disposal ability of the characteristic of channel, nodeEtc., some are applicable to the detection method of traditional wireless senser, no longer applicable in DTN network, exampleAs, the connection of DTN network does not have persistence, can not meet the vacation of this link continuation of traditional congestion controlIf. At present, the research of binding layer congestion control mainly concentrates in the network congestion problem of individual node, alsoBe exactly traditional " other congestion control of node level ", by detecting the inspection that whether completes individual nodeSurvey, determine and whether occur when forward node congestedly storing, and select qualified specific node to pass throughKeeping transmission solves the problem of congestion control.
The another kind of thinking that solves DTN network congestion problem is to implement precautionary measures, comes pre-by some meansThe generation of anti-network congestion. Specific practice is: network is only issued the token node of fixed qty, only withThe node of token can transmit data, and after transmission data, the corresponding minimizing of token sum meeting, sends thereby control networkData volume. But this way is the token number that needs regular update network node to hold, meeting restriction of messageSend the performance that this can improve the load of network and affect process information in network.
The present invention studies the something in common of DTN network and wireless senser, agreement in primary study binding layerRealize principle. The structure of bundle mainly comprises namely main in bundle and payload piece of stemTwo parts, what it adopted is that the mode that keeping is transmitted transmits data, keeping transmission is with the side of hop-by-hopFormula to final destination node, can be guaranteed the transmitting of packet by transmission of messages like this. Wherein, bundleTie up the keeping transmission of layer, can be provided to the reliable hop-by-hop transmission of final destination. According to keeping conveyerSystem, bundle is with the technical transmission of " storage forwarding ", and the reliability transmitting is given next node,Just can effectively avoid Transmission time, the loss of information.
In some cases, the shortage of end-to-end transfer of data monitoring, only relying on keeping transmission mechanism is notBe enough to ensure reliability. In considering transmission plan, should be taken into account that custodial node is due to accident(as connectivity problem or node failure) can not forward bag before TTL expires, and also do not have in this caseOther copy, this bundle will be delivered never so. Therefore, can effectively process " bundle mistake for oneTrack " mechanism of problem is indispensable.
By the research to bundling deal implementation process, " bundle loses to have found a gratifying solutionTrack " scheme, and guarantee the transmission of critical data. Our target is to guarantee key within the shortest timeBundle arrives its final destination, and initial manipulation scheme and the transmission route to destination are provided. Can be in conjunction withThe transmitting of point-to-point, ensures that keeping transmission mechanism provides service mechanism end to end, to monitor keyThe transmission of data and fault detect.
Summary of the invention
The present invention is based on the wireless senser based on DTN, by the congestion control of network and end-to-end retransmission mechanismCombine, propose 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 andThe implementation procedure that it is concrete.
1.1 algorithm design
In the time that node is received the information of bundle of other nodes, first to carry out congested detection, according to bindingWhether the length of bag is greater than the remaining cache length of node is judged congested whether generation; If occur congested, meterCalculate the retain costs of this bundle, and judge whether it has the value of preservation with regard to this node;
What wherein N (t) represented is the number that copies of t moment bundle, i.e. number of copies in network can be in bundleThe stem of tying up bag increases this, TTLlWhat represent is the residue life span of bundle, and P is Priority Service grade,N (t) is larger, TTLlLess with P, illustrate that the necessity of preservation bundle is less, corresponding retain costs is also higher;N, t, P are respectively three's normalization coefficients, can, according to the performance need of network, change accordingly threeValue, and then change the significance level of corresponding factor in congestion control;
In the time that node determines to shift, if an optional majority third-party custodial node so just needsTo select accordingly according to certain standard, mainly transfer in these nodes by bundleCost of transfer compares; Use Tnode＝ln×Lnode+ r × R calculates different nodes in same bundleCost of transfer, wherein LnodeWhat represent is the available cache memory length of third party's custodial node, and R represents two jointsDistance between point, LnodeLarger with R, the difficulty that shifts bundle is just larger, and cost of transfer also just moreGreatly; Cost of transfer is used Calculate, wherein LbundleRepresentThe length of the bundle that will shift, TTLlRepresent the residue life time of bundle, LbundleLargerAnd TTLlWith P more hour, the cost that bundle shifts is also just higher; Same, can be by changingCorresponding normalization coefficient ln, r, lb, t, p size adjust the weight of corresponding factor in transfer processWant degree;
1.2 algorithm flow
What in the time that DTN bundle transmits, use is keeping transmission mechanism, mainly depends on selected object roadBy; The selection of a non-best route can cause the delay of significant data transmission, should " immediately " pay encapsulationTo crucial bundle; This just needs under any circumstance, all exists relevant bundle can arrive as early as possible objectGround;
(1), in the time that node receives new bundle, first carry out congestion detection, and start timer; SentenceWhether the length of restrainting in disconnected bundle is greater than the available cache memory length of node, if so, occurs congestedly, entersRow congestion control, jumps to step (2); If not, directly store this bundle and skip later instituteIn steps;
(2) calculate the retain costs of restrainting in the bundle that receives, and and node in the average preservation of all bundlesCost compare, if the retain costs of bundle is less than average retain costs, jumps to step (3); Otherwise jump to stepSuddenly (5);
(3) find third party's custodial node, the cost of transfer T of this nodenodeMinimum, so just can shiftBundle in bundle, if there is no such third party's custodial node, abandons this bundle, skips later stepComplete congested processing; If there is third-party custodial node, jump to step (4);
(4) judge that whether the life cycle (TTL) of restrainting in bundle is expired, if life cycle is effectively,Shift bundle; If out of date, send and retransmit (ARQ) signal to node, transfer to step (1);
(5) select third party custodial node, and in node queue, find the large and cost of transfer of retain costsLittle bundle shifts, and cost of transfer is herein Tbundle；
(6) judge whether the length of restrainting in the transfer bundle of selecting is greater than in third party's custodial node availableBuffer storage length, if be greater than available buffer storage length, illustrates the transfer bundle failure of selecting, and need to reselectShift bundle;
(7) transfer to step (1), until process smoothly the bundle receiving;
1.3 algorithm transmitting procedures
In the time that needs transmit, first to determine the binding that should transmit at first according to the calculating of transmission costBag, can select according to translating into originally of bundle, meanwhile, if the bundle in this bundle is to shiftBundle, needs to report notice to the source node that shifts this bundle, in processing mark corresponding to the index of this bundleIn add the mark of processing, just can be to this Shu Jinhang transmission after processing successfully, otherwise a Shu Jinhang of alternativeTransmission, need to revise accordingly at the correspondence position of local index after being transmitted.
This patent is by the research to traditional retransmission mechanism and congestion control, end to end retransmission mechanism and gathering aroundPlug is controlled the mode combining, and proposes a kind of new algorithm. Algorithm can effectively reduce information in networkCopy, improves network to congestion control ability, and then the utilization rate of raising node storage space and network is wholeBody performance.
Brief description of the drawings
Fig. 1 is algorithm flow chart of the present invention.
Fig. 2 is algorithm process flow chart.
Fig. 3 is the impact of rate travel on end-to-end time delay.
Fig. 4 is the impact of offered load on handling capacity.
Fig. 5 data loss rate is with the variation diagram of network node quantity.
Detailed description of the invention:
1, by the research to bundling deal implementation process, found a gratifying solutionThe scheme of " restrainting missing ", and guarantee the transmission of critical data. Our target is true within the shortest timeProtect crucial bundle and arrive its final destination, and provide and think at first operation scheme and the transmission route to destination.Can be in conjunction with the transmitting of point-to-point, ensure that keeping transmission mechanism provides service mechanism end to end, withTransmission and the fault detect of monitoring critical data.
Initial sender stores data, and stores other information such as TTL and creation-time simultaneously. TheseInformation will be stored, until receive, bag arrives final destination or TTL lost efficacy. Crucial bundle is to useKeeping transmission mechanism transmits, and has also realized communications status report end to end simultaneously. In each critical packetIn constructive process, final recipient all can send transmit mode report to initial sender come confirmation message passWhether successfully send.
2, binding layer take care of while transmitting bundle, is to adopt contact-forward mode between node, is savingIn point, likely there are multiple copies of certain bundle, and end-to-end heavy at the binding layer based on congestion controlIn sending out algorithm machine-processed, in order to process congestion problems, bundle is carried out to keeping and the transfer of some, withKeeping transmission is identical to the result of bundle, therefore when congested by this algorithm process, due to guarantorPipe transmits, and has contained the bundle of transfer in possible destination node, and the transfer of carrying out so bundle will be sameOne node is repeatedly stored same bundle, and this can bring larger pressure to limited resource.
In the time that needs transmit, first to determine the binding that should transmit at first according to the calculating of transmission costBag, can select according to translating into originally of bundle, if the bundle in this bundle of while is to shiftBundle, needs to report notice to the source node that shifts this bundle, in processing mark corresponding to the index of this bundleIn add the mark of processing, just can be to this Shu Jinhang transmission after processing successfully, otherwise a Shu Jinhang of alternativeTransmission, 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, and establishing mobile node is 10,Large rate travel is respectively 1m/s, 2m/s, 4m/s, 9m/s, and the time of staying is 0, and simulation time is350s, maximum number of connections is 5, and random number seed is 1, and transfer rate is packet of transmission per second.Wherein BE algorithm is exactly the new algorithm that the present invention proposes, and retransmits end to end machine based on congestion control binding layerSystem, DO algorithm is traditional flooding, namely spreads 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. BE calculatesThe average delay of method is less than the time delay of DO. When rate travel hour, both time delay rate of changes are slow.But after mobile speed lives in to increase, cause the link of having set up to disconnect, both time delays have largerThe growth of amplitude. 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 handling capacity, mobile node or 10 constant, rate travelFor 2m/s is constant, the time of staying is 0, and simulation time is 400s, 5 of maximum number of connections positions, random seedNumerical digit 1, transfer rate is 1,4,8,16,20 packets of transmission per second.
As can be seen from Figure 4, when the load of network hour, the handling capacity of two agreements approaches, the handling capacity of BEHandling capacity than DO is smaller. In the time that load continues to increase, the throughput increase rate of BE is faster than DO. Due to networkThe increase of load, the situation that there will be multiple copies to transmit in network for DO, has not only taken limitedSpatial cache, also can cause the congested of network, cause the transfer rate of data to decline, and BE utilizes storage forwardingMechanism, controlled to a certain extent congested generation, meanwhile, retransmission mechanism also can not allow end to endIn network, there is too much copy, saved spatial cache, ensured that data arrive the probability of destination node.
5, Fig. 5 has shown the impact of algorithm different nodes data loss rate on network in network. By scheming5 can find out, along with increasing of nodes, algorithm improves degree to the Loss Rate of data and also constantly addingDeeply, this is because in network size hour, data loss rate is subject to congested impact less, more mayBe because the scale of network is inadequate, can not ensure to have enough links and transmit data. Calculate with respect to DOMethod, BE algorithm all shows better effect aspect Loss Rate, but in network size hour, DO algorithmNetwork delay relatively little, illustrate that the end-to-end repeating transmission algorithm of binding layer based on congestion control is more suitable inLarge-scale network, and in space, be that the network size of wireless senser is all huger under normal circumstances,So this algorithm is relatively suitable for the network of this type.
Claims (1)
1. based on holding a binding layer method that holds late link sensor network, it is characterized in that described method bagDraw together:
1.1 method designs
In the time that node is received the information of bundle of other nodes, first to carry out congested detection, according to bindingWhether the length of bag is greater than the remaining cache length of node is judged congested whether generation; If occur congested, meterCalculate the retain costs of this bundle, and judge whether it has the value of preservation with regard to this node;
What wherein N (t) represented is the number that copies of t moment bundle, i.e. number of copies in network can be in bundleThe stem of tying up bag increases the number of copies in network, TTLlWhat represent is the residue life span of bundle, and P is excellentThe first grade of service, N (t) is larger, TTLlLess with P, illustrate that the necessity of preservation bundle is less, protect accordinglyBe saved as this also higher; N, t, p are respectively normalization coefficients, can be according to the performance need of network, accordinglyChange three's value, and then change the significance level of corresponding factor in congestion control;
In the time that node determines to shift, if an optional majority third-party custodial node so just need to be complied withSelecting accordingly according to certain standard, is mainly to transfer to translating in these nodes by bundleOriginally compare; Use Tnode＝ln×Lnode+ r × R calculates translating into different nodes in same bundleThis, wherein LnodeWhat represent is the available cache memory length of third party's custodial node, and R represents the distance between two nodesFrom, LnodeLarger with R, the difficulty that shifts bundle is just larger, and cost of transfer is also just larger; Cost of transferWithCalculate, wherein LbundleWhat represent is to shiftThe length of bundle, TTLlRepresent the residue life time of bundle, LbundleLarger and TTLlLess with PTime, the cost that bundle shifts is also just higher; Same, can be by changing corresponding normalization coefficientln、r、lb, t, p size adjust the significance level of corresponding factor in transfer process;
1.2 method flow
What in the time that DTN bundle transmits, use is keeping transmission mechanism, mainly depends on selected object route;The selection of a non-best route can cause the delay of significant data transmission, should " immediately " payment be encapsulated into keyBundle; This just needs under any circumstance, all exists relevant bundle can arrive as early as possible destination;
(1), in the time that node receives new bundle, first carry out congestion detection, and start timer; SentenceWhether the length of restrainting in disconnected bundle is greater than the available cache memory length of node, if so, occurs congestedly, carries outCongestion control, jumps to step (2); If not, directly store this bundle and skip later all stepsSuddenly;
(2) calculate the retain costs of restrainting in the bundle that receives, and and node in the average preservation of all bundlesCost compare, if the retain costs of bundle is less than average retain costs, jumps to step (3); Otherwise jump to step(5)；
(3) find third party's custodial node, the cost of transfer T of this nodenodeMinimum, so just can shiftBundle in bundle, if there is no such third party's custodial node, abandons this bundle, skips later step completeBecome congested processing; If there is third-party custodial node, jump to step (4);
(4) judge that whether the life cycle (TTL) of restrainting in bundle is expired, if life cycle is effectively,Complete congested processing, no longer carry out subsequent step, shift bundle; If out of date, send heavy to nodePass (ARQ) signal, transfer to step (1);
(5) select third party custodial node, and in node queue, find the large and cost of transfer of retain costsLittle bundle shifts, and cost of transfer is herein Tbundle；
(6) judge whether the length of restrainting in the transfer bundle of selecting is greater than in third party's custodial node availableBuffer storage length, if be greater than available buffer storage length, illustrates the transfer bundle failure of selecting, and need to reselect and turnMove bundle;
(7) transfer to step (1), until process smoothly the bundle receiving;
1.3 transmitting procedure
In the time that needs transmit, first to determine the binding that should transmit at first according to the calculating of transmission costBag, can select according to translating into originally of bundle, meanwhile, if the bundle in this bundle is to shiftBundle, needs to report notice to the source node that shifts this bundle, in processing mark corresponding to the index of this bundleAdd the mark of processing, just can be to this Shu Jinhang transmission after processing successfully, otherwise Shu Jinhang transmission of alternative,After being transmitted, need to revise accordingly at the correspondence position of local index.
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 CN103024813A (en) | 2013-04-03 |
| CN103024813B true CN103024813B (en) | 2016-05-11 |
Family
ID=47972834
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210517296.5A Expired - Fee Related 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) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501267B (en) * | 2013-07-04 | 2017-05-17 | 北京科技大学 | Routing algorithm of delay-disruption tolerant network |
| 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 |
| WO2016075850A1 (en) * | 2014-11-11 | 2016-05-19 | 日本電気株式会社 | Radio terminal, computer readable medium on which application programs have been stored, and method |
| CN105656803B (en) * | 2016-01-25 | 2018-07-17 | 北京交通大学 | A kind of space delay tolerant network jamming control method based on QoS |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741732A (en) * | 2009-11-30 | 2010-06-16 | 中国人民解放军国防科学技术大学 | Extension managing method for network node memory in capacity delay network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2347552A4 (en) * | 2008-11-14 | 2015-10-14 | Raytheon Co | Automatic invocation of dtn bundle protocol |
-
2012
- 2012-12-05 CN CN201210517296.5A patent/CN103024813B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741732A (en) * | 2009-11-30 | 2010-06-16 | 中国人民解放军国防科学技术大学 | Extension managing method for network node memory in capacity delay network |
Non-Patent Citations (2)
| Title |
|---|
| 容迟/容断网络路由技术研究;樊秀梅等;《中兴通讯技术》;20091231;第15卷(第6期);全文 * |
| 无线容迟与容断传感器网络研究;张龙等;《计算机应用研究》;20100131;第27卷(第1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103024813A (en) | 2013-04-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103024813B (en) | Based on holding the binding layer improvement algorithm that holds late link sensor network | |
| Maalel et al. | Reliability for emergency applications in internet of things | |
| Dunkels et al. | Distributed TCP caching for wireless sensor networks | |
| US20200015147A1 (en) | Integrated access and backhaul adaptation layer status report | |
| CN101364918B (en) | Efficiency reliable routing method based on link quality for multi-hop wireless sensor network | |
| KR20150128795A (en) | Enhanced acknowledgement and retransmission mechanism | |
| CN101945341B (en) | Point-to-point transmission protocol of wireless sensor network | |
| CN101626597B (en) | Hop to hop transmission method based on satellite network | |
| CN102340391B (en) | Segmented ARQ (automatic repeat request) automatic retransmission method | |
| TW201328257A (en) | Communication system and method for assisting transmission of TCP packets | |
| CN101951656B (en) | Method for designing wireless network routing protocol with energy efficiency and coding perception | |
| Céspedes et al. | Comparison of data forwarding mechanisms for AMI networks | |
| CN103188716B (en) | RUDP periodic line fault location methods and device | |
| Giancoli et al. | Ctcp: Reliable transport control protocol for sensor networks | |
| KR101157521B1 (en) | Method for routing packet in wireless sensor network | |
| Santos et al. | eXtend collection tree protocol | |
| CN102868507B (en) | Based on the segmentation ARQ method of transmission reliability | |
| CN108092887A (en) | A kind of DSR improves the implementation method of Routing Protocol | |
| Braun et al. | Energy-efficient TCP operation in wireless sensor networks | |
| JP4870500B2 (en) | Communication apparatus and communication control method | |
| WO2023108328A1 (en) | Packet routing in a layer 2 mesh network | |
| Seligman | Storage Usage of Custody Transfer in Delay Tolerant Networks with Intermittent Connectivity. | |
| KR100959630B1 (en) | Method for reliable data transfer based on wireless sensor network | |
| Nikose et al. | A comparative analysis and design study of cross layer scheme based algorithm to increase the Qos performances in wireless communication | |
| CN106332145A (en) | Optimization method of connection performance of TCP in mobile Ad-hoc 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160511 |