CN107318142A - Distributed routing method between a kind of wireless sense network cluster - Google Patents
Distributed routing method between a kind of wireless sense network cluster Download PDFInfo
- Publication number
- CN107318142A CN107318142A CN201710527349.4A CN201710527349A CN107318142A CN 107318142 A CN107318142 A CN 107318142A CN 201710527349 A CN201710527349 A CN 201710527349A CN 107318142 A CN107318142 A CN 107318142A
- Authority
- CN
- China
- Prior art keywords
- cluster head
- cluster
- head
- father
- network
- 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
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- 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
Abstract
The invention discloses distributed routing method between a kind of wireless sense network cluster, belong to wireless sensor network field, it effectively reduces the interference of data transfer between massive wireless sensor cluster head.The present invention is included between cluster head by the mutual logic connecting relation of Hello message exchanges and load information, and is recorded into neighbor table；Cluster head first according to the father's cluster head quantity and flow load of neighbours' cluster head, calculates interference factor of the data transfer to its neighbours' cluster head data transfer of cluster head；Submanifold head is using the interference factor of father's cluster head as the probability that next-hop data transfer is undertaken according to each father's cluster head of calculating.The present invention can effectively reduce interfering between cluster head in data transmission procedure, improve the data transmission efficiency of network.
Description
Technical field
The invention belongs to wireless sensor network field, specifically, it is related to distributed road between a kind of wireless sense network cluster
By method.
Background technology
Clustering topology is easy to management, is conducive to the application of distributed routing algorithm, with preferable scalability, fits
Close massive wireless sensor application.Clustering route protocol generally splits the network into cluster, and each cluster is by cluster head and multiple
Cluster member composition, cluster head manages or controls member node in whole cluster, and data pass through multi-hop transmission between cluster head to aggregation node.By
Easily fail in sensor node, it is cluster structured there is bottleneck, the high capacity of cluster head makes network segmentation increase, this requirement
Routing algorithm has certain fault-tolerant ability.Meanwhile, during wireless signal interference and channel contention are also clustering routing design process
Very important key factor.
For Wireless sensor network clustering route, the formation of generation, cluster and the data transfer of cluster around cluster head and set
Many WSN Clustering Routings are counted.《The wireless sensor network data of Energy-aware collects agreement》, Journal of Software, 2007,
18(5)：1092-1109, author Liu Ming, Cao Jiannong, Chen Guihai etc., are disclosed based on node itself and its neighbor node residual energy
Amount design election of cluster head and cluster constructing plan, the subgraph connectedness formed by adjusting cluster head covering radius to ensure by cluster head, then
Build convergence tree transmission data.But when network load is larger, the data transfer between different cluster members easily produces conflict, makes
Obtain cluster head and collect data efficiency decline, so as to be easily caused network congestion.《efficient routing algorithm
based on unequal clustering and connected graph in wireless sensor networks》,
International Journal of Wireless Information Networks,2016,23(2):141-150, makees
Person Xia H, Zhang R, Yu J, disclose by adjust the communication radius of sensor node sensor network is carried out it is non-homogeneous
Sub-clustering, then using connected graph Theoretical Design route selection algorithm.But only consider that Energy volution is avoided during sub-clustering so that cluster network is opened up
Flutter and frequently changed to save energy consumption, cause the cost for safeguarding network stabilization excessive, cause network performance to decline.Road between cluster head
It is route by algorithm using only data transfer between graph theory design cluster head, ignores information sharing and the biography of wireless sense network protocol stack
Sensor node data transfer feature, effect of optimization is limited.
It was found from above-mentioned prior art, existing WSN clustering architectures and method for routing energy consumption is unbalanced, performance is unstable；How
The characteristics of using wireless-sensor network distribution type, sets up more efficient Self-configuring, by regional area limited range interior nodes
Between interaction and feedback of the information come sub-clustering and route, in reduction internodal data transmission interference, guarantee network operation cycle
Meanwhile, improve cluster stability and network data transmission performance still needs further innovation.
The content of the invention
1st, the problem of solving
The problem of for being interfered between existing massive wireless sensor cluster head, the present invention provides a kind of wireless biography
Feel distributed routing method between net cluster, can effectively reduce interfering, alleviating heavy duty between cluster head in data transmission procedure
In the case of network congestion degree, balance network load, extension network lifetime, it is adaptable to massive wireless sensor should
With.
2nd, technical scheme
To solve the above problems, the present invention is adopted the following technical scheme that.
Distributed routing method between a kind of wireless sense network cluster, including the use of shadow of the cluster head data transfer to its neighbours' cluster head
Ring and define the foundation that interference factor is selected as next-hop.
Preferably, comprise the following steps：
Between step A, cluster head by the mutual logic connecting relation of Hello message exchanges, cluster head load estimation value and from
The interference factor of body, and be recorded into respective neighbor table；In neighbor table, direct shape during cluster network struction is marked
Into, or rely on father, son between the cluster head that range difference isomery is built between cluster network and aggregation node, with layer relation；
Step B, updates and safeguards interference factor of the cluster head i data transfers to neighbours' cluster head data transfer；
Each father's cluster head interference factor that step C, lower floor network cluster head j are calculated using in above-mentioned steps B is foundation, it is determined that respectively
Father's cluster head is the probability of next-hop.
Step D, lower floor network cluster head j selects next-hop using roulette method choice from father's cluster head.
Preferably, the calculation formula of cluster head i load estimation values is as follows in step A,
Li、LjCluster head i and its submanifold head j load estimation value, P are represented respectivelyj、CjRepresent respectively cluster head j father's cluster head with
Submanifold head set；UiThe member node set of cluster, R where cluster head ijRepresent using i as count off on member node j in the cluster of cluster head
According to the mathematic expectaion of amount；| | represent the number of element in set；
Preferably, in step B, renewal and maintenance of the cluster head i data transfers to the data transmission interference factor of neighbours' cluster head,
Calculation formula is as follows,
The right Section 1 calculates cluster head i annoyance level of the data transfer to its all father's cluster head；Section 2 calculates cluster head i
To the annoyance level of its all submanifold head data transfer；Section 3 calculates cluster head i to all same layer neighbour cluster head data transfers
Annoyance level；
Pi、PkRespectively cluster head i and k father's cluster head set, CjFor cluster head j submanifold head set, MiFor cluster head i communications half
With layer cluster head set, L in the range of footpathkRepresent cluster head k flow load predicted value；| | represent the number of element in set.
Preferably, in step C, lower floor network cluster head j is using his father's cluster head interference factor as foundation, under determining that each father's cluster head is
One probability jumped, computational methods are as follows,
PjRepresent cluster head j father's cluster head set, IFiFor cluster head j father's cluster head i interference factor, IFkFor cluster head j father's cluster
Head k interference factor；X is neighbours' cluster head quantity that cluster head j has obtained interference factor value by Hello message, and interference is not obtained
The cluster head i interference factor values IF of the factoriFor 0, and it is selected as the probability of next-hop and is| | represent the number of element in set.
3rd, beneficial effect
Compared to prior art, beneficial effects of the present invention are：
(1) present invention defines the interference factor of sensor node, uses the wireless sense network Cu Jian roads based on interference factor
By method, interfering between cluster head effectively in reduction data transmission procedure, alleviate network congestion degree in the case of heavy duty, prolong
Long network lifetime, it is adaptable to massive wireless sensor application；
(2) the probability route selection method that uses of the present invention is based on interference factor, by for different next of cluster head
Jump routing node distribution select probability, balance network load while data transmission efficiency is improved, it is to avoid due to single cluster head
Due to undertaking, excessive transformation task causes energy loss too fast, causes under network energy skewness weighing apparatus and stability
Drop.
Brief description of the drawings
Interference scene of the data transfer that Fig. 1 is cluster head i in the specific embodiment of the invention to its all father's cluster head；
Fig. 2 is interference scenes of the cluster head i in the specific embodiment of the invention to its all submanifold head data transfer；
Fig. 3 is interference scene of the cluster head i data transfers in the specific embodiment of the invention to same layer cluster head data transfer；
Fig. 4 is structure and its cluster head update method wireless sense network cluster network structure in the specific embodiment of the invention；
A-K represents each cluster in figure；It is the 0th layer network in short dash line；It is the 1st layer network in solid line；It is the 2nd layer in long dotted line
Network；It is layer 3 network outside long dotted line；Data are transmitted until aggregation node by leader cluster node between cluster.
Fig. 5 be in the correspondence figure in the present invention between each cluster, figure arrow fineness to represent node flow distribution general
Rate.
In figure, arrow fineness represents node flow distribution probability.According to the least interference proposed in the present invention because
Cluster head is when selecting next-hop in subpath selection strategy, cluster K, because the cluster head for selecting cluster F can be interfered between the cluster of cluster network A
Data transfer, therefore have very big probability selection G rather than F.Similarly, cluster head is when selecting next-hop in cluster network J, to avoid to cluster
Data transfer in network I is impacted, and can be inclined to select E rather than D.
Embodiment
The present invention will be described in detail below in conjunction with the accompanying drawings.
In wireless sensor and actor networks, node state is continually changing over time, so as to not cause network topology structure also not
It is disconnected to change.Especially in the densely distributed network of sensor node, the storage of ordinary node and computing capability are limited, make
With the central controlled path finding method of traditional sensors network routing protocol, that is, collect whole network topology, Link State etc.
Information simultaneously calculates and safeguarded that whole piece route is clearly irrational, and building route using Graph-theoretical Approach has larger expense.Cause
This, plays the part of energy-efficient routing in wireless sensor network using being with good expansibility with the hierarchy routing of communication capacity
Role be good selection.
The present invention is further described below with reference to specific embodiment.
As shown in figure 4, there is A-K totally 11 cluster head structures, partitioning the network into a kind of multi-level clustering architecture of wireless sense network
For 4 layers, respectively the 0th layer cluster network, the 1st layer of cluster network, the 2nd layer of cluster network and the 3rd layer of cluster network；Data pass through leader cluster node
Transmission is until aggregation node between cluster.In the cluster network, logic connecting relation is existed only between the cluster head of adjacent layer, with layer net
Logic connecting relation is not present between the cluster head of network.In the cluster head that there is logic connecting relation, the cluster head in upper layer network is referred to as
Cluster head in father's cluster head, lower floor's network is referred to as submanifold head.
Its construction method, is mainly the multi-level cluster structure by using aggregation node as starting point, from the close-by examples to those far off completing the whole network
Build；
Specifically include following steps,
The adjacent information of neighbor nodes of Hello message collections is regularly sent after sensor node deployment, between node, is used
Beaconing nodes location algorithm based on RSSI rangings, using aggregation node as beaconing nodes, sets up relative coordinate system, each node is protected
Deposit its coordinate information；
Step A, in the netinit stage, centered on aggregation node, by sensor node radio communication radius
Sensor node is divided into the 0th layer of cluster network；Whether clustering architecture is had been added to according to node, by all node divisions in network
For cluster node and blank node, cluster node is the node for having been added to clustering architecture, it is on the contrary then for blank node；
Step B, the 1st layer of cluster network is built using sensor node On Schemes Of Energy Balance method；
Each sensor node energy-consuming balance value in step B1, the 0th layer of cluster network described in calculation procedure A, and broadcast cluster
Request message is built, the energy-consuming balance value calculating method of node i is as follows：
The primary power of node i is represented, J is all neighbor node j of node i set；| | represent element in set
Number；D () represents the Euclidean distance between two nodes.
Step B2, after the cluster for receiving all 0th layer of neighbor nodes builds message, blank node selection has maximum energy consumption
The neighbor node of equilibrium valve adds clustering architecture by replying as cluster head into cluster message request；
Step B3, the 0th node layer receive blank node enter cluster message after, whether detect its own is target section
Point, if from as destination node, broadcasting cluster message, notifies bunch member node to enter sleep state；If node is in cluster net
Network builds the request into clusters message not received yet after duration T time-out certainly as destination node, then the node is gone forward side by side for ordinary node
Enter sleep state；So far, the structure of the 1st layer of cluster network is completed；
T is taken 2 seconds in the step, but T can be carried out according to network size, sensor distribution characteristics, sensor communication radius etc.
Adjustment；
Step C, using cluster head ability value as foundation, sets up lower floor's cluster network of the 1st layer of cluster network successively, that is, sets up the 2nd,
3rd ... n-th layer cluster network, N >=2；Concretely comprise the following steps,
Each cluster member calculates itself cluster head ability value in step C1, N-1 layers of cluster network, and then broadcast cluster builds request and disappeared
Breath；
First, it is determined that when node i serves as cluster head role the cluster stationary value Si, calculation formula is as follows：
SiFor node i neighbor node set in same layer cluster network, r is communication radius, and d () is represented between two nodes
Euclidean distance,WithNode j dump energy and primary power is represented respectively；
Then, calculate node cluster head ability value,
ZiFor the blank node set in the range of node i communication radius；Rj(j∈Zi) it is ZiIn each node reported data
The mathematic expectaion of amount；PiFor in node i communication radius, and belong to the set of cluster head in N-2 layers of cluster network；| | represent
The number of element in set；
Step C2, after the cluster structure message from N-1 layers of neighbor node is received, its cluster head ability value is preserved to neighbour
Occupy in table.After the cluster for receiving all upper strata neighbours cluster heads builds message, selection wherein has the work of maximum cluster head ability value
For itself cluster head, reply into cluster message；
Step C3, N-1 node layers receive n-th layer node enter cluster message after, whether detect its own is target
Node, if from as destination node, broadcasting cluster message, notifies bunch member node to enter sleep state；If node is in cluster
Network struction duration is not received from the request into clusters message as destination node for T=2 seconds yet after time-out, then the node is common section
Put and enter sleep state；So far, the structure of n-th layer cluster network is completed；
T is taken 2 seconds in the step, but T can be carried out according to network size, sensor distribution characteristics, sensor communication radius etc.
Adjustment；
Step C4, repeat step C1-C3, until completing the cluster network struction of whole wireless sense network；
The member node that n-th layer cluster head and the covering of these cluster heads are undertaken in this step constitutes n-th layer cluster network.
Cluster head update method in the above-mentioned multi-level clustering architecture of wireless sense network, specifically includes following steps,
Step A, cluster head i assess whether to disclosure satisfy that continuation is carried on a shoulder pole according to factors such as dump energy, flow loads using following formula
Appoint cluster head, if following formula is unsatisfactory for, goes to step B and carry out cluster renewal；
Cluster head i dump energy is represented,Represent that the cluster head i consumed energy in the wheel data transfer is averaged
Value, CiFor cluster head i submanifold head set, UiThe member node set of cluster where cluster head i；RjWith cluster head i bunch member node j
The mathematic expectaion of reported data amount, Li、LjThe mathematic expectaion of cluster head i and its submanifold head j flow load is represented respectively；
Step B, cluster head i are by broadcasting cluster new information, and notifying its neighbor node, this enters cluster head more new state；It is then adjacent
Node j is occupied according to neighbours' cluster head information in the adjacent two layers of both sides position, j dump energy and place level, is counted as the following formula
The cluster head ability value of itself is calculated,
D () represents cluster head i and node j Euclidean distance,Represent node j dump energy, CjRepresent node
Cluster head set, P in lower floor's network in j communication radiusjRepresent cluster head set, P in upper layer network in node j communication radiuskRepresent
In node j communication radius in lower floor's network cluster head father's cluster head set, J be all neighbor node j of cluster head i set；| | table
Show the number of element in set；
Step C, cluster head i elect the node with maximum cluster head ability value as new cluster head, then respectively by cluster head i, new cluster
Head broadcasts cluster head in respective communication radius and changes message, and completes role transforming；
Step D, the cluster head for receiving cluster head i changes message but does not receive the node that the cluster head from new cluster head changes message
Judge whether there are cluster head neighbours in its communication range according to neighbor table, if any then to the maximum neighbours' cluster head transmission of cluster head ability value
Request adds message, otherwise into isolated node state.The maximum neighbor node relaying data of isolated node selection dump energy,
During the later stage network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message；
Step E, cluster updates the isolated cluster caused and performs step B and C progress cluster renewal.
Distributed routing method between a kind of wireless sense network cluster, is obtained from the foregoing multi-level cluster construction method of wireless sense network
Tree-shaped distributed route is carried out to there is logically the virtual cluster head network of multi-link relation.The present invention uses interference factor as choosing
Select the foundation of next-hop node.Concrete scheme is as follows：
Between step A, cluster head by the mutual logic connecting relation of Hello message exchanges, cluster head load estimation value and from
The interference factor of body, and be recorded into respective neighbor table；
In neighbor table, father, son between the cluster head directly formed during cluster network struction are marked, with layer relation；
The calculation formula of cluster head i load estimation values is as follows in this step,
Li、LjCluster head i and its submanifold head j load estimation value, P are represented respectivelyj、CjRepresent respectively cluster head j father's cluster head with
Submanifold head set；UiThe member node set of cluster, R where cluster head ijRepresent using i as count off on member node j in the cluster of cluster head
According to the mathematic expectaion of amount；| | represent the number of element in set；
Step B, updates and safeguards interference factor of the cluster head i data transfers to neighbours' cluster head data transfer；
Renewal and maintenance of the cluster head i data transfers to the data transmission interference factor of neighbours' cluster head, meter are determined in this step
Calculate formula as follows,
The right Section 1 calculates annoyance levels of the cluster head i to the submanifold head data transfer of all members in his father's cluster head set
(Fig. 1)；Section 2 calculates annoyance levels (Fig. 2) of the cluster head i to all member data transmission in its submanifold head；Section 3 calculates cluster
Annoyance levels (Fig. 3) of the head i to all same layer neighbour cluster head data transfers；
Pi、PkRespectively cluster head i and k father's cluster head set, CjFor cluster head j submanifold head set, MiFor cluster head i communications half
With layer cluster head set, L in the range of footpathkRepresent cluster head k flow load predicted value；| | represent the number of element in set.
Each father's cluster head interference factor of step C, lower floor network cluster head j to be calculated is foundation, under determining that each father's cluster head is
One probability jumped；
Computational methods are as follows,
PjRepresent cluster head j father's cluster head set, IFiFor cluster head j father's cluster head i interference factor, IFkFor cluster head j father's cluster
Head k interference factor；X is neighbours' cluster head quantity that cluster head j has obtained interference factor value by Hello message, and interference is not obtained
The cluster head i interference factor values IF of the factoriFor 0, and it is selected as the probability of next-hop and is| | represent the number of element in set.
Embodiments of the invention are the foregoing is only, are not intended to limit the invention.The present invention can have various conjunctions
Suitable change and change.Any modification, equivalent substitution and improvements made within the spirit and principles of the invention etc., all should
Within protection scope of the present invention.
Claims (5)
1. distributed routing method between a kind of wireless sense network cluster, it is characterised in that：It is adjacent to it including the use of cluster head data transfer
The influence for occupying cluster head defines the foundation that interference factor is selected as next-hop.
2. distributed routing method between a kind of wireless sense network cluster according to claim 1, it is characterised in that：Including as follows
Step：
Between step A, cluster head by the mutual logic connecting relation of Hello message exchanges, cluster head load estimation value and itself
Interference factor, and be recorded into respective neighbor table；
In neighbor table, mark what is directly formed during cluster network struction, or rely on range difference between cluster network and aggregation node
Father, son between the cluster head that isomery is built, with layer relation；
Step B, updates and safeguards interference factor of the cluster head i data transfers to its neighbours' cluster head data transfer；
Each father's cluster head interference factor that step C, lower floor network cluster head j are calculated using in above-mentioned steps B determines each father's cluster as foundation
Head is the probability of next-hop.
3. distributed routing method between a kind of wireless sense network cluster according to claim 2, it is characterised in that：In step A
The calculation formula of cluster head i load estimation values is as follows,
Li、LjCluster head i and its submanifold head j load estimation value, P are represented respectivelyj、CjCluster head j father's cluster head and submanifold is represented respectively
Head set；UiThe member node set of cluster, R where cluster head ijRepresent using i as member node j reported data amounts in the cluster of cluster head
Mathematic expectaion；| | represent the number of element in set.
4. distributed routing method between a kind of wireless sense network cluster according to claim 2, it is characterised in that：In step B,
Update and safeguard interference factor of the cluster head i data transfers to neighbours' cluster head data transfer, calculation formula is as follows,
The right Section 1 calculates cluster head i annoyance level of the data transfer to its all father's cluster head；Section 2 calculates cluster head i to it
The annoyance level of all submanifold head data transfers；Section 3 calculates interference of the cluster head i to all same layer neighbour cluster head data transfers
Degree；
Pi、PkRespectively cluster head i and k father's cluster head set, CjFor cluster head j submanifold head set, MiFor cluster head i communication radius scopes
Interior same layer cluster head set, LkRepresent cluster head k flow load predicted value；| | represent the number of element in set.
5. distributed routing method between a kind of wireless sense network cluster according to claim 2, it is characterised in that：In step C,
Lower floor network cluster head j determines the probability that each father's cluster head is next-hop, computational methods are such as using his father's cluster head interference factor as foundation
Under,
PjRepresent cluster head j father's cluster head set, IFiFor cluster head j father's cluster head i interference factor, IFkFor cluster head j father's cluster head k
Interference factor；X is neighbours' cluster head quantity that cluster head j has obtained interference factor value by Hello message, and interference factor is not obtained
Cluster head i interference factor values IFiFor 0, and it is selected as the probability of next-hop and is| | represent the number of element in set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710527349.4A CN107318142B (en) | 2017-06-30 | 2017-06-30 | Distributed routing method between a kind of wireless sense network cluster |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710527349.4A CN107318142B (en) | 2017-06-30 | 2017-06-30 | Distributed routing method between a kind of wireless sense network cluster |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107318142A true CN107318142A (en) | 2017-11-03 |
| CN107318142B CN107318142B (en) | 2019-09-27 |
Family
ID=60181286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710527349.4A Active CN107318142B (en) | 2017-06-30 | 2017-06-30 | Distributed routing method between a kind of wireless sense network cluster |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107318142B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109644838A (en) * | 2019-01-28 | 2019-04-19 | 温州华隆建设有限公司 | A kind of Landscape water-saving irrigation device |
| CN111405634A (en) * | 2020-02-26 | 2020-07-10 | 中国空间技术研究院 | Method and device for self-adaptive clustering of wireless sensor network |
| CN113613307A (en) * | 2021-07-15 | 2021-11-05 | 天津(滨海)人工智能军民融合创新中心 | On-demand routing method based on local active routing assistance |
| CN113825219A (en) * | 2021-11-10 | 2021-12-21 | 慕思健康睡眠股份有限公司 | Human body data collecting method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN101848523A (en) * | 2010-03-05 | 2010-09-29 | 北京北大众志微系统科技有限责任公司 | Path selecting method in multi-channel wireless mesh network and device thereof |
| US20120218926A1 (en) * | 2011-02-24 | 2012-08-30 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
| CN104982070A (en) * | 2013-02-07 | 2015-10-14 | 交互数字专利控股公司 | Method and apparatus for selecting a routing path in a mesh network |
-
2017
- 2017-06-30 CN CN201710527349.4A patent/CN107318142B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN101848523A (en) * | 2010-03-05 | 2010-09-29 | 北京北大众志微系统科技有限责任公司 | Path selecting method in multi-channel wireless mesh network and device thereof |
| US20120218926A1 (en) * | 2011-02-24 | 2012-08-30 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
| CN104982070A (en) * | 2013-02-07 | 2015-10-14 | 交互数字专利控股公司 | Method and apparatus for selecting a routing path in a mesh network |
Non-Patent Citations (1)
| Title |
|---|
| 彭铎: "基于分簇的无线传感器网络路由协议研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109644838A (en) * | 2019-01-28 | 2019-04-19 | 温州华隆建设有限公司 | A kind of Landscape water-saving irrigation device |
| CN111405634A (en) * | 2020-02-26 | 2020-07-10 | 中国空间技术研究院 | Method and device for self-adaptive clustering of wireless sensor network |
| CN111405634B (en) * | 2020-02-26 | 2022-03-04 | 中国空间技术研究院 | Method and device for self-adaptive clustering of wireless sensor network |
| CN113613307A (en) * | 2021-07-15 | 2021-11-05 | 天津(滨海)人工智能军民融合创新中心 | On-demand routing method based on local active routing assistance |
| CN113825219A (en) * | 2021-11-10 | 2021-12-21 | 慕思健康睡眠股份有限公司 | Human body data collecting method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107318142B (en) | 2019-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107333314B (en) | A kind of building of wireless sense network cluster and its cluster head update method | |
| Liu | Atypical hierarchical routing protocols for wireless sensor networks: A review | |
| CN102448138B (en) | Method for clustering hierarchical routing protocols of wireless sensor network | |
| CN107318142A (en) | Distributed routing method between a kind of wireless sense network cluster | |
| CN102036308B (en) | Energy balancing wireless sensor network clustering method | |
| CN104135751B (en) | A kind of Uneven Cluster method for routing suitable for subway tunnel | |
| CN103945484B (en) | Farmland wireless self-organized network topology density associated path selection optimization method | |
| Bednarczyk et al. | An enhanced algorithm for MANET clustering based on weighted parameters | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN104853398B (en) | The routing optimization method of tree-shaped wireless sensor network | |
| CN109041127A (en) | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN102711206A (en) | Simulated annealing-based wireless sensor network (WSN) hierarchical routing method | |
| CN106817738A (en) | A kind of method for routing based on Game with Coalitions | |
| Agarwal et al. | REVIEW OF WEIGHTED CLUSTERING ALGORITHMS FOR MOBILE AD HOC NETWORKS. | |
| Tillapart et al. | An approach to hybrid clustering and routing in wireless sensor networks | |
| CN105636144A (en) | Method for prolonging life period of zigbee network | |
| CN107333316A (en) | A kind of wireless sensor network Fault-Tolerant Topology construction method | |
| CN103987102A (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| Talapatra et al. | Mobility based cluster head selection algorithm for mobile ad-hoc network | |
| Wang et al. | An energy-efficient topology control algorithm for earth building monitoring using heterogeneous wireless sensor networks | |
| Kumar et al. | Review of mobility aware clustering scheme in mobile adhoc network | |
| Asha | An energy aware routing mechanism in WSNs using PSO and GSO algorithm | |
| Niewiadomska-Szynkiewicz | Energy aware communication protocols for wireless sensor networks | |
| Neamatollahi et al. | A novel fuzzy metric to evaluate clusters for prolonging lifetime 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 |