CN104301237B - Data subscription and distribution method applicable to delay-tolerant and disconnection-tolerant network - Google Patents
Data subscription and distribution method applicable to delay-tolerant and disconnection-tolerant network Download PDFInfo
- Publication number
- CN104301237B CN104301237B CN201410539430.0A CN201410539430A CN104301237B CN 104301237 B CN104301237 B CN 104301237B CN 201410539430 A CN201410539430 A CN 201410539430A CN 104301237 B CN104301237 B CN 104301237B
- Authority
- CN
- China
- Prior art keywords
- data
- subscription
- theme
- node
- packet
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to the field of data distribution, in particular to a data subscription and distribution method applicable to a delay-tolerant and disconnection-tolerant network. The method is achieved through the technical scheme. According to the technical scheme, the data subscription and distribution method applicable to the delay-tolerant and disconnection-tolerant network includes the steps that first, information source nodes perform data packet code issuing; second, relay nodes perform code forwarding; third, an information sink issues a theme subscription packet; fourth, the theme subscription packet is processed by the relay nodes; fifth, the relay nodes perform congestion control processing on a theme data issuing table and a theme information subscription table; sixth, information sink nodes perform data decoding; seventh, ACK data packets are processed by the relay nodes. Through the method, a network code transmission mechanism, a data subscription and distribution mechanism and functions such as a data congestion control function are fused, and the function of data distribution in a delay-tolerant and disconnection-tolerant network environment is achieved.
Description
Technical field
The present invention relates to data distribution field, and in particular to hold a kind of data subscription suitable for delay-disruption tolerant network and distribute
Method.
Background technology
, by WiFi, 802.11 grade wireless modes will carry out the chance of data interaction and will increase with the popularization of mobile computing in future
It is many, a kind of connection interruption, transmission delay etc. possibly normal phenomenon, therefore, Next Generation Internet network must take into in this
The support of disconnected delay network environment, supplements existing " high bandwidth low latency " network, it is proposed that a kind of " to hold and hold late suspension
The concept of network ".
Delay-disruption tolerant network is to solve a kind of Novel net that the data transmission problems under isomery, Lossy Networks are proposed
Network model.Compared with legacy network, delay-disruption tolerant network has the property that：1) dynamic link, due to the random movement of node,
What the Link State between node often changed, even intermittent communication, channel speed, network packet loss rate etc. all can be with environment
Change and change；2) dynamic topology, the change and the random movement of node due to inter-node link so that network topology
Jing often changes；3) transmission delay, intermittent communication, due to network dynamic, link is unreliable, the biography of data in delay-disruption tolerant network
Defeated delay is often unpredictable and time delay is longer, and inter-node link is often intermittent communication.Typical delay-disruption tolerant network has
Battlefield mobile network, space communication network, military self-organizing network, sensor network etc..
Due to the characteristic of delay-disruption tolerant network so that data point are carried out in delay-disruption tolerant network by conventional network techniques
Send out and seemed unable to do what one wishes.It is based on the vacation being reliably connected between node because legacy network is built upon in TCP/IP systems
If：1. path end to end there is between data source and destination；2. maximum round trip time in network between any node pair（RTT）
Can not be oversize；3. end-to-end packet loss rate is less.And in Bandwidth-Constrained, a connection breaking, dynamic topology, big propagation delay time etc.
Performance in " slow circuit network " environment occurs and drastically deteriorate, and causes traditional OSPF (Open Shortest Path
First), RIP（Routing Information Protocol）Cannot normally run Deng Routing Protocol.Ad Hoc networks route
Be also follow " there is complete end-to-end path " it is assumed that AODV（Ad hoc on Demand Distance Vector）,
DSR（Dynamic Source Routing）Also it is dfficult to apply in " slow circuit network " Deng Routing Protocol.For reaction equation route
Agreement, because node motion reduces path duration, its throughput is close to 0, even if modifying to above agreement
It is difficult to fundamentally solve problem above.
Delay-disruption tolerant network increased data delivery success rate using the opportunistic communication pattern of " storage-carry-forwarding ", carry
Go out various routing mechanisms such as such as infectious disease route, injection route, probability route, but these routing mechanisms are thrown in lifting data
While passing rate, the shortcomings of information redundance is high, and network resource usage is insufficient is also brought, while also causing many place nets of multi-source
Data transfer is more complicated between sourcesink in network.
In addition, with the surge and the variation of receiver of information content, Data receiver requires can be selectively
Data interested are received, if data are broadcasting or end-to-end transmission means can all cause larger offered load and network money
Source wastes.Therefore, data dissemination techniques have studied and how realize setting up an efficient, letter for loose coupling between information source and the stay of two nights
Breath distribution channel, directionality and purpose that enhancement information is propagated, improves data transmission efficiency, and data subscription distribution mechanisms are exactly
Wherein typical data distribution model.But subscribe to distribution mechanisms and the offer in reliable network is often provided in the way of data route
Data distributing, in dynamic topology, the limited network environment of interruption delay, traditional subscription distribution mechanisms are but difficult to dispose
Implement.
The main thought of network code transmission is that node computing capability is utilized during cast communication, it is allowed to which node is to passing
Defeated information is processed and is operated relativity of information and information to increase packet diffusivity in a network, Jin Erti
The utilization rate of high-transmission channel.Research shows that network code is to solve network information flow problem in some particular networks to have efficacious prescriptions
Method, has its superior increasing network utilization, reducing the aspects such as transmission delay, enhancing internet security, saving node energy consumption
Property.For general multicast network, the upper limit of multicast capacity can be reached using linear network encoding, be with " butterfly networks "
Example, carries out data transmission may certify that its bandwidth availability ratio can improve 33% by network code.
Therefore, the routing mechanism of network coding technique and " storage-carry-forwarding " is applied in data subscription distribution procedure
In, network transmission capacity can be made full use of, can increase network utilization, transmission delay is reduced, solve conventional subscription distribution
Mechanism delivery ratio in limited network is low, delivers the problems such as postponing big.
The content of the invention
It is an object of the invention to provide a kind of data subscription distribution method suitable for delay-disruption tolerant network, the method is melted
The functions such as network code transmission mechanism, data subscription distribution mechanisms, data congestion control have been closed, delay-disruption tolerant network ring has been realized
Function of data distribution under border.
Above-mentioned technical purpose is achieved by the following technical programs：A kind of data subscription suitable for delay-disruption tolerant network
Distribution method, it is assumed that the data of information source transmission include P={ p1,p2,…pnEtc. n subject data bag, each subject data bag by
The binary digit of a string of indefinite lengths constitutes pi=b1b2b3…bm；
The concrete steps of this kind of data distributing method include：
（1）Information source node carries out as follows data packet coding issue：
（1.1）Information source detects adjacent node, calculates information source node outgoing route number k.If k=0, continue to detect until going out
Existing adjacent node；
（1.2）By the binary data string p of subject data bagi=b1b2b3…bmIt is divided into the substring that k length is 1024
{pi1,pi2,…pik}；If k>10, then willp i Block, carry out encoding calculating and transmission in batches；If k≤10, turn（1.3）；
（1.3）If last data substring pikLength be less than 1024, then by pik0 polishing of a high position, then carry out
Coding is calculated.Otherwise turn（1.4）；
（1.4）Information source produces the diagonal matrix A of a k*kk, calculate Ak*[pi1,pi2,…pik], produce k coding vector
And encoded radio；
（1.5）The maximum handover number of bag is set, before bag forwarding calculating packet in the holdup time of this node, and by number
The node holdup time is deducted according to the TTL in bag attribute；
（1.6）K coded data packet is encapsulated by data packet format, the coding of generation is wrapped to the forwarding of k bars outgoing route；
（2）Via node carries out as follows coding forward process：
（2.1）Via node receives the coding bag of theme topic and batch number packageNo；
（2.2）Coding bag is stored in into subject data by theme topic and batch number packageNo to issue in list；
（2.3）The coding bag for selecting all themes to be that topic batch numbers are packageNo in list is issued from subject data
{d1, d2... dt, corresponding coding vector and encoded radio are respectively di.codevector,di.value；
（2.4）Via node detects adjacent node, and is every outgoing routeoutput i A vector length is generated at random
For the coding vector C of ti={ci1,ci2…cit}；
（2.5）Calculate the encoded radio V of packeti=[ d1.value, d2.value,…dt.value]*[ ci1,ci2…
cit]T, the coding vector of packet, and the bag handover number in packet attribute is added 1, build corresponding to every outgoing routeoutput i Coded data packet；
（2.6）Subscription list in the via node is inquired about, if the not subscription package of the theme, the coded data that will be produced
Wrap and forwarded to all corresponding outgoing routes, execution step（2.9）If there is the subscription package of the subject data in subscription list,
Execution step（2.7）；
（2.7）Packet is calculated in this node holdup time, when the remaining life span of packet is deducted into node delay
Between；
（2.8）Select to deliver the higher subscription package of probability, coded data packet is delivered to the stay of two nights along the subscription path of subscription package；
（2.9）Judge the maximum handover number of subject data bag, if reaching maximum handover number, packet no longer turns
Send out, and turn（2.11）Perform, if not having, go to step（2.10）Perform；
（2.10）Detection adjacent node, to adjacent node data encoding bag is forwarded；
（2.11）Subscription package and subject data the package list in more new node, if the remaining life span of theme bag is 0, will
Theme bag is deleted, and by step（5）Cleaning node topic data publication table；
（3）Stay of two nights issuing subject subscription package as follows：
（3.1）The stay of two nights produces subject information subscription package according to information agent demand, and this node is tagged to into subscription package
In subscribing to forward-path；
（3.2）The adjacent connection node of information destination node detection；
（3.3）The stay of two nights is to adjacent connection node forwarding theme subscription package；
（4）Via node is processed theme subscription package as follows：
（4.1）Via node receives theme subscription package, and this node is tagged in the subscription forward-path of subscription package；
（4.2）According to the data message of the subscription package for receiving, calculate and subscribe to the delivery probability in path, and update the subscription package
Delivery probable value；
（4.3）Judge whether theme subscription table is full, and if full step is pressed（5）Cleaning node topic data publication table,
Otherwise turn（4.4）；
（4.4）The subscription package for receiving is stored to corresponding theme and subscribed to by via node according to the subject information of subscription package
In list；
（4.5）Theme publishing table and theme subscription table in theme matched node, if there is the issue for matching
And subscription information, then issuing packet forwarding process by via node theme carries out data forwarding；
（4.6）Judge whether theme subscription package reaches maximum handover number or remaining life span for 0, if not up to,
Continue to forward subscription package to adjacent node；
（4.7）Theme subscription list is updated, the subscription packet cleared up in subscription list；
（5）Via node is carried out at congestion control as follows to subject data publishing table and subject information subscription table
Reason：
（5.1）Subject data publishing table stores all themes issue data of this node of approach, and data publication table presses theme
Stored with chained list and retrieved with theme batch；
（5.1.1）Traversal subject data publishing table, if there is remaining life span and being 0 or receiving the master of packet ACK
Topic packet, then turn the subject data packet making to delete（5.1.3）；Otherwise, next step is performed；
（5.1.2）Judge whether theme publishing queue is full, if data queue memory is full, in searching list interior joint
Holdup time is most long and subscribes to the packet of least number of times, is labeled as deleting；
（5.1.3）The packet that will be labeled as deleting in theme publishing queue is deleted；
（5.2）Subject data subscription table stores the theme subscription package of all this nodes of approach, theme subscription table press theme with
Chained list is stored and retrieved；
（5.2.1）Traversal subject information subscription table, if there is remaining life span and being 0 or receiving the master of packet ACK
Topic subscription package, then be labeled as the theme subscription package deleting, and turns（5.2.3）；Otherwise, next step is performed；
（5.2.2）Judge whether theme subscription queue is full, if subscription store queue is full, in searching list interior joint
Holdup time most long subscription package, is labeled as deleting；
（5.2.3）The subscription package that will be labeled as deleting in theme subscription queue is deleted；
（6）Information destination node carries out as follows data decoding process：
（6.1）Information destination node receives theme coded data packet；
（6.2）Whether the same subject that judgement is received reaches data encoding vector with a batch of data encoding bag number
Length, turn if being not reaching to（6.1）, data decoding is otherwise carried out as follows；
（6.3）Same subject is constituted into an encoder matrix with the coding vector of a batch of data encoding bag, judging should
Encoder matrix whether full rank, if not full rank, then turns（6.1）；If full rank, then performing subsequent step carries out data decoding behaviour
Make；
（6.4）The encoded radio of encoder matrix and coding bag is formed into a linear matrix equation group, by Gaussian elimination method
Dematrix equation group obtains initial data segment information；
（6.5）Initial data segment information is spliced by corresponding label location, original data message string is formed；
（6.6）If data decoding is completed, build packet and finish receiving packet ACK, to adjacent node theme is sent
Data receiver completes ack msg bag；
（7）Via node is processed ack msg bag as follows：
（7.1）Via node receives ack msg bag；
（7.2）Traversal subject data subscription table, searches with the subject data subscription package of theme number, and the bag is deleted；
（7.3）Traversal subject data publishing table, searches and issues bag with the subject data of batch with theme, and the packet is deleted
Remove；
（7.4）Ack msg bag is forwarded to adjacent node.
Beneficial effects of the present invention：The present invention is thought based on the data delivery of network coding technique and " storage-carry-forwarding "
Want to improve traditional data subscription distribution mechanisms, for transmission delay is big, intermittent communication, dynamic topology network rings
Border, it is proposed that a kind of data distributing method based on network code, to solve traditional data subscription distribution mechanisms in Rong Chirong
The low problem of data distribution efficiency under circuit network environment；
Main idea is that：The data of generation are divided into different themes by information source according to the information category of data
Packet carries out data publication, and information destination node subscribes to according to demand different subject datas；Each subject data bag is in a network
Transmitted in the way of network code, information destination node receives and data decoding is carried out after the coded data packet of each theme obtains original number
According to；Via node delivers probability and carries out congestion control according to packet in transmitting procedure.Information source issue is specifically included, in issuing bag
After forwarding, the stay of two nights is subscribed to, subscription package relay forwarding, packet congestion control, stay of two nights decoding, the process such as ACK confirmations；
The advantage of method that the present invention is provided is：First, with the thought of " storage-carry-forwarding " to subscribing to sorter
System is improved so that it more adapts to delay-disruption tolerant network environment, improves data delivery rate；Second, using network code
Mode carries out data distribution, can make full use of network transmission bandwidth, reduces propagation delay time；3rd, in delay-disruption tolerant network environment
Lower system realizes data publication, subscription, relay forwarding and congestion control mechanism, solves traditional chance routing mode
Data redundancy, the big problem of offered load is caused to improve data transmission efficiency.
Description of the drawings
Fig. 1 is the theme data publication bag data form schematic diagram；
Fig. 2 is that information source node coding issues packet schematic flow sheet；
Fig. 3 is that via node encodes forward process schematic flow sheet；
Fig. 4 is the theme subscription package data form schematic diagram；
Fig. 5 is stay of two nights issuing subject subscription package schematic flow sheet；
Fig. 6 is the theme data subscription table storage format schematic diagram；
Fig. 7 is handling process schematic diagram of the via node to theme subscription package；
Fig. 8 is the theme data publication table storage format schematic diagram；
Fig. 9 be the theme publishing queue update handling process schematic diagram；
Figure 10 be the theme subscription queue update handling process；
Figure 11 is ack msg bag form schematic diagram；
Figure 12 is information destination node data decoding process schematic flow sheet；
Figure 13 is the ack msg bag handling process schematic diagram of via node.
Specific embodiment
Below in conjunction with the accompanying drawings the present invention is further detailed explanation.
Embodiment：A kind of data subscription distribution method suitable for delay-disruption tolerant network,
It is assumed that the data of information source transmission include P={ p1,p2,…pnEtc. n subject data bag, each subject data bag is by one
The binary digit of string indefinite length constitutes pi=b1b2b3…bm；
Concrete steps include：
（1）Information source node coding issues packet flow process as shown in Fig. 2 specifically including following steps：
（1.1）Information source detects adjacent node, calculates information source node outgoing route number k；If k=0, continue to detect until going out
Existing adjacent node；
（1.2）By the binary data string p of subject data bagi=b1b2b3…bmIt is divided into the substring that k length is 1024
{pi1,pi2,…pik}；If k>10, then willp i Block, carry out encoding calculating and transmission in batches；If k≤10, turn（1.3）；
（1.3）If last data substring pikLength be less than 1024, then by pik0 polishing of a high position, then carry out
Coding is calculated；Otherwise turn（1.4）；
（1.4）Information source produces the diagonal matrix A of a k ╳ kk, calculate Ak*[pi1,pi2,…pik], produce k coding vector
And encoded radio；
（1.5）The maximum handover number of bag is set, before bag forwarding calculating packet in the holdup time of this node, and by number
The node holdup time is deducted according to the TTL in bag attribute；
（1.6）K coded data packet is encapsulated by data packet format, coded data packet form is as shown in figure 1, the volume that will be produced
Code is wrapped to the forwarding of k bars outgoing route；
It is as shown in Figure 2 that information source node coding issues packet flow process；
（2）Via node encodes forward process flow process as shown in figure 3, specifically including following steps：
（2.1）Via node receives the coding bag of theme topic and batch number packageNo；
（2.2）Coding bag is stored in into subject data by theme topic and batch number packageNo to issue in list；
（2.3）The coding bag for selecting all themes to be that topic batch numbers are packageNo in list is issued from subject data
{d1,d2,…dt}；
（2.4）Via node detects adjacent node, and is every outgoing routeoutput i A vector length is generated at random
For the coding vector C of ti={ci1,ci2…cit}；
（2.5）Calculate the encoded radio V of packeti=[ d1.value, d2.value,…dt.value]*[ ci1,ci2…
cit]T, the coding vector of packet, and the bag handover number in packet attribute is added 1, build corresponding to every outgoing routeoutput i Coded data packet；
（2.6）Subscription list in the via node is inquired about, if the not subscription package of the theme, the coded data that will be produced
Wrap and forwarded to all corresponding outgoing routes, execution step（2.9）If there is the subscription package of the subject data in subscription list,
Execution step（2.7）；
（2.7）Packet is calculated in this node holdup time, when the remaining life span of packet is deducted into node delay
Between；
（2.8）Select to deliver the higher subscription package of probability, coded data packet is delivered to the stay of two nights along the subscription path of subscription package；
（2.9）Judge the maximum handover number of subject data bag, if reaching maximum handover number, packet no longer turns
Send out, and turn（2.11）Perform, if not having, go to step（2.10）Perform；
（2.10）Detection adjacent node, to adjacent node data encoding bag is forwarded；
（2.11）Subscription package and subject data the package list in more new node, if the remaining life span of theme bag is 0, will
Theme bag is deleted, and by step（5）Cleaning node topic data publication table；
（3）Stay of two nights issuing subject subscription package handling process is as shown in figure 5, specifically include following steps：
（3.1）The stay of two nights produces subject information subscription package according to information agent demand, and this node is tagged to into ordering for subscription package
In readding forward-path, and initialize subscription path to deliver probability is 1, arranges the remaining life span of bag and bag maximum handover number,
Shown in theme subscription package form Fig. 4；
（3.2）The adjacent connection node of information destination node detection；
（3.3）The stay of two nights is to adjacent connection node forwarding theme subscription package；
（4）Via node is to the handling process of theme subscription package as shown in fig. 7, specifically including following steps：
（4.1）Via node receives theme subscription package, and this node is tagged in the subscription forward-path of subscription package；
（4.2）According to the data message of the subscription package for receiving, it is calculated as follows subscribing to the delivery probability in path, and more
The delivery probable value of the new subscription package；
Deliver probability=original and deliver probability × (remaining life span-transmission delay)(remaining life span) ×（Bag is most
Big handover number-bag handover number）The maximum handover number of/bag
（4.3）Judge whether theme subscription table is full, and if full step is pressed（5）Cleaning node topic data publication table,
Otherwise turn（4.4）；
（4.4）The subscription package for receiving is stored to corresponding theme and subscribed to by via node according to the subject information of subscription package
In list, sheet format is subscribed to as shown in Figure 6；
（4.5）Theme publishing table and theme subscription table in theme matched node, if there is the issue for matching
And subscription information, then issuing packet forwarding process by via node theme carries out data forwarding；
（4.6）Judge whether theme subscription package reaches maximum handover number or remaining life span for 0, if not up to,
Continue to forward subscription package to adjacent node；
（4.7）Theme subscription list is updated, the subscription packet cleared up in subscription list；
（5）Via node safeguards a subject data publishing table and subject information subscription table simultaneously, and enters as follows
Row congestion control is operated：
（5.1）Subject data publishing table stores all themes issue data of this node of approach, and data publication table presses theme
Stored with chained list and retrieved with theme batch, it is as shown in Figure 8 that theme is issued sheet format.Theme publishing queue safeguards processing stream
Journey is as shown in Figure 9；
（5.1.1）Traversal subject data publishing table, if there is remaining life span and being 0 or receiving the master of packet ACK
Topic packet, then turn the subject data packet making to delete（5.1.3）；Otherwise, next step is performed；
（5.1.2）Judge whether theme publishing queue is full, if data queue memory is full, in searching list interior joint
Holdup time is most long and subscribes to the packet of least number of times, is labeled as deleting；
（5.1.3）The packet that will be labeled as deleting in theme publishing queue is deleted；
It is as shown in Figure 9 that theme publishing queue updates handling process；
（5.2）Subject data subscription table stores the theme subscription package of all this nodes of approach, theme subscription table press theme with
Chained list is stored and retrieved, and it is as shown in Figure 6 that theme subscribes to sheet format；Theme publishing queue safeguards handling process such as Figure 10 institutes
Show；
（5.2.1）Traversal subject information subscription table, if there is remaining life span and being 0 or receiving the master of packet ACK
Topic subscription package, then be labeled as the theme subscription package deleting, and turns（5.2.3）；Otherwise, next step is performed；
（5.2.2）Judge whether theme subscription queue is full, if subscription store queue is full, in searching list interior joint
Holdup time most long subscription package, is labeled as deleting；
（5.2.3）The subscription package that will be labeled as deleting in theme subscription queue is deleted；
（6）Information destination node data decoding process flow process as shown in figure 12, is comprised the following steps that：
（6.1）Information destination node receives theme coded data packet；
（6.2）Whether the same subject that judgement is received reaches data encoding vector with a batch of data encoding bag number
Length, turn if being not reaching to（6.1）, data decoding is otherwise carried out as follows；
（6.3）Same subject is constituted into an encoder matrix with the coding vector of a batch of data encoding bag, judging should
Encoder matrix whether full rank, if not full rank, then turns（6.1）；If full rank, then performing subsequent step carries out data decoding behaviour
Make；
（6.4）The encoded radio of encoder matrix and coding bag is formed into a linear matrix equation group, by Gaussian elimination method
Dematrix equation group obtains initial data segment information；
（6.5）Initial data segment information is spliced by corresponding label location, original data message string is formed；
（6.6）If data decoding is completed, build packet and finish receiving packet ACK, ack msg bag form such as Figure 11
It is shown, send subject data to adjacent node and finish receiving ack msg bag；
（7）The ack msg bag handling process of via node as shown in figure 13, is comprised the following steps that：
（7.1）Via node receives ack msg bag；
（7.2）Traversal subject data subscription table, searches with the subject data subscription package of theme number, and the bag is deleted；
（7.3）Traversal subject data publishing table, searches and issues bag with the subject data of batch with theme, and the packet is deleted
Remove；
（7.4）Ack msg bag is forwarded to adjacent node.
Test case：
A DTN network scenarios is devised in ONE simulated environment：It is random distribution three in the region of 4000m in radius
If class dry contact, a class node carries out random waypoint mobility, and effective communication distance is 1-5m, is cached as 5M；Two class nodes are along road
Footpath is moved, and effective communication distance is 1-20m, is cached as 20M;Three class node locations are fixed, and effective communication distance is 1-100m;Institute
There is node to subscribe to, issue and relay data bag;10% node is randomly selected as information source and the stay of two nights, remaining is relaying section
Point, information source node delivers 10000 in the distribution subscription mode and the inventive method under conventional TCP/IP patterns to the stay of two nights respectively
Size is the subject data bag of 100kB-1MB, and the stay of two nights is counted to receiving data volume and reception time, then compares information source and sends out
Send data volume and send Time Calculation data delivery rate and deliver and postpone, when emulation is completed, by the buffer data size of all nodes
With the ratio calculation data redundancy rate for issuing data volume.
The lifting that this method subscribes to distribution performance under delay-disruption tolerant network environment is tested in simulated environment, is commented respectively
Valency in 40,80,100 network node scales, under conventional TCP/IP patterns and using the data delivery rate of this method, prolong by delivery
The performance indications such as slow and data redundancy;Following 3 kind test is carried out：
（1）The data delivery rate of two methods；
（2）The data delivery of two methods postpones；
（3）The data redundancy rate of two methods.
By simulated experiment, following test result is drawn（Test result takes the mean value of 10 test datas）：
Test result indicate that：This method can significantly improve the data delivery performance under delay-disruption tolerant network environment, in net
Network transmission delay is larger, and in the case of frequently interrupting, this method can overcome conventional TCP/undeliverable problem of IP mode datas,
The larger performance boost for bringing.
Claims (1)
1. a kind of data subscription distribution method suitable for delay-disruption tolerant network, it is characterised in that
It is assumed that the data of information source transmission include P={ p1,p2,…pnN subject data bag, each subject data bag by a string not
The binary digit of measured length constitutes pi=b1b2b3…bm；
The concrete steps of this kind of data distributing method include：
（1）Information source node carries out as follows data packet coding issue：
（1.1）Information source detects adjacent node, calculates information source node outgoing route number k,
If k=0, continue to detect until there is adjacent node；
（1.2）By the binary data string p of subject data bagi=b1b2b3…bmIt is divided into the substring { p that k length is 1024i1,
pi2,…pik}；If k>10, then willp i Block, carry out encoding calculating and transmission in batches；If k≤10, turn（1.3）；
（1.3）If last data substring pikLength be less than 1024, then by pik0 polishing of a high position, then encoded
Calculate, otherwise turn（1.4）；
（1.4）Information source produces the diagonal matrix A of a k*kk, calculate Ak*[pi1,pi2,…pik], produce k coding vector and volume
Code value；
（1.5）The maximum handover number of bag is set, before bag forwarding calculating packet in the holdup time of this node, and by packet
TTL in attribute deducts the node holdup time；
（1.6）K coded data packet is encapsulated by data packet format, the coding of generation is wrapped to the forwarding of k bars outgoing route；
（2）Via node carries out as follows coding forward process：
（2.1）Via node receives the coding bag of theme topic and batch number packageNo；
（2.2）Coding bag is stored in into subject data by theme topic and batch number packageNo to issue in list；
（2.3）Coding bag { the d for selecting all themes to be that topic batch numbers are packageNo in list is issued from subject data1,
d2... dt, corresponding coding vector and encoded radio are respectively di.codevector,di.value；
（2.4）Via node detects adjacent node, and is every outgoing routeoutput i It is random to generate a vector length for t's
Coding vector Ci={ci1,ci2…cit}；
（2.5）Calculate the encoded radio V of packeti=[ d1.value, d2.value,…dt.value]*[ ci1,ci2…cit]T,
The coding vector of packet, and the bag handover number in packet attribute is added 1, build corresponding to every outgoing routeoutput i Coded data packet；
（2.6）Inquire about subscription list in the via node, if the not subscription package of the theme, by produce coded data packet to
All corresponding outgoing route forwardings, execution step（2.9）If there is the subscription package of the subject data in subscription list, perform
Step（2.7）；
（2.7）Packet is calculated in this node holdup time, the remaining life span of packet is deducted into the node holdup time；
（2.8）Select to deliver the higher subscription package of probability, coded data packet is delivered to the stay of two nights along the subscription path of subscription package；
（2.9）Judge the maximum handover number of subject data bag, if reaching maximum handover number, packet is no longer forwarded, and
Turn（2.11）Perform, if not having, go to step（2.10）Perform；
（2.10）Detection adjacent node, to adjacent node data encoding bag is forwarded；
（2.11）Subscription package and subject data the package list in more new node, if the remaining life span of theme bag is 0, by theme
Bag is deleted, and by step（5）Cleaning node topic data publication table；
（3）Stay of two nights issuing subject subscription package as follows：
（3.1）The stay of two nights produces subject information subscription package according to information agent demand, and this node is tagged to into the subscription of subscription package
In forward-path；
（3.2）The adjacent connection node of information destination node detection；
（3.3）The stay of two nights is to adjacent connection node forwarding theme subscription package；
（4）Via node is processed theme subscription package as follows：
（4.1）Via node receives theme subscription package, and this node is tagged in the subscription forward-path of subscription package；
（4.2）According to the data message of the subscription package for receiving, calculate and subscribe to the delivery probability in path, and update the throwing of the subscription package
Pass probable value；
（4.3）Judge whether theme subscription table is full, and if full step is pressed（5）Cleaning node topic data publication table, otherwise
Turn（4.4）；
（4.4）Via node is by the subscription package for receiving according to the storage of the subject information of subscription package to corresponding theme subscription list
In；
（4.5）Theme publishing table and theme subscription table in theme matched node, if there is the issue for matching and order
Information is read, then issuing packet forwarding process by via node theme carries out data forwarding；
（4.6）Judge whether theme subscription package reaches maximum handover number or remaining life span for 0, if not up to, continuing
Subscription package is forwarded to adjacent node；
（4.7）Theme subscription list is updated, the subscription packet cleared up in subscription list；
（5）Via node carries out congestion control process to subject data publishing table and subject information subscription table as follows：
（5.1）Subject data publishing table stores all themes issue data of this node of approach, and data publication table presses theme and master
Topic batch is stored with chained list and retrieved；
（5.1.1）Traversal subject data publishing table, if there is remaining life span and being 0 or receiving the number of topics of packet ACK
According to bag, then the subject data packet making is turned to delete（5.1.3）；Otherwise, next step is performed；
（5.1.2）Judge whether theme publishing queue is full, if data queue memory is full, searches in list interior joint and is detained
Time is most long and subscribes to the packet of least number of times, is labeled as deleting；
（5.1.3）The packet that will be labeled as deleting in theme publishing queue is deleted；
（5.2）Subject data subscription table stores the theme subscription package of all this nodes of approach, and theme subscription table presses theme with chained list
Stored and retrieved；
（5.2.1）Traversal subject information subscription table, if there is remaining life span and being 0 or receiving the theme of packet ACK and order
Bag is read, is then labeled as the theme subscription package deleting, turned（5.2.3）；Otherwise, next step is performed；
（5.2.2）Judge whether theme subscription queue is full, if subscription store queue is full, searches in list interior joint and is detained
Time most long subscription package, is labeled as deleting；
（5.2.3）The subscription package that will be labeled as deleting in theme subscription queue is deleted；
（6）Information destination node carries out as follows data decoding process：
（6.1）Information destination node receives theme coded data packet；
（6.2）Whether the same subject that judgement is received reaches the length of data encoding vector with a batch of data encoding bag number
Degree, turns if being not reaching to（6.1）, data decoding is otherwise carried out as follows；
（6.3）Same subject is constituted into an encoder matrix with the coding vector of a batch of data encoding bag, the coding is judged
Matrix whether full rank, if not full rank, then turns（6.1）；If full rank, then performing subsequent step carries out data decoding operation；
（6.4）The encoded radio of encoder matrix and coding bag is formed into a linear matrix equation group, by Gaussian elimination method solution square
Battle array equation group obtains initial data segment information；
（6.5）Initial data segment information is spliced by corresponding label location, original data message string is formed；
（6.6）If data decoding is completed, build packet and finish receiving packet ACK, to adjacent node subject data is sent
Finish receiving ack msg bag；
（7）Via node is processed ack msg bag as follows：
（7.1）Via node receives ack msg bag；
（7.2）Traversal subject data subscription table, searches with the subject data subscription package of theme number, and the bag is deleted；
（7.3）Traversal subject data publishing table, searches and issues bag with the subject data of batch with theme, and the packet is deleted；
（7.4）Ack msg bag is forwarded to adjacent node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410539430.0A CN104301237B (en) | 2014-10-13 | 2014-10-13 | Data subscription and distribution method applicable to delay-tolerant and disconnection-tolerant network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410539430.0A CN104301237B (en) | 2014-10-13 | 2014-10-13 | Data subscription and distribution method applicable to delay-tolerant and disconnection-tolerant network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104301237A CN104301237A (en) | 2015-01-21 |
| CN104301237B true CN104301237B (en) | 2017-05-10 |
Family
ID=52320810
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410539430.0A Active CN104301237B (en) | 2014-10-13 | 2014-10-13 | Data subscription and distribution method applicable to delay-tolerant and disconnection-tolerant network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104301237B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106294503B (en) * | 2015-06-09 | 2019-09-20 | 阿里巴巴集团控股有限公司 | Dynamic storage method, device and the calculating equipment of data |
| US9608928B1 (en) * | 2016-07-06 | 2017-03-28 | Machine Zone, Inc. | Multiple-speed message channel of messaging system |
| CN109286675B (en) * | 2018-10-15 | 2022-02-18 | 上海赛治信息技术有限公司 | FC-AE-ASM network data communication method and system |
| CN109600375B (en) * | 2018-12-13 | 2021-07-16 | 锐捷网络股份有限公司 | Message tracking method and device, electronic equipment and storage medium |
| CN109526023B (en) * | 2019-01-02 | 2021-09-07 | 上海第二工业大学 | Data packet packaging and checking method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102164359A (en) * | 2011-05-23 | 2011-08-24 | 清华大学 | Charging system and method for delay tolerance service in wireless network |
| CN102291319A (en) * | 2011-09-25 | 2011-12-21 | 北京理工大学 | Delay tolerant network system structure based on content naming |
-
2014
- 2014-10-13 CN CN201410539430.0A patent/CN104301237B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102164359A (en) * | 2011-05-23 | 2011-08-24 | 清华大学 | Charging system and method for delay tolerance service in wireless network |
| CN102291319A (en) * | 2011-09-25 | 2011-12-21 | 北京理工大学 | Delay tolerant network system structure based on content naming |
Non-Patent Citations (1)
| Title |
|---|
| DTN 网络环境下基于蚁群算法的数据编码分发;邓广宏，曹万华;《电子学报》;20140831;摘要，第1637页第1栏-第2栏第7段 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104301237A (en) | 2015-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104301237B (en) | Data subscription and distribution method applicable to delay-tolerant and disconnection-tolerant network | |
| CN103297343B (en) | Routing method based on delay tolerant network | |
| EP1944925B1 (en) | Group communication in a mobile ad-hoc network | |
| JP2005124195A (en) | Method for processing broadcast data in mobile ad-hoc network | |
| Huang et al. | Spray and wait routing based on position prediction in opportunistic networks | |
| CN102170332A (en) | Opportunistic routing protocol data distributing method based on fountain code and network coding | |
| JP2012217164A5 (en) | ||
| CN102118822A (en) | Big data forwarding method of vehicle ad hoc network (VANET) based on vehicle coordination | |
| CN106254474A (en) | Heterogeneous nodes cooperation caching method based on fountain codes under car networking | |
| Nissar et al. | A review and a new approach to reduce routing overhead in MANETs | |
| Rezaeifar et al. | A reliable geocast routing protocol for vehicular ad hoc networks | |
| CN108337176B (en) | Message processing method and device | |
| CN103560966A (en) | Opportunistic network route mixing method based on network coding and copying | |
| Pham et al. | Geographical awareness hybrid routing protocol in mobile ad hoc networks | |
| CN104486040A (en) | Efficient coding-aware routing method based on cache management | |
| Xu et al. | Improvement of AODV routing protocol based on wireless mesh networks | |
| Kamal et al. | A new approach buffer-efficient disruption tolerant protocol in vehicular delay-tolerant network | |
| CN109803244A (en) | The method and apparatus of data transmission | |
| Khan et al. | Location‐based data delivery between vehicles and infrastructure | |
| Khiadani et al. | Introducing a handshake for data dissemination using rateless codes in vehicular ad hoc networks | |
| CN101959225B (en) | Method for transmitting data in intermittently-connected mobile network | |
| Jiang et al. | Family ACK tree (FAT): a new reliable multicast protocol for mobile ad hoc networks | |
| Chauhan et al. | FFHBR: Flooding and Forwarding History Based Routing Algorithm for Vehicular Delay Tolerant Network | |
| Ram et al. | Latency estimation based routing (LEBR) protocol in vehicular adhoc networks (VANETs) | |
| Zhang et al. | Research of routing strategies based on network encoding under vehicle networking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |