CN105682170A - Clustering-type wireless sensor network data collection method based on energy consumption balance - Google Patents

Clustering-type wireless sensor network data collection method based on energy consumption balance Download PDF

Info

Publication number
CN105682170A
CN105682170A CN201610143246.3A CN201610143246A CN105682170A CN 105682170 A CN105682170 A CN 105682170A CN 201610143246 A CN201610143246 A CN 201610143246A CN 105682170 A CN105682170 A CN 105682170A
Authority
CN
China
Prior art keywords
bunch
node
interim
head
leader cluster
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
Application number
CN201610143246.3A
Other languages
Chinese (zh)
Inventor
沙超
贾明伟
顾焕钊
吴敏
仲莲花
杨瑞
叶宁
王汝传
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201610143246.3A priority Critical patent/CN105682170A/en
Publication of CN105682170A publication Critical patent/CN105682170A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/22—TPC being performed according to specific parameters taking into account previous information or commands
    • H04W52/228—TPC being performed according to specific parameters taking into account previous information or commands using past power values or information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H04W84/20—Master-slave selection or change arrangements
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a clustering-type wireless sensor network data collection method based on energy consumption balance. The clustering-type wireless sensor network data collection method based on energy consumption balance comprises the steps that: in a randomly deployed wireless sensor network, a distributed uniform clustering method is proposed based on a k-means algorithm, and the distributed uniform clustering method can be used for dividing nodes in the network into k regions roughly and uniformly, thereby balancing energy consumption of nodes in the network; subsequently, a neighbor node of each cluster head is selected as an alternative cluster head among the formed clusters, the cluster heads and the alternative cluster heads operate in turn to collect data, energy consumption of the nodes in the network is further balanced, so that life cycles of the nodes in the network are as consistent as possible, thereby prolonging the life cycle of the network.

Description

A kind of clustering wireless sense network method of data capture based on energy consumption balance
Technical field
The present invention relates to the method for data capture of a kind of wireless sense network energy consumption balance, belong to the crossing domain of computer network and wireless communication technology.
Background technology
In today that science and technology develops rapidly, there is wireless sense network (WirelessSensorNetworks, the WSN) technology of Intellisense, autonomous networking, multi-hop transmission ability, be increasingly becoming the focus of domestic and international scientific and technological circle research. As multi-disciplinary interleaving techniques such as computer technology, wireless communication technology, embedded design technology, microelectric techniques, sensor network technology has not only been expanded people and has been obtained ability and the means of information, what is more important, the physical message of objective world has been close-coupled at together with transmission network by it, productive life for people provides extremely abundant advantageous information, is greatly improved quality of life and the work efficiency of people.
On the other hand, along with the development of big data theory and technology, " data collection " problem causes the attention of people gradually. How to utilize existing all kinds of awareness apparatus, high efficiency, highly reliable, the collection of green energy conservation ground magnanimity, diversified perception data, be called restriction sensor network technology development and applying one of the most key technology with core.
Star-like wireless sense network simple in construction, networking flexibility, is the main network construction form adopted in current small-scale application. But it but cannot be applicable to mass data and collect environment, and DCC point burden is often heavier, not easily realizes energy consumption balance; Chain wireless sense network turns and the modes such as multi-hop transmission although with chain great wheel, reduces single node load in data-gathering process, but its reliability standard is not high, and robustness is more weak; And Develop Data is collected in meshed wireless Sensor Network, then easily caused by information implosion.
In the network model of wireless sense network, the network model of tufted structure have conveniently manage, be easily achieved, the good advantage of autgmentability. Such network model, is divided into a lot of subset generally according to certain rule by the node in network, and each subset forms one bunch, and each bunch is made up of leader cluster node and a bunch interior nodes. LEACH is the cluster algorithm proposed the earliest, it ensure that each node serves as a bunch head equiprobably, so that the energy relative equilibrium ground of each node consumes in network, but the election of cluster head mechanism that LEACH algorithm carries does not account for the geographical location information of node, it cannot be guaranteed that a bunch head is evenly distributed in whole network, thus that causes bunch not of uniform size causes, the energy expenditure of each bunch is uneven.
It is known that, wireless sense network already and will continue to have wide application scenarios, in various fields such as military and national defense, industrial or agricultural control, city management, biologic medical, environmental monitoring, rescue and relief work, Smart Home, intelligent grids, there are enough ample scopes for abilities. And in above-mentioned application scenarios and application, it is necessary to the matter of utmost importance of consideration, without exception, will be all data gathering problem. And invent the problem that can solve well above.
Summary of the invention
Present invention aim at for above-mentioned the deficiencies in the prior art, propose a kind of clustering wireless sense network method of data capture based on energy consumption balance, the method principle is similar to k-means algorithm, by constantly calculating the position of the center-of-mass coordinate of each bunch, continuous iteration leader cluster node, thus formed multiple be evenly distributed, the data collection model of clustering architecture rational in infrastructure, and on this basis, choose the neighbor node alternately bunch head of each bunch of head, data collected by bunch head and alternative bunch of great wheel work of changing a job, the energy consumption of balanced leader cluster node further.
This invention address that its technical problem is adopted the technical scheme that: the present invention utilizes the wireless sensing net node of random placement, by constantly calculating the position of the center-of-mass coordinate of each bunch, continuous iteration leader cluster node, thus formed multiple be evenly distributed, the data collection model of clustering architecture rational in infrastructure; Finally, on this basis, choose the neighbor node alternately bunch head of bunch head, bunch head and alternative bunch of great wheel and change a job work thus realizing the data collection of the radio sensing network of energy consumption balance.
Method flow:
Step 1: in rectangle plane network, disposes N number of wireless sensing net node, wherein, the energy constraint of node, and one be deployed immovable, each node oneself position coordinates known; Base station is positioned at networking peripheral edge;
Step 2: each node in network, randomly generates the random number between a 0-1, if this random number is less than threshold value, then externally issues the broadcast oneself being interim bunch of head;
Step 3: the residue node in network, if receiving the broadcast of interim bunch of head, then continues this message of overseas broadcast and sends interim bunch of interior nodes addition message to interim leader cluster node;
Step 4: the interim bunch of interior nodes received is added message and collect by each leader cluster node, and the center-of-mass coordinate of calculating bunch;
Step 5: each interim leader cluster node by bunch center-of-mass coordinate compare with the coordinate of this interim bunch of interior nodes, send new interim leader cluster node message to the node that the center-of-mass coordinate apart from interim bunch is nearest, so that it is determined that new interim bunch;
Step 6: after the node that the center-of-mass coordinate of interim bunch is nearest receives new interim leader cluster node message, announces oneself to be new interim leader cluster node, and interim bunch of head statement message of overseas broadcast simultaneously repeats step 3-step 5;
Step 7: iteration performs above-mentioned steps, until the position of interim bunch of head no longer changes, or the wheel number of iteration reaches, and at this moment interim bunch of hair cloth leader cluster node determines message, so that it is determined that leader cluster node;
Step 8: other nodes in network determine, according to the leader cluster node received, bunch head composition bunch that message chosen distance oneself is nearest, determine message to a bunch hair cloth bunch interior nodes, it is determined that add this bunch simultaneously;
Step 9: leader cluster node chooses its neighbor node alternately bunch head, calculates the time of round work simultaneously according to the dump energy of each node;
Step 10: bunch head and alternative bunch of great wheel change a job work thus realizing the data collection of energy consumption balance.
Further, the step 2 of the present invention includes:
Step 2-1: the node in network is according to formula:(in formula, N is the quantity of node, dtoBSFor the distance of node to base station, fs, amp be the power amplification circuit coefficient of energy dissipation under different channels propagation model) calculate in whole network optimum bunch head quantity;
Step 2-2: each node produces the random number between a 0-1, if random number is less than Kopt/ N, then node is announced oneself is interim leader cluster node;
Step 2-3: interim leader cluster node overseas broadcast one comprises interim bunch of head message (TH_MSG) of oneself id information and coordinate position, waits one sufficiently long period, in order to receive all of replying message simultaneously;
Further, the step 3 of the present invention includes:
Step 3-1: all non-provisional leader cluster nodes in network, by under this message buffer memory and continue overseas broadcast after the broadcast receiving interim bunch of head;
Step 3-2: interim bunch of head message of all buffer memorys is compared by non-provisional leader cluster node, the nearest interim bunch of hair of chosen distance oneself send interim bunch of interior nodes message (TADD_MSG), and this message comprises the id information of the ID of non-provisional leader cluster node, coordinate and interim leader cluster node;
The step 4 of the present invention includes:
Step 4-1: all interim bunch of interior nodes message extraction collected, after waiting for a period of time, is gone out coordinate information by each interim leader cluster node;
Step 4-2: the coordinate information extracted is substituted into formulaCalculate bunch center-of-mass coordinate (x, y). Wherein, xiAnd yiThe transverse and longitudinal coordinate of each interim bunch of head, k be bunch in the number of interim bunch of head. V0The set of interim bunch of head in being bunch;
The step 5 of the present invention includes:
Step 5-1: each interim leader cluster node by bunch the coordinate of interim bunch of interior nodes of center-of-mass coordinate and buffer memory compare, sending new interim leader cluster node message to the node that the center-of-mass coordinate of distance bunch is nearest, new interim leader cluster node message comprises the ID and new interim leader cluster node ID of an interim leader cluster node;
The step 9 of the present invention includes:
Step 9-1: choose the neighbor node alternately bunch head of leader cluster node, calculates the time of round work simultaneously according to the dump energy of each node, and the calculating of round working time is provided by following steps 9-2 to 9-5;
Step 9-2: we choose 2 bunches of head A, B round work energy expenditure with balanced leader cluster node, and the computational methods of multiple bunches of heads are by that analogy;
Step 9-3: in one bunch, the ground floor at tree-like bunch of node place of bunch head is jumped in definition one, and two jump to the second layer at the node place bunch of bunch head, and by that analogy, ground floor is to maximum layer. Making the maximum layer number of plies is n, the sum of each node layer respectively l1, l2, l3……ln, between adjacent layer, the fusion rate of data is η, and it is m that each node one takes turns the data volume perceived, then the data total amount that leader cluster node is collected in a data collection taken turns is
Step 9-4: assuming that node A takes the post as the wheel number of bunch head is t1, it is t that node B takes the post as the wheel number of bunch head2; When the network struction of next round, make the dump energy of node A, B simultaneously for EroundEnergy consumption with balanced bunch head; Assume to be absent between node A, B communication, in time bunch being split into two bunches with node A, B for a bunch head, can obtain, according to the formula of step 9-3, the data volume that A, B receive. It is made to be expressed as N (A) and N (B);
Step 9-5: according to above parameter, respectively egress A energy consumption when becoming bunch head and non-bunch of head in takes turns, and they are respectively defined as Eh-aAnd Ec-a. And meet:
Eh-a=N (A) Eelec+(N(B)+m)ηEelec
Ec-a=N (A) Eelec+(N(A)+m)EDA+(N(A)+m)η(Eelec+εampd2)
Energy consumption when node B becomes bunch head and non-bunch of head in one takes turns can be obtained simultaneously, and they are respectively defined as Eh-bAnd Ec-b. And meet:
Eh-b=N (B) Eelec+(N(A)+m)ηEelec
Ec-b=N (B) Eelec+(N(B)+m)EDA+(N(B)+m)η(Eelec+εampd2)
Node A, B can be obtained at all t by above formula1+t2Energy expenditure in wheel is as follows:
EA-Eround=t1(Eh-a)+t2(Ec-a)
EB-Eround=t2(Eh-b)+t1(Ec-b)
Wherein, EAAnd EBThe respectively primary power of node A, B. Simultaneous above formula can obtain t1And t2Value, namely A, B serve as the wheel number of bunch head.
Useful achievement:
1, the present invention bunch with bunch energy consumption equal, thus the equilibrium energy consumption of network, extend Network morals well.
2, the present invention chooses the neighbor node alternately bunch head of leader cluster node, and bunch head and alternative bunch of great wheel work of changing a job carries out data collection, the balanced well energy consumption of leader cluster node.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of inventive network initial deployment.
Fig. 2 is the Node distribution situation schematic diagram after the present invention bunch structure completes.
Fig. 3 is the Node distribution situation schematic diagram after each bunch is divided by the present invention.
Fig. 4 is the topological structure schematic diagram of in inventive network one bunch.
Fig. 5 is the method flow diagram of the present invention.
Detailed description of the invention
Below in conjunction with Figure of description, the invention is described in further detail.
As it is shown in figure 5, the invention provides a kind of wireless sense network method of data capture based on energy consumption balance. Its concrete summary of the invention mainly includes following two stages.
First stage: after network design completes, each node produces the random number between a 0-1, if random number is less than threshold value, then node is announced oneself is interim bunch of head, and broadcast the message (TH_MSG) oneself being interim bunch of head, all the other nodes according to the distance between oneself and interim leader cluster node select to add apart from oneself nearest bunch (if node is simultaneously nearest apart from multiple interim leader cluster nodes, then node receives the message of which interim bunch of head at first and is selected by adding which bunch), and send interim bunch of interior nodes message (TADD_MSG) to the interim leader cluster node of oneself,
Second stage: through initializing the network of segmentation, bunch size might not be uniform, it is possible to characteristic not of uniform size can be presented, at this moment need network is iterated so that size in network bunch, distribution uniformity. First, interim leader cluster node calculates the barycenter of this bunch according to the interim bunch of interior nodes message (TADD_MSG) received. Interim leader cluster node by bunch center-of-mass coordinate compare with the coordinate of bunch interior nodes, newly interim leader cluster node message (node in selected bunch of this message be new interim bunch of head) is sent to the node that the barycenter of distance bunch is nearest. The nearest node of barycenter of distance bunch is again issued interim bunch of head statement message and is announced that oneself is for interim bunch of head, repeats said process after receiving this message, until the position of interim bunch of head no longer changes, or the wheel number of iteration reaches. At this moment interim bunch of hair cloth leader cluster node determines message (HD_MSG), so that it is determined that oneself be leader cluster node, other nodes in network determine, according to the leader cluster node received, bunch head composition bunch that message chosen distance oneself is nearest, determine message (ADD_MSG) to a bunch hair cloth bunch interior nodes simultaneously. So far the segmentation of network is formed;
Phase III: after the segmentation of network is formed, choosing the neighbor node alternately bunch head of leader cluster node, calculate the time of each node round work simultaneously according to the dump energy of each node, each node round works.
Concrete steps of the present invention include as follows:
Step 1: in rectangle plane network, disposes N number of wireless sensing net node, wherein, the energy constraint of node, and one be deployed immovable, each node oneself position coordinates known;Base station is positioned at networking peripheral edge;
Step 2: each node in network, randomly generates the random number between a 0-1, if this random number is less than threshold value, then externally issues the broadcast oneself being interim bunch of head;
Step 2-1: the node in network is according to formula:(in formula, N is the quantity of node, dtoBSFor the distance of node to base station, εfs、εampPower amplification circuit coefficient of energy dissipation under different channels propagation model) calculate bunch head quantity optimum in whole network;
Step 2-2: each node produces the random number between a 0-1, if random number is less than Kopt/ N, then node is announced oneself is interim leader cluster node;
Step 2-3: interim leader cluster node overseas broadcast one comprises interim bunch of head message (TH_MSG) of oneself id information and coordinate position, waits one sufficiently long period, in order to receive all of replying message simultaneously;
Step 3: the residue node in network, if receiving the broadcast of interim bunch of head, then continues this message of overseas broadcast and sends interim bunch of interior nodes addition message to interim leader cluster node;
Step 3-1: all non-provisional leader cluster nodes in network, by under this message buffer memory and continue overseas broadcast after the broadcast receiving interim bunch of head;
Step 3-2: interim bunch of head message of all buffer memorys is compared by non-provisional leader cluster node, the nearest interim bunch of hair of chosen distance oneself send interim bunch of interior nodes message (TADD_MSG), and this message comprises the id information of the ID of non-provisional leader cluster node, coordinate and interim leader cluster node;
Step 4: the interim bunch of interior nodes received is added message and collect by each leader cluster node, and the center-of-mass coordinate of calculating bunch;
Step 4-1: all interim bunch of interior nodes message extraction collected, after waiting for a period of time, is gone out coordinate information by each interim leader cluster node;
Step 4-2: the coordinate information extracted is substituted into formulaCalculate bunch center-of-mass coordinate (x, y). Wherein, xiAnd yiThe transverse and longitudinal coordinate of each interim bunch of head, k be bunch in the number of interim bunch of head. V0The set of interim bunch of head in being bunch;
Step 5: each interim leader cluster node by bunch center-of-mass coordinate compare with the coordinate of this interim bunch of interior nodes, send new interim leader cluster node message to the node that the center-of-mass coordinate apart from interim bunch is nearest, so that it is determined that new interim bunch;
Step 5-1: each interim leader cluster node by bunch the coordinate of interim bunch of interior nodes of center-of-mass coordinate and buffer memory compare, sending new interim leader cluster node message to the node that the center-of-mass coordinate of distance bunch is nearest, new interim leader cluster node message comprises the ID and new interim leader cluster node ID of an interim leader cluster node;
Step 6: after the node that the center-of-mass coordinate of interim bunch is nearest receives new interim leader cluster node message, announces oneself to be new interim leader cluster node, and interim bunch of head statement message of overseas broadcast simultaneously repeats step 3-step 5;
Step 7: iteration performs above-mentioned steps, until the position of interim bunch of head no longer changes, or the wheel number of iteration reaches, and at this moment interim bunch of hair cloth leader cluster node determines message, so that it is determined that leader cluster node;
Step 8: other nodes in network determine, according to the leader cluster node received, bunch head composition bunch that message chosen distance oneself is nearest, determine message to a bunch hair cloth bunch interior nodes, it is determined that add this bunch simultaneously;
Step 9: leader cluster node chooses its neighbor node alternately bunch head, calculates the time of round work simultaneously according to the dump energy of each node;
Step 9-1: choose the neighbor node alternately bunch head of leader cluster node, calculates the time of round work simultaneously according to the dump energy of each node, and the calculating of round working time is provided by following steps 9-2 to 9-5;
Step 9-2: we choose 2 bunches of head A, B round work energy expenditure with balanced leader cluster node, the computational methods of multiple bunches of heads by that analogy, as shown in Figure 4;
Step 9-3: in one bunch, the ground floor at tree-like bunch of node place of bunch head is jumped in definition one, and two jump to the second layer at the node place bunch of bunch head, and by that analogy, ground floor is to maximum layer. Making the maximum layer number of plies is n, the sum of each node layer respectively l1, l2, l3……ln, between adjacent layer, the fusion rate of data is η, and it is m that each node one takes turns the data volume perceived, then the data total amount that leader cluster node is collected in a data collection taken turns is
Step 9-4: assuming that node A takes the post as the wheel number of bunch head is t1, it is t that node B takes the post as the wheel number of bunch head2; When the network struction of next round, make the dump energy of node A, B simultaneously for EroundEnergy consumption with balanced bunch head; Assume to be absent between node A, B communication, in time bunch being split into two bunches with node A, B for a bunch head, can obtain, according to the formula of step 9-3, the data volume that A, B receive. It is made to be expressed as N (A) and N (B);
Step 9-5: according to above parameter, respectively egress A energy consumption when becoming bunch head and non-bunch of head in takes turns, and they are respectively defined as Eh-aAnd Ec-a. And meet:
Eh-a=N (A) Eelec+(N(B)+m)ηEelec
Ec-a=N (A) Eelec+(N(A)+m)EDA+(N(A)+m)η(Eelec+εampd2)
Energy consumption when node B becomes bunch head and non-bunch of head in one takes turns can be obtained simultaneously, and they are respectively defined as Eh-bAnd Ec-b. And meet:
Eh-b=N (B) Eelec+(N(A)+m)ηEelec
Ec-b=N (B) Eelec+(N(B)+m)EDA+(N(B)+m)η(Eelec+εampd2)
Node A, B can be obtained at all t by above formula1+t2Energy expenditure in wheel is as follows:
EA-Eround=t1(Eh-a)+t2(Ec-a)
EB-Eround=t2(Eh-b)+t1(Ec-b)
Wherein, EAAnd EBThe respectively primary power of node A, B. Simultaneous above formula can obtain t1And t2Value, namely A, B serve as the wheel number of bunch head.
Step 10: bunch head and alternative bunch of great wheel change a job work thus realizing the data collection of energy consumption balance.

Claims (7)

1. the clustering wireless sense network method of data capture based on energy consumption balance, it is characterized in that: described method utilizes the wireless sensing net node of random placement, by constantly calculating the position of the center-of-mass coordinate of each bunch, continuous iteration leader cluster node, thus formed multiple be evenly distributed, the data collection model of clustering architecture rational in infrastructure; Finally, on this basis, choosing the neighbor node alternately bunch head of bunch head, bunch head and alternative bunch of great wheel are changed a job work, thus realizing the data collection of the radio sensing network of energy consumption balance.
2. a kind of clustering wireless sense network method of data capture based on energy consumption balance according to claim 1, it is characterised in that described method comprises the steps:
Step 1: in rectangle plane network, disposes N number of wireless sensing net node, wherein, the energy constraint of node, and one be deployed immovable, each node oneself position coordinates known; Base station is positioned at networking peripheral edge;
Step 2: each node in network, randomly generates the random number between a 0-1, if this random number is less than threshold value, then externally issues the broadcast oneself being interim bunch of head;
Step 3: the residue node in network, if receiving the broadcast of interim bunch of head, then continues this message of overseas broadcast and sends interim bunch of interior nodes addition message to interim leader cluster node;
Step 4: the interim bunch of interior nodes received is added message and collect by each leader cluster node, and the center-of-mass coordinate of calculating bunch;
Step 5: each interim leader cluster node by bunch center-of-mass coordinate compare with the coordinate of this interim bunch of interior nodes, send new interim leader cluster node message to the node that the center-of-mass coordinate apart from interim bunch is nearest, so that it is determined that new interim bunch;
Step 6: after the node that the center-of-mass coordinate of interim bunch is nearest receives new interim leader cluster node message, announces oneself to be new interim leader cluster node, and interim bunch of head statement message of overseas broadcast simultaneously repeats step 3-step 5;
Step 7: iteration performs above-mentioned steps, until the position of interim bunch of head no longer changes, or the wheel number of iteration reaches, and at this moment interim bunch of hair cloth leader cluster node determines message, so that it is determined that leader cluster node;
Step 8: other nodes in network determine, according to the leader cluster node received, bunch head composition bunch that message chosen distance oneself is nearest, determine message to a bunch hair cloth bunch interior nodes, it is determined that add this bunch simultaneously;
Step 9: leader cluster node chooses its neighbor node alternately bunch head, calculates the time of round work simultaneously according to the dump energy of each node;
Step 10: bunch head and alternative bunch of great wheel change a job work thus realizing the data collection of energy consumption balance.
3. a kind of clustering wireless sense network method of data capture based on energy consumption balance according to claim 2, it is characterised in that described step 2 includes:
Step 2-1: the node in network is according to formula:(in formula, N is the quantity of node, dtoBSFor the distance of node to base station, fs, amp are the power amplification circuit coefficient of energy dissipation under different channels propagation model) calculate bunch head quantity optimum in whole network;
Step 2-2: each node produces the random number between a 0-1, if random number is less than Kopt/ N, then node is announced oneself is interim leader cluster node;
Step 2-3: interim leader cluster node overseas broadcast one comprises interim bunch of head message (TH_MSG) of oneself id information and coordinate position, waits one sufficiently long period, in order to receive all of replying message simultaneously.
4. the clustering wireless sense network method of data capture based on energy consumption balance according to claim 3, it is characterised in that described step 3 includes:
Step 3-1: all non-provisional leader cluster nodes in network, by under this message buffer memory and continue overseas broadcast after the broadcast receiving interim bunch of head;
Step 3-2: interim bunch of head message of all buffer memorys is compared by non-provisional leader cluster node, the nearest interim bunch of hair of chosen distance oneself send interim bunch of interior nodes message (TADD_MSG), and this message comprises the id information of the ID of non-provisional leader cluster node, coordinate and interim leader cluster node.
5. a kind of clustering wireless sense network method of data capture based on energy consumption balance according to claim 4, it is characterised in that described step 4 includes:
Step 4-1: all interim bunch of interior nodes message extraction collected, after waiting for a period of time, is gone out coordinate information by each interim leader cluster node;
Step 4-2: the coordinate information extracted is substituted into formulaCalculate bunch center-of-mass coordinate (x, y), wherein, xiAnd yiThe transverse and longitudinal coordinate of each interim bunch of head, k be bunch in the number of interim bunch of head, V0The set of interim bunch of head in being bunch.
6. the clustering wireless sense network method of data capture based on energy consumption balance according to claim 5, it is characterised in that described step 5 includes:
Step 5-1: each interim leader cluster node by bunch the coordinate of interim bunch of interior nodes of center-of-mass coordinate and buffer memory compare, sending new interim leader cluster node message to the node that the center-of-mass coordinate of distance bunch is nearest, new interim leader cluster node message comprises the ID and new interim leader cluster node ID of an interim leader cluster node.
7. according to the arbitrary described a kind of clustering wireless sense network method of data capture based on energy consumption balance of claim 1-6, it is characterised in that described step 9 includes:
Step 9-1: choose the neighbor node alternately bunch head of leader cluster node, calculates the time of round work simultaneously according to the dump energy of each node, and the calculating of round working time is provided by following steps 9-2 to 9-5;
Step 9-2: we choose 2 bunches of head A, B round work energy expenditure with balanced leader cluster node, and the computational methods of multiple bunches of heads are by that analogy;
Step 9-3: in one bunch, the ground floor at tree-like bunch of the node place of bunch head is jumped in definition one, and two jump to the second layer at the node place bunch of bunch head, and by that analogy, ground floor is to maximum layer, and making the maximum layer number of plies is n, the sum of each node layer respectively l1, l2, l3……ln, between adjacent layer, the fusion rate of data is η, and it is m that each node one takes turns the data volume perceived, then the data total amount that leader cluster node is collected in a data collection taken turns is
Step 9-4: assuming that node A takes the post as the wheel number of bunch head is t1, it is t that node B takes the post as the wheel number of bunch head2; When the network struction of next round, make the dump energy of node A, B simultaneously for EroundEnergy consumption with balanced bunch head; Assume to be absent between node A, B communication, in time bunch being split into two bunches with node A, B for a bunch head, can obtain, according to the formula of step 9-3, the data volume that A, B receive, make it be expressed as N (A) and N (B);
Step 9-5: according to above parameter, respectively egress A energy consumption when becoming bunch head and non-bunch of head in takes turns, and they are respectively defined as Eh-aAnd Ec-a, and meet:
Eh-a=N (A) Eelec+(N(B)+m)ηEelec
Ec-a=N (A) Eelec+(N(A)+m)EDA+(N(A)+m)η(Eelec+εampd2)
Energy consumption when node B becomes bunch head and non-bunch of head in one takes turns can be obtained simultaneously, and they are respectively defined as Eh-bAnd Ec-b, and meet:
Eh-b=N (B) Eelec+(N(A)+m)ηEelec
Ec-b=N (B) Eelec+(N(B)+m)EDA+(N(B)+m)η(Eelec+εampd2)
Node A, B can be obtained at all t by above formula1+t2Energy expenditure in wheel is as follows:
EA-Eround=t1(Eh-a)+t2(Ec-a)
EB-Eround=t2(Eh-b)+t1(Ec-b)
Wherein, EAAnd EBThe respectively primary power of node A, B, simultaneous above formula can obtain t1And t2Value, namely A, B serve as the wheel number of bunch head.
CN201610143246.3A 2016-03-14 2016-03-14 Clustering-type wireless sensor network data collection method based on energy consumption balance Pending CN105682170A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610143246.3A CN105682170A (en) 2016-03-14 2016-03-14 Clustering-type wireless sensor network data collection method based on energy consumption balance

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610143246.3A CN105682170A (en) 2016-03-14 2016-03-14 Clustering-type wireless sensor network data collection method based on energy consumption balance

Publications (1)

Publication Number Publication Date
CN105682170A true CN105682170A (en) 2016-06-15

Family

ID=56307662

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610143246.3A Pending CN105682170A (en) 2016-03-14 2016-03-14 Clustering-type wireless sensor network data collection method based on energy consumption balance

Country Status (1)

Country Link
CN (1) CN105682170A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107395714A (en) * 2017-07-18 2017-11-24 陈剑桃 A kind of intelligent physiological parameter monitoring platform
CN109005567A (en) * 2018-09-14 2018-12-14 常熟理工学院 A kind of mobile network's implementation method based on cluster
CN112051824A (en) * 2020-09-22 2020-12-08 吴信强 Operation and maintenance system based on industrial Internet of things

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110130162A1 (en) * 2009-11-30 2011-06-02 Electronics And Telecommunications Research Institute Method for cluster based data transmission in wireless sensor networks
CN103269507A (en) * 2013-03-05 2013-08-28 江苏科技大学 Routing method of double-cluster head wireless sensor network
CN104113891A (en) * 2014-07-10 2014-10-22 厦门大学 Energy-saving clustering algorithm for wireless sensor network
WO2015084104A1 (en) * 2013-12-05 2015-06-11 엘지전자 주식회사 Method and apparatus for hierarchically cooperative v-mimo in wireless communication system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110130162A1 (en) * 2009-11-30 2011-06-02 Electronics And Telecommunications Research Institute Method for cluster based data transmission in wireless sensor networks
CN103269507A (en) * 2013-03-05 2013-08-28 江苏科技大学 Routing method of double-cluster head wireless sensor network
WO2015084104A1 (en) * 2013-12-05 2015-06-11 엘지전자 주식회사 Method and apparatus for hierarchically cooperative v-mimo in wireless communication system
CN104113891A (en) * 2014-07-10 2014-10-22 厦门大学 Energy-saving clustering algorithm for wireless sensor network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
吕金鹏: "无线传感器网络的路由协议研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》 *
徐鹏: "一种LEACH协议的改进算法LEACH_EH", 《微型机与应用》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107395714A (en) * 2017-07-18 2017-11-24 陈剑桃 A kind of intelligent physiological parameter monitoring platform
CN109005567A (en) * 2018-09-14 2018-12-14 常熟理工学院 A kind of mobile network's implementation method based on cluster
CN109005567B (en) * 2018-09-14 2020-04-17 常熟理工学院 Mobile network implementation method based on cluster
CN112051824A (en) * 2020-09-22 2020-12-08 吴信强 Operation and maintenance system based on industrial Internet of things
CN112051824B (en) * 2020-09-22 2021-04-09 吴信强 Operation and maintenance system based on industrial Internet of things

Similar Documents

Publication Publication Date Title
CN102497679B (en) Static clustering algorithm for wireless sensor network
Jadhav et al. Whale optimization based energy-efficient cluster head selection algorithm for wireless sensor networks
CN104410997B (en) A kind of clustering topology construction method for wireless sensor network
CN105050095B (en) A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting
CN107969008B (en) Centralized routing calculation method for software defined sensor network
John et al. Energy saving cluster head selection in wireless sensor networks for internet of things applications
CN104219704A (en) Toxic gas boundary monitoring and tracking method based on double-layer mesh model in wireless sensor network
CN104284386A (en) Vertex-betweenness-based cluster head selection method in wireless sensor networks
CN103796273A (en) Energy-balanced clustering routing strategy for wireless sensor networks
Mahajan et al. Improving the stable period of WSN using dynamic Stable leach Election Protocol
CN105682170A (en) Clustering-type wireless sensor network data collection method based on energy consumption balance
CN103249109B (en) Based on the energy-saving routing method of the radio sensing network of irregular cellular automata
Wang et al. A mobile sink based uneven clustering algorithm for wireless sensor networks
CN103701647A (en) Wireless network topology optimizing and generating method
Cui Research and improvement of LEACH protocol in wireless sensor networks
Navimipour et al. Minimize energy consumption and improve the lifetime of heterogeneous wireless sensor networks by using monkey search algorithm
CN106412935B (en) A kind of network topology structure method for building up based on Complex Networks Theory
Lin et al. Hilbert-chain topology for energy conservation in large-scale wireless sensor networks
CN102802166A (en) Improved Zigbee network lamination method
CN103179631B (en) A kind of choose the method that optimal angle carries out sub-clustering
Jun et al. A modified LEACH algorithm in wireless sensor network based on NS2
Patole et al. Design of MAP-REDUCE and K-MEANS based network clustering protocol for sensor networks
Khamfroush et al. Lifetime increase for wireless sensor networks using cluster-based routing
Vashist et al. Minimum spanning tree based improved routing protocol for heterogeneous wireless sensor network
Zebbane et al. Exploiting node redundancy for maximizing wireless sensor network lifetime

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: 20160615

WD01 Invention patent application deemed withdrawn after publication