CN109600812B - Routing method, routing device and sensor - Google Patents
Routing method, routing device and sensor Download PDFInfo
- Publication number
- CN109600812B CN109600812B CN201910128494.4A CN201910128494A CN109600812B CN 109600812 B CN109600812 B CN 109600812B CN 201910128494 A CN201910128494 A CN 201910128494A CN 109600812 B CN109600812 B CN 109600812B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- communication
- neighbor node
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000004891 communication Methods 0.000 claims abstract description 109
- 238000005265 energy consumption Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000004083 survival effect Effects 0.000 description 2
- 241000854291 Dianthus carthusianorum Species 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- 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
-
- 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
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a routing method, a routing device and a sensor, belongs to the technical field of communication, and can at least partially solve the problem of unbalanced energy consumption of the existing routing method. The routing method of the invention comprises the following steps: judging whether the total number of the neighbor nodes is 1 or not under the condition that the neighbor nodes exist; if yes, taking the neighbor node as a next hop node; if not, determining the comprehensive communication benefit of each neighbor node, wherein the comprehensive communication benefit is determined by the difference between the communication benefit and the communication cost; and selecting the neighbor node with the highest communication comprehensive benefit as the next hop node.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a routing method, a routing device and a sensor.
Background
A large number of sensor nodes exist in a wireless sensor network, and are generally deployed in an area to be monitored in a random scattering mode. The sensor nodes are connected together in an ad hoc multi-hop mode. And each sensor node transmits the acquired data to the sink node through other sensors in a multi-hop mode. The sink node collects the information collected by all the sensor nodes and sends the information out through the internet or a mobile communication network.
Each sensor node has limited energy of its own. In the prior art, a clustering method is adopted to divide a wireless sensor network into a plurality of areas, and each area is provided with a sensor as a cluster head and is responsible for collecting data collected by the sensors in the area, summarizing the data and forwarding the data to a sink node. The routing method has the risks that part of the sensor nodes are too fast in energy consumption, and the survival time of the network is too low. Therefore, a new routing method that can uniformly consume energy while ensuring data collection (i.e., communication revenue) is needed.
Disclosure of Invention
The invention at least partially solves the problem of uneven energy consumption of the existing routing method, and provides a routing method, a routing device and a sensor.
According to a first aspect of the present invention, there is provided a routing method, including:
judging whether the total number of the neighbor nodes is 1 or not under the condition that the neighbor nodes exist;
if yes, taking the neighbor node as a next hop node;
if not, determining the comprehensive communication benefit of each neighbor node, wherein the comprehensive communication benefit is determined by the difference between the communication benefit and the communication cost;
and selecting the neighbor node with the highest communication comprehensive benefit as the next hop node.
Optionally, the communication gain of the neighboring node is determined by the following formula:
b is the communication gain of the neighbor node, m is a proportionality coefficient, k is the serial numbers of all neighbor nodes except the current node of the neighbor node, n is the number of the neighbor nodes except the current node of the neighbor node, and p is the number of the neighbor nodes except the current node of the neighbor nodekThe communication success rate of the neighbor node and the kth neighbor node except the current node is obtained.
Optionally, the communication cost of the neighbor node is determined by the following formula:
wherein, F is the communication cost of the neighbor node, H is the shortest hop count from the neighbor node to the sink node, D is the distance from the neighbor node to the current node, C is the centrality of the neighbor node, E1 is the residual energy of the neighbor node, and E2 is the energy density of the neighbor node.
Optionally, the energy density of the neighbor node is determined by the sum of its own remaining energy and the remaining energy of all neighbor nodes of the neighbor node.
According to a second aspect of the present invention, there is provided a routing apparatus, comprising a determining module and a selecting module;
the judging module is used for judging whether the total number of the neighbor nodes is 1 or not under the condition that the neighbor nodes exist;
the selection module is used for taking the neighbor node as a next hop node under the condition that the judgment module judges that the total number of the neighbor nodes is 1, and determining the comprehensive communication benefit of each neighbor node under the condition that the judgment module judges that the total number of the neighbor nodes is not 1, wherein the comprehensive communication benefit is determined by the difference between the communication benefit and the communication cost, and the neighbor node with the highest comprehensive communication benefit is selected as the next hop node.
Optionally, the communication gain of the neighboring node is determined by the following formula:
b is the communication gain of the neighbor node, m is a proportionality coefficient, k is the serial numbers of all neighbor nodes except the current node of the neighbor node, n is the number of the neighbor nodes except the current node of the neighbor node, and p is the number of the neighbor nodes except the current node of the neighbor nodekThe communication success rate of the neighbor node and the kth neighbor node except the current node is obtained.
Optionally, the communication cost of the neighbor node is determined by the following formula:
wherein, F is the communication cost of the neighbor node, H is the shortest hop count from the neighbor node to the sink node, D is the distance from the neighbor node to the current node, C is the centrality of the neighbor node, E1 is the residual energy of the neighbor node, and E2 is the energy density of the neighbor node.
Optionally, the energy density of the neighbor node is determined by the sum of its own remaining energy and the remaining energy of all neighbor nodes of the neighbor node.
Optionally, the system further includes a calculating module and a communication module, the calculating module is configured to calculate the communication comprehensive profit of the node where the routing apparatus is located, and the communication module is configured to send the communication comprehensive profit of the node where the routing apparatus is located to the previous-hop node of the node.
According to a third aspect of the present invention, there is provided a sensor for use in a wireless sensor network, comprising a routing device according to the second aspect of the present invention.
Drawings
Fig. 1 is a flow chart of a routing method according to an embodiment of the present invention;
FIG. 2 is a schematic distribution diagram of a wireless sensor network according to an embodiment of the present invention;
fig. 3 is a block diagram of a routing device according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
Example 1:
referring to fig. 1, the present embodiment provides a routing method, including:
judging whether the total number of the neighbor nodes is 1 or not under the condition that the neighbor nodes exist;
if yes, taking the neighbor node as a next hop node;
if not, determining the comprehensive communication benefit of each neighbor node, wherein the comprehensive communication benefit is determined by the difference between the communication benefit and the communication cost;
and selecting the neighbor node with the highest communication comprehensive benefit as the next hop node.
If the current node has no neighbor node, namely the number of the neighbor nodes is 0, the current node forms an island and the wireless sensor network where the current node is dead. This is not considered by the present invention.
If the current node has only 1 neighbor node, the current node can only send the sensor data to the neighbor node. Of course, for the first node to collect data, there is no previous-hop node, and the number of neighbor nodes is the number of all its neighbor nodes.
If the current node has a plurality of neighbor nodes, specifically selecting which neighbor node to use as the next-hop node needs to comprehensively consider two factors of communication benefit and communication cost. The communication yield is characterized by the value generated by selecting a certain neighbor node as a next hop node for data transmission. For example, if the communication success rate between a neighbor node and its own neighbor node is high, the value of selecting the neighbor node as the next-hop node is greater. For another example, if one of the two neighboring nodes is closer to the sink node, the energy consumption of the neighboring node as a next-hop node is lower, and the neighboring node is preferred to be the next-hop node.
Specifically, when the current node selects the next-hop node, the communication comprehensive profit of the neighbor node may be obtained by collecting information and calculating by the current node, or may be sent to the current node after collecting information and calculating by the neighbor node, so that the current node makes a decision.
Specifically, after the current node transmits the sensor data to the next hop node, the next hop node becomes a new current node, and the next hop node is selected continuously according to the method.
For example, referring to fig. 2, the current node is node i, and node i collects sensor data and sends it out. It has two neighbor nodes j1, j 2. By comparing the communication aggregate benefit of selecting node j2 as the next hop node is the greatest, then selecting node i sends the sensor data to node j 2. Node j2 becomes the current node, and node j2 has three neighboring nodes i, k1, k 2. Node j2 also selects one of nodes i, k1, k2 as the next hop node in the manner described above until the sensor data is transmitted to sink node C. The solid arrows in fig. 2 represent the final selected path and the dashed arrows represent the rejected path. It should be noted that, if it is determined that the node i jumps to the node j2 according to the above method, it is inevitable that the node i will not jump from the node j2 to the node i any more, and therefore, in order to reduce the amount of calculation, a person skilled in the art may also make an agreement that the previous-hop node is not considered when selecting the number of the next-hop nodes.
This method is similar to a football, which falls from the top of a hill to the foot of a hill, always tending to roll down in the direction of the steepest slope.
According to the method, when the current node selects the next hop node, the communication benefit and the communication cost of the neighbor node are balanced and considered, and the neighbor node with the maximum comprehensive communication benefit is selected as the next hop node. Therefore, the energy consumption of each node can be balanced on the premise of guaranteeing the communication benefit. Thereby improving the survival time of the wireless sensor network.
Optionally, the communication gain of the neighboring node is determined according to a communication success rate between the neighboring node and its own neighboring node except the current node. In general, the better the communication state between a neighbor node and its own neighbor node (not including the current node, i.e., the previous-hop node of the neighbor node), the greater the communication yield.
Specifically, the communication gain of the neighbor node is determined by the following formula:
b is the communication gain of the neighbor node, m is a proportionality coefficient, k is the serial numbers of all neighbor nodes except the current node of the neighbor node, n is the number of the neighbor nodes except the current node of the neighbor node, and p is the number of the neighbor nodes except the current node of the neighbor nodekThe communication success rate of the neighbor node and the kth neighbor node except the current node is obtained.
Specifically, the communication success rate can be derived from the base station through history.
Wherein m is a proportionality coefficient, which can realize the function of unifying communication profit and communication cost dimensions and the function of adjusting the proportion of the communication profit and the communication cost respectively. Of course, the scaling factor may be set in the calculation formula of the communication cost. The two ways are equivalent setting ways.
Optionally, at least one of the parameters of the shortest hop count from the neighbor node to the sink node, the distance from the neighbor node to the current node, the centrality of the neighbor node, the remaining energy of the neighbor node, and the energy density of the neighbor node is comprehensively considered when determining the communication cost of the neighbor node. The shorter the shortest hop count from the neighbor node to the sink node is, the lower the communication cost is, the more the neighbor node is preferred as the next hop node. The shorter the distance from the neighbor node to the current node, the lower the communication cost, and the more preferable the neighbor node is as the next hop node. The larger the remaining energy of the neighbor node is, the lower the communication cost is, and the more preferable the neighbor node is as a next hop node. The larger the energy density of the neighbor node is, the lower the communication cost is, and the more preferable the neighbor node is as a next hop node.
Specifically, the remaining energy of each node itself may be detected and determined by the node itself, and the neighbor nodes may be informed of the remaining energy during communication with the neighbor nodes. The shortest hop count from each node to the sink node is determined by each set time of the base station. The distance between adjacent nodes can be obtained by calculating the strength of communication signals of the two nodes. Centrality is the number of neighboring nodes of a node (which may also be defined as the number of neighboring nodes of a node except its previous hop node).
Specifically, the communication cost of the neighbor node is determined by the following formula:
wherein, F is the communication cost of the neighbor node, H is the shortest hop count from the neighbor node to the sink node, D is the distance from the neighbor node to the current node, C is the centrality of the neighbor node, E1 is the residual energy of the neighbor node, and E2 is the energy density of the neighbor node.
Optionally, the energy density of the neighbor node is determined by the sum of its own remaining energy and the remaining energy of all neighbor nodes of the neighbor node.
Example 2:
the present embodiment provides a routing device for implementing the routing method in embodiment 1. The following modules correspond to the method in example 1, and the detailed operation details can be referred to in example 1. Specifically, referring to fig. 3, the routing apparatus includes a judging module 1 and a selecting module 2; the judging module 1 is used for judging whether the total number of the neighbor nodes is 1 under the condition that the neighbor nodes exist; the selection module 2 is configured to, when the judgment module 1 judges that the total number of the neighbor nodes is 1, use the neighbor node as a next hop node, and, when the judgment module 1 judges that the total number of the neighbor nodes is not 1, determine a communication comprehensive benefit of each neighbor node, where the communication comprehensive benefit is determined by a difference between a communication benefit and a communication cost, and select a neighbor node with a highest communication comprehensive benefit as the next hop node.
Optionally, the communication gain of the neighboring node is determined by the following formula:
b is the communication gain of the neighbor node, m is a proportionality coefficient, k is the serial numbers of all neighbor nodes except the current node of the neighbor node, n is the number of the neighbor nodes except the current node of the neighbor node, and p is the number of the neighbor nodes except the current node of the neighbor nodekThe communication success rate of the neighbor node and the kth neighbor node except the current node is obtained. Of course, those skilled in the art can make different specific gravity adjustments for each communication success rate.
Optionally, the communication cost of the neighbor node is determined by the following formula:
wherein, F is the communication cost of the neighbor node, H is the shortest hop count from the neighbor node to the sink node, D is the distance from the neighbor node to the current node, C is the centrality of the neighbor node, E1 is the residual energy of the neighbor node, and E2 is the energy density of the neighbor node.
Optionally, the energy density of the neighbor node is determined by the sum of its own remaining energy and the remaining energy of all neighbor nodes of the neighbor node.
Optionally, the system further includes a calculating module 3 and a communication module 4, where the calculating module 3 is configured to calculate the communication comprehensive profit of the node where the routing apparatus is located, and the communication module 4 is configured to send the communication comprehensive profit of the node where the routing apparatus is located to the previous-hop node of the node.
In other words, in this embodiment, the neighbor node of the current node calculates the communication comprehensive benefit of the neighbor node itself as the next-hop node, and sends the calculated result to the current node, so that the current node can make a decision.
It should be noted that the neighbor nodes of a certain node described above may or may not include the sink node. A person skilled in the art can make a flexible setting for this.
Example 3:
the embodiment provides a sensor, which is applied to a wireless sensor network and comprises a routing device according to the embodiment 2 of the invention.
Thus, the detection data of the sensor can be sent to the sink node by the routing method of embodiment 1.
It will be understood that the above embodiments are merely exemplary embodiments taken to illustrate the principles of the present invention, which is not limited thereto. It will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the spirit and substance of the invention, and these modifications and improvements are also considered to be within the scope of the invention.
Claims (8)
1. A routing method, comprising:
judging whether the total number of the neighbor nodes is 1 or not under the condition that the neighbor nodes exist;
if yes, taking the neighbor node as a next hop node;
if not, determining the comprehensive communication benefit of each neighbor node, wherein the comprehensive communication benefit is determined by the difference between the communication benefit and the communication cost;
selecting a neighbor node with the highest communication comprehensive benefit as a next hop node;
the communication yield of the neighbor node is determined by the following formula:
b is the communication gain of the neighbor node, m is a proportionality coefficient, k is the serial numbers of all neighbor nodes except the current node of the neighbor node, n is the number of the neighbor nodes except the current node of the neighbor node, and p is the number of the neighbor nodes except the current node of the neighbor nodekThe communication success rate of the neighbor node and the kth neighbor node except the current node is obtained.
2. The routing method according to claim 1, wherein the communication cost of the neighboring node is determined by the following formula:
wherein, F is the communication cost of the neighbor node, H is the shortest hop count from the neighbor node to the sink node, D is the distance from the neighbor node to the current node, C is the centrality of the neighbor node, E1 is the residual energy of the neighbor node, and E2 is the energy density of the neighbor node.
3. The routing method according to claim 2, wherein the energy density of a neighbor node is determined by the sum of its own remaining energy and the remaining energy of all neighbor nodes of the neighbor node.
4. The routing device is characterized by comprising a judging module and a selecting module;
the judging module is used for judging whether the total number of the neighbor nodes is 1 or not under the condition that the neighbor nodes exist;
the selection module is used for taking the neighbor node as a next hop node under the condition that the judgment module judges that the total number of the neighbor nodes is 1, and determining the comprehensive communication benefit of each neighbor node under the condition that the judgment module judges that the total number of the neighbor nodes is not 1, wherein the comprehensive communication benefit is determined by the difference between the communication benefit and the communication cost, and the neighbor node with the highest comprehensive communication benefit is selected as the next hop node;
the communication yield of the neighbor node is determined by the following formula:
b is the communication gain of the neighbor node, m is a proportionality coefficient, k is the serial numbers of all neighbor nodes except the current node of the neighbor node, n is the number of the neighbor nodes except the current node of the neighbor node, and p is the number of the neighbor nodes except the current node of the neighbor nodekThe communication success rate of the neighbor node and the kth neighbor node except the current node is obtained.
5. The routing apparatus according to claim 4, wherein the communication cost of the neighbor node is determined by the following formula:
wherein, F is the communication cost of the neighbor node, H is the shortest hop count from the neighbor node to the sink node, D is the distance from the neighbor node to the current node, C is the centrality of the neighbor node, E1 is the residual energy of the neighbor node, and E2 is the energy density of the neighbor node.
6. The routing apparatus according to claim 5, wherein the energy density of the neighbor node is determined by the sum of its own remaining energy and the remaining energy of all neighbor nodes of the neighbor node.
7. The routing device according to any one of claims 4 to 6, further comprising a calculation module and a communication module, wherein the calculation module is configured to calculate the communication integrated profit of the node where the routing device is located, and the communication module is configured to send the communication integrated profit of the node where the routing device is located to the previous hop node of the node.
8. A sensor for application in a wireless sensor network, characterized in that it comprises a routing device according to any one of claims 4-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910128494.4A CN109600812B (en) | 2019-02-21 | 2019-02-21 | Routing method, routing device and sensor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910128494.4A CN109600812B (en) | 2019-02-21 | 2019-02-21 | Routing method, routing device and sensor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109600812A CN109600812A (en) | 2019-04-09 |
| CN109600812B true CN109600812B (en) | 2021-06-29 |
Family
ID=65967480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910128494.4A Active CN109600812B (en) | 2019-02-21 | 2019-02-21 | Routing method, routing device and sensor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109600812B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101409940A (en) * | 2008-08-26 | 2009-04-15 | 中国人民解放军海军工程大学 | Route selection method for wireless sensor network facing to target tracking application |
| CN103139862A (en) * | 2012-11-22 | 2013-06-05 | 江南大学 | Wireless sensor network multi-source data fusion method based on queries |
| CN103369622A (en) * | 2013-07-24 | 2013-10-23 | 电子科技大学 | Routing method with balanced energy consumption |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100912820B1 (en) * | 2007-11-01 | 2009-08-18 | 한국전자통신연구원 | Multi-path Routing method in Wireless Sensor Networks |
| CN103152788B (en) * | 2013-02-21 | 2015-04-08 | 湖南大学 | Game-based VMIMO (Virtual Multiple Input Multiple Output) cooperative routing method |
| CN107484207B (en) * | 2017-07-13 | 2020-06-30 | 燕山大学 | Combined topology control and channel distribution load balancing method in wireless sensor network |
| CN108770036B (en) * | 2018-06-20 | 2020-10-02 | 中国联合网络通信集团有限公司 | Inter-cluster-head communication method and wireless sensor network routing device |
-
2019
- 2019-02-21 CN CN201910128494.4A patent/CN109600812B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101409940A (en) * | 2008-08-26 | 2009-04-15 | 中国人民解放军海军工程大学 | Route selection method for wireless sensor network facing to target tracking application |
| CN103139862A (en) * | 2012-11-22 | 2013-06-05 | 江南大学 | Wireless sensor network multi-source data fusion method based on queries |
| CN103369622A (en) * | 2013-07-24 | 2013-10-23 | 电子科技大学 | Routing method with balanced energy consumption |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109600812A (en) | 2019-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109547966B (en) | Routing planning and fault diagnosis backup method for wireless sensor network of power transmission line | |
| CN104320823B (en) | Network clustering method of wireless sensor based on Sink trust evaluation values | |
| CN104394566B (en) | A kind of low power consumption adaptive clustering and multi-hop wireless sensor network topology control method based on fuzzy decision | |
| CN108770036B (en) | Inter-cluster-head communication method and wireless sensor network routing device | |
| CN103974367B (en) | Fault tolerant and multi-path optimization method based on HEED algorithms in wireless sensor network | |
| CN106714263B (en) | Wireless sensor network AODV routing protocol implementation system and method | |
| CN107371188B (en) | Energy consumption balanced routing method capable of controlling cluster scale | |
| CN102223644A (en) | System and method for combining relay selection and power distribution | |
| CN104053175A (en) | Internet of Things sensing layer topology control method | |
| CN101854666A (en) | Customized trans-regional and multi-hop routing method for wireless sensor network | |
| CN108966239A (en) | A method of relay node is disposed based on Energy volution degree | |
| CN101917750A (en) | Least effort delivering zone-spanned virtual cluster multi-hop routing method | |
| CN104883301A (en) | Wireless sensor network clustering routing protocol based on residual energy and communication cost | |
| CN107995667A (en) | Energy consumption balanced routing method capable of controlling cluster scale | |
| Bhagyalakshmi et al. | Avoiding energy holes problem using load balancing approach in wireless sensor network | |
| CN109511152A (en) | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring | |
| CN103281708A (en) | Wireless sensor node deploying method | |
| CN101572662A (en) | Energy-saving packet forwarding method based on position information in wireless sensor network | |
| CN103945508A (en) | Wireless-sensing-network topology construction method based on probability comparison | |
| CN103747498B (en) | Direction angle-based wireless sensor network routing void optimization method | |
| CN109600812B (en) | Routing method, routing device and sensor | |
| Mehto et al. | Efficient trajectory planning and route adjustment strategy for mobile sink in WSN-assisted IoT | |
| El-Hajj et al. | A fuzzy-based hierarchical energy efficient routing protocol for large scale mobile ad hoc networks (feer) | |
| CN103826282A (en) | Set partitioning multi-hop routing method based on dump energy | |
| KR101022876B1 (en) | Clustreing method and system in wireless sensor networks |
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 |