CN103546377B - A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation - Google Patents

A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation Download PDF

Info

Publication number
CN103546377B
CN103546377B CN201310476789.3A CN201310476789A CN103546377B CN 103546377 B CN103546377 B CN 103546377B CN 201310476789 A CN201310476789 A CN 201310476789A CN 103546377 B CN103546377 B CN 103546377B
Authority
CN
China
Prior art keywords
node
contact
transmission
duration
transmission probability
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.)
Active
Application number
CN201310476789.3A
Other languages
Chinese (zh)
Other versions
CN103546377A (en
Inventor
吴家皋
钱科宇
刘林峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Post and Telecommunication University
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201310476789.3A priority Critical patent/CN103546377B/en
Publication of CN103546377A publication Critical patent/CN103546377A/en
Application granted granted Critical
Publication of CN103546377B publication Critical patent/CN103546377B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation, in calculating transmission probability, the contact duration between node, the electric weight of node are considered, judge in the case of limited bandwidth, limited contact duration, limited electric weight node success message transfer packet simultaneously. first do corresponding judgement according to the value of transmission probability, if present node is greater than node that present node the contacts transmission probability value to destination node to destination node transmission probability value, cancel and sending, otherwise, decision node success in the case of limited contact duration and limited electric weight sends message packets, if can successfully send, message is sent to the node of contact from present node, if can not cancel transmission, while carrying out routing algorithm, the contact duration of node and node electric weight are incorporated in routing algorithm, accurately to select down hop, improve transmission success rate, size by message packets relatively and the limited size that contacts the data volume that duration and limited electric weight can transmit simultaneously, determine whether transmission, to reach the object of saving Internet resources.

Description

A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation
Technical field
The present invention relates to how to improve the data transmission method that transmission probability is estimated, especially a kind of based on improving biographyThe Delay Tolerant Network data transmission method of defeated probability Estimation, belongs to delay-tolerant network technique field.
Background technology
Delay Tolerant Network (DelayTolerantNetwork, be called for short DTN) is to continue a kind of shortage between end-to-endThe reliable networking connecting. DTN network often has high latency, low transfer rate, and batch-type connects, node frequencyNumerous movement, the feature such as delay-tolerant, fault tolerant, limited storage and communication environment are severe, makes traditionThe Internet technology of the end-to-end communication based on TCP/IP cannot be well for it provides service. In view of DTNThe uniqueness of network. DTN route, as among in the weight in delay-tolerant network, becomes numerous researchersPrimary research object.
Data transmission method based on probability Estimation is a kind of method adopting in Prophet Routing Protocol, shouldIn method node not forwarding messages blindly give all or part of neighbor node, arrive object joint but pre-estimateThe communicating predicted probability of point, and utilize this probable value to determine whether storing this message to turn to wait for betterSend out chance and determine which node to realize forwarding by.
The people such as Ting-KaiHuang propose Prophet+ algorithm, the same electric weight that equals using transmission probability as oneThe network factors of bandwidth, several network factors that consider respectively draw value of utility, finally do according to value of utilityCorresponding judgement, although the network factors that the method is considered is many, more than network factors time in the choosing of weightSelect aspect and can face very large difficulty, the method is not considered this factor time of contact simultaneously.
The people such as Li Yun propose a kind of transmission side data of improved probability Estimation in EProphet routing algorithmMethod, in the method by considering two of node contact frequency and duration of contacts because usually calculating estimationTransmission probability, thus make transmission probability can reflect more all-sidedly and accurately inter-node communication ability, in dataIn bag repeating process, select the better down hop of communication capacity, further improve the delivery rate of message, when reductionProlong, reduce resource overhead. But the method has been ignored other factor node electric weight that affect transmission performance, nodeElectric weight be a considerable problem to the node of resource-constrained. Do not consider limited connecing simultaneouslyTouch in the time whether successfully to send packet, if can not successfully send data, not only can not improve transmissionEfficiency, has also wasted resource greatly.
In addition, pertinent literature is mentioned and from saving the angle of energy, is adopted the probability based on node energyRouting algorithm, has reduced the communication overhead of network better, extends network life cycle. and the method is also only unilateralConsideration electric weight this respect factor, simultaneously do not consider whether limited electric weight can successfully send data yetBag.
Summary of the invention
The present invention is directed to the deficiency of above-mentioned background technology, the data that provide a kind of improved transmission probability to estimate passTransmission method, the method has considered the contact duration of node, the electric weight of node in calculating transmission probabilityEtc. network factors. Judge simultaneously in the case of limited bandwidth, limited contact duration, limited electric weight and savePoint success message transfer packet. This has not only improved the efficiency of transmission, the resource of simultaneously having saved network.
The present invention adopts following technical scheme for achieving the above object: a kind of based on improving transmission probability estimationDelay Tolerant Network data transmission method, according to Prophet+ method, using transmission probability as one with equaling electric weightThe network factors of bandwidth, has considered respectively several network factors and has drawn value of utility, finally does according to value of utilityCorresponding judgement; According to EProphet method for routing, consider node contact frequency and duration of contactTwo because usually calculating estimation transmission probability;
It is characterized in that: calculating in transmission probability, considered the contact duration that comprises between node,The electric weight of node is in interior network factors, judges at limited bandwidth, limited contact duration, limited simultaneouslyIn the situation of electric weight, node success message transfer packet, to improve the efficiency of transmission and to save networkResource;
First do corresponding judgement according to the value of transmission probability, if present node is to destination node transmission probability valueBe greater than node that present node the contacts transmission probability value to destination node, cancel and sending, otherwise, judgementNode success in the case of limited contact duration and limited electric weight sends message packets, if can becomeMerit sends, and message is sent to the node of contact from present node, if can not cancel transmission, carries out routeWhen algorithm, the contact duration of node and node electric weight are incorporated in routing algorithm, accurately to select down hop,Improve transmission success rate, simultaneously the size by message packets relatively and limited duration and the limited electricity of contactingThe size of the data volume that amount can be transmitted, determines whether transmission, to reach the object of saving Internet resources; BagDraw together following steps:
Step 1, in network, arbitrary node i is safeguarded a basic route information table, comprises following content: passLong list, total electric weight and dump energy when defeated list of probabilities, contact duration history list, last time noncontact, itsIn this node to the transmission probability of other nodes, represent with P (i, j), i represents this node, j represents other nodes,Contact duration represents that two nodes start to finish interval during this period of time to contact from this contact, contact duration historyList Tm(i, j) represents, m represents which time contact m=1,2,3 ... M, M represents total frequency of exposure, last timeNoncontact duration represents that last time contact finishes the time interval starting to this contact, long list when last time noncontactWith H (i, j) expression, use Et(i) total electric weight of expression node i, Er(i) dump energy of expression node i, establishes Q and represents to disappearBreath data package size, W represents bandwidth;
Step 2, the computational process of transmission probability: suppose that, in a transmitting procedure, D is destination node, AFor storing the present node of message packets copy, in the time that A node contacts with B node, A, B jointPoint exchange route information table separately, according to the information updating transmission probability of route information table. The meter of transmission probabilityCalculation comprises 3 aspects:
A) when A, B rigidly connect tactile time, first A node updates A, B two nodes are at noncontact last time durationThe decay of transmission probability P (A, B) in this time period, formula for attenuation equation (1) calculates:
P ( A , B ) = P ( A , B ) · ( 1 - E r ( B ) E t ( B ) ) · λ H ( A , B ) - - - ( 1 )
λ ∈ (0,1] be attenuation coefficient, λ gets 0.6;
B) A node updates A, B two nodes transmission probability P (A, B) within contact this time period of duration nextGrowth, formula for Growth Equation (2) calculate:
P ( A , B ) = P ( A , B ) + ( 1 - P ( A , B ) ) · P init ( w · T ave T M ( A , B ) + ( 1 - w ) · E r ( B ) E t ( B ) ) - - - ( 2 )
Wherein,The average contact of representative duration; The weight of long correlation when w representative contact,Here w gets 0.5; Pinit∈ (0,1) is one and initializes constant, PinitGet 0.8;
C) last A node upgrades P (A, D) according to transitivity, and formula for equation of transfer (3) calculates:
P(A,D)＝P(A,D)+(1-P(A,D))·P(A,B)·P(B,D)·β(3)
β is carry-over factor, and β gets 0.8;
Step 3, if P (B, D) > P (A, D) forwards step 4 to; Send otherwise cancel;
Step 4, judges the success transmission in the case of limited contact duration and limited electric weight of A nodeMessage packets, Rule of judgment is provided by formula (4) and (5):
Wherein, e represents the electric weight that unit of transfer's data consume, if meet pass-along message of (4) (5) two formulas simultaneouslyPacket, otherwise wait for that the next node satisfying condition forwards;
Step 5, the process of all intermediate node repeating step 2～steps 4 of receiving duplicate message, until message arrivesReach destination node or message is dropped.
The present invention has the following advantages and beneficial effect:
(1) in the transmission probability between computing node, the duration of the internodal contact considering andThe electric weight of node, to reach the object of accurate selection down hop, has improved transmission success rate.
(2) by the size of message packets relatively and the duration that contacts limited, limited electric weight can passThe size of defeated data volume, determines whether message transfer packet, to reach the object of saving Internet resources.
Brief description of the drawings
Fig. 1 is the general flow chart of the inventive method.
Detailed description of the invention
Below in conjunction with accompanying drawing, the technical scheme of invention is elaborated.
Fig. 1 is the general flow chart of the data transmission method estimated of improved transmission probability that the present invention proposes, comprisesFollowing steps:
Step 1, in network, arbitrary node i is safeguarded a basic route information table, comprises following content: passLong list, total electric weight and dump energy when defeated list of probabilities, contact duration history list, last time noncontact, itsIn this node to the transmission probability of other nodes, represent with P (i, j), i represents this node, j represents other nodes,Contact duration represents that two nodes start to finish interval during this period of time to contact from this contact, contact duration historyList Tm(i, j) represents, m represents which time contact m=1,2,3 ... M, M represents total frequency of exposure, last timeNoncontact duration represents that last time contact finishes the time interval starting to this contact, long list when last time noncontactWith H (i, j) expression, use Et(i) total electric weight of expression node i, Er(i) dump energy of expression node i, establishes Q and represents to disappearBreath data package size, W represents bandwidth;
Step 2, the computational process of transmission probability: suppose that, in a transmitting procedure, D is destination node, AFor storing the present node of message packets copy, in the time that A node contacts with B node, A, B jointPoint exchange route information table separately, according to the information updating transmission probability of route information table. The meter of transmission probabilityCalculation comprises 3 aspects:
A) when A, B rigidly connect tactile time, first A node updates A, B two nodes are at noncontact last time durationThe decay of transmission probability P (A, B) in this time period, formula for attenuation equation (1) calculates:
P ( A , B ) = P ( A , B ) · ( 1 - E r ( B ) E t ( B ) ) · λ H ( A , B ) - - - ( 1 )
λ ∈ (0,1] be attenuation coefficient, λ gets 0.6;
B) A node updates A, B two nodes transmission probability P (A, B) within contact this time period of duration nextGrowth, formula for Growth Equation (2) calculate:
P ( A , B ) = P ( A , B ) + ( 1 - P ( A , B ) ) · P init ( w · T ave T M ( A , B ) + ( 1 - w ) · E r ( B ) E t ( B ) ) - - - ( 2 )
Wherein,The average contact of representative duration; The weight of long correlation when w representative contact,Here w gets 0.5; Pinit∈ (0,1) is one and initializes constant, PinitGet 0.8;
C) last A node upgrades P (A, D) according to transitivity, and formula for equation of transfer (3) calculates:
P(A,D)＝P(A,D)+(1-P(A,D))·P(A,B)·P(B,D)·β(3)
β is carry-over factor, and β gets 0.8;
Step 3, if P (B, D) > P (A, D) forwards step 4 to; Send otherwise cancel;
Step 4, judges the success transmission in the case of limited contact duration and limited electric weight of A nodeMessage packets, Rule of judgment is provided by formula (4) and (5):
Wherein, e represents the electric weight that unit of transfer's data consume, if meet pass-along message of (4) (5) two formulas simultaneouslyPacket, otherwise wait for that the next node satisfying condition forwards;
Step 5, the process of all intermediate node repeating step 2～steps 4 of receiving duplicate message, until messageArriving destination node or message is dropped.

Claims (1)

1. the Delay Tolerant Network data transmission method based on improving transmission probability estimation, according to Prophet+ method, passingDefeated probability, as a kind of network factors with equaling electric weight bandwidth, has considered respectively several network factors and has drawn value of utility,Finally do corresponding judgement according to value of utility; According to EProphet method for routing, consider node contact frequency and contactTwo of duration are because usually calculating estimation transmission probability;
It is characterized in that: calculating in transmission probability, considered the contact duration that comprises between node, nodeElectric weight is in interior network factors, judges in the case of limited bandwidth, limited contact duration, limited electric weight simultaneously,Node success message transfer packet, to improve the efficiency of transmission and the resource of saving network;
First do corresponding judgement according to the value of transmission probability, if present node is greater than current to destination node transmission probability valueThe node that node contacts, to the transmission probability value of destination node, cancels and sending, otherwise decision node is in limited contactIn the situation of duration and limited electric weight, success sends message packets, if can successfully send, by message from working as prosthomerePoint sends to the node of contact, if can not cancel transmission, while carrying out routing algorithm, the contact duration of node and node electricityAmount is incorporated in routing algorithm, accurately to select down hop, improves transmission success rate, simultaneously by message packets relativelyBig or small with the limited size that contacts the data volume that duration and limited electric weight can transmit, determines whether transmission, to reachSave the object of Internet resources; Comprise the following steps:
Step 1, in network, arbitrary node i is safeguarded a basic route information table, comprises following content: transmission probability rowLong list, total electric weight and dump energy when table, contact duration history list, last time noncontact, wherein this node is to other jointsThe transmission probability of point, with P (i, j) expression, i represents this node, and j represents other nodes, and contact duration represents that two nodes are from thisInferior contact starts to finish interval during this period of time to contact, contact duration history list Tm(i, j) represents, which time contact m representsM=1,2,3 ... M, M represents total frequency of exposure, noncontact last time duration represents that contact last time finishes to start to this contactThe time interval, when last time noncontact, for long list, H (i, j) represents, uses Et(i) total electric weight of expression node i, Er(i) represent jointThe dump energy of point i;
Step 2, the computational process of transmission probability: suppose that, in a transmitting procedure, D is destination node, A is for storingThe present node of message packets copy, in the time that A node contacts with B node, A, B node switching route separatelyInformation table, according to the information updating transmission probability of route information table, the calculating of transmission probability comprises 3 aspects:
A) when A, B rigidly connect tactile time, first A node updates A, B two nodes are in this time of noncontact last time durationThe decay of transmission probability P (A, B) in section, formula for attenuation equation (1) calculates:
P ( A , B ) = P ( A , B ) · ( 1 - E r ( B ) E t ( B ) ) · λ H ( A , B ) - - - ( 1 )
λ ∈ (0,1] be attenuation coefficient, λ gets 0.6;
B) the next growth of A node updates A, B two nodes transmission probability P (A, B) within contact this time period of duration, increasesRectangular formula (2) calculating for journey:
P ( A , B ) = P ( A , B ) + ( 1 - P ( A , B ) ) · P i n i t ( w · T a v e T M ( A , B ) + ( 1 - w ) · E r ( B ) E t ( B ) ) - - - ( 2 )
Wherein,The average contact of representative duration; The weight of long correlation when w representative contact, w gets here0.5；Pinit∈ (0,1) is one and initializes constant, PinitGet 0.8;
C) last A node upgrades P (A, D) according to transitivity, and formula for equation of transfer (3) calculates:
P(A,D)＝P(A,D)+(1-P(A,D))·P(A,B)·P(B,D)·β(3)
β is carry-over factor, and β gets 0.8;
Step 3, if P (B, D) > P (A, D) forwards step 4 to; Send otherwise cancel;
Step 4, judges A node success message transfer data in the case of limited contact duration and limited electric weightBag, Rule of judgment is provided by formula (4) and (5):
Wherein, e represents the electric weight that unit of transfer's data consume, and Q represents message packets size, and W represents bandwidth, if withTime meet pass-along message packet of (4) (5) two formulas, otherwise wait for that the next node satisfying condition forwards;
Step 5, the process of all intermediate node repeating step 2～steps 4 of receiving duplicate message, until message arrives orderNode or message be dropped.
CN201310476789.3A 2013-10-14 2013-10-14 A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation Active CN103546377B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310476789.3A CN103546377B (en) 2013-10-14 2013-10-14 A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310476789.3A CN103546377B (en) 2013-10-14 2013-10-14 A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation

Publications (2)

Publication Number Publication Date
CN103546377A CN103546377A (en) 2014-01-29
CN103546377B true CN103546377B (en) 2016-06-08

Family

ID=49969443

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310476789.3A Active CN103546377B (en) 2013-10-14 2013-10-14 A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation

Country Status (1)

Country Link
CN (1) CN103546377B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104320824A (en) * 2014-11-18 2015-01-28 成都博盛信息技术有限公司 ZigBee-based power consumption equalizing system in intelligent home system
CN104581648A (en) * 2015-02-03 2015-04-29 杨奎武 Message routing mechanism on basis of broadcast duplicate elimination for delay-tolerant mobile sensor networks
CN106559811B (en) * 2015-09-28 2019-11-22 展讯通信（上海）有限公司 Bluetooth data reception control method and device
CN105307231B (en) * 2015-11-12 2019-04-09 天津大学 Tolerance delay network route implementation method based on collision probability and social analysis
CN107426767B (en) * 2017-06-15 2020-12-15 中国人民解放军理工大学 Dynamic network access method suitable for business imbalance
CN107995114B (en) * 2017-12-08 2020-11-27 江西理工大学 Routing method of delay tolerant network based on density clustering
CN110138593B (en) * 2019-04-11 2021-09-14 上海卫星工程研究所 SMC network-based distributed system simulation communication system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102833160A (en) * 2012-08-17 2012-12-19 北京航空航天大学 Contact predication based large-scale mobile delay tolerant network cluster-based routing method and system thereof

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5347972B2 (en) * 2007-12-17 2013-11-20 日本電気株式会社 Routing method and node

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102833160A (en) * 2012-08-17 2012-12-19 北京航空航天大学 Contact predication based large-scale mobile delay tolerant network cluster-based routing method and system thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"延迟/中断可容忍网络路由中的关键技术";刘水仙等;《通信技术》;20100930;第43卷(第9期);全文 *

Also Published As

Publication number Publication date
CN103546377A (en) 2014-01-29

Similar Documents

Publication Publication Date Title
CN103546377B (en) A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation
US8811379B2 (en) Control apparatus and control method
Gelenbe et al. Power-aware ad hoc cognitive packet networks
US20110026500A1 (en) Low latency mesh network
CN106604346A (en) Wireless sensor network energy effective opportunistic routing protocol implementation method
CN109818866B (en) Energy awareness and multidimensional parameter perception service quality guarantee routing method
CN104010343A (en) Wireless network optimization method for intelligent meter reading system
CN106714263A (en) Wireless sensor network AODV routing protocol implementation system and method
Li et al. Energy-efficient multipath routing in wireless sensor network considering wireless interference
Yitayal et al. A balanced battery usage routing protocol to maximize network lifetime of MANET based on AODV
CN105704776B (en) A kind of node messages retransmission method for taking into account network node energy and caching
CN107846706A (en) A kind of coding cognitive radio mesh network multipaths footpath method for routing of Congestion Avoidance
CN106686679B (en) Energy-efficiency-based multi-hop D2D routing hop number limiting method in content-centric network
CN106953803A (en) A kind of improvement probabilistic routing method based on deep space delay-tolerant network
CN103888976A (en) Link selection method combined with network scheduling and routing
CN108990082A (en) A kind of multi-path routing method predicted based on link existent time and energy consumption
CN104053205A (en) Wireless sensor network routing method based on quasi-optimization principle
Guo et al. Resource aware routing protocol in heterogeneous wireless machine-to-machine networks
CN103096411B (en) Based on the Internet of Things communication means of reverse power restriction route protocol
CN102137463A (en) Energy-based multi-path routing method for wireless network
CN104010339A (en) WSN clustering method based on packet loss probability measurement
Hafeez et al. An energy efficient adaptive cooperative routing protocol for underwater WSNs
Luo et al. An energy-efficient DSR routing protocol based on mobility prediction
CN101854304B (en) Processing method of transferred message under memory route system in delay-tolerant network
CN101155125B (en) Method for processing congestion

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20140129

Assignee: Jiangsu Nanyou IOT Technology Park Ltd.

Assignor: Nanjing Post & Telecommunication Univ.

Contract record no.: 2016320000214

Denomination of invention: A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation

Granted publication date: 20160608

License type: Common License

Record date: 20161117

LICC Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model
EC01 Cancellation of recordation of patent licensing contract

Assignee: Jiangsu Nanyou IOT Technology Park Ltd.

Assignor: Nanjing Post & Telecommunication Univ.

Contract record no.: 2016320000214

Date of cancellation: 20180116

EC01 Cancellation of recordation of patent licensing contract