CN103269507B - Two bunches of head wireless sensor network routing methods - Google Patents

Two bunches of head wireless sensor network routing methods Download PDF

Info

Publication number
CN103269507B
CN103269507B CN201310068782.8A CN201310068782A CN103269507B CN 103269507 B CN103269507 B CN 103269507B CN 201310068782 A CN201310068782 A CN 201310068782A CN 103269507 B CN103269507 B CN 103269507B
Authority
CN
China
Prior art keywords
node
leader cluster
bunch
cluster node
distance
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
Application number
CN201310068782.8A
Other languages
Chinese (zh)
Other versions
CN103269507A (en
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.)
Jiangsu University of Science and Technology
Original Assignee
Jiangsu University of Science and Technology
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 Jiangsu University of Science and Technology filed Critical Jiangsu University of Science and Technology
Priority to CN201310068782.8A priority Critical patent/CN103269507B/en
Publication of CN103269507A publication Critical patent/CN103269507A/en
Application granted granted Critical
Publication of CN103269507B publication Critical patent/CN103269507B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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 kind of two bunch head wireless sensor network routing method, the method comprises the following steps: carry out netinit; Carry out interim sub-clustering, elected interim leader cluster node to collect bunch in the position of ordinary node and energy information; According to interim leader cluster node collect bunch in ordinary node information and gather energy consumption and the energy consumption minimized criterion of transmission, utilize particle swarm optimization algorithm to select the secondary leader cluster node of optimum main leader cluster node and optimum; At data transfer phase, each secondary leader cluster node, according to the Distance geometry dump energy Information Selection next-hop node of its distance aggregation node, sends data to aggregation node place by multi-hop.The present invention effectively can alleviate a bunch problem for head overload, improves two bunches of heads capacity usage ratio separately, avoids a bunch head quick death, and balanced network energy consumption, extends whole network life cycle.

Description

Two bunches of head wireless sensor network routing methods
Technical field
The present invention relates to a kind of wireless sensor network routing method, particularly relate to a kind of two bunch head energy-saving routing method for wireless sensor network based on particle group optimizing, belong to sensor network technology field.
Background technology
Wireless sensor network is an important research field in current computer, communication, control subject, and it provides advantage for people's obtaining information.Sensor node is little, low price, easily hidden with deployment, can large area be distributed in need monitoring region in, self-organizing can form network.But the energy content of battery of sensor node is limited, and in most cases can not charge or change node, node energy is once be finished, mean that node is dead, the network operation is affected, therefore, the wireless sensor network routing method designing a kind of low energy consumption is the key technology of current this area research.
Routing Protocol based on sub-clustering is the class Wireless Sensor Network Routing Protocol that current researcher compares concern.According to a bunch difference for head production method, roughly clustering route protocol can be divided three classes.The first kind is as LEACH, EEUC, and a bunch head is random generation, although the method can effectively avoid a certain node to become a bunch head continuously, delay node death, bunch head number that often wheel produces is not fixed, easily cause bunch scope excessive or too small, be difficult to equalizing network energy consumption.Equations of The Second Kind, as HEED, CHTD, is a kind of complete distributed Clustering Algorithm, dynamically produces more reasonable bunch of head by internodal information interaction, but information interactive process needs a large amount of broadcast, causes extra energy expense.3rd class is as LEACH-C, BCDCP, and each node is by the information reporting such as self geographical position and present energy to aggregation node, and aggregation node selects suitable bunch head and rationally sub-clustering according to global information, but these class methods need aggregation node to understand global information.
Swarm intelligence, as the emerging evolutionary computing of one, is introduced into and solves routing issue in wireless sensor network, comprising ant group algorithm, particle swarm optimization algorithm, genetic algorithm etc.Particle swarm optimization algorithm has algorithm simply because of it, and the characteristics such as search speed is fast, are applicable to the wireless sensor network of finite energy." PSO-basedEnergy-balancedDoubleCluster-headsClusteringRou tingforwirelesssensornetworks " that HuYu, WangXiaohui deliver on ProcediaEngineering discloses a kind of wireless sensor network routing method PSO-MV.The method utilizes particle swarm optimization algorithm to select two bunch head, major and minor bunch of head selects wherein optimum node and suboptimum node to be elected to according to particle swarm optimization algorithm (PSO), more effectively alleviate the problem of single bunch of head overload, but bunch head capacity usage ratio is still not high.Number of patent application is that the Chinese patent application of CN201210043196.3 discloses a kind of wireless sensor network Routing Optimization Algorithm based on energy ezpenditure, be characterized in that the number by selecting to optimize leader cluster node improves network quality with the optimum node of selection as a bunch head, but there is the problem of bunch head overload.
For bunch head overload of Clustering Routing in prior art, the problem of capacity usage ratio not high quickening network death, based on collection energy consumption and the energy consumption minimized criterion of transmission, design the two bunch head energy-saving routing method of a kind of new particle group optimizing wireless sensor network, effective alleviation bunch head overload, improve bunch head capacity usage ratio, be of great significance with the object tool reaching prolonging network survival time.
Summary of the invention
The object of the present invention is to provide a kind of two bunch head wireless sensor network routing method, effectively alleviate bunch head overload, improve bunch head capacity usage ratio, with prolonging network survival time.
Object of the present invention is achieved by the following technical programs:
A kind of two bunch head wireless sensor network routing method, the method comprises the following steps:
1) carry out netinit, in monitored area, random placement is N number of has identical primary power, ID numbering from the ordinary node of 0 ~ N, and aggregation node is deployed in certain of network surrounding;
2) interim sub-clustering is carried out: all ordinary node self-energy information and positional information are sent to aggregation node, aggregation node is according to the ordinary node information collected, calculate the average energy of all ordinary nodes, and be greater than Stochastic choice ordinary node the ordinary node of average energy from dump energy and become interim leader cluster node; The interim leader cluster node that all successes are elected to is with certain power broadcasts message, and whether each interim leader cluster node is observed in its communication radius exists other interim leader cluster nodes; If there are other interim leader cluster nodes to exist, then the interim leader cluster node selecting energy maximum continues as interim leader cluster node, and the interim leader cluster node that other energy are little is abandoned being elected to, and becomes ordinary node; Final elected interim leader cluster node broadcasts its elected message, and ordinary node receives the message of interim leader cluster node broadcast, according to the power of its acknowledge(ment) signal, selects the strongest interim leader cluster node of signal to add in its bunch; Elected interim leader cluster node to collect bunch in the position of ordinary node and energy information;
3) selection of optimum main leader cluster node is carried out: based on the energy consumption minimized criterion of collection, the adaptive value function f that optimum main leader cluster node is chosen is:
f＝αf 1+βf 2+γf 3
f 1 = E ( c ) / Σ i = 1 k E ( i )
f 2 = ( k - 1 ) / Σ i = 1 k d itoc
f 3＝(d max-d)/d max
Wherein, k be bunch in ordinary node number, E (i) is the energy of ordinary node i, and E (c) is the leader cluster node energy at node place bunch, f 1represent that leader cluster node energy accounts for a bunch ratio for interior nodes gross energy; d itocthe distance of ordinary node i apart from the leader cluster node of affiliated bunch, f 2in representing bunch, ordinary node is to the inverse of leader cluster node average distance, f 2larger represent leader cluster node distance bunch in ordinary node average distance less; d maxbe the ultimate range of ordinary node to regional center that position is in edge, d is the distance of ordinary node i to regional center, f 3larger to represent ordinary node i distance areas center nearer, is more beneficial to data acquisition and sends data to secondary leader cluster node; α, beta, gamma is weight coefficient, alpha+beta+γ=1;
4) choosing of secondary leader cluster node is carried out based on the energy consumption minimized criterion of transmission: the adaptive value function g that secondary leader cluster node is chosen is:
g＝εg 1+(1-ε)g 2
g 1 = E ( c ) / Σ i = 1 k E ( i )
g 2 = d ctoBS / Σ i = 1 k d itoBS
Wherein, k be bunch in ordinary node number, E (i) is the energy of ordinary node i, and E (c) is the leader cluster node energy at node place bunch, g 1represent that leader cluster node energy accounts for a bunch ratio for interior nodes gross energy; d ctoBSthe distance of leader cluster node to aggregation node, d itoBSthe distance of ordinary node i to aggregation node, g 2represent that leader cluster node accounts for the ratio of bunch interior nodes to aggregation node distance summation, g to the distance of aggregation node 2the larger leader cluster node that represents is less apart from the distance of aggregation node; ε is weight coefficient, 0 ﹤ ε ﹤ 1;
5) data transfer phase adopt bunch between multi-hop mode, first each secondary leader cluster node calculates the distance of its distance aggregation node, then this secondary leader cluster node distance distance of aggregation node and size of TH value is compared, described TH value is a threshold value preset, its value is always less than the maximum broadcasting area of node, if the distance of secondary leader cluster node distance aggregation node is less than TH value, then data are directly transferred to aggregation node in single-hop mode by secondary leader cluster node; When the distance of secondary leader cluster node distance aggregation node is greater than TH value, data multi-hop mode between repeatedly transmission is bunch, as down hop target, is delivered to aggregation node by more other the secondary leader cluster nodes of this secondary cluster-head node selection dump energy.
Compared with prior art, the invention has the beneficial effects as follows: wireless sensor network massive wireless sensor being divided into several bunches, select the secondary leader cluster node of optimum main leader cluster node and its relative position optimum according to the particle swarm optimization algorithm gathering energy consumption and the energy consumption minimized criterion of transmission; Main leader cluster node collection, transfer data to secondary leader cluster node, between secondary leader cluster node by multi-hop transmission to aggregation node.The method effectively can alleviate a bunch problem for head overload, improves two bunches of heads capacity usage ratio separately, avoids a bunch head quick death, and balanced network energy consumption, extends whole network life cycle.
Accompanying drawing explanation
Fig. 1 is the structure principle chart of wireless sensor network of the present invention;
Fig. 2 is the flow chart in interim sub-clustering stage of the present invention;
Fig. 3 is the flow chart of the main bunch head selection course of optimum of the present invention;
Fig. 4 is the flow chart of optimum secondary bunch head selection course of the present invention;
Fig. 5 is the analogous diagram that network often takes turns surviving node number.
Embodiment
Below in conjunction with the drawings and specific embodiments, the invention will be further described.
Two bunch head wireless sensor network routing method of the present invention is applicable to the massive wireless sensor of sub-clustering, as shown in Figure 1, in monitored area 1 wireless sensor network comprise several independently bunches 2 and an aggregation node 4; There is following sensor node for described bunch 2: several ordinary nodes 3, main leader cluster node 5, secondary leader cluster node 6 and interim leader cluster node.The function of ordinary node 3 is data acquisitions, and sends data to main leader cluster node 5.Interim leader cluster node produces from ordinary node, and its function is the ordinary node information in gathering bunch, and according to collection energy consumption and the energy consumption minimized criterion of transmission from bunch in select major and minor leader cluster node all surviving node.The function of main leader cluster node 5 is data acquisition and fusion, and gives secondary leader cluster node 6 by data retransmission.The function of secondary leader cluster node 6 be by bunch between communication send data to aggregation node 4.
The present invention proposes a kind of novel based on gathering energy consumption bunch head energy-saving routing method two with the particle group optimizing wireless sensor network of the energy consumption minimized criterion of transmission, the criterion of institute's foundation effectively can select optimum main leader cluster node and secondary leader cluster node, improve leader cluster node capacity usage ratio, make whole network energy consumption more balanced, and avoid the quick death of a certain node, finally effectively can improve the life span of network, its embodiment is as follows:
One, the netinit stage
First in monitored area, random placement is N number of has identical primary power, ID numbering from the ordinary node of 0 ~ N.Aggregation node is deployed in certain of network surrounding, and each ordinary node can directly communicate with aggregation node, and aggregation node Infinite Energy is large, can deal with data.
Two, the interim sub-clustering stage, as shown in Figure 2:
1. all ordinary node self-energy information and positional information are sent to aggregation node, aggregation node is according to the ordinary node information collected, calculate the average energy of all ordinary nodes, and be greater than Stochastic choice node the node of average energy from dump energy and become interim leader cluster node.
2. the interim leader cluster node that all successes are elected is with certain power broadcasts message.Whether each interim leader cluster node is observed in its communication radius exists other interim leader cluster nodes.If there are other interim leader cluster nodes to exist, then the interim leader cluster node selecting energy maximum continues as interim leader cluster node, and the interim leader cluster node that other energy are little is abandoned being elected to, and becomes ordinary node.
3. final elected interim leader cluster node broadcasts its elected message, and ordinary node receives the message of interim leader cluster node broadcast, according to the power of its acknowledge(ment) signal, selects the strongest interim leader cluster node of signal to add in its bunch.
4. interim leader cluster node to collect bunch in the position of ordinary node and energy information.
Three, the optimal double bunch head choice phase
According to interim leader cluster node collect bunch in ordinary node information and gather energy consumption and the energy consumption minimized criterion of transmission, utilize particle swarm optimization algorithm to select the secondary leader cluster node of optimum main leader cluster node and optimum.Wherein gather energy consumption minimized criterion and be applied to choosing of main leader cluster node, this criterion draws according to the feature of main leader cluster node task.For main leader cluster node, its main task is the data of ordinary node in being responsible for collecting bunch, therefore, it not only should have higher energy, and the average distance of ordinary node is the smaller the better in this nodal distance bunch, simultaneously in order to prevent main leader cluster node marginalisation, because allowing it draw close toward regional center, the distance transmitted with secondary leader cluster node can be shortened like this.The adaptive value function f that main leader cluster node is chosen can be drawn according to this criterion.Transmit energy consumption minimized criterion and be applied to choosing of secondary leader cluster node, this criterion draws according to the feature of secondary leader cluster node task.For secondary leader cluster node, its main task sends data to aggregation node, so it not only will have higher energy, and the distance of distance aggregation node is the smaller the better.The adaptive value function g that secondary leader cluster node is chosen can be drawn according to this criterion.Wherein optimal double bunch head selection course is as follows:
The flow process of optimum main bunch head selection course as shown in Figure 3;
1. initialization population.The position x of each particle of random initializtion xid(t), x yid(t) and speed v xid(t), v yid(t).The position of particle is adjusted, upgrades, is mapped to network node location.Network node position of the present invention is (p xi, p yi), make the absolute value of particle position and the difference of network node on x component be Δ p xi=| x xid(t)-p xi|, the absolute value of the difference on y component is Δ p yi=| x yid(t)-p yi|, particle position and the network node absolute value sum of difference on x, y component is particle position after renewal is the position that its position and the network node network node that the absolute value sum of difference is minimum on x, y component are corresponding, even if Δ p k=min (Δ p 1, Δ p 2..., Δ p n), wherein the position of nodes k be particle upgrade after position.
2. gather according to main leader cluster node the adaptive value function f that energy consumption minimized criterion selects to draw, calculate the adaptive value f of each particle i, wherein the adaptive value function of main leader cluster node is
f＝αf 1+βf 2+γf 3
f 1 = E ( c ) / Σ i = 1 k E ( i )
f 2 = ( k - 1 ) / Σ i = 1 k d itoc
f 3＝(d max-d)/d max
3. make the individual extreme value p of particle idequal particle current location, global extremum p gdequal position corresponding to particle that in current all particles, adaptive value is maximum.
4. upgrade the speed v of each particle xid(t), v yid(t) and position x xid(t), x yid(t), and the position of particle is adjusted, upgraded, be mapped to network node location.
5. upgrade individual extreme value p idwith global extremum p gd.Individual extreme value is position corresponding to this particle self history maximum adaptation value, and global extremum is position corresponding to all particle history maximum adaptation values.
6. repeated execution of steps 4-5 is until reach maximum iteration time.
7., when reaching maximum iteration time, select global extremum p gdposition as main leader cluster node position.
The flow process of optimum secondary bunch head selection course as shown in Figure 4; Transmit according to secondary leader cluster node the adaptive value function g that energy consumption minimized criterion selects to draw, repeat above-mentioned steps 1-8 and select global extremum p gdposition as secondary leader cluster node position, wherein the adaptive value function of secondary leader cluster node is
g＝εg 1+(1-ε)g 2
g 1 = E ( c ) / Σ i = 1 k E ( i )
g 2 = d ctoBS / Σ i = 1 k d itoBS
The main leader cluster node utilizing above-mentioned particle swarm optimization algorithm to select broadcast its elected message to bunch in ordinary node complete collection and the fusion of data, then send the data to secondary leader cluster node.
Four, data transfer phase
Multi-hop mode between data transfer phase of the present invention adopts bunch, first each secondary leader cluster node calculates the distance of its distance aggregation node, then the size of the Distance geometry TH of more secondary leader cluster node distance aggregation node, described TH is a threshold value preset, its value is always less than the maximum broadcasting area of node, and the value of TH can obtain according to Multi simulation running the optimal parameter being applicable to native system.If the distance of secondary leader cluster node distance aggregation node is less than TH, then secondary leader cluster node by direct for data single-hop transmission to aggregation node; When the distance of secondary leader cluster node distance aggregation node is greater than TH, other the secondary leader cluster nodes selecting dump energy more as down hop, by data through repeatedly transferring to aggregation node.
In order to verify this method for routing validity, use emulation tool matlab to emulate, select 100 nodes to be randomly dispersed in the region of 100 × 100m2, all node primary powers are 0.5J.This method and LEACH, PSO-MV algorithm are contrasted, network often takes turns surviving node number as shown in Figure 5, and simulation result shows the result that this method is better than LEACH, PSO-MV algorithm, achieves good result.
In addition to the implementation, the present invention can also have other execution modes, and all employings are equal to the technical scheme of replacement or equivalent transformation formation, all drop in the protection range of application claims.

Claims (1)

1. a two bunch head wireless sensor network routing method, it is characterized in that, the method comprises the following step:
1) carry out netinit, in monitored area, random placement is N number of has identical primary power, ID numbering from the ordinary node of 0 ~ N, and aggregation node is deployed in certain of network surrounding;
2) interim sub-clustering is carried out: all ordinary node self-energy information and positional information are sent to aggregation node, aggregation node is according to the ordinary node information collected, calculate the average energy of all ordinary nodes, and be greater than Stochastic choice ordinary node the ordinary node of average energy from dump energy and become interim leader cluster node; The interim leader cluster node that all successes are elected to is with certain power broadcasts message, and whether each interim leader cluster node is observed in its communication radius exists other interim leader cluster nodes; If there are other interim leader cluster nodes to exist, then the interim leader cluster node selecting energy maximum continues as interim leader cluster node, and the interim leader cluster node that other energy are little is abandoned being elected to, and becomes ordinary node; Final elected interim leader cluster node broadcasts its elected message, and ordinary node receives the message of interim leader cluster node broadcast, according to the power of its Received signal strength, selects the strongest interim leader cluster node of signal to add in its bunch; Elected interim leader cluster node to collect bunch in the position of ordinary node and energy information;
3) selection of optimum main leader cluster node is carried out: based on the energy consumption minimized criterion of collection, the adaptive value function f that optimum main leader cluster node is chosen is:
f＝αf 1+βf 2+γf 3
f 1 = E ( c ) / Σ i = 1 k E ( i )
f 2 = ( k - 1 ) / Σ i = 1 k d i t o c
f 3＝(d max-d)/d max
Wherein, k be bunch in ordinary node number, E (i) is the energy of ordinary node i, and E (c) is the leader cluster node energy at node place bunch, f 1represent that leader cluster node energy accounts for a bunch ratio for interior nodes gross energy; d itocthe distance of ordinary node i apart from the leader cluster node of affiliated bunch, f 2in representing bunch, ordinary node is to the inverse of leader cluster node average distance, f 2larger represent leader cluster node distance bunch in ordinary node average distance less; d maxbe the ultimate range of ordinary node to regional center that position is in edge, d is the distance of ordinary node i to regional center, f 3larger to represent ordinary node i distance areas center nearer, is more beneficial to data acquisition and sends data to secondary leader cluster node; α, beta, gamma is weight coefficient, alpha+beta+γ=1;
4) choosing of secondary leader cluster node is carried out based on the energy consumption minimized criterion of transmission: the adaptive value function g that secondary leader cluster node is chosen is:
g＝εg 1+(1-ε)g 2
g 1 = E ( c ) / Σ i = 1 k E ( i )
g 2 = d c t o B S / Σ i = 1 k d i t o B S
Wherein, k be bunch in ordinary node number, E (i) is the energy of ordinary node i, and E (c) is the leader cluster node energy at node place bunch, g 1represent that leader cluster node energy accounts for a bunch ratio for interior nodes gross energy; d ctoBSthe distance of leader cluster node to aggregation node, d itoBSthe distance of ordinary node i to aggregation node, g 2represent that leader cluster node accounts for the ratio of bunch interior nodes to aggregation node distance summation, g to the distance of aggregation node 2the larger leader cluster node that represents is less apart from the distance of aggregation node; ε is weight coefficient, 0 ﹤ ε ﹤ 1;
5) data transfer phase adopt bunch between multi-hop mode, first each secondary leader cluster node calculates the distance of its distance aggregation node, then this secondary leader cluster node distance distance of aggregation node and size of TH value is compared, described TH value is a threshold value preset, its value is always less than the maximum broadcasting area of node, if the distance of secondary leader cluster node distance aggregation node is less than TH value, then data are directly transferred to aggregation node in single-hop mode by secondary leader cluster node; When the distance of secondary leader cluster node distance aggregation node is greater than TH value, data multi-hop mode between repeatedly transmission is bunch, as down hop target, is delivered to aggregation node by more other the secondary leader cluster nodes of this secondary cluster-head node selection dump energy.
CN201310068782.8A 2013-03-05 2013-03-05 Two bunches of head wireless sensor network routing methods Expired - Fee Related CN103269507B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310068782.8A CN103269507B (en) 2013-03-05 2013-03-05 Two bunches of head wireless sensor network routing methods

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310068782.8A CN103269507B (en) 2013-03-05 2013-03-05 Two bunches of head wireless sensor network routing methods

Publications (2)

Publication Number Publication Date
CN103269507A CN103269507A (en) 2013-08-28
CN103269507B true CN103269507B (en) 2016-02-10

Family

ID=49013108

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310068782.8A Expired - Fee Related CN103269507B (en) 2013-03-05 2013-03-05 Two bunches of head wireless sensor network routing methods

Country Status (1)

Country Link
CN (1) CN103269507B (en)

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103781146A (en) * 2014-01-22 2014-05-07 南昌大学 Wireless sensor network optimal route path establishing method based on ant colony algorithm
CN104980990A (en) * 2014-04-08 2015-10-14 中国科学院声学研究所 Potential field path searching method for new energy wireless sensor network
CN104320484B (en) * 2014-11-05 2017-07-28 河海大学常州校区 A kind of task immigration method in wireless sensor network based on integration incentive mechanism
CN104661274B (en) * 2014-12-10 2019-07-12 北京邮电大学 The non-homogeneous clustering method of wireless sensor network
CN105898897A (en) * 2014-12-15 2016-08-24 江南大学 Method for selecting cluster head of sensor network by using improved ant colony optimization
CN104994557B (en) * 2015-06-19 2018-08-14 长春理工大学 Cluster algorithm based on dynamic grid and data fusion
CN105263147A (en) * 2015-11-25 2016-01-20 中国联合网络通信集团有限公司 Base station regulation method and equipment
CN105682170A (en) * 2016-03-14 2016-06-15 南京邮电大学 Clustering-type wireless sensor network data collection method based on energy consumption balance
CN106028416B (en) * 2016-05-03 2018-12-25 中南大学 The improvement clustering method of communication pattern double adaptive between a kind of cluster range and cluster
CN105848267B (en) * 2016-05-13 2019-05-21 江苏科技大学 Based on energy consumption minimized serial energy-collecting method
CN105848266B (en) * 2016-05-13 2019-05-17 江苏科技大学 Energy consumption minimized multi-antenna communication network circulating energy acquisition method
WO2018000185A1 (en) * 2016-06-28 2018-01-04 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for determining cluster-heads
CN108288353A (en) * 2017-12-25 2018-07-17 韦德永 A kind of mountain landslide supervision early warning system based on wireless sensor network
CN108307444B (en) * 2018-01-19 2020-12-04 扬州大学 Wireless sensor network unmanned aerial vehicle system communication method based on optimized particle swarm optimization algorithm
CN108419304A (en) * 2018-03-29 2018-08-17 深圳智达机械技术有限公司 A kind of wireless sensor network (WSN) water quality monitoring system
CN108882258B (en) * 2018-09-18 2021-07-27 天津理工大学 Wireless sensor network-oriented neighbor rotation hierarchical clustering method
CN109444361A (en) * 2018-10-24 2019-03-08 深圳众宝城贸易有限公司 Water quality remote based on wireless sensor network and big data is checked and early warning system
CN109495944B (en) * 2018-12-24 2021-07-23 广东理致技术有限公司 Wireless sensor network double-cluster-head communication method and device
CN109885116B (en) * 2019-03-12 2020-08-25 中国林业科学研究院资源信息研究所 Internet of things platform monitoring system and method based on cloud computing
CN110519820B (en) * 2019-08-27 2021-06-15 中科芯(苏州)微电子科技有限公司 Routing method applied to cluster unmanned aerial vehicle communication
CN111148179B (en) * 2019-12-17 2021-08-24 华东交通大学 Three-dimensional WSN node deployment method based on NB-IoT hillside orchard
CN111526555B (en) * 2020-05-25 2022-07-26 南京邮电大学 Multi-hop routing path selection method based on genetic algorithm
CN113395660B (en) * 2021-06-18 2022-05-13 河南大学 WSNs mobile convergence node self-adaptive position updating energy consumption optimization method based on tree
CN114125759A (en) * 2021-11-29 2022-03-01 南京华苏科技有限公司 Wireless sensor network clustering method based on improved particle swarm

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102014455A (en) * 2010-11-23 2011-04-13 北京航空航天大学 Wireless sensor network clustering routing method based on correlation among nodes

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100646824B1 (en) * 2005-10-14 2006-11-23 전자부품연구원 Method for controlling data transmission based on tdma in a wireless network system including a plurality of nodes, sensor network using the same and computer-readable medium having thereon a program performing function embodying the same

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102014455A (en) * 2010-11-23 2011-04-13 北京航空航天大学 Wireless sensor network clustering routing method based on correlation among nodes

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
A Double Heads Static Cluster Algorithm for Wireless Sensor Networks;Xiao Yi等;《IEEE》;20101231;全文 *
Double Cluster-heads Routing Policy Based on the Weights of Energy-efficient for Wireless Sensor Networks;Mei Lin等;《IEEE》;20101231;全文 *
PSO-based Energy-balanced Double Cluster-heads Clustering Routing for wireless sensor networks;Hu Yua等;《Procedia Engineering》;20111231;全文 *
基于PSO 的无线传感器网络双簇头分簇算法;韩冬雪等;《计算机工程》;20100531;第36卷(第10期);全文 *
基于粒子群的WSN低能耗路由协议的研究;王晓慧;《中国优秀硕士学位论文全文数据库 信息科技辑》;20121015;全文 *

Also Published As

Publication number Publication date
CN103269507A (en) 2013-08-28

Similar Documents

Publication Publication Date Title
CN103269507B (en) Two bunches of head wireless sensor network routing methods
Wang et al. Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs
CN108882258B (en) Wireless sensor network-oriented neighbor rotation hierarchical clustering method
CN104410997B (en) A kind of clustering topology construction method for wireless sensor network
CN102497679B (en) Static clustering algorithm for wireless sensor network
CN104284386B (en) Wireless sensor network cluster head selection method based on betweenness
CN104320796A (en) Wireless sensor network data transmission method based on LEACH protocol
CN103916942A (en) LEACH protocol improvement method capable of lowering energy consumption
CN107295541A (en) A kind of radio sensing network coverage optimization method based on fictitious force and glowworm swarm algorithm
CN102333321B (en) Layered-structure-based topology control method for dynamic wireless sensor network
Wan et al. AHP based relay selection strategy for energy harvesting wireless sensor networks
CN103281704A (en) Method for deploying wireless sensor network in deterministic space based on three-dimensional sensing
CN108566664A (en) A kind of WSN clustering routing optimization methods of distribution high energy efficiency
CN102438291A (en) Data aggregation method for increasing capacity of wireless sensor network
CN104411000A (en) Method for selecting cluster head of hierarchical routing protocol in wireless sensor network
CN104065574A (en) Uneven clustering routing method inside wireless sensor network layer
CN102630086B (en) Gabriel graph-based data communication method of wireless sensor network
Chen et al. A clustering protocol for wireless sensor networks based on energy potential field
Kamath Energy efficient routing protocol for wireless sensor networks
Lin et al. Maximum data collection rate routing for data gather trees with data aggregation in rechargeable wireless sensor networks
CN103987102A (en) Topology control method of underwater wireless sensor network based on non-cooperative game
CN105307230A (en) Three-dimensional mine hybrid routing algorithm based on greedy thought
CN102983948A (en) Adaptive clustering transmission method and device for wireless sensor network
CN103702384B (en) Application-oriented clustering routing method of wireless sensor network
CN107743302A (en) Rate-allocation and route combined optimization algorithm in wireless sensor network based on compressed sensing

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

Termination date: 20190305

CF01 Termination of patent right due to non-payment of annual fee