CN109600812A - Method for routing, route device, sensor - Google Patents
Method for routing, route device, sensor Download PDFInfo
- Publication number
- CN109600812A CN109600812A CN201910128494.4A CN201910128494A CN109600812A CN 109600812 A CN109600812 A CN 109600812A CN 201910128494 A CN201910128494 A CN 201910128494A CN 109600812 A CN109600812 A CN 109600812A
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor node
- neighbor
- communication
- income
- 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
- 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 present invention provides a kind of method for routing, route device, sensor, belongs to field of communication technology, can at least partly solve the problems, such as that the energy consumption of existing method for routing is unbalanced.Method for routing of the invention includes: to judge whether the sum of neighbor node is 1 there are neighbor node；If it is, using the neighbor node as next-hop node；If it is not, then determining the communication synthesis benefit of each neighbor node, wherein communication synthesis benefit is determined by the difference of communication income and communications cost；The neighbor node for selecting communication synthesis most effective is as next-hop node.
Description
Technical field
The invention belongs to fields of communication technology, and in particular to a kind of method for routing, route device, sensor.
Background technique
There are a large amount of sensor node in wireless sensor network, generallys use the mode shed at random and be deployed in wait supervise
It surveys in region.These sensor nodes are linked together by way of ad hoc multihop.Each sensor node will collect
Data be transmitted to aggregation node in a multi-hop fashion by other sensors.Aggregation node again acquires all sensors node
Information summarize and pass through internet or mobile communications network is sent.
The self-energy of each sensor node is limited.The method of sub-clustering can be used wireless sensor network in the prior art
Network is divided into multiple regions, and each region is arranged a sensor as cluster head, is responsible for collection one's respective area inner sensor and is acquired
Data and be forwarded to aggregation node after summarizing.This method for routing is there are operative sensor node energy consumption is too fast, network
The too low risk of life span.Therefore one kind is needed to keep energy consumption uniformly new under the premise of guaranteeing data acquisition (i.e. communication income)
Method for routing.
Summary of the invention
The present invention at least partly solves the problems, such as that existing method for routing energy consumption is non-uniform, provides a kind of method for routing, road
By device, sensor.
According to a first aspect of the present invention, a kind of method for routing is provided, comprising:
Whether the sum that neighbor node is judged there are neighbor node is 1；
If it is, using the neighbor node as next-hop node；
If it is not, then determining the communication synthesis benefit of each neighbor node, wherein communication synthesis benefit is by communication income and leads to
Believe that the difference of cost determines；
The neighbor node for selecting communication synthesis most effective is as next-hop node.
Optionally, the communication income of neighbor node is determined by following formula:Wherein, B is neighbours section
The communication income of point, m is proportionality coefficient, and k is the volume of all neighbor nodes in addition to present node of the neighbor node itself
Number, n is the number of the neighbor node in addition to present node of the neighbor node itself, pkFor the neighbor node and its own
The communication success rate of k-th of neighbor node in addition to present node.
Optionally, the communications cost of neighbor node is determined by following formula:
Wherein, F is the communications cost of the neighbor node, and H is that most short hop count, the D of the neighbor node to aggregation node are this
Neighbor node to the centrad that the distance of present node, C are the neighbor node, E1 be the dump energy of the neighbor node, E2 is
The energy density of the neighbor node.
Optionally, the energy density of neighbor node is by the self rest energy of the neighbor node and owning for the neighbor node
The sum of dump energy of neighbor node determines.
According to a second aspect of the present invention, a kind of route device, including judgment module and selecting module are provided；
Judgment module there are neighbor node for judging whether the sum of neighbor node is 1；
Selecting module is used for the neighbor node in the case where judgment module judges the sum of neighbor node for 1 as under
One hop node, and, in the case where judgment module judges the sum of neighbor node not for 1, the communication of each neighbor node of determination is comprehensive
Close benefit, wherein communication synthesis benefit is determining by the difference of communication income and communications cost, the neighbour for selecting communication synthesis most effective
Node is occupied as next-hop node.
Optionally, the communication income of neighbor node is determined by following formula:Wherein, B is neighbours section
The communication income of point, m is proportionality coefficient, and k is the volume of all neighbor nodes in addition to present node of the neighbor node itself
Number, n is the number of the neighbor node in addition to present node of the neighbor node itself, pkFor the neighbor node and its own
The communication success rate of k-th of neighbor node in addition to present node.
Optionally, the communications cost of neighbor node is determined by following formula:
Wherein, F is the communications cost of the neighbor node, and H is that most short hop count, the D of the neighbor node to aggregation node are this
Neighbor node to the centrad that the distance of present node, C are the neighbor node, E1 be the dump energy of the neighbor node, E2 is
The energy density of the neighbor node.
Optionally, the energy density of neighbor node is by the self rest energy of the neighbor node and owning for the neighbor node
The sum of dump energy of neighbor node determines.
It optionally, further include computing module and communication module, computing module is for node where calculating the route device
Communication synthesis income, communication module is used to the communication synthesis income of node where the route device being sent to the node
One hop node.
According to a third aspect of the present invention, a kind of sensor is provided, for applying in wireless sensor network, including basis
The route device of second aspect of the present invention.
Detailed description of the invention
Fig. 1 is a kind of flow chart of method for routing of the embodiment of the present invention；
Fig. 2 is the distribution schematic diagram of the wireless sensor network of the embodiment of the present invention；
Fig. 3 is a kind of structure chart of route device of the embodiment of the present invention.
Specific embodiment
Technical solution in order to enable those skilled in the art to better understand the present invention, with reference to the accompanying drawing and specific embodiment party
Present invention is further described in detail for formula.
Embodiment 1:
Referring to Fig.1, the present embodiment provides a kind of method for routing, comprising:
Whether the sum that neighbor node is judged there are neighbor node is 1；
If it is, using the neighbor node as next-hop node；
If it is not, then determining the communication synthesis benefit of each neighbor node, wherein communication synthesis benefit is by communication income and leads to
Believe that the difference of cost determines；
The neighbor node for selecting communication synthesis most effective is as next-hop node.
If present node does not have neighbor node, i.e., the number of neighbor node is 0, then present node forms isolated island,
Place wireless sensor network is dead.Therefore the present invention is it is not intended that such case.
If present node only has 1 neighbor node, sensing data can only be sent to the neighbours by present node
Node.Certainly, for acquiring first node of data, and upper hop node, the number of neighbor node is not present
It is exactly the number of its whole neighbor node.
If present node there are multiple neighbor nodes, it is specifically chosen which neighbor node as next-hop node,
Need to comprehensively consider communication two factors of income and communications cost.Communication income characterization be select some neighbor node as
Next-hop node carries out value caused by data transmitting.Such as the neighbor node of some neighbor node and the neighbor node itself
Between communication success rate it is very high, then selecting the neighbor node just bigger as value caused by next-hop node.Example again
As having in two neighbor nodes, a distance apart from aggregation node is closer, then selecting the neighbor node as next-hop section
Brought energy consumption can be lower on the whole for point, and meeting preferably neighbor node is as next-hop node.
Specifically, when selecting next-hop node, the communication synthesis income of neighbor node can be by working as present node
Front nodal point is collected information and is calculated, and is also possible to its neighbor node and collects information and be sent to after calculating work as prosthomere
Point, so that present node makes a policy.
Specifically, present node by sensor data transmission to next-hop node after, next-hop node becomes new current
Node, continuation select next-hop node according to the method described above.
Referring for example to Fig. 2, present node is node i, and node i acquisition sensing data simultaneously transmits it out.It has two
A neighbor node j1, j2.By comparing selecting node j2 maximum as the communication synthesis benefit of next-hop node, then selection section
Sensing data is sent to node j2 by point i.Node j2 becomes present node, and there are three neighbor node i, k1, k2 by node j2.Section
Point j2 selects one also according to the above method as next-hop node, until sensing data is passed in node i, k1, k2
It send to aggregation node C.Solid arrow indicates the path finally chosen in Fig. 2, and dotted arrow indicates the path abandoned.It needs to illustrate
, determine that node i jumps to node j2 according to the above method, then inevitable will not jump to node i from node j2 again, therefore, be
Reduction calculation amount is not examined when those skilled in the art equally can about be scheduled on the selection for carrying out above-mentioned next-hop node number
Consider upper hop node.
This method is similar to the football to fall from the hilltop to the foot of the hill, always tend to the most precipitous direction of the selection gradient to
Under tumble.
According to above method, present node can be balanced when selecting next-hop node consider neighbor node communication income and
Communications cost selects the maximum neighbor node of communication synthesis benefit as next-hop node.It is received in this way, may be implemented in guarantee communication
The energy consumption of each node is balanced under the premise of benefit.To improve the life span of wireless sensor network.
Optionally, the communication income of neighbor node is according to the neighbours in addition to present node of the neighbor node and its own
Communication success rate between node determines.In general, some neighbor node and the neighbor node of its own (do not include current
Node, i.e. the upper hop node of the neighbor node) between communications status it is better, then bring communication income it is also bigger.
Specifically, the communication income of neighbor node is determined by following formula:Wherein, B is neighbours section
The communication income of point, m is proportionality coefficient, and k is the volume of all neighbor nodes in addition to present node of the neighbor node itself
Number, n is the number of the neighbor node in addition to present node of the neighbor node itself, pkFor the neighbor node and its own
The communication success rate of k-th of neighbor node in addition to present node.
Specifically, which can be calculated to obtain by base station by historical record.
M therein is proportionality coefficient, and the effect of Unified Communication income and communications cost dimension may be implemented, and adjustment is led to
Believe the effect of the respective proportion of income and communications cost.Certain proportionality coefficient is arranged in the calculation formula of communications cost
It is possible.Two ways is equivalent set-up mode.
Optionally it is determined that comprehensively considering the most short jump of the neighbor node to aggregation node when the communications cost of neighbor node
Number, the distance of the neighbor node to present node, the centrad of the neighbor node, the dump energy of the neighbor node, the neighbours
At least one of in these parameters of the energy density of node.The most short hop count of the neighbor node to aggregation node is shorter, communication at
This is lower, then the more preferred neighbor node is as next-hop node.The distance of the neighbor node to present node is shorter, communication
Cost is lower, then the more preferred neighbor node is as next-hop node.The dump energy of the neighbor node is bigger, communications cost
It is lower, then the more preferred neighbor node is as next-hop node.The energy density of the neighbor node is bigger, and communications cost is got over
It is low, then the more preferred neighbor node is as next-hop node.
Specifically, the dump energy of each node itself can by the node itself detect determine, and with neighbor node
Neighbor node is informed in communication process.The most short hop count of each node to aggregation node is determined by each setting time in base station.Phase
The distance between neighbors can be obtained by strong and weak calculate of the two signal of communication.The centrad i.e. neighbor node of some node
Number (number that neighbor node of some node in addition to a hop node thereon can also be defined as).
Specifically, the communications cost of neighbor node is determined by following formula:
Wherein, F is the communications cost of the neighbor node, and H is that most short hop count, the D of the neighbor node to aggregation node are this
Neighbor node to the centrad that the distance of present node, C are the neighbor node, E1 be the dump energy of the neighbor node, E2 is
The energy density of the neighbor node.
Optionally, the energy density of neighbor node is by the self rest energy of the neighbor node and owning for the neighbor node
The sum of dump energy of neighbor node determines.
Embodiment 2:
The present embodiment provides a kind of route devices for realizing the method for routing of embodiment 1.Following module and embodiment 1
In method to correspondence, detailed operational detail can refer to embodiment 1.Specifically, referring to Fig. 3, which includes judgement
Module 1 and selecting module 2；Judgment module 1 be used to judge there are neighbor node neighbor node it is total whether
It is 1；Selecting module 2 is used in the case where judgment module 1 judges the sum of neighbor node for 1 using the neighbor node as next
Hop node, and, in the case where judgment module 1 judges the sum of neighbor node not for 1, the communication of each neighbor node of determination is comprehensive
Close benefit, wherein communication synthesis benefit is determining by the difference of communication income and communications cost, the neighbour for selecting communication synthesis most effective
Node is occupied as next-hop node.
Optionally, the communication income of neighbor node is determined by following formula:Wherein, B is neighbours section
The communication income of point, m is proportionality coefficient, and k is the volume of all neighbor nodes in addition to present node of the neighbor node itself
Number, n is the number of the neighbor node in addition to present node of the neighbor node itself, pkFor the neighbor node and its own
The communication success rate of k-th of neighbor node in addition to present node.Certain those skilled in the art can also be to each communication
Success rate makes different ratio recanalization.
Optionally, the communications cost of neighbor node is determined by following formula:
Wherein, F is the communications cost of the neighbor node, and H is that most short hop count, the D of the neighbor node to aggregation node are this
Neighbor node to the centrad that the distance of present node, C are the neighbor node, E1 be the dump energy of the neighbor node, E2 is
The energy density of the neighbor node.
Optionally, the energy density of neighbor node is by the self rest energy of the neighbor node and owning for the neighbor node
The sum of dump energy of neighbor node determines.
It optionally, further include computing module 3 and communication module 4, computing module 3 is for section where calculating the route device
The communication synthesis income of point, communication module 4 are used to the communication synthesis income of node where the route device being sent to the node
Upper hop node.
I.e. in this embodiment, the neighbor node of present node imitates itself communication synthesis as next-hop node
Benefit is calculated, and the result of calculating is sent to present node, to carry out decision for present node.
It should be noted that can permit in the neighbor node of some above-described node comprising aggregation node, it can also
To allow not including aggregation node.Those skilled in the art can make flexible setting to this.
Embodiment 3:
The present embodiment provides a kind of sensors, implement for applying in wireless sensor network, including according to the present invention
The route device of example 2.
To which the detection data of sensor can be sent to aggregation node by the method for routing of embodiment 1.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, essence of the invention is not being departed from
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (10)
1. a kind of method for routing characterized by comprising
Whether the sum that neighbor node is judged there are neighbor node is 1；
If it is, using the neighbor node as next-hop node；
If it is not, then determining the communication synthesis benefit of each neighbor node, wherein communication synthesis benefit by communication income with communicate into
This difference determines；
The neighbor node for selecting communication synthesis most effective is as next-hop node.
2. method for routing according to claim 1, which is characterized in that the communication income of neighbor node is true by following formula
It is fixed:Wherein, B is the communication income of the neighbor node, and m is proportionality coefficient, and k is the neighbor node itself
The number of all neighbor nodes in addition to present node, n are neighbours' section in addition to present node of the neighbor node itself
The number of point, pkFor the communication success rate of the neighbor node and k-th of the neighbor node in addition to present node of its own.
3. method for routing according to claim 1, which is characterized in that the communications cost of neighbor node is true by following formula
It is fixed:
Wherein, F is the communications cost of the neighbor node, and H is that most short hop count, the D of the neighbor node to aggregation node are the neighbours
Node to the centrad that the distance of present node, C are the neighbor node, E1 be the dump energy of the neighbor node, E2 is the neighbour
Occupy the energy density of node.
4. method for routing according to claim 3, which is characterized in that the energy density of neighbor node is by the neighbor node
The sum of self rest energy and the dump energy of all neighbor nodes of the neighbor node determine.
5. a kind of route device, which is characterized in that including judgment module and selecting module；
Judgment module there are neighbor node for judging whether the sum of neighbor node is 1；
Selecting module is used in the case where judgment module judges the sum of neighbor node for 1 using the neighbor node as next-hop
Node, and, determine that the communication synthesis of each neighbor node is imitated in the case where judgment module judges the sum of neighbor node not for 1
Benefit, wherein communication synthesis benefit is determined by the difference of communication income and communications cost, selects neighbours' section that communication synthesis is most effective
Point is used as next-hop node.
6. route device according to claim 5, which is characterized in that the communication income of neighbor node is true by following formula
It is fixed:Wherein, B is the communication income of the neighbor node, and m is proportionality coefficient, and k is the neighbor node itself
The number of all neighbor nodes in addition to present node, n are neighbours' section in addition to present node of the neighbor node itself
The number of point, pkFor the communication success rate of the neighbor node and k-th of the neighbor node in addition to present node of its own.
7. route device according to claim 5, which is characterized in that the communications cost of neighbor node is true by following formula
It is fixed:
Wherein, F is the communications cost of the neighbor node, and H is that most short hop count, the D of the neighbor node to aggregation node are the neighbours
Node to the centrad that the distance of present node, C are the neighbor node, E1 be the dump energy of the neighbor node, E2 is the neighbour
Occupy the energy density of node.
8. route device according to claim 7, which is characterized in that the energy density of neighbor node is by the neighbor node
The sum of self rest energy and the dump energy of all neighbor nodes of the neighbor node determine.
9. according to route device described in claim 5-8 any one, which is characterized in that further include computing module and communication
Module, the communication synthesis income of node where computing module is used to calculate the route device, communication module is for filling the routing
The communication synthesis income of node is sent to the upper hop node of the node where setting.
10. a kind of sensor, for applying in wireless sensor network, which is characterized in that including being appointed according to claim 5-9
Route device described in meaning one.
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 true CN109600812A (en) | 2019-04-09 |
| CN109600812B 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 (7)
| 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 |
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| CN103139862A (en) * | 2012-11-22 | 2013-06-05 | 江南大学 | Wireless sensor network multi-source data fusion method based on queries |
| CN103152788A (en) * | 2013-02-21 | 2013-06-12 | 湖南大学 | Game-based VMIMO (Virtual Multiple Input Multiple Output) cooperative routing method |
| CN103369622A (en) * | 2013-07-24 | 2013-10-23 | 电子科技大学 | Routing method with balanced energy consumption |
| CN107484207A (en) * | 2017-07-13 | 2017-12-15 | 燕山大学 | Combine topology control and channel distribution load-balancing method in wireless sensor network |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
-
2019
- 2019-02-21 CN CN201910128494.4A patent/CN109600812B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| 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 |
| CN103152788A (en) * | 2013-02-21 | 2013-06-12 | 湖南大学 | Game-based VMIMO (Virtual Multiple Input Multiple Output) cooperative routing method |
| CN103369622A (en) * | 2013-07-24 | 2013-10-23 | 电子科技大学 | Routing method with balanced energy consumption |
| CN107484207A (en) * | 2017-07-13 | 2017-12-15 | 燕山大学 | Combine topology control and channel distribution load-balancing method in wireless sensor network |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109600812B (en) | 2021-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Heo et al. | An intelligent deployment and clustering algorithm for a distributed mobile sensor network | |
| Dou et al. | Optimizing sensor network coverage and regional connectivity in industrial IoT systems | |
| Di et al. | A survey of machine learning in wireless sensor netoworks from networking and application perspectives | |
| CN104640168B (en) | Vehicular ad hoc network method for routing based on Q study | |
| CN103826281B (en) | Micro power radio communication Centroid network-building method based on field intensity information | |
| CN105959988A (en) | Cognitive radio ad hoc network node stability determining method based on support vector machine | |
| CN110049528B (en) | Mobile credible data collection method based on credible value utility in sensor network | |
| CN113411213B (en) | Ad hoc network topology control method and cooperative monitoring method based on Internet of things | |
| CN110049530A (en) | Method for routing based on Q study and trust model in vehicular ad hoc network | |
| CN109565716A (en) | For controlling the control method and control system of the access point in wireless network | |
| DE602005000093T2 (en) | Method for operating sensor networks and sensor devices | |
| CN108174428A (en) | Landslide wireless monitor early warning system | |
| Navarro et al. | Energy-efficient and balanced routing in low-power wireless sensor networks for data collection | |
| CN109600812A (en) | Method for routing, route device, sensor | |
| Mehto et al. | Efficient trajectory planning and route adjustment strategy for mobile sink in WSN-assisted IoT | |
| CN101552719A (en) | Routing selection method and routing selection device | |
| CN108922124A (en) | Ocean organic pollutant information acquisition system | |
| Kannan et al. | Max-min length-energy-constrained routing in wireless sensor networks | |
| Lemmon et al. | Review of Location-Aware Routing Protocols. | |
| Venetis et al. | Benchmarking mobile agent itinerary planning algorithms for data aggregation on WSNs | |
| CN107529128A (en) | The method for routing and system of intelligent distribution network wireless sensor network | |
| CN101895957B (en) | Random routing method facing matrix type wireless sensor network distribution weighing | |
| CN105246121B (en) | A kind of variable dimension population construction method of mobile sink information collection pathway | |
| CN105472630B (en) | The wireless sensor network fringe node recognition methods differentiated based on triangle | |
| CN104270797B (en) | Network clustering method of wireless sensor based on side betweenness |
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 |