CN103987100A - Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division - Google Patents
Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division Download PDFInfo
- Publication number
- CN103987100A CN103987100A CN201410119444.7A CN201410119444A CN103987100A CN 103987100 A CN103987100 A CN 103987100A CN 201410119444 A CN201410119444 A CN 201410119444A CN 103987100 A CN103987100 A CN 103987100A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- leader cluster
- data
- cluster node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a sensor network energy-saving low energy adaptive clustering hierarchy improved algorithm based on region division. The sensor network energy-saving low energy adaptive clustering hierarchy improved algorithm is mainly used to solve the problem of limited energy with wireless sensor networks. By using the method provided in the invention, the energy utilization ratio of a wireless sensor network can be improved, the life cycle of the network can be improved, and at the same time, the defect of nonuniform low energy adaptive clustering hierarchy algorithm cluster header node distribution can be improved. The algorithm of the invention is an algorithm which can be used to realize the efficient network energy utilization and improve the low energy adaptive clustering hierarchy algorithm detect on the basis of the original low energy adaptive clustering hierarchy algorithm. The algorithm can be used to reduce the energy consumption of data in stages, such as data fusion, data transmission, etc., on the condition of limited energy of the wireless sensor network, and at the same time, the layout of the cluster header nodes in the network can be optimized, the energy utilization ratio can be further improved, and the lift time of the network can be prolonged. According to the invention, the structure of the wireless sensor network can be optimized and network energy reasonable and efficient utilization can be realized on the condition that both of data acquisition and data transmission can be realized correctly and effectively.
Description
Technical field
The present invention is that a kind of Sensor Network of dividing based on region is energy-conservation from getting (LEACH (Low Energy Adaptive Clustering Hierarchy), middle translated name is " from getting ") improve one's methods, be mainly used in solving energy of wireless sensor network utilance low, from the problem of getting the algorithm bunch even prolongation network life cycle of a skewness, belong to wireless sensor network research field.
Background technology
Wireless sensor network (Wireless Sensor Network, WSN) be by a large amount of cheap sensor nodes with data acquisition perception and computing capability by network communicating system that self-organizing forms, in the overlay area of network, can complete the monitoring task to complicated event.Along with the fast development of radio communication and microelectric technique, wireless sensor network shows application prospect widely in the traditional field such as industrial, agriculture, military with taking Smart Home, health care, urban transportation as the emerging field of representative.For wireless sensor network, it is one of core technology of wireless sensor network research that topology is controlled, it can generate good network topology structure automatically, can improve Routing Protocol and MAC (Multiple Access Control, MAC) efficiency of agreement, can be a lot of aspects such as data fusion, time synchronized and target localization and lay the foundation, be conducive to save the energy of node, thereby extend the life cycle of network.Topology control can be divided into power injection control and two aspects of hiberarchy topology tissue.The transmitting power of each node in power control mechanism regulating networks, is meeting under the prerequisite of network-in-dialing degree, reduces the transmitting power of node, neighbours' number that equalizing section point single-hop can reach.Hiberarchy topology tissue utilizes sub-clustering mechanism, allows some nodes as cluster head node, forms one process and the backbone network of forwarding data by cluster head node, and other non-backbone nodes can temporary close communication module, enters resting state to save energy.Organize cluster algorithm from getting algorithm as the most representative hiberarchy topology, the most of hiberarchy topology occurring thereafter organizes algorithm all to develop on its basis, so it is studied and improve the meaning with particular importance.A kind of low power consumption adaptive cluster algorithm from getting algorithm, its basic thought is to select bunch head by random rotation equiprobably, the energy load mean allocation of whole network is arrived to each sensor node, thereby reach the object that reduces network entirety energy consumption, extends network life cycle.Whole network is divided into several bunches by this algorithm, and each bunch is made up of 1 leader cluster node and some member node (bunch interior nodes), as shown in Figure 1.Be that from the main cause of getting algorithm conserve energy it has used data compression technique and dynamic clustering route technology, improve extensibility and the robustness of network by local associated working, reduce the data volume of transmission by data fusion, by the leader cluster node of being arranged to random node is reached to the object in network internal load balancing, prevent the too fast consumption of leader cluster node energy, extend the life cycle of network.
Periodically from the implementation of getting algorithm, every establishment stage that circulation is divided into bunch and stable data communication phase of taking turns.Bunch establishment stage, adjacent node Dynamic Terrain cluster, the random bunch head that produces, the node that becomes bunch head towards periphery node sends broadcast, other nodes select according to the intensity of the broadcast receiving that it will add bunch, and inform corresponding bunch of head.At stable data transfer phase, bunch interior nodes sends to a bunch head data, and bunch head carries out data fusion and result is sent to aggregation node.A bunch task burdensome, need to complete data fusion, also will communicate by letter with aggregation node, so energy consumption is larger.From bunch skewness getting algorithm and elect, and leader cluster node and bunch interior nodes phase specific energy consumption larger, reduced the life cycle of network.
Goal of the invention
Technical problem: the object of the invention is to propose a kind of divide based on region energy-conservation from getting improvement algorithm, reduce the energy consumption of network entirety, realize the load balancing of network node, extend the life cycle of network.Meanwhile, improvedly can make leader cluster node be evenly distributed in whole network from getting algorithm, ensure coverage and the life span of network.
Technical scheme: what the present invention proposed is a kind of strategy process, and the choice and application of cluster algorithm directly affects energy consumption and the network life cycle of whole network.Algorithm capacity usage ratio is low, the problem of bunch even prolongation network life cycle of a skewness from getting to be mainly used in solution.Improvedly from getting algorithm, whole region is divided into multiple regions, adopts static sub-clustering mode, utilize multi-hop to send data to base station BS (Base Station, BS), improve node energy validity with the consumption of saving leader cluster node energy.Specifically comprise step as follows:
Step 1) is established base station BS outside whole sensitive zones, and be positioned at distance whole sensitive zones position far away, the geographical location information of oneself is sent to BS by sensor node, BS receives after the positional information that each sensor node is sent in sensitive zones, calculates the distance mind of the own nearest node of region middle distance and apart from oneself distance maxd of node farthest according to these information; If whole region is divided into 2*k+1 part by BS, wherein k>0 and be integer, maxd-mind is divided into 2*k+1 section, the distance of each section is d=(maxd-mind)/(2*k+1), then taking BS as the center of circle, draw circle taking minr+d*n as radius, wherein n>=1 and n<=k, the sensor node being enclosed in same circle just belongs to same subregion; If k=1, whole region can be divided into three subregions, draw circle taking mind+d as radius, circle, as one-level bunch territory GID=1, is then drawn taking mind+2*d as radius again in the region of being got up by circle, circled next part deducts the part in one-level bunch territory, remaining part, as secondary bunch territory GID=2, is finally drawn circle taking mind+3*d as radius again, and circled next part deducts the part in secondary bunch territory, remaining subregion is as three grades of bunches of territory GID=3
Step 2) if all the sensors node primary power all equates in sensitive zones, need to elect the threshold T hresh of bunch head to be set to the probable value that becomes bunch head that regional pre-sets; The probability that becomes cluster head in secondary bunch territory is P, so the threshold T hresh that this region election becomes cluster head is just set to P; Node produces the random number between 0 to 1, if this number is less than P, this node is just chosen as a bunch head; If node primary power is unequal, need so election of cluster head and node energy to connect, the node that energy is relatively many becomes the probability of cluster head should be larger; In secondary bunch territory, applicating geometric relation, can draw the quantity of this bunch of territory interior nodes, supposing has n node in this secondary bunch territory, this Thresh value just should be set to E (i)/E (total) * nP so, and wherein E (i) is the current energy value of node i, and E (total) is the summation of all node energies in bunch territory, the probability that becomes in this case cluster head is P, and the desired value of this bunch of territory intra-cluster head number is nP; Similarly, node produces the random number between 0 to 1, if this number is less than threshold T hresh, is E (i)/E (total) * nP, and this node is just chosen as a bunch head; Election of cluster head out after, the ID of bunch head is recorded in the global variable region_center_list in oneself bunch territory, the region_center_list finally obtaining is exactly the list of all leader cluster node ID in this bunch of territory;
Step 3) is when leader cluster node is all after election out, and the leader cluster node message that notifies informs that other nodes oneself are new bunch heads; Receive after this message with the non-leader cluster node in region, select to add which bunch according to the distance between own and leader cluster node, when the non-leader cluster node in same region is selected oneself to add bunch after, leader cluster node to this bunch sends the message that adds this bunch, then leader cluster node needs to set up TDMA scheduling according to the number of bunch interior nodes, and this scheduling is sent to each bunch of interior nodes, in the time that bunch interior nodes sends data to leader cluster node, just must carry out data transmission according to this time scheduling, with avoid data send time produce conflict;
Step 4) is set up a bunch multihop path, makes data to be sent to BS in multi-hop mode, the energy consumption while having reduced transfer of data after a bunch fused data; In leader cluster node election, the node ID of electing leader cluster node as is recorded in region_center_list list, can obtain the ID list of all nodes in down hop bunch territory by the region_center_list list in bunch territory, this list is just equivalent to the candidate list of down hop; Utilize the mode of Stochastic Autonomous to determine the multihop path of leader cluster node, leader cluster node only need be selected at random the next-hop node of a node as oneself from these both candidate nodes, has so just set up the multihop path of each leader cluster node;
The task that step 5) is undertaken due to leader cluster node is than non-leader cluster node weight, so the energy consuming is many, so just easily causes leader cluster node depleted of energy and death; In order to keep network node balancing energy to distribute, adopt the method for Cycle-switching Cluster-head node; Adopt the method for static clustering, due to the division of having carried out in opening rotation bunch, take turns the cycle stage so later every and no longer repartition bunch, only need to upgrade leader cluster node; Except opening rotation, in cyclic process afterwards, incumbent leader cluster node carries out the selected of new leader cluster node according to the dump energy of bunch interior nodes, after selected new leader cluster node, incumbent leader cluster node is issued broadcast to all bunches of interior nodes, notify the ID of all bunches of current new leader cluster nodes of interior nodes, meanwhile, incumbent leader cluster node need oneself be set to non-leader cluster node, and own current leader cluster node is set to the ID of new leader cluster node; Bunch interior nodes receives after the broadcast that incumbent leader cluster node sends, the node ID value of the new leader cluster node in broadcast is compared with the ID of oneself, if equated, explanation is own will exist with the identity of bunch head in next round, if unequal, the ID in the broadcast that ID of the current leader cluster node of oneself is set to receive; The another one task of current leader cluster node is to re-establish a bunch time slot table for interior nodes transmission data, it is TDMA dispatch list, and be broadcast to a bunch interior nodes, in bunch, member node receives after this message, calculate the time that oneself sends data, just send data taking turns to oneself to send in data, otherwise enter sleep state to save energy;
Step 6) is taken turns in circulation leader cluster node has been carried out upgrading operation due to new one, in this bunch of territory, corresponding region_center_list list also can be upgraded thereupon, after again having established leader cluster node, new leader cluster node utilizes the method for Stochastic Autonomous, in region_center_list list from upgrading, select at random the next-hop node of a leader cluster node as oneself, thereby set up a new bunch multihop path, for the multi-hop transmission of realizing data provides condition;
Step 7) data multi-hop transmission is mainly divided into two processes, and the one, the data communication between bunch interior nodes and leader cluster node, the 2nd, the data communication in a bunch multihop path between bunch head, and data communication between last and BS; In first process, bunch interior nodes sends to leader cluster node by the data that collect in assigned timeslot, when in other time slots, bunch interior nodes is just in resting state, and close radio module, send data when again taking turns to while oneself sending data open wireless electricity module again to leader cluster node; The time interval stime=bunch of interior nodes number * node that bunch interior nodes sends between data to leader cluster node for twice sends data required time; In second process, after leader cluster node receives the data of all bunches of interior nodes, data are merged, then the data after merging are sent to the next-hop node of oneself, after next-hop node is received the data from upper hop, just the data fusion that the data that bunch interior nodes of oneself being received is sent and upper hop are sent, after completing, data fusion issues again the next-hop node of oneself, by that analogy until next-hop node is base station BS, the data that finally fusion obtained send to BS, complete the transmission of data.
Beneficial effect: the inventive method has proposed a kind of divide based on region energy-conservation from getting improvement algorithm, be mainly used in solving energy of wireless sensor network utilance low, from the problem of getting the algorithm bunch even prolongation network life cycle of a skewness, the method that the application of the invention proposes can reduce the energy consumption of network entirety, realize network node load balancing, a bunch head is evenly distributed in network, extend the life cycle of network, realized the efficient utilization of energy.Provide and illustrate below:
Can ensure that from getting algorithm each node serves as a bunch head equiprobably, make the node relative equilibrium ground consumed energy in network.Algorithm proposed by the invention is to obtaining from getting after algorithm is further studied and improved, and compares from getting algorithm, and energy efficiency has obtained further raising, and it is more even that leader cluster node also distributes.The mode of what the present invention adopted is static clustering is only carried out sub-clustering in opening rotation, in later circulation, only need to upgrade bunch head, do not need sub-clustering again again, than saving a part of overhead from getting algorithm, improve network energy utilance, for the life cycle that extends network has been made certain contribution.Simultaneously, the present invention utilizes multi-hop to realize the stable transfer of data, if on multihop path, in the time that prevariety head does not have upper hop node, in having collected bunch, this bunch of head just start fused data this point with identical from getting after all members' data, but next bunch head is not directly the data after merging to be sent to BS, but sends it to selected next-hop node.In addition, if there is upper hop, need to wait for after upper hop node is sent data and could start fused data, then continue the data after merging to send to the next-hop node of oneself, as shown in Figure 4.The multi-hop transmission of this data has been saved the energy of network to a certain extent.
Brief description of the drawings
Fig. 1 is that white point is a bunch interior nodes from getting algorithm sub-clustering schematic diagram, and black color dots is leader cluster node,
Fig. 2 is that schematic diagram is divided in region, and the coordinate of base station BS is (50,175),
Fig. 3 is the method for calculating probability schematic diagram that becomes cluster head in each bunch of territory,
Fig. 4 is a bunch multihop path schematic diagram.
Embodiment
The present invention is a kind of divide based on region energy-conservation from getting improvement algorithm, mainly improve the utilance of network energy by the method for sensitive zones division, static clustering and data multi-hop transmission, realize leader cluster node being uniformly distributed in network, extend the life cycle of network.
Step 1) supposes that base station BS is outside whole sensitive zones, and is positioned at distance whole sensitive zones position far away.The geographical location information of oneself is sent to BS by sensor node, BS receives after the positional information that each sensor node is sent in sensitive zones, calculates the distance mind of the own nearest node of region middle distance and apart from oneself distance maxd of node farthest according to these information.Suppose that whole region is divided into 2*k+1 part by BS, wherein k>0 and be integer, is divided into maxd-mind 2*k+1 section, and the distance of each section is d=(maxd-mind)/(2*k+1).Then taking BS as the center of circle, draw circle taking minr+d*n as radius, wherein n>=1 and n<=k, the sensor node being enclosed in same circle just belongs to same subregion.Suppose k=1, whole region can be divided into three subregions, draw circle taking mind+d as radius, the region of being got up by circle is as one-level bunch territory (GID=1), then draw again circle taking mind+2*d as radius, circled next part deducts the part in one-level bunch territory, remaining part is as secondary bunch territory (GID=2), finally draw again circle taking mind+3*d as radius, circled next part deducts the part in secondary bunch territory, remaining subregion is as three grades of bunches of territories (GID=3), as shown in Figure 2.
Step 2) improved from getting algorithm election of cluster head method with basic identical from getting algorithm.If all the sensors node primary power all equates in sensitive zones, need to elect the threshold T hresh of bunch head to be set to the probable value that becomes bunch head that regional pre-sets, as shown in Figure 3.Taking secondary bunch territory as example, the probability of supposing to become cluster head in secondary bunch territory is P, so the threshold T hresh that this region election becomes cluster head is just set to P.Node produces the random number between 0 to 1, if this number is less than P, this node is just chosen as a bunch head.If node primary power is unequal, need so election of cluster head and node energy to connect, the node that energy is relatively many becomes the probability of cluster head should be larger.Taking secondary bunch territory as example, applicating geometric relation, can draw the quantity of this bunch of territory interior nodes, supposing has n node in this secondary bunch territory, this Thresh value just should be set to E (i)/E (total) * nP so, and wherein E (i) is the current energy value of node i, and E (total) is the summation of all node energies in bunch territory, the probability that becomes in this case cluster head is P, and the desired value of this bunch of territory intra-cluster head number is nP.Similarly, node produces the random number between 0 to 1, if this number is less than threshold T hresh, is E (i)/E (total) * nP, and this node is just chosen as a bunch head.Election of cluster head out after, the ID of bunch head is recorded in the global variable region_center_list in oneself bunch territory, the region_center_list finally obtaining is exactly the list of all leader cluster node ID in this bunch of territory.
Step 3) is when leader cluster node is all after election out, and the leader cluster node message that notifies informs that other nodes oneself are new bunch heads.Receive after this message with the non-leader cluster node in region, select to add which bunch according to the distance between own and leader cluster node.When the non-leader cluster node in same region is selected oneself to add bunch after, send to the leader cluster node of this bunch the message that adds this bunch, then leader cluster node needs set up TDMA scheduling according to the number of bunch interior nodes, and this scheduling is sent to each bunch of interior nodes.When bunch interior nodes sends when data to leader cluster node, just must carry out data transmission according to this time scheduling, produce when avoiding data to send and conflict.
The main purpose that step 4) is set up a bunch multihop path is to make data to be sent to BS in multi-hop mode, the energy consumption while having reduced transfer of data after a bunch fused data.In leader cluster node election, the node ID of electing leader cluster node as is recorded in region_center_list list, can obtain the ID list of all nodes in down hop bunch territory by the region_center_list list in bunch territory, this list is just equivalent to the candidate list of down hop.Utilize the mode of Stochastic Autonomous to determine the multihop path of leader cluster node, leader cluster node only need be selected at random the next-hop node of a node as oneself from these both candidate nodes, has so just set up the multihop path of each leader cluster node, as shown in Figure 4.
The task that step 5) is undertaken due to leader cluster node is than non-leader cluster node weight, so the energy consuming is many, so just easily causes leader cluster node depleted of energy and death.In order to keep network node balancing energy to distribute, so adopt the method for Cycle-switching Cluster-head node.Adopt the method for static clustering, due to the division of having carried out in opening rotation bunch, take turns the cycle stage so later every and no longer repartition bunch, only need to upgrade leader cluster node.Except opening rotation, in cyclic process afterwards, incumbent leader cluster node carries out the selected of new leader cluster node according to the dump energy of bunch interior nodes.After selected new leader cluster node, incumbent leader cluster node is issued broadcast to all bunches of interior nodes, notify the ID of all bunches of current new leader cluster nodes of interior nodes, simultaneously, incumbent leader cluster node need oneself be set to non-leader cluster node, and own current leader cluster node is set to the ID of new leader cluster node.Bunch interior nodes receives after the broadcast that incumbent leader cluster node sends, the node ID value of the new leader cluster node in broadcast is compared with the ID of oneself, if equated, explanation is own will exist with the identity of bunch head in next round, if unequal, the ID in the broadcast that ID of the current leader cluster node of oneself is set to receive.The another one task of current leader cluster node is to re-establish a bunch time slot table for interior nodes transmission data, it is TDMA dispatch list, and be broadcast to a bunch interior nodes, in bunch, member node receives after this message, calculate the time that oneself sends data, just send data taking turns to oneself to send in data, otherwise enter sleep state to save energy.
Step 6) is taken turns in circulation leader cluster node has been carried out upgrading operation due to new one, so corresponding region_center_list list also can be upgraded in this bunch of territory thereupon, after again having established leader cluster node, new leader cluster node utilizes the method for Stochastic Autonomous, in region_center_list list from upgrading, select at random the next-hop node of a leader cluster node as oneself, thereby set up a new bunch multihop path, for the multi-hop transmission of realizing data provides condition.
Step 7) data multi-hop transmission is mainly divided into two processes, and the one, the data communication between bunch interior nodes and leader cluster node, the 2nd, the data communication in a bunch multihop path between bunch head, and data communication between last and BS.In first process, bunch interior nodes sends to leader cluster node by the data that collect in assigned timeslot, when in other time slots, bunch interior nodes is just in resting state, and close radio module, send data when again taking turns to while oneself sending data open wireless electricity module again to leader cluster node.The time interval stime=bunch of interior nodes number * node that bunch interior nodes sends between data to leader cluster node for twice sends data required time.In second process, after leader cluster node receives the data of all bunches of interior nodes, data are merged, then the data after merging are sent to the next-hop node of oneself, after next-hop node is received the data from upper hop, just the data fusion that the data that bunch interior nodes of oneself being received is sent and upper hop are sent, after completing, data fusion issues again the next-hop node of oneself, by that analogy until next-hop node is base station BS, the data that finally fusion obtained send to BS, complete the transmission of data.
Claims (1)
1. a Sensor Network of dividing based on region is energy-conservationly improved one's methods from getting, and it is characterized in that the method specifically comprises following steps:
Step 1) is established base station BS outside whole sensitive zones, and be positioned at distance whole sensitive zones position far away, the geographical location information of oneself is sent to BS by sensor node, BS receives after the positional information that each sensor node is sent in sensitive zones, calculates the distance mind of the own nearest node of region middle distance and apart from oneself distance maxd of node farthest according to these information; If whole region is divided into 2*k+1 part by BS, wherein k>0 and be integer, maxd-mind is divided into 2*k+1 section, the distance of each section is d=(maxd-mind)/(2*k+1), then taking BS as the center of circle, draw circle taking minr+d*n as radius, wherein n>=1 and n<=k, the sensor node being enclosed in same circle just belongs to same subregion; If k=1, whole region can be divided into three subregions, draw circle taking mind+d as radius, circle, as one-level bunch territory GID=1, is then drawn taking mind+2*d as radius again in the region of being got up by circle, circled next part deducts the part in one-level bunch territory, remaining part, as secondary bunch territory GID=2, is finally drawn circle taking mind+3*d as radius again, and circled next part deducts the part in secondary bunch territory, remaining subregion is as three grades of bunches of territory GID=3
Step 2) if all the sensors node primary power all equates in sensitive zones, need to elect the threshold T hresh of bunch head to be set to the probable value that becomes bunch head that regional pre-sets; The probability that becomes cluster head in secondary bunch territory is P, so the threshold T hresh that this region election becomes cluster head is just set to P; Node produces the random number between 0 to 1, if this number is less than P, this node is just chosen as a bunch head; If node primary power is unequal, need so election of cluster head and node energy to connect, the node that energy is relatively many becomes the probability of cluster head should be larger; In secondary bunch territory, applicating geometric relation, can draw the quantity of this bunch of territory interior nodes, supposing has n node in this secondary bunch territory, this Thresh value just should be set to E (i)/E (total) * nP so, and wherein E (i) is the current energy value of node i, and E (total) is the summation of all node energies in bunch territory, the probability that becomes in this case cluster head is P, and the desired value of this bunch of territory intra-cluster head number is nP; Similarly, node produces the random number between 0 to 1, if this number is less than threshold T hresh, is E (i)/E (total) * nP, and this node is just chosen as a bunch head; Election of cluster head out after, the ID of bunch head is recorded in the global variable region_center_list in oneself bunch territory, the region_center_list finally obtaining is exactly the list of all leader cluster node ID in this bunch of territory;
Step 3) is when leader cluster node is all after election out, and the leader cluster node message that notifies informs that other nodes oneself are new bunch heads; Receive after this message with the non-leader cluster node in region, select to add which bunch according to the distance between own and leader cluster node, when the non-leader cluster node in same region is selected oneself to add bunch after, leader cluster node to this bunch sends the message that adds this bunch, then leader cluster node needs to set up TDMA scheduling according to the number of bunch interior nodes, and this scheduling is sent to each bunch of interior nodes, in the time that bunch interior nodes sends data to leader cluster node, just must carry out data transmission according to this time scheduling, with avoid data send time produce conflict;
Step 4) is set up a bunch multihop path, makes data to be sent to BS in multi-hop mode, the energy consumption while having reduced transfer of data after a bunch fused data; In leader cluster node election, the node ID of electing leader cluster node as is recorded in region_center_list list, can obtain the ID list of all nodes in down hop bunch territory by the region_center_list list in bunch territory, this list is just equivalent to the candidate list of down hop; Utilize the mode of Stochastic Autonomous to determine the multihop path of leader cluster node, leader cluster node only need be selected at random the next-hop node of a node as oneself from these both candidate nodes, has so just set up the multihop path of each leader cluster node;
The task that step 5) is undertaken due to leader cluster node is than non-leader cluster node weight, so the energy consuming is many, so just easily causes leader cluster node depleted of energy and death; In order to keep network node balancing energy to distribute, adopt the method for Cycle-switching Cluster-head node; Adopt the method for static clustering, due to the division of having carried out in opening rotation bunch, take turns the cycle stage so later every and no longer repartition bunch, only need to upgrade leader cluster node; Except opening rotation, in cyclic process afterwards, incumbent leader cluster node carries out the selected of new leader cluster node according to the dump energy of bunch interior nodes, after selected new leader cluster node, incumbent leader cluster node is issued broadcast to all bunches of interior nodes, notify the ID of all bunches of current new leader cluster nodes of interior nodes, meanwhile, incumbent leader cluster node need oneself be set to non-leader cluster node, and own current leader cluster node is set to the ID of new leader cluster node; Bunch interior nodes receives after the broadcast that incumbent leader cluster node sends, the node ID value of the new leader cluster node in broadcast is compared with the ID of oneself, if equated, explanation is own will exist with the identity of bunch head in next round, if unequal, the ID in the broadcast that ID of the current leader cluster node of oneself is set to receive; The another one task of current leader cluster node is to re-establish a bunch time slot table for interior nodes transmission data, it is TDMA dispatch list, and be broadcast to a bunch interior nodes, in bunch, member node receives after this message, calculate the time that oneself sends data, just send data taking turns to oneself to send in data, otherwise enter sleep state to save energy;
Step 6) is taken turns in circulation leader cluster node has been carried out upgrading operation due to new one, in this bunch of territory, corresponding region_center_list list also can be upgraded thereupon, after again having established leader cluster node, new leader cluster node utilizes the method for Stochastic Autonomous, in region_center_list list from upgrading, select at random the next-hop node of a leader cluster node as oneself, thereby set up a new bunch multihop path, for the multi-hop transmission of realizing data provides condition;
Step 7) data multi-hop transmission is mainly divided into two processes, and the one, the data communication between bunch interior nodes and leader cluster node, the 2nd, the data communication in a bunch multihop path between bunch head, and data communication between last and BS; In first process, bunch interior nodes sends to leader cluster node by the data that collect in assigned timeslot, when in other time slots, bunch interior nodes is just in resting state, and close radio module, send data when again taking turns to while oneself sending data open wireless electricity module again to leader cluster node; The time interval stime=bunch of interior nodes number * node that bunch interior nodes sends between data to leader cluster node for twice sends data required time; In second process, after leader cluster node receives the data of all bunches of interior nodes, data are merged, then the data after merging are sent to the next-hop node of oneself, after next-hop node is received the data from upper hop, just the data fusion that the data that bunch interior nodes of oneself being received is sent and upper hop are sent, after completing, data fusion issues again the next-hop node of oneself, by that analogy until next-hop node is base station BS, the data that finally fusion obtained send to BS, complete the transmission of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410119444.7A CN103987100A (en) | 2014-03-27 | 2014-03-27 | Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410119444.7A CN103987100A (en) | 2014-03-27 | 2014-03-27 | Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103987100A true CN103987100A (en) | 2014-08-13 |
Family
ID=51278896
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410119444.7A Pending CN103987100A (en) | 2014-03-27 | 2014-03-27 | Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103987100A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104202787A (en) * | 2014-09-10 | 2014-12-10 | 西安电子科技大学 | Optimum redundancy based adaptive wireless sensor network routing method |
| CN104780583A (en) * | 2015-04-17 | 2015-07-15 | 长春理工大学 | Hierarchical clustering algorithm on basis of energy consumption of path and residual energy of nodes |
| CN104883691A (en) * | 2015-05-12 | 2015-09-02 | 祝敏 | Self-adaptive dynamic subnet dividing method in wireless sensor network |
| CN105050080A (en) * | 2015-08-07 | 2015-11-11 | 河南理工大学 | Adaptive control method for node transmitting power in source position privacy protection protocol |
| CN106102075A (en) * | 2016-08-25 | 2016-11-09 | 广东工业大学 | The cluster-dividing method divided based on hierarchical region in radio sensing network and system |
| CN110972230A (en) * | 2019-12-23 | 2020-04-07 | 杭州电子科技大学 | Method for LEACH two-stage clustering routing protocol based on cuckoo algorithm |
| CN113596858A (en) * | 2021-09-30 | 2021-11-02 | 南昌师范学院 | Clustering method and device for wireless sensor network |
| CN116358759A (en) * | 2023-05-25 | 2023-06-30 | 曲阜恒威水工机械有限公司 | Chain tensioning detecting system based on digital twin technology |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854666A (en) * | 2010-04-27 | 2010-10-06 | 南京工业大学 | Customized trans-regional and multi-hop routing method for wireless sensor network |
| CN101917750A (en) * | 2010-07-30 | 2010-12-15 | 南京工业大学 | Least effort delivering zone-spanned virtual cluster multi-hop routing method |
| CN102448138A (en) * | 2011-12-31 | 2012-05-09 | 重庆邮电大学 | Method for clustering hierarchical routing protocols of wireless sensor network |
| CN102497679A (en) * | 2011-12-20 | 2012-06-13 | 山东大学 | Static clustering algorithm for wireless sensor network |
| CN103281769A (en) * | 2013-06-27 | 2013-09-04 | 重庆大学 | Energy consumption balancing method of isomerism wireless sensor network unequal clustering |
| US20140079297A1 (en) * | 2012-09-17 | 2014-03-20 | Saied Tadayon | Application of Z-Webs and Z-factors to Analytics, Search Engine, Learning, Recognition, Natural Language, and Other Utilities |
-
2014
- 2014-03-27 CN CN201410119444.7A patent/CN103987100A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854666A (en) * | 2010-04-27 | 2010-10-06 | 南京工业大学 | Customized trans-regional and multi-hop routing method for wireless sensor network |
| CN101917750A (en) * | 2010-07-30 | 2010-12-15 | 南京工业大学 | Least effort delivering zone-spanned virtual cluster multi-hop routing method |
| CN102497679A (en) * | 2011-12-20 | 2012-06-13 | 山东大学 | Static clustering algorithm for wireless sensor network |
| CN102448138A (en) * | 2011-12-31 | 2012-05-09 | 重庆邮电大学 | Method for clustering hierarchical routing protocols of wireless sensor network |
| US20140079297A1 (en) * | 2012-09-17 | 2014-03-20 | Saied Tadayon | Application of Z-Webs and Z-factors to Analytics, Search Engine, Learning, Recognition, Natural Language, and Other Utilities |
| CN103281769A (en) * | 2013-06-27 | 2013-09-04 | 重庆大学 | Energy consumption balancing method of isomerism wireless sensor network unequal clustering |
Non-Patent Citations (1)
| Title |
|---|
| 王淑华: "基于地理位置的无线传感器网络路由算法", 《中国优秀硕士学位论文全文数据库信息科技辑（月刊 ）》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104202787A (en) * | 2014-09-10 | 2014-12-10 | 西安电子科技大学 | Optimum redundancy based adaptive wireless sensor network routing method |
| CN104780583A (en) * | 2015-04-17 | 2015-07-15 | 长春理工大学 | Hierarchical clustering algorithm on basis of energy consumption of path and residual energy of nodes |
| CN104780583B (en) * | 2015-04-17 | 2018-06-01 | 长春理工大学 | Multilayer cluster algorithm based on path energy consumption and residue energy of node |
| CN104883691B (en) * | 2015-05-12 | 2018-03-30 | 祝敏 | Adaptive dynamic sub-network division method in wireless sensor network |
| CN104883691A (en) * | 2015-05-12 | 2015-09-02 | 祝敏 | Self-adaptive dynamic subnet dividing method in wireless sensor network |
| CN105050080A (en) * | 2015-08-07 | 2015-11-11 | 河南理工大学 | Adaptive control method for node transmitting power in source position privacy protection protocol |
| CN105050080B (en) * | 2015-08-07 | 2018-11-16 | 河南理工大学 | One seed position secret protection agreement interior joint transmission power adaptation control method |
| CN106102075A (en) * | 2016-08-25 | 2016-11-09 | 广东工业大学 | The cluster-dividing method divided based on hierarchical region in radio sensing network and system |
| CN106102075B (en) * | 2016-08-25 | 2019-07-09 | 广东工业大学 | Cluster-dividing method and system based on hierarchical region division in wireless sensor network |
| CN110972230A (en) * | 2019-12-23 | 2020-04-07 | 杭州电子科技大学 | Method for LEACH two-stage clustering routing protocol based on cuckoo algorithm |
| CN113596858A (en) * | 2021-09-30 | 2021-11-02 | 南昌师范学院 | Clustering method and device for wireless sensor network |
| CN113596858B (en) * | 2021-09-30 | 2021-12-03 | 南昌师范学院 | Clustering method and device for wireless sensor network |
| CN116358759A (en) * | 2023-05-25 | 2023-06-30 | 曲阜恒威水工机械有限公司 | Chain tensioning detecting system based on digital twin technology |
| CN116358759B (en) * | 2023-05-25 | 2023-09-29 | 曲阜恒威水工机械有限公司 | Chain tensioning detecting system based on digital twin technology |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103987100A (en) | Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division | |
| Arjunan et al. | A survey on unequal clustering protocols in wireless sensor networks | |
| Sabet et al. | An energy efficient multi-level route-aware clustering algorithm for wireless sensor networks: A self-organized approach | |
| Gupta et al. | An improved energy aware distributed unequal clustering protocol for heterogeneous wireless sensor networks | |
| Kumarawadu et al. | Algorithms for node clustering in wireless sensor networks: A survey | |
| Wei et al. | Cluster-based routing protocols in wireless sensor networks: a survey | |
| CN102395173B (en) | Clustering method for efficiently utilizing energy in perception layer of environment monitoring internet of things | |
| Prabhu et al. | A research on decentralized clustering algorithms for dense wireless sensor networks | |
| Nguyen et al. | An adaptive MAC protocol for RF energy harvesting wireless sensor networks | |
| CN103298054A (en) | Wireless sensor network cluster routing protocol based on node depth | |
| CN104486715A (en) | Mobile sensor network clustering method based on geographical position information | |
| CN103298032A (en) | Node energy consumption balancing method for wireless sensor network | |
| CN101489275A (en) | Relay wireless sensor network routing method based on energy balance and distance cooperation | |
| Choudhury et al. | Beacon synchronization and duty-cycling in IEEE 802.15. 4 cluster-tree networks: A review | |
| CN105323818A (en) | Energy-saving clustering routing method based on network regional division and distances | |
| CN103415018A (en) | Communication resource allocation method of wireless sensor network | |
| CN102497679A (en) | Static clustering algorithm for wireless sensor network | |
| CN104159258A (en) | Communication node state adjusting method, apparatus and system | |
| CN103957570A (en) | Network communication system used for power load control and routing algorithm thereof | |
| CN102595550A (en) | Self-adaptive wireless sensor network routing method based on cross-layer optimization | |
| CN101801113B (en) | Network topology cluster processing method and processing system | |
| CN103338459A (en) | Wireless sensor network coverage maintaining method | |
| Hu et al. | An energy-efficient overlapping clustering protocol in WSNs | |
| Liu et al. | An improved energy efficient unequal clustering algorithm of wireless sensor network | |
| CN105072673B (en) | A kind of energy-efficient node scheduling method based on multichannel TDMA |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140813 |
|
| WD01 | Invention patent application deemed withdrawn after publication |