CN112437478A - Efficient MAC protocol based on variable time slots - Google Patents
Efficient MAC protocol based on variable time slots Download PDFInfo
- Publication number
- CN112437478A CN112437478A CN202110044532.5A CN202110044532A CN112437478A CN 112437478 A CN112437478 A CN 112437478A CN 202110044532 A CN202110044532 A CN 202110044532A CN 112437478 A CN112437478 A CN 112437478A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster head
- time slot
- parallel transmission
- nodes
- 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
- 108700026140 MAC combination Proteins 0.000 title claims abstract description 18
- 230000005540 biological transmission Effects 0.000 claims abstract description 74
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 55
- 230000003993 interaction Effects 0.000 claims abstract description 4
- 238000013461 design Methods 0.000 claims abstract description 3
- 238000004891 communication Methods 0.000 claims description 6
- 238000012546 transfer Methods 0.000 claims description 2
- 238000000034 method Methods 0.000 abstract description 2
- 239000002699 waste material Substances 0.000 description 2
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 2
- 230000002860 competitive effect Effects 0.000 description 1
- 230000036963 noncompetitive effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Classifications
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明涉及一种基于可变时隙的高效MAC协议的设计，主要包括下列步骤：建立系统模型：节点随机被锚定在某一海域，n个成员节点和一个簇头节点N组成一个簇，成员节点将收集的数据通过水声链路发送到簇头节点；簇头节点通过与成员节点之间的信息交互在本地维护一个传播时延表，表里是每个成员节点到簇头节点的传播时延，网络进行时针同步，在后续的数据传输的过程中，网络定期的进行时针同步并且簇头节点维护传播时延表；定义并行传输条件、并行传输节点、最优并行传输条件、时隙结束条件；簇头节点根据并行传输节点选择机制，选择每个时隙的大小以及每个时隙可以并发传输的节点。
The invention relates to the design of an efficient MAC protocol based on variable time slots, which mainly includes the following steps: establishing a system model: nodes are randomly anchored in a certain sea area, n member nodes and a cluster head node N form a cluster, The member nodes send the collected data to the cluster head node through the underwater acoustic link; the cluster head node maintains a propagation delay table locally through the information interaction with the member nodes. Propagation delay, the network performs clock synchronization, in the process of subsequent data transmission, the network periodically synchronizes the clock and the cluster head node maintains the propagation delay table; define parallel transmission conditions, parallel transmission nodes, optimal parallel transmission conditions, time Slot end condition; the cluster head node selects the size of each time slot and the nodes that can transmit concurrently in each time slot according to the parallel transmission node selection mechanism.
Description
Technical Field
The invention belongs to the technical field of underwater wireless sensor network communication, and relates to an MAC protocol based on variable time slots.
Background
The MAC protocol can allow multiple nodes to perform data transmission on the same channel without collision, and the MAC protocol can be roughly divided into two types: a competitive MAC protocol and a non-competitive MAC protocol. TDMA, FDMA, CDMA are 3 typical non-contention based MAC protocols. TDMA, time division multiple access multiplexing, divides time into time slots, each node being assigned to one time slot for the reception and transmission of data, the nodes communicating only in the respective time slot and entering a sleep state in the other time slots. However, TDMA requires strict time-clock synchronization, which is difficult to implement in large-scale networks. FDMA is frequency division multiple access multiplexing, which is to divide a frequency band into a plurality of sub-frequency bands, and each node communicates on each sub-frequency band respectively. CDMA, i.e., code division multiple access, multiplexing, but the near-far problem limits its application in underwater networks. The underwater wireless sensor network uses sound waves for communication, the propagation speed of sound velocity under water is only 1500m/s, and is 5 orders of magnitude lower than the speed of electromagnetic waves used by a land wireless sensor network, and the characteristic causes long propagation delay of the underwater wireless sensor network. In addition, in the traditional MAC protocol, only one node is allowed to send information in one time slot, which causes a large amount of time slot waste, reduces the throughput of the network and increases the end-to-end delay. An efficient MAC protocol based on variable time slots has therefore been designed.
Disclosure of Invention
Aiming at the problem of overlong time slot caused by long propagation delay faced by an underwater infinite sensor network, the invention provides a high-efficiency MAC protocol based on variable time slot. The invention not only reduces the waste of time slot, but also increases the concurrent transmission performance of the network, greatly reduces the end-to-end delay of the network and improves the throughput of the network. The technical scheme is as follows:
a design for a variable slot based high efficiency MAC protocol, comprising the steps of:
(1) the nodes are randomly deployed underwater, N member nodes and a cluster head node N form a cluster, the member nodes are uniformly distributed in the transmission range of the cluster head node, in the initialization stage of the network, the cluster head node locally maintains a propagation delay table through information interaction between the cluster head node and the member nodes, the propagation delay from each member node to the cluster head node is arranged in the table, the network performs hour-hand synchronization, and in the subsequent data transmission process, the network periodically performs hour-hand synchronization and the cluster head node maintains the propagation delay table;
(2) for N member nodes N1，N2，…，NnWith a corresponding propagation delay of t1>t2>…>tnThe following definitions are first given:
definition 1: parallel transmission conditions: when node NiAfter a certain time slot starts to transmit data, ti-tj>TDReferred to as node NjThe parallel transmission condition of (1);
definition 2: parallel transmission node: when node NiAfter determining that data is sent in a certain time slot, the node meeting the parallel transmission condition can be used as the node NiThe parallel transmission node of (1). Note that in our invention, node NiThe number of the parallel transmission nodes is only one, when the node NiAfter the parallel transmission node is determined, other nodes meeting the parallel transmission condition cannot be called as NiA parallel transmission node of (1);
definition 3: optimal parallel transmission conditions: when node NiAfter the data is sent at the beginning of the time slot, if there are more than one data satisfying parallel transmissionThe node with the condition is selected as the node N with the maximum propagation delayiA parallel transmission node of (1);
definition 4: the time slot end condition is as follows: when node NiAfter the data is sent at the beginning of the time slot, the rest nodes do not meet the parallel transmission condition;
(3) and the cluster head node selects the size of each time slot and the nodes which can be transmitted simultaneously in each time slot according to a parallel transmission node selection mechanism. When m nodes do not transmit data after the k-1 time slot of one round of communication is finished, redefining the m nodes as N according to the propagation delay with the cluster head node1，N2，…，NmThe corresponding propagation delay is t1>t2>…>tm. The cluster head node selects a node for parallel transmission in the kth time slot according to a parallel transmission node selection mechanism;
(4) the cluster head node determines the length of each time slot and a node set which can be transmitted in parallel in each time slot according to the propagation delay of each member node and a parallel transmission node mechanism, the cluster head node adds the information into a scheduling packet and broadcasts the information to a network at a certain moment, and each member node transmits data to the cluster head node in parallel according to the received scheduling information. Wherein, the time of broadcasting the scheduling information by the cluster head node is taken as the standard, Tmax+TOAfter the time, the data transmission starts, i.e. the first time slot is opened, and each member node transmits data at the start of each time slot according to the scheduling information. Wherein, TmaxFor maximum propagation delay in the network, TOThe transmission delay of the packet is scheduled.
The invention provides a high-efficiency MAC protocol based on variable time slots, wherein a cluster head node determines the length of the time slot and a node for transmitting data simultaneously in the time slot according to the propagation delay of a member node and the cluster head node, thereby improving the throughput and the channel utilization rate of a network.
Drawings
In order to more clearly explain the implementation process of the MAC protocol designed by the present invention, the following detailed description is made on the drawings involved in the present invention.
Fig. 1 is a network topology and application scenario applicable to the MAC protocol designed by the present invention;
fig. 2 is a flow chart of the operation of the concurrent transmission node selection mechanism.
Detailed description of the preferred embodiments
The invention provides a high-efficiency MAC protocol based on variable time slots, wherein a cluster head node determines the length of a time slot and a node for simultaneously transmitting data in the time slot according to the propagation delay of a member node and the cluster head node, and allows a plurality of nodes to transmit data in a shorter time slot, thereby improving the throughput and the channel utilization rate of a network.
The provided high-efficiency MAC protocol is directed at a single-hop wireless sensor network communication scene based on a cluster structure, namely, nodes are anchored in a certain sea area at random, N member nodes and a cluster head node N form a cluster, the member nodes are uniformly distributed in the transmission range of the cluster head node, the cluster is deployed in an area needing to be detected, the member nodes send collected data to the cluster head node through an underwater acoustic link, the cluster head node forwards the data to a water surface gateway node through the underwater acoustic link after processing the data, and the gateway node transmits the data to a ground base station through a satellite link. When one cluster cannot cover the whole area, a plurality of clusters are used for detecting the area needing to be detected. In a single cluster, the member nodes transmit information back to the cluster head according to the scheduling of the cluster head nodes after collecting the information. The specific operational flow is for a single cluster.
The specific operation flow of the invention is as follows:
(1) the nodes are randomly deployed underwater, N member nodes and a cluster head node N form a cluster, the member nodes are uniformly distributed in the transmission range of the cluster head node, in the initialization stage of the network, the cluster head node locally maintains a propagation delay table through information interaction between the cluster head node and the member nodes, the propagation delay from each member node to the cluster head node is arranged in the table, the network performs hour-hand synchronization, and in the subsequent data transmission process, the network periodically performs hour-hand synchronization and the cluster head node maintains the propagation delay table;
（2）for N member nodes N1，N2，…，NnWith a corresponding propagation delay of t1>t2>…>tnThe following definitions are first given:
definition 1: parallel transmission conditions: when node NiAfter a certain time slot starts to transmit data, ti-tj>TDReferred to as node NjThe parallel transmission condition of (1);
definition 2: parallel transmission node: when node NiAfter determining that data is sent in a certain time slot, the node meeting the parallel transmission condition can be used as the node NiThe parallel transmission node of (1). Note that in our invention, node NiThe number of the parallel transmission nodes is only one, when the node NiAfter the parallel transmission node is determined, other nodes meeting the parallel transmission condition cannot be called as NiA parallel transmission node of (1);
definition 3: optimal parallel transmission conditions: when node NiAfter the data is sent at the beginning of the time slot, if a plurality of nodes meeting the parallel transmission condition exist, the node with the maximum propagation delay is selected as the node NiA parallel transmission node of (1);
definition 4: the time slot end condition is as follows: when node NiAfter the data is sent at the beginning of the time slot, the rest nodes do not meet the parallel transmission condition;
(3) and the cluster head node selects the size of each time slot and the nodes which can be transmitted simultaneously in each time slot according to a parallel transmission node selection mechanism. When m nodes do not transmit data after the k-1 time slot of one round of communication is finished, redefining the m nodes as N according to the propagation delay with the cluster head node1，N2，…，NmThe corresponding propagation delay is t1>t2>…>tm. And the cluster head node selects the node for parallel transmission in the kth time slot according to a parallel transmission node selection mechanism.
Time slot length: the length of the k-th time slot is t1+TD；
Fig. 2 is a flow chart of the operation of the parallel transfer node selection mechanism:
1. let i =1, node NiFirstly, determining that data can be transmitted at the beginning of the k-th time slot;
2. when N is presentiDetermining whether a time slot ending condition is met or not when data is transmitted at the kth time slot, if so, the remaining nodes cannot transmit data at the beginning of the kth time slot, and ending the parallel transmission node selection mechanism; if the time slot ending condition is not met, starting the next step;
3、i=i+1；
4. judging whether i is less than or equal to m, if so, judging the node NiWhether the optimal parallel transmission condition is satisfied, if so, NiDetermining to transmit data at the kth time slot, returning to the step 2, and returning to the step 3 if the data is not met; if i is larger than m, no node can transmit data in the kth time slot, and the parallel transmission node selection mechanism is finished;
(4) the cluster head node determines the length of each time slot and a node set which can be transmitted in parallel in each time slot according to the propagation delay of each member node and a parallel transmission node mechanism, the cluster head node adds the information into a scheduling packet and broadcasts the information to a network at a certain moment, and each member node transmits data to the cluster head node in parallel according to the received scheduling information. Wherein, the time of broadcasting the scheduling information by the cluster head node is taken as the standard, Tmax+TOAfter the time, the data transmission starts, i.e. the first time slot is opened, and each member node transmits data at the start of each time slot according to the scheduling information. Wherein, TmaxFor maximum propagation delay in the network, TOThe transmission delay of the packet is scheduled.
Claims (1)
1. A design for a variable slot based high efficiency MAC protocol, comprising the steps of:
(1) the nodes are randomly deployed underwater, N member nodes and a cluster head node N form a cluster, the member nodes are uniformly distributed in the transmission range of the cluster head node, in the initialization stage of the network, the cluster head node locally maintains a propagation delay table through information interaction between the cluster head node and the member nodes, the propagation delay from each member node to the cluster head node is arranged in the table, the network performs hour-hand synchronization, and in the subsequent data transmission process, the network periodically performs hour-hand synchronization and the cluster head node maintains the propagation delay table;
(2) for N member nodes N1，N2，…，NnIts corresponding propagation delay from the cluster head node is t1>t2>…>tnThe following definitions are first given:
definition 1: parallel transmission conditions: when node NiAfter a certain time slot starts to transmit data, ti-tj>TDReferred to as node NjThe parallel transmission condition of (1);
definition 2: parallel transmission node: when node NiAfter determining that data is sent in a certain time slot, the node meeting the parallel transmission condition can be used as the node NiNote that in our invention, node N is the parallel transfer node ofiThe number of the parallel transmission nodes is only one, when the node NiAfter the parallel transmission node is determined, other nodes meeting the parallel transmission condition cannot be called as NiA parallel transmission node of (1);
definition 3: optimal parallel transmission conditions: when node NiAfter the data is sent at the beginning of the time slot, if a plurality of nodes meeting the parallel transmission condition exist, the node with the maximum propagation delay is selected as the node NiA parallel transmission node of (1);
definition 4: the time slot end condition is as follows: when node NiAfter the data is sent at the beginning of the time slot, the rest nodes do not meet the parallel transmission condition;
(3) the cluster head node selects the size of each time slot and the node which can be transmitted simultaneously in each time slot according to a parallel transmission node selection mechanism, m nodes do not transmit data after the k-1 time slot of one round of communication is finished, and the m nodes are redefined as N according to the propagation delay with the cluster head node1，N2，…，NmThe corresponding propagation delay is t1>t2>…>tmThe cluster head node selects a node for parallel transmission at the kth time slot according to a parallel transmission node selection mechanism;
(4) the cluster head node determines the length of each time slot and a node set which can be transmitted in parallel in each time slot according to the propagation delay of each member node and a parallel transmission node mechanism, the cluster head node adds the information into a scheduling packet and broadcasts the information to a network at a certain moment, and each member node transmits data to the cluster head node in parallel according to the received scheduling information, wherein the T is determined by taking the time when the cluster head node broadcasts the scheduling information as the referencemax+TOAfter time, data transmission begins, i.e. the first time slot is opened, and each member node transmits data at the beginning of each time slot according to scheduling information, wherein TmaxFor maximum propagation delay in the network, TOThe transmission delay of the packet is scheduled.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110044532.5A CN112437478A (en) | 2021-01-13 | 2021-01-13 | Efficient MAC protocol based on variable time slots |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110044532.5A CN112437478A (en) | 2021-01-13 | 2021-01-13 | Efficient MAC protocol based on variable time slots |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112437478A true CN112437478A (en) | 2021-03-02 |
Family
ID=74697165
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110044532.5A Pending CN112437478A (en) | 2021-01-13 | 2021-01-13 | Efficient MAC protocol based on variable time slots |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112437478A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006120651A2 (en) * | 2005-05-12 | 2006-11-16 | Koninklijke Philips Electronics N.V. | Distributed medium access protocol for wireless mesh networks |
| US20180302911A1 (en) * | 2017-04-13 | 2018-10-18 | Kabushiki Kaisha Toshiba | Method for scheduling transmissions in wireless networks |
| CN110943861A (en) * | 2019-11-22 | 2020-03-31 | 南京航空航天大学 | A Multi-Link Concurrent Transmission Method Applicable to Underwater Acoustic Sensor Networks |
| CN111901879A (en) * | 2020-06-19 | 2020-11-06 | 中国船舶重工集团公司第七一五研究所 | Time slot dynamic adjustment concurrent transmission method suitable for underwater sound clustering network |
-
2021
- 2021-01-13 CN CN202110044532.5A patent/CN112437478A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006120651A2 (en) * | 2005-05-12 | 2006-11-16 | Koninklijke Philips Electronics N.V. | Distributed medium access protocol for wireless mesh networks |
| US20180302911A1 (en) * | 2017-04-13 | 2018-10-18 | Kabushiki Kaisha Toshiba | Method for scheduling transmissions in wireless networks |
| CN110943861A (en) * | 2019-11-22 | 2020-03-31 | 南京航空航天大学 | A Multi-Link Concurrent Transmission Method Applicable to Underwater Acoustic Sensor Networks |
| CN111901879A (en) * | 2020-06-19 | 2020-11-06 | 中国船舶重工集团公司第七一五研究所 | Time slot dynamic adjustment concurrent transmission method suitable for underwater sound clustering network |
Non-Patent Citations (2)
| Title |
|---|
| YU HAN;YUNSI FEI: "A delay-aware probability-based MAC protocol for underwater acoustic sensor networks", 《2015 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC)》 * |
| 杨鸿: "利用传播时延并发传输的水声通信网络MAC协议研究", 《中国优秀博硕士学位论文全文数据库(硕士)基础科学辑 (月刊)》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Peleato et al. | A MAC protocol for ad-hoc underwater acoustic sensor networks | |
| CN103460620B (en) | Make the adaptive synchronicity agreement of delay minimization in a tdd system | |
| Tan et al. | Distributed CDMA-based MAC protocol for underwater sensor networks | |
| CN104486005B (en) | A kind of multinode high-speed traffic method suitable for competitive channel underwater acoustic network | |
| CN102056325B (en) | Multiple access method based on multiple-input multiple-output antenna | |
| CN102264146A (en) | TDMA/FDMA-based WSN network mac layer scheduling method | |
| CN106332299B (en) | Multi-node Parallel Communication Method for Competitive Channel Underwater Acoustic Networks Containing Moving Nodes | |
| Zhang et al. | A load-based hybrid MAC protocol for underwater wireless sensor networks | |
| KR20120072288A (en) | Romote control system and method for underwater robot | |
| Guo et al. | An efficient medium access control scheme based on MC-CDMA for mobile underwater acoustic networks | |
| Hung et al. | Scheduling of broadcasts in multihop wireless networks | |
| CN104135357A (en) | Short wave network polling transmission method based on duplex structure | |
| CN109688554A (en) | A kind of underwater sound media access control (MAC) method applicable based on Dispatch by appointment mechanism | |
| Cho et al. | Contention free MAC protocol based on priority in underwater acoustic communication | |
| Nguyen et al. | Efficiency reservation MAC protocol for underwater acoustic sensor networks | |
| CN112437478A (en) | Efficient MAC protocol based on variable time slots | |
| CN115278771B (en) | Multi-hop underwater acoustic communication network conflict avoidance time slot allocation method | |
| CN103248435B (en) | Underwater acoustic communication network time division multiple address (TDMA) method | |
| Roy et al. | Performance analysis of energy-efficient MAC protocols for underwater sensor networks | |
| Chen et al. | A pre-scheduling-based MAC protocol for underwater acoustic sensor network | |
| CN112383925B (en) | Cluster-based design method of space-time scheduling MAC protocol | |
| CN111901879B (en) | Time slot dynamic adjustment concurrent transmission method suitable for underwater acoustic clustering network | |
| CN105933985B (en) | Underwater acoustic communication method based on distance adaptive selection of time slot | |
| CN115119267A (en) | Underwater network fair bandwidth allocation MAC protocol | |
| CN112383885A (en) | Design of concurrent transmission MAC protocol based on S-FAMA |
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: 20210302 |