CN106937352A - Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm - Google Patents

Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm Download PDF

Info

Publication number
CN106937352A
CN106937352A CN201511016528.9A CN201511016528A CN106937352A CN 106937352 A CN106937352 A CN 106937352A CN 201511016528 A CN201511016528 A CN 201511016528A CN 106937352 A CN106937352 A CN 106937352A
Authority
CN
China
Prior art keywords
node
cluster
message
mobile sink
cluster head
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
CN201511016528.9A
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.)
Yangzhou University
Original Assignee
Yangzhou 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 Yangzhou University filed Critical Yangzhou University
Priority to CN201511016528.9A priority Critical patent/CN106937352A/en
Publication of CN106937352A publication Critical patent/CN106937352A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02Power saving arrangements
    • H04W52/0209Power saving arrangements in terminal devices
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing 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 present invention proposes a kind of wireless sensor network data transmission method with mobile sink node, wireless sensor network is divided into several regions with particle cluster algorithm, a sensor node is selected in the sensor node in each region as cluster head using similar clustering algorithm, the cluster head communicated with mobile sink node is then determined by three kinds of data messages of Hello, Message-s and Message-h message.This invention removes the phenomenon of Energy volution, network traffic load is alleviated, improve the handling capacity of whole wireless sensor network, extend the life cycle of sensor network.

Description

Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm
Technical field
The invention belongs to wireless sensor network technology field, and in particular to a kind of wireless biography based on mobile sink node Sense network data transmission method.
Background technology
With the high speed development of information technology, effective information immediately of grasping has vital effect to people.Cause And the means and technology for collecting information and date have obtained extensive exploitation and application, many emerging information gathering techniques and plan Slightly also it is born therewith.Wireless sensor network (wireless sensor networks, WSN) is exactly presently most popular number According to one of collection technique.Wireless sensor network node has many advantages, such as:Energy ezpenditure is low, be easy to be distributed in any environment in, Cost is cheap and wireless network etc. can be formed with self-organizing.These advantages perceive wireless messages becomes unprecedented with collection It is simple with it is convenient.Therefore, it perceives field and causes a change in current wireless messages, and wireless sensor network is existing Grow directly from seeds it is living in be widely used, have to the detection of surrounding environment very high answering such as in terms of temperature, pressure, positioning Use prospect.
Wireless sensor network as an entirety, in order to ensure can mutually to transmit letter between each sensor node Breath, generally disposes substantial amounts of sensor node in monitored area, ensures to communicate with redundancy, and do so can avoid wireless senser Network is divided into several isolated networks and cannot complete communication.Typical wireless sensor network is passed by the static state of dense deployment Sensor node and a static aggregation node, each static sensor node pass the data to static convergence by the way of multi-hop Node.Multi-hop communication mode also brings some problems while sensor node energy is saved, for example:Apart from aggregation node Nearer sensor node will also forward the data of other sensor nodes while oneself data is sent, and these distances are converged The energy ezpenditure of the nearer sensor node of node can be faster than other sensor nodes, Energy volution phenomenon is formed, so that earlier Ground is dead, it is impossible to forward other sensor node datas, causes substantial amounts of sensor node to play it and acts on, final to cause Whole wireless sensor network is in failure state.Therefore, one can be set in monitored area can be with mobile sink node (Sink), when mobile sink node moves to one place, the order of collection information is issued by, receives the sensor node of order If in the range of the single-hop of mobile mobile sink node, just sending the data to mobile mobile sink node, due to being that single-hop is led to Letter, the sensor node need not forward the data of other sensor nodes so as to save energy, extend whole wireless biography Sensor Network morals.Meanwhile, the change over time of sensor node near mobile sink node and change, at certain The energy ezpenditure of whole wireless sensor network is balanced in the degree of kind, static aggregation node has been compared and substantially prolongs wireless biography Sensor Network morals.
At present, the Routing Protocol based on mobile sink node is consumed and extension radio sensing network Life Cycle in equilibrium energy Phase achieves good effect, but still there are some defects, for example:First, some are based on the route of mobile sink node Agreement uses random movement strategy, increased data acquisition route maintenance expense, can consume big energy;Second, some are based on The Routing Protocol of mobile sink node does not account for divided grid number or number of clusters using grid division or the method for sub-clustering Whether it is optimal, sensor node can waste many unnecessary energy in communication process;3rd, moved in some Routing Protocols Dynamic aggregation node continually removes adaptive region, and its positional information then needs to be flooded in whole network, location updating meeting Produce larger energy consumption and time delay.
The content of the invention
It is an object of the invention to propose a kind of wireless sensor network data transmission method with mobile sink node, The phenomenon of Energy volution is eliminated, network traffic load is alleviated, the handling capacity of whole wireless sensor network is improve, extended The life cycle of sensor network.
In order to solve the above-mentioned technical problem, the present invention proposes a kind of wireless sensor network number with mobile sink node According to transmission method, wireless sensor network is divided into several regions with particle cluster algorithm, is existed using similar clustering algorithm A sensor node is selected in the sensor node in each region as cluster head, then by Hello, Message-s and Three kinds of data messages of Message-h messages determine the cluster head communicated with mobile sink node.
It is preferred that the method for selecting cluster head is:
S1 calculates the barycentric coodinates of the cluster region according to the coordinate of each sensor node in each cluster, calculates in cluster Distance of each sensor node to barycentric coodinates;The average residual energy of all the sensors node in each cluster is calculated simultaneously;
S2 remains the average of all the sensors node in the dump energy of the sensor node nearest with centroidal distance and cluster Complementary energy is compared, if the dump energy of the sensor node is more than or equal to the average residual energy, will be described Sensor node elects cluster head as;Otherwise, the sensor node is abandoned;
S3 finds out the next and nearest sensor node of centroidal distance in remaining each sensor node, then repeats Step S2.
It is preferred that mobile sink node broadcasts Hello message packages in moving process, the cluster head meter of Hello bags is received The average residual energy of its cluster inner sensor node is calculated, and the regional number and own location information corresponding to its cluster are put into Mobile sink node is returned in Hello bags;The Hello message packages that mobile sink node passes through to receive compare the average of each cluster Dump energy, the maximum cluster of selection average residual energy carries out data transmission.
It is preferred that when mobile sink node carries out data transmission with cluster head, mobile sink node broadcast Message-s message Bag, Message-s message packages include the regional number where selected cluster head;The cluster head for receiving Message-s bags compares Whether the regional number and the regional number of oneself in Message-s bags are identical, if it is different, abandoning the Message-s bags;If phase Together, then slot table is distributed according to time division multiple access method to remaining sensor node broadcasts information in cluster;Remaining sensor section in cluster Point sends Message-h packets to the cluster head of oneself in time division multiple access method distribution slot table gives the time slot of oneself, Remaining time closes the radio station of oneself, the state in dormancy;Cluster head carries out data accumulation to all data messages being collected into And fusion;When mobile sink node is moved near the cluster head, the cluster head conveys data to mobile sink node.
Compared with prior art, its remarkable advantage is the present invention, (1) when network virtual sub-clustering is built, agreement Bian Particle cluster algorithm thought is used, several virtual clusters in a balanced way is built, and consider the residual energy of each cluster group uniformity and node Amount, therefore, Routing Protocol of the present invention can while overall energy consumption is reduced as far as possible balanced each node energy consumption;(2) in every wheel According to the calculation of similar cluster during communication, cluster head is selected with reference to the average energy of the centroidal distance from cluster and cluster interior nodes, made with this Node on each cluster balancedly consumed energy;(3) directly communicated in view of mobile sink node and each cluster head, reduce net The time delay of network.
Brief description of the drawings
Fig. 1 is to be applicable wireless sensor network schematic diagram of the invention;
Fig. 2 is Hello data messages structural representation of the present invention;
Fig. 3 is Message-s data message structural representations in the present invention;
Fig. 4 is Message-h data message structural representations in the present invention.
Specific embodiment
It is readily appreciated that, according to technical scheme, in the case where connotation of the invention is not changed, this area Those skilled in the art can imagine wireless sensor network data transmission method of the present invention with mobile sink node Numerous embodiments.Therefore, detailed description below and accompanying drawing are only the exemplary illustrations to technical scheme, and It is not to be construed as whole of the invention or is considered as limitation or restriction to technical solution of the present invention.
Wireless sensor network data transmission method of the present invention with mobile sink node, first, calculates with population Wireless sensor network is divided into several regions by method, is selected in the sensor node in each region using similar clustering algorithm Go out a sensor node as cluster head, with reference to the distance and cluster institute of sensor node and cluster region center of gravity when determining cluster head In the size of region inner sensor residue energy of node;Then three kinds of numbers of Hello, Message-s and Message-h message are passed through According to the cluster head that message determines to be communicated with mobile sink node.
First, sub-clustering
Step A, virtual cluster division is carried out to wireless sensor network using particle cluster algorithm:
Assuming that whole wireless sensor network has N number of sensor node, whole wireless sensor network is split in plan It is M cluster, then contains N/M sensor node in each cluster.Before sub-clustering, in wireless sensor network all the sensors node to The state message information of base station broadcast oneself, including positional information and energy information;After base station receives state message information, according to The positional information and energy information of each sensor node carry out sub-clustering using particle cluster algorithm to network.Detailed process is:
First, whole wireless sensor network is divided into identical sensor node number purpose region with cut-off rule, The cut-off rule expression is as shown in formula (1):
L=(x, y, θxy) (1)
In formula (1), x, y, θxyRespectively four parameters of particle, (x, y) is the sensor section on cut-off rule The abscissa and ordinate of point;θxIt is cut-off rule and the angle of x-axis;θyIt is cut-off rule and the angle of y-axis;
Four stochastic parameters to cut-off rule assign K class values, determine K cut-off rule by formula (1) altogether.
Then, top is gone to determine an optimal cut-off rule in K cut-off rule using particle cluster algorithm, process is:
S1, defines K particle, and K particle represents K cut-off rule;Determine K different adaptive value F, searched for last time To minimum adaptive value F be compared and take minimum value, particle corresponding with minimum value can be as global extremum ρgd;Together Reason, compares the adaptive value of single particle, takes the corresponding particle of minimum adaptive value as individual extreme value ρid, then updated by following formula Four parameters;
Xxid(t+1)=Xxid(t)+Vxid(t)
Xyid(t+1)=Xyid(t)+Vyid(t) (2)
Wherein, Xxid, XyidIt is the position of particle;XθidIt is cut-off rule and the angle of x-axis;Vxid, Vyid, VθidIt is particle in x, y,θxySearch speed on four dimensions, t is iterations, can be determined by following formula:
Vxid(t+1)=ω Vxid(t)+c1rand()(ρid(t)-Xxid(t))+c2rand()(ρgd(t)-Xxid(t))
Vyid(t+1)=ω Vyid(t)+c1rand()(ρid(t)-Xyid(t))+c2rand()(ρgd(t)-Xyid(t))
(3)
Wherein, c1, c2It is Studying factors, usual c1=c2=2;Rand () is the random number between (0,1);ρidIt is part Minimum adaptive value;ρgdIt is global minima adaptive value;ω is weight factor.
S2, particle obtains new (x, y, θxy) after, substitute into formula (1) and scan for, until it is 0 to meet formula (4) value Or exited when reaching maximum search number of times.Now can entirely wireless sensor network sensing region by optimum segmentation into two The equal subregion of scale.
Wherein, ci(i=1,2) is the interstitial content in the i of wireless sensor network sensing region, MiIt is the desired clusters of region i Cephalomere is counted out, EsumIt is the gross energy of sensor node, EiIt is sensor node gross energy in the i of region.
S3, after whole wireless sensor network sensing region is divided into the equal subregion of two scales first, repeats Step S1 and S2, until whole wireless sensor network sensing region is divided into M sub-regions, obtain M cluster.
2nd, cluster head is selected
After sensor network is divided into M cluster, a cluster head need to be selected in each cluster.Detailed process is:
First, the coordinate according to each sensor node in each cluster (region) calculates the barycentric coodinates (X in the regionc, Yc), computational methods such as formula (6),
Wherein, (xi,yi) it is the coordinate of each sensor node in cluster.
Secondly each sensor node in cluster to the distance of center of gravity node, is calculated, if the coordinate of interior each sensor node of cluster It is (xi,xj), then node is shown in formula (7) to the computational methods apart from d of center of gravity,
Finally, for K cluster, the average residual energy of all the sensors node in each cluster is calculated respectively, take out and weight The closest sensor node of the heart, then by the dump energy of this sensor node with cluster all the sensors node it is average Dump energy is compared, if this sensor node dump energy is more than or equal to all the sensors node average residual energy in cluster Amount, then this elects this sensor node as cluster head;Otherwise, the sensor node is abandoned, is taken out next nearest with centroidal distance Sensor node carry out foregoing comparing, own more than in cluster until finding out a sensor node and meeting itself dump energy Untill the average residual energy of sensor node, this sensor node is elected to cluster head;
3rd, access of the mobile sink section to cluster head
After mobile sink node has accessed all of cluster head, then one DTD is taken turns, in order to balance network energy consumption, Needs select cluster head again in each cluster, carry out the data transfer of next round.Aggregation node has access to each round of all cluster heads Data transfer cycle is T, and the computational methods of cycle T are shown in formula (8),
Wherein, wherein (xi,yi) it is cluster head coordinate, k is the number of cluster head, and V is the translational speed of mobile sink node.
So, a radio sensing network just builds and completes.
Mobile sink node realizes data transfer by with step in the present invention:
1st, the move mode of mobile sink node:
When mobile sink node near sub-clustering it is interval when, mobile sink node still receives and sends data; Mobile sink node is broadcast the message using energy-controllable shift strategy and in the range of Hop-bounded;
2nd, mobile sink node broadcast message bag, will proceed as follows:
Mobile sink node broadcasts Hello message packages, receives the average residual energy that the cluster head of Hello bags is calculated in its cluster Amount, and the regional number and own location information corresponding to its cluster are put into Hello bags, return again to mobile sink node;
Mobile sink node compares the average residual energy of each cluster by Hello bags, and selection average residual energy is maximum Cluster carry out data transmission;
3rd, when mobile sink node and cluster head carry out data transmission, will proceed as follows:
Mobile sink node broadcasts Message-s message packages, and Message-s message packages include the region where selected cluster head Number;
Receive regional number that the cluster head of Message-s bags compares in Message-s bags and the regional number of oneself whether phase Together, if it is different, abandoning the Message-s bags;If the same proceed as follows:
To remaining general sensor nodes surrounding broadcast information in the cluster, slot table is distributed according to time division multiple access method;
Member's collection information in cluster, and in time division multiple access method distribution slot table gives the time slot of oneself, send Message-h packets give the cluster head of oneself, the radio station of oneself are closed in remaining time, the state in dormancy;
All of data message of the cluster head immediately to being collected into carries out the accumulation and fusion of data, and individual signals are synthesized into one Individual overall signal, the incoherent noise between can so strengthening common signal and weakening signal;
When mobile sink node is moved near cluster head, the cluster head conveys data to mobile sink node.

Claims (4)

1. a kind of wireless sensor network data transmission method with mobile sink node, it is characterised in that use population Wireless sensor network is divided into several regions by algorithm, using similar clustering algorithm in the sensor node in each region A sensor node is selected as cluster head, then by three kinds of data messages of Hello, Message-s and Message-h message It is determined that the cluster head communicated with mobile sink node.
2. there is the wireless sensor network data transmission method of mobile sink node as claimed in claim 1, it is characterised in that The method for selecting cluster head is:
S1 calculates the barycentric coodinates of the cluster region according to the coordinate of each sensor node in each cluster, calculates and is respectively passed in cluster Distance of the sensor node to barycentric coodinates;The average residual energy of all the sensors node in each cluster is calculated simultaneously;
S2 is by the average residual energy of all the sensors node in the dump energy of the sensor node nearest with centroidal distance and cluster Amount is compared, if the dump energy of the sensor node is more than or equal to the average residual energy, by the sensing Device node elects cluster head as;Otherwise, the sensor node is abandoned;
S3 finds out the next and nearest sensor node of centroidal distance in remaining each sensor node, then repeat step S2。
3. there is the wireless sensor network data transmission method of mobile sink node as claimed in claim 1, it is characterised in that Mobile sink node broadcasts Hello message packages in moving process, and the cluster head for receiving Hello bags calculates its cluster inner sensor section The average residual energy of point, and the regional number and own location information corresponding to its cluster are put into shifting is returned in Hello bags Dynamic aggregation node;Mobile sink node compares the average residual energy of each cluster by the Hello message packages for receiving, and selection is average The maximum cluster of dump energy carries out data transmission.
4. there is the wireless sensor network data transmission method of mobile sink node as claimed in claim 1, it is characterised in that When mobile sink node carries out data transmission with cluster head, mobile sink node broadcast Message-s message packages, Message-s disappears Breath bag includes the regional number where selected cluster head;Receive the regional number that the cluster head of Message-s bags compares in Message-s bags It is whether identical with the regional number of oneself, if it is different, abandoning the Message-s bags;If identical, to remaining sensor in cluster Node broadcasts information, slot table is distributed according to time division multiple access method;Remaining sensor node is distributed in time division multiple access method in cluster Slot table sends Message-h packets to the cluster head of oneself in giving the time slot of oneself, and the electricity of oneself is closed in remaining time Platform, the state in dormancy;Cluster head carries out data accumulation and fusion to all data messages being collected into;Work as mobile sink node Move to when near the cluster head, the cluster head conveys data to mobile sink node.
CN201511016528.9A 2015-12-29 2015-12-29 Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm Pending CN106937352A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201511016528.9A CN106937352A (en) 2015-12-29 2015-12-29 Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201511016528.9A CN106937352A (en) 2015-12-29 2015-12-29 Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm

Publications (1)

Publication Number Publication Date
CN106937352A true CN106937352A (en) 2017-07-07

Family

ID=59441464

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201511016528.9A Pending CN106937352A (en) 2015-12-29 2015-12-29 Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm

Country Status (1)

Country Link
CN (1) CN106937352A (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107994948A (en) * 2017-12-30 2018-05-04 山东省科学院海洋仪器仪表研究所 A kind of mobile Sink paths planning methods for underwater heterogeneous sensor network
CN108171955A (en) * 2018-03-03 2018-06-15 深圳森阳环保材料科技有限公司 A kind of air pollution real-time monitoring system based on big data and WSN technology
CN108307444A (en) * 2018-01-19 2018-07-20 扬州大学 Wireless sense network UAV system communication means based on optimization particle cluster algorithm
CN108712760A (en) * 2018-03-29 2018-10-26 北京邮电大学 High-throughput relay selection method based on random Learning Automata and fuzzy algorithmic approach
CN108770033A (en) * 2018-05-08 2018-11-06 扬州大学 The improved clustering method of motion track is fixed based on mobile sink node
CN109120832A (en) * 2018-10-22 2019-01-01 泉州兴哲商贸有限公司 Equipment bearing vibration data acquires in real time and analysis system
CN109195132A (en) * 2018-09-10 2019-01-11 广州小楠科技有限公司 Air quality information intelligent acquisition and real-time broadcasting system
CN109219011A (en) * 2018-09-10 2019-01-15 广州市花林景观工程有限公司 The water quality health intelligent in freshwater fish culturing region monitors system
CN109407735A (en) * 2018-12-04 2019-03-01 深圳桓轩科技有限公司 A kind of smart home of real-time monitoring environment
CN112188584A (en) * 2020-09-16 2021-01-05 中山火炬职业技术学院 Wireless sensor network multi-hop clustering method and system based on gravity center method
CN112884302A (en) * 2021-02-01 2021-06-01 杭州市电力设计院有限公司 Electric power material management method

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107994948A (en) * 2017-12-30 2018-05-04 山东省科学院海洋仪器仪表研究所 A kind of mobile Sink paths planning methods for underwater heterogeneous sensor network
CN107994948B (en) * 2017-12-30 2023-04-28 山东省科学院海洋仪器仪表研究所 Mobile Sink path planning method for underwater heterogeneous sensor network
CN108307444A (en) * 2018-01-19 2018-07-20 扬州大学 Wireless sense network UAV system communication means based on optimization particle cluster algorithm
CN108307444B (en) * 2018-01-19 2020-12-04 扬州大学 Wireless sensor network unmanned aerial vehicle system communication method based on optimized particle swarm optimization algorithm
CN108171955A (en) * 2018-03-03 2018-06-15 深圳森阳环保材料科技有限公司 A kind of air pollution real-time monitoring system based on big data and WSN technology
CN108712760A (en) * 2018-03-29 2018-10-26 北京邮电大学 High-throughput relay selection method based on random Learning Automata and fuzzy algorithmic approach
CN108712760B (en) * 2018-03-29 2019-11-19 北京邮电大学 High-throughput relay selection method based on random Learning Automata and fuzzy algorithmic approach
CN108770033A (en) * 2018-05-08 2018-11-06 扬州大学 The improved clustering method of motion track is fixed based on mobile sink node
CN109219011B (en) * 2018-09-10 2021-12-17 广州市花林景观工程有限公司 Intelligent monitoring system for water quality health of freshwater fish culture area
CN109195132A (en) * 2018-09-10 2019-01-11 广州小楠科技有限公司 Air quality information intelligent acquisition and real-time broadcasting system
CN109219011A (en) * 2018-09-10 2019-01-15 广州市花林景观工程有限公司 The water quality health intelligent in freshwater fish culturing region monitors system
CN109120832A (en) * 2018-10-22 2019-01-01 泉州兴哲商贸有限公司 Equipment bearing vibration data acquires in real time and analysis system
CN109407735A (en) * 2018-12-04 2019-03-01 深圳桓轩科技有限公司 A kind of smart home of real-time monitoring environment
CN112188584A (en) * 2020-09-16 2021-01-05 中山火炬职业技术学院 Wireless sensor network multi-hop clustering method and system based on gravity center method
CN112884302A (en) * 2021-02-01 2021-06-01 杭州市电力设计院有限公司 Electric power material management method
CN112884302B (en) * 2021-02-01 2024-01-30 杭州市电力设计院有限公司 Electric power material management method

Similar Documents

Publication Publication Date Title
CN106937352A (en) Mobile sink node Wireless Sensor Network Routing Protocol based on particle cluster algorithm
CN104038965B (en) Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network
CN107548029A (en) AUV methods of data capture in a kind of underwater sensing network based on sea water stratification
CN102547918A (en) Non-ranging-based wireless sensor network three-dimensional node positioning method
Cirstea Energy efficient routing protocols for Wireless Sensor Networks: A survey
CN104394566A (en) Fuzzy decision-based low-power dissipation self-adaption clustering multihop wireless sensor network topology control method
CN103686922A (en) Optimization method for survival time of multi-Sink-node movement wireless sensor network
CN104469879B (en) A kind of dynamic k value cluster routing methods
CN105072661A (en) Clustering multi-hop routing protocol of wireless sensor network
CN103298055A (en) Space grid region division based greedy routing method in underwater sensor network
CN106817739A (en) A kind of wireless sensor and actor networks based on mobile sink node Energy Efficient are by agreement
Manzoor et al. Enhanced TL-LEACH routing protocol for large-scale WSN applications
CN108174411A (en) Wireless sensor network routing method based on fuzzy logic
CN107371188A (en) A kind of energy consumption balance method for routing of controllable cluster scale
CN104994020A (en) Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model
CN108112050A (en) Energy balance and deep-controlled Routing Protocol based on underwater wireless sensing network
Yalçın et al. BTA-MM: Burst traffic awareness-based adaptive mobility model with mobile sinks for heterogeneous wireless sensor networks
Li et al. An energy-efficient routing protocol based on particle swarm clustering algorithm and inter-cluster routing algorithm for WSN
CN107612806A (en) Energy of wireless sensor network based on mobile sink node perceives the method for data capture with path architecture
Rajput et al. Fuzzy-based clustering scheme with sink selection algorithm for monitoring applications of wireless sensor networks
CN103747498B (en) Direction angle-based wireless sensor network routing void optimization method
Chen et al. A clustering protocol for wireless sensor networks based on energy potential field
CN102547977A (en) Sensor network positioning method based on hop counts
CN106161118A (en) In a kind of wireless sense network, the k of balancing energy jumps cluster routing method
Rady et al. Joint nodes and sink mobility based immune routing-clustering protocol for wireless sensor networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20170707

RJ01 Rejection of invention patent application after publication