CN102448138B - Method for clustering hierarchical routing protocols of wireless sensor network - Google Patents
Method for clustering hierarchical routing protocols of wireless sensor network Download PDFInfo
- Publication number
- CN102448138B CN102448138B CN201110458685.0A CN201110458685A CN102448138B CN 102448138 B CN102448138 B CN 102448138B CN 201110458685 A CN201110458685 A CN 201110458685A CN 102448138 B CN102448138 B CN 102448138B
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- cluster head
- msg
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a method for clustering hierarchical routing protocols of a wireless sensor network. Different from the traditional clustering method of the hierarchical routing protocols, the method has the characterized in that each node is identified with a hierarchical number and a clustering number; a reasonable clustering number of each layer is calculated; and a reasonable network topological structure is designed. The problems that too many clustering regions of the traditional routing protocol are distributed and the network management of a base station is more fussy and complicated are solved. According to the method for independently reconstructing clusters provided by the invention, energy consumption between a head cluster node and an inner cluster node is efficiently balanced, communication efficiency of a head cluster node base station is efficiently increased, and service life of a network is obviously prolonged. An auxiliary node is used for monitoring the head cluster node in real time, thereby avoiding energy waste caused when a cluster head dies suddenly and the whole cluster is out of management. During a data transmission process, a reasonable path remedial strategy is designed, thereby efficiently increasing the efficiency and completeness of the data transmission.
Description
Technical field
The present invention relates to WSNs (Wireless Sensor Networks, wireless sensor network) technical field, that a kind of establishment stage energy consumption that solves wireless sensor network hierarchical routing bunch is large, efficiency is low, the group cluster method that network life cycle is shorter.
Background technology
Routing Protocol is a key areas in WSNs research, and its algorithm design must be considered the main features such as WSNs self multi-hop, self-organizing, Bureau of Energy are sex-limited, environmental correclation.Show the concept of hierarchical routing introducing group bunch, autgmentability and operating efficiency that can more effective assurance WSNs system through large quantity research.
The main research point of level route be group bunch and transmission.Hierarchical routing often carries out taking turns all and will according to certain rule, carry out at the whole network the reconstruction of primary cluster.The group of some hierarchical routings bunch machine-processed more complicated, when choosing cluster head, not only considers the energy of node, also will consider the factor such as relatively of node and neighbor node energy around, needs and a large amount of exchange grouping information of neighbor node.Although can guarantee like this reasonability of cluster head election, greatly increase the amount of calculation of node in group bunch process.The rule of choosing bunch is more complicated, and the amount of calculation of node is larger, and the expense cost of energy is just larger.Consider following situation, the mode of repeating query is just showed deficiency:
(1) after whole network data end of transmission, likely the operating state of most of bunch is good, and the energy that wherein cluster head consumes is also few.If at this moment enter the re-electing of cluster head of next round, not only destroyed good network configuration, especially a kind of waste to system work at present state.In the network system of multi-hop transmission, each transmit stage of taking turns all will be built complicated transmission path.So again next round except bunch reconstruction, the cluster head far away apart from base station, also will build route again.This has also caused the waste of energy.
(2) continuous, stable, the real-time passback data of major applications need for environment wireless sensor network, to meet user's demand.If bunch reconstruction sequential long, and adopted the working method of repeating query, every, take turns the incipient stage, network system is in the restructuring of carrying out bunch, and route builds, just this has interrupted the passback of data toward base station.This makes troubles to monitoring in real time.
The schematic network structure of hierarchical routing as shown in Figure 1.
Summary of the invention
Technical problem to be solved by this invention is: in view of the foregoing defects the prior art has, abandoned the working method of repeating query, design a kind of Wireless Sensor Network Routing Protocol clustering method-independence and rebuild bunch (IRC, independence reconstruction of cluster) solve in massive wireless sensor, after whole network data is transmitted, need to re-elect cluster head, and the energy consumption of the nodes causing consumes excessive problem.The cluster head energy having in this stage is also enough large, can also continue to serve as, if re-elect a bunch head, this can increase the expense of system undoubtedly, affects the life cycle of network.
The technical method that the present invention addresses the above problem is: when netinit, by base station, according to the geographical location information of node, whole sensor network is carried out to reasonable layering and sub-clustering, then all Node configuration levels number (Area) and bunch number (CNum) are identified.Guarantee like this bunch with bunch between keep separate, in certain bunch of rotation, do not affect other normal work of in good condition bunch, can not cause the again topological of whole network configuration yet.Because the initialization of network is by the unified configuration in base station, thus can guarantee bunch being uniformly distributed of pickup area, and according to the width of each level and bunch size, foundation solves the equation of best cluster head quantity, the reasonable layout of assurance bunch.Meanwhile, introduce auxiliary node, be responsible for intercepting the working condition of cluster head, once find the die by visitation of God of cluster head node, announced oneself to be cluster head node, and replaced cluster head issue reconstruction information.In data transmission procedure, utilize level number sign assurance data transfer path all to unify to bottom, to point to successively base station by high level, there will not be loop, detour, can effectively improve the efficiency of transfer of data.Bunch interior nodes communicates with mode and the cluster head node of single-hop, and cluster head node communicates with mode and the base station of multi-hop.
The concrete steps of method are as follows:
1) netinit
A, division level
Before WSNs system works, first take base station sink as the center of circle, the nR of take is divided into n layer by monitored area as radius, and wherein R is critical value, and n is greater than zero positive integer;
B, definite bunch territory
When sensor node is routed to behind monitored area at random, by GPS, obtain the coordinate information of each node, then the coordinate of sensor node and energy are sent to base station, by base station according to the quantity of the size of monitored area and sensor node the whole network carry out level and bunch division, set up level number and bunch number; Then determine bunch territory, bunch territory is the size of bunch, node number and the distributing position that stipulate when sensor network initialization sub-clustering base station; Then in each bunch, choose energy maximum, and two nearest nodes are as cluster head node and auxiliary node, if the primary power of node is all identical, choose at random two nearest nodes; Base station broadcasts to each node these configuration informations by the whole network subsequently; Because the first level is nearer apart from base station, base station is positioned at the 1st Ceng center.So in the 1st layer, there is no cluster head, in the 1st layer in all ordinary nodes all carry out direct communication with base station;
Bunch territory can not change in network fortune afterwards, bunch be independently reconstituted in single bunch of territory and carry out, only change cluster head and auxiliary node, and can not change a bunch territory;
C, determine every layer of number of clusters
Bunch territory is fan-shaped, wherein the quantity in bunch territory of i layer
for:
2), the realization of transfer of data
The foundation in a, multi-hop transmission path
Between bunch, data communication relies on multi-hop transmission path to carry out, except the node of ground floor can send the data directly to base station, data communication between other high level and base station will be through the mode of multi-hop, by bridge node, data are delivered to base station according to high-rise multi-hop transmission path of jumping step by step toward the direction of low layer, bridge node is only served as by ordinary node, and cluster head or auxiliary node do not participate in campaigning for bridge node;
B, bunch between the foundation of route
By the cluster head at initiating terminal place, data communication multi-hop transmission path bunch first broadcast Msg_FindNext to lower one deck,
The ordinary node of lower one deck receives after this information, and passback message Msg_ElectB give cluster head above, the ID that Msg_ElectB message comprises ordinary node, dump energy and coordinate,
C. cluster head is calculated respectively with each and is returned information node apart from d and degree of getting close to, and degree of getting close to is the ratio of the distance D between residue energy of node PA and two nodes, chooses the node of degree of getting close to maximum as bridge node or first bridge node of the first jumping,
D. cluster head transmission Msg_BeB message is confirmed to the first bridge node, and has built in the first path of jumping;
E. the first bridge node continues to send Msg_FindNext to descending one deck again subsequently, and finds next bridge node according to degree of getting close to;
By that analogy, until message is while arriving base station, by initial cluster head, the multi-hop transmission path to base station is successfully established whole piece.
Auxiliary node for bunch restructuring realize, the election standard of auxiliary node is the member node with degree of the getting close to maximum of cluster head, what is called degree of getting close to is exactly that member node dump energy PA and this node are to the ratio of the distance D of cluster head; The function of auxiliary node is as follows:
A, auxiliary node do not carry out data acquisition
B, in bunch when restructuring, it is cluster head that auxiliary node is directly inherited, and according to the selection rule of auxiliary node, again chooses the auxiliary node of oneself;
C, auxiliary node are responsible for intercepting the working condition of cluster head, once find the die by visitation of God of cluster head node, announce oneself to be cluster head node, and replace cluster head issue reconstruction information;
The reconstruction that has two kinds of situations need to carry out bunch: the die by visitation of God of cluster head and the energy of cluster head consume excessive;
Bunch process of reconstruction as follows:
First member node stops sending data to cluster head after receiving Msg_CHDead, auxiliary node receives Msg_CHDead or learns when cluster head is dead, local state is made as to cluster head, then bunch in broadcast Msg_CReBulid, member node receives after Msg_CReBulid, local cluster head ID is updated to the Source_ID of this information, be former auxiliary node ID, then to new cluster head, send Msg_ElectS message, the dump energy that Msg_ElectS comprises member node, coordinate and ID, new cluster head can be calculated the degree of getting close to each member node successively, the node of degree of getting close to maximum is elected as new auxiliary node.After new auxiliary node is elected, just no longer carried out data acquisition; New cluster head can be informed member node to complete bunch of broadcast Msg_OKBulid message subsequently, bunch reconstruction complete, can send data to normally cluster head; Bunch process of reconstruction in all message of transmitting, all with ANum and the CNum of active node, if a bunch outer sensor node receives these information, ANum in message, CNum are different from this locality, these message are left in the basket, be left intact, the independent reconstruction so just having guaranteed bunch.
In the realization of transfer of data, for same transmission path, use after certain hour, some bridge nodes wherein there will be energy to consume too fast phenomenon, these nodes must exit path to avoid node dead too early, need to adopt path to remedy implementation method: i.e. the energy consumption of certain bridge node in certain paths reaches a certain threshold value, need exit path, step is as follows:
(1) first certain bridge node sends the message Msg_QuitB of the ID that comprises down hop bridge node to the upper hop bridge node of oneself, and then this bridge node becomes ordinary node again;
(2) upper hop bridge node, according to the method for building up of route between aforesaid bunch, resends Msg_ReFindNext and searches out down hop bridge node.
Tool of the present invention has the following advantages:
(1) different from the cluster-dividing method of traditional hierarchical routing, the present invention is to all Node configuration levels number and bunch number identify, and calculate every layer of rational number of clusters, designed rational network topology structure, bunch territory that has solved traditional Routing Protocol distributes too much, and base station is to the more loaded down with trivial details and complicated problem of the management of network.
(2) independent method of rebuilding bunch that the present invention proposes is the energy consumption between balance cluster head node and bunch interior nodes effectively, has effectively improved the efficiency that leader cluster node base station communicates, and has extended significantly the life cycle of network.
(3) the present invention carries out real-time monitoring by auxiliary node to cluster head node, prevents because of cluster head die by visitation of God, and whole bunch loses management, and member node can not receive a bunch reconstruction message, still ceaselessly sends data, waste energy.
(4) the present invention, in data transmission procedure, has designed rational path and has remedied strategy, has effectively improved efficiency and the integrality of transfer of data.
Accompanying drawing explanation
Fig. 1: the structural representation of wireless sensor network hierarchical routing;
Fig. 2: schematic network structure of the present invention;
Fig. 3: tactful schematic diagram is remedied in path of the present invention;
Fig. 4: general flow chart of the present invention;
Fig. 5: the independent flow chart of rebuilding of of the present invention bunch;
Fig. 6: the flow chart that route of the present invention is built;
Fig. 7: route of the present invention is remedied flow chart.
embodiment:
The present invention is by the method for independently rebuilding bunch, when netinit, to all Node configuration levels number with bunch number identify, elect cluster head and auxiliary node, the robustness guaranteeing bunch simultaneously, and determined the quantity of every layer bunch, guarantee that in network, all nodes reasonably distribute.In the transmitting procedure of data, strategy is remedied in path reasonable in design, and bunch interior nodes communicates with mode and the cluster head node of single-hop, and cluster head node communicates with mode and the base station of multi-hop, can effectively improve the efficiency of transfer of data.By this invention effectively the energy between balance cluster head node and bunch interior nodes consume, effectively improved the efficiency that leader cluster node base station communicates, extended significantly the life cycle of network.Appendix 1 is the data structure of the present invention's node used; Appendix 2 is main type of message of the present invention and explanation thereof.
Specific embodiment of the invention process is as follows:
1. netinit
Make in the present invention each bunch separate, the cluster head of bunch needs rotation only need in this bunch, carry out, and does not affect the work of other bunch.Can reduce so again the spending of group bunch.
In wireless transmission model, R is an important parameter of this agreement.Node i transmission energy consumption formula is:
Wherein L is the byte number of transmission,
for the energy of circuitry consumes,
with
be respectively free space transmission parameter and multichannel attenuation parameter, D is transmission range, and R is critical value.Known when transmission range is greater than critical value R, energy consumption increases greatly.So transmission ranges all in the present invention are all controlled under R.
(1) divide level
Before WSNs system works, first take sink as the center of circle, with R, 2R, 3R ... (n-1) R, nR is that radius is divided into n layer by monitored area, wherein n is greater than zero positive integer.
(2) determine bunch territory
When sensor node is routed to behind monitored area at random, we can obtain the coordinate information of each node by GPS, then the coordinate of sensor node and energy are sent to base station, by base station, calculated, added up.Base station according to the quantity of the size of monitored area and sensor node the whole network carry out level and bunch division, and in each bunch, choose energy maximum, and two nearest nodes are as cluster head node and auxiliary node (if the primary power of node is all identical, choosing at random two nearest nodes).Base station broadcasts to each node these configuration informations by the whole network subsequently.Because the first level is nearer apart from base station, base station is positioned at the 1st Ceng center.So there is no cluster head in the 1st layer, all ordinary nodes all carry out direct communication with base station.
Divided level and bunch after, need to determine the size-bunch territory (ClusterZone) of each bunch.Bunch territory is the size of bunch, node number and the distributing position that stipulate when sensor network initialization sub-clustering base station.Bunch territory can not change in network fortune afterwards.Bunch be independently reconstituted in single bunch of territory and carry out, only change cluster head and auxiliary node, and can not change a bunch territory.
If i
the width of layer annulus is
=R, the radius in its bunch territory is
.In order to guarantee that a bunch of territory can cover the width of place level annulus completely.Bunch territory radius
first must meet
.
Next is established the node random distribution of sensor node and obeys Poisson distribution, and the density of laying is
, and cluster head is positioned at Cu Yu center.S is the area in bunch territory,
.For all monitored areas being covered, in schematic network structure, bunch domain representation is fan-shaped.Bunch territory inner sensor node number n is
.The coordinate of node j is
,
be node j apart from the distance of cluster head, distance expectation can be expressed as:
（2）
And the total energy consumption of node i unit of transfer data is:
So the transmission total energy consumption of this bunch is:
By above formula, can be learnt: r is larger, the transmission total energy consumption of bunch is larger, so in IEC-HRP agreement
value
.
(3) determine every layer of number of clusters
Because bunch territory no longer changes after netinit sets, so the layout in bunch territory is wanted to cover region completely.
Invention herein adopts fan-shaped bunch territory, as the quantity of fan-shaped increase node few, so and a circular bunch territory compare, bunch energy consumption change not quite, and greatly reduced every one deck bunch quantity, facilitate the management of base station to network system.
The quantity in i layer bunch territory wherein
for:
Schematic network structure after initialization is shown in Fig. 2.
2. data transfer phase implementation method
Between in the present invention bunch, data communication is mainly the mode that relies on multi-hop.Nearer apart from base station except the cluster head of ground floor, can send the data directly to base station, other high-rise cluster head all will be through the mode of multi-hop, hop-by-hop data are delivered to base station according to the high-rise direction toward bottom.
(1) definition of bridge node
The intermediate node in multi-hop transmission path, is called bridge node in the present invention.Bridge node is only served as by rank and file's node.Cluster head or auxiliary node are being born the work of management bunch, in order to save the longest normal working hours of energy to maintain bunch, so cluster head and auxiliary node do not participate in campaigning for bridge node,
Bunch (2) foundation of route between
Appendix 2 is shown in type of message explanation used below.
For example, when certain cluster head A of N layer has data to return base station, start to carry out route and build:
A. cluster head A broadcast Msg_FindNext to N-1 layer first.
B. the ordinary node of N-1 layer is received after this information, and Msg_ElectB is to A for passback message.The ID that Msg_ElectB message comprises ordinary node, dump energy and coordinate.
C.A calculates respectively with each and returns information node apart from d and degree of getting close to (being PA/d), chooses the Node B of degree of getting close to maximum, as down hop bridge node.A node is established A.Next=B.
D. cluster head A transmission Msg_BeB message is confirmed to B node, and B node is established B.Last=A.Has built in such one path of jumping.
E. B node continues to send Msg_FindNext to N-2 layer subsequently, finds next-hop node.
By that analogy, until message is while arriving base station, whole piece is successfully established to the transmission path of base station by cluster head A.Then base station reverse can start to send data (Msg_Data) along this paths transmission message Msg_OK notice cluster head A.
3. restructuring implementation method bunch
In the present invention, introduce the concept of auxiliary node.In the netinit stage, the election of auxiliary node is the same with the election of cluster head all has base station to appoint.Auxiliary node is selected as next cluster head, and its election standard is the member node with degree of the getting close to maximum of cluster head.So-called " degree of getting close to " is exactly the ratio that member node dump energy PA and this node arrive the distance D of cluster head.
The function of auxiliary node is as follows:
(1) auxiliary node does not carry out data acquisition
(2), in bunch when restructuring, it is cluster head that auxiliary node is directly inherited, and according to the selection rule of auxiliary node, again chooses the auxiliary node of oneself.
(3) auxiliary node is responsible for intercepting the working condition of cluster head, once find the die by visitation of God of cluster head node, announces oneself to be cluster head node, and replaces cluster head issue reconstruction information.
Introduce the benefit of auxiliary node:
(1) intercept the survival state of cluster head node, prevent because of cluster head die by visitation of God, whole bunch loses management, and member node can not receive a bunch reconstruction message, still ceaselessly sends data, waste energy.And auxiliary node can replace the cluster head management bunch of die by visitation of God.
(2) the common management bunch of cluster head node and auxiliary node, and the probability of their dies by visitation of God is simultaneously very little, this fault-tolerance and robustness from having improved on the one hand bunch.
(3) auxiliary node energy is only second to cluster head, and nearest apart from cluster head.By auxiliary node directly inherit cluster head guaranteed member node around bunch in topological structure need not there is large variation.
(4) auxiliary node, except simply intercepting work, does not carry out data acquisition and reception.It is minimum that this can be able to consume auxiliary node, meets the condition of doing cluster head.
Appendix 2 is shown in type of message explanation used below.
The reconstruction that has two kinds of situations need to carry out bunch: the die by visitation of God of cluster head and the energy of cluster head consume excessive.Should image data due to cluster head node, carry out again complete bunch data fusion and bunch in the management of member node, so the energy consumption of cluster head is much larger than member node.Dead because of depleted of energy in order to prevent cluster head, so set when cluster head energy is during lower than certain threshold value, just declaration be no longer cluster head node, and sends message Msg_CHDead cluster knot point extremely entirely.But now cluster head node does not log off, just become member node, be responsible for image data, send to next cluster head.
Cluster head is also likely subject to extraneous factor affects die by visitation of God.Now due to this agreement bunch in set the active situation that an auxiliary node is used for intercepting cluster head.Once so in certain time slot, auxiliary node learns that cluster head is dead, replace cluster head broadcast Msg_CHDead message.
The process of reconstruction of concrete bunch is as follows:
First member node stops sending data to cluster head after receiving Msg_CHDead.Auxiliary node receives Msg_CHDead or learns when cluster head is dead, and local state is made as to cluster head, then bunch in broadcast Msg_CReBulid.Member node receives after Msg_CReBulid, local cluster head ID is updated to the Source_ID of this information, and last auxiliary node ID, then sends Msg_ElectS message to new cluster head.The dump energy that Msg_ElectS comprises member node, coordinate and ID.New cluster head can be calculated and each member node " degree of getting close to " successively, and the node of degree of getting close to maximum is elected as new auxiliary node.After auxiliary node is elected, just no longer carried out data acquisition.New cluster head can be informed member node to complete bunch of broadcast Msg_OKBulid message subsequently, bunch reconstruction complete, can send data to normally cluster head.
Specifically, bunch process of reconstruction in all message of transmitting, all with ANum and the CNum of active node.If a bunch outer sensor node receives these information, the ANum in message, CNum are different from this locality, and these message are left in the basket, and are left intact.The independent reconstruction so just having guaranteed bunch.
4. tactful implementation method is remedied in path
Appendix 1,2 is shown in following data, type of message explanation.
Same transmission path is used after certain hour, and some nodes wherein there will be energy to consume too fast phenomenon, must exit path to avoid node death too early.The present invention is adopted as and exits node and find the strategy of remedying of substitute and again fill up path, and need not again build path.
For example, the energy consumption of the Node B in certain paths reaches a certain threshold value, needs exit path:
(1) first B node sends the message Msg_QuitB of the ID that comprises next-hop node C to the upper hop node A of oneself, and B node becomes ordinary node again, Node (B) .Type=1.
(2) method that node A builds according to above-mentioned route, resends Msg_ReFindNext and searches out next-hop node D.D has returned message Msg_ReElectB.
(3) the message Msg_NextNext that A sends the ID that comprises node C is to D.D will arrange D.last=A, D.Next=C, thus complete the substitute to Node B, filled up whole path, transfer of data can be proceeded.
Strategy is remedied as shown in Figure 3 in path.
5. work main-process stream of the present invention
In of the present invention group of cluster method, any one node i in network, in normal operation, to receiving independent that the processing of information comprises bunch, rebuild, bunch between building with route of route remedy strategy, its total flow process is as shown in Figure 4.
Appendix 2 is shown in type of message explanation used below.
(1) node i is received after information, first judges the type of information.If bunch reconstruction class message (Msg_CHDead/ Msg_CReBulid/Msg_ElectS/Msg_BeS/Msg_
OKBulid), the source node that then judgement sends message whether with local node same bunch of same level.If so, the process of reconstruction entering bunch, as shown in Figure 5; If not, ignore this message.
(2) if type of message is route builds class (Msg_FindNext/Msg_ElectB/Msg_BeB), whether the source node that then judgement sends message is in local node last layer.If so, enter route build process, as shown in Figure 6; If not, ignore this message.
(3) if being route, type of message remedies class (Msg_QuitB/Msg_-ReFindNext/Msg_Re
Whether the source node that-ElectB/Msg_NextNext), then judgement sends message the last layer in local node.If so, enter route build process, as shown in Figure 7; If not, ignore this message.
If type of message is data class (Msg_Data), the source node that judgement sends message whether with local node in same bunch of same level, if then judge the node type of local node.If cluster head processes message and merges, if auxiliary node or member node are ignored this message.If the source node of message is from last layer, be transmitted to next-hop node.
Appendix 1
Data structure:
typedef Node
{
Unsigned int ID; The physics numbering of // node
Unsigned int ANum; Level under // node
Unsigned int CNum; // affiliated bunch number
Unsigned int CHNum; // cluster head node physics the numbering of affiliated bunch
Unsigned char Type // 0 ordinary node; 1 cluster head node; 2 auxiliary nodes; // 3 bridge nodes;
Unsigned float PA; // residue energy of node
Node next; // next-hop node
Node last; // upper hop node
}
Appendix 2
Message structure:
Type of message:
Msg_CHDead: cluster head exits message, is sent by cluster head/auxiliary node.Level ANum, CNum that this message comprises this cluster head/auxiliary node place.The ordinary node of receiving this message knows that cluster head announced to exit, stops immediately sending message to cluster head.
Msg_CReBulid: bunch reconstruction message, by auxiliary node, sent.Level ANum, CNum that this message comprises this cluster head/auxiliary node place.The member node of receiving this message will arrange local Node.CH=Msg_CReBulid. Source_ID, and starts to campaign for auxiliary node.
Msg_ElectS: election contest auxiliary node message, the cluster head in member node sends to bunch.The PA that this message comprises member node, Loc.
Msg_BeS: appoint auxiliary node message, send to destination node by cluster head node.Destination node is received and oneself is become auxiliary node afterwards, stops data acquisition.
Msg_OKBulid: bunch reconstruction complete message, by cluster head node, send to member node.The ANum that this message comprises cluster head place, CNum.In bunch, member node is received after this message, starts to continue to send data to cluster head according to sequential.
Msg_FineNext: find next-hop node message, sent by cluster head or member node.The ANum that this message comprises source node place.Only have the ordinary node of lower one deck to receive that this message just gives a response.
Msg_ElectB: election contest bridge node message, is sent by member node.The PA that this message comprises source node, Loc.
Msg_BeB: appoint bridge node message, send to destination node by cluster head or member node.After destination node is received, become the next-hop node of source node, and start to find the next-hop node of oneself.
Msg_QuitB: bridge node exits message, sends to upper hop node by member node.The ID that this message comprises next-hop node.
Msg_ReFindNext: again find next-hop node message, sent by cluster head or member node.The ANum that this message comprises source node place.Only have lower one deck ordinary node to receive that this message just makes a response.
Msg_ReElectB: again campaign for bridge node message, sent by member node.The PA that this message comprises source node, Loc.
Msg_NextNext: again appoint bridge node message, sent by cluster head/member node.The next-hop node ID that this message comprises source node.
Msg_OK: route is built successfully message, returns to upper hop node by base station/member node.
Msg_Data: data message, is sent by cluster head/member node.The data volume that this message comprises collection.
Claims (4)
1. a group cluster method for wireless sensor network hierarchical routing, is characterized in that, comprises the following steps:
1) netinit
A, division level
Before WSNs system works, first take base station sink as the center of circle, the nR of take is divided into n layer by monitored area as radius, and wherein R is critical value, and n is greater than zero positive integer;
B, definite bunch territory
When sensor node is routed to behind monitored area at random, by GPS, obtain the coordinate information of each node, then the coordinate of sensor node and energy are sent to base station, by base station according to the quantity of the size of monitored area and sensor node the whole network carry out level and bunch division, set up level number and bunch number; Then determine bunch territory, bunch territory is the size of bunch, node number and the distributing position that stipulate when sensor network initialization sub-clustering base station; Then in each bunch, choose energy maximum, and two nearest nodes are as cluster head node and auxiliary node, if the primary power of node is all identical, choose at random two nearest nodes; Base station broadcasts to each node configuration information by the whole network subsequently; Because the first level is nearer apart from base station, base station is positioned at the 1st Ceng center, so there is no cluster head node in the 1st layer, all ordinary nodes all carry out direct communication with base station in the 1st layer;
Bunch territory can not change in the network operation afterwards, bunch be independently reconstituted in single bunch of territory and carry out, only change cluster head node and auxiliary node, and can not change a bunch territory;
C, determine every layer of number of clusters
Bunch territory is fan-shaped, wherein the quantity NumC in bunch territory of i layer
ifor:
X in formula
iwidth for i layer annulus after above-mentioned division level;
2) realization of transfer of data
The foundation in a, multi-hop transmission path
Between bunch, data communication relies on multi-hop transmission path to carry out, except the node of ground floor sends the data directly to base station, data communication between other high level and base station will be through the mode of multi-hop, by bridge node, data are delivered to base station according to high-rise multi-hop transmission path of jumping step by step toward the direction of low layer, bridge node is only served as by ordinary node, and cluster head node or auxiliary node do not participate in campaigning for bridge node;
B, bunch between the foundation of route
By the cluster head node at initiating terminal place, data communication multi-hop transmission path bunch first broadcast Msg_FindNext to lower one deck, the ordinary node of lower one deck is received after Msg_FindNext message, passback message Msg_ElectB give cluster head node above, the ID that Msg_ElectB message comprises ordinary node, dump energy and coordinate;
C, cluster head node calculate respectively with each and return information node apart from d and degree of getting close to, and degree of getting close to is the ratio of the distance D between residue energy of node PA and two nodes, chooses the node of degree of getting close to maximum as bridge node or first bridge node of the first jumping;
D, cluster head node send Msg_BeB message to be confirmed to the first bridge node, and has built in the first path of jumping;
E, the first bridge node continuation subsequently send Msg_FindNext to descending one deck again, and find next bridge node according to degree of getting close to;
By that analogy, until message is while arriving base station, by initial cluster head node, the multi-hop transmission path to base station is successfully established whole piece.
2. the group cluster method of a kind of wireless sensor network hierarchical routing according to claim 1, is characterized in that, described cluster head node is positioned at Cu Yu center.
3. the group cluster method of a kind of wireless sensor network hierarchical routing according to claim 1, it is characterized in that, auxiliary node for bunch restructuring realize, the election standard of auxiliary node is the member node with degree of the getting close to maximum of cluster head node, described in degree of getting close to be exactly that member node dump energy PA and this member node are to the ratio of the distance D of cluster head node; The function of auxiliary node is as follows:
A, auxiliary node do not carry out data acquisition;
B, in bunch when restructuring, it is cluster head node that auxiliary node is directly inherited, and according to the selection rule of auxiliary node, again chooses the auxiliary node of oneself;
C, auxiliary node are responsible for intercepting the working condition of cluster head node, once find the die by visitation of God of cluster head node, announce oneself to be new cluster head node, and replace former cluster head issue reconstruction information;
The reconstruction that has two kinds of situations need to carry out bunch: the die by visitation of God of cluster head and the energy of cluster head consume excessive;
Bunch process of reconstruction as follows:
First member node stops sending data to cluster head node after receiving Msg_CHDead, auxiliary node receives Msg_CHDead or learns when cluster head node is dead, local state is made as to cluster head node, then bunch in broadcast Msg_CReBulid, member node receives after Msg_CReBulid, the ID of the dead cluster head node in this locality is updated to former auxiliary node ID, then to new cluster head node, send Msg_ElectS message, the dump energy that Msg_ElectS comprises member node, coordinate and ID, new cluster head node can calculate the degree of getting close to each member node successively, the node of degree of getting close to maximum is elected as new auxiliary node,
After new auxiliary node is elected, just no longer carried out data acquisition; New cluster head node can be informed member node to complete bunch of broadcast Msg_OKBulid message subsequently, bunch reconstruction complete, can send data to normally new cluster head node; Bunch process of reconstruction in all message of transmitting, all with ANum and the CNum of active node, the ANum of described source node and CNum are respectively level and affiliated bunch numbers under source node, if bunch outer sensor node receives the different of ANum, CNum in message and this locality, these message are left in the basket, be left intact, the independent reconstruction so just having guaranteed bunch.
4. the group cluster method of a kind of wireless sensor network hierarchical routing according to claim 1, it is characterized in that, step 2) in the realization of transfer of data, for same transmission path, use after certain hour, some bridge nodes wherein there will be energy to consume too fast phenomenon, these bridging nodes must exit path to avoid node dead too early, need to adopt path to remedy implementation method: i.e. the energy consumption of certain bridge node in certain paths reaches a certain threshold value, need exit path, step is as follows:
(1) first certain bridge node sends the message Msg_QuitB of the ID that comprises down hop bridge node to the upper hop bridge node of oneself, and then this bridge node becomes ordinary node again;
(2) upper hop bridge node is according to claim 1 step 2) bunch between the method for building up of route, resend Msg_ReFindNext and search out down hop bridge node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110458685.0A CN102448138B (en) | 2011-12-31 | 2011-12-31 | Method for clustering hierarchical routing protocols of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110458685.0A CN102448138B (en) | 2011-12-31 | 2011-12-31 | Method for clustering hierarchical routing protocols of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102448138A CN102448138A (en) | 2012-05-09 |
| CN102448138B true CN102448138B (en) | 2014-04-09 |
Family
ID=46010092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110458685.0A Active CN102448138B (en) | 2011-12-31 | 2011-12-31 | Method for clustering hierarchical routing protocols of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102448138B (en) |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281746B (en) * | 2013-06-03 | 2016-01-20 | 南昌大学 | A kind of wireless sense network route method of quotient topology energy hierarchical Dynamic Programming |
| CN103491592B (en) * | 2013-10-16 | 2016-08-24 | 浙江中控技术股份有限公司 | Wireless mesh sensor network path construction method, device and gateway |
| CN103987100A (en) * | 2014-03-27 | 2014-08-13 | 南京邮电大学 | Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division |
| CN103874163A (en) * | 2014-04-02 | 2014-06-18 | 赵永翼 | Method for clustering wireless sensor network based on energy consumption balance |
| CN106304235A (en) * | 2016-08-22 | 2017-01-04 | 广东工业大学 | A kind of collaborative clustering routing communication means divided based on hierarchical region in WSN |
| CN107592371B (en) * | 2017-11-01 | 2018-09-25 | 广州供电局有限公司 | A kind of electric power construction field informationization supervision system based on wireless sensor network |
| CN109032218A (en) * | 2018-07-25 | 2018-12-18 | 深圳森阳环保材料科技有限公司 | Smart home environment control system |
| CN109032092A (en) * | 2018-08-02 | 2018-12-18 | 深圳智达机械技术有限公司 | Road traffic pollution object discharges wisdom and monitors system |
| CN108986391A (en) * | 2018-08-02 | 2018-12-11 | 深圳智达机械技术有限公司 | Long-distance intelligent auxiliary system on duty |
| CN108999517A (en) * | 2018-08-06 | 2018-12-14 | 深圳汇创联合自动化控制有限公司 | Smart home Ventilation conditioning system |
| CN110290535B (en) * | 2019-05-31 | 2022-05-17 | 杭州电子科技大学 | Wireless sensor network clustering routing protocol based on Dijkstra |
| CN111465075B (en) * | 2020-03-23 | 2023-07-14 | 南京晓庄学院 | Two-stage sensor network based on 5G communication |
| CN111479234B (en) * | 2020-03-23 | 2022-05-24 | 南京晓庄学院 | Temperature and humidity data processing sensor network |
| CN111669325B (en) * | 2020-06-09 | 2022-01-25 | 南京邮电大学 | Hybrid energy center cluster method based on energy supply |
| CN111726847B (en) * | 2020-06-17 | 2021-12-21 | 广域铭岛数字科技有限公司 | Improved grouping method of wireless sensor network based on node energy and density |
| CN112351467B (en) * | 2020-11-10 | 2022-09-02 | 江南大学 | Energy-saving building and transmission routing method for wireless heterogeneous communication network |
| CN112583666A (en) * | 2020-12-08 | 2021-03-30 | 广州技象科技有限公司 | Sensor network data transmission method, device, system and storage medium |
| CN113490250B (en) * | 2021-07-09 | 2022-05-06 | 中国人民解放军国防科技大学 | Routing protocol of multi-hop wireless sensor network for raw data acquisition |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN101420445A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Fast routing protocol of wireless sensor network |
| CN101715243A (en) * | 2009-10-21 | 2010-05-26 | 南京邮电大学 | Wireless sensor network hierarchical cluster-based routing method |
-
2011
- 2011-12-31 CN CN201110458685.0A patent/CN102448138B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101420445A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Fast routing protocol of wireless sensor network |
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN101715243A (en) * | 2009-10-21 | 2010-05-26 | 南京邮电大学 | Wireless sensor network hierarchical cluster-based routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102448138A (en) | 2012-05-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102448138B (en) | Method for clustering hierarchical routing protocols of wireless sensor network | |
| Liu | Atypical hierarchical routing protocols for wireless sensor networks: A review | |
| Pantazis et al. | Energy-efficient routing protocols in wireless sensor networks: A survey | |
| CN102625403B (en) | Method for generating and maintaining virtual backbone network in mobile adhoe networking | |
| CN107071811A (en) | A kind of fault-tolerant Uneven Cluster algorithms of WSN based on fuzzy control | |
| CN106792973B (en) | Cluster head election and rotation method in energy heterogeneous wireless sensor network | |
| Wajgi et al. | Load balancing based approach to improve lifetime of wireless sensor network | |
| CN106686659A (en) | AOMDV-based energy aware node-disjoint multipath routing algorithm | |
| CN107318142B (en) | Distributed routing method between a kind of wireless sense network cluster | |
| CN107404745A (en) | A kind of fire detector remote detecting system based on MANET | |
| CN107333314A (en) | A kind of wireless sense network cluster is built and its cluster head update method | |
| CN107360612A (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| CN101640944B (en) | Clustering and multi-hop communication method of wireless sensor | |
| CN102983948B (en) | A kind of radio sensing network self-adaption cluster transmission method and device thereof | |
| CN106358256B (en) | A kind of multirobot control coordinator's production method | |
| Chaudhary et al. | A Tutorial of routing protocols in wireless sensor networks | |
| CN101977159A (en) | Management method of bandwidth resources of narrow band network | |
| Leu et al. | Adaptive power-aware clustering and multicasting protocol for mobile ad hoc networks | |
| Prusty et al. | Energy aware optimized routing protocols for wireless ad hoc sensor network | |
| Dominguez et al. | Energy-efficient and location-aware ant colony based routing algorithms for wireless sensor networks | |
| Pantazis et al. | Energy-efficient routing protocols in wireless sensor networks for health communication systems | |
| Song et al. | Energy-efficient data gathering protocol in unequal clustered WSN utilizing fuzzy multiple criteria decision making | |
| Devasena et al. | A study of power and energy efficient clustering protocols in wireless sensor networks | |
| Selvakumar et al. | Contrast for QOS based clustered energy efficient protocol with PSO and multi-hop gateways in wireless sensor network | |
| Ouni et al. | A new energy-efficient neighbor discovery and load balancing protocol for mobile sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220531 Address after: 400065 Chongqing Nan'an District huangjuezhen pass Fort Park No. 1 Patentee after: Chongqing Xinke Communication Engineering Co.,Ltd. Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |
|
| TR01 | Transfer of patent right |