CN106851596A - A kind of dynamic ad hoc network method of agricultural environment wireless sense network - Google Patents
A kind of dynamic ad hoc network method of agricultural environment wireless sense network Download PDFInfo
- Publication number
- CN106851596A CN106851596A CN201710021299.2A CN201710021299A CN106851596A CN 106851596 A CN106851596 A CN 106851596A CN 201710021299 A CN201710021299 A CN 201710021299A CN 106851596 A CN106851596 A CN 106851596A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- cluster head
- message
- leader
- 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.)
- Pending
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
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
- H04W4/08—User group management
-
- 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/246—Connectivity information discovery
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present invention relates to a kind of dynamic ad hoc network method of agricultural environment wireless sense network.All nodes build the information of neighbor nodes list of oneself in inventive sensor network, elect the leader cluster node V of each layeri, generate message and the number of plies residing for more new node and transmission radius, receive ViCluster head generation message after judge whether add ViIf adding Vi, then node VjAs member node, by leader cluster node ViManagement, node VkDo not receive any cluster head generation message, but with member node VjDistance be less than minimum transfer radius TRopt, then node VkAdd member node VjAs guest's node, by leader cluster node ViManagement.Instant invention overcomes the defect of single-hop route.Cluster interior nodes sub-clustering head node of the present invention, member node and guest's node three-level, improve the connectedness of inserting knot sparse region network, balanced energy consumption to greatest extent is reached by minimizing cluster, amount of communication data is further reduced in cluster, so as to effectively mitigate the communications burden of cluster head.
Description
Technical field
The present invention relates to wireless self-networking field, more particularly to a kind of dynamic ad hoc network side of agricultural environment wireless sense network
Method.
Background technology
With the continuous progress of radio communication and microelectric technique, by a large amount of low costs and the multifunctional sensing of energy constraint
The wireless sense network of device node composition starts to be widely used in agriculture Internet of Things field.In order to use sensing as efficiently as possible
The energy of device node and the to greatest extent life span of extension network, propose the solution of stratification in terms of route.
Sensor network is divided into hierarchical structure in logic by such scheme using corresponding algorithm, and the node in network is divided into cluster head
With cluster member.Cluster head as place cluster control centre, be responsible for the formation of clustering architecture, in cluster member data collection, merge institute
Data Concurrent is obtained to give other cluster heads or be transmitted directly to base station.
Before the present invention makes, traditional Clustering Routing such as LEACH algorithms at present, its basic thought is：
Cluster generation phase, the random number between each node selection one [0,1], if this number is less than threshold value T (n), the node is worked as
Elect cluster head as.The computational methods of T (n) can be described as formula (1),
Wherein, p is the probability of the elected cluster head of the percentage that cluster head accounts for all nodes, i.e. node；R is that circulation is carried out at present
Wheel number；G is the node set for not being elected to cluster head during nearest 1/p takes turns also.
Although the algorithm of this kind of periodic replacement cluster head can solve the problems, such as that cluster head energy consumption is too fast, in terms of cluster head selection
Randomness is too strong and the scope that does not account for capacity factor.Especially, when cluster head skewness in a certain specific region
It is even or when excessively concentrating, the Euclidean distance between most member node and the leader cluster node of oneself it is far and can only single-hop pass
Defeated, they would have to transmit to cluster head packet by improving transmit power, and this energy consumption to network is greatly to waste.
Additionally, during this kind of algorithm not included the Consideration of election of cluster head by capacity factor, when the dump energy of some leader cluster nodes
It is relatively low cannot complete normal leader cluster node router tasks when, all data that whole cluster interior nodes are collected all will be unable to send
Go out, this can also have a strong impact on the various aspects of performance of network.
And cluster is also divided into leader cluster node and member node two-stage by other traditional Clustering Routings more, if the face of cluster
Product is larger, even if member node is in the coverage that leader cluster node communicates, if wanting, completing remote data by single-hop passes
Defeated to be also required to substantial amounts of energy, now, the single-hop routing mode in this cluster does not obviously meet the multi-hop energy-conservation of wireless sense network
Principle.
The content of the invention
The purpose of the present invention is that and overcomes drawbacks described above, proposes a kind of dynamic ad hoc network of agricultural environment wireless sense network
Method.
Technical scheme is as follows：
A kind of dynamic ad hoc network method of agricultural environment wireless sense network, it is characterised in that comprise the following steps：
(1) all nodes are initialized and broadcast the message in sensor network, and each node builds the neighbor node of oneself
Information list；
(2) the leader cluster node V of each layer is electedi, after leader cluster node, residing for broadcast cluster head generation message and more new node
The number of plies and transmission radius；
(3) node VjReceive ViCluster head generation message after judge whether add ViIf adding Vi, then node VjAs member
Node, by leader cluster node ViManagement；
(4) node VkDo not receive any cluster head generation message, but with member node VjDistance less than minimum transfer half
Footpath TRopt, then node VkAdd member node VjAs guest's node, by leader cluster node ViManagement；
(5) repeat step (2)-(4), until transmission radius is equal to the radius TR of whole networkmax；
(6) terminate to a wheel, restart next round.
Further, in above-mentioned steps (1), each node initializing comprises the following steps：
(1.1) each node includes to the message that neighbor node is broadcasted：Node ID, residue energy of node RE and node are to base station
Apart from DtoBS；
(1.2) during each node initializing, initial content is：Node level ClusterLevel is that 0, leader cluster node is base station
BS, election contest cluster head result are failure, node-node transmission radius is TRopt。
Further, in above-mentioned steps (1.2) each node optimal communication scope TRoptCan be described as formula (2)
EelecRepresent that reception/radiating circuit receives/launch the energy that every bit signal is consumed, εampIt is the transmitting of node
Amplifying circuit propagates the energy consumed per bit signal in unit area.
Further, in above-mentioned steps (2), node ViNeed to meet following requirement during election contest cluster head：
(2.1) node ViCluster head, i.e. node V are not chosen as beforeiElection contest cluster head result in message is failure, only
Non- leader cluster node in network could turn into the both candidate nodes of upper strata cluster head, and a certain node can only turn into the cluster head of a certain layer；
(2.2) in node ViIt is not chosen as on the basis of cluster head before, a random number is chosen in the range of (0,1),
If this number is less than T (n), node ViJust it is elected as cluster head；
(2.3) node ViIt is chosen as after cluster head, it is necessary to more new node ViCluster head generation message, specifically include：Election contest cluster head
Result be successfully, node layer numerical value add 1, transmission radius value be updated to TRopt* node layer numerical value.
Further, threshold value T (n) in above-mentioned steps (2.2) can be described as formula (3)
P is the probability that the percentage that cluster head accounts for all nodes, i.e. node are elected as cluster head, and r is the wheel that previous cycle is carried out
Number, rsRepresent that node is not elected to the round of cluster head continuously, once in power cluster head, rsReset to 0.
Further, the radius size used when each leader cluster node broadcasts the message in above-mentioned steps (2.3) is different, and it is minimum
Value is TRopt, but the maximum radius size TR no more than whole networkmax。
Further, in above-mentioned steps (3), node VjReceive ViCluster head generation message after need to judge whether to add Vi,
Basis for estimation is as follows：
(3.1) node VjReceive ViCluster head generation message after, first check the affiliated number of plies of the corresponding cluster head of the message whether be
The direct upper strata of oneself, that is, judge Vj(ClusterLevel)+1=Vi(ClusterLevel) whether set up, if invalid,
Then node VjDo not do any response directly to abandon, otherwise, by node ViCluster head generation message be stored in VjCandidate cluster head list
SCH；
(3.2) if VjCandidate cluster head list SCHIn have the message of multiple leader cluster nodes, i.e. VjNeighbor node in have
Multiple cluster heads then compare candidate cluster head list S in transmission radiusCHIn each cluster head dump energy RE with they to base station away from
From DtoBSRatio R E/DtoBS, take the maximum node V of ratioiAs VjCluster head, VjAs ViMember node and managed by it
Reason；
(3.3) if VjCandidate cluster head list SCHMiddle only one of which leader cluster node ViMessage, i.e. VjNeighbor node in
Only one of which leader cluster node ViIn transmission radius, then node V is directly added intoiThe cluster at place, VjAs ViMember node and receive
It is managed.
Further, in above-mentioned steps (4), for those candidate cluster head lists SCHIt is empty node Vk, need to be by neighbours
Member node closest in node adds corresponding cluster, and method is as follows：
(4.1) node VkCandidate cluster head list SCHBe space-time, find in neighbor node apart from oneself nearest one into
Member's node Vj, whether judging distance is less than minimum transfer radius TRopt, if so, then node VkAdd member node VjAs visitor
People's node, and guest's node VkWith member node VjReceive leader cluster node ViManagement, if not, then node VkAny sound is not done
Next cluster head generation message should be waited.
Further, in above-mentioned steps (5), when certain node layer uses TRmaxDuring as current transmission radius, cluster head generation
Message will just cover whole network, and now the node in whole network can all add the cluster of equivalent layer, cluster generation phase to terminate.
Beneficial effects of the present invention include it is following some：
1st, the present invention makes the replacement of leader cluster node more reasonable using multilayer clustering routing mechanism, is reached by minimizing cluster
Balanced energy consumption to greatest extent, amount of communication data is further reduced in cluster, so as to effectively mitigate the communications burden of cluster head；
2nd, when leader cluster node is campaigned for, by the scope that accounts for capacity factor to improve threshold calculations in terms of not
Foot, so that the election of leader cluster node is more reasonable, further extends the life span of whole network；
3rd, cluster interior nodes sub-clustering head node, member node and guest's node three-level, when certain non-leader cluster node does not receive cluster
It is first-born cluster indirectly to be added by member node into during message, improve the connectedness of inserting knot sparse region network.
Brief description of the drawings
Fig. 1 --- wireless sensor network structural representation of the invention.
Fig. 2 --- the dynamic self-organization process schematic of layer interior nodes of the invention；Wherein, A is that first round self-organizing is shown
It is intended to, B is the second wheel self-organizing schematic diagram, and C is third round self-organizing schematic diagram, and D is fourth round self-organizing schematic diagram.
Specific embodiment
The invention will be further described with specific embodiment below in conjunction with the accompanying drawings.
It is as shown in Figure 1 wireless sensor network structural representation of the invention, in the wireless self-networking belonging to the present invention
Including multiple aggregation nodes, some leader cluster nodes, some member nodes and some guest's nodes.As shown in figure 1, by all nodes
The election that layering and every layer all carry out leader cluster node, illustrates to build the reality of agriculture Internet of Things in employing wireless sensor network
In, by the great deal of nodes of monitored area according to layered mode MANET importance.Before MANET, all nodes are needed
Initialize and build the information of neighbor nodes list of oneself.Wherein, the message package content bag that each node is broadcasted to neighbor node
Include：Node ID, residue energy of node RE and node are to base station apart from DtoBS.During each node initializing, initial content is：Node
Number of plies ClusterLevel is that 0, leader cluster node is base station BS, campaigns for cluster head result for failure, node-node transmission radius are TRopt, its
In, the optimal communication scope TR of each nodeoptCan be described as formula (2)
EelecRepresent that reception/radiating circuit receives/launch the energy that every bit signal is consumed, εampIt is the transmitting of node
Amplifying circuit propagates the energy consumed per bit signal in unit area.
The transmission radius of every layer of cluster head is proportional with node level, specially：TRopt* node layer numerical value.Top layer
Leader cluster node is aggregation node, and the transmission radius of aggregation node covers the whole network, and each aggregation node will by wireless receiving and dispatching mode
Data are uploaded to base station after fusion, are transmitted to host computer by base station and shown.From top layer cluster head downwards, each subordinate's cluster head is by oneself cluster
The data of interior nodes superior cluster head transmission successively, this transmission mechanism can reduce hop count during data transfer, reduce net
The energy consumption of network, shortens transmission delay.
It is divided into 3 grades, i.e. leader cluster node, member node and guest's node per node layer.In the messaging list of each node
The hierarchical information of oneself is all included, for member node, after they receive certain cluster head generation message, the message pair is first checked
Whether the affiliated number of plies of cluster head answered is the direct upper strata of oneself, that is, judge that level and the level of oneself in cluster head generation message are
It is no to meet Vj(ClusterLevel)+1=Vi(ClusterLevel) relation, if invalid, member node does not do any sound
Should directly abandon, the cluster head generation message of the leader cluster node is just otherwise stored in the candidate cluster head list S of oneselfCHIn.If
Member node finds the candidate cluster head list S of oneselfCHIn have the message of multiple leader cluster nodes, i.e., have multiple cluster heads in neighbor node
In transmission radius, then compare candidate cluster head list SCHIn each cluster head dump energy RE with them to base station apart from DtoBS's
Ratio R E/DtoBS, the maximum leader cluster node of ratio is finally taken as the cluster head of oneself.If candidate cluster head list SCHIn only one
In transmission radius, then member node is directly added into only one of which leader cluster node in the message of individual leader cluster node, i.e. neighbor node
The cluster.
For the firm node for adding and mobile node, if after election of cluster head terminates and before a wheel end of transmission oneself
Beyond the transmission radius of leader cluster node, then these nodes are referred to as guest's node and are added the cluster indirectly by member node.Institute
So that each layer leader cluster node also needs to receive the member node in this cluster and guest saves except receiving the data after subordinate's cluster head fusion
The data of point, and upper strata cluster head is uploaded to together after doing further fusion.
The dynamic self-organization process schematic of layer interior nodes of the invention is illustrated in figure 2, present invention offer is provided
Ad hoc network method all has preferably transmission strategy when changing in face of various network dynamics, specifically includes following process：
(1) as shown in Fig. 2-A, after new node is added, network will indirectly be added as guest's node.The leader cluster node of this layer
It is node 1 and node 6 to elect, and has two new nodes (node 11 and node 12) to add the layer, two before this wheel terminates
The new node for adding exceeds the transmission radius (the circular transmission range for representing leader cluster node in Fig. 2) of leader cluster node 1 and node 6,
Then new node finds the member node nearest apart from oneself.By the transmission and judgement of packet, apart from node 11 it is nearest into
Member's node is node 5, and the member node nearest apart from node 12 is node 10, and two member nodes are all in newly added node
In the range of communication radius, then the Monitoring Data bag of oneself is sent to member node by new node, is processed by member node and is sent
To leader cluster node.So ensure that the node of new addition can be directly added into network and carry out route work so that whole dynamic
State network has the effect of self-organizing.Certainly, it is contemplated that every layer of transmission radius of cluster head be with node level relation：TRopt*
ClusterLevel (node layer numerical value), so new two nodes for adding are in the transmission radius of last layer cluster head, but examines
Multihop routing can reduce certain energy consumption relative to single-hop transmission when considering distant, so the present invention is used in every cluster
3 level structures.
(2) as shown in fig. 2-b, after new node is added, communication radius interior both not leader cluster node or not member node, etc.
Treat that next round route adds network.The leader cluster node election of this layer is node 3 and node 9, has one before this wheel terminates
New node (node 13) adds the layer, the new node for adding not in the transmission radius of leader cluster node 3 and node 9, distance compared with
Near member node 5 and node 12 are also beyond the communication radius of oneself, the then wait of node 13 next round route networking point again
Cluster.Certainly, it is contemplated that every layer of transmission radius of cluster head be with node level relation：TRopt* ClusterLevel (node levels
Value), so the new node for adding in certain layer of transmission radius of cluster head, but must rely on the transmission of the topological each layer cluster head of traversal
The method of radius finds suitable cluster head and can bring huge control overhead, and the node that the cluster head potential range for finding newly is added
Farther out, so method of the present invention using waiting next round to route networking sub-clustering again.
(3) as shown in Fig. 2-C, again after networking sub-clustering, if guest's node of some clusters is in the biography of another leader cluster node
In defeated radius, then guest's node adds cluster head as member node.This layer leader cluster node election be node 4 and node 7, this
Outward, the new election contest of node 13 for adding of the second wheel is new cluster head.The cluster head generation that guest's node 5,11 and 12 receives node 13 disappears
The transmission radius of node 13 is learnt after breath can cover oneself, then the cluster where node 5,11 and 12 adds node 13 turns into
Member's node.Because compared to two other leader cluster node, they and leader cluster node 13 between distance closer to and can be with by single-hop
Data transfer is done directly, delaying for energy consumption and network is it reduced, the characteristics of having catered to network dynamic and change.
(4) as depicted in fig. 2-d, if there are multiple member nodes in the communication radius of guest's node and apart from identical or
It is more or less the same, then the minimum member node of guest's node selection load is added.Wherein, load it is small refer specifically to it is straight with the member node
Guest's number of nodes of connection letter is less or data packet number is less.The leader cluster node election of this layer is node 2,10 and node
12, there are two nodes (node 14 and node 15) to need to find member node outside the transmission radius of these three leader cluster nodes
Certain cluster is added indirectly.Node 14 finds the member node nearest apart from oneself for node 4, therefore node 14 turns into the guest of node 4
Node is simultaneously managed by leader cluster node 2.And node 15 finds node 4 and node 7 logical by the transmission and judgement of packet
In news radius, and node 15 finds that the neighbor node 14 of oneself has passed through the cluster where node 4 adds leader cluster node 2, and
Not having node in the neighbor node of oneself turns into guest's node of node 7, then node 15 sends the Monitoring Data bag of oneself
To member node 7 and receive leader cluster node 10 and manage.So there is the effect of energy balance to a certain extent, relative extension is whole
The life span of individual network.
The invention provides a kind of ad hoc network method based on Agricultural Environmental Monitoring, specifically by the multilayer in cluster algorithm point
Cluster and multistage sub-clustering thought are combined, and the single-hop energy consumption that the presence of multilayer Clustering Routing had both been alleviated to a certain extent is higher
Problem, decreases the control overhead that multistage cluster algorithm brings.Meanwhile, the present invention has the two advantage concurrently, network autgmentability,
Reduce and balanced energy consumption, reduction network have certain improvement in terms of delaying and extending network lifetime.
Claims (6)
1. a kind of dynamic ad hoc network method of agricultural environment wireless sense network, it is characterised in that comprise the following steps：
(1) all nodes are initialized and broadcast the message in sensor network, and each node builds the information of neighbor nodes of oneself
List；
(2) the leader cluster node V of each layer is electedi, after leader cluster node, broadcast cluster head generation message and the number of plies residing for more new node
With transmission radius；
(3) node VjReceive ViCluster head generation message after judge whether add ViIf adding Vi, then node VjAs member's section
Point, by leader cluster node ViManagement；
(4) node VkDo not receive any cluster head generation message, but with member node VjDistance be less than minimum transfer radius
TRopt, then node VkAdd member node VjAs guest's node, by leader cluster node ViManagement；
(5) repeat step (2)-(4), until transmission radius is equal to the radius TR of whole networkmax；
(6) terminate to a wheel, restart next round.
2. the dynamic ad hoc network method of a kind of agricultural environment wireless sense network according to claim 1, it is characterised in that：Institute
State in step (1), each node initializing comprises the following steps：
(1.1) each node includes to the message that neighbor node is broadcasted：Node ID, residue energy of node RE and node to base station away from
From DtoBS；
(1.2) during each node initializing, initial content is：Node level ClusterLevel is 0, leader cluster node is base station BS,
Election contest cluster head result is failure, node-node transmission radius is TRopt。
Further, in above-mentioned steps (1.2) each node optimal communication scope TRoptComputing formula is
EelecRepresent that reception/radiating circuit receives/launch the energy that every bit signal is consumed, εampFor electricity is amplified in the transmitting of node
The energy consumed per bit signal is propagated in unit area in road.
3. the dynamic ad hoc network method of a kind of agricultural environment wireless sense network according to claim 1, it is characterised in that：Institute
In stating step (2), node ViNeed to meet following requirement during election contest cluster head：
(2.1) node ViCluster head, i.e. node V are not chosen as beforeiElection contest cluster head result in message is failure, only network
In non-leader cluster node could turn into upper strata cluster head both candidate nodes, and a certain node can only turn into a certain layer cluster head；
(2.2) in node ViIt is not chosen as on the basis of cluster head before, a random number is chosen in the range of (0,1), if this
Number is less than T (n), node ViJust it is elected as cluster head；
(2.3) node ViIt is chosen as after cluster head, it is necessary to more new node ViCluster head generation message, specifically include：Election contest cluster head result
To succeed, node layer numerical value adds 1, transmission radius value is updated to TRopt* node layer numerical value.
Further, the computing formula of threshold value T (n) in above-mentioned steps (2.2) is
P is the probability that the percentage that cluster head accounts for all nodes, i.e. node are elected as cluster head, and r is the wheel number that previous cycle is carried out, rs
Represent that node is not elected to the round of cluster head continuously, once in power cluster head, rsReset to 0.
Further, the radius size used when each leader cluster node broadcasts the message in above-mentioned steps (2.3) is different, its minimum value
It is TRopt, but the maximum radius size TR no more than whole networkmax。
4. the dynamic ad hoc network method of a kind of agricultural environment wireless sense network according to claim 1, it is characterised in that：Institute
In stating step (3), node VjReceive ViCluster head generation message after need to judge whether to add Vi, basis for estimation is as follows：
(3.1) node VjReceive ViCluster head generation message after, first check whether the affiliated number of plies of the corresponding cluster head of the message is oneself
Direct upper strata, that is, judge Vj(ClusterLevel)+1=Vi(ClusterLevel) whether set up, if invalid, save
Point VjDo not do any response directly to abandon, otherwise, by node ViCluster head generation message be stored in VjCandidate cluster head list SCH；
(3.2) if VjCandidate cluster head list SCHIn have the message of multiple leader cluster nodes, i.e. VjNeighbor node in have multiple clusters
Head then compares candidate cluster head list S in transmission radiusCHIn each cluster head dump energy RE with them to base station apart from DtoBS
Ratio R E/DtoBS, take the maximum node V of ratioiAs VjCluster head, VjAs ViMember node and managed by it；
(3.3) if VjCandidate cluster head list SCHMiddle only one of which leader cluster node ViMessage, i.e. VjNeighbor node in only
One leader cluster node ViIn transmission radius, then node V is directly added intoiThe cluster at place, VjAs ViMember node and managed by it
Reason.
5. the dynamic ad hoc network method of a kind of agricultural environment wireless sense network according to claim 1, it is characterised in that：Institute
In stating step (4), for those candidate cluster head lists SCHIt is empty node Vk, need to be by member closest in neighbor node
Node adds corresponding cluster, and method is as follows：
(4.1) node VkCandidate cluster head list SCHIt is space-time, member section nearest apart from oneself in searching neighbor node
Point Vj, whether judging distance is less than minimum transfer radius TRopt, if so, then node VkAdd member node VjAs guest's section
Point, and guest's node VkWith member node VjReceive leader cluster node ViManagement, if not, then node VkAny response etc. is not done
Treat next cluster head generation message.
6. the dynamic ad hoc network method of a kind of agricultural environment wireless sense network according to claim 1, it is characterised in that：Institute
In stating step (5), when certain node layer uses TRmaxDuring as current transmission radius, cluster head generation message will just cover whole net
Network, now the node in whole network can all add the cluster of equivalent layer, cluster generation phase to terminate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710021299.2A CN106851596A (en) | 2017-01-10 | 2017-01-10 | A kind of dynamic ad hoc network method of agricultural environment wireless sense network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710021299.2A CN106851596A (en) | 2017-01-10 | 2017-01-10 | A kind of dynamic ad hoc network method of agricultural environment wireless sense network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106851596A true CN106851596A (en) | 2017-06-13 |
Family
ID=59124806
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710021299.2A Pending CN106851596A (en) | 2017-01-10 | 2017-01-10 | A kind of dynamic ad hoc network method of agricultural environment wireless sense network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106851596A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107786957A (en) * | 2017-09-28 | 2018-03-09 | 韦彩霞 | A kind of farmland ecological environment monitoring system for precision agriculture |
| CN108566664A (en) * | 2018-05-08 | 2018-09-21 | 贵州大学 | A kind of WSN clustering routing optimization methods of distribution high energy efficiency |
| CN108601095A (en) * | 2018-05-08 | 2018-09-28 | 常熟理工学院 | A kind of implementation method of multimedia sensing network |
| CN110962888A (en) * | 2019-12-09 | 2020-04-07 | 中南大学 | Real-time dynamic train marshalling method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158929A (en) * | 2011-03-23 | 2011-08-17 | 浙江威奇电气有限公司 | Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network |
| CN103533595A (en) * | 2013-10-28 | 2014-01-22 | 天津工业大学 | Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks |
| KR101560523B1 (en) * | 2015-02-17 | 2015-10-15 | 성균관대학교산학협력단 | Operating method of wireless sensor networks considering energy efficiency |
| KR20160018050A (en) * | 2014-08-07 | 2016-02-17 | 서울시립대학교 산학협력단 | Energy-based data trasmission method for wireless sensor networks |
-
2017
- 2017-01-10 CN CN201710021299.2A patent/CN106851596A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158929A (en) * | 2011-03-23 | 2011-08-17 | 浙江威奇电气有限公司 | Method for realizing wireless sensing network multi-node route optimization and dynamic ad hoc network |
| CN103533595A (en) * | 2013-10-28 | 2014-01-22 | 天津工业大学 | Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks |
| KR20160018050A (en) * | 2014-08-07 | 2016-02-17 | 서울시립대학교 산학협력단 | Energy-based data trasmission method for wireless sensor networks |
| KR101560523B1 (en) * | 2015-02-17 | 2015-10-15 | 성균관대학교산학협력단 | Operating method of wireless sensor networks considering energy efficiency |
Non-Patent Citations (1)
| Title |
|---|
| Y.LIU: "Multi-layer clustering routing algorithm for wireless vehicular sensor networks", 《IET COMMUNICATIONS》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107786957A (en) * | 2017-09-28 | 2018-03-09 | 韦彩霞 | A kind of farmland ecological environment monitoring system for precision agriculture |
| CN107786957B (en) * | 2017-09-28 | 2019-08-23 | 韶关市大众世纪信息科技有限公司 | A kind of farmland ecological environment monitoring system for precision agriculture |
| CN108566664A (en) * | 2018-05-08 | 2018-09-21 | 贵州大学 | A kind of WSN clustering routing optimization methods of distribution high energy efficiency |
| CN108601095A (en) * | 2018-05-08 | 2018-09-28 | 常熟理工学院 | A kind of implementation method of multimedia sensing network |
| CN108601095B (en) * | 2018-05-08 | 2020-07-07 | 常熟理工学院 | Method for realizing multimedia sensor network |
| CN110962888A (en) * | 2019-12-09 | 2020-04-07 | 中南大学 | Real-time dynamic train marshalling method and system |
| CN110962888B (en) * | 2019-12-09 | 2021-06-29 | 中南大学 | Real-time dynamic train marshalling method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bagci et al. | An energy aware fuzzy approach to unequal clustering in wireless sensor networks | |
| CN104284387B (en) | A kind of cluster routing method towards mobile sensor network | |
| CN103702387B (en) | Social network-based vehicle-mounted self-organization network routing method | |
| CN104394566B (en) | A kind of low power consumption adaptive clustering and multi-hop wireless sensor network topology control method based on fuzzy decision | |
| CN106851596A (en) | A kind of dynamic ad hoc network method of agricultural environment wireless sense network | |
| CN101562862B (en) | Routing method for balancing energy of wireless sensor network | |
| CN102769890B (en) | Wireless sensor network routing method based on uniform clustering and data aggregation | |
| CN102970723B (en) | With the Uneven Cluster routing algorithm of local cluster reconstruction | |
| CN108521633A (en) | Minepit environment wireless sense network cluster routing method based on K mean values | |
| CN103200643B (en) | Based on the distributed fault-tolerance topology control method of dump energy perception | |
| CN106550422B (en) | A kind of wireless sensor network clustering routing based on harmonic search algorithm | |
| CN105072656A (en) | Multi-level heterogeneous wireless sensor network clustering routing method based on K-means clustering and ant colony optimization | |
| CN107295569A (en) | A kind of Routing Protocol of the energy efficient based on many mobile sink nodes | |
| CN106973419A (en) | A kind of innovatory algorithm of LEACH agreements | |
| Tong et al. | A cross unequal clustering routing algorithm for sensor network | |
| CN104301965A (en) | Wireless sensor network inhomogeneous cluster node scheduling method | |
| CN107404745A (en) | A kind of fire detector remote detecting system based on MANET | |
| CN103781143A (en) | Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency | |
| CN106658641A (en) | Distributed wireless sensor network clustering routing method | |
| CN104080144A (en) | Gradient based energy-efficient uneven clustering data forwarding method | |
| Abidi et al. | Fuzzy cluster head election algorithm based on LEACH protocol for wireless sensor networks | |
| CN101640944B (en) | Clustering and multi-hop communication method of wireless sensor | |
| CN103095577A (en) | Context-dependent non-uniform clustering routing algorithm | |
| CN103701697A (en) | Link-quality-based hierarchical routing method | |
| CN113595903A (en) | Wireless sensor network node dormancy scheduling method based on FCM (fuzzy c-means) clustering topology |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170613 |