CN107148088A - Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid - Google Patents
Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid Download PDFInfo
- Publication number
- CN107148088A CN107148088A CN201710329222.1A CN201710329222A CN107148088A CN 107148088 A CN107148088 A CN 107148088A CN 201710329222 A CN201710329222 A CN 201710329222A CN 107148088 A CN107148088 A CN 107148088A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- mrow
- msub
- energy
- 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
- 238000000034 method Methods 0.000 title claims abstract description 8
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 56
- 238000005265 energy consumption Methods 0.000 claims abstract description 12
- 238000010586 diagram Methods 0.000 claims description 18
- 230000005540 biological transmission Effects 0.000 claims description 12
- 230000004927 fusion Effects 0.000 claims description 11
- 230000000694 effects Effects 0.000 claims description 6
- 230000033001 locomotion Effects 0.000 claims description 6
- 238000013459 approach Methods 0.000 claims description 3
- 238000001514 detection method Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 9
- 230000004083 survival effect Effects 0.000 abstract description 3
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 12
- 238000011161 development Methods 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
Classifications
-
- 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
-
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- 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/26—Route discovery packet
-
- 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
- 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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a sensor network cluster which is uniformly planned by Sink nodes aiming at a plane network formed by underwater isomorphic sensor nodes, and energy balance underwater acoustic communication is realized. The algorithm is based on the mutual positions of the underwater sensor nodes, a grid system which can cover the whole sensor network and is composed of small grids is formed in an imaginary mode, wherein the small grids in the grid system are defined as collecting grids, and the small grids are defined as cluster head grids. The grid system is used to cover the sensor node network, and the nodes under different squares perform different functions. The Sink node calculates the residual energy of the node based on the received data, specifies the moving direction of the grid system, and changes the functions of the node. The method can effectively save node energy consumption, realize energy balance and improve network survival time.
Description
Technical field：
The invention belongs to water sound sensor network communication technical field, it is specifically a kind of according to predetermined cluster rule with
Water sound sensor network method for routing for the purpose of global energy is optimal.According to the remaining energy of each node, united by Sink node
One determines cluster head position during each round transmission, and other nodes solve biography according to the direct cluster of pre-assigned virtual grid
Cluster head broadcasts brought broadcast storm problem and collision problem when node enters cluster in sensor network, has been effectively saved energy
Consumption, improves router efficiency.
Background technology：
Ocean be the mankind survive procreation and social realization sustainable development important base.Develop ocean, development sea
Foreign economy is the only way of whole human survival and social development extremely reality.Underwater sound communication network have transmission rate it is low,
The problems such as propagation distance is short, propagation delay time is high, node energy is limited.At present, countries in the world are to maritime rights and interests pay attention to day by day,
The upsurge whole world rise of ocean is developed, this, which to develop, has high efficiency, short time-delay, the water of long network lifecycle
Lower Wireless Sensor Network Routing Protocol has become the focus of research.Underwater sensor network refer to by energy consumption it is very low, have
The underwater sensor node deployment of shorter communication distance sets up network into specified marine site.Node in network is utilized
The various monitoring informations that sensor is monitored, gathered in network distribution region in real time, after the information processings such as data fusion, pass through tool
Real-time monitoring information is sent to offshore base station or satellite and real time information is passed into use by the Sink node for having long-distance transmissions ability
Family.Because electromagnetic wave is in water transmission, largely absorbed and rapid decay, operating distance is extremely limited；And sound wave is under water
There is good propagation performance.Therefore at this stage, the underwater sound communication using sound wave as carrier be realize underwater wireless communication it is main
Form.
Underwater sound sensing network is extended to from land radio sensing network, but both are very different：
(1) mobility, node under water can be moved with the motion of current, thus underwater sound sensing network must be can
The autonomous network of self-organizing, it then follows certain network routing mode；
(2) dynamic, the topological structure of underwater sound sensing network may exhaust because of failure or electric energy causes sensing
Node failure, the characteristics of causing the real-time change of communication environment；
(3) energy content of battery is limited, under water in environment, and it is not that node, which wants to supplement the energy by way of changing battery,
Reality, thus how more efficient use energy and to extend network lifecycle as far as possible be very big challenge.
For these features of underwater sound sensing network, existing water sound sensor network Routing Protocol research is main with geography
Based on Routing Protocol.This class agreement realizes route using the geography information of node, brings the advantage that router efficiency is higher.Most
Ideally the geographical location information of each node is known mutually under water, and forward node can oneself one orderliness of selection
The forward-path thought, but be difficult to realize under water.Reason is not positioned by GPS under water, so that node
Its position can only be resolved by location algorithm, and this then needs each node to exchange periodically positional information, seriously consumes node
Energy, on network lifetime influence it is huge.
The present invention is to be based on virtual net trrellis diagram corresponding with node location, by Sink node according to the energy consumption of each node to whole
Individual network carries out uniformly clustering operation networking, the method being route on this basis.Theory analysis shows that this method can be most
The energy of each node in network is saved in big degree, balancing energy is realized.
The content of the invention：
Planar network of the invention for the composition of isomorphism sensor node under water is there is provided one kind by Sink node unified planning
Sensor network sub-clustering, the balancing energy underwater acoustic communication method planned as a whole from high level.In order to make full use of the spy of underwater sound communication
Point, mutual alignment of the algorithm based on underwater sensor node, fabricate one can cover whole sensor network by lattice
Lattice in the grid chart of composition, grid chart assigns different function definition, and some definition are collection grid, and some definition are
Cluster head grid.With grid map combining sensor node network, the node below collection grid exercises acquisition function, in cluster
Node below head grid exercises convergence, fusion, forwarding capability.Due to leader cluster node power consumption quickly, in order to extend its Life Cycle
After phase, a period of time, system will dispatch node task again, according to node and the corresponding relation of virtual grid, saved by Sink
The specified cluster head rotation moving direction of point, is easy to plan as a whole and final-period management；In order to reduce the energy consumption of whole network, network is made as far as possible
Time-to-live is most long, and the dump energy that data of the Sink node based on reception carry out node is calculated, and then determines moving direction, this
Mode can reasonably determine that the cluster head for being best suitable for sensor network unifies alternating mode, effectively save each node energy consumption, realize energy
Amount is balanced, improves network survival time.
The technical solution adopted by the present invention is：
The first step：Network node of underwater sensor is laid, and grappling is carried out to network node of underwater sensor by anchor chain, its
Range of movement is relatively fixed, node approaches uniformity distribution, to each one exclusive ID of node distribution；
Second step：Node actual distribution in sensor network, whole sensor network can be covered by fabricating one
The grid chart being made up of lattice, one node of each lattice correspondence in virtual net trrellis diagram, and the motion of size and node
Scope is consistent；
3rd step：Adjacent lattice in virtual net trrellis diagram is divided into different cluster units, according to virtual net trrellis diagram
Scale, determines the size of sub-clustering, the interstitial content of all clusters is unanimously N, so, each cluster unit defined in virtual grid
Size isAndFor odd number, cluster head is then in the center of each cluster unit, cluster unit now we determine
Justice is initial cluster unit；
4th step：Lattice in virtual net trrellis diagram and initial cluster unit are numbered, cluster unit is numbered with numeral, cluster
Interior grid alpha code；
5th step：Broadcast frame, three kinds of frame types of control frame and data frame are designed, the effect of broadcast frame is easy for system also
Sensor network is initialized in the case of non-sub-clustering, initial cluster unit distribution is completed, the effect of control frame is that control is whole
Individual sensor network carries out unified cluster head rotation；Data frame is the gathered data that host node is sent to from node, wherein needing bag
ID containing each node, is easy to predict the dump energy of each node exactly in later stage Sink node；
6th step：Sensor network is initialized, and Sink node each node into sensor network is broadcasted, and determines each section
The corresponding lattice of point, affiliated cluster unit and cluster head position；
7th step：Each node is by the cluster head of the information transmission being collected into itself affiliated cluster unit, and cluster head then further will
Information carries out fusion transmission to Sink node in cluster, and cluster head calculates cluster interior nodes energy consumption according to formula (1), and information is transmitted to
Sink node, Sink node calculates cluster head energy consumption according to formula (2), is E if the primary power of all nodes is consistent0；
ECM=l*Eelec+l*εcm_amp*d2 toCH (1)
Wherein, l represents frame length, EelecOften to send or receiving the energy of 1bit data circuit consumption, εcm_ampFor cluster member
To the energy proportion coefficient consumed between cluster head in signal amplifier, dtoCHFor the distance of cluster member to the cluster head；
Wherein, N is cluster unit interior nodes sum, EAFor the energy of fusion 1bit data consumption, data fusion ratio is L：
1, εch_ampFor cluster head to the energy proportion coefficient consumed between base station in signal amplifier, dtoBSFor cluster head to Sink node away from
From；
8th step：Sink node calculates each residue energy of node and carries out next round cluster unit distribution, after T time, will
The dump energy of the lattice corresponding node of same position is overlapped in cluster unit judges for rotation, such as formula (3)
It is shown；
Wherein, s is initial cluster unit interior joint relative position, and i numbers for initial cluster；
9th step：The dump energy of each position corresponding node is superimposed it in the cluster unit calculated according to formula (3)
With, select dump energy and be superimposed position in the maximum cluster of sum, selected position lattice correspondence in all cluster units
Node as next round cluster head, each cluster head rotation moving range can not be beyond the initial cluster unit belonging to oneself, and is elected to
The node of cluster head is not involved in election, and this 2 points are ensured by the lattice numbering set up；
Tenth step：After selected cluster head, then distribute to carry out the cluster unit of this wheel according to the ID of each node.Each cluster unit
Size be stillCluster internal segment points are N；
11st step：Sink node calculates the average energy of all nodesAs whether judging whole sensor network
Dead judgement symbol, ifThe 14th step is then jumped to, the 12nd step is otherwise carried out；
12nd step：Sink node is broadcasted gained cluster head moving direction is calculated in the 6th step, determines cluster head, and
Each affiliated cluster unit of node in this wheel；
13rd step：The step of repeating the 7th step to 12 step；
14th step：When proceeding to this step, illustrate the x of the dump energy of whole network not enough primary power
Times, it substantially normally can not effectively enter the detection and transmission of row information, judge that whole sensor network is dead.
Brief description of the drawings
Fig. 1 is Node distribution schematic diagram；
Fig. 2 is virtual grid initial cluster dividing elements schematic diagram；
Fig. 3 is initialization posterior nodal point and virtual grid corresponding relation schematic diagram；
Fig. 4 is with the sub-clustering schematic diagram of the actual foundation of node ID number；
Fig. 5 is sub-clustering schematic diagram of Fig. 4 states to the first from left lattice after shifted；
Embodiment：
The technical solution adopted by the present invention is：
The first step：Network node of underwater sensor is laid, and grappling is carried out to network node of underwater sensor by anchor chain, its
Range of movement is relatively fixed, node approaches uniformity distribution, to each one exclusive ID of node distribution；
Second step：Node actual distribution in sensor network, whole sensor network can be covered by fabricating one
The grid chart being made up of lattice, one node of each lattice correspondence in virtual net trrellis diagram, and the motion of size and node
Scope is consistent；
3rd step：Adjacent lattice in virtual net trrellis diagram is divided into different cluster units, according to virtual net trrellis diagram
Scale, determines the size of sub-clustering, the interstitial content of all clusters is unanimously 9, and cluster head is in the center of each cluster unit, now
Cluster unit we be defined as initial cluster unit；
4th step：Lattice in virtual net trrellis diagram and initial cluster unit are numbered, cluster unit is numbered with numeral, cluster
Interior grid alpha code；
5th step：Broadcast frame, three kinds of frame types of control frame and data frame are designed, the effect of broadcast frame is easy for system also
Sensor network is initialized in the case of non-sub-clustering, initial cluster unit distribution is completed, the effect of control frame is that control is whole
Individual sensor network carries out unified cluster head rotation；Data frame is the gathered data that host node is sent to from node, wherein needing bag
ID containing each node, is easy to predict the dump energy of each node exactly in later stage Sink node；
6th step：Sensor network is initialized, and Sink node each node into sensor network is broadcasted, and determines each section
The corresponding lattice of point, affiliated cluster unit and cluster head position；
7th step：Each node is by the cluster head of the information transmission being collected into itself affiliated cluster unit, and cluster head then further will
Information carries out fusion transmission to Sink node in cluster, and cluster head calculates cluster interior nodes energy consumption according to formula (1), and information is transmitted to
Sink node, Sink node calculates cluster head energy consumption according to formula (2), is E if the primary power of all nodes is consistent0。
ECM=l*Eelec+l*εcm_amp*d2 toCH (1)
Wherein, l represents frame length, EelecOften to send or receiving the energy of 1bit data circuit consumption, εcm_ampFor cluster member
To the energy proportion coefficient consumed between cluster head in signal amplifier, dtoCHFor the distance of cluster member to the cluster head；
Wherein, N is cluster unit interior nodes sum；EAFor the energy of fusion 1bit data consumption, data fusion ratio is L：
1, εch_ampFor cluster head to the energy proportion coefficient consumed between base station in signal amplifier, dtoBSFor cluster head to Sink node away from
From；
8th step：Sink node calculates each residue energy of node and carries out next round cluster unit distribution, after 1 hour, will
The dump energy of the lattice corresponding node of same position is overlapped in cluster unit judges for rotation, such as formula (3)
It is shown；
Wherein, s is initial cluster unit interior joint relative position, and i numbers for initial cluster；
9th step：The dump energy of each position corresponding node is superimposed it in the cluster unit calculated according to formula (3)
With, select dump energy and be superimposed position in the maximum cluster of sum, selected position lattice correspondence in all cluster units
Node as next round cluster head, each cluster head rotation moving range can not be beyond the initial cluster unit belonging to oneself, and is elected to
The node of cluster head is not involved in election, and this 2 points are ensured by the lattice numbering set up；
Tenth step：After selected cluster head, then distribute to carry out the cluster unit of this wheel according to the ID of each node.Each cluster unit
Size be still 9；
11st step：Sink node calculates the average energy E of all nodes, as judging whether whole sensor network is dead
The judgement symbol died, ifThe 14th step is then jumped to, the 12nd step is otherwise carried out；
12nd step：Sink node is broadcasted gained cluster head moving direction is calculated in the 6th step, determines cluster head, and
Each affiliated cluster unit of node in this wheel；
13rd step：The step of repeating the 7th step to 12 step；
14th step：When proceeding to this step, illustrate the dump energy of whole network not enough primary power
10%, it substantially normally can not effectively enter the detection and transmission of row information, judge that whole sensor network is dead.
Claims (1)
1. the dynamic clustering underwater acoustic network method for routing based on two-dimensional virtual grid, it is characterised in that following steps：
The first step：Network node of underwater sensor is laid, and carries out grappling to network node of underwater sensor by anchor chain, it is moved
Scope is relatively fixed, node approaches uniformity distribution, to each one exclusive ID of node distribution；
Second step：Node actual distribution in sensor network, fabricate one can cover whole sensor network by
One node of each lattice correspondence in the grid chart of lattice composition, virtual net trrellis diagram, and the range of movement of size and node
Unanimously；
3rd step：Adjacent lattice in virtual net trrellis diagram is divided into different cluster units, according to the scale of virtual net trrellis diagram,
The size of sub-clustering is determined, the interstitial content of all clusters is unanimously N, so, the size of each cluster unit defined in virtual grid
ForAndFor odd number, cluster head is then in the center of each cluster unit, cluster unit now we be defined as
Initial cluster unit；
4th step：Lattice in virtual net trrellis diagram and initial cluster unit are numbered, cluster unit is numbered with numeral, side in cluster
Lattice alpha code；
5th step：Broadcast frame, three kinds of frame types of control frame and data frame are designed, the effect of broadcast frame is easy for system and do not divided also
Sensor network is initialized in the case of cluster, initial cluster unit distribution is completed, the effect of control frame, which is that control is whole, to be passed
Sensor network carries out unified cluster head rotation；Data frame is the gathered data that host node is sent to from node, wherein needing comprising each
The ID of node, is easy to predict the dump energy of each node exactly in later stage Sink node；
6th step：Sensor network is initialized, and Sink node each node into sensor network is broadcasted, and determines each node pair
Lattice, affiliated cluster unit and the cluster head position answered；
7th step：Each node is by the information transmission being collected into the cluster head of itself affiliated cluster unit, and cluster head is then further by cluster
Information carries out fusion and sent to Sink node, and cluster head calculates cluster interior nodes energy consumption according to formula (1), and information is transmitted into Sink sections
Point, Sink node calculates cluster head energy consumption according to formula (2), is E if the primary power of all nodes is consistent0；
ECM=l*Eelec+l*εcm_amp*d2 toCH (1)
Wherein, l represents frame length, EelecOften to send or receiving the energy of 1bit data circuit consumption, εcm_ampFor cluster member to cluster
The energy proportion coefficient consumed between head in signal amplifier, dtoCHFor the distance of cluster member to the cluster head；
<mrow>
<msub>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>=</mo>
<mi>l</mi>
<mo>*</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>*</mo>
<mrow>
<mo>(</mo>
<mi>N</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mi>l</mi>
<mo>*</mo>
<msub>
<mi>E</mi>
<mi>A</mi>
</msub>
<mo>*</mo>
<mrow>
<mo>(</mo>
<mi>N</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mfrac>
<mi>l</mi>
<mi>L</mi>
</mfrac>
<mo>*</mo>
<mrow>
<mo>(</mo>
<mi>N</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>*</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<mfrac>
<mi>l</mi>
<mi>L</mi>
</mfrac>
<mo>*</mo>
<mrow>
<mo>(</mo>
<mi>N</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>*</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>c</mi>
<mi>h</mi>
<mo>_</mo>
<mi>a</mi>
<mi>m</mi>
<mi>p</mi>
</mrow>
</msub>
<mo>*</mo>
<msubsup>
<mi>d</mi>
<mrow>
<mi>t</mi>
<mi>o</mi>
<mi>B</mi>
<mi>S</mi>
</mrow>
<mn>2</mn>
</msubsup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, N is cluster unit interior nodes sum, EAFor the energy of fusion 1bit data consumption, data fusion ratio is L：1,
εch_ampFor cluster head to the energy proportion coefficient consumed between base station in signal amplifier, dtoBSFor the distance of cluster head to Sink node；
8th step：Sink node calculates each residue energy of node and carries out next round cluster unit distribution, after T time, by cluster list
The dump energy of the lattice corresponding node of same position is overlapped in member judges for rotation, shown in such as formula (3)；
<mrow>
<msub>
<mi>E</mi>
<mi>s</mi>
</msub>
<mo>=</mo>
<munder>
<mo>&Sigma;</mo>
<mi>i</mi>
</munder>
<msub>
<mi>E</mi>
<mrow>
<mi>s</mi>
<mi>i</mi>
</mrow>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, s is initial cluster unit interior joint relative position, and i numbers for initial cluster；
9th step：The dump energy superposition sum of each position corresponding node, choosing in the cluster unit calculated according to formula (3)
Position in the maximum cluster of dump energy superposition sum is selected out, the corresponding node of position lattice is selected in all cluster units
As next round cluster head, each cluster head rotation moving range can not be beyond the initial cluster unit belonging to oneself, and is elected to cluster head
Node is not involved in election, and this 2 points are ensured by the lattice numbering set up；
Tenth step：After selected cluster head, then distribute to carry out the cluster unit of this wheel according to the ID of each node.Each cluster unit is big
It is small to be stillCluster internal segment points are N；
11st step：Sink node calculates the average energy of all nodesAs judging whether whole sensor network is dead
Judgement symbol, ifThe 14th step is then jumped to, the 12nd step is otherwise carried out；
12nd step：Sink node is broadcasted gained cluster head moving direction is calculated in the 6th step, determines cluster head, and this
Each affiliated cluster unit of node in wheel；
13rd step：The step of repeating the 7th step to 12 step；
14th step：When proceeding to this step, illustrate x times of the dump energy of whole network not enough primary power, base
It normally can not effectively enter the detection and transmission of row information in sheet, judge that whole sensor network is dead.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710329222.1A CN107148088A (en) | 2017-05-11 | 2017-05-11 | Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710329222.1A CN107148088A (en) | 2017-05-11 | 2017-05-11 | Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107148088A true CN107148088A (en) | 2017-09-08 |
Family
ID=59778617
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710329222.1A Pending CN107148088A (en) | 2017-05-11 | 2017-05-11 | Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107148088A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109150714A (en) * | 2018-10-12 | 2019-01-04 | 电子科技大学 | A kind of node self-adapting sub-clustering and update method applied to UWOC network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394571A (en) * | 2014-12-10 | 2015-03-04 | 河海大学常州校区 | Topology control method of wireless sensor network used for monitoring water quality of inland river |
-
2017
- 2017-05-11 CN CN201710329222.1A patent/CN107148088A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394571A (en) * | 2014-12-10 | 2015-03-04 | 河海大学常州校区 | Topology control method of wireless sensor network used for monitoring water quality of inland river |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109150714A (en) * | 2018-10-12 | 2019-01-04 | 电子科技大学 | A kind of node self-adapting sub-clustering and update method applied to UWOC network |
| CN109150714B (en) * | 2018-10-12 | 2020-06-23 | 电子科技大学 | Node self-adaptive clustering and updating method applied to UWOC network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Luo et al. | A survey of routing protocols for underwater wireless sensor networks | |
| Yue et al. | A comprehensive survey on the reliability of mobile wireless sensor networks: Taxonomy, challenges, and future directions | |
| Ayaz et al. | A survey on routing techniques in underwater wireless sensor networks | |
| Gupta et al. | Underwater networked wireless sensor data collection for computational intelligence techniques: issues, challenges, and approaches | |
| Yu et al. | An energy optimization clustering scheme for multi-hop underwater acoustic cooperative sensor networks | |
| Su et al. | Localization and data collection in AUV-aided underwater sensor networks: Challenges and opportunities | |
| CN107548029A (en) | AUV methods of data capture in a kind of underwater sensing network based on sea water stratification | |
| CN104539374A (en) | Hybrid networking method based on water surface sensor network-underwater sound sensor network | |
| CN102883429B (en) | Method and device for tracking move object in sensor network based on directional antenna | |
| Xu et al. | Application of wireless sensor network in water quality monitoring | |
| Gupta et al. | The evolution of data gathering static and mobility models in underwater wireless sensor networks: a survey | |
| CN102802229A (en) | Determination method of QOS (quality of service) route longevity path of wireless sensor network in water environment | |
| Rady et al. | Comprehensive survey of routing protocols for Mobile Wireless Sensor Networks | |
| CN104581870A (en) | Wireless sensor network based on energy acquisition and low-delay routing method thereof | |
| Pujar et al. | Wireless sensor network based water monitoring systems: A survey | |
| CN102413471B (en) | Networking method of wireless grid sensor based on link stability estimation | |
| Menon et al. | Towards Energy‐Efficient and Delay‐Optimized Opportunistic Routing in Underwater Acoustic Sensor Networks for IoUT Platforms: An Overview and New Suggestions | |
| Wajgi et al. | Localization in wireless sensor networks and wireless multimedia sensor networks using clustering techniques | |
| Lu et al. | Routing protocols for underwater acoustic sensor networks: A survey from an application perspective | |
| CN107148088A (en) | Dynamic clustering underwater acoustic network routing method based on two-dimensional virtual grid | |
| CN105744585A (en) | Energy balancing routing computation method based on three-dimensional cube | |
| Arago et al. | Long range communication technology for weather buoy | |
| Gao | Research on Information Sensing and Transmitting Technology for Island Using 5G System | |
| CN102932256A (en) | Positioning and routing method based on DV-Hop (Distance Vector-Hop) positioning mechanism | |
| Gola et al. | Underwater sensor networks: An efficient node deployment technique for enhancing coverage and connectivity: END-ECC |
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: 20170908 |