CN104349495B - A kind of underwater acoustic network multiple access method based on MACA U agreements - Google Patents
A kind of underwater acoustic network multiple access method based on MACA U agreements Download PDFInfo
- Publication number
- CN104349495B CN104349495B CN201310340479.9A CN201310340479A CN104349495B CN 104349495 B CN104349495 B CN 104349495B CN 201310340479 A CN201310340479 A CN 201310340479A CN 104349495 B CN104349495 B CN 104349495B
- Authority
- CN
- China
- Prior art keywords
- node
- cts
- msub
- mrow
- time
- 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
Abstract
The present invention relates to a kind of underwater acoustic network multiple access method based on MACA U agreements, including：In source node and the RTS CTS exchange process of destination node, if source node or destination node receive the RTS transmitted by another node, ensureing to have calculated source node on the premise of busy time does not conflict with source node or destination node or destination node is adapted to time for receiving the data frame transmitted by another node；Then to another node reverts back CTS, CTS include another node from receive should be silent after the CTS time that should wait and other nodes in addition to another node to before sending data frame receive this CTS time；Another node receives waited for a period of time according to CTS after CTS after send data frame.
Description
Technical field
The present invention relates to underwater acoustic network field, and in particular to a kind of underwater acoustic network multiple access access based on MACA-U agreements
（MAC）Method.
Background technology
Ocean is more and more important in the status of economic, social and military affairs etc., and there is an urgent need to improve marine information by people
Acquisition and disposal ability.The underwater acoustic network marine information technology emerging as one, in environmental monitoring, disaster alarm, ocean
The fields such as engineering, underwater defence have broad application prospects, therefore of interest by increasing researcher.Sound is underwater
Spread speed average out to 1500m/s, than spread speed 3x10 of the electromagnetic wave in radio channel8Low 5 orders of magnitude of m/s.Phase
The propagation delay answered is 0.67s/km, and communication distance often reaches several kilometers even more than ten kilometers, so height between network node
Propagation delay can seriously reduce the efficiency of underwater acoustic network information exchange.
Data link layer protocol is the important content of underwater acoustic network research.In random access protocol, ALOHA is most simple
, when node has data to send, data are sent immediately and wait ACK.Because ALOHA does not account for the state of channel, when
When load is higher, the performance of ALOHA agreements drastically declines.Carrier sense multiple accesses（CSMA）Agreement is attached by intercepting transmitting terminal
Near carrier wave carrys out collision free, but can not at receiving terminal collision free, therefore, there is concealed terminal and exposure in CSMA agreements
The problem of terminal.The multiple access access of collision free（MACA）Agreement is solved by exchanging RTS-CTS and asked existing for CSMA agreements
Topic.MACAW agreements propose on the basis of MACA agreements, the protocol enhancement reliability of network, but communication every time
After success, an ACK packet will be sent, can increase the expense of agreement in the high underwater acoustic network of propagation delay, reduce handling capacity.
MACA-U agreements are a kind of improved protocols proposed on the basis of MACA agreements, as shown in figure 1, MACA-U is assisted
View uses RTS-CTS-DATA three-way handshake mechanism.When source node S has packet to need to send, RTS control bags, mesh are first sent
Node D receive RTS after, respond immediately to CTS control bag.After source node S receives CTS, DATA is sent immediately.Destination node
After D receives DATA, terminate this handshake communication.If source node S does not receive corresponding CTS, source node S is entered using two
Exponential backoff algorithm processed（Binary Exponential Backoff, BEB）Keep out of the way and retransmit.Other neighbor nodes A, B are monitored
To after not being the packet to oneself, into QUITE states.The RTS-CTS handshake mechanisms of MACA-U agreements, which solve, to be hidden eventually
End and exposed terminal problem, reduce the collision of packet.But adhere to waiting rule and silence rule in MACA-U agreements
The strict transmission for limiting neighbors data, is unfavorable for the raising of network throughput.Meanwhile in RTS-CTS-DATA exchange process
The interior joint stand-by period is long, occupies the most of the time in communication process.
The content of the invention
It is an object of the invention to overcome underwater acoustic network communication means network throughput of the prior art not high, due to water
It is the defects of acoustic propagation delay makes Node latency long greatly, more so as to provide a kind of underwater acoustic network based on MACA-U agreements
Location cut-in method.
To achieve these goals, the invention provides a kind of underwater acoustic network multiple access access side based on MACA-U agreements
Method, including：
In source node and the RTS-CTS exchange process of destination node, if the source node or destination node receive it is another
RTS transmitted by node, then calculated on the premise of ensureing not conflict with the source node or the existing busy time of destination node
The source node or destination node are adapted to the time for receiving the data frame transmitted by another node；Then to another section
Point replys CTS, and the CTS includes another node from receiving CTS to the time that should wait before transmission data frame and remove
Other nodes outside another node answer the silent time after receiving this CTS；Another node is received after CTS according to CTS
Data frame is sent after waiting for a period of time.
In above-mentioned technical proposal, the realization of this method on the source node comprises the following steps：
Step 101）, source node S to destination node D send data before, send RTS first, calculate the busy of source node
Between TS1, and by TS1It is stored in local busy time table, and enters WFCTS states；
Wherein, the busy time T of source node SS1T at the time of referring to receive CTS since source node S1Sent to source node
T at the time of data frame2This period, for example following formula of its calculation formula（1）It is shown：
Wherein, ts_1At the time of being that source node S is ready for sending RTS, TRTS、TCTS、TDATARespectively RTS, CTS and data frame
Duration, τSDPropagation delay for source node S to destination node D, [] represent section；
Step 102）, when source node S is in WFCTS states, if receiving the RTS transmitted by a certain node A, ensure with
On the premise of the existing busy time of this node does not conflict, the time that source node S is adapted to data frame transmitted by receiving node A is calculated,
That is node A preengages the time of node A transmission packets to source node S, and then calculates egress A from CTS is received to transmission data
Delay τ between frameA；Wherein,
τSAPropagation delay for source node S to node A, ts_2At the time of the RTS of node A transmissions being received for source node S；
Step 103）, source node S reply CTS to node A, the CTS includes：Node A is sent after receiving CTS to the node
The time τ that should postpone before data frameA, and other nodes receive should be silent after this CTS time QUIET_CTS；Wherein,
QUIET_CTS=TCTS+TDATA+τSA×2+τA（5）
Step 104）, node A postpone τ after receiving CTSARetransmit data frame；
Step 105）, after other neighbor nodes around source node S in addition to node A receive CTS, during silent QUIET_CTS
Between, to ensure not disturbing source node S receiving node A data frame；
Realization of this method in destination node comprises the following steps：
Step 201）, when destination node D is in IDLE state, after the node receives RTS, calculate the busy of this node
Between TD1, and by TD1It is stored in local busy time table, replys CTS, and enter WFDATA states；
Wherein, TD1T at the time of referring to receive data frame since destination node D5To t at the time of having received data frame6It
Between period, its calculation formula is as follows：
Wherein, td_1At the time of being that destination node D receives RTS, τSDPropagation delay for source node S to destination node D；t3
=ts_2+TCTS+τSA×2+τA；
Step 202）, when destination node D is in WFDATA states, if receiving the RTS that node B issues destination node D,
On the premise of ensureing not conflict with the existing busy time of this node, calculate destination node D and be adapted to data transmitted by receiving node B
The time of frame, i.e. node B preengage the time that node B sends packet to destination node D, and then calculate egress B from receiving CTS
To the delay τ sent between data frameB；Wherein,
τDBPropagation delay for purpose node D to node B；
Step 203）, destination node D reply CTS to node B, the CTS includes：Node B arrives transmission data after receiving CTS
The time τ that should be waited before frameBSilent time QUIET_CTS is answered after receiving this CTS with other nodes；
QUIET_CTS=TCTS+TDATA+τDB×2+τB（10）
Step 204）, node B postpone τ after receiving CTSBRetransmit data frame；
Step 205）, after other neighbor nodes around destination node D in addition to node B receive CTS, silent QUIET_CTS
Time, to ensure not disturbing destination node D receiving nodes B data frame.
In above-mentioned technical proposal, in described step 104）In, if being in silent status before node A, sent receiving
After the CTS of oneself, terminate silent, delay τARetransmit data frame.
In above-mentioned technical proposal, in described step 204）In, if being in silent status before node B, sent receiving
After the CTS of oneself, terminate silent, delay τBRetransmit data frame.
The advantage of the invention is that：
In source node and the RTS-CTS exchange process of destination node, other nodes utilize source node and destination node
RTS-CTS propagation delay completes to be exchanged with the RTS-CTS of source node or destination node, and pre- to source node or destination node
About send DATA time.Complete the data communication between multiple nodes simultaneously in the same period, this not only makes full use of
The free time of channel, also inhibits just communication node other neighbor nodes interference, avoid the conflict of packet.
Brief description of the drawings
Fig. 1 is the timing diagram of MACA-U agreements of the prior art；
Fig. 2 is the timing diagram involved by the inventive method；
The schematic diagram of network topology structure involved when being emulation Fig. 3；
Fig. 4 be the present invention method and MACA-U agreements of the prior art data packet length be 512bits,
The comparison schematic diagram of load-handling capacity under 1024bits and 2048bits；
Fig. 5 be the present invention method and MACA-U agreements of the prior art data packet length be 512bits,
The comparison schematic diagram of load-average delay under 1024bits and 2048bits；
Fig. 6 be the present invention method and MACA-U agreements of the prior art data packet length be 512bits,
The comparison schematic diagram of load-protocol overhead under 1024bits and 2048bits；
Fig. 7 be the inventive method with MACA-U agreements of the prior art traffic rate be 1024bps, 2048bps and
The comparison schematic diagram of load-handling capacity under 4096bps；
Fig. 8 be the inventive method with MACA-U agreements of the prior art traffic rate be 1024bps, 2048bps and
The comparison schematic diagram of load-average delay under 4096bps；
Fig. 9 be the inventive method with MACA-U agreements of the prior art traffic rate be 1024bps, 2048bps and
The comparison schematic diagram of load-protocol overhead under 4096bps；
Figure 10 be the inventive method with MACA-U agreements of the prior art average meshes spacing be 1000m, 2000m and
The comparison schematic diagram of load-handling capacity under 4000m；
Figure 11 be the inventive method with MACA-U agreements of the prior art average meshes spacing be 1000m, 2000m and
The comparison schematic diagram of load-average delay under 4000m；
Figure 12 be the inventive method with MACA-U agreements of the prior art average meshes spacing be 1000m, 2000m and
The comparison schematic diagram of load-protocol overhead under 4000m.
Embodiment
In conjunction with accompanying drawing, the invention will be further described.
With reference to figure 2, in a communication process of underwater acoustic network, include source node S, destination node D and other sections
Point A and B.Each node in underwater acoustic network preserves a local busy time table, the busy time of this node is store in the table, i.e.,
Busy start time and busy finish time, the busy time refer to that node is ready for sending or time during received data packet, will be each
The busy time of node is stored in local busy time table in advance can prevent to receive multiple packets of different nodes simultaneously, so as to
Cause data packet collisions.The data format of the local busy time table is as shown in table 1：
The local busy time table of table 1
| Busy start time | Busy finish time |
By taking these nodes in underwater acoustic network as an example, the method for the present invention is elaborated.
The communication that the method for the present invention can be used between source node and other nodes, can be used for destination node and other
Communication between node.
The realization of the method for the present invention on the source node comprises the following steps：
Step 101）, source node S to destination node D send data before, send RTS first, calculate the busy of source node
Between TS1, and by TS1It is stored in local busy time table, and enters WFCTS states.
Wherein, the busy time T of source node SS1T at the time of referring to receive CTS since source node S1Sent to source node
T at the time of DATA2This period, its calculation formula is as shown in following formula 1：
Wherein, ts_1At the time of being that source node S is ready for sending RTS, TRTS、TCTS、TDATARespectively RTS, CTS and DATA
Duration, τSDPropagation delay for source node S to destination node D, [] represent section.
Step 102）, when source node S is in WFCTS states, if receiving the RTS transmitted by a certain node A, ensure with
On the premise of the existing busy time of this node does not conflict, the time that source node S is adapted to data frame transmitted by receiving node A is calculated,
That is node A preengages the time of node A transmission packets to source node S, and then calculates egress A from CTS is received to transmission DATA
Between delay τA。
Source node S is in WFCTS states, if in ts_2Moment receives the RTS that node A issues source node S, then source node S
Busy time T for the data frame transmitted by receiving node AA1It can be calculated according to equation below：
Wherein, τSAPropagation delay for source node S to node A, τAArrived after receiving CTS for node A between transmission DATA
Delay.
To avoid the data frame that node A is sent（DATA）Conflict with the busy time of source node S, it is necessary to meet formula（3）'s
Condition：
TS1∩TS2∩......∩TA1=φ（3）
Wherein, TS1、TS2... it is the existing busy time of source node S.
By above-mentioned formula（2）With（3）τ can be calculatedA, such as formula（4）It is shown,
Step 103）, source node S reply CTS to node A, the CTS includes：Node A is sent after receiving CTS to the node
The time τ that should postpone before DATAA, and other nodes receive should be silent after this CTS time QUIET_CTS.
QUIET_CTS=TCTS+TDATA+τSA×2+τA（5）
Step 104）, node A postpone τ after receiving CTSARetransmit DATA.
If node A receives in silent status is sent to the CTS of oneself, terminate silent, delay τARetransmit DATA.
Step 105）, after other neighbor nodes around source node S in addition to node A receive CTS, during silent QUIET_CTS
Between, to ensure not disturbing source node S receiving node A DATA.
It can be seen from the above description that in source node S and destination node D RTS-CTS exchange process, node A is utilized
Source node S and destination node D RTS-CTS propagation delay complete to be exchanged with the RTS-CTS of source node S, and to source node S
It is subscribed to the time that node A sends DATA.Source node S completes the number with destination node D and node A simultaneously in the same period
According to communication, this not only makes full use of the free time of channel, also inhibits other neighbor nodes interference source node S of source node S
Receiving node A packet, avoid the conflict of packet.
Realization of the method for the present invention in destination node comprises the following steps：
Step 201）, when destination node D is in IDLE state, after the node receives RTS, calculate the busy of this node
Between TD1, and by TD1It is stored in local busy time table, replys CTS, and enter WFDATA states.
Wherein, TD1T at the time of referring to receive DATA since destination node D5To t at the time of having received DATA6Between
Period, its calculation formula are as follows：
Wherein, td_1At the time of being that destination node D receives RTS, τSDPropagation delay for source node S to destination node D.
Step 202）, when destination node D is in WFDATA states, if receiving the RTS that node B issues destination node D,
On the premise of ensureing not conflict with the existing busy time of this node, calculate destination node D and be adapted to data transmitted by receiving node B
The time of frame, i.e. node B preengage the time that node B sends packet to destination node D, and then calculate egress B from receiving CTS
To the delay τ sent between DATAB。
When destination node D is in WFDATA states, if in td_1Moment receives the RTS that node B issues destination node D, then
Destination node D is used for the busy time T of the data frame transmitted by receiving node BB1It can be calculated according to equation below：
Wherein, τDBPropagation delay for purpose node D to node B, τBArrived after receiving CTS for node B between transmission DATA
Delay.
To avoid the data frame that node B is sent（DATA）Conflict with destination node D busy time, it is necessary to meet formula（8）
Condition：
TD1∩TD2∩......∩TB1=φ（8）
Wherein, TD1、TD2... it is the existing busy times of node D.
It is possible thereby to calculate τB, such as formula（9）It is shown,
Step 203）, destination node D reply CTS to node B, the CTS includes：Node B arrives transmission DATA after receiving CTS
The time τ that should be waited beforeBSilent time QUIET_CTS is answered after receiving this CTS with other nodes.
QUIET_CTS=TCTS+TDATA+τDB×2+τB（10）
Step 204）, node B postpone τ after receiving CTSBRetransmit DATA（τ in Fig. 2BFor 0）.
If node B is in silent status, after receiving and being sent to the CTS of oneself, terminates silent, postpone τBRetransmit
DATA。
Step 205）, after other neighbor nodes around destination node D in addition to node B receive CTS, silent QUIET_CTS
Time, to ensure not disturbing destination node D receiving nodes B DATA.
It can be seen from the above description that in source node S and destination node D RTS-CTS exchange process, node B is utilized
Source node S and destination node D RTS-CTS propagation delay complete to be exchanged with destination node D RTS-CTS, and to purpose
Node D is subscribed to the time that node B sends DATA.Destination node D is completed and source node S and node simultaneously in the same period
B data communication, this not only makes full use of the free time of channel, also inhibits destination node D other neighbor nodes interference
Destination node D receiving nodes B packet, avoids the conflict of packet.
In the MACA-U agreements of prior art, destination node D enters silence in WFCTS states if xCTS is received,
No longer the RTS or CTS of oneself are issued in response.And in the present invention, the node in silent status, which receives, issues the CTS of oneself
Afterwards, silent, delay τ is terminatedBRetransmit DATA.This is advantageous to improve communication efficiency, reduces call duration time.
The advantages of in order to embody the inventive method, simulation analysis are carried out using NS2 below.Emulate the network topology knot used
Structure is as shown in figure 3,36 static nodes（Dark node）Form 6x6 square profile.Node is not accurately located at grid
Crosspoint on, but the random offset of 10% grid spacing is introduced with vertical direction in the horizontal direction.The maximum communication of node
Distance is 1.75 times of grid spacing, and so, each node has 8 one to jump neighbors and 16 double bounce neighbors.In emulation,
36 nodes produce packet by Poisson distribution, and the speed for producing packet is identical.Each packet is equal caused by node
Its any double bounce neighbors is sent to, and the probability that each packet is sent to 16 double bounce neighbors is identical.It is in order that borderline
Node also has 16 double bounce neighbors, it is necessary to be extended to border, i.e., two-layer node is all extended on four direction（Grey section
Point）, but these extra nodes will not produce data flow, the only destination node and forward node as boundary node is present.
Emulation uses static routing, and a node is only represented in figure（Circular node）Static routing, the route of remaining node is therewith
It is similar.
The velocity of sound takes 1500m/s.Control frame RTS and CTS length take 72bits.Keep out of the way window minimum and maximum point
2 and 64 are not taken.Herein respectively to the DR-MACA under different pieces of information packet length, different communication speed and different grid spacing and
MACA_U load-handling capacity, load-average delay and load-protocol overhead carries out emulation comparison.The whole network load, handling capacity,
Shown in average delay and protocol overhead are defined as follows,
To the inventive method and MACA-U agreements of the prior art data packet length be 512bits, 1024bits and
Handling capacity, average delay and protocol overhead under 2048bits are emulated, as a result respectively as shown in Figure 4, Figure 5 and Figure 6.It is imitative
Very middle traffic rate is 2048bps, and average meshes spacing is 2000m.It can be seen that as data packet length increases,
Single communication efficiency increase of the agreement after shaking hands successfully, the handling capacity of two methods are all improved.When loading relatively low, with
Data packet length increase, the average delay and protocol overhead of two methods all reduce.When loading higher, the competition ratio of channel
Fiercer, as data packet length increases, the probability of conflict improves, and the average delay and protocol overhead of two methods all increase.
Meanwhile under identical data packet length, the handling capacity of the inventive method is higher than MACA-U agreements of the prior art, and of the invention
The average delay and protocol overhead of method are below MACA-U agreements of the prior art.
To the inventive method and MACA-U agreements of the prior art traffic rate be 1024bps, 2048bps and
Handling capacity, average delay and protocol overhead under 4096bps are emulated, as a result respectively as shown in Figure 7, Figure 8 and Figure 9.It is imitative
Very middle data packet length is 1024bits, and average meshes spacing is 2000m.It can be seen that as traffic rate increases,
The transmission time of packet is reduced, and propagation delay does not reduce correspondingly, and communication efficiency reduces, and the handling capacity of two methods all can
Reduce.When loading relatively low, as traffic rate increases, the average delay and protocol overhead of two methods all increase.Loading
When higher, the competition of channel is fiercer, and as traffic rate increases, the duration of control frame and packet reduces, conflict
Probability reduce, the average delay and protocol overhead of two methods all reduce.Meanwhile under same communication speed, present invention side
The handling capacity of method is higher than MACA-U agreements of the prior art, and the average delay and protocol overhead of the inventive method are below existing
MACA-U agreements in technology.
To the inventive method and MACA-U agreements of the prior art average meshes spacing be 1000m, 2000m and
Handling capacity, average delay and protocol overhead under 4000m are emulated, as a result respectively as shown in Figure 10, Figure 11 and Figure 12.It is imitative
Very middle data packet length is 1024bits, traffic rate 2048bps.It can be seen that as average meshes spacing increases
Greatly, propagation delay increases, and RTS-CTS shakes hands time lengthening, and communication efficiency reduces, and the handling capacity of two methods can all reduce, and
The average delay of two methods can all increase.When loading relatively low, as average meshes spacing increases, propagation delay increase, punching
Prominent probability increase, the protocol overhead of two methods all increase.When loading higher, as average meshes spacing increases, handle up
Amount reduces, and the protocol overhead of two methods all reduces.Meanwhile under identical average meshes spacing, the handling capacity of the inventive method
Higher than MACA-U agreements of the prior art, the average delay and protocol overhead of the inventive method are below of the prior art
MACA-U agreements.
It should be noted last that the above embodiments are merely illustrative of the technical solutions of the present invention and it is unrestricted.Although ginseng
The present invention is described in detail according to embodiment, it will be understood by those within the art that, to the technical side of the present invention
Case is modified or equivalent substitution, and without departure from the spirit and scope of technical solution of the present invention, it all should cover in the present invention
Right among.
Claims (3)
1. a kind of underwater acoustic network multiple access method based on MACA-U agreements, including：
In source node and the RTS-CTS exchange process of destination node, if the source node or destination node receive another node
Transmitted RTS, then calculated on the premise of ensureing not conflict with the source node or the existing busy time of destination node described
Source node or destination node are adapted to the time for receiving the data frame transmitted by another node；Then returned to another node
Multiple CTS, the CTS include another node from CTS is received to the time that should be waited before transmission data frame and except described
Other nodes outside another node answer the silent time after receiving this CTS；Another node waits after receiving CTS according to CTS
Data frame is sent after a period of time；
The realization of this method on the source node comprises the following steps：
Step 101), source node S send RTS, calculate the busy time T of source node first before data are sent to destination node DS1,
And by TS1It is stored in local busy time table, and enters WFCTS states；
Wherein, the busy time T of source node SS1T at the time of referring to receive CTS since source node S1Data have been sent to source node
T at the time of frame2This period, shown in for example following formula of its calculation formula (1)：
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>s</mi>
<mo>_</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>T</mi>
<mrow>
<mi>R</mi>
<mi>T</mi>
<mi>S</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&tau;</mi>
<mrow>
<mi>S</mi>
<mi>D</mi>
</mrow>
</msub>
<mo>&times;</mo>
<mn>2</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<msub>
<mi>t</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<msub>
<mi>T</mi>
<mrow>
<mi>C</mi>
<mi>T</mi>
<mi>S</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>T</mi>
<mrow>
<mi>D</mi>
<mi>A</mi>
<mi>T</mi>
<mi>A</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>T</mi>
<mrow>
<mi>S</mi>
<mn>1</mn>
</mrow>
</msub>
<mo>=</mo>
<mo>&lsqb;</mo>
<msub>
<mi>t</mi>
<mn>1</mn>
</msub>
<mo>,</mo>
<msub>
<mi>t</mi>
<mn>2</mn>
</msub>
<mo>&rsqb;</mo>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, ts_1At the time of being that source node S is ready for sending RTS, TRTS、TCTS、TDATARespectively RTS, CTS and data frame continues
Time, τSDPropagation delay for source node S to destination node D, [] represent section；
Step 102), when source node S is in WFCTS states, if the RTS transmitted by a certain node A is received, in guarantee and this section
On the premise of the existing busy time of point does not conflict, the time that source node S is adapted to data frame transmitted by receiving node A is calculated, that is, is saved
Point A preengages the time that node A sends packet to source node S, so calculate egress A from receive CTS to send data frame it
Between delay τA；Wherein,
τSAPropagation delay for source node S to node A, ts_2At the time of the RTS of node A transmissions being received for source node S；
Step 103), source node S reply CTS to node A, and the CTS includes：Node A arrives node transmission data after receiving CTS
The time τ that should postpone before frameA, and other nodes receive should be silent after this CTS time QUIET_CTS；Wherein,
QUIET_CTS=TCTS+TDATA+τSA×2+τA (5)
Step 104), node A postpone τ after receiving CTSARetransmit data frame；
After other neighbor nodes around step 105), source node S in addition to node A receive CTS, the silent QUIET_CTS times, with
Source node S receiving node A data frame is not disturbed in guarantee；
Realization of this method in destination node comprises the following steps：
Step 201), when destination node D is in IDLE state, after the node receives RTS, calculate the busy time of this node
TD1, and by TD1It is stored in local busy time table, replys CTS, and enter WFDATA states；
Wherein, TD1T at the time of referring to receive data frame since destination node D5To t at the time of having received data frame6Between when
Between section, its calculation formula is as follows：
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mn>5</mn>
</msub>
<mo>=</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>d</mi>
<mo>_</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>T</mi>
<mrow>
<mi>C</mi>
<mi>T</mi>
<mi>S</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&tau;</mi>
<mrow>
<mi>S</mi>
<mi>D</mi>
</mrow>
</msub>
<mo>&times;</mo>
<mn>2</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mn>6</mn>
</msub>
<mo>=</mo>
<msub>
<mi>t</mi>
<mn>3</mn>
</msub>
<mo>+</mo>
<msub>
<mi>T</mi>
<mrow>
<mi>D</mi>
<mi>A</mi>
<mi>T</mi>
<mi>A</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>T</mi>
<mrow>
<mi>D</mi>
<mn>1</mn>
</mrow>
</msub>
<mo>=</mo>
<mo>&lsqb;</mo>
<msub>
<mi>t</mi>
<mn>5</mn>
</msub>
<mo>,</mo>
<msub>
<mi>t</mi>
<mn>6</mn>
</msub>
<mo>&rsqb;</mo>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>6</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, td_1At the time of being that destination node D receives RTS, τSDPropagation delay for source node S to destination node D；t3=ts_2
+TCTS+τSA×2+τA；
Step 202), when destination node D is in WFDATA states, if receiving the RTS that node B issues destination node D, protecting
On the premise of card does not conflict with the existing busy time of this node, calculate destination node D and be adapted to data frame transmitted by receiving node B
Time, i.e. node B preengage the time of node B transmission packets to destination node D, and then calculate egress B from CTS is received to hair
Send the delay τ between data frameB；Wherein,
τDBPropagation delay for purpose node D to node B；
Step 203), destination node D reply CTS to node B, and the CTS includes：Node B receive after CTS to send data frame it
Before the time τ that should waitBSilent time QUIET_CTS is answered after receiving this CTS with other nodes；
QUIET_CTS=TCTS+TDATA+τDB×2+τB (10)
Step 204), node B postpone τ after receiving CTSBRetransmit data frame；
After other neighbor nodes around step 205), destination node D in addition to node B receive CTS, the silent QUIET_CTS times,
To ensure not disturbing destination node D receiving nodes B data frame.
2. the underwater acoustic network multiple access method according to claim 1 based on MACA-U agreements, it is characterised in that in institute
In the step 104) stated, if node A is in silent status, after receiving and being sent to the CTS of oneself, terminates silent, postpone τAAgain
Send data frame.
3. the underwater acoustic network multiple access method according to claim 1 based on MACA-U agreements, it is characterised in that in institute
In the step 204) stated, if node B is in silent status, after receiving and being sent to the CTS of oneself, terminates silent, postpone τBAgain
Send data frame.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310340479.9A CN104349495B (en) | 2013-08-07 | 2013-08-07 | A kind of underwater acoustic network multiple access method based on MACA U agreements |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310340479.9A CN104349495B (en) | 2013-08-07 | 2013-08-07 | A kind of underwater acoustic network multiple access method based on MACA U agreements |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104349495A CN104349495A (en) | 2015-02-11 |
| CN104349495B true CN104349495B (en) | 2017-12-29 |
Family
ID=52504035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310340479.9A Active CN104349495B (en) | 2013-08-07 | 2013-08-07 | A kind of underwater acoustic network multiple access method based on MACA U agreements |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104349495B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106961740B (en) * | 2017-03-09 | 2019-11-26 | 上海海事大学 | A kind of water sound sensor network data transmission method based on pre-scheduling pipeline system |
| CN108184250B (en) * | 2017-12-01 | 2021-04-06 | 浙江大学 | Table-machine-mechanism-based underwater acoustic node exposed terminal solution method utilizing propagation delay |
| CN109688554B (en) * | 2018-12-27 | 2020-07-14 | 中国科学院深海科学与工程研究所 | Underwater sound media access control method based on reservation scheduling mechanism |
| CN110049572B (en) * | 2019-04-11 | 2022-04-12 | 池州学院 | Delay perception transmission scheduling method for underwater acoustic communication wireless self-organizing network |
| CN110049453B (en) * | 2019-05-30 | 2021-07-09 | 磐基技术有限公司 | Transmission waiting interval setting method of communication equipment |
| CN110691371B (en) * | 2019-09-10 | 2021-05-14 | 华南理工大学 | MAC (media Access control) scheduling method of mesh underwater acoustic network |
| CN111404617B (en) * | 2020-03-19 | 2021-09-24 | 海底鹰深海科技股份有限公司 | Communication method applied to underwater acoustic communication network |
| CN114172591B (en) * | 2021-11-15 | 2023-09-05 | 中国船舶重工集团公司第七一五研究所 | Efficient concurrent transmission method for multi-body underwater acoustic communication network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050066275A (en) * | 2003-12-26 | 2005-06-30 | 한국전자통신연구원 | Access method between mobile terminals in mobile ad hoc network and mobile terminal therefor |
| WO2007063521A2 (en) * | 2005-12-02 | 2007-06-07 | Koninklijke Philips Electronics N.V. | Wireless systems and methods including cooperative communication medium access control |
| CN102195763A (en) * | 2011-05-10 | 2011-09-21 | 东南大学 | Method for realizing MAC (Media Access Control) protocol under long delay condition of underwater sound sensor network |
| CN102355739A (en) * | 2011-06-30 | 2012-02-15 | 华中科技大学 | Wireless sensor network channel access method on basis of acoustic communication |
-
2013
- 2013-08-07 CN CN201310340479.9A patent/CN104349495B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050066275A (en) * | 2003-12-26 | 2005-06-30 | 한국전자통신연구원 | Access method between mobile terminals in mobile ad hoc network and mobile terminal therefor |
| WO2007063521A2 (en) * | 2005-12-02 | 2007-06-07 | Koninklijke Philips Electronics N.V. | Wireless systems and methods including cooperative communication medium access control |
| CN102195763A (en) * | 2011-05-10 | 2011-09-21 | 东南大学 | Method for realizing MAC (Media Access Control) protocol under long delay condition of underwater sound sensor network |
| CN102355739A (en) * | 2011-06-30 | 2012-02-15 | 华中科技大学 | Wireless sensor network channel access method on basis of acoustic communication |
Non-Patent Citations (1)
| Title |
|---|
| SRCR: A Novel MAC Protocol for Underwater Acoustic Networks with Concurrent Reservation;Jin Yang, Peng Guo, Tao Jiang, Kui Zhang;《2012 IEEE International Conference on Communications》;20120615;第436页第2栏第2段-第437页第2栏第2段，图3 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104349495A (en) | 2015-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104349495B (en) | A kind of underwater acoustic network multiple access method based on MACA U agreements | |
| Zhai et al. | Performance analysis of IEEE 802.11 MAC protocols in wireless LANs | |
| CN102647805B (en) | Wireless sensor network transmission method based on medium access control (MAC) protocol | |
| CN105245358B (en) | Intelligent grid MAC layer multi-service method for analyzing performance based on Markov model | |
| CN104936303B (en) | A kind of method that carrier sense thresholding jointly controls with competition window | |
| CN103929284B (en) | High-reliability transmission method for wireless sensor network | |
| CN102098113A (en) | Method for realizing water sound sensor network MAC (Media Access Control) protocol based on ALOHA and TDMA (Time Division Multiple Access) | |
| CN105592564A (en) | Self-adaptive access mechanism based on active node estimation in wireless Mesh network | |
| CN102202348B (en) | Data packet sending method and access point | |
| CN104219017B (en) | A kind of physical layer data package transmission method and access node | |
| CN103561431B (en) | A kind of link estimation of available bandwidth method being applicable to concurrently access ad hoc network | |
| CN104348560B (en) | The node based on UW CSMA/CA is mourned in silence method in underwater acoustic network communication | |
| CN104660524B (en) | The channel access control method of a kind of power line communication network and system | |
| Prakash et al. | Throughput analysis of IEEE 802.11 e EDCA under non saturation condition | |
| CN105101451B (en) | The adaptive certainty back-off method and system of MAC layer in wireless distributed network | |
| Rao et al. | Performance evaluation of 802.11 broadcasts for a single cell network with unsaturated nodes | |
| CN104486348B (en) | Consider the underwater acoustic channel network media connection control method of node traffic flow | |
| Jacquet et al. | Using a token approach for the MAC layer of linear sensor networks: Impact of the node position on the packet delivery | |
| Nefzi et al. | CoSenS: A collecting and sending burst scheme for performance improvement of IEEE 802.15. 4 | |
| Zhu et al. | Performance improvement for IEEE 802.15. 4 CSMA/CA scheme in large‐scale wireless multi‐hop sensor networks | |
| CN104348562B (en) | Multiple access method based on UW-CSMA/CA in the communication of a kind of underwater acoustic network | |
| Carrillo et al. | On the impact of network coding delay for IEEE 802.11 s infrastructure wireless mesh networks | |
| Coelho | Underwater acoustic networks: evaluation of the impact of media access control on latency, in a delay constrained network | |
| Yan et al. | The research on two different backoff algorithms in IEEE 802.11 p mac layer | |
| Liu et al. | A novel internal collision managing mechanism of IEEE 802.11 e EDCA |
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 |