CN108632911A - Adaptive conflict avoidance real-time media access control method based on overall scheduling - Google Patents
Adaptive conflict avoidance real-time media access control method based on overall scheduling Download PDFInfo
- Publication number
- CN108632911A CN108632911A CN201810327852.XA CN201810327852A CN108632911A CN 108632911 A CN108632911 A CN 108632911A CN 201810327852 A CN201810327852 A CN 201810327852A CN 108632911 A CN108632911 A CN 108632911A
- Authority
- CN
- China
- Prior art keywords
- node
- time
- sending
- packet
- packets
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 230000003044 adaptive effect Effects 0.000 title claims abstract description 16
- 230000005540 biological transmission Effects 0.000 claims abstract description 52
- 238000004891 communication Methods 0.000 claims abstract description 24
- 238000010276 construction Methods 0.000 claims description 4
- 238000005457 optimization Methods 0.000 claims description 3
- 241001269238 Data Species 0.000 claims description 2
- 238000000205 computational method Methods 0.000 claims description 2
- 210000004209 hair Anatomy 0.000 claims description 2
- 230000002123 temporal effect Effects 0.000 claims description 2
- 241000208340 Araliaceae Species 0.000 claims 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 claims 1
- 235000003140 Panax quinquefolius Nutrition 0.000 claims 1
- 235000008434 ginseng Nutrition 0.000 claims 1
- 108700026140 MAC combination Proteins 0.000 description 4
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 2
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B11/00—Transmission systems employing sonic, ultrasonic or infrasonic waves
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B13/00—Transmission systems characterised by the medium used for transmission, not provided for in groups H04B3/00 - H04B11/00
- H04B13/02—Transmission systems in which the medium consists of the earth or a large mass of water thereon, e.g. earth telegraphy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/04—Scheduled access
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of adaptive conflict avoidance real-time media access control method based on overall scheduling, inventive process have the advantage that when transmitting every time, real-time update record is carried out to the state of each sending node in network, it is sent to receiving node, after receiving node receives the status data of each sending node, these data are handled according to improved M LWDF algorithms, it is few using time delay, the principles such as fairness carry out overall scheduling to all sending nodes, feed back to sending node after arranging the sending time of each sending node properly.In this process, the time that node is shaken hands is reduced, reduces node transmission data conflict, it is also considered that the fairness to node transmission data improves the handling capacity of network to reduce network average delay, greatly improves underwater sound communication network performance.
Description
Technical field
The invention belongs to field of underwater acoustic communication, are related to a kind of adaptive conflict avoidance real-time media visit based on overall scheduling
Ask control method.
Background technology
Complexity due to underwater acoustic channel and variability, underwater sound communication have the characteristics that quick time-varying and long delay so that
Reliable underwater sound communication network becomes a challenge in real time for design one.In traditional underwater sound communication network mac-layer protocol, section
Point access channel mainly uses handshake mechanism and random competition mechanism, first, before wishing transmission data, in order to reduce between node
The conflict of transmission data needs to establish handshake mechanism before each communication, occupies channel time significantly, reduce channel usage
Rate；Secondly, the fairness that the real-time dynamic and access of node are not accounted for when node access channel, can cause to a certain extent
Network delay and obstruction cannot be satisfied the requirement of service quality (Quality of Service, Qos)；Finally, each node is all
In working condition, system power dissipation is larger.
Invention content
In view of the above-mentioned deficiencies in the prior art, it is an object of the present invention to propose that a kind of adaptive conflict based on overall scheduling is kept away
Exempt from real-time media access control method, rationally design the mechanism of node transmission data, in conjunction with the real-time dynamic of node, based on access
The principles such as fairness are shaken hands time of occupancy before reducing transmission data in the case where ensureing that node does not conflict, realize low time delay,
The underwater sound communication network of high-throughput meets the requirement of Qos.Mechanism based on overall scheduling rather than random competition mechanism, not only
It reduces node to shake hands the time, and the fairness of the real-time dynamic of node and nodes access is added to the design of agreement
In, it substantially increases node and shakes hands efficiency, increase network throughput, realize the underwater sound communication network of low time delay, high-throughput.
The purpose of the present invention is achieved through the following technical solutions：It is a kind of based on overall scheduling it is adaptive conflict keep away
Exempt from real-time media access control method, this approach includes the following steps：
(1) all sending nodes in underwater sound communication network all send initial transmission packet (initial transmission
Packet, ITP) receiving node is given, packet includes the number W of the packets to be transmitted such as i-th of sending node jth wheeli,jWith current hair
Send the momentAfter receiving node receives these ITP packets, the time of reception for receiving packet is recordedAccording to Wi,j、
WithEstablish overall scheduling table；
(2) after receiving node receives the information of all sending nodes, according to the information in overall scheduling table, by optimizing
Increase by i-th of node in preferential (modified largest weighted delay fist, the M-LWDF) algorithm of weights time delay
The packet number that is lined up be lined up ratio shared in packet number in all sending nodes, obtain the transmission priority of each sending node,
Sending node is ranked up according to these priority；It is sequentially calculated to the sending node after sequence later and sends number
According to when need time of busy channel, to obtain stand-by period Δ τs of the sending node i before jth wheel transmission datai,j；Then by this
In stand-by period storage to next round transmission data timetable before a little transmission datas, packet (Global is replied by overall scheduling
Scheduling ACKnowlegement, GSACK) it is sent to all sending nodes；
(3) after sending node receives GSACK packets, the transmission data timetable in GSACK packets finds oneself and corresponds to
Stand-by period, keep out of the way and wait for Δ τi,jRetransmit DATA packets after time, while by the number W of the packet to be transmitted such as next roundi,j
With the currently transmitted momentIt stores in DATA packets packet header；
(4) after receiving node receives the DATA packets that all sending nodes are sent, the letter in overall scheduling table is stored first
Breath calculates all sending nodes according to improved M-LDWF algorithms send priority later, while will not be properly received
Sending node to DATA packets carries out re-transmission label, in order to notify retransmit DATA packets node next time, according to transmission priority
Information and node transmission data need the temporal information of busy channel further to establish next round transmission data timetable, will store
There are the GSACK packets of next round transmission data table information to be sent to all sending nodes.
Further, the specific construction method of overall scheduling table is as follows in the step (1)：
Overall scheduling table includes the sending node i in serial number i, jth wheel and jth -1 the wheel communication of each sending node
Etc. packet number W to be transmittedi,jAnd Wi,j-1, delivery timeWithAnd the time of receptionWithEach sending node
ITP packets all are sent to receiving node, packet includes Wi,jWithReceiving node receives the ITP packets of i-th of sending node transmission
Later, it records and is denoted as at the time of ITP packets will be receivedLater by Wi,j、It stores in overall scheduling table,
ITP packets until having received all sending nodes；Overall scheduling table is specific as follows：
1 overall scheduling table of table
Further, the M-LWDF algorithms optimized in the step (2) are as follows：
M-LWDF algorithms are that one kind being based on the optimization limited overall scheduling algorithm of weights time delay, can endure underwater channel sound
The long delay characteristics of propagation；It can be weighed between instantaneous channel quality (such as propagation delay) and the queuing delay of packet
Weighing apparatus, calculates the priority of each node, the priority computational methods of i-th of node are as follows：
Wherein, i indicates node i；J indicates the scheduling of jth wheel；The priority of P expression parameters；δ indicates maximum packet loss
Qos parameters；R indicates that maximum data rate is related with channel quality；λ is the estimation of average throughput, for ensureing the justice of communication
Property；D indicates the waiting time delay in packet header；T indicates maximum tolerance time delay；
In view of for each sending node, the number of upcoming packet is fluctuation, we increase one
Parameter Vi[j] is lined up ratio shared in packet number to assess the packet number that is lined up of i-th of node in all sending nodes, to ensure
The fairness of node；Vi[j] is represented by：
Si[j] refers to the packet number that i-th of node jth wheel is lined up, including the packet number W waited in upper wheeli,j-1In addition prediction
Upcoming packet number, N be sending node sum, therefore optimize M-LWDF algorithms be represented by：
Further, stand-by period Δ τs of the sending node i before jth wheel transmission data in the step (3)i,jCalculating
Method is as follows：
(a) when j=1, i.e., when the first round, due to being random access, Δ τi,jAs random back when
Between；
(b)j>When 1, Δ τi,jIn priority query P, to come the Δ τ of the node a before i-th of nodea,jIn addition jth -1
The propagation delay of wheel interior joint a (is t at the time of receiving node receives packetDa,j-1At the time of subtracting sending node transmission packet) packet length L is subtracted, asAnd come the node b of head of the queue
τ is the maximum propagation time delay of all sending nodes, to ensure to retransmit DATA packets after all nodes all receive GSACK, is protected
Demonstrate,prove time synchronization.
Further, the specific construction method of next round transmission data timetable is as follows：
Next round transmission data timetable includes that sending node serial number i, jth wheel need the time Δ τ that waits fori,jAnd it is
No re-transmission marks ai；aiIt indicates whether node i needs to retransmit, needs to be denoted as 1 when retransmitting, indicate that receiving node fails reception
It to the packet of the sending node, needs to retransmit the packet, is otherwise denoted as 0, indicate that receiving node is successfully received the sending node
Packet, need not retransmit；When receiving node calculates the priority of all sending nodes, it is assumed that priority query is Q [i] (i
=1,2 ... N), N number of sending node, calculates i-th of node next round according to the priority of node priority and sends DATA in total
Packet needs the time Δ τ waited fori,j；
2 next round transmission data timetable of table
| Sending node i | Jth wheel needs the time waited for | Whether retransmit |
| 1 | Δτ1,j | a1 |
| 2 | Δτ2,j | a2 |
| 3 | Δτ3,j | a3 |
| … | … | … |
Further, the underwater sound communication network includes a receiving node and multiple sending nodes, and is owned in network
Node all in communicating within the scope of.
The beneficial effects of the invention are as follows：
1, the mechanism based on overall scheduling rather than random competition mechanism are reduced in the case where ensureing that node does not conflict and are passed
Sending node and receiving node establish the time for occupancy of shaking hands before transmission of data, improve the efficiency of shaking hands of node, reduce node
Collision improve the handling capacity of network to reduce network delay.
2, it in the design of agreement, using the mechanism of overall scheduling, greatly reduces node and shakes hands number, to reduce net
Network time delay improves the handling capacity of network.
3, in view of the principles such as the real time and dynamic of node and access fairness, the time that channel is accessed to node adjusts
Degree, can realize the underwater sound communication network of low time delay, high-throughput, meet the requirement of Qos.
Description of the drawings
Fig. 1 is network topology structure figure.
Fig. 2 is to be generally basede on the MAC protocol sequential flow chart shaken hands；
Fig. 3 is the sequential flow chart of the real-time MAC protocol of adaptive conflict avoidance based on overall scheduling.
Specific implementation mode
The present invention will be further described with specific example below in conjunction with the accompanying drawings, but implementation and the protection domain of the present invention
It is without being limited thereto.
Shown in Fig. 2 is to be generally basede on the MAC protocol sequential flow chart shaken hands.Main contents are：When sending node has number
When according to being sent, need first to send a RTS packet to receiving node.After receiving node 0 receives the RTS packets of sending node 1,
CTS packets are replied to sending node 1, sending node 1 receives CTS packets, shows success of shaking hands, and starts to send DATA data packets.And
At the same time, other sending nodes in all communication ranges can receive CTS packets, obtain sending node 1 till now and receive and save
0 communicating information of point waits for this information end of transmission into backoff state.Receiving node 0 receives sending node 1
DATA data packets after, judge whether data packet is properly received, if data receiver is correct, to sending node 1 reply ACK
Packet replys NACK packets if Data reception errors to sending node 1.Meanwhile other nodes also all receive ACK/NACK packets,
This time information end of transmission.Into the transceiving data state of next round.
Due to the long delay characteristics of underwater sound communication, RTS is being sent, it is time-consuming longer during CTS packets are shaken hands, it drops significantly
The low handling capacity and channel utilization of channel.Therefore in order to reduce the handshake procedure between node, while rushing between node is avoided
Prominent, the present invention proposes a kind of adaptive conflict avoidance real-time media access control method based on overall scheduling.This method is not
The frequency of shaking hands of interchannel is only reduced, while in view of the fairness of node and Qos requirements, realizes that the overall scheduling of node passes
It is defeated, channel utilization is improved, the average delay of network is reduced, improves the quality of underwater sound communication network.
Network topological diagram that the present invention uses is as shown in Figure 1, comprising a receiving node, multiple sending nodes, and network
In all nodes all in communicating in the range of.Fig. 3 is the real-time MAC associations of adaptive conflict avoidance based on overall scheduling
The sequential flow chart of view.
0th takes turns to initialize communication, and all sending nodes send ITP packets to receiving node, including waiting packet
Number Wi0With the currently transmitted moment
When the first round communicates, receiving node 0 has received the ITP package informatins of all sending nodes, is stored in overall scheduling
In table, the M-LWDF algorithms of application enhancements calculate the priority W of all sending nodesi0.It is calculated later according to transmission priority
Each sending node needs the time Δ τ waited in next round transmission dataij, it is stored in next round transmission data timetable
In.Next round transmission data timetable is stored in GSACK packets by receiving node 0, and GSACK packets are sent to all transmissions
Node, according to the next round transmission data timetable in GSACK packets, is sought when sending node receives the data of receiving node
It finds oneself and needs the time waited for, kept out of the way at the time of can send DATA packets.DATA packets packet header includes waiting for packet
Number WijWith the currently transmitted momentAfter all sending nodes sequentially send DATA packets, epicycle sign off.
When the second wheel communication, after receiving node 0 receives the data packet that all sending nodes are sent, the number received is judged
It is whether correct according to wrapping, if correct in next round transmission data timetable whether one column of re-transmission is denoted as 0, be otherwise denoted as 1.
The priority of each sending node is calculated according to overall scheduling meter later, and then calculates next round data delivery time table, will be sent out
It send timetable to be stored in GSACK, is sent to each sending node.When sending node receives in GSACK information, according to next
It takes turns the waiting time delay in delivery time table and whether retransmits sequentially transmission DATA packets.
Other wheel communications are taken turns with second as communication, successively recursion, until the data transmission of all sending nodes finishes.
Adaptive conflict avoidance media access control agreement proposed by the present invention based on overall scheduling is shaken hands general
The number shaken hands is greatly reduced on the basis of MAC protocol, to reduce average delay, increases network throughput, while
It is additionally contemplates that the fairness of the real-time status and nodes access of node in the design of agreement, realizes efficient underwater sound communication
Network.
Claims (6)
1. a kind of adaptive conflict avoidance real-time media access control method based on overall scheduling, which is characterized in that this method
Include the following steps：
(1) all sending nodes in underwater sound communication network all send initial transmission packet ITP to receiving node, and packet includes i-th
The number W of the packets to be transmitted such as a sending node jth wheeli,jWith the currently transmitted momentReceiving node receives these ITP packets
Later, the time of reception for receiving packet is recordedAccording to Wi,j、WithEstablish overall scheduling table；
(2) after receiving node receives the information of all sending nodes, according to the information in overall scheduling table, by being calculated in M-LWDF
The packet number that is lined up for increasing by i-th of node in method is lined up ratio shared in packet number in all sending nodes, obtains each transmission
The transmission priority of node, is ranked up sending node according to these priority；The sending node after sequence is carried out later
The time that busy channel is needed when sequentially calculating its transmission data obtains waitings of the sending node i before jth wheel transmission data
Time Δ τi,j；Then by the stand-by period storage to next round transmission data timetable before these transmission datas, pass through the overall situation
Scheduling replys packet GSACK and is sent to all sending nodes；
(3) after sending node receives GSACK packets, it is corresponding etc. that the transmission data timetable in GSACK packets finds oneself
It waits for the time, keeps out of the way and wait for Δ τi,jRetransmit DATA packets after time, while by the number W of the packet to be transmitted such as next roundi,jWith work as
Preceding delivery timeIt stores in DATA packets packet header；
(4) after receiving node receives the DATA packets that all sending nodes are sent, the information in overall scheduling table is stored first, it
All sending nodes are calculated afterwards and send priority, while the sending node for being not successfully receiving DATA packets being retransmitted
Label needs to occupy in order to notify retransmit DATA packets node next time according to transmission precedence information and node transmission data
The temporal information of channel further establishes next round transmission data timetable, will be stored with next round transmission data table information
GSACK packets be sent to all sending nodes.
2. the adaptive conflict avoidance real-time media access control method according to claim 1 based on overall scheduling,
It is characterized in that, the specific construction method of overall scheduling table is as follows in the step (1)：
Overall scheduling table includes the waiting of the sending node i in serial number i, jth wheel and jth -1 the wheel communication of each sending node
The packet number W of transmissioni,jAnd Wi,j-1, delivery timeWithAnd the time of receptionWithEach sending node to
Receiving node sends ITP packets, and packet includes Wi,jWithReceiving node receive i-th of sending node transmission ITP packets it
Afterwards, it records and is denoted as at the time of ITP packets will be receivedLater by Wi,j、It stores in overall scheduling table, directly
To the ITP packets for having received all sending nodes；Overall scheduling table is specific as follows：
1 overall scheduling table of table
3. the adaptive conflict avoidance real-time media access control method according to claim 1 based on overall scheduling,
It is characterized in that, it is specific as follows to the optimization of M-LWDF algorithms in the step (2)：
Increase parameter Vi[j] is lined up ratio shared in packet number to assess the packet number that is lined up of i-th of node in all sending nodes
Example, to ensure the fairness of node；Vi[j] is expressed as：
Si[j] refers to the packet number that i-th of node jth wheel is lined up, including the packet number W waited in upper wheeli,j-1In addition prediction is
By the packet number of arrival, N is sending node sum, therefore the M-LWDF algorithmic notations after optimization are：
Wherein, i indicates node i；J indicates the scheduling of jth wheel；P expression parameter priority；δ indicates the Qos ginsengs of maximum packet loss
Number；R indicates maximum data rate；λ is the estimation of average throughput；D indicates the waiting time delay in packet header；T indicates maximum tolerance time delay.
4. the adaptive conflict avoidance real-time media access control method according to claim 1 based on overall scheduling,
It is characterized in that, stand-by period Δ τs of the sending node i before jth wheel transmission data in the step (3)i,jComputational methods such as
Under：
(a) when j=1, i.e., when the first round, due to being random access, Δ τi,jThe as time of random back；
(b)j>When 1, Δ τi,jIn priority query P, to come the Δ τ of the node a before i-th of nodea,jIn addition during jth -1 is taken turns
The propagation delay of node a subtracts packet length L, astDa,j-1For receiving node receive packet when
It carves,At the time of packet being sent for sending node；And come the node b of head of the queueτ is all hairs
The maximum propagation time delay for sending node ensures that the time is same to ensure to retransmit DATA packets after all nodes all receive GSACK
Step.
5. the adaptive conflict avoidance real-time media access control method according to claim 1 based on overall scheduling,
It is characterized in that, the specific construction method of next round transmission data timetable is as follows：
Next round transmission data timetable includes that sending node serial number i, jth wheel need the time Δ τ that waits fori,jAnd whether weigh
Pass label ai；aiIt indicates whether node i needs to retransmit, needs to be denoted as 1 when retransmitting, indicate that receiving node fails to successfully receive this
The packet of sending node needs to retransmit the packet, is otherwise denoted as 0, indicates that receiving node is successfully received the packet of the sending node,
It need not retransmit；When receiving node calculates the priority of all sending nodes, it is assumed that priority query be Q [i] (i=1,
2 ... N), N number of sending node, calculates i-th of node next round according to the priority of node priority and sends DATA packet need in total
The time Δ τ to be waited fori,j；
2 next round transmission data timetable of table
6. a kind of adaptive conflict avoidance real-time media access control side based on overall scheduling according to claim 1
Method, which is characterized in that the underwater sound communication network includes a receiving node and multiple sending nodes, and section all in network
Within the scope of point is all in communicating.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810327852.XA CN108632911B (en) | 2018-04-12 | 2018-04-12 | Self-adaptive collision avoidance real-time medium access control method based on global scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810327852.XA CN108632911B (en) | 2018-04-12 | 2018-04-12 | Self-adaptive collision avoidance real-time medium access control method based on global scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108632911A true CN108632911A (en) | 2018-10-09 |
| CN108632911B CN108632911B (en) | 2020-10-16 |
Family
ID=63705372
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810327852.XA Active CN108632911B (en) | 2018-04-12 | 2018-04-12 | Self-adaptive collision avoidance real-time medium access control method based on global scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108632911B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110740474A (en) * | 2019-05-28 | 2020-01-31 | 浙江大学 | Media access control method of data collection type mobile underwater sound sensing network |
| CN112929834A (en) * | 2021-02-04 | 2021-06-08 | 深圳市智慧海洋科技有限公司 | Medium access control method, device, equipment and storage medium |
| CN114422589A (en) * | 2020-10-12 | 2022-04-29 | 中国移动通信有限公司研究院 | Data transmission method, device, equipment and storage medium |
| CN115378758A (en) * | 2022-07-27 | 2022-11-22 | 中国船舶重工集团公司第七二四研究所 | Multi-node SRIO bus self-adaptive flow control method based on priority strategy |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101287000A (en) * | 2008-06-04 | 2008-10-15 | 中国海洋大学 | Media access control protocol for underwater sensor network based on TDMA |
| CN106034121A (en) * | 2015-03-17 | 2016-10-19 | 南通蓝鹏信息科技有限公司 | Underwater medium access control protocol of selective retransmission, handshake and time slot |
| CN106961740A (en) * | 2017-03-09 | 2017-07-18 | 上海海事大学 | A kind of water sound sensor network data transmission method based on pre-scheduling pipeline system |
| CN107071829A (en) * | 2017-04-12 | 2017-08-18 | 浙江大学 | A kind of data-oriented collects the underwater acoustic network media access control method of task |
-
2018
- 2018-04-12 CN CN201810327852.XA patent/CN108632911B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101287000A (en) * | 2008-06-04 | 2008-10-15 | 中国海洋大学 | Media access control protocol for underwater sensor network based on TDMA |
| CN106034121A (en) * | 2015-03-17 | 2016-10-19 | 南通蓝鹏信息科技有限公司 | Underwater medium access control protocol of selective retransmission, handshake and time slot |
| CN106961740A (en) * | 2017-03-09 | 2017-07-18 | 上海海事大学 | A kind of water sound sensor network data transmission method based on pre-scheduling pipeline system |
| CN107071829A (en) * | 2017-04-12 | 2017-08-18 | 浙江大学 | A kind of data-oriented collects the underwater acoustic network media access control method of task |
Non-Patent Citations (3)
| Title |
|---|
| MIN DENG 等: "A Hybrid MAC Protocol in Data-collection-oriented Underwater Acoustic Sensor Networks", 《IEEE》 * |
| 张阳 等: "一种基于冲突解析的水声网络ALOHA协议", 《网络新媒体技术》 * |
| 杨鹏，闫俊杰，王汝言: "LTE 中队列状态感知的优化M-LWDF调度算法", 《重庆邮电大学学报(自然科学版)》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110740474A (en) * | 2019-05-28 | 2020-01-31 | 浙江大学 | Media access control method of data collection type mobile underwater sound sensing network |
| CN110740474B (en) * | 2019-05-28 | 2020-11-24 | 浙江大学 | Media access control method of data collection type mobile underwater acoustic sensor network |
| CN114422589A (en) * | 2020-10-12 | 2022-04-29 | 中国移动通信有限公司研究院 | Data transmission method, device, equipment and storage medium |
| CN112929834A (en) * | 2021-02-04 | 2021-06-08 | 深圳市智慧海洋科技有限公司 | Medium access control method, device, equipment and storage medium |
| CN112929834B (en) * | 2021-02-04 | 2024-02-23 | 深圳市智慧海洋科技有限公司 | Medium access control method, device, equipment and storage medium |
| CN115378758A (en) * | 2022-07-27 | 2022-11-22 | 中国船舶重工集团公司第七二四研究所 | Multi-node SRIO bus self-adaptive flow control method based on priority strategy |
| CN115378758B (en) * | 2022-07-27 | 2023-09-26 | 中国船舶集团有限公司第七二四研究所 | Multi-node SRIO bus self-adaptive flow control method based on priority strategy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108632911B (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9521584B2 (en) | Method and apparatus for managing data flow through a mesh network | |
| EP1263168B1 (en) | Wireless communication apparatus | |
| CN100461752C (en) | Wireless communication apparatus and wireless communication method | |
| CN108632911A (en) | Adaptive conflict avoidance real-time media access control method based on overall scheduling | |
| TWI455522B (en) | Enhanced multi-user transmission | |
| CN101286980B (en) | Distributed media access control protocol for increasing capacity of wireless local area network | |
| US20070297375A1 (en) | System and method for data transmission in an ad hoc communication network | |
| CN102870378B (en) | Self adaptation contention window in discontinuous radio communication channel | |
| KR100608914B1 (en) | Media access control apparatus of wireless LAN for VoIP | |
| US7843956B2 (en) | Wireless system, wireless communication apparatus and communication method | |
| CN105592564B (en) | Adaptive access mechanism based on the estimation of live-vertex number in wireless Mesh netword | |
| US20040131039A1 (en) | Exploratory polling for periodic traffic sources | |
| Sikdar | An analytic model for the delay in IEEE 802.11 PCF MAC-based wireless networks | |
| CN107666489A (en) | A kind of method of media access control protocol based on two benches competition in full duplex radio network | |
| CN102685920A (en) | Double-channel reservation access control method in mobile Ad Hoc network | |
| US7379462B2 (en) | WLAN access scheduling control | |
| WO2006050664A1 (en) | System and method for controlling access to a wireless medium | |
| US20070217443A1 (en) | Communication apparatus, communication method, and computer program product | |
| CN102843775B (en) | Dispatching method, dispatching device and network equipment | |
| CN108347788A (en) | The data concurrency transmission method of propagation delay is utilized based on Slotted-FAMA agreements | |
| Dong et al. | Packet delay analysis on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks | |
| KR100853695B1 (en) | Wireless lan apparatus based on multiple queues | |
| Hu et al. | Analysis and comparison of burst transmission schemes in unsaturated 802.11 e WLANs | |
| Nguyen et al. | Packet size variability affects collisions and energy efficiency in WLANs | |
| Chou et al. | A priority contention window mechanism for ad hoc network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |