CN109150714B - Node self-adaptive clustering and updating method applied to UWOC network - Google Patents

Node self-adaptive clustering and updating method applied to UWOC network Download PDF

Info

Publication number
CN109150714B
CN109150714B CN201811189003.9A CN201811189003A CN109150714B CN 109150714 B CN109150714 B CN 109150714B CN 201811189003 A CN201811189003 A CN 201811189003A CN 109150714 B CN109150714 B CN 109150714B
Authority
CN
China
Prior art keywords
node
nodes
current
information
data set
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
Application number
CN201811189003.9A
Other languages
Chinese (zh)
Other versions
CN109150714A (en
Inventor
杨帆
何青兰
廖昌俊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201811189003.9A priority Critical patent/CN109150714B/en
Publication of CN109150714A publication Critical patent/CN109150714A/en
Application granted granted Critical
Publication of CN109150714B publication Critical patent/CN109150714B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/80—Optical aspects relating to the use of optical transmission for specific applications, not provided for in groups H04B10/03 - H04B10/70, e.g. optical power feeding or optical transmission through water
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Arrangements For Transmission Of Measured Signals (AREA)

Abstract

The invention discloses a node self-adaptive clustering and updating method applied to a UWOC network, aiming at the problem that nodes of the existing underwater dynamic network are difficult to deploy, multi-dimensional information such as the distance, the residual energy and the depth of the nodes in the UWOC network is comprehensively considered, the concept of clustering process scheduling and a cluster head selection algorithm are combined, the underwater dynamic environment can be well adapted, and when the nodes are clustered, position information, acceleration information, node depth information and residual energy information are considered, and an underwater node network which accords with the reality can be well formed.

Description

Node self-adaptive clustering and updating method applied to UWOC network
Technical Field
The invention belongs to the technical field of underwater wireless optical communication, and particularly relates to a design of a node self-adaptive clustering and updating method applied to a UWOC network.
Background
At present, most of traditional networking algorithms of two-dimensional static Wireless sensor networks suitable for land are difficult to be suitable for three-dimensional dynamic Underwater Wireless Communication (uWOC) network environments, and the dynamics of the uWOC network is represented by the randomness of node release and the unfixed nodes caused by factors such as drift along with water flow. In UWOC dynamic node deployment, clustering and positioning, various factors such as water flow influence, node density, node cost and power consumption need to be comprehensively considered.
In the UWOC node clustering aspect, a Low-power adaptive clustering hierarchical protocol (Low-Energy adaptive clustering Hierarchy, LEACH) is a commonly used dynamic cluster head selection algorithm. Nodes in the network are alternately changed into Cluster Heads (CH) in a random mode, so that the energy excessive consumption of a certain CH can be avoided, and the whole life cycle of the network is prolonged. Most of the existing Underwater Wireless Sensor Network (UWSN) algorithms are improved or developed on the basis of LEACH algorithms, and still mainly research is conducted on the aspects of Underwater acoustic communication, node energy consumption, CH selection and the like from the aspects of the distance between nodes, node energy consumption and the like. Unlike the longer communication distance of the underwater acoustic system, the UWOC network is sensitive to the distance between nodes and is a network with asymmetric uplink and downlink communication. The uplink refers to communication from the underwater node to the water surface node (transmission of sensing information and large data volume), and the downlink refers to communication from the water surface node to the underwater node (transmission of control information and small data volume). Thus, nodes closer to the surface are more likely to die out due to the higher frequency of aggregated use of data, and nodes further below the water have a lower probability of being selected as CH, and thus the more energy remaining is generally. Therefore, the existing algorithms are difficult to deploy the nodes of the underwater dynamic network.
Disclosure of Invention
The invention aims to solve the problem of difficulty in deployment of underwater dynamic network nodes and provides a node self-adaptive clustering and updating method applied to a UWOC network.
The technical scheme of the invention is as follows: a node self-adaptive clustering and updating method applied to a UWOC network comprises the following steps:
s1, dividing all nodes in the UWOC network into m layers, wherein m is larger than or equal to 2.
And S2, performing CH election on each layer of nodes, and dividing the nodes into CH nodes and NCH nodes.
S3, selecting the first layer in the UWOC network.
S4, selecting the first CH node of the current layer.
And S5, initializing the currently selected CH node.
And S6, updating the currently selected CH node.
S7, judging whether all CH nodes of the current layer have passed the initialization and updating time sequence, if yes, entering step S8, otherwise, selecting the most advanced CH node which has not passed the initialization and updating time sequence, and returning to step S5.
S8, judging whether each layer CH node in UWOC network has already initialized and updated time sequence, if yes, ending the adaptive clustering and updating process of node, otherwise selecting the front layer without initialized and updated time sequence in UWOC network, and returning to step S4.
Further, the method for performing CH election on each layer of nodes in step S2 specifically includes:
distributing a random number between 0 and 1 for each node, if the random number distributed to a certain node is smaller than a threshold value T (i), selecting the node as a CH node, and if not, selecting the node as an NCH node;
the threshold value t (i) is set by the formula:
Figure BDA0001826986320000021
wherein P represents the proportion of CH nodes in all nodes, r represents the election round number, r.mod (1/P) represents the number of nodes which are selected as CH nodes in each round of election, and rhoiRepresenting the node density of the ith node, diDenotes the distance of the ith node to the water surface, dmaxRepresenting the distance of the bottommost node to the surface, EiThe residual energy of the ith node is represented, E represents the initial energy of the node, and i is 1, 2.
Further, step S5 includes the following substeps:
s51, initializing a downlink stage: transmitting downlink data set S to its downlink CH node through current CH nodeD。
S52, first initial broadcast stage: omnidirectionally broadcasting downlink data set S to the rest of CH nodes of the layer through the current CH nodeD。
S53, second initialization broadcast stage: omnidirectionally broadcasting downlink data set S to NCH node of the layer through current CH nodeD。
S54, second initialization uplink stage: transmitting an uplink data set S to a current CH node through an NCH node of the layerUAnd avoid data collision through OCDMA.
S55, a first initialization uplink stage: transmitting an upstream data set S to its upstream CH node through a current CH nodeUAnd data collision is avoided through OFDM.
Further, in step S52, the time slot is divided between the current CH node and the rest of the CH nodes by using the CSMA/CA protocol, and if the CH node allocated to the time slot in this step does not reach the ratio value preset in the UWOC network, the time slot dividing operation in step S52 is repeated until the CH node allocated to the time slot reaches the ratio value preset in the UWOC network, and the process proceeds to step S53.
Further, in steps S51-S53, if the current CH node is the first node of the layer, the downlink data set SDThe method comprises the steps of obtaining instruction information, position information of a node, acceleration information and node depth information; if the current CH node is not the first node of the layer, the downlink data set SDThe method comprises instruction information, position information, acceleration information and node depth information of the node and all uplink nodes of the node.
In step S54, the NCH node transmits an uplink data set S to the current CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information and the node depth information of the node.
In step S55, the uplink data set S transmitted from the current CH node to its uplink CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information and the node depth information of the node and all downlink nodes of the node.
Further, step S6 includes the following substeps:
s61, updating the downlink stage: transmitting downlink data set S to its downlink CH node through current CH nodeD。
S62, first update broadcast phase: omnidirectionally broadcasting downlink data set S to the rest of CH nodes of the layer through the current CH nodeD。
S63, second update broadcast phase: omnidirectionally broadcasting downlink data set S to NCH node of the layer through current CH nodeD。
S64, second updating uplink stage: transmitting an uplink data set S to a current CH node through an NCH node of the layerUAnd avoid data collision through OCDMA.
S65, a first updating uplink stage: transmitting an upstream data set S to its upstream CH node through a current CH nodeUAnd data collision is avoided through OFDM.
Further, the time slot is transferred to the CH node in step S62 through the initialized CH node in step S5 or the CH node of the previous round of updating.
Further onIn steps S61-S63, if the current CH node is the first node of the layer, the downlink data set SDThe method comprises the steps of obtaining instruction information, position information of a node, acceleration information, node depth information and residual energy information; if the current CH node is not the first node of the layer, the downlink data set SDThe method comprises instruction information, position information of the node and all uplink nodes of the node, acceleration information, node depth information and residual energy information.
In step S64, the NCH node transmits an uplink data set S to the current CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information, the node depth information and the residual energy information of the node.
In step S65, the uplink data set S transmitted from the current CH node to its uplink CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information, the node depth information and the residual energy information of the node and all downlink nodes of the node.
Further, data are transmitted between the CH node and the CH node through the LD light source, and data are transmitted between the CH node and the NCH node through the LED light source.
The invention has the beneficial effects that:
(1) the method can be well adapted to the underwater dynamic environment, and can well form an underwater node network conforming to the reality by considering position information, acceleration information, node depth information and residual energy information when the nodes are clustered.
(2) The invention carries out time sequence arrangement in the node clustering process, can avoid the interference of underwater optical network communication and improve the network communication quality.
(3) According to the invention, when the cluster head is selected, the node position information, the acceleration information, the node depth information and the residual energy information are fused, and the optimal node is selected in real time as the cluster head for communication, so that the life cycle of an underwater network can be fully ensured, the service life of the network is prolonged, and the method is suitable for an underwater dynamic environment.
Drawings
Fig. 1 is a flowchart of a node adaptive clustering and updating method applied to a UWOC network according to an embodiment of the present invention.
Fig. 2 is a timing diagram of a UWOC network system according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It is to be understood that the embodiments shown and described in the drawings are merely exemplary and are intended to illustrate the principles and spirit of the invention, not to limit the scope of the invention.
The embodiment of the invention provides a node self-adaptive clustering and updating method applied to a UWOC network, as shown in FIG. 1, comprising the following steps S1-S8:
s1, dividing all nodes in the UWOC network into m layers, wherein m is larger than or equal to 2.
And S2, performing CH election on each layer of nodes, and dividing the nodes into CH nodes and NCH nodes.
In the embodiment of the present invention, the method for performing CH election on each layer of nodes specifically includes: and allocating a random number between 0 and 1 to each node, if the random number allocated to a certain node is smaller than a threshold value T (i), selecting the node as a CH node, and if not, selecting the node as an NCH (Non-Cluster Head) node.
The threshold value t (i) is set by the formula:
Figure BDA0001826986320000051
wherein P represents the proportion of CH nodes in all nodes, r represents the election round number, r.mod (1/P) represents the number of nodes which are selected as CH nodes in each round of election, and rhoiRepresents the node density of the ith node (number of nodes/total number of nodes in a given radius, which can be calculated according to the position information of the node), diRepresents the distance from the ith node to the water surface (available from a depth meter), dmaxRepresenting the distance from the bottommost node to the surface (available from the depth meter), EiThe residual energy of the ith node is represented, E represents the initial energy of the node, and i is 1, 2.
In the embodiment of the invention, the UWOC network is processedAfter the layering and CH election and sorting, a UWOC network system time sequence diagram shown in FIG. 2 is obtained, and the UWOC network comprises the network system time sequence diagram
Figure BDA0001826986320000052
A CH node, NiFor the number of CH nodes on the ith layer, initialization and update operations need to be performed for each CH node subsequently.
S3, selecting the first layer in the UWOC network.
S4, selecting the first CH node of the current layer.
And S5, initializing the currently selected CH node.
The step S5 includes the following substeps S51-S55:
s51, initializing downlink stage d (downlink): transmitting downlink data set S to its downlink CH node through current CH nodeD。
S52, first initialization broadcast phase B1(Broadcast 1): omnidirectionally broadcasting downlink data set S to the rest of CH nodes of the layer through the current CH nodeD。
In step S52, the time slot is divided between the current CH node and the remaining CH nodes using Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) protocol, and only the CH node assigned to the time slot will have its subsequent operation steps valid. The CH node sends out the omnidirectional broadcast signal at the stage, when the signal is sent, if the CH node receives the signals sent by other CH nodes, the CH node delays a period of time and then sends the broadcast signal, and the CH node which sends successfully firstly is firstly allocated to the time slot. If the CH node allocated to the time slot in this step does not reach the ratio value preset in the UWOC network, the process does not proceed to step S53 for the moment, but repeats the time slot division operation of step S52 until the CH node allocated to the time slot reaches the ratio value preset in the UWOC network, and proceeds to step S53.
S53, second initialization broadcast phase B2(Broadcast 2): omnidirectionally broadcasting downlink data set S to NCH node of the layer through current CH nodeD。
In step S53, the NCH node locates itself by three-dimensional AOA estimation, which is a relative location method, using the CH node as a circular point and the location information of the NCH node relative to the CH node.
In steps S51-S53, if the current CH node is the first node of the layer, the downlink data set SDThe method comprises the steps of obtaining instruction information, position information of a node, acceleration information and node depth information; if the current CH node is not the first node of the layer, the downlink data set SDThe method comprises instruction information, position information, acceleration information and node depth information of the node and all uplink nodes of the node.
S54, second initialization uplink stage U2(Upload 2): transmitting an uplink data set S to a current CH node through an NCH node of the layerUAnd avoid data collision through OCDMA (Optical Code Division Multiple Access).
In step S54, the NCH node transmits an uplink data set S to the current CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information and the node depth information of the node.
S55, first initialization ascending stage U1(Upload 1): transmitting an upstream data set S to its upstream CH node through a current CH nodeUAnd avoid data collision by OFDM (Orthogonal Frequency Division Multiplexing).
In step S55, the uplink data set S transmitted from the current CH node to its uplink CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information and the node depth information of the node and all downlink nodes of the node.
And S6, updating the currently selected CH node.
The step S6 includes the following substeps S61-S65:
s61, update downlink stage d (download): transmitting downlink data set S to its downlink CH node through current CH nodeD。
S62, first update broadcast phase B1(Broadcast 1): omnidirectionally broadcasting downlink data set S to the rest of CH nodes of the layer through the current CH nodeD。
Unlike step S52, in step S62, the CSMA/CA operation is not performed, and the time slot is transferred to the CH node in this step through the initialized CH node or the CH node of the previous round of update in step S5.
S63, second update broadcast phase B2(Broadcast 2): omnidirectionally broadcasting downlink data set S to NCH node of the layer through current CH nodeD。
In step S63, the NCH node locates itself by three-dimensional AOA estimation, which is a relative location method, using the CH node as a circular point and the location information of the NCH node relative to the CH node.
In steps S61-S63, if the current CH node is the first node of the layer, the downlink data set SDThe method comprises the steps of obtaining instruction information, position information of a node, acceleration information, node depth information and residual energy information; if the current CH node is not the first node of the layer, the downlink data set SDThe method comprises instruction information, position information of the node and all uplink nodes of the node, acceleration information, node depth information and residual energy information.
S64, second updating uplink stage U2(Upload 2): transmitting an uplink data set S to a current CH node through an NCH node of the layerUAnd avoid data collision through OCDMA.
In step S64, the NCH node transmits an uplink data set S to the current CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information, the node depth information and the residual energy information of the node.
S65, first updating uplink stage U1(Upload 1): transmitting an upstream data set S to its upstream CH node through a current CH nodeUAnd data collision is avoided through OFDM.
In step S65, the uplink data set S transmitted from the current CH node to its uplink CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information, the node depth information and the residual energy information of the node and all downlink nodes of the node.
In the embodiment of the present invention, if a CH node is not updated in the corresponding time sequence, the CH node needs to wait until all layers of the UWOC network are updated after the time sequence is initialized and updated, that is, the CH node needs to wait until the next round of updating, and the time sequence after all CH nodes in the UWOC network are initialized or updated is called a round.
In the embodiment of the invention, no matter uplink or downlink, data are transmitted between the CH node and the CH node through the LD light source, and data are transmitted between the CH node and the NCH node through the LED light source.
S7, judging whether all CH nodes of the current layer have passed the initialization and updating time sequence, if yes, entering step S8, otherwise, selecting the most advanced CH node which has not passed the initialization and updating time sequence, and returning to step S5.
S8, judging whether each layer CH node in UWOC network has already initialized and updated time sequence, if yes, ending the adaptive clustering and updating process of node, otherwise selecting the front layer without initialized and updated time sequence in UWOC network, and returning to step S4.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.

Claims (7)

1. A node self-adaptive clustering and updating method applied to a UWOC network is characterized by comprising the following steps:
s1, dividing all nodes in the UWOC network into m layers, wherein m is more than or equal to 2;
s2, performing CH election on each layer of nodes, and dividing the nodes into CH nodes and NCH nodes;
s3, selecting a first layer in the UWOC network;
s4, selecting the first CH node of the current layer;
s5, initializing the currently selected CH node;
s6, updating the currently selected CH node;
s7, judging whether all CH nodes of the current layer have passed the initialization and updating time sequence, if yes, entering the step S8, otherwise, selecting the most advanced CH node which has not passed the initialization and updating time sequence of the current layer, and returning to the step S5;
s8, judging whether each layer of CH nodes in the UWOC network has been initialized and updated in time sequence, if yes, ending the adaptive clustering and updating process of the nodes, otherwise, selecting the top layer which has not been initialized and updated in time sequence in the UWOC network, and returning to the step S4;
the step S5 includes the following sub-steps:
s51, initializing a downlink stage: transmitting downlink data set S to its downlink CH node through current CH nodeD；
S52, first initial broadcast stage: omnidirectionally broadcasting downlink data set S to the rest of CH nodes of the layer through the current CH nodeD；
S53, second initialization broadcast stage: omnidirectionally broadcasting downlink data set S to NCH node of the layer through current CH nodeD；
S54, second initialization uplink stage: transmitting an uplink data set S to a current CH node through an NCH node of the layerUAnd avoid data collision through OCDMA;
s55, a first initialization uplink stage: transmitting an upstream data set S to its upstream CH node through a current CH nodeUAnd avoid data collision through OFDM;
in the steps S51 to S53, if the current CH node is the first node of the layer, the downlink data set SDThe method comprises the steps of obtaining instruction information, position information of a node, acceleration information and node depth information; if the current CH node is not the first node of the layer, the downlink data set SDThe method comprises the steps of obtaining instruction information, position information, acceleration information and node depth information of a node and all uplink nodes of the node;
in step S54, the NCH node transmits an uplink data set S to the current CH nodeUAcquisition data comprising a NCH node, such a nodePosition information, acceleration information, and node depth information of the node;
in step S55, the uplink data set S transmitted from the current CH node to its uplink CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information and the node depth information of the node and all downlink nodes of the node.
2. The method for adaptive clustering and updating of nodes according to claim 1, wherein the method for performing CH election on each layer of nodes in step S2 specifically comprises:
distributing a random number between 0 and 1 for each node, if the random number distributed to a certain node is smaller than a threshold value T (i), selecting the node as a CH node, and if not, selecting the node as an NCH node;
the setting formula of the threshold value T (i) is as follows:
Figure FDA0002367941910000021
wherein P represents the proportion of CH nodes in all nodes, r represents the election round number, r.mod (1/P) represents the number of nodes which are selected as CH nodes in each round of election, and rhoiRepresenting the node density of the ith node, diDenotes the distance of the ith node to the water surface, dmaxRepresenting the distance of the bottommost node to the surface, EiThe residual energy of the ith node is represented, E represents the initial energy of the node, and i is 1, 2.
3. The method for node adaptive clustering and updating as claimed in claim 1, wherein the time slot is divided between the current CH node and the remaining CH nodes using CSMA/CA protocol in step S52, and if the CH node allocated to the time slot in this step does not reach the UWOC network preset ratio value, the time slot division operation of step S52 is repeated until the CH node allocated to the time slot reaches the UWOC network preset ratio value, and then step S53 is performed.
4. The method for adaptive clustering and updating according to claim 1, wherein the step S6 comprises the following substeps:
s61, updating the downlink stage: transmitting downlink data set S to its downlink CH node through current CH nodeD；
S62, first update broadcast phase: omnidirectionally broadcasting downlink data set S to the rest of CH nodes of the layer through the current CH nodeD；
S63, second update broadcast phase: omnidirectionally broadcasting downlink data set S to NCH node of the layer through current CH nodeD；
S64, second updating uplink stage: transmitting an uplink data set S to a current CH node through an NCH node of the layerUAnd avoid data collision through OCDMA;
s65, a first updating uplink stage: transmitting an upstream data set S to its upstream CH node through a current CH nodeUAnd data collision is avoided through OFDM.
5. The method of claim 4, wherein the step S62 is performed by transferring the time slot to the CH node in the step S5 via the initialized CH node or the CH node of the previous round of updating in the step S5.
6. The method for adaptive clustering and updating of nodes of claim 4, wherein in steps S61-S63, if the current CH node is the first node in the hierarchy, the downlink data set S isDThe method comprises the steps of obtaining instruction information, position information of a node, acceleration information, node depth information and residual energy information; if the current CH node is not the first node of the layer, the downlink data set SDThe method comprises the steps of obtaining instruction information, position information of a node and all uplink nodes of the node, acceleration information, node depth information and residual energy information;
in step S64, the NCH node transmits an uplink data set S to the current CH nodeUThe method comprises the steps of acquiring data of an NCH node, position information, acceleration information, node depth information and residual energy information of the node;
in step S65, the uplink data set S transmitted from the current CH node to its uplink CH nodeUThe method comprises the acquisition data of the NCH node, the position information, the acceleration information, the node depth information and the residual energy information of the node and all downlink nodes of the node.
7. The method for node adaptive clustering and updating according to any one of claims 1-6, wherein data is transmitted between the CH node and the CH node via LD light source, and data is transmitted between the CH node and the NCH node via LED light source.
CN201811189003.9A 2018-10-12 2018-10-12 Node self-adaptive clustering and updating method applied to UWOC network Active CN109150714B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811189003.9A CN109150714B (en) 2018-10-12 2018-10-12 Node self-adaptive clustering and updating method applied to UWOC network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811189003.9A CN109150714B (en) 2018-10-12 2018-10-12 Node self-adaptive clustering and updating method applied to UWOC network

Publications (2)

Publication Number Publication Date
CN109150714A CN109150714A (en) 2019-01-04
CN109150714B true CN109150714B (en) 2020-06-23

Family

ID=64811447

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811189003.9A Active CN109150714B (en) 2018-10-12 2018-10-12 Node self-adaptive clustering and updating method applied to UWOC network

Country Status (1)

Country Link
CN (1) CN109150714B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110149672B (en) * 2019-05-24 2022-09-23 贵州大学 Improved I-LEACH route communication method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106028398A (en) * 2016-06-21 2016-10-12 俞潮军 Underwater wireless sensor network topology control method based on energy consumption balance
CN107148088A (en) * 2017-05-11 2017-09-08 哈尔滨工业大学（威海） Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106028398A (en) * 2016-06-21 2016-10-12 俞潮军 Underwater wireless sensor network topology control method based on energy consumption balance
CN107148088A (en) * 2017-05-11 2017-09-08 哈尔滨工业大学（威海） Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
水声传感器网络簇头分层通信模式路由算法;马绅惟等;《计算机***应用》;20141215;第23卷(第12期);166-167 *

Also Published As

Publication number Publication date
CN109150714A (en) 2019-01-04

Similar Documents

Publication Publication Date Title
CN101843164B (en) Method and apparatus for improved data demodulation in a wireless communication network
US7529222B2 (en) Method and apparatus for medium access control for a decentralized network with adapted beamforming and power control
CN105531959B (en) For the reference signal distribution of flexible data length
CN102812774A (en) Method and apparatus for signaling transmission characteristics in a wireless communication network
CN113841346B (en) Method for reporting beam information in wireless communication system and apparatus therefor
CN113647175B (en) Method for performing uplink transmission using preconfigured resources in wireless communication system and apparatus therefor
CN107078869A (en) Hopping Pattern for synchronizing signal
JP6302069B2 (en) System and method for increasing low density signature space
TW200935858A (en) Communication device and method for synchronisation
CN109150714B (en) Node self-adaptive clustering and updating method applied to UWOC network
CN111294137A (en) Multi-channel transmission scheduling method based on time domain interference alignment in underwater acoustic network
Kotsiou et al. Blacklisting-based channel hopping approaches in low-power and lossy networks
US20200314841A1 (en) Systems and methods for scaling short range local area networks using dual interfaced first hub nodes and transmission schedule mapping
JP2018064267A5 (en) Transmitting apparatus and transmitting method
WO2022186942A1 (en) Machine learning aided location-based downlink interference assistance information
KR101527151B1 (en) System and method for scheduling distributed depth-based tdma slot in industrial wireless sensor network
Xiao et al. Integrating LoRa collision decoding and MAC protocols for enabling IoT massive connectivity
US11502915B2 (en) Transmission of known data for cooperative training of artificial neural networks
Su et al. OSPG‐MAC: An OFDMA‐Based Subcarrier Pregrouping MAC Protocol for Underwater Acoustic Wireless Sensor Networks
WO2023197300A1 (en) Apparatus and methods for multi-stage machine learning with cascaded models
CN115190544B (en) QoS-based Internet of vehicles network slice and NOMA clustering joint optimization method
CN110958044B (en) Non-orthogonal multiple access user clustering method based on density clustering
CN109618409B (en) Self-organizing neighborhood information interaction method oriented to unmanned system
WO2020127593A1 (en) Bidirectional scheduling in low-power wide-area networks
WO2024119350A1 (en) Methods and apparatuses for transmitting neural network parameters for artificial intelligence or machine learning model training

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