CN107295597A - A kind of adaptive cluster routing method, device and electronic equipment - Google Patents
A kind of adaptive cluster routing method, device and electronic equipment Download PDFInfo
- Publication number
- CN107295597A CN107295597A CN201710630230.XA CN201710630230A CN107295597A CN 107295597 A CN107295597 A CN 107295597A CN 201710630230 A CN201710630230 A CN 201710630230A CN 107295597 A CN107295597 A CN 107295597A
- Authority
- CN
- China
- Prior art keywords
- node
- mrow
- cluster
- msub
- area
- 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
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/18—Communication route or path selection, e.g. power-based or shortest path routing based on predicted events
-
- 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiments of the invention provide a kind of adaptive cluster routing method, device and electronic equipment, this method includes：Sub-clustering is carried out to all nodes in the range of base station communication, obtain the cluster area in the range of base station communication, the first node in cluster area is obtained in the dump energy when front-wheel starts, estimate first energy expenditure of the first node as leader cluster node and the second energy expenditure as member node, according to the first energy expenditure, second energy expenditure and in the dump energy when front-wheel starts, calculate the cluster head threshold value of first node, obtain the random number of first node generation, and judge whether the random number of first node generation is less than cluster head threshold value, when the random number that first node is generated is less than cluster head threshold value, first node is selected as when the leader cluster node of front-wheel.By the embodiment of the present invention, the optimal node of dump energy can be selected as leader cluster node, energy expenditure between balance nodes, it is ensured that the stabilization of whole network extends the life span of whole network.
Description
Technical field
The present invention relates to wireless technical field, more particularly to a kind of adaptive cluster routing method, device and electronics are set
It is standby.
Background technology
With wireless sensor technology develop rapidly with it is increasingly mature, substantial amounts of low-cost wireless sensor device is used for
Wireless senser, especially for the unapproachable monitored area of people, can be deployed to the monitoring section by monitoring and follow-up service
In domain, wireless senser can monitor the various information of the monitored area and be transferred in network with self-organization into wireless network
The heart, completes monitoring task, however, because wireless senser volume is generally very small, supplied with limited power supply, also, it is right
Each wireless senser of the monitored area charged or changed battery be it is unpractical, therefore, improve network energy efficiency,
The life span for balancing network energy loss and extension network is vital.
In order to extend the life span of wireless network, a kind of LEACH agreements (Low Energy are proposed in the prior art
Adaptive Clustering Hierarchy, low power consumption adaptive clustering route protocol), the agreement is by network lifecycle
Divided with " wheel " for unit, each round is divided into " cluster " and " stable transmission " two stages.In the cluster stage, the agreement is to follow
The mode of ring randomly choose in wireless network wireless senser (in the wireless network, wireless senser can be referred to as node,
Call node in the following text) turn into leader cluster node, the energy load of whole network is evenly distributed in each node, so as to reach raising net
The purpose of network entirety life span.However, because the agreement is that the random node selected in wireless network turns into leader cluster node,
The less node of dump energy may be elected as leader cluster node, such that the less leader cluster node of dump energy is too early
Death, causes member data bust this in the cluster of the leader cluster node.
, still, should when selecting cluster head, it is contemplated that the distance between node and base station based on the improved agreement of LEACH agreements
Agreement is when selecting cluster head, it is also possible to elects the less node of dump energy as leader cluster node, can equally cause the cluster head section
Member data bust this in the cluster of point, causes wireless network unstable.
The content of the invention
The purpose of the embodiment of the present invention is to provide a kind of adaptive cluster routing method, device and electronic equipment, with reality
Energy expenditure between optimal cluster head, balance nodes is now selected according to dump energy, it is ensured that the stabilization of whole network.Particular technique side
Case is as follows：
In a first aspect, the embodiments of the invention provide a kind of adaptive cluster routing method, methods described is applied to base station,
Including：
Sub-clustering is carried out to all nodes in the range of base station communication, the cluster area in the range of base station communication is obtained, wherein, cluster area
Including multiple nodes；
The first node in cluster area is obtained in the dump energy when front-wheel starts, wherein, first node is in multiple node
Any one node；
First node is estimated as the first energy expenditure of the leader cluster node in cluster area and first node is estimated as cluster area
Second energy expenditure of member node, wherein, member node is the node in cluster area in addition to leader cluster node；
According to the first energy expenditure, the second energy expenditure and first node in the dump energy when front-wheel starts, meter
The cluster head threshold value of the first node in Suan Cu areas；
The random number of first node generation is obtained, and judges whether the random number of first node generation is less than first node
Cluster head threshold value, wherein, random number is the number between 0-1；
When the random number that first node is generated is less than the cluster head threshold value of first node, selection first node is used as cluster area
When the leader cluster node of front-wheel.
Optionally, sub-clustering is carried out to all nodes in the range of base station communication, obtains the cluster area in the range of base station communication, wrapped
Include：
The identification information and positional information of all nodes in the range of acquisition base station communication, pass through K-means clustering algorithms
Sub-clustering is carried out to all nodes, the cluster area in the range of base station communication is obtained.
Optionally, the first node in cluster area is obtained in the dump energy when front-wheel starts, including：
Obtain dump energy of first node when when the last round of beginning of front-wheel；
When first node is when front-wheel last round of is leader cluster node, first node is obtained last round of when front-wheel
The positional information of next-hop cluster head node, calculates the distance of first node and next-hop cluster head node, wherein, next-hop cluster head section
The node for the packet that point sends for reception first node；
Obtain first node when front-wheel last round of, place cluster area member node generation packet information content,
First node sends the half of the information content of broadcast message, the energy expenditure of forwarding upper hop leader cluster node packet and cluster area
Footpath, passes through formula：
Calculate the actual energy consumption of first node；
Wherein, node of the upper hop leader cluster node for transmission packet to first node, E'CH(di1) represent actual energy
Consumption, NkThe sum for representing k-th of cluster area node is N, l'dataThe upper hop of cluster area and first node where representing first node
The information content of the packet of the actual generation of each node where leader cluster node in cluster area, EelecRepresent preset electronic energy into
This, l'advRepresent the actual information content for sending broadcast message of first node, εfsThe default free space model factor is represented,
Represent the distance of node and cluster heart node farthest in the radius in k-th of cluster area, i.e., k-th cluster area, di1Represent first node with
The distance of next-hop cluster head node, MnThe node total number in cluster area where the upper hop leader cluster node of first node；
When first node when front-wheel it is last round of be member node when, obtain first node it is actual generation packet letter
Breath amount, the information content and the radius in cluster area for receiving the broadcast message that leader cluster node is sent, pass through formula：
The actual energy consumption of first node is calculated, wherein,Represent the consumption of first node actual energy；
Dump energy of first node when when the last round of beginning of front-wheel is subtracted to the actual energy consumption of first node,
First node is obtained in the dump energy when front-wheel starts.
Optionally, cluster area also includes cluster heart node, and all nodes in the range of to base station communication carry out sub-clustering, obtain base
Stand after communication range Nei Cu areas, the adaptive cluster routing method of the embodiment of the present invention also includes：
The routed path of the cluster heart node in cluster area is calculated by Dijkstra shortest path firsts；
Accordingly, first node is estimated as the first energy expenditure of the leader cluster node in cluster area and estimates first node conduct
Second energy expenditure of the member node in cluster area, including：
The routed path of the cluster heart node in cluster area is obtained, the next-hop cluster heart node of the cluster heart node in cluster area is determined, and count
Calculate the distance of first node and next-hop cluster heart node；
Obtain default node produce the information content of packet, the information content of default transmission broadcast message, default turn
The energy expenditure of upper hop cluster heart node data bag and the radius in cluster area are sent out, passes through formula：
First node is estimated as the first energy expenditure of the leader cluster node in cluster area；
Wherein, ECH(di2) for the first energy expenditure of i-th node, NkRepresent the sum of the node in k-th of cluster area, ldata
Represent that default node produces the information content of packet, EelecRepresent preset electronic cost of energy, ladvRepresent default and send wide
Broadcast the information content of information, εfsThe default free space model factor is represented,Represent the radius in k-th of cluster area, di2Represent cluster
The distance of i-th of node and next-hop cluster heart node in area, MnFor the upper hop cluster heart node institute of the cluster heart node in k-th of cluster area
It is M in the sum of the node in cluster area；
Pass through formula：
First node is estimated as the second energy expenditure of the member node in cluster area, wherein,Represent that the second energy disappears
Consumption.
Optionally, the first node in cluster area is being obtained after the dump energy when front-wheel starts, the embodiment of the present invention
Adaptive cluster routing method also include：
Judge whether first node is more than preset energy threshold value in the dump energy when front-wheel starts；
Accordingly, according to the first energy expenditure, the second energy expenditure and first node in the residue when front-wheel starts
Energy, calculates the cluster head threshold value of the first node in cluster area, including：
When first node is more than preset energy threshold value in the dump energy when front-wheel starts, according to first node the
One energy expenditure, the second energy expenditure of first node and first node pass through public affairs in the dump energy when front-wheel starts
Formula：
First node is calculated as the probability of the leader cluster node in cluster area, wherein, piCluster head is used as i-th of node in cluster area
The probability of node, ECH(di2) for the first energy expenditure of i-th node, ECH(dj) it is node in addition to i-th of node in cluster area
In j-th of node the first energy expenditure, Eres(i) it is the dump energy of i-th of node, Eres(j) saved to remove i-th in cluster area
The dump energy of j-th of node in node outside point；
Pass through formula：
The cluster head threshold value of first node is calculated, wherein, Thres (i, r) represents what i-th of node in cluster area was taken turns in r
Cluster head threshold value.R is wheel number, Gi(r)=1 represent i-th of node theWheel is to theMade cluster head, G between wheeli(r)=0 represent i-th of node theWheel
ToDo not made cluster head between wheel,Expression is askedRemainder.
Optionally, when the random number that first node is generated is less than the cluster head threshold value of first node, first node is selected
As cluster area after the leader cluster node when front-wheel, the adaptive cluster routing method of the embodiment of the present invention also includes：
The leader cluster node in cluster area is calculated to the routed path of base station by Dijkstra shortest path firsts.
Optionally, calculated by Dijkstra shortest path firsts the leader cluster node in cluster area to base station routed path it
Afterwards, the adaptive cluster routing method of the embodiment of the present invention also includes：
Calculate respectively between Section Point and the leader cluster node in cluster area, the next-hop cluster head node of the leader cluster node in cluster area
Distance, wherein, Section Point is the node in cluster area in addition to leader cluster node；
Distance between the next-hop cluster head node of the leader cluster node in Section Point and cluster area is less than Section Point and cluster
During the distance between the leader cluster node in area, send the short frame of request and instruct to Section Point, wherein, the short frame instruction of the request is instruction
The short frame that Section Point sends the extra time division multiple acess scheduling of request is asked to the next-hop cluster head node of the leader cluster node in cluster area
Instruction.
Second aspect, the embodiment of the present invention additionally provides a kind of adaptive clustering routing device, applied to base station, the dress
Put including：
Sub-clustering module, for carrying out sub-clustering to all nodes in the range of base station communication, is obtained in the range of base station communication
Cluster area, wherein, cluster area includes multiple nodes；
Dump energy acquisition module, for obtaining the first node in cluster area in the dump energy when front-wheel starts, wherein,
First node is any one node in multiple nodes；
Energy expenditure estimates module, and the first energy expenditure of the leader cluster node in cluster area and pre- is used as estimating first node
Estimate first node as the second energy expenditure of the member node in cluster area, wherein, member node be cluster area in addition to leader cluster node
Node；
Cluster head threshold value computing module, for being worked as according to the first energy expenditure, the second energy expenditure and first node
Dump energy when front-wheel starts, calculates the cluster head threshold value of the first node in cluster area；
Judge module, for obtain first node generation random number, and judge first node generation random number whether
Less than the cluster head threshold value of first node, wherein, random number is the number between 0-1；
Selecting module, when being less than the cluster head threshold value of first node for the random number that is generated in first node, selection the
One node is as cluster area when the leader cluster node of front-wheel.
Optionally, sub-clustering module, identification information and position specifically for obtaining all nodes in the range of base station communication
All nodes are carried out sub-clustering by K-means clustering algorithms, obtain the cluster area in the range of base station communication by information.
The third aspect, the embodiment of the present invention additionally provides a kind of electronic equipment, including processor, communication interface, memory
And communication bus, wherein, processor, communication interface, memory completes mutual communication by communication bus；
Memory, for storing computer program；
Processor, for stored on memory is performed program when, realize that one kind that first aspect is provided is adaptive
Cluster routing method；
Communication interface, data exchange is carried out for electronic equipment and external equipment.
Fourth aspect, the embodiment of the present invention additionally provides a kind of computer-readable recording medium, computer-readable storage medium
Matter internal memory contains computer program, when computer program is executed by processor, and realizes adaptive point of one kind that first aspect is provided
The step of cluster method for routing.
A kind of adaptive cluster routing method provided in an embodiment of the present invention, device and electronic equipment, when cluster head is selected
Consider the distance between each residue energy of node, each node and next-hop cluster heart node, cluster area interior nodes are better balanced
Between energy expenditure so that leader cluster node has enough charge transport data, it is ensured that the stabilization of whole network, extension whole network
Life span.Certainly, implementing any product or method of the present invention must be not necessarily required to while reaching all the above excellent
Point.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 a are applied to the structural representation of wireless network for the adaptive cluster routing method of the embodiment of the present invention；
Fig. 1 b are that the adaptive cluster routing method of the application embodiment of the present invention is divided all nodes in wireless network
The structural representation of cluster；
Fig. 1 c are that the adaptive cluster routing method of the application embodiment of the present invention calculates the leader cluster node in wireless network
The structural representation of routed path；
Fig. 2 is a kind of flow chart of the first embodiment of adaptive cluster routing method of the embodiment of the present invention；
Fig. 3 is a kind of flow chart of second of embodiment of adaptive cluster routing method of the embodiment of the present invention；
Fig. 4 shows for a kind of structure in adaptive cluster routing method adjustment member's node-routing path of the embodiment of the present invention
It is intended to；
Fig. 5 a are the cluster area and cluster that a kind of adaptive cluster routing method simulation analysis of the application embodiment of the present invention are obtained
The structural representation of heart routed path；
Fig. 5 b are the leader cluster node obtained using a kind of adaptive cluster routing method simulation analysis of the embodiment of the present invention
And the structural representation of the routed path of leader cluster node；
Fig. 5 c are the adjustment cluster area obtained using a kind of adaptive cluster routing method simulation analysis of the embodiment of the present invention
Member node send packet routed path structural representation；
Fig. 6 is a kind of structural representation of adaptive clustering routing device of the embodiment of the present invention；
Fig. 7 is applied to the structural representation of electronic equipment for a kind of adaptive cluster routing method of the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made
Embodiment, belongs to the scope of protection of the invention.
In order to solve the problem of prior art is present, the embodiments of the invention provide a kind of adaptive cluster routing method,
Device and electronic equipment, with consider when cluster head is selected each residue energy of node, each node and next-hop cluster heart node it
Between distance, energy expenditure between cluster interior nodes is better balanced so that leader cluster node has enough charge transport data, it is ensured that whole
The stabilization of individual network, extends the life span of whole network.
In order to clearly demonstrate a kind of adaptive cluster routing method of the embodiment of the present invention, first to the embodiment of the present invention
The application scenarios of adaptive cluster routing method be introduced, be the adaptive sub-clustering of the embodiment of the present invention as shown in Figure 1a
Method for routing is applied to the structural representation of wireless network；In the wireless network, including：Base station 101, wireless sensor node
102nd, wireless sensor node 103, wireless sensor node 104, wireless sensor node 105, wireless sensor node 106,
It is wireless sensor node 107, wireless sensor node 108, wireless sensor node 109, wireless sensor node 110, wireless
Sensor node 111.Wherein, base station 101 is the base station of the adaptive cluster routing method using the embodiment of the present invention.
Base station 101 can be using the adaptive cluster routing method of the embodiment of the present invention to above-mentioned 10 wireless sensor nodes
Point carries out sub-clustering, obtains multiple cluster areas, and then a wireless sensor node in each cluster area of often wheel selection is used as the cluster area
Leader cluster node.When selecting leader cluster node, it is considered to dump energy, each node and the next-hop cluster of each node in the cluster area
The distance of heart node, so as to balance the energy expenditure of each node in cluster area, is prevented the relatively low node choosing of dump energy
It is selected as leader cluster node, it is ensured that the stabilization of whole network, extends the life span of whole network.After selection leader cluster node, base station
Member node of the configuration information of leader cluster node to the cluster area can be sent, to enable the member node in the cluster area to send number
The leader cluster node is given according to bag.
, can be first to all sections in the range of base station communication in a kind of possible implementation of the embodiment of the present invention
Point carry out sub-clustering, then with take turns for the cycle carry out cluster head selection, by the cluster head of some wheels selection after, each node in cluster area
The forwarding of packet can be participated in alternately as leader cluster node.
After a sub-clustering, when the energy of all member nodes in some cluster area all exhausts, base station then records the cluster
The identification information of the node of the depleted of energy in area, then to other nodes sub-clustering again in its communication range.
For example, the node listing of a depleted of energy can be locally created in base station, then by the node of depleted of energy
Identification information is preserved in the list, and the identification information of node can be the physical address of node ID or node.
Below, a kind of adaptive cluster routing method of the embodiment of the present invention is introduced, as shown in Fig. 2 being this hair
A kind of flow chart of the first embodiment of adaptive cluster routing method of bright embodiment, this method can include：
All nodes in the range of base station communication are carried out sub-clustering, obtain the cluster area in the range of base station communication by S201.Its
In, the cluster area includes multiple nodes.
When interstitial content in the range of base station communication is more, if the only selection one in the range of the base station communication
When individual node is as leader cluster node, it may be such that the node that the distance leader cluster node is distant in the range of the base station communication is sent
The energy expenditure of packet can also make it that the number of the leader cluster node received data packet is relatively more than larger, and cause the cluster head
The energy expenditure of node is larger, therefore, can be first to base in the adaptive cluster routing method of the application embodiment of the present invention
All nodes in communication range of standing carry out sub-clustering, during all node clusterings in the range of to base station communication, can uniformly divide
Cluster, can also Uneven Cluster.
In a kind of preferably implementation, in order to balance the energy expenditure of each cluster, it can be clustered and calculated by K-means
Method carries out uniform sub-clustering to all nodes in the range of the base station communication：
Step A, base station can obtain the positional information and identification information of each node in communication range.
Step B, according to the positional information of each node, uniform K node of selection is K cluster heart nodes to be determined, and
K Ge Cu areas are set up with K cluster heart nodes to be determined.
Wherein,N is the sum of all nodes in the range of base station communication.
Specifically, in the positional information according to each node, uniform K node of selection is K cluster heart nodes to be determined
When, the embodiments of the invention provide a kind of possible implementation：
The region that all nodes in the range of base station communication are constituted can be divided equally, the size phase in each region
Same or similar, then, it is cluster heart node to be determined to select the node in regional center in each region, so as to obtain K
Individual cluster heart node to be determined.
Step C, passes through formula
Obtain the K Ge Cu areas after all node clusterings, wherein, ShRepresent the positional information of h-th of node, μkExpression is treated
Determine the positional information of k-th of cluster heart node in cluster heart node, argmin | | Sh-μk||2Expression makes | | Sh-μk||2Take minimum value
When, k value, chRepresent that h-th of node adds the label in k-th of cluster area, 0≤k≤K.
For example, in fig 1 a, wireless sensor node 102 can be calculated and all K clusters to be determined by above-mentioned formula
The distance of heart node, and wireless sensor node 102 is added to the to be determined cluster closest with wireless sensor node 102
Cluster area where heart node, it is assumed that wireless sensor node 102 is closest with wireless sensor node 103, then wireless sensing
Device node 102 adds the place cluster area of wireless sensor node 103, constitutes cluster Hou Cu areas.
Assuming that after being clustered by above-mentioned formula, obtaining cluster Hou Cu areas is respectively：It is wireless sensor node 102, wireless
Sensor node 103 is the first cluster area, wireless sensor node 105, wireless sensor node 104, wireless sensor node 106
For the second cluster area, wireless sensor node 107, wireless sensor node 108 are the 3rd cluster area.Wireless sensor node 109, nothing
Line sensor node 110, wireless sensor node 111 are the 4th cluster area.
Step D, according to the positional information of the node in each cluster area, passes through formula
Calculate the new cluster heart node in k-th of cluster area.
Wherein, μ 'kThe positional information of the new cluster heart node in k-th of cluster area is represented, | Ak| represent k-th of cluster area interior joint
Quantity, AkRepresent the set of the node in k-th of cluster area.
The K Ge Cu areas obtained after by step C by all node clusterings, in this step, can be calculated in K Ge Cu areas
The new cluster heart node in each cluster area.
Step E, passes through formula
Judge whether the new cluster heart node in k-th cluster area and the changing value of k-th of cluster heart node to be determined are less than default
Cluster heart change threshold；
Step F, is more than default in the new cluster heart node in k-th cluster area and the changing value of k-th of cluster heart node to be determined
During cluster heart change threshold, using the new cluster heart node in k-th of cluster area as k-th of cluster heart node to be determined, repeat step C,
Step D；
Step G, is less than default in the new cluster heart node in k-th cluster area and the changing value of k-th of cluster heart node to be determined
During cluster heart change threshold, using the new cluster heart node in k-th of cluster area as the cluster heart node in k-th of cluster area, base station communication is obtained
In the range of K clusters area.
It is assumed that the sub-clustering result obtained after sub-clustering such as Fig. 1 b, as shown in Figure 1 b, for the adaptive of the application embodiment of the present invention
Cluster routing method carries out the structural representation of sub-clustering to all nodes in wireless network.In the figure, to institute in wireless network
There is node to carry out after sub-clustering, obtained sub-clustering result is：The node that cluster area 11 includes is：Wireless sensor node 102, wireless biography
Sensor node 103, cluster heart node 112；The node that cluster area 12 includes is：Wireless sensor node 105, wireless sensor node
104th, wireless sensor node 106, cluster heart node 113；The node that cluster area 13 includes is wireless sensor node 107, wireless biography
Sensor node 108, cluster heart node 114；The node that cluster area 14 includes is：Wireless sensor node 109, wireless sensor node
110th, wireless sensor node 111, cluster heart node 115.
Wherein, cluster heart node is place cluster district center, and the positional information of cluster heart node is believed for the position of place cluster district center
Breath.
After the completion of sub-clustering, base station can send broadcast configuration information to all nodes in communication range, should match somebody with somebody confidence
Breath can include：The positional information of cluster heart node in the affiliated cluster area of cluster area label, node in the affiliated cluster area of node etc..
By the step, uniform sub-clustering can be carried out to all nodes in the range of base station communication, so as to avoid
When obtaining leader cluster node by subsequent step, distribution of the leader cluster node in whole communication range is uneven and causes member in cluster area
The energy loss of node is excessive.
S202, obtains the first node in cluster area in the dump energy when front-wheel starts.Wherein, first node is multiple sections
Any one node in point.
All nodes in the range of to base station communication are carried out after sub-clustering, can be divided by the adaptive of the embodiment of the present invention
Cluster method for routing carries out many wheel selection cluster heads, and can be in the selection laggard walking along the street of cluster head by communicating.
It should be appreciated that the first round after the completion of sub-clustering, the first node in the cluster area of acquisition is when front-wheel starts
Dump energy be the first node ceiling capacity.
Specifically, first node can be entered in the dump energy when front-wheel starts by first node when when front-wheel
Row measurement is obtained, and the finger for obtaining dump energy can be sent using the base station of the adaptive cluster routing method of the embodiment of the present invention
Make to first node, obtain the first node in the dump energy when front-wheel starts.
First node can also be calculated in the last round of energy expenditure when front-wheel by base station, and combine first segment
Dump energy of point when when the last round of beginning of front-wheel, obtains first node in the dump energy when front-wheel starts.
It is assumed that the cluster area be Fig. 1 b shown in the application embodiment of the present invention adaptive cluster routing method to wireless network
In all nodes carry out the structural representation Zhong Cu areas 13 of sub-clusterings, in the cluster area, including wireless sensor node 107, nothing
Line sensor node 108, above-mentioned two node can be obtained respectively in the dump energy when front-wheel starts.
First node by obtaining cluster area be able to will be saved in the dump energy when front-wheel starts when selecting cluster head
Whether the dump energy of point can turn into the capacity factor of leader cluster node as the node.So as to, it is ensured that subsequent step selection
Leader cluster node has enough energy to complete the communication in the wheel.
S203, estimates first node as the first energy expenditure of the leader cluster node in cluster area and estimates first node as cluster
Second energy expenditure of the member node in area.
Wherein, member node is the node in cluster area in addition to leader cluster node.
Here it is possible to rule of thumb first node is estimated as the first energy expenditure of the leader cluster node in cluster area,
First node is estimated as the second energy expenditure of the member node in cluster area.
For example, can using with the same or similar wireless network environment of the wireless network environment as references object, to this
First node as the leader cluster node in cluster area the first energy expenditure and the node as the member node in cluster area the second energy
Consumption is estimated, and can also be consumed according to the first node in the actual energy of many wheels before front-wheel and the first node is made
Carried out in advance as the second energy expenditure of the member node in cluster area for the first energy expenditure and the node of the leader cluster node in cluster area
Estimate.
For example, two wireless sensor nodes in Fig. 1 b Zhong Cu areas 13 can be estimated by this step in current crop rotation respectively
Second energy expenditure of the first energy expenditure for the leader cluster node in cluster area 13 and the member node as cluster area 13.
S204, according to the first energy expenditure, the second energy expenditure and first node in the residual energy when front-wheel starts
Amount, calculates the cluster head threshold value of the first node in cluster area.
Here it is possible to calculate first node first as the probability of the leader cluster node in cluster area, then made according to first node
For the cluster head threshold value of the probability calculation first node of the leader cluster node in cluster area.
Specifically, formula can be passed through：
First node is calculated as the probability of the leader cluster node in cluster area, then passes through formula：
Calculate the cluster head threshold value of first node.
Wherein, piThe probability of leader cluster node, E are used as i-th of node in cluster areaCH(di2) for the first energy of i-th node
Amount consumption, ECH(dj) be j-th of node in node in addition to i-th of node in cluster area the first energy expenditure, Eres(i) it is i-th
The dump energy of individual node, Eres(j) it is the dump energy of j-th of node in the node in cluster area in addition to i-th of node；Thres
(i, r) represents the cluster head threshold value that i-th of node is taken turns in r.R is wheel number, Gi(r)=1 represent i-th of node theWheel is to theMade cluster head, G between wheeli(r) i-th of node=0 is represented
Wheel is to theDo not made cluster head between wheel,Expression is askedRemainder.
For example, can respectively be calculated by above-mentioned steps the wireless sensor node 107 in the cluster area 13 shown in Fig. 1 b,
The cluster head threshold value of wireless sensor node 108.It is assumed that wireless sensor node 108 isWheel is to theMade cluster head between wheel, then wireless sensor node 108 is in the cluster head threshold value when front-wheel
0.Wireless sensor node 107 did not do cluster head, then wireless sensor node 107 cluster head threshold T hres (107, r) be
By this step, base station can according to calculate obtain first node obtained as the probability of leader cluster node this first
The cluster head threshold value of node, so as to preferably balance the energy expenditure of cluster area interior nodes when selecting leader cluster node.
S205, obtains the random number of first node generation, and judges whether the random number of first node generation is less than first
The cluster head threshold value of node.Wherein, random number is the number between 0-1.
After the cluster head threshold value of first node is calculated, using the base station of the adaptive cluster routing method of the embodiment of the present invention
The instruction for the random number for obtaining first node can be sent, the random number back of generation can be given the base station by first node.
The base station is after the random number of first node transmission is got, the cluster head door for the first node that can be obtained with calculating
Limit value is compared, and judges whether the random number of first node generation is less than the cluster head threshold value of first node, so as to
Judge whether the first node can be in leader cluster node of the current wheel as the cluster area.
It is assumed that the cluster head threshold value of the wireless sensor node 107 obtained by step S204 calculating is 0.8, get
Wireless sensor node 107 random number be 0.65.Then the random number of wireless sensor node 107 is less than cluster head threshold value.
S206, when the random number that first node is generated is less than the cluster head threshold value of first node, selection first node is made
It is cluster area when the leader cluster node of front-wheel.
For example, the judgement by step S205 to the random number and cluster head threshold value of wireless sensor node 107, in this step
In rapid, wireless sensor node 107 can be selected as cluster area 13 when the leader cluster node of front-wheel.
In this step, by select random number be less than cluster head threshold value first node as cluster area when the cluster of front-wheel
Head node, can preferably balance the energy expenditure of cluster area interior nodes, extend the life span of whole network.
, may be in the cluster area when non-selected to cluster head in front-wheel after the leader cluster node in cluster area is selected by above-mentioned steps
Node, that is to say, that the cluster area is 0 in the quantity of the leader cluster node when front-wheel, it is also possible to which the cluster area in front-wheel when selecting
Leader cluster node quantity is more than or equal to 2.
For above-mentioned situation, the embodiment of the present invention additionally provides corresponding solution：
When the cluster area is when the quantity of the leader cluster node when front-wheel is 0, then apart from cluster heart node in the base station selected cluster area
Nearest member node is as virtual cluster head, and the virtual leader cluster node is only responsible for forwarding packet；Other nodes are saved as member
Point.
When the cluster area is when the leader cluster node quantity selected in front-wheel is more than or equal to 2, base station can calculate the cluster area
The distance of middle leader cluster node and the cluster area cluster heart node, then selection is made with the nearest leader cluster node of the cluster area cluster heart nodal distance
For main leader cluster node, other leader cluster nodes in the cluster area are as auxiliary leader cluster node, and the auxiliary leader cluster node is used to forward the cluster
Main leader cluster node of the packet that area node member sends to the cluster area.
After the leader cluster node in base station selected cluster area, the instruction that can send referred to as cluster head is the node, to cause the section
The member node in Dian Xianggaicu areas broadcasts the arrangement letter of identification information, positional information and the time division multiple access slot of the leader cluster node
Breath etc..
A kind of adaptive cluster routing method provided in an embodiment of the present invention, considers that each node is remaining when cluster head is selected
The distance between energy, each node and next-hop cluster heart node, are better balanced energy expenditure between cluster area interior nodes so that cluster
Head node has enough charge transport data, it is ensured that the stabilization of whole network, extends the life span of whole network.
Cluster area is obtained in a kind of the first embodiment of adaptive cluster routing method by the embodiment of the present invention
After leader cluster node, the embodiment of the present invention additionally provides a kind of adaptive cluster routing method, to realize that reduction leader cluster node is sent
Energy expenditure of the packet to base station, extends the life span of wireless network.As shown in figure 3, being one kind of the embodiment of the present invention
The flow chart of second of embodiment of adaptive cluster routing method, the random number generated in first node is less than first node
Cluster head threshold value when, selection first node as cluster area after the leader cluster node when front-wheel, this method can also include：
S207, the leader cluster node in cluster area is calculated to the routed path of base station by Dijkstra shortest path firsts.
It can be obtained by a kind of the first embodiment of adaptive cluster routing method with the embodiment of the present invention
The leader cluster node in all cluster areas in the range of base station communication.In this step, Dijkstra shortest path firsts and institute can be passed through
Routed path of the leader cluster node in each cluster area of positional information calculation of the leader cluster node in You Cu areas to base station.
Specifically, the distance between each two leader cluster node can be calculated, between each leader cluster node and base station first
Distance.Then using all leader cluster nodes and base station as summit, with the distance between each two leader cluster node, each leader cluster node with
The distance between base station is side, and obtaining one includes all leader cluster nodes and the non-directed graph of base station.Again by the non-directed graph, use
Dijkstra shortest path firsts, can obtain the routed path of the leader cluster node in the cluster area.
It is assumed that a kind of the first embodiment for the adaptive cluster routing method for passing through the embodiment of the present invention is to Fig. 1 b institutes
After Shi Cu areas 11, cluster area 12, cluster area 13 and the selection of cluster area 14 leader cluster node, the leader cluster node in cluster area 11 is 102, cluster area 12
Leader cluster node is 104, and the leader cluster node in cluster area 13 is 107, and the leader cluster node in cluster area 14 is 109.
Leader cluster node 102, leader cluster node 104, leader cluster node 107 and leader cluster node can then be calculated respectively by this step
109 routed path.As illustrated in figure 1 c, the adaptive cluster routing method for the application embodiment of the present invention is calculated in wireless network
Leader cluster node routed path structural representation.In figure 1 c, the routed path of leader cluster node 102 is：Wireless senser
102 → base station of node；The routed path of leader cluster node 104 is：104 → wireless sensor node of wireless sensor node 102 →
Base station；The routed path of leader cluster node 107 is：107 → wireless sensor node of wireless sensor node, 102 → base station；Cluster head
The routed path of node 109 is：109 → wireless sensor node of wireless sensor node, 102 → base station.
By calculating each leader cluster node to the routed path of base station, leader cluster node can be caused to send packet to base
When standing, reduction sends the energy expenditure of packet, extends the life span of wireless network.
When obtaining the first node in cluster area in the dump energy when front-wheel starts, the embodiments of the invention provide one kind
Possible implementation, can include：
Step A, obtains dump energy of first node when when the last round of beginning of front-wheel.
Specifically, when first node is when front-wheel last round of is the first round, first node is last round of when front-wheel
Dump energy during beginning is then the ceiling capacity of the node.The ceiling capacity is the energy that the first node is set in production
Maximum capacity.
Step B, when first node is when front-wheel last round of is leader cluster node, obtains first node upper when front-wheel
The positional information of the next-hop cluster head node of one wheel, calculates the distance of first node and next-hop cluster head node.
Wherein, the node for the packet that next-hop cluster head node sends for reception first node；
It is assumed that the first node is wireless sensor node 109, it is being leader cluster node when the last round of of front-wheel, this first
Node is 102 in the last round of next-hop cluster head node when front-wheel, that is to say, that when last round of, first segment of front-wheel
The next-hop cluster head node of point is 102.Here it is possible to according to the position of wireless sensor node 109 and wireless sensor node 102
Confidence ceases, and calculates distance between the two.
Specifically, when it is the second wheel to deserve front-wheel, then it is the first round to deserve the last round of of front-wheel.
Step C, obtains letter of the first node in the packet of last round of, place cluster area the member node generation when front-wheel
Breath amount, first node send the information content of broadcast message, the energy expenditure of forwarding upper hop leader cluster node packet and cluster area
Radius, pass through formula：
Calculate the actual energy consumption of first node；
Wherein, node of the upper hop leader cluster node for transmission packet to first node, E'CH(di1) represent actual energy
Consumption, NkThe sum for representing k-th of cluster area node is N, l'dataThe upper hop of cluster area and first node where representing first node
The information content of the packet of the actual generation of each node in cluster area, E where leader cluster nodeelecPreset electronic cost of energy is represented,
l'advRepresent the actual information content for sending broadcast message of first node, εfsThe default free space model factor is represented,Table
Show the distance of node farthest in the radius in k-th of cluster area, i.e., k-th cluster area and cluster heart node, di1Represent first node with
One jumps the distance of leader cluster node, MnThe node total number in cluster area where the upper hop leader cluster node of first node；
When the first node when front-wheel it is last round of be leader cluster node when, it is necessary to forward the member node in the cluster area to produce
Packet, send broadcast message to the cluster area member node and forward the upper hop leader cluster node of the first node to send
Packet, therefore, calculate the first node for leader cluster node actual energy consumption when, can be to be in terms of above three
Energy expenditure factor calculates the actual energy consumption of the first node.
Step D, when first node when front-wheel it is last round of be member node when, obtain first node it is actual generation data
The information content of bag, the information content and the radius in cluster area for receiving the broadcast message that leader cluster node is sent, pass through formula：
The actual energy consumption of first node is calculated, wherein,Represent the consumption of first node actual energy；
When the first node when when the last round of member node for cluster area of front-wheel, it is necessary to send the data of itself generation
Bag and the broadcast message for receiving leader cluster node transmission, therefore, are calculating the actual energy that the first node is cluster area member node
During amount consumption, the actual energy consumption of the first node as energy expenditure factor, can be calculated.
Step E, dump energy of first node when when the last round of beginning of front-wheel is subtracted the actual energy of first node
Amount consumption, obtains first node in the dump energy when front-wheel starts.
Obtaining reality of the first node in the member node of the last round of leader cluster node or cluster area for cluster area when front-wheel
After the energy expenditure of border, in this step, dump energy of first node when when the last round of beginning of front-wheel can be subtracted this
Actual energy consumption obtains first node in the dump energy when front-wheel starts.
Can be at the end of last round of when front-wheel in the dump energy when front-wheel starts specifically, calculating first node
Calculated, can also be calculated when front-wheel starts.Calculating first node can be by the dump energy when front-wheel starts
Base station is calculated, and can also be calculated by first node itself.
In a kind of possible implementation of the embodiment of the present invention, all nodes in the range of to base station communication are carried out
Sub-clustering, is obtained after the cluster area in the range of base station communication, the adaptive cluster routing method of the embodiment of the present invention can also include：
The routed path of the cluster heart node in cluster area is calculated by Dijkstra shortest path firsts.
Specifically, the method for calculating the routed path of the cluster heart node in the cluster area is referred to calculate the leader cluster node in cluster area
Method to the routed path of base station is calculated, and is repeated no more here.
After the routed path of cluster heart node in cluster area is calculated, the adaptive cluster routing method of the embodiment of the present invention is also carried
Supplied it is a kind of estimate first node as the leader cluster node in cluster area the first energy expenditure and estimate first node as cluster area
The method of second energy expenditure of member node.Estimating first energy expenditure of the first node as the leader cluster node in cluster area
When, it can include：
Step A, obtains the routed path of the cluster heart node in cluster area, determines the next-hop cluster heart section of the cluster heart node in cluster area
Point, and calculate the distance of first node and next-hop cluster heart node.
After the routed path of cluster heart node in cluster area is calculated by Dijkstra shortest path firsts, the cluster can be obtained
The next-hop cluster heart node of heart node, so as to obtain the position of the next-hop cluster heart node, it is consequently possible to calculate this first
The distance of node and next-hop cluster heart node.
For example, it is assumed that in Figure 1b, cluster heart node be respectively cluster heart node 112, cluster heart node 113, cluster heart node 114,
Cluster heart node 115.Calculating the obtained routed path of cluster heart node 112 by Dijkstra shortest path firsts is：Cluster heart section
Point 112 → base station 101；The routed path of cluster heart node 113 is：112 → base station of cluster heart node 113 → cluster heart node 101；The cluster heart
The routed path of node 114 is：115 → base station of cluster heart node 114 → cluster heart node 101；The routed path of cluster heart node 115
For：115 → base station of cluster heart node 101.It is assumed that the first node is the next-hop of wireless sensor node 108, then first node
Cluster heart node is cluster heart node 115.
Step B, obtain default node produce the information content of packet, it is the information content of default transmission broadcast message, pre-
If forwarding upper hop cluster heart node data bag energy expenditure and the radius in cluster area, pass through formula：
First node is estimated as the first energy expenditure of the leader cluster node in cluster area；
Wherein, ECH(di2) for the first energy expenditure of i-th node, NkRepresent the sum of the node in k-th of cluster area, ldata
Represent that default node produces the information content of packet, EelecRepresent preset electronic cost of energy, ladvRepresent default and send wide
Broadcast the information content of information, εfsThe default free space model factor is represented,Represent the radius in k-th of cluster area, di2Represent cluster
The distance of i-th of node and next-hop cluster heart node in area, MnFor the upper hop cluster heart node institute of the cluster heart node in k-th of cluster area
It is M in the sum of the node in cluster area.
Estimate first node as the leader cluster node in cluster area the first energy expenditure when, because leader cluster node receives this cluster
The packet of area's member node, sends broadcast message to member node in cluster area and forwarding packet, therefore, it can according to pre-
If node produce the information content of packet, the information content of default transmission broadcast message, default forwarding upper hop cluster heart section
The energy expenditure of point data bag and the radius in cluster area, first node is estimated as the leader cluster node in cluster area by above-mentioned formula
First energy expenditure.
Second energy expenditure of the first node as the member node in cluster area is being estimated, formula can be passed through：
First node is estimated as the second energy expenditure of the member node in cluster area, wherein,Represent that the second energy disappears
Consumption.
Estimate first node as the member node in cluster area the second energy expenditure when, because the member node in cluster area is
The broadcast message that packet is sent to leader cluster node, reception leader cluster node is sent, therefore, it can produce number according to default node
According to the radius of the information content of bag, the information content of default transmission broadcast message and cluster area, first segment is estimated by above-mentioned formula
Put the second energy expenditure of the member node as cluster area.
First energy expenditure and the second energy expenditure are estimated by this step, can make it that the result estimated is more accurate,
The accuracy of increase selection leader cluster node.
In a kind of achievable mode of the embodiment of the present invention, in order to reduce the amount of calculation of base station, cluster area is being obtained
First node is after the dump energy when front-wheel starts, and the adaptive cluster routing method of the embodiment of the present invention can also be sentenced
Whether disconnected first node is more than preset energy threshold value in the dump energy when front-wheel starts.
Here, preset energy threshold value is rule of thumb configured, by judging first node when front-wheel starts
When dump energy and preset energy threshold value magnitude relationship, the section of preset energy threshold value can be only more than to dump energy
Point calculates cluster head threshold value, so as to only select leader cluster node in the node that dump energy is more than preset energy threshold value,
Reduce the complexity calculated.
In another achievable mode of the embodiment of the present invention, first node can be locally relatively more surplus in first node
Complementary energy and the size of preset energy threshold value, when dump energy is less than preset energy threshold value, can send packet
When, depleted of energy mark is added in the packet and is sent to base station, base station can be got while packet is received
The depleted of energy is identified, and can recalculate the cluster heart node in the cluster area.
In a kind of achievable mode of the embodiment of the present invention, saved to reduce the member in marginal position in cluster area
Point sends the energy expenditure of packet, can be directed to the route road that the member node in marginal position in cluster area sends packet
Footpath is adjusted.Specifically, when the member node in marginal position sends the routed path of packet in adjusting cluster area, can
To be adjusted by the following method：
Step A, calculates Section Point and leader cluster node, the next-hop cluster head node of the leader cluster node in cluster area in cluster area respectively
The distance between.
Wherein, Section Point is the node in cluster area in addition to leader cluster node.The Section Point is the edge in the cluster area
The node of position.
When adjusting the routed path of node transmission packet, the cluster of the Section Point and residing cluster area can be first calculated
The distance between the distance of head node, the Section Point and the next-hop cluster head node of leader cluster node in residing cluster area.
For example, as shown in figure 4, the knot in the adaptive cluster routing method adjustment node-routing path for the embodiment of the present invention
Structure schematic diagram, including：Base station 401, cluster area 41, cluster area 42, the leader cluster node 402 in cluster area 41, the member node 404 in cluster area 42,
Leader cluster node 403.Leader cluster node 402 is the next-hop cluster head node of leader cluster node 403.Cluster area can be calculated by this step A
The distance between 42 member node 404 and leader cluster node 403 dAC, the member node 404 in cluster area 42 and the cluster head section in cluster area 41
The distance between 402 d of pointBC。
Step B, the distance between the next-hop cluster head node of the leader cluster node in Section Point and cluster area is less than second section
The leader cluster node in Dian Yucu areas the distance between when, send the short frame of request and instruct to Section Point.
Wherein, the instruction of the request short frame for indicate Section Point send the extra time division multiple acess scheduling of request short frame ask to
The instruction of the next-hop cluster head node of the leader cluster node in cluster area, the request short frame instruction can include the identification information of base station, the
The identification information of two nodes and the identification information of next-hop cluster head node.
Calculating respectively between Section Point and the leader cluster node in cluster area, the next-hop cluster head node of the leader cluster node in cluster area
Distance after, the distance between leader cluster node that can be by comparing Section Point and cluster area, Section Point and the cluster head in cluster area
Whether the Distance Judgment Section Point is the node for needing to adjust routed path between the next-hop cluster head node of node.
It is assumed that dAC＞ dBC, the distance between the member node 404 in Ze Cu areas 42 and leader cluster node 403 are more than cluster area 42
The distance between the leader cluster node 402 in member node 404 and cluster area 41.Accordingly, it would be desirable to which the member node 404 for adjusting cluster area 42 is sent out
Send the routed path of packet.
Specifically, when the member node 404 for adjusting cluster area 42 sends the routed path of packet, can be asked by sending
Short frame is asked to instruct the member node 404 to cluster area 42, to cause the member node 404 in cluster area 42 sends extra time division multiple acess to dispatch
Short frame ask leader cluster node 402 to cluster area 41.The leader cluster node 402 in cluster area 41 is receiving the member node in the cluster area 42
After the short frame request of the 404 extra time division multiple acess scheduling sent, time division multiple acess can be distributed for the member node 404 in the cluster area 42
Time slot.
By this step, the energy expenditure that the node in cluster area edge position sends packet can be reduced.Extend nothing
The life span of gauze network.
Specifically, for the clearer explanation embodiment of the present invention, the embodiment of the present invention have selected 100 wireless sensers
Node and a base station have carried out simulation analysis, as shown in Figure 5 a, for a kind of adaptive sub-clustering road of the application embodiment of the present invention
The cluster area obtained by method simulation analysis and the structural representation of cluster heart routed path, in the figure, the point shown in numeral 1~10
The cluster heart node in different cluster areas is represented respectively, and point of different shapes represents the different cluster areas that sub-clustering is obtained.The routed path of the cluster heart
For：9 → 6 → 10 → 3 → base station；4 → 7 → 2 → base station；1 → 7 → 2 → base station；8 → 2 → base station；5 → 2 → base station.
Fig. 5 b are the leader cluster node obtained using a kind of adaptive cluster routing method simulation analysis of the embodiment of the present invention
And the structural representation of the routed path of leader cluster node.The member node in each cluster area can deliver a packet to the cluster in the area
Head node, then by leader cluster node packet is arranged after be sent to base station.
Fig. 5 c are the adjustment cluster area obtained using a kind of adaptive cluster routing method simulation analysis of the embodiment of the present invention
Member node send packet routed path structural representation, in the figure, to cluster where cluster heart node marked as 1
The routed path that the part of nodes in area sends packet is adjusted, and is adjusted to the cluster area to where the cluster heart node marked as 7
Leader cluster node send packet.
Corresponding to above method embodiment, the embodiment of the present invention additionally provides a kind of adaptive clustering routing device, such as Fig. 6
It is shown, it is a kind of structural representation of adaptive clustering routing device of the embodiment of the present invention, the device can include：
Sub-clustering module 601, for carrying out sub-clustering to all nodes in the range of base station communication, is obtained in the range of base station communication
Cluster area, wherein, cluster area include multiple nodes；
Dump energy acquisition module 602, for obtaining the first node in cluster area in the dump energy when front-wheel starts, its
In, first node is any one node in multiple nodes；
Energy expenditure estimates module 603, for estimating first node as the first energy expenditure of the leader cluster node in cluster area
With estimate second energy expenditure of the first node as the member node in cluster area, wherein, member node be cluster area in remove cluster head section
Node outside point；
Cluster head threshold value computing module 604, for being existed according to the first energy expenditure, the second energy expenditure and first node
Dump energy when front-wheel starts, calculates the cluster head threshold value of the first node in cluster area；
Judge module 605, for obtaining the random number of first node generation, and judges that the random number that first node is generated is
The no cluster head threshold value less than first node, wherein, random number is the number between 0-1；
Selecting module 606, when the random number for being generated in first node is less than the cluster head threshold value of first node, selection
First node is as cluster area when the leader cluster node of front-wheel.
A kind of adaptive clustering routing device provided in an embodiment of the present invention, considers that each node is remaining when cluster head is selected
The distance between energy, each node and next-hop cluster heart node, are better balanced energy expenditure between cluster area interior nodes so that cluster
Head node has enough charge transport data, it is ensured that the stabilization of whole network, extends the life span of whole network.
Specifically, sub-clustering module 601, identification information and position specifically for obtaining all nodes in the range of base station communication
Confidence ceases, and carries out sub-clustering to all nodes by K-means clustering algorithms, obtains the cluster area in the range of base station communication.
The embodiment of the present invention additionally provides a kind of electronic equipment, as shown in fig. 7, comprises processor 701, communication interface 702,
Memory 703 and communication bus 704, wherein, processor 701, communication interface 702, memory 703 is complete by communication bus 704
Into mutual communication,
Memory 703, for depositing computer program；
Processor 701, for performing during the program deposited on memory 703, realizes following steps：
All nodes in the range of base station communication are carried out sub-clustering, obtain the cluster area in the range of base station communication by step A, its
In, cluster area includes multiple nodes；
Step B, obtains the first node in cluster area in the dump energy when front-wheel starts, wherein, first node is multiple
Any one node in node；
Step C, estimates first node as the first energy expenditure of the leader cluster node in cluster area and estimates first node conduct
Second energy expenditure of the member node in cluster area, wherein, member node is the node in cluster area in addition to leader cluster node；
Step D, according to the first energy expenditure, the second energy expenditure and first node in the residual energy when front-wheel starts
Amount, calculates the cluster head threshold value of the first node in cluster area；
Step E, obtains the random number of first node generation, and judges whether the random number of first node generation is less than first
The cluster head threshold value of node, wherein, random number is the number between 0-1；
Step F, when the random number that first node is generated is less than the cluster head threshold value of first node, selection first node is made
It is cluster area when the leader cluster node of front-wheel.
The communication bus 704 that above-mentioned electronic equipment is mentioned can be Peripheral Component Interconnect standard (Peripheral
Component Interconnect, PCI) bus or EISA (Extended Industry Standard
Architecture, EISA) bus etc..The communication bus can be divided into address bus, data/address bus, controlling bus etc..For just
Only represented in expression, figure with a thick line, it is not intended that only one bus or a type of bus.
The communication that communication interface 702 is used between above-mentioned electronic equipment and other equipment.
Memory 703 can include random access memory (Random Access Memory, RAM), can also include
Nonvolatile memory (Non-Volatile Memory, NVM), for example, at least one magnetic disk storage.Optionally, memory
It can also be at least one storage device for being located remotely from aforementioned processor.
Above-mentioned processor 701 can be general processor, including central processing unit (Central Processing
Unit, CPU), network processing unit (Network Processor, NP) etc.；It can also be digital signal processor (Digital
Signal Processing, DSP), application specific integrated circuit (Application Specific Integrated Circuit,
ASIC), field programmable gate array (Field-Programmable Gate Array, FPGA) or other FPGAs
Device, discrete gate or transistor logic, discrete hardware components.
A kind of electronic equipment of adaptive clustering routing provided in an embodiment of the present invention, each section is considered when cluster head is selected
The distance between point dump energy, each node and next-hop cluster heart node, are better balanced energy expenditure between cluster area interior nodes,
So that leader cluster node there are enough charge transport data, it is ensured that the stabilization of whole network, extend the life span of whole network.
The embodiment of the present invention additionally provides a kind of computer-readable recording medium, the computer-readable recording medium memory storage
There is computer program, following methods are realized when computer program is executed by processor：
All nodes in the range of base station communication are carried out sub-clustering, obtain the cluster area in the range of base station communication by step A, its
In, cluster area includes multiple nodes；
Step B, obtains the first node in cluster area in the dump energy when front-wheel starts, wherein, first node is multiple
Any one node in node；
Step C, estimates first node as the first energy expenditure of the leader cluster node in cluster area and estimates first node conduct
Second energy expenditure of the member node in cluster area, wherein, member node is the node in cluster area in addition to leader cluster node；
Step D, according to the first energy expenditure, the second energy expenditure and first node in the residual energy when front-wheel starts
Amount, calculates the cluster head threshold value of the first node in cluster area；
Step E, obtains the random number of first node generation, and judges whether the random number of first node generation is less than first
The cluster head threshold value of node, wherein, random number is the number between 0-1；
Step F, when the random number that first node is generated is less than the cluster head threshold value of first node, selection first node is made
It is cluster area when the leader cluster node of front-wheel.
It should be noted that herein, such as first and second or the like relational terms are used merely to a reality
Body or operation make a distinction with another entity or operation, and not necessarily require or imply these entities or deposited between operating
In any this actual relation or order.Moreover, term " comprising ", "comprising" or its any other variant are intended to
Nonexcludability is included, so that process, method, article or equipment including a series of key elements not only will including those
Element, but also other key elements including being not expressly set out, or also include being this process, method, article or equipment
Intrinsic key element.In the absence of more restrictions, the key element limited by sentence "including a ...", it is not excluded that
Also there is other identical element in process, method, article or equipment including the key element.
Each embodiment in this specification is described by the way of related, identical similar portion between each embodiment
Divide mutually referring to what each embodiment was stressed is the difference with other embodiment.It is real especially for system
Apply for example, because it is substantially similar to embodiment of the method, so description is fairly simple, related part is referring to embodiment of the method
Part explanation.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all
Any modification, equivalent substitution and improvements made within the spirit and principles in the present invention etc., are all contained in protection scope of the present invention
It is interior.
Claims (10)
1. a kind of adaptive cluster routing method, it is characterised in that methods described is applied to base station, including：
Sub-clustering is carried out to all nodes in the range of the base station communication, the cluster area in the range of the base station communication is obtained, wherein,
The cluster area includes multiple nodes；
The first node in the cluster area is obtained in the dump energy when front-wheel starts, wherein, the first node is described many
Any one node in individual node；
The first node is estimated as the first energy expenditure of the leader cluster node in the cluster area and the first node work is estimated
For the second energy expenditure of the member node in the cluster area, wherein, the member node is to remove the cluster head section in the cluster area
Node outside point；
According to first energy expenditure, second energy expenditure and the first node in the residue when front-wheel starts
Energy, calculates the cluster head threshold value of the first node in the cluster area；
The random number of first node generation is obtained, and judges whether the random number of the first node generation is less than described the
The cluster head threshold value of one node, wherein, the random number is the number between 0-1；
When the random number that the first node is generated is less than the cluster head threshold value of the first node, the first node is selected
As the cluster area described when the leader cluster node of front-wheel.
2. according to the method described in claim 1, it is characterised in that all nodes in the range of the base station communication enter
Row sub-clustering, obtains the cluster area in the range of the base station communication, including：
The identification information and positional information of all nodes in the range of the base station communication are obtained, passes through K-means clustering algorithms
Sub-clustering is carried out to all nodes, the cluster area in the range of the base station communication is obtained.
3. according to the method described in claim 1, it is characterised in that the first node for obtaining the cluster area is opened when front-wheel
The dump energy during beginning, including：
Obtain the first node it is described when the last round of beginning of front-wheel when dump energy；
When the first node described when front-wheel last round of is leader cluster node, obtain the first node described current
The positional information of the last round of next-hop cluster head node of wheel, calculate the first node and the next-hop cluster head node away from
From, wherein, the node for the packet that the next-hop cluster head node sends for the reception first node；
Obtain information of the first node in the packet produced when last round of, place cluster area the member node of front-wheel
Amount, the first node send the information content of broadcast message, the energy expenditure of forwarding upper hop leader cluster node packet and institute
The radius in Shu Cu areas, passes through formula：
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msubsup>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mrow>
<mo>(</mo>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mn>1</mn>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>N</mi>
<mi>k</mi>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&CenterDot;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>a</mi>
<mi>d</mi>
<mi>v</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msubsup>
<mi>R</mi>
<mrow>
<msub>
<mi>CH</mi>
<mi>k</mi>
</msub>
</mrow>
<mn>2</mn>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>N</mi>
<mi>k</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msubsup>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mn>1</mn>
</mrow>
<mn>2</mn>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>+</mo>
<msub>
<mi>M</mi>
<mi>n</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&CenterDot;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>M</mi>
<mi>n</mi>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msubsup>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mn>1</mn>
</mrow>
<mn>2</mn>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Calculate the actual energy consumption of the first node；
Wherein, node of the upper hop leader cluster node for transmission packet to the first node, the E'CH(di1) represent institute
State actual energy consumption, the NkThe sum for representing k-th of cluster area node is N, the l'dataRepresent the first node place
The information of the packet of the actual generation of each node where the upper hop leader cluster node of cluster area and the first node in cluster area
Amount, the EelecRepresent preset electronic cost of energy, the l'advRepresent the actual letter for sending broadcast message of the first node
Breath amount, the εfsThe default free space model factor is represented, it is describedRepresent the radius in k-th of cluster area, i.e., it is described k-th
The distance of farthest node and cluster heart node, the d in cluster areai1Represent the first node and the next-hop cluster head node
Distance, the MnThe node total number in cluster area where the upper hop leader cluster node of the first node；
When the first node described when front-wheel last round of is member node, obtain the actual generation number of the first node
According to the information content of bag, the information content for the broadcast message for receiving the leader cluster node transmission and the radius in cluster area, pass through formula：
<mrow>
<mover>
<msubsup>
<mi>E</mi>
<mrow>
<mi>N</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&OverBar;</mo>
</mover>
<mo>=</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>a</mi>
<mi>d</mi>
<mi>v</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<msubsup>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>&CenterDot;</mo>
<mfrac>
<msubsup>
<mi>R</mi>
<mrow>
<msub>
<mi>CH</mi>
<mi>k</mi>
</msub>
</mrow>
<mn>2</mn>
</msubsup>
<mn>2</mn>
</mfrac>
</mrow>
The actual energy consumption of the first node is calculated, wherein, it is describedRepresent the first node actual energy consumption；
By the first node it is described when the last round of beginning of front-wheel when dump energy subtract the reality of the first node
Energy expenditure, obtains the first node in the dump energy when front-wheel starts.
4. according to the method described in claim 1, it is characterised in that the cluster area also includes cluster heart node, to the base station
All nodes in communication range carry out sub-clustering, obtain after the cluster area in the range of the base station communication, methods described also includes：
The routed path of the cluster heart node in the cluster area is calculated by Dijkstra shortest path firsts；
Accordingly, it is described to estimate the first node as the first energy expenditure of the leader cluster node in the cluster area and estimate described
First node as the member node in the cluster area the second energy expenditure, including：
The routed path of the cluster heart node in the cluster area is obtained, the next-hop cluster heart node of the cluster heart node in the cluster area is determined,
And calculate the distance of the first node and the next-hop cluster heart node；
Default node is obtained to produce in the information content, the information content of default transmission broadcast message, default forwarding of packet
One jumps the energy expenditure of cluster heart node data bag and the radius in cluster area, passes through formula：
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mn>2</mn>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>N</mi>
<mi>k</mi>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>a</mi>
<mi>d</mi>
<mi>v</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msubsup>
<mi>R</mi>
<mrow>
<msub>
<mi>CH</mi>
<mi>k</mi>
</msub>
</mrow>
<mn>2</mn>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>N</mi>
<mi>k</mi>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msubsup>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mn>2</mn>
</mrow>
<mn>2</mn>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>+</mo>
<msub>
<mi>M</mi>
<mi>n</mi>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>M</mi>
<mi>n</mi>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<msubsup>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mn>2</mn>
</mrow>
<mn>2</mn>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
The first node is estimated as the first energy expenditure of the leader cluster node in the cluster area；
Wherein, the ECH(di2) for the first energy expenditure of i-th node, the NkThe sum of the node in k-th of cluster area is represented,
The ldataRepresent that the default node produces the information content of packet, the EelecPreset electronic cost of energy is represented, it is described
ladvRepresent the default information content for sending broadcast message, the εfsThe default free space model factor is represented, it is describedRepresent the radius in k-th of cluster area, the di2Represent i-th node in the cluster area and the next-hop cluster heart node away from
From the MnThe sum of the node in cluster area is M where the upper hop cluster heart node of the cluster heart node in k-th of cluster area；
Pass through formula：
<mrow>
<mover>
<msub>
<mi>E</mi>
<mrow>
<mi>N</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>=</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>e</mi>
<mi>l</mi>
<mi>e</mi>
<mi>c</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>a</mi>
<mi>d</mi>
<mi>v</mi>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>&epsiv;</mi>
<mrow>
<mi>f</mi>
<mi>s</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<msub>
<mi>l</mi>
<mrow>
<mi>d</mi>
<mi>a</mi>
<mi>t</mi>
<mi>a</mi>
</mrow>
</msub>
<mo>&CenterDot;</mo>
<mfrac>
<msubsup>
<mi>R</mi>
<mrow>
<msub>
<mi>CH</mi>
<mi>k</mi>
</msub>
</mrow>
<mn>2</mn>
</msubsup>
<mn>2</mn>
</mfrac>
</mrow>
The first node is estimated as the second energy expenditure of the member node in the cluster area, wherein, it is describedRepresent institute
State the second energy expenditure.
5. method according to claim 4, it is characterised in that working as front-wheel in the first node for obtaining the cluster area
After dump energy during beginning, methods described also includes：
Judge whether the first node is more than preset energy threshold value in the dump energy when front-wheel starts；
Accordingly, it is described that front-wheel is being worked as according to first energy expenditure, second energy expenditure and the first node
Dump energy during beginning, calculates the cluster head threshold value of the first node in the cluster area, including：
When the first node is more than the preset energy threshold value in the dump energy when front-wheel starts, according to described the
One the first energy expenditure of node, the second energy expenditure of the first node and the first node are when front-wheel starts
Dump energy, passes through formula：
<mrow>
<msub>
<mi>p</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>(</mo>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mn>2</mn>
</mrow>
</msub>
<mo>)</mo>
<mo>-</mo>
<mover>
<msub>
<mi>E</mi>
<mrow>
<mi>N</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
</mfrac>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<mn>1</mn>
<mo>+</mo>
<mover>
<msub>
<mi>E</mi>
<mrow>
<mi>N</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>&CenterDot;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mi>k</mi>
</msub>
</munderover>
<mfrac>
<mn>1</mn>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>(</mo>
<msub>
<mi>d</mi>
<mi>j</mi>
</msub>
<mo>)</mo>
<mo>-</mo>
<mover>
<msub>
<mi>E</mi>
<mrow>
<mi>N</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
</mfrac>
</mrow>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mi>k</mi>
</msub>
</munderover>
<msub>
<mi>E</mi>
<mrow>
<mi>r</mi>
<mi>e</mi>
<mi>s</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mo>(</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>(</mo>
<msub>
<mi>d</mi>
<mi>j</mi>
</msub>
<mo>)</mo>
<mo>-</mo>
<mover>
<msub>
<mi>E</mi>
<mrow>
<mi>N</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
</mfrac>
</mrow>
</mfrac>
<mo>&CenterDot;</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>r</mi>
<mi>e</mi>
<mi>s</mi>
</mrow>
</msub>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
<mo>-</mo>
<mover>
<msub>
<mi>E</mi>
<mrow>
<mi>N</mi>
<mi>C</mi>
<mi>H</mi>
</mrow>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
</mrow>
The first node is calculated as the probability of the leader cluster node in the cluster area, wherein, the piFor i-th of the cluster area
Node is used as the probability of leader cluster node, the ECH(di2) for the first energy expenditure of i-th node, the ECH(dj) it is described
First energy expenditure of j-th of node, the E in node in cluster area in addition to i-th of noderes(i) it is i-th of node
Dump energy, the Eres(j) it is the residual energy of j-th of node in the node in the cluster area in addition to i-th of node
Amount；
Pass through formula：
The cluster head threshold value of the first node is calculated, wherein, the Thres (i, r) represents that i-th of node in the cluster area exists
The cluster head threshold value of r wheels, the r is wheel number, Gi(r)=1 represent i-th of node theWheel is to theMade cluster head, G between wheeli(r)=0 represent i-th of node theWheel
ToDo not made cluster head between wheel,Expression is askedRemainder.
6. according to the method described in claim 1, it is characterised in that the random number generated in the first node is less than described the
During the cluster head threshold value of one node, select the first node as the cluster area it is described when the leader cluster node of front-wheel after,
Methods described also includes：
The leader cluster node in the cluster area is calculated to the routed path of base station by Dijkstra shortest path firsts.
7. method according to claim 6, it is characterised in that pass through Dijkstra shortest path firsts calculating institute described
The leader cluster node in Shu Cu areas is to after the routed path of base station, and methods described also includes：
Calculate respectively the leader cluster node in Section Point and the cluster area, the leader cluster node in the cluster area next-hop cluster head node it
Between distance, wherein, the Section Point is node in addition to the first node in the cluster area；
Distance between the next-hop cluster head node of the leader cluster node in the Section Point and the cluster area is less than described second
When the distance between node and the leader cluster node in the cluster area, send the short frame of request and instruct to Section Point, wherein, the request
The cluster head to the cluster area is asked in short frame instruction for the short frame that the instruction Section Point sends the extra time division multiple acess scheduling of request
The instruction of the next-hop cluster head node of node.
8. a kind of adaptive clustering routing device, it is characterised in that described device is applied to base station, including：
Sub-clustering module, for carrying out sub-clustering to all nodes in the range of the base station communication, obtains the base station communication scope
Nei Cu areas, wherein, the cluster area includes multiple nodes；
Dump energy acquisition module, for obtaining the first node in the cluster area in the dump energy when front-wheel starts, wherein,
The first node is any one node in the multiple node；
Energy expenditure estimates module, for estimating the first node as the first energy expenditure of the leader cluster node in the cluster area
With estimate second energy expenditure of the first node as the member node in the cluster area, wherein, the member node is institute
Node in Shu Cu areas in addition to the leader cluster node；
Cluster head threshold value computing module, for according to first energy expenditure, second energy expenditure and described first
Node calculates the cluster head threshold value of the first node in the cluster area in the dump energy when front-wheel starts；
Judge module, for obtaining the random number of the first node generation, and judges the random number of the first node generation
Whether the cluster head threshold value of the first node is less than, wherein, the random number is the number between 0-1；
Selecting module, when the random number for being generated in the first node is less than the cluster head threshold value of the first node, choosing
Select the first node as the cluster area described when the leader cluster node of front-wheel.
9. device according to claim 8, it is characterised in that the sub-clustering module, leads to specifically for obtaining the base station
All nodes are carried out by the identification information and positional information of all nodes in the range of letter by K-means clustering algorithms
Sub-clustering, obtains the cluster area in the range of the base station communication.
10. a kind of electronic equipment, it is characterised in that including processor, communication interface, memory and communication bus, wherein, it is described
Processor, the communication interface, the memory completes mutual communication by the communication bus；
The memory, for storing computer program；
The processor, for stored on the memory is performed program when, realize any one of claim 1~7 institute
The adaptive cluster routing method stated；
The communication interface, data exchange is carried out for the electronic equipment and external equipment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710630230.XA CN107295597B (en) | 2017-07-28 | 2017-07-28 | A kind of adaptive cluster routing method, device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710630230.XA CN107295597B (en) | 2017-07-28 | 2017-07-28 | A kind of adaptive cluster routing method, device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107295597A true CN107295597A (en) | 2017-10-24 |
| CN107295597B CN107295597B (en) | 2019-07-19 |
Family
ID=60103609
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710630230.XA Active CN107295597B (en) | 2017-07-28 | 2017-07-28 | A kind of adaptive cluster routing method, device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107295597B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110602757A (en) * | 2019-09-18 | 2019-12-20 | 上海海事大学 | Wireless sensor network clustering routing method based on adaptive genetic algorithm |
| CN111083733A (en) * | 2020-02-10 | 2020-04-28 | 安徽理工大学 | Congestion control method and system for wireless sensor network |
| CN112051824A (en) * | 2020-09-22 | 2020-12-08 | 吴信强 | Operation and maintenance system based on industrial Internet of things |
| CN114363988A (en) * | 2021-12-10 | 2022-04-15 | 北京佰才邦技术股份有限公司 | Clustering method and device and electronic equipment |
| CN116056111A (en) * | 2022-11-16 | 2023-05-02 | 广西电网有限责任公司贺州供电局 | Equipment risk management and control and hidden danger treatment system based on Internet of things |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004047007A1 (en) * | 2002-11-15 | 2004-06-03 | Bioarray Solutions, Ltd. | Analysis, secure access to, and transmission of array images |
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN103139862A (en) * | 2012-11-22 | 2013-06-05 | 江南大学 | Wireless sensor network multi-source data fusion method based on queries |
| CN105072656A (en) * | 2015-07-10 | 2015-11-18 | 桂林电子科技大学 | Multi-level heterogeneous wireless sensor network clustering routing method based on K-means clustering and ant colony optimization |
-
2017
- 2017-07-28 CN CN201710630230.XA patent/CN107295597B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004047007A1 (en) * | 2002-11-15 | 2004-06-03 | Bioarray Solutions, Ltd. | Analysis, secure access to, and transmission of array images |
| CN103139862A (en) * | 2012-11-22 | 2013-06-05 | 江南大学 | Wireless sensor network multi-source data fusion method based on queries |
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN105072656A (en) * | 2015-07-10 | 2015-11-18 | 桂林电子科技大学 | Multi-level heterogeneous wireless sensor network clustering routing method based on K-means clustering and ant colony optimization |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110602757A (en) * | 2019-09-18 | 2019-12-20 | 上海海事大学 | Wireless sensor network clustering routing method based on adaptive genetic algorithm |
| CN110602757B (en) * | 2019-09-18 | 2023-05-12 | 上海海事大学 | Wireless sensor network clustering routing method based on adaptive genetic algorithm |
| CN111083733A (en) * | 2020-02-10 | 2020-04-28 | 安徽理工大学 | Congestion control method and system for wireless sensor network |
| CN111083733B (en) * | 2020-02-10 | 2022-04-19 | 安徽理工大学 | Congestion control method and system for wireless sensor network |
| CN112051824A (en) * | 2020-09-22 | 2020-12-08 | 吴信强 | Operation and maintenance system based on industrial Internet of things |
| CN114363988A (en) * | 2021-12-10 | 2022-04-15 | 北京佰才邦技术股份有限公司 | Clustering method and device and electronic equipment |
| CN116056111A (en) * | 2022-11-16 | 2023-05-02 | 广西电网有限责任公司贺州供电局 | Equipment risk management and control and hidden danger treatment system based on Internet of things |
| CN116056111B (en) * | 2022-11-16 | 2023-07-18 | 广西电网有限责任公司贺州供电局 | Equipment risk management and control and hidden danger treatment system based on Internet of things |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107295597B (en) | 2019-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107295597A (en) | A kind of adaptive cluster routing method, device and electronic equipment | |
| Zhang et al. | A hierarchical game framework for resource management in fog computing | |
| WO2016180004A1 (en) | Wireless sensor network charging method for multi-charge nodes | |
| CN103534992B (en) | Send method, interchanger, server and the system for setting up connection request | |
| CN104170335B (en) | Congestion control and resource allocation in separated system structure network | |
| CN103746852B (en) | Service routing configuration method and network management equipment | |
| US20140029447A1 (en) | Forwarding tables for hybrid communication networks | |
| Gelenbe et al. | Interconnected wireless sensors with energy harvesting | |
| CN109257287A (en) | A kind of shortest path determines method and controller | |
| CN106550422B (en) | A kind of wireless sensor network clustering routing based on harmonic search algorithm | |
| CN101232517B (en) | Method for disposing poly concourse nodes irrespective of geographical position | |
| CN108235247A (en) | A kind of node positioning method and its device | |
| CN108206785A (en) | Optimize and routing and/or the relevant information of next-hop for multicast traffic | |
| CN108174411A (en) | Wireless sensor network routing method based on fuzzy logic | |
| CN108064064A (en) | Wireless sensor network Ad Hoc is by method and apparatus | |
| CN107101645A (en) | A kind of paths planning method and path planning apparatus | |
| CN110428206B (en) | Intelligent solution method and device for delivery of express delivery terminal, storage medium and electronic equipment | |
| CN106131916A (en) | A kind of wireless network method for routing foundation based on ant group algorithm | |
| CN110490331A (en) | The processing method and processing device of knowledge mapping interior joint | |
| Rafi et al. | Efficient energy utilization in fog computing based wireless sensor networks | |
| CN108696453A (en) | The power telecom network SDN Business Streams cognitive method and system of lightweight | |
| CN107360090A (en) | A kind of distributed load equalizing method for routing and system based on content | |
| CN105898789A (en) | Wireless sensor network data aggregation method | |
| CN104093182B (en) | A kind of method for obtaining a plurality of reliable communication path in multilayer wireless network based on field strength | |
| CN103078796A (en) | Routing calculation method and equipment |
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 |