CN107318142B - 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
- CN107318142B CN107318142B CN201710527349.4A CN201710527349A CN107318142B CN 107318142 B CN107318142 B CN 107318142B CN 201710527349 A CN201710527349 A CN 201710527349A CN 107318142 B CN107318142 B CN 107318142B
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 198
- 230000005540 biological transmission Effects 0.000 claims abstract description 26
- 238000004891 communication Methods 0.000 claims description 15
- 238000004364 calculation method Methods 0.000 claims description 8
- 230000002776 aggregation Effects 0.000 claims description 7
- 238000004220 aggregation Methods 0.000 claims description 7
- 238000012423 maintenance Methods 0.000 claims description 5
- 230000002452 interceptive effect Effects 0.000 abstract description 4
- 238000009826 distribution Methods 0.000 description 5
- 238000013461 design Methods 0.000 description 3
- 238000005265 energy consumption Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 230000006641 stabilisation Effects 0.000 description 1
- 238000011105 stabilization Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 230000001131 transforming effect Effects 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses distributed routing methods between a kind of wireless sense network cluster, belong to wireless sensor network field, effectively reduce the interference of data transmission between massive wireless sensor cluster head.The present invention includes and being recorded into neighbor table by the mutual logic connecting relation of Hello message exchange and load information between cluster head；For cluster head first according to the father's cluster head quantity and flow load of neighbours' cluster head, the data for calculating cluster head transmit the interference factor transmitted to its neighbours' cluster head data；Submanifold head is the probability that the transmission of next-hop data is undertaken according to each father's cluster head of calculating with the interference factor of father's cluster head.The present invention can be effectively reduced interfering with each other between cluster head in data transmission procedure, improve the data transmission efficiency of network.
Description
Technical field
The invention belongs to wireless sensor network fields, specifically, distributed road between being related to a kind of wireless sense network cluster
By method.
Background technique
Clustering topology is conducive to the application of distributed routing algorithm convenient for management, has preferable scalability, fits
Close massive wireless sensor application.Clustering route protocol usually splits the network into cluster, and each cluster is by cluster head and multiple
Member node in cluster member composition, cluster head management or the entire cluster of control, data pass through multi-hop transmission between cluster head to aggregation node.By
A possibility that high load there are bottleneck, cluster head vulnerable in sensor node, cluster structured divides network increase, this requirement
Routing algorithm has certain fault-tolerant ability.Meanwhile wireless signal interference and channel contention are also in clustering routing design process
Very important key factor.
It routes, transmitted around the data of the generation of cluster head, the formation of cluster and cluster and sets for Wireless sensor network clustering
Many WSN Clustering Routings are counted." 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 connectivity for ensuring to be formed by cluster head by adjusting cluster head covering radius, then
Building convergence tree transmission data.But when network load is larger, the data transmission between different cluster members is easy to produce conflict, makes
It obtains cluster head and collects data efficiency decline, to be easy to cause 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 sensor network carried out by the communication radius for adjusting sensor node it is non-homogeneous
Sub-clustering, then use connected graph Theoretical Design route selection algorithm.But only consider that Energy volution avoids when sub-clustering, so that cluster network is opened up
It flutters to save energy consumption and frequently changes, cause to safeguard that the cost of network stabilization is excessive, network performance is caused to decline.Road between cluster head
Data transmission route is by ignoring the information sharing and biography of wireless sense network protocol stack between graph theory design cluster head is used only by algorithm
Sensor node data transmission feature, effect of optimization are limited.
From the above-mentioned prior art it is found that existing WSN clustering architecture and method for routing energy consumption is unbalanced, performance is unstable；How
More efficient Self-configuring is established, by regional area limited range interior nodes using the characteristics of wireless-sensor network distribution type
Between interaction and information feedback come sub-clustering and routing, reducing internodal data transmission interference, guaranteeing network operation period
Meanwhile raising cluster stability and network data transmission performance still need further to be innovated.
Summary of the invention
1, it to solve the problems, such as
Aiming at the problem that interfering with each other between existing massive wireless sensor cluster head, the present invention provides a kind of wireless biography
Distributed routing method between sense net cluster, can be effectively reduced interfering with each other, alleviating heavy duty between cluster head in data transmission procedure
In the case of network congestion degree, balance network load, extend network lifetime, answered suitable for massive wireless sensor
With.
2, technical solution
To solve the above problems, the present invention adopts the following technical scheme that.
Distributed routing method between a kind of wireless sense network cluster, including using the transmission of cluster head data to the shadow of its neighbours' cluster head
It rings and defines the foundation that interference factor is selected as next-hop.
Preferably, include the following steps:
Step A, between cluster head by the mutual logic connecting relation of Hello message exchange, 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
At, or rely on father, son, same layer relationship between the cluster head that range difference isomery is built between cluster network and aggregation node；
Step B updates and transmits the interference factor transmitted to neighbours' cluster head data with maintenance cluster head i data；
Step C, lower layer network cluster head j are determined each using each father's cluster head interference factor calculated in above-mentioned steps B as foundation
Father's cluster head is the probability of next-hop.
Step D, lower layer network cluster head j select next-hop from father's cluster head using roulette method choice.
Preferably, the calculation formula of cluster head i load estimation value is as follows in step A,
Li、OjRespectively indicate the load estimation value of cluster head i and its submanifold head j, PjIndicate father's cluster head set of cluster head j, CiTable
Show the submanifold head set of cluster head i, UiThe member node set of cluster where cluster head i,Expression is saved by member in the cluster of cluster head of i
The mathematic expectaion of point j reported data amount；| | indicate the number of element in set.
Preferably, in step B, cluster head i data transmit the update and maintenance to the data transmission interference factor of neighbours' cluster head,
Calculation formula is as follows,
The right first item calculates annoyance level of the data transmission to its all father's cluster head of cluster head i；Section 2 calculates cluster head i
The annoyance level that its all submanifold head data is transmitted；Section 3 calculates what cluster head i transmitted all same layer neighbours cluster head data
Annoyance level；
Pi、PkFather's cluster head set of respectively cluster head i and k, CjFor the submanifold head set of cluster head j, CiIndicate the son of cluster head i
Cluster head set, MiFor same layer cluster head set within the scope of cluster head i communication radius, LkIndicate the load estimation value of cluster head k；| | indicate collection
The number of element in conjunction.
Preferably, in step C, lower layer 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, calculation method is as follows,
PjIndicate father's cluster head set of cluster head j, IFj,iFor the interference factor of father's cluster head i of cluster head j, IFj,kFor cluster head j's
The interference factor of father's cluster head k；XjThe neighbours' cluster head quantity for having obtained interference factor value by Hello message for cluster head j, has not been obtained
The cluster head i interference factor value IF of interference factoriIt is 0, and the probability for being selected as next-hop is| | indicate element in set
Number.
3, beneficial effect
Compared with the prior art, the invention has the benefit that
(1) present invention defines the interference factor of sensor node, uses the road wireless sense network Cu Jian based on interference factor
By method, network congestion degree in the case of interfering with each other between cluster head is effectively reduced in data transmission procedure, alleviates heavy duty prolongs
Long network lifetime is suitable for 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
It jumps routing node and distributes select probability, balance network load while improve data transfer efficiency is avoided due to single cluster head
It causes energy loss too fast due to undertaking excessive transformation task, network energy is caused to be unevenly distributed under weighing apparatus and stability
Drop.
Detailed description of the invention
Interference scene of the data transmission that Fig. 1 is cluster head i in the specific embodiment of the invention to its all father's cluster head；
Fig. 2 is the interference scene that cluster head i transmits its all submanifold head data in the specific embodiment of the invention；
Fig. 3 is that cluster head i data transmit the interference scene transmitted to same layer cluster head data in the specific embodiment of the invention；
Fig. 4 is building and its cluster head update method wireless sense network cluster network structure in the specific embodiment of the invention；
A-K indicates each cluster in figure；Solid line is the 1st layer of cluster network；The first dotted line on the inside of solid line close to A, B location is the 0th
Layer cluster network；The second dotted line on the outside of solid line close to the position D, E, F is the 2nd layer of cluster network；It is the 3rd layer of cluster net outside second dotted line
Network；
Fig. 5 is the correspondence figure in the present invention between each cluster, and it is general to represent node flow distribution for arrow fineness in figure
Rate.
In figure, arrow fineness represents node flow distribution probability.According to the least interference proposed in the present invention because
Subpath selection strategy, cluster head is when selecting next-hop in cluster K, between the cluster that cluster network A can be interfered with due to the cluster head of selection cluster F
Data transmission, 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 transmission in network I impacts, and can be biased to selection E rather than D.
Specific embodiment
Present invention will now be described in detail with reference to the accompanying drawings..
In wireless sensor and actor networks, node state constantly changes with the time, also not so as to cause network topology structure
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, i.e. collection whole network topology, link state etc.
Information simultaneously calculates and safeguards that whole routing is clearly unreasonable, has biggish expense using Graph-theoretical Approach building routing.Cause
This, plays the part of energy-efficient routing using being with good expansibility with the hierarchy routing of communication capacity in wireless sensor network
Role be to select well.
The present invention is further described below combined with specific embodiments below.
As shown in figure 4, a kind of multi-level clustering architecture of wireless sense network, there are A-K totally 11 cluster head structures, partition the network into
It is 4 layers, respectively the 0th layer of 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
Transmitting is until aggregation node between cluster.In the cluster network, logic connecting relation is existed only between the cluster head of adjacent layer, same layer net
Logic connecting relation is not present between the cluster head of network.There are in the cluster head of logic connecting relation, the cluster head in upper layer network is known as
Father's cluster head, the cluster head in lower layer's network are known as submanifold head.
Its construction method, the mainly multi-level cluster structure by using aggregation node as starting point, completing the whole network from the near to the distant
It builds；
Specifically comprise the following steps,
The adjacent information of neighbor nodes of Hello message collection is regularly sent after sensor node deployment, between node, is used
Beaconing nodes location algorithm based on RSSI ranging establishes relative coordinate system using aggregation node as beaconing nodes, and each node is protected
Deposit its coordinate information；
Step A is wirelessly communicated in radius centered on aggregation node, by sensor node in the netinit stage
Sensor node is divided into the 0th layer of cluster network；Whether clustering architecture is had been added to according to node, by node divisions all 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 be blank node；
Step B constructs the 1st layer of cluster network using sensor node On Schemes Of Energy Balance method；
Step B1 calculates each sensor node energy-consuming balance value in the 0th layer of cluster network described in step A, and broadcasts cluster
Request message is constructed, the energy-consuming balance value calculating method of node i is as follows:
Indicate the primary power of node i, J is the set of all neighbor node j of node i；| | indicate element in set
Number；D () indicates the Euclidean distance between two nodes.
Step B2, after the cluster for receiving all 0th layer of neighbor nodes constructs message, blank node selection has maximum energy consumption
Clustering architecture is added into cluster message request as cluster head, by replying in the neighbor node of equilibrium valve；
Step B3, the 0th node layer receive blank node enter cluster message after, detect whether its own is target section
Point broadcasts cluster message if itself being destination node, and notice bunch member node enters sleep state；If node is in cluster net
The request into clusters message that itself is destination node is not received yet after network building duration T time-out, then the node is gone forward side by side for ordinary node
Enter sleep state；So far, the building of the 1st layer of cluster network is completed；
T takes 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 successively establishes lower layer's cluster network of the 1st layer of cluster network using cluster head ability value as foundation, that is, establishes the 2nd,
3 ... n-th layer cluster network, N >=2；The specific steps are,
Step C1, each cluster member calculates itself cluster head ability value in N-1 layers of cluster network, then broadcasts cluster building request and disappears
Breath；
First, it is determined that when node i serves as cluster head role the cluster stationary value Si, calculation formula is as follows:
MiFor node i, neighbor node set, r are communication radius in same layer cluster network, and d () is indicated between two nodes
Euclidean distance,WithRespectively indicate the dump energy and primary power of node j；
Then, calculate node cluster head ability value,
ZiFor the blank node set within the scope of node i communication radius；For ZiIn each node on count off
According to 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；| | table
Show the number of element in set；
Step C2 saves its cluster head ability value to neighbour after receiving the cluster building message from N-1 layers of neighbor node
It occupies in table.After the cluster for receiving all upper layer neighbours cluster heads constructs 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 layer receive n-th layer node enter cluster message after, detect whether its own is target
Node broadcasts cluster message if itself being destination node, and notice bunch member node enters sleep state；If node is in cluster
The request into clusters message that itself is destination node is not received after time-out yet within network struction duration T=2 seconds, then the node is common section
It puts and enters sleep state；So far, the building of n-th layer cluster network is completed；
T takes 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 repeats step C1-C3, until completing the cluster network struction of entire 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 comprises the following steps,
Step A, cluster head i are assessed whether can satisfy and are continued to carry on a shoulder pole according to the factors such as dump energy, flow load using following formula
Appoint cluster head, if following formula is unsatisfactory for, goes to step B and carry out cluster update；
Indicate the dump energy of cluster head i,Indicate that cluster head i's consumes being averaged for energy in a wheel data transmission
Value, CiFor the submanifold head set of cluster head i, UiFor the member node set of cluster where cluster head i；With the bunch member node j of cluster head i
The mathematic expectaion of reported data amount, Li、LjRespectively indicate the mathematic expectaion of the flow load of cluster head i and its submanifold head j；
Step B, cluster head i by broadcast cluster update message, notify its neighbor node this enter 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, the dump energy of j and place level, is counted as the following formula
The cluster head ability value of itself is calculated,
D () indicates the Euclidean distance of cluster head i and node j,Indicate the dump energy of node j, CjIndicate node
Cluster head set, P in lower layer's network in the communication radius of jjIndicate in node j communication radius cluster head set, P in upper layer networkkIt indicates
In the communication radius of node j in lower layer'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 replaces message, and completes role transforming；
Step D receives the cluster head replacement message of cluster head i but does not receive the node of the cluster head replacement message from new cluster head
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
Message is added in request, otherwise enters isolated node state.Isolated node selects the maximum neighbor node of dump energy to relay data,
During the later period network operation, the cluster with maximum cluster head ability value is added when such as receiving new cluster head broadcast message；
Step E, cluster isolate cluster and execute step B and C progress cluster update caused by updating.
Distributed routing method between a kind of wireless sense network cluster, obtains from the multi-level cluster construction method of wireless sense network above-mentioned
To there is logically the virtual cluster head networks of multi-connection relationship to carry out tree-shaped distributed routing.The present invention uses interference factor as choosing
Select the foundation of next-hop node.Concrete scheme is as follows:
Step A, between cluster head by the mutual logic connecting relation of Hello message exchange, cluster head load estimation value and from
The interference factor of body, and be recorded into respective neighbor table；
In neighbor table, father, son, same layer relationship between the cluster head directly formed during cluster network struction are marked；
The calculation formula of cluster head i load estimation value is as follows in this step,
Li、OjRespectively indicate the load estimation value of cluster head i and its submanifold head j, PjIndicate father's cluster head set of cluster head j, CiTable
Show the submanifold head set of cluster head i, UiThe member node set of cluster where cluster head i,It indicates using i as member in the cluster of cluster head
The mathematic expectaion of node j reported data amount；| | indicate the number of element in set.
Step B updates and transmits the interference factor transmitted to neighbours' cluster head data with maintenance cluster head i data；
Update and maintenance of the cluster head i data transmission to the data transmission interference factor of neighbours' cluster head, meter are determined in this step
It is as follows to calculate formula,
The right first item calculates cluster head i to the annoyance level of the submanifold head data transmission of all members in his father's cluster head set
(Fig. 1)；Section 2 calculates the annoyance level (Fig. 2) that cluster head i transmits member datas all in its submanifold head；Section 3 calculates cluster
The annoyance level (Fig. 3) that head i transmits all same layer neighbours cluster head data；
Pi、PkFather's cluster head set of respectively cluster head i and k, CjFor the submanifold head set of cluster head j, CiIndicate the son of cluster head i
Cluster head set, MiFor same layer cluster head set within the scope of cluster head i communication radius, LkIndicate the load estimation value of cluster head k；| | indicate collection
The number of element in conjunction.
Step C, lower layer network cluster head j are using each father's cluster head interference factor calculated as foundation, under determining that each father's cluster head is
One probability jumped；
Calculation method is as follows,
PjIndicate father's cluster head set of cluster head j, IFj,iFor the interference factor of father's cluster head i of cluster head j, IFj,kFor cluster head j's
The interference factor of father's cluster head k；XjThe neighbours' cluster head quantity for having obtained interference factor value by Hello message for cluster head j, has not been obtained
The cluster head i interference factor value IF of interference factoriIt is 0, and the probability for being selected as next-hop is| | indicate element in set
Number.
The above description is only an embodiment of the present invention, is not intended to restrict the invention.The present invention can have various conjunctions
Suitable change and variation.Any modification, equivalent substitution, improvement and etc. done within the spirit and principles of the present invention, should all
It is included within protection scope of the present invention.
Claims (3)
1. distributed routing method between a kind of wireless sense network cluster characterized by comprising
Step A, between cluster head by the mutual logic connecting relation of Hello message exchange, cluster head load estimation value and itself
Interference factor, and be recorded into respective neighbor table；
In neighbor table, mark what cluster network struction was directly formed in the process, or rely on range difference between cluster network and aggregation node
Father, son, same layer relationship between the cluster head that isomery is built；
Step B updates and transmits the interference factor transmitted to its neighbours' cluster head data with maintenance cluster head i data；
Step C, lower layer network cluster head j determine each father's cluster using each father's cluster head interference factor calculated in above-mentioned steps B as foundation
Head is the probability of next-hop；
Interference factor in the step B, calculation formula is as follows,
The right first item calculates annoyance level of the data transmission to its all father's cluster head of cluster head i；Section 2 calculates cluster head i to it
The annoyance level of all submanifold head data transmission；Section 3 calculates the interference that cluster head i transmits all same layer neighbours cluster head data
Degree；
Pi、PkFather's cluster head set of respectively cluster head i and k, CjFor the submanifold head set of cluster head j, CiIndicate the submanifold head collection of cluster head i
It closes, MiFor same layer cluster head set within the scope of cluster head i communication radius, LkIndicate the load estimation value of cluster head k；| | indicate member in set
The number of element.
2. distributed routing method between a kind of wireless sense network cluster according to claim 1, it is characterised in that: in step A
The calculation formula of cluster head i load estimation value is as follows,
Li、OjRespectively indicate the load estimation value of cluster head i and its submanifold head j, PjIndicate father's cluster head set of cluster head j, CiIndicate cluster
The submanifold head set of head i, UiThe member node set of cluster where cluster head i,It indicates using i as member node j in the cluster of cluster head
The mathematic expectaion of reported data amount；| | indicate the number of element in set.
3. distributed routing method between a kind of wireless sense network cluster according to claim 1, it is characterised in that: in step C,
Lower layer network cluster head j determines that each father's cluster head is the probability of next-hop, calculation method is such as using his father's cluster head interference factor as foundation
Under,
PjIndicate father's cluster head set of cluster head j, IFj,iFor the interference factor of father's cluster head i of cluster head j, IFj,kFor father's cluster head of cluster head j
The interference factor of k；XjNeighbours' cluster head quantity of interference factor value has been obtained by Hello message for cluster head j, have not been obtained interference because
The cluster head i interference factor value IF of soniIt is 0, and the probability for being selected as next-hop is| | indicate 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 CN107318142A (en) | 2017-11-03 |
| CN107318142B true 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) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109644838B (en) * | 2019-01-28 | 2020-09-29 | 温州华隆建设有限公司 | Gardens water-saving irrigation device |
| CN111405634B (en) * | 2020-02-26 | 2022-03-04 | 中国空间技术研究院 | Method and device for self-adaptive clustering of wireless sensor network |
| CN113613307B (en) * | 2021-07-15 | 2023-08-04 | 天津(滨海)人工智能军民融合创新中心 | On-demand routing method based on local active routing assistance |
| CN113825219B (en) * | 2021-11-10 | 2022-06-24 | 慕思健康睡眠股份有限公司 | Human body data collecting method and device |
| CN114900871A (en) * | 2022-05-31 | 2022-08-12 | 长春工业大学 | Wireless sensor network clustering method based on affinity propagation and chaos lion group |
Citations (3)
| 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 |
| CN104982070A (en) * | 2013-02-07 | 2015-10-14 | 交互数字专利控股公司 | Method and apparatus for selecting routing paths in a mesh network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8630222B2 (en) * | 2011-02-24 | 2014-01-14 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
-
2017
- 2017-06-30 CN CN201710527349.4A patent/CN107318142B/en active Active
Patent Citations (3)
| 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 |
| CN104982070A (en) * | 2013-02-07 | 2015-10-14 | 交互数字专利控股公司 | Method and apparatus for selecting routing paths in a mesh network |
Non-Patent Citations (1)
| Title |
|---|
| 基于分簇的无线传感器网络路由协议研究;彭铎;《中国优秀硕士学位论文全文数据库》;20091115;第4.3.4节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107318142A (en) | 2017-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107318142B (en) | Distributed routing method between a kind of wireless sense network cluster | |
| CN107333314B (en) | A kind of building of wireless sense network cluster and its cluster head update method | |
| CN102448138B (en) | Method for clustering hierarchical routing protocols of wireless sensor network | |
| CN102036308B (en) | Energy balancing wireless sensor network clustering method | |
| CN113260012B (en) | Unmanned aerial vehicle cluster topology control method based on position track prediction | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN104135751B (en) | A kind of Uneven Cluster method for routing suitable for subway tunnel | |
| Li et al. | A multi-agent reinforcement learning routing protocol for underwater optical sensor networks | |
| CN106817738A (en) | A kind of method for routing based on Game with Coalitions | |
| CN110121200B (en) | Energy-efficient networking method in heterogeneous sensor network | |
| CN105898764B (en) | Multi-level energy heterogeneous wireless sensor network deployment method | |
| Agarwal et al. | REVIEW OF WEIGHTED CLUSTERING ALGORITHMS FOR MOBILE AD HOC NETWORKS. | |
| CN102143546B (en) | Method for reducing redundant routing packet in tree ZigBee network | |
| CN108366093A (en) | One kind being based on the distributed wireless ad hoc network of " virtual center " and " mobile agent " | |
| CN105636144A (en) | Method for prolonging life period of zigbee network | |
| CN103686855A (en) | Wireless sensor network data convergence method | |
| CN103987102B (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| Kumar et al. | Review of mobility aware clustering scheme in mobile adhoc network | |
| Liu et al. | A Position Sensitive Clustering Algorithm for VANET. | |
| Gautam et al. | Data dissemination in wireless sensor networks: A state-of-the art survey | |
| CN110324875B (en) | Wireless sensor network energy consumption balanced routing method based on node centrality | |
| CN113162638A (en) | SDWSN (software development station network) topology control algorithm based on non-cooperative game | |
| Geng et al. | An energy-efficient hierarchical topology control algorithm in software-defined wireless sensor network | |
| Yu et al. | Scalable topology and energy management in wireless sensor networks | |
| Yang et al. | A multipath routing protocol based on clustering and ant colony optimization for 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 |