CN110381469A - Ship networking block data transmission method based on probability of acceptance sliding window - Google Patents
Ship networking block data transmission method based on probability of acceptance sliding window Download PDFInfo
- Publication number
- CN110381469A CN110381469A CN201910661544.5A CN201910661544A CN110381469A CN 110381469 A CN110381469 A CN 110381469A CN 201910661544 A CN201910661544 A CN 201910661544A CN 110381469 A CN110381469 A CN 110381469A
- Authority
- CN
- China
- Prior art keywords
- node
- probability
- data
- collision probability
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/42—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for mass transport vehicles, e.g. buses, trains or aircraft
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
Abstract
The invention belongs to ship connected network communication technical field, the ship that is involved is a kind of based on probability of acceptance sliding window is networked block data transmission method.Relay node is just forwarded messages to when it is characterized in that only node itself and destination node collision probability being less than the collision probability of relay node and destination node；Data to be sent use the mode of sliding window to be sent in the form of data block, and it is only successfully transmitted probability and is deleted from sliding window more than ability after certain threshold value, otherwise it still waits for the subsequent relay node to meet to continue to forward, to improve the success rate of data forwarding.This method can satisfy to be used under the scene of big data quantity remote transmission at sea, and " storage-carrying-forwarding " of data is carried out for ocean aspiration ship.
Description
Technical field
The invention belongs to ship connected network communication technical field, the ship networking based on probability of acceptance sliding window that is involved is a kind of
Block data transmission method.
Background technique
Intelligent transportation system is the developing direction of future transportation system, and ship networks (Internet Of Vessels, IOV)
It is one of them emerging concept with important exploration, so its correlative study has certain theoretical value and practical meaning
Justice.
Existing ship networking architecture is various informative and disperses, and car networking is mostly used for reference in correlative study.Lack in marine environment
Fixed communication base station, the information generated during ship's navigation depends on greatly satellite communication, but satellite communication is costly,
It is only applicable to transmit the more urgent and lesser information of quantity.Those data volumes are more huge or of less demanding to propagation delay time
Information, can be transmitted by the ad hoc network between ship, when two ships meet, be carried out data transmission, by pulling in shore earlier
Ship carry data information, transmit it to bank base station, substantially reduce data transmission delay.
Opportunistic network is derived from tolerance delay network (DTN, Delay-Tolerant Networking) and mobile ad hoc network
(MATNET, Mobile Ad-Hoc Networking), it is a kind of it is not necessary that there are complete roads between source node and destination node
The self-organizing network of network communication can be realized merely with node motion bring opportunity for diameter.Opportunistic network is different from traditional
Multi-hop wireless network, the scale of network and the initial position of node are not unified plans, between source node and destination node
Path is also not determining in advance.Opportunistic network can overcome network to divide, what the existing wireless network technology such as time delay was difficult to overcome
Problem is primarily adapted for use in the shortage communications infrastructure, the severe scene of network environment.This communication situation and marine environment phase
Seemingly, lacking the communications infrastructure in marine environment and ship is sparse, this advantage is applicable in the afloat networking situation of ship very much,
Therefore opportunistic network can be applied to the information exchange in marine environment between ship.
All there is respective limitation in existing opportunistic network routing algorithm, such as Epidemic algorithm, each node will
Data grouping is transmitted to all relay nodes encountered, so that there are a large amount of copies in network, a large amount of consumption of network resources,
Direct Delivery algorithm only just forwards data grouping when encountering destination node, it is more likely that causes great data
Propagation delay time.Existing opportunistic network routing algorithm cannot meet that transmission success rate is high, transmitted data amount is big, network redundancy simultaneously
Spend small requirement suitable for offshore scene.Therefore a kind of big data that is suitable for is needed to transmit, and transmission success rate is high, network is superfluous
The low data transmission policies of remaining.
Summary of the invention
The ship that the invention proposes a kind of based on probability of acceptance sliding window is networked block data transmission method, and feature exists
Just message is turned when only node itself and destination node collision probability are less than the collision probability of relay node and destination node
Issue relay node；Data to be sent use the mode of sliding window to be sent in the form of data block, and only success
Sending probability be more than certain threshold value after just deleted from sliding window, otherwise still wait for the subsequent relay node to meet after
Continuous forwarding, to improve the success rate of data forwarding.This method can satisfy to be made under the scene of big data quantity remote transmission at sea
With for " storage-carrying-forwarding " of ocean aspiration ship progress data.
Technical solution of the present invention is as follows:
A kind of ship networking block data transmission method based on probability of acceptance sliding window, the specific steps are as follows:
1. establishing connection, switched data transmission essential information
Sending node meets with relay node, establishes connection, and switched data transmission essential information.Node meets definition
Are as follows: sending node and relay node enter communication with one another range, i.e. sending node is less than sending node at a distance from relay node
Communicate radius and relay node communication radius between the two a lesser side when.
Data transmission essential information include: in the collision probability and relay node of relay node and destination node
Receive the data list for needing to be transmitted to destination node.
If two nodes repeatedly meet, they have higher possibility that can meet again, therefore define one and meet
Probability indicates the probability size that node meets again, and collision probability is generated when two nodes meet and is stored and is met to node is respective
In probability tables, when meeting again, collision probability is calculated by history collision probability.Two nodes phase in unit at a fixed time
The number of chance is more, and collision probability is bigger.By comparing the phase of node itself and destination node and relay node and destination node
Probability size is met to decide whether to forward messages to relay node.
If relay node did not met with destination node, the collision probability of the relay node and destination node is considered as zero.
Execute step 2.
2. recalculating the collision probability of sending node and relay node
When two nodes meet, two nodes recalculate the collision probability between node, and update collision probability table.It meets
The calculation method of probability is as follows:
When node A and node B meet, the approach frequency calculation method such as formula (1) between node A, B.It can by formula (1)
Know, the number that node meets is more, and the approach frequency between node is bigger.
P(A, B)=P(A, B) old+[1-P(A, B) old]*Pinit (1)
Wherein, Pinit∈ [0,1] is an initialization constants, P(A,B)oldFor the history collision probability of node A and node B,
It is stored in the collision probability table of node A and node B, P(A,B)It is the collision probability between this posterior nodal point that meets.
If node A and node B does not meet in a time quantum, collision probability will gradually aging, it is specific to count
Calculation mode such as formula (2).
P(A, B)=P(A, B) old*γK (2)
Wherein, [0,1] γ ∈, is an initialization constants, and K is the number of elapsed time unit.
Continue to execute step 3.
3. judging whether relay node meets forwarding condition
Forwarding condition are as follows: the collision probability of relay node and destination node is met greater than sending node with destination node general
Rate.
Sending node selection, will using relay node compared to the relay node for itself having more maximum probability and destination node to meet
Data forwarding not only contributes to shortening data in this way and is transmitted to the time delay of destination node to destination node, and improves data
The success rate of transmission.
If relay node meets forwarding condition, step 4 is executed, forwards data to relay node；Otherwise, not forwarding number
According to end this method.
4. forwarding data, calculating the successful reception probability of the data block of this transmission and judging the successful reception of the data block
Whether probability is greater than threshold value T
When sending node forwards data to relay node, data to be sent are divided into several pieces, are taken out from transmission list
The data block not having in relay node, is sent, and the data block for calculating this transmission is general in the successful reception of destination node
Rate.
A successful reception probability is defined, indicates that data block can be finally successfully delivered to the probability of destination node, it is assumed that
The data block of this forwarding is data block x, this successfully forwarded for the data block n-th, the successful reception probability of data block x
PxCalculation such as formula (3).By formula (3) it is found that the number that successfully forwarded of data block is more, the successful reception of data block
Probability is bigger, and the probability which is successfully forwarded to destination node is bigger.
Wherein, piTo be properly received the relay node of data block x and the collision probability of destination node.
Such sending method is avoided that same data block repeats to transmit, and not only reduces network redundancy in this way, and
The data block of back can be made to obtain impartial repeater-transmitter meeting.
One successful reception probability threshold value T is set, when the successful reception probability of data block is more than threshold value T, can be considered and work as
The preceding data block can be successfully forwarded to destination node, therefore not need to forward the data block to other relay nodes again.
If successful reception probability of the data block after this forwarding is more than or equal to threshold value T, sending node is by the number
It is deleted from transmission list according to block.In this way network redundancy can be reduced to avoid the spatial cache of waste node.
If successful reception probability of the data block after this forwarding is still less than threshold value T, data remain in slow
In depositing, next relay node is waited to be forwarded.
Continue to execute step 5.
5. judging whether connection has disconnected
If the connection of sending node and relay node does not disconnect, step 4 is executed, continues to forward next in transmission list
Data block entirely carries out data block forwarding in circulation by the way of sliding window.
If connection has disconnected, this end of transmission.
Detailed description of the invention
Fig. 1 is that node meets schematic diagram；
Fig. 2 is the work flow diagram of the ship networking block data transmission method based on probability of acceptance sliding window.
Specific embodiment
Variable-definition:
When node A carries the data that one is sent to node C and node B meets, node A is sending node, and node B is
Relay node, node C are purpose node.The communication radius of node A, B, C are respectively RA, RB, RC, d be node A and node B away from
From.
P(A,C)It is the collision probability of node A, C, is stored in the collision probability table of node A；P(B,C)It is the phase of node B, C
Probability is met, is stored in the collision probability table of node B.P(A,B)oldIt is the collision probability of node A, B, is stored in the phase of node A, B
It meets in probability tables.
The threshold value for being properly received probability is T, and the data block that node A is forwarded to node B for the first time is the xth of data to be forwarded
Block.
Below in conjunction with legend, the present invention is described in detail.
As shown in Figure 1, being considered as node A and B phase as the side lesser less than radius between two nodes of the distance between node
It meets, mathematic(al) representation is d≤MIN { RA,RB}。
As shown in Fig. 2, specific step is as follows for data forwarding of the invention:
1. sending node A meets with relay node B, connection, switched data transmission essential information are established
Node A, B establish connection after entering mutual communication context,
Store the collision probability with the node A node to meet in the collision probability table of node A, meeting for node B is general
Store the collision probability with the node B node to meet in rate table.Node A reads the P in the collision probability table of node B(B,
C), if P(B,C)It is not present, indicates that node B did not meet with destination node C, at this time by P(B,C)It is considered as 0.
Data transmission essential information includes: the collision probability P of node B Yu node C(B,C)And it is had been received in node B
Need to be transmitted to the data list of destination node.
Execute step 2.
2. recalculating collision probability between node, and update collision probability table
Node A, B are according to the P in the collision probability table of formula (1) and node(A,B)old, recalculate the phase between node A, B
Meet probability P(A,B), and update collision probability table.By the calculation formula of collision probability it is found that in regular time unit, node B with
The number that node C meets is more, P(B,C)Bigger, a possibility that data can be successfully forwarded destination node by node B, is bigger.
Continue to execute step 3.
3. judging whether relay node B meets forwarding condition
Forwarding condition is greater than sending node and destination node collision probability for the collision probability of relay node and destination node,
That is P(A,C)< P(B,C)。
If P(A,C)≥P(B,C), illustrate sending node A and probability that destination node C meets be more than or equal to relay node B with
The probability that destination node is met, relay node B do not meet forwarding condition, thus not to relay node forward data, node A not to
Node B transmits data, terminates this method.
If P(A,C)<P(B,C), the probability that sending node A and destination node C meet at this time is less than relay node B and purpose
The probability that node meets, a possibility that successfully forwarded message to destination node by relay node B, are bigger, meet forwarding item
Part executes step 4.
4. forwarding data, calculating the successful reception probability of the data block of this transmission and judging the successful reception of the data block
Whether probability is greater than threshold value T
Node A forwards it to node B from the data block x not having in taking-up node B in transmission list.
Different data blocks can be received when node B meets every time in this way, avoid the presence of repetition in the spatial cache of node B
Data block, while making the data block of other backs that there is the same chance being forwarded.
Completely received data block is known as sending successful data the data block or relay node that sending node is completely sent
Block.After data block x is successfully transmitted, node A recalculates the successful receptance P of data block x according to formula (3)x.Assuming that this turn
Hair is that data block x n-th is forwarded, and the collision probability of the first n-1 times relay node being forwarded to and destination node is respectively p1,
p2, p3... pn-1, the collision probability of node B and destination node is P(B,C), according to formula (3), after this forwarding, data
The successful reception probability of block x are as follows:
If Px>=T, the probability for illustrating that data block x is properly received after this forwarding by destination node has been more than success
Probability of acceptance threshold value, therefore the data block no longer is sent to other relay nodes, number is deleted from the transmission list of sending node A
According to block x.If Px< T, data remain in caching, and next relay node is waited to be forwarded.
Continue to execute step 5.
5. judging whether the connection between node A, B at this time has disconnected
It is not disconnected if connected at this time, thens follow the steps 4, sending node continues the forwarding of subsequent data chunk, node A
When taking out data block from transmission list, the data block x forwarded from last time circulation moves back one, forms sliding window
Data forwarding mode.
If current connection has disconnected, this end of transmission.
Claims (1)
1. the invention belongs to ship connected network communication technical field, the ship networking point based on probability of acceptance sliding window that is involved is a kind of
Block data transmission method, it is characterised in that include the following steps, if A is sending node, B is relay node, and C is purpose node:
(1) node A, B establish connection after meeting, switched data transmission essential information, including: node B meets with node C's
Probability P(B,C)And the data list for needing to be transmitted to node C has been received in node B；It executes step (2)；
(2) according to formula P(A, B)=P(A, B) old+[1-P(A, B) old]*Pinit, node A, the collision probability of B are recalculated, and store
Into collision probability table, wherein Pinit∈ [0,1] is an initialization constants, P(A,B)oldFor the history phase of node A and node B
Meet probability, P(A,B)It is this posterior nodal point A that meets, the collision probability between B；It executes step (3)；
(3) if P(B,C)>P(A,C), P(A,C)For the collision probability of node A and node C, execute step (4)；Otherwise not forwarding number
According to end this method；
(4) node A is sent to node B, and according to formula from the data block not having in B is taken out in transmission listCalculate successful reception probability P of the data block in destination node of this transmissionxIf PxMore than at
Function receptance threshold value T, node A delete the data block from transmission list；Otherwise, data remain in caching, wait
Next relay node is forwarded again；It executes step (5)；
(5) it if connection does not disconnect, executes step (4), continues to send data；If connection has disconnected, this end of transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910661544.5A CN110381469A (en) | 2019-07-22 | 2019-07-22 | Ship networking block data transmission method based on probability of acceptance sliding window |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910661544.5A CN110381469A (en) | 2019-07-22 | 2019-07-22 | Ship networking block data transmission method based on probability of acceptance sliding window |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110381469A true CN110381469A (en) | 2019-10-25 |
Family
ID=68254632
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910661544.5A Pending CN110381469A (en) | 2019-07-22 | 2019-07-22 | Ship networking block data transmission method based on probability of acceptance sliding window |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110381469A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265951A1 (en) * | 2007-12-17 | 2010-10-21 | Norihito Fujita | Routing method and node |
| CN103297343A (en) * | 2013-05-17 | 2013-09-11 | 华中科技大学 | Routing method based on delay tolerant network |
| CN107040464A (en) * | 2017-03-20 | 2017-08-11 | 华南师范大学 | Met the black hole nodal test method with forwarding information based on node in opportunistic network |
-
2019
- 2019-07-22 CN CN201910661544.5A patent/CN110381469A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265951A1 (en) * | 2007-12-17 | 2010-10-21 | Norihito Fujita | Routing method and node |
| CN103297343A (en) * | 2013-05-17 | 2013-09-11 | 华中科技大学 | Routing method based on delay tolerant network |
| CN107040464A (en) * | 2017-03-20 | 2017-08-11 | 华南师范大学 | Met the black hole nodal test method with forwarding information based on node in opportunistic network |
Non-Patent Citations (3)
| Title |
|---|
| ARSHAD ISLAM等: "《Reality-Check for DTN Routing Algorithms》", 《2008 THE 28TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS》 * |
| 吴大鹏等: "带有相遇预测的自适应路由机制", 《重庆邮电大学学报(自然科学版)》 * |
| 马慧等: "基于吞吐率的Prophet路由在DTN中的应用", 《计算机技术与发展》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guan et al. | Distance-vector-based opportunistic routing for underwater acoustic sensor networks | |
| KR20180089399A (en) | A method for adaptively and jointly managing the routing policy and retransmission policy of a node in an underwater network, and a means for implementing the method | |
| CN109104366B (en) | Link duration calculation method, MPR node selection method and routing protocol | |
| CN109041010B (en) | Vehicle-mounted delay tolerant network data forwarding method based on half-naive Bayes classifier | |
| Hu et al. | An adaptive and energy-efficient routing protocol based on machine learning for underwater delay tolerant networks | |
| JP4474527B2 (en) | Multihop wireless system configuration method and wireless node device | |
| CN103560966B (en) | Opportunistic network mixed logic dynamic method based on network code and duplication | |
| KR101286736B1 (en) | method of routing protocol based on AODV | |
| CN112235845B (en) | Geographic routing protocol method applied to underwater acoustic sensor network | |
| KR100982298B1 (en) | Adaptive Relay Node Selection Method for Alert Message Propagation in Inter-vehicle Communication | |
| CN111641990B (en) | Underwater acoustic sensor network transmission method with high data packet delivery rate and energy efficiency | |
| CN110381469A (en) | Ship networking block data transmission method based on probability of acceptance sliding window | |
| CN102711207B (en) | Route selection method used for transoccanic aeronautical communication | |
| Nakamura et al. | A method for improving data delivery efficiency in delay tolerant vanet with scheduled routes of cars | |
| Mohammed et al. | Improving the performance of counter-based broadcast scheme for mobile ad hoc networks | |
| KR101091647B1 (en) | Ad-hoc Self Organizing Time Division Multiple Access Medium Access Control protocol for Ship Ad-hoc NETwork | |
| KR20090056072A (en) | Emergency warning message broadcasting method using range-based relay node selecting method for vehicular ad-hoc network | |
| CN110418308A (en) | A kind of more copy ships networking Routing Protocol based on probability statistics | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| CN102932869B (en) | Distance and delay based method for effectively transmitting energy in mobile relay system | |
| Akshay et al. | Bandwidth optimized multicast routing algorithm based on hybrid mesh and tree structure with collision control in MANET using lempel-ziv-oberhumer method | |
| CN107124359B (en) | Method for ensuring stable routing of link based on 802.11 perception transmission quality and vehicle-mounted self-organizing network | |
| KR101360794B1 (en) | Time division multiple access control for long range underwater networks | |
| Oka et al. | Multihop data message transmission with inter-vehicle communication and store-carry-forward in sparse vehicle ad-hoc networks (VANET) | |
| Mohammed et al. | The adaptation of vehicle assisted data delivery protocol in IoV networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20191025 |