CN106992932A - A kind of underwater acoustic network method for routing foundation of energy consumption balance - Google Patents
A kind of underwater acoustic network method for routing foundation of energy consumption balance Download PDFInfo
- Publication number
- CN106992932A CN106992932A CN201710325526.0A CN201710325526A CN106992932A CN 106992932 A CN106992932 A CN 106992932A CN 201710325526 A CN201710325526 A CN 201710325526A CN 106992932 A CN106992932 A CN 106992932A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- communication
- nodes
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of underwater acoustic network method for routing foundation of energy consumption balance, each node is equipped with pressure sensor, itself depth information can be obtained, for the current Reward Program of communication definitions and future returns function of node, consider end-to-end delay and residue energy of node simultaneously in Reward Program, two kinds of Reward Program compositions are acted into utility function again, next-hop node is determined by solving maximum utility value, communication process is divided into fl transmission stage and passback stage, the fl transmission stage is used for source node and sends communication request to sink nodes and collect the information of other nodes between two, Sink node carries out path planning using the information, the path of planning and communication request are identified through the passback stage again and are sent to source node, then begin to packet transmission.
Description
Technical field
The present invention relates to route Protocol Design Method in underwater sensor network.
Background technology
In recent years, underwater sound sensor network (Underwater Acoustic Sensor Networks, UASNs)
It is used widely in terms of setting Data Collection in business exploration, aquatile research, ocean.Wireless sensor network technology exists
Land has obtained tremendous development, however, due to the exclusive characteristic of marine environment so that land wireless sensor network it is logical
Letter technology is difficult to apply to UASNs.For example：Land is that wireless sensor network uses radio communication, and spread speed is up to 3
×108m/s.But due to there is abundant electrolyte in seawater, electromagnetic wave is difficult in water have effect spread.Up to now, uniquely
Effective transmission medium is sound wave, and spread speed is much smaller than electromagnetic wave, so, the characteristics of underwater sound communication has long delay.In addition,
Underwater sound sensor is powered using battery, and needs to be deployed in tens meters even in the seawater of hundreds of meters of depths, and this greatly increases
The difficulty for replacing sensor battery is added.Once the sensor node energy content of battery exhausts, the node will lose communication capacity, shadow
Ring network communication quality.
First, the present invention by network life cycle be defined as network start working to first node energy exhaust when
It is long.Generally, UASNs can select to be delayed most short path as optimal path in path planning.Due to most data packets all
Prolong optimal path to propagate, the node energy consumption on the path will be above the node on non-optimal path, cause the section on optimal path
Point premature death, reduces network life cycle.
The content of the invention
In view of the above-mentioned problems, the present invention proposes a kind of method for routing foundation of energy consumption balance.When certain section on optimal path
When point dump energy is relatively low, by selecting delay longer, but the more sub-optimal path energy balances of node energy, it is to avoid node mistake
It is early dead, so as to extend network life cycle.The present invention proposes a kind of underwater acoustic network method for routing foundation of energy consumption balance, node
By the water surface to using layering deployment, source node under water produces packet and sent to the sink nodes of the water surface under water.Main step
It is rapid as follows：
A kind of underwater acoustic network method for routing foundation of energy consumption balance, each node is equipped with pressure sensor, can obtain
Own depth information, is the current Reward Program of communication definitions and future returns function of node, is considered simultaneously in Reward Program
End-to-end delay and residue energy of node, then two kinds of Reward Program compositions are acted into utility function, by solving maximum utility value
To determine next-hop node, communication process is divided into fl transmission stage and passback stage, the fl transmission stage be used for source node to
Sink nodes send communication request and collect the information of other nodes between two, and Sink node carries out path planning using the information,
The path of planning and communication request are identified through the passback stage again and are sent to source node, packet transmission is then begun to, specifically
Comprise the following steps：
(1) when thering is packet to need transmission positioned at source node under water, sent by broadcast data packet and ask and carry out
Information, this node broadcasts forward data bag FP to its neighbor node, including type of data packet and ID, source node address
Storage forward node in the dump energy of each forward node, C is deposited in SNA, time stamp T S, two array C and RES, RES to press
Formula, the energy consumption associated costs calculatedWith delay associated costs ct (tij)：
WhereinFor the primary power of node,For dump energy, tijReach what node j needed from node i for packet
Duration, receives FP node depth if less than upper hop, then data is extracted from packet, according to packet receive the time and
Timestamp obtains time delay, then calculates two kinds of cost functions, follow-up result of calculation and dump energy information are added into packet
Continuous broadcast；
(2) node i is defined as follows to the node j successful probability of communication and corresponding Reward Program：
The probability of communication failure and corresponding Reward Program are：
Wherein MtAnd mtCut-off time t is represented respectively, and the communication total degree that node i and node j are initiated and communication are successful
Number of times, β0The intrinsic cost of communication is initiated for node, is mainly caused by the interference to other nodes and channel occupancy；β1、β2For two
Plant the weight shared by cost summation, β1、β2It is worth bigger, energy consumption associated costsWith delay associated costs ct (tij) to route
The influence of foundation is more notable；Represent delay sensitive degree：It is smaller, it is fewer to the consideration of time delay in path planning；Two nodes
The current Reward Program of communication is defined as：
(3) definition node i sends the utility function Q of packet to node j：
Wherein, r is current cost, Q* (xj) and Q* (xi) be respectively node i communicated with node j successfully and failure after most
Big value of utility；Equation right-hand member Section 2 is the future returns functional value of this communication, and γ is discount factor, 0 ＜ γ ＜ 1, and γ is got over
Show that future returns functional value is more important greatly, generally, γ takes the arbitrary value between [0.5,0.99]；
FP is reached after the sink nodes of the water surface, if sink nodes agree to the request, each forwarding is obtained from packet
The dump energy and cost of node, if the dump energy of node is sufficient, sink nodes calculate every since source node according to formula
The value of utility of individual neighbor node, selection has the neighbor node of maximum utility value as the next-hop of the node, until next-hop
For sink nodes, thus obtained path is optimal path；If a certain node, i is set to, dump energy is less than a certain threshold
Value, sink nodes are by parameterIt is adjusted toWherein N is
The set of all neighbor node compositions of node i,Path planning is carried out according still further to formula, will now obtain being delayed longer,
But the more sub-optimal path of dump energy；
(4) sink nodes generation return data bag BP, includes type of data packet and ID, destination node address D NA and planning
The routing information gone out；Wherein DNA is the source node address SNA in FP, and routing information is with the timestamp in FP and two arrays
Based on the information of carrying, BP is transmitted along the selected path of sink nodes to source node, and other participate in broadcast FP but positioned at institute
Node outside routing footpath can enter resting state to save energy consumption；
(5) BP reach source node after, source node send the requests to transmitting path of the packet of sink nodes along BP to
Sink nodes are sent；
(6) sink nodes send to source node after successful data reception bag and confirm packet ACK, and source node receives ACK
Afterwards, sign off.
The present invention devises fl transmission stage and passback stage, and the fl transmission stage is used for source node and sent out to sink nodes
Send communication request and collect the information of other nodes between two.Sink node carries out path planning using the information, then by planning
Path and communication request are identified through the passback stage and are sent to source node, then begin to packet transmission.The present invention is applied to length
Delay, the UASNs that node energy is limited and network load is larger, can extend network on the premise of end-to-end delay is controlled
Life cycle.
Brief description of the drawings
Fig. 1 is packet structure schematic diagram
Fig. 2 is flow chart of the present invention
Embodiment
The present invention proposes a kind of underwater acoustic network method for routing foundation of energy consumption balance, and node is by the water surface under water using layering
Deployment, source node under water produces packet and sent to the sink nodes of the water surface.Sensor node is by being equipped with pressure sensing
Device, can know the depth information residing for itself.Source node is produced and sent out in a broadcast manner to sink nodes first after packet
Request is sent, while collector node status information.During being somebody's turn to do, for control flooding areas, only depth is less than the node of upper hop
Participate in broadcast.Sink node is received after request, if agreeing to set up communication, nodal information is extracted from packet and carries out path rule
Draw, and confirm along the path of planning to source node passback request.Receive after request confirmation, source node starts to send packet.Connect
After the ACK for receiving sink nodes, sign off.
Key step is as follows：
1. when thering is packet to need transmission positioned at source node under water, sent by broadcast data packet and ask and believed
Breath is collected.The node broadcasts forward data bag (FP) to its neighbor node, including type of data packet and ID, source node address
(SNA), timestamp (TS), two arrays C and RES.The dump energy of each forward node is deposited in RES.Forward node is deposited in C
By formula, the cost function value calculated.
WhereinFor the primary power of node,For dump energy, tijReaching node j from node i for packet needs
Duration.FP node depth is received if less than upper hop, then data are extracted from packet, the time is received according to packet
Time delay is obtained with timestamp, then calculates two kinds of cost functions, after result of calculation and dump energy information are added into packet
Continue to broadcast.
2. node i is defined as follows to the successful probability of node j communications and corresponding return：
The probability of communication failure and corresponding Reward Program are：
Wherein MtAnd mtCut-off time t is represented respectively, and the communication total degree that node i and node j are initiated and communication are successful
Number of times.β0The intrinsic cost of communication is initiated for node, is mainly caused by the interference to other nodes and channel occupancy.β1For two kinds
Weight shared by cost summation.Represent delay sensitive degree：It is smaller, it is fewer to the consideration of time delay in path planning.Institute
So that the current return of two nodes communication is defined as：
3. the utility function Q that node i sends packet to node j is defined as below in the present invention：
Wherein, r is current cost, Q* (xj) and Q* (xi) be respectively node i communicated with node j successfully and failure after most
Big value of utility.Obviously, equation right-hand member Section 2 is the future returns value of this communication, and γ is discount factor, 0 ＜ γ ＜ 1.γ is got over
Show that future returns value is more important greatly, generally, γ takes the arbitrary value between [0.5,0.99].
FP is reached after the sink nodes of the water surface, if sink nodes agree to the request, each forwarding is obtained from packet
The dump energy and cost of node.If the dump energy of node is sufficient, sink nodes calculate every since source node according to formula
The value of utility of individual neighbor node, selection has the neighbor node of maximum utility value as the next-hop of the node, until next-hop
For sink nodes.Thus obtained path is optimal path；If a certain residue energy of node is less than a certain threshold value, such as node
I, sink node are by parameterIt is adjusted toWherein N is the collection of all neighbor node compositions of node i
Close,Path planning is carried out according still further to formula, will now obtain being delayed longer, but the more suboptimum road of dump energy
Footpath.
4.sink nodes generation return data bag (BP), comprising type of data packet and ID, destination node address (DNA) and rule
The routing information marked.Wherein DNA is the SNA in FP, the letter that routing information is carried with the timestamp in FP and two arrays
Based on breath, FP and BP packet structure such as Fig. 1.BP is transmitted along the selected path of sink nodes to source node.Other ginsengs
Node with broadcast FP but outside selected path can enter resting state to save energy consumption.
5.BP reach source node after, source node send the requests to transmitting path of the packet of sink nodes along BP to
Sink nodes are sent.
Finally, sink nodes send to source node after successful data reception bag and confirm packet (ACK).Source node is received
To after ACK, sign off.
Claims (1)
1. a kind of underwater acoustic network method for routing foundation of energy consumption balance, each node is equipped with pressure sensor, it can be obtained from
Body depth information, is the current Reward Program of communication definitions and future returns function of node, considers end simultaneously in Reward Program
Act utility functions to end delay and residue energy of node, then by two kinds of Reward Program compositions, by solve maximum utility value come
Determine next-hop node, communication process is divided into fl transmission stage and passback stage, the fl transmission stage be used for source node to
Sink nodes send communication request and collect the information of other nodes between two, and Sink node carries out path planning using the information,
The path of planning and communication request are identified through the passback stage again and are sent to source node, packet transmission is then begun to, specifically
Comprise the following steps：
(1) when thering is packet to need transmission positioned at source node under water, request is sent by broadcast data packet and gone forward side by side row information
Collect, this node broadcasts forward data bag FP to its neighbor node, including type of data packet and ID, source node address SNA,
Deposited in time stamp T S, two array C and RES, RES in the dump energy of each forward node, C deposit forward node by formula, based on
The energy consumption associated costs of calculationWith delay associated costs ct (tij)：
WhereinFor the primary power of node,For dump energy, tijIt is packet from when node i reaches that node j needs
It is long, receive FP node depth if less than upper hop, then data extracted from packet, according to packet receive the time and when
Between stamp obtain time delay, then calculate two kinds of cost functions, continue after result of calculation and dump energy information to be added to packet
Broadcast；
(2) node i is defined as follows to the node j successful probability of communication and corresponding Reward Program：
The probability of communication failure and corresponding Reward Program are：
Wherein MtAnd mtCut-off time t is represented respectively, and the communication total degree that node i and node j are initiated and communication are successfully secondary
Number, β0The intrinsic cost of communication is initiated for node, is mainly caused by the interference to other nodes and channel occupancy；β1、β2For two kinds
Weight shared by cost summation, β1、β2It is worth bigger, energy consumption associated costsWith delay associated costs ct (tij) route is built
Vertical influence is more notable；Represent delay sensitive degree：It is smaller, it is fewer to the consideration of time delay in path planning；Two nodes lead to
The current Reward Program of letter is defined as：
(3) definition node i sends the utility function Q of packet to node j：
Wherein, r is current cost, Q* (xj) and Q* (xi) it is respectively the maximum effect that node i is communicated with node j successfully and after failure
With value；Equation right-hand member Section 2 is the future returns functional value of this communication, and γ is discount factor, 0 ＜ γ ＜ 1, the bigger tables of γ
Bright future returns functional value is more important, generally, and γ takes the arbitrary value between [0.5,0.99]；
FP is reached after the sink nodes of the water surface, if sink nodes agree to the request, each forward node is obtained from packet
Dump energy and cost, if the dump energy of node is sufficient, sink nodes calculate each adjacent since source node according to formula
The value of utility of node is occupied, selection has the neighbor node of maximum utility value as the next-hop of the node, until next-hop is
Sink nodes, thus obtained path is optimal path；If a certain node, i is set to, dump energy is less than a certain threshold value,
Sink nodes are by parameterIt is adjusted toWherein N is section
The set of all neighbor node compositions of point i,Path planning is carried out according still further to formula, will now obtain being delayed longer, but
The more sub-optimal path of dump energy；
(4) sink nodes generation return data bag BP, comprising type of data packet and ID, destination node address D NA and is cooked up
Routing information；Wherein DNA is the source node address SNA in FP, and routing information is carried with the timestamp in FP and two arrays
Information based on, BP is transmitted along the selected path of sink nodes to source node, and other participate in broadcast FP but positioned at institute's routing
Node outside footpath can enter resting state to save energy consumption；
(5) BP is reached after source node, and source node sends the requests to transmitting path of the packet of sink nodes along BP to sink
Node is sent；
(6) sink nodes are sent to source node after successful data reception bag and confirm packet ACK, and source node is received after ACK,
Sign off.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710325526.0A CN106992932B (en) | 2017-05-10 | 2017-05-10 | Underwater acoustic network route establishing method with balanced energy consumption |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710325526.0A CN106992932B (en) | 2017-05-10 | 2017-05-10 | Underwater acoustic network route establishing method with balanced energy consumption |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106992932A true CN106992932A (en) | 2017-07-28 |
| CN106992932B CN106992932B (en) | 2021-04-13 |
Family
ID=59418722
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710325526.0A Expired - Fee Related CN106992932B (en) | 2017-05-10 | 2017-05-10 | Underwater acoustic network route establishing method with balanced energy consumption |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106992932B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108419304A (en) * | 2018-03-29 | 2018-08-17 | 深圳智达机械技术有限公司 | A kind of wireless sensor network (WSN) water quality monitoring system |
| CN108600978A (en) * | 2018-03-29 | 2018-09-28 | 深圳汇通智能化科技有限公司 | Atmosphere pollution environment acquisition processing system based on block chain technology |
| CN108668251A (en) * | 2018-03-29 | 2018-10-16 | 深圳大图科创技术开发有限公司 | A kind of cabinet micro-environment intelligent monitor system |
| CN110113796A (en) * | 2019-04-22 | 2019-08-09 | 天津大学 | The water sound sensor network route decision method of adaptive energy consumption and delay |
| CN110519819A (en) * | 2019-08-19 | 2019-11-29 | 西北工业大学 | A kind of communication means of the water sound sensor network Routing Protocol based on layering |
| CN110768909A (en) * | 2019-11-07 | 2020-02-07 | 吉林大学 | Routing method and device in underwater acoustic communication network |
| CN110798401A (en) * | 2019-10-24 | 2020-02-14 | 天津大学 | Path selection method based on residual energy and geographic position |
| CN111586786A (en) * | 2020-04-19 | 2020-08-25 | 中国电子科技集团公司电子科学研究院 | Ocean stereo sensing network routing method, device and storage medium |
| CN111866982A (en) * | 2020-06-19 | 2020-10-30 | 青海师范大学 | Energy balance underwater acoustic network routing protocol method based on layering |
| CN113079092A (en) * | 2021-03-29 | 2021-07-06 | 河海大学 | Method for inhibiting repeated forwarding of data by chance route of underwater acoustic network |
| CN113783628A (en) * | 2021-09-13 | 2021-12-10 | 广东技术师范大学 | Underwater acoustic communication route determining method and system based on peak information age |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106506360A (en) * | 2016-11-11 | 2017-03-15 | 华北电力大学（保定） | A kind of fiber optic network route equalization method based on link dynamic load |
| CN106506361A (en) * | 2016-11-17 | 2017-03-15 | 河海大学常州校区 | A kind of underwater sound sensing network routing algorithm and system using mediation potential field |
-
2017
- 2017-05-10 CN CN201710325526.0A patent/CN106992932B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106506360A (en) * | 2016-11-11 | 2017-03-15 | 华北电力大学（保定） | A kind of fiber optic network route equalization method based on link dynamic load |
| CN106506361A (en) * | 2016-11-17 | 2017-03-15 | 河海大学常州校区 | A kind of underwater sound sensing network routing algorithm and system using mediation potential field |
Non-Patent Citations (2)
| Title |
|---|
| 张甜甜: "UWSNs中水声通信的关键参数优化研究", 《中国优秀硕士学位论文全文数据库（信息科技辑）》 * |
| 张红军: "UWSNs中基于深度调整的混合型路由协议", 《计算机工程与设计》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108419304A (en) * | 2018-03-29 | 2018-08-17 | 深圳智达机械技术有限公司 | A kind of wireless sensor network (WSN) water quality monitoring system |
| CN108600978A (en) * | 2018-03-29 | 2018-09-28 | 深圳汇通智能化科技有限公司 | Atmosphere pollution environment acquisition processing system based on block chain technology |
| CN108668251A (en) * | 2018-03-29 | 2018-10-16 | 深圳大图科创技术开发有限公司 | A kind of cabinet micro-environment intelligent monitor system |
| CN110113796A (en) * | 2019-04-22 | 2019-08-09 | 天津大学 | The water sound sensor network route decision method of adaptive energy consumption and delay |
| CN110519819A (en) * | 2019-08-19 | 2019-11-29 | 西北工业大学 | A kind of communication means of the water sound sensor network Routing Protocol based on layering |
| CN110519819B (en) * | 2019-08-19 | 2022-07-22 | 西北工业大学 | Communication method of underwater acoustic sensor network routing protocol based on layering |
| CN110798401A (en) * | 2019-10-24 | 2020-02-14 | 天津大学 | Path selection method based on residual energy and geographic position |
| CN110768909A (en) * | 2019-11-07 | 2020-02-07 | 吉林大学 | Routing method and device in underwater acoustic communication network |
| CN111586786A (en) * | 2020-04-19 | 2020-08-25 | 中国电子科技集团公司电子科学研究院 | Ocean stereo sensing network routing method, device and storage medium |
| CN111586786B (en) * | 2020-04-19 | 2022-04-22 | 中国电子科技集团公司电子科学研究院 | Ocean stereo sensing network routing method, device and storage medium |
| CN111866982A (en) * | 2020-06-19 | 2020-10-30 | 青海师范大学 | Energy balance underwater acoustic network routing protocol method based on layering |
| CN113079092A (en) * | 2021-03-29 | 2021-07-06 | 河海大学 | Method for inhibiting repeated forwarding of data by chance route of underwater acoustic network |
| CN113079092B (en) * | 2021-03-29 | 2022-04-15 | 河海大学 | Method for inhibiting repeated forwarding of data by chance route of underwater acoustic network |
| CN113783628A (en) * | 2021-09-13 | 2021-12-10 | 广东技术师范大学 | Underwater acoustic communication route determining method and system based on peak information age |
| CN113783628B (en) * | 2021-09-13 | 2022-07-15 | 广东技术师范大学 | Underwater acoustic communication route determining method and system based on peak information age |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106992932B (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106992932A (en) | A kind of underwater acoustic network method for routing foundation of energy consumption balance | |
| CN102256267B (en) | The node clustering method of energy priority in radio sensing network | |
| CN102158938B (en) | Power-adjustable zonal sensor network topology control method | |
| CN104093180B (en) | Wireless sensing network route method based on multi-gateway data transmisison | |
| Magistretti et al. | A mobile delay-tolerant approach to long-term energy-efficient underwater sensor networking | |
| CN102256303B (en) | Wireless sensing net node adaptive load balancing method | |
| CN101364918B (en) | Efficiency reliable routing method based on link quality for multi-hop wireless sensor network | |
| CN104602313B (en) | A kind of environment self-adaption method for routing of maritime search and rescue wireless sense network | |
| CN103974367A (en) | Error-tolerance and multi-path optimization method based on HEED algorithm in wireless sensor network | |
| CN104320829B (en) | Multi-hop ad hoc can dormancy routing algorithm | |
| CN104394566A (en) | Fuzzy decision-based low-power dissipation self-adaption clustering multihop wireless sensor network topology control method | |
| CN109936865A (en) | A kind of mobile sink paths planning method based on deeply learning algorithm | |
| CN103095577B (en) | Context-sensitive Uneven Cluster routing algorithm | |
| CN112188583A (en) | Ocean underwater wireless sensing network opportunistic routing method based on reinforcement learning | |
| Liu et al. | Energy-efficient guiding-network-based routing for underwater wireless sensor networks | |
| CN101640944B (en) | Clustering and multi-hop communication method of wireless sensor | |
| CN109548112A (en) | A kind of wireless sense network distributed routing method based on the various dimensions path quality factor | |
| CN102438290A (en) | Wireless network routing method based on directive antenna | |
| CN104113855A (en) | Channel-based routing algorithm of wireless self-organizing network | |
| CN103152788B (en) | Game-based VMIMO (Virtual Multiple Input Multiple Output) cooperative routing method | |
| CN101286934B (en) | Cross-layer routing method based on multi-node collaborative beam forming in wireless sensor network | |
| CN107969008A (en) | A kind of software definition Sensor Network concentrated route computational methods | |
| CN103179631B (en) | A kind of choose the method that optimal angle carries out sub-clustering | |
| CN105246123A (en) | Improved CARP routing protocol | |
| CN104717752B (en) | A kind of transmitting and scheduling slot allocation method based on data polymerization |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210413 |