CN103501510B - The load-balancing method of reconstruct clusters in a kind of wireless sensor network - Google Patents
The load-balancing method of reconstruct clusters in a kind of wireless sensor network Download PDFInfo
- Publication number
- CN103501510B CN103501510B CN201310449615.8A CN201310449615A CN103501510B CN 103501510 B CN103501510 B CN 103501510B CN 201310449615 A CN201310449615 A CN 201310449615A CN 103501510 B CN103501510 B CN 103501510B
- Authority
- CN
- China
- Prior art keywords
- bunch
- node
- head
- reconstruct
- load
- 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.)
- Expired - Fee Related
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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to cluster in a kind of wireless sensor network load-balancing method of reconstruct, is characterized in that comprising the steps: wireless sensor network node set is divided into multiple subclass; The load-balancing method of the reconstruct that clusters is divided into stable state and two stages of reconstruct; In steady-state process, initialize wheel number, bunch head, message count, when front-wheel is accepted initial data and message count; Take turns random establishment bunch head set in the 1st of reconstruction stage; Take turns in all the other of reconstruction stage, according to bunch in the condition such as bunch head and nodes, the node of selecting maximum dump energies from node subset is bunch head; Or according to when the satisfied condition of prevariety head, or broadcast, or mark accepts message count, reselects a bunch head; Use the criterion of balance factor as load balancing, carry out the energy consumption in equalization network and reduce traffic congestion. The present invention improves the system step of reconstruct, has realized the load balance to each bunch of region, the feature that has the energy consumption in equalization network and reduce traffic congestion, extend network lifecycle.
Description
Technical field:
The present invention relates to cluster in a kind of wireless sensor network load-balancing method of reconstruct, belongs to wireless sensor networkDesign applied technical field.
Background technology:
The develop rapidly of the technology such as microelectric technique, embedded computing technique and radio communication and increasingly mature, promotesThe fast development of low-power consumption, Multifunction Sensor technology, make it to there is integrated information in the sensor node of micro volumeThe functions such as collection, data processing and radio communication. Be deployed in a large amount of microsensor nodes of sensing region, for sense synergisticallyKnow, process and transmit the data that collect, by the ad hoc wireless communication mode of multi-hop, finally forming a wireless senserNetwork, referred to as sensor network. At present, sensor network is just being widely used in that migration of birds, colliery are excavated, sea is surveyed deeplyThe various fields such as amount, have broad application prospects.
The feature of sensor network is that sensor node resource is subject to some restriction, such as Power supply is limited, calculates, leads toLetter limited ability. Meanwhile, the data of sensor network have the features such as continuous, uncertain. For this reason, people furtherd investigate withSensor network resource centered by data and task management technology, comprise resource distribution, task distribution, task scheduling etc. ThisA little research has obtained many valuable achievements, but still has many problems not solve: the first, and how by abstract Task-decomposingFor some subtask sequences that formed by basic task, and realize the load balancing of each basic task; The second, existing taskManagement method, between the node that task management is caused, energy distribution inequality is considered not enough, need to implement effective task pipeWhen reason, realize distributing rationally network energy resource; The 3rd, only consider known static environment, can not adapt to and moneyThe real-time application demand of source and task management, result is can not be according to the dynamic change of the task property of regulating networks adaptivelyEnergy.
The load balancing of sensor network is come in equalization network by the task amount and the data traffic that regulate each nodeEnergy consumes, and reduces traffic congestion, finally extends lifetime of system. Restructing algorithm is used for prolong network lifetime, is divided into twoClass, voluntarily reconstruct and pressure reconstruct. On the one hand, reconstruct adopts a distribution function or neighbor node table to determine a bunch head voluntarily,Carry out cluster head random-selection according to the selected random number of each node and a distribution function. The dump energy of node for existing methodDetermine dependent thresholds, to become the possibility of bunch head large for the more node of dump energy like this, reached prolong network lifetimeObject. By maintaining adjacent table, meet specified criteria (as minimum node mark, maximum neighbor node number or maximum residual energyAmount) node become a bunch head. But a bunch position or distribution can not become the factor that affects reconstruct, above-mentioned voluntary reconstructing methodCause a bunch head distribution mistake, and in each reconstruct, a bunch number all can change, the energy consumption of the network that makes to cluster is high, so undesirable.On the other hand, force in reconstruct, when the dump energy of bunch head is less than above-mentioned threshold value, the node that dump energy is maximum can be selected as downCluster head. When a bunch aggregation data are in place bunch time, can obtain the information of dump energy, i.e. the information of each nodeBe added in packet and be sent to a bunch head. In a lot of situations, a bunch number is constant in restructuring procedure, if a bunch number standardReally, force reconstruct more can save energy than voluntary reconstruct. But same problem also appears in balance node number, because bunchThe distribution of head can not become the decisive factor of reconstruct. These strategies are all, from single aspect, problem of load balancing is discussed above, because ofThis need to design and simplify, independently the method for suitable change, Fast Convergent realizes distributing rationally network energy resource.
Summary of the invention:
In order to overcome the deficiencies in the prior art, the object of the present invention is to provide in a kind of wireless sensor network and cluster heavilyThe load-balancing method of structure, is divided into stable state and two stages of reconstruct task management, has set up excellent to network energy resourceChange configuration, the system step of reconstruct is improved, realized the load balance to each bunch of region, there is equalization networkInterior energy consumption the feature that reduces traffic congestion, extends network lifecycle.
The present invention realizes above-mentioned purpose by following technical solution.
Cluster in a kind of wireless sensor network provided by the invention load-balancing method of reconstruct, comprises the steps:
(1) wireless sensor network node set is divided into multiple subclass, by a node in single-hop transmission distanceBe called isolated probability from the interior probability that there is no bunch head, the cycle that many frames are formed is called wheel;
(2) load-balancing method of the reconstruct that clusters is divided into two stages of stable state and reconstruct;
(3), in steady-state process, initialize wheel number, bunch head, message count, when front-wheel is accepted initial data and message count;
(4), in reconstruction stage, the 1st takes turns random establishment bunch head set;
(5) take turns in all the other of reconstruction stage, according to bunch in bunch head and nodes can meet dependent thresholds condition, from nodeThe node of selecting maximum dump energies in subset is bunch head;
(6) take turns in all the other of reconstruction stage, according to when the satisfied condition of prevariety head, or broadcast, or markAccept message count, reselect a bunch head;
(7) use the criterion of balance factor as load balancing, come energy consumption minimizing in equalization networkTraffic congestion.
In described step (1), wireless sensor network node set is divided into multiple subclass; Each subset is collectively referred to asBe one bunch, and possess a bunch of head; Be responsible for overall route by leader cluster node for each bunch, other node is accepted data from a bunch headOr by bunch hair data;
In described step (2), by the load-balancing method of the reconstruct that clusters, be divided into two stages of stable state and reconstruct;
Wherein, take turns the cycle for comprising steady-state process and reconstruction stage;
Steady-state process is divided into many frames, and all nodes of each frame transmit initial data in bunch head separately;
Isolated probability is the probability that in single hop environment, node does not have bunch head in transmission range; Message count is all jointsPoint is received after message, the message number in a node transmission range of writing down;
In described step (3), in steady-state process, initialize wheel number, bunch head, message count, when front-wheel accept initial data andMessage count;
In steady-state process, the node in i bunch sends initial data and (comprises message countIndex letter with dump energyBreath) to a bunch vi(m) in, go; By the polymerization of node data, vi(m) can obtain the node n in its place bunchi(m); Create jointPoint subset is vi(m) its place bunch in create node set, be designated as Qi(m)；
If 1. message count can be acceptedGrafting node is to element subsetAnd undated parameter;
If 2. message count is unacceptableThe task transfers of non-leader cluster node in node is arrived to bunch cephalomerePoint, and transmission is containing message countArrive bunch head with dump energy in interior initial data, all bunch heads form new message source jointPoint set;
In described step (4), in reconstruction stage, the 1st takes turns random establishment bunch head set;
If m=1, creates bunch head set V (m) randomly;
In the reconstruction stage of next round, determine a new bunch head set V (m+1); By message as ni(m)、WithThe dump energy of node, at each vi(m) bunch in select a suitable node as a bunch vi(m＋1)；
In described step (5), take turns in all the other of reconstruction stage, according to bunch in bunch head and nodes can meet dependent thresholdsCondition, the node of selecting maximum dump energies from node subset is bunch head;
In described step (6), take turns in all the other of reconstruction stage, according to when the satisfied condition of prevariety head, or broadcast disappearsBreath, or mark is accepted to reselect a bunch head after message count;
In described step (7), use the criterion of balance factor as load balancing, carry out the energy in equalization networkConsume and reduce traffic congestion;
In order to measure the effect of different branch load equilibriums on a routing tree, be used as load with Chebyshev inequalityBalanced criterion.
The present invention compared with prior art, has following beneficial effect:
1, the present invention is owing to being divided into multiple subclass to wireless senser, after clustering, do respectively that isolated probability is processed andWheel is processed, and task management is divided into stable state and two stages of reconstruct, has therefore realized the optimization of network energy resource is joinedPut.
2, the present invention is because the system step to reconstruct is improved, and adopts nodes in one bunch and at nodeThese two indexs of a bunch number in transmission range are selected lower cluster head, accept message count by broadcast or mark, byCreate node subset and be reconstructed management, therefore realized the load balance to each bunch of region.
3, the present invention, owing to completing after the load balance clustering, adopts again balance factor to carry out the energy in equalization networkConsume and reduce traffic congestion, therefore having extended network lifecycle.
Brief description of the drawings:
Fig. 1: be an of the present invention bunch of operation chart.
Fig. 2: be steady-state process schematic flow sheet of the present invention.
Fig. 3: be reconstruction stage schematic flow sheet of the present invention.
Fig. 4: be node reconstruct schematic diagram of the present invention.
Detailed description of the invention:
Below in conjunction with drawings and Examples, the invention will be further described.
Cluster in a kind of wireless sensor network provided by the invention load-balancing method of reconstruct, comprises the steps:
(1) wireless sensor network node set is divided into multiple subclass;
Wireless sensor network node set is divided into multiple subclass; A node is not had in transmission rangeThe probability of bunch head is called isolated probability, and the cycle that many frames are formed is called wheel;
Each subclass is called one bunch and be equipped with a bunch of head; Be responsible for overall route by leader cluster node for each bunch, all the otherNode is accepted data or is gone out data by a bunch hair from a bunch head; Bunch head is than the more energy of general node consumption, so bunch headNeed in node, take turns to transfer and prevent depleted of energy; The wheel of bunch head turns needs reconstruct, the distribution of the energy consumption of the network that clusters and bunch headBe closely related, so reconstruct is very important for prolong network lifetime; The equiblibrium mass distribution of bunch head, the node in can each bunch of balanceAnd be uniformly distributed the energy consumption of bunch head, thereby prolong network lifetime;
Suppose that N node is evenly distributed in the region of a L × L, maximum transmission distance is R, the node of i bunch headNumber is ni，n1+n2+n3+…+nk=N, k is a bunch number. In monitoring and data aggregate application, suppose that all nodes are identicalPeriod produces identical data volume, niCan be deemed to be the load of i bunch head. In single-hop bunch environment, suppose all nodesIn transmission range, can arrive a bunch head; The isolated probability P of orderiFor a node in single hop environment does not have a bunch head in transmission rangeProbability, Pi=(1-q) k. Wherein, there is q=π R2/L2Q, this shows the subregion of given node in transmission range. Node isNo is isolated node, depends on k bunch head whether in transmission range. If all k bunch head with probability 1-q in transmission rangeOutward, this node is considered isolated node so. If PiFor just, q is less than 1 so, or meets L and be greater thanIf k footEnough large, PiCan be 0 and can realize single-hop polymerization. So k need to be selected as minimum of a value and meet Pi·N<1。
The present invention is distributed in several sensor nodes in a space, and communication distance and neighbours' number of node is set,And adopt the topological structure of mesh shape. But the method is not subject to the restriction of mesh shape, and suppose a random node of selectingBe designated as a bunch head.
(2), the load-balancing method of the reconstruct that clusters, be divided into two stages of stable state and reconstruct;
The load-balancing method of the reconstruct that clusters, be divided into two stages of stable state and reconstruct; Wherein, take turns as comprising stable state rankThe cycle of section and reconstruction stage; Steady-state process is divided into many frames, and all nodes of each frame transmit initial data and arrive separatelyBunch head in go;
A node set is described with V (m) in m wheel, V (m)={ v1(m),v2(m),…,vk(m) }; Wherein, vi(m) be i bunch head in V (m); If m is 1, V, (m) selects at random or pre-determines; Otherwise V (m) is by a bunch head collection V (m-1) select. Each bunch v belowi(m) broadcast in network, and show that it is a bunch head. Every cluster vi(m) increase progressively from 1Extremely. For example,, if v1(m) receive two message, so v1(m)Be 3. Afterwards, these nodes can be selected nearest bunchHead, and join in corresponding bunch and go. IfBe 1, node is called monopolizes node.
(3), in steady-state process, initialize wheel number, bunch head, message count, when front-wheel is accepted initial data and message count;
In steady-state process, the node in i bunch sends initial data and (comprisesIndex information with dump energy) arriveA bunch vi(m) in, go; By the polymerization of node data, vi(m) can obtain the node n in place bunchi(m); Create node subset,For vi(m) place bunch in create node set Qi(m)；
If 1. message count can be acceptedGrafting node arrivesAnd undated parameter;
If 2. message count is unacceptableThe task transfers of non-leader cluster node in node is arrived to leader cluster nodeUpper, and transmission is containing message countArrive bunch head with dump energy in interior initial data, all bunch heads form new message source jointPoint set;
For being placed into the node subset of subregion, and can receiveInferior message. For example,, if a nodeIn initial wheel, join in 3rd bunch, it belongs to Q so3(1). If receive for twice message orBe 2, this joint soPoint belongs to P3(1,2). IfBe 1, Pi(m, 1) is called as and monopolizes subset. Otherwise,For non-Monopolize subset. According to the relative position of bunch head, some subsets can be sky. Node in all i bunches belongs to Qi(m)，Qi(m)There is k element subset, for And
Fig. 4 is the schematic diagram of node reconstruct. There are three bunches of heads the first round. Wherein, vi(1) be i bunch in the first roundHead, Pi(1, j) be the set of node of receiving message j time in i bunch. Each bunch of head has the region of an arbitrary shape, byCan drawDivide this region to become some subregions. The node of every sub regions can beTherefore the node of every sub regions belongs to phaseSame subsetIf node A is only from v1(1) receive message. In conjunction with v1(1), node A becomes v1(1) monopolize for oneNode, afterwards v1(1) foundationA is classified as to P1(1,1). Node B is received V(1) all message. According to the acceptance of these messageSignal strength signal intensity, B selects v2(1) go as its bunch head and being added in corresponding bunch. Then, v2(1) foundationB is classified as to P2(1,3). The mode of similar B, node C is classified as P3(1,3)；
If message count is unacceptable, the task transfers of non-leader cluster node in node to leader cluster node, transmission containsMessage count and dump energy are in interior initial data to bunch head, and all bunch heads form new message source node set.
(4), in reconstruction stage, the 1st takes turns random establishment bunch head set;
In reconstruction stage, the 1st takes turns random establishment bunch head set; If m=1, creates bunch head set V (m) randomly; UnderIn one reconstruction stage of taking turns, determine a new bunch head set V (m+1); By message as ni(m)、Residual energy with nodeAmount, vi(m) bunch in select a suitable node as vi(m＋1)；
Making N/k is niMean value, make δ for showing ni(m) threshold value in bunch, N, k and δ are and are setting up networkFront given parameter;
According to ni(m) two kinds of situations are discussed: (1) large ni(m):ni(m) 3 (1+ δ) .N/k, (2) little ni(m):ni(m)<(1+δ).N/k。
(5) take turns in all the other of reconstruction stage, according to bunch in bunch head and nodes can meet dependent thresholds condition, from nodeThe node of selecting maximum dump energies in subset is bunch head;
Suppose that node uniformity distributes and vi(m) place is bunch very large; In order to reduce the nodes of next round, vi(m) solelyAccount for the node or the P that in subset, select maximum dump energiesi(m,1)；
Select effectively to increase network life according to dump energy, by selectingIn a jointPoint, vi(m+1) be placed to and gone in the exclusive area at a first prevariety place;
Because the node in other subset makesInBe greater than 1, make vi(m+1) remove, therefore nodeTo there is a chance in next round, to belong to another bunch.
(6) take turns in all the other of reconstruction stage, according to when the satisfied condition of prevariety head, or broadcast, or markAccept message count, reselect a bunch head;
Owing to there being neighbours' bunch head of great deal of nodes, the nodes that bunch of head is equipped with is little, or bunch small; GreatlyBunch head in bunch is selected lower cluster head from tuftlet, and bunch head in tuftlet only from self bunch choose lower cluster head; Then,In large bunch, non-some nodes of monopolizing in subset can be added in this bunch and go in next round;
In order to select an adjacent node, v2And v (1)3(1) select identicalThe node of value; IdenticalOne of value representationIdentical position; Since v2And v (1)3(1)Value is 3, v like this2And v (1)3(1) respectively from P2(1,3) and P3The joint of (1,3)In point, select lower cluster head; If there are many nodes in this subset, select the maximum node of dump energy; Second takes turns, eachIndividual bunch of head is from Pi(2, j) middle selection has the node of maximum dump energies as a bunch head, and j is i bunch headValue;
For example, v1(2) from monopolizing subset P1In (2,1), selecting the node of maximum residual energy is v1(3)，v1(2)Be 1. V simultaneously2And v (2)3(2) respectively from subset P2(2,3) and P3In (2,3), select the node of maximum residual energy. Third roundSituation and second take turns similar; Each vi(2) select self have identical with itNode;
V in Fig. 41(1) meet first condition, therefore P1A node in (1,1) is v1(2). If P1(1,1)In node A have maximum dump energies, this node is selected as v so1(2). In this case, P1In (1,3) absolutely mostlySeveral sections of points and P1Part of nodes in (1,2) is not bunch head (v nearest apart from next knot modification receipt message1(2) and A). ByIn A as the particularity of bunch head, so P1Most nodes in (1,1) will be stayed in i bunch. Because A is at P1(1,1) in, the most nodes of distance compare P2(1,3) and P3Any node in (1,3) is near, therefore the latter is likely in corresponding bunchBe selected as lower cluster head.
(7) use the criterion of balance factor as load balancing, come energy consumption minimizing in equalization networkTraffic congestion;
In order to measure the effect of different branch load equilibriums on a routing tree, be used as load with Chebyshev inequalityBalanced criterion;
For allWith，a={a1,a2,a3,…,an},b={b1,b2,b3,…,bn, and meet: a1≥a2≥a3≥...≥an，b1≥b2≥b3≥...≥bn。
Correspondingly,
Make WbiFor the weights of i branch on routing tree, obtain weight vector w={Wb1,Wb2,Wb3,…,Wbn}。
For example, in a square net, bunch head of grid element center will have four neighbours, therefore have four weights. In order to obtain wThe balanced degree of different branches weights, make a=b=w, in this situation, inequality becomesThisSample, balance factorAnd accordingly as the performance evaluation parameter of load balancing;
In Fig. 4, A is selected as v1(2)。P1Most nodes and P in (1,3)1Part of nodes in (1,2), according to distanceTheir nearest bunch of heads change they bunch. If B and C have maximum residual energy, these two stages are selected as respectively v so2And v (2)3(2)。
According to balance factorIn the time that the weights of each branch pool equal value, pass through routeThe load of setting different branches becomes more balance, and balance factor monotone increasing adduction is close to 1. In the time that the weights of all branches equate,The result of inequality can become maximum 1.
By the deficiency of analysis conventional Internet usage and tasks carrying, the present invention proposes one based on a bunch nose heave structureSensor network environment under the system model of load balancing reach the object that extends sensor network life, and without additionallyThe traffic and complicated calculations.
Above-mentioned reconstruct load-balancing method, to tradition force reconstructing method improve, then according to bunch in nodesWith these two indexs of a bunch number in transmission range, use the criterion of balance factor as load balancing, carry out equalization netEnergy consumption in network also reduces traffic congestion.
Claims (3)
1. cluster in the wireless sensor network load-balancing method of reconstruct, is characterized in that comprising the steps:
(1) wireless sensor network node set is divided into multiple subclass, by a node in single-hop transmission distanceDo not have the probability of bunch head to be called isolated probability, the cycle that many frames are formed is called wheel;
(2) load-balancing method of the reconstruct that clusters is divided into two stages of stable state and reconstruct;
(3), in steady-state process, initialize wheel number, bunch head, message count, when front-wheel is accepted initial data and message count;
(4), in reconstruction stage, the 1st takes turns random establishment bunch head set;
(5) take turns in all the other of reconstruction stage, according to bunch in bunch head and nodes can meet dependent thresholds condition, from node subsetThe node of maximum dump energies of middle selection is a bunch head; In order to reduce the nodes of next round, select according to dump energySelect and effectively increase network life, by selecting a node in node subset, a next round bunch head is placed to by previouslyIn the exclusive area at a bunch place, go;
(6) take turns in all the other of reconstruction stage, according to when the satisfied condition of prevariety head, or broadcast, or mark is acceptedMessage count, reselects a bunch head; In order to select an adjacent node, different bunch heads are selected the node of same message transmission number;
(7) use the criterion of balance factor as load balancing, carry out the energy consumption in equalization network and reduce communicationCongested; Measure the effect of different branch load equilibriums on a routing tree with Chebyshev inequality;
In steady-state process, the node in i bunch sends initial data and comprises message countArrive with the index information of dump energyA bunch vi(m) in, go; By the polymerization of node data, vi(m) can obtain the node n in its place bunchi(m); Create node subsetFor vi(m) its place bunch in create node set, be designated as Qi(m)；
If 1. message count can be acceptedGrafting node is to element subsetAnd undated parameter;
If 2. message count is unacceptableThe task transfers of non-leader cluster node in node is arrived to leader cluster node, and transmissionContaining message countArrive bunch head with dump energy in interior initial data, all bunch heads form new message source node set;
In reconstruction stage, the 1st takes turns random establishment bunch head set;
If m=1, creates bunch head set V (m) randomly;
In the reconstruction stage of next round, determine a new bunch head set V (m+1); By message as ni(m)、And nodeDump energy, at each vi(m) bunch in select a suitable node as a bunch vi(m+1)。
2. cluster in a kind of wireless sensor network according to claim 1 load-balancing method of reconstruct, its feature existsIn described step (1), wireless sensor network node set is divided into multiple subclass; Each subclass is called oneBunch, and possess a bunch of head; Be responsible for overall route by leader cluster node for each bunch, other node is accepted data or passes through from a bunch headBunch hair data.
3. cluster in a kind of wireless sensor network according to claim 1 load-balancing method of reconstruct, its feature existsIn described step (2), by the load-balancing method of the reconstruct that clusters, be divided into two stages of stable state and reconstruct; Wherein, take turns as bagContaining the cycle of steady-state process and reconstruction stage; Steady-state process is divided into many frames, and all nodes of each frame transmit original numberIn bunch head to separately; Isolated probability is the probability that in single hop environment, node does not have bunch head in transmission range; DisappearBreath number is that all nodes are received after message, the message number in a node transmission range of writing down.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310449615.8A CN103501510B (en) | 2013-09-27 | 2013-09-27 | The load-balancing method of reconstruct clusters in a kind of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310449615.8A CN103501510B (en) | 2013-09-27 | 2013-09-27 | The load-balancing method of reconstruct clusters in a kind of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103501510A CN103501510A (en) | 2014-01-08 |
| CN103501510B true CN103501510B (en) | 2016-05-18 |
Family
ID=49866667
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310449615.8A Expired - Fee Related CN103501510B (en) | 2013-09-27 | 2013-09-27 | The load-balancing method of reconstruct clusters in a kind of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103501510B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112689271B (en) * | 2020-12-28 | 2023-06-13 | 上海微波技术研究所（中国电子科技集团公司第五十研究所） | Cluster head planning and power control method for prolonging network survival time |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282290A (en) * | 2008-03-05 | 2008-10-08 | 中科院嘉兴中心微系统所分中心 | Method for balancing and clustering load of wireless sensing network based on gradient |
| CN101355517A (en) * | 2008-09-08 | 2009-01-28 | 北京航空航天大学 | Method for balancing network load based on wireless sensor energy information |
| CN102256303A (en) * | 2010-05-19 | 2011-11-23 | 北京兴科迪科技有限公司 | Adaptive radio sensor network node load equalization method |
-
2013
- 2013-09-27 CN CN201310449615.8A patent/CN103501510B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282290A (en) * | 2008-03-05 | 2008-10-08 | 中科院嘉兴中心微系统所分中心 | Method for balancing and clustering load of wireless sensing network based on gradient |
| CN101355517A (en) * | 2008-09-08 | 2009-01-28 | 北京航空航天大学 | Method for balancing network load based on wireless sensor energy information |
| CN102256303A (en) * | 2010-05-19 | 2011-11-23 | 北京兴科迪科技有限公司 | Adaptive radio sensor network node load equalization method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103501510A (en) | 2014-01-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102271379B (en) | Energy-saving routing method of nodes of internet of things based on context-aware technology | |
| Torghabeh et al. | Cluster head selection using a two-level fuzzy logic in wireless sensor networks | |
| Das et al. | Fuzzy based energy efficient multicast routing for ad-hoc network | |
| Abdullah et al. | Density grid-based clustering for wireless sensors networks | |
| Mahajan et al. | Improving the stable period of WSN using dynamic Stable leach Election Protocol | |
| Mittal et al. | Data clustering in wireless sensor network implemented on self organization feature map (SOFM) neural network | |
| Nayak et al. | Comparison of routing protocols in wsn using netsim simulator: Leach vs leach-c | |
| Chaudhary et al. | Review paper on energy-efficient protocols in wireless sensor networks | |
| CN107612806B (en) | Wireless sensor network energy perception and path architecture data collection method based on mobile sink node | |
| Aissa et al. | Quality of Clustering in mobile Ad Hoc networks | |
| Omari et al. | Simulation, comparison and analysis of wireless sensor networks protocols: LEACH, LEACH-C, LEACH-1R, and HEED | |
| Mody et al. | Cluster head selection algorithm for wireless sensor networks using Machine learning | |
| Lipare et al. | Cluster head selection and cluster construction using fuzzy logic in WSNs | |
| Messaoudi et al. | Distributed fuzzy logic based routing protocol for wireless sensor networks | |
| CN103501510B (en) | The load-balancing method of reconstruct clusters in a kind of wireless sensor network | |
| Pang et al. | Energy-efficient improvements in Mod-LEACH protocol on optimal cluster heads selection | |
| Chen et al. | On wireless sensor network mobile agent multi-objective optimization route planning algorithm | |
| Ranjith et al. | Evaluation study of secondary cluster head selection using fuzzy logic in WSN for conservation of battery energy | |
| Din et al. | Fuzzy logic for cluster head selection in wireless sensor network | |
| CN105682170A (en) | Clustering-type wireless sensor network data collection method based on energy consumption balance | |
| Peng et al. | Energy-efficient and fault-tolerant evolution models for large-scale wireless sensor networks: A complex networks-based approach | |
| Ahir et al. | Energy efficient clustering algorithm for data aggregation in wireless sensor network | |
| Adetona et al. | A cluster head assisted routing (CHAR) scheme for improved energy load balancing in wireless sensor networks | |
| Saxena et al. | Energy Aware Approach in Leach Protocol for Balancing the Cluster Head in Setup Phase: An Application to Wireless Sensor Network | |
| Mishra et al. | A review on fuzzy logic based clustering algorithms for wireless 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160518 Termination date: 20160927 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |