CN101715243B - Wireless sensor network hierarchical cluster-based routing method - Google Patents
Wireless sensor network hierarchical cluster-based routing method Download PDFInfo
- Publication number
- CN101715243B CN101715243B CN2009101849325A CN200910184932A CN101715243B CN 101715243 B CN101715243 B CN 101715243B CN 2009101849325 A CN2009101849325 A CN 2009101849325A CN 200910184932 A CN200910184932 A CN 200910184932A CN 101715243 B CN101715243 B CN 101715243B
- Authority
- CN
- China
- Prior art keywords
- bunch
- node
- layer
- network
- oneself
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
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 provides a wireless sensor network hierarchical cluster-based routing method. The basic system composition comprises a common node, a relay node, a source node, a convergent node and a cluster head. The method is implemented by combining clustering thought with a multiple-hop mode, and providing a novel hierarchical cluster-based routing algorithm to improve the defects of LEACH protocol. The clustering mode can reduce network delay and is the optimized energy use efficiency mode, and the multiple-hop mode can fully exert the action of data amalgamation to reduce data amount. The nodes in the network are divided into a plurality of levels to be combined with the clustering method, and simultaneously an in-cluster cluster head alternation mechanism is adopted to enhance survival time of the network.
Description
Technical field
The present invention relates to a kind of hierarchy type cluster routing method of wireless sensor network.This method sensing data transmits in time, accurately and efficiently and provides safeguard, and belongs to the crossing domain of sensor network technique and wireless communication technology.
Background technology
The development that wireless sensor network technology is accompanied by technology such as the communication technology, microsystems technology, computing technique produces, the information of monitoring target has broad application prospects in fields such as traffic, military affairs, medical treatment in its perception collaboratively, collection and the processing network's coverage area.But wireless sensor network has the deficiency of self, for conventional wireless network, mainly shows several aspects such as finite energy, disposal ability, memory capacity and communication bandwidth of node.Because sensor node is battery-powered, the problem of finite energy is particularly outstanding.In wireless sensor network, radio communication is the main consumer of energy.Routing algorithm is selected the transmission path of Information Monitoring and control messages, determine which node to form forward-path, all nodes on the path all will consume certain energy and transmit data, so routing algorithm is one of key factor that influences the sensor node energy consumption.
The inventor finds under study for action, in the sensor network that node broadcasts sowing at random, utilize each node of intensive deployment to set up many data transfer paths from the source node to the destination node, can effectively improve the efficiency of transmission of node, promote its data transmission success, the mode of sub-clustering can reduce network delay, is the mode of optimized energy service efficiency, and the effect that the mode of multi-hop can be given full play to data fusion reduces data volume.With the node division in the network is several levels, again in conjunction with cluster-dividing method, adopts bunch intra-cluster great wheel system of changing planes simultaneously, improves the life span of network.
Summary of the invention
Technical problem: the purpose of this invention is to provide a kind of wireless sensor network hierarchical cluster-based method, this method is a support with the wireless sensor network node of intensive deployment, to improve the sensor network life span is target, the sensing data transmission path of structure from the source node to the destination node guaranteed that sensing data and common sensing data arrive destination node in time, reliably.
Technical scheme: the present invention has set up a kind of hierarchy type cluster routing method of wireless sensor network, and its basic system forms and comprises:
Ordinary node: the wireless sensor network node of environmental information such as temperature that can its surrounding space of perception, humidity, illuminance, gas concentration.Ordinary node possesses the packet transfer capability simultaneously, the sensing data of sensing data that himself produces or other node that receives can be sent to any node that its communication capacity can reach;
Via node: the node that possesses the data forwarding ability.Among the present invention in the define grid any ordinary node can become via node.Via node has a blocks of data and receives buffering area, is used for the temporary data that receive, in case these data are disposed by via node, then its partial buffer district that takies will discharge;
Source node: have the sensing ability and send the ordinary node of sensing data;
Aggregation node: the node that sensing data finally is transferred to;
Bunch head: one bunch non-leader cluster node all sends to leader cluster node with its data, is the transmission that reduces redundant data, and leader cluster node sends the data to bunch head of next jumping, passes to aggregation node at last.
Definition
Layer: the level here is that all nodes in the network are turned to several levels, bunch forwarding of data task of sending that bunch all will bear the back level of each level.
The structure time: good needed time of bunch division in network one deck.
Free node: the node that does not add any bunch.
The step that the hierarchy type cluster routing method of wireless sensor network of the present invention is comprised is:
1) in network environment, at random, a plurality of sensor nodes with identical primary power E, same communication ability and sensing ability of uniform broadcasting, sensor node is known the geographical position of oneself; Each sensor node has own unique ID, the dump energy that each node can both perception oneself, and the sensor node sum of spreading is known, and the node of disregarding aggregation node in the network adds up to M;
2) aggregation node is deployed in the top of network, and each general sensor nodes can directly be communicated by letter with aggregation node, and the power of aggregation node and data-handling capacity will far be better than general sensor nodes;
3) ordinary node with wireless sensor network is divided into some levels, adopts the multi-hop mode to transmit data between level, so the level of dividing is too much unsuitable, otherwise can cause bigger delay; Wireless sensor network is divided into n level, consider that sensor network adopts the mode of multi-hop to transmit data, heavy more the closer to the task that the level of aggregation node is undertaken, consume angle from the equilibrium of network energy, the at all levels middle interstitial content of sensor network should reduce to the n layer successively from the 1st layer, the level of close aggregation node is the 1st layer, and the layer away from aggregation node is last one deck, and establishing its interstitial content is a, interstitial content is linear to be increased, interstitial content promptly from last one deck to ground floor is followed successively by a, 2a, 3a, na, then a+2a+3a+ ... + na=M
If
Be not integer, then also remaining node is classified as ground floor after each layer division, and therefore the interstitial content of each layer is determined;
4) bunch head is selected and bunch foundation: big more the closer to bunch forwarding of the being born load of aggregation node owing to adopt the multi-hop mode to transmit data, interstitial content increases by the distance from aggregation node and reduces successively at all levels bunch; Ground floor will be undertaken the forwarding of data task that each layer of back transmits, so the interstitial content in each of ground floor bunch should be some more, so that share the forwarding task; Excessive for the load that prevents certain cluster, set at all levels in bunch quantity equate that each bunch served as certain bunch forwarding task in the one deck of back, the node of establishing in last one deck bunch is k, requires k to be divided exactly by a; Then from bunch the angle of number balanced proportion, the number of node is followed successively by k each bunch from last one deck to ground floor, 2k, 3k ..., nk.Build bunch if the number of the cluster knot point of setting during t is certain layer, each layer begin tissue, bunch member must be with oneself with the node in one deck, the principle of building bunch is, the node conduct bunch head of close edges of regions; Make the last bunch radius of determining of R representative, the density of node is in the network
Then owing to all be to select the most submarginal node conduct bunch head that does not add any bunch at every turn, so this has at least the zone of half not have free node in bunch radius R coverage of this node, so for the number of node in guaranteeing bunch, establishing r is bunch radius of current leader cluster node, has
So the number for node in guaranteeing bunch makes R=2r, bunch radius
The nearest free node of leader cluster node chosen distance oneself as oneself bunch member node, up to bunch number of members that arrives regulation, or in bunch radius, do not had free node, like this, during all nodes have all added bunch in each layer, regulation, certain layer bunch number of members less than
Bunch, it is split, put under around other bunch in, the principle of division is that bunch member node is sought from own nearest bunch of head, but the number of members that has this moment bunch is too much, regulation if in one bunch the number of member node more than
Then it is split as several bunches number of members and is t and greater than
Less than
Bunch.So far all nodes have all been divided and have been finished;
5) treat bunch delimitation in each layer after, add up the number of clusters order in each layer, each layer bunch is numbered this layer then, the principle of numbering be by leader cluster node from the distance of network edge successively from 1 open numbering, set up the routing table of oneself afterwards, the h of j+1 layer bunch, h bunch that selects the j layer as next jumping, since in each layer bunch number difference few, so substantially can be corresponding one by one, indivedual correspondences do not go up, and can make it select next jumping of a bunch conduct oneself in own nearest anterior layer, add in the routing table of oneself;
6) in the multi-hop route, energy consumption that might one bunch bunch much bigger than in other same layer, at this moment consider from the integral body of sensor network, energy consumption in should balanced each bunch, promptly when energy in bunch less than 50% node number of primary energy greater than bunch in the node number 50% the time, then calculate
E1 is a dump energy total in this bunch, the primary power that E2 is bunch, c be in one bunch node energy less than the ratio of primary power 50%.Contrast the Y of each bunch, select Y big bunch, make a jumping upgrade routing table again, if can not find, then continue in this bunch forwarding.
Beneficial effect: as a kind of hierarchy type cluster routing method of wireless sensor network, the present invention has following useful achievements:
1.LEACH the selection of bunch head of agreement is a random process, can't guarantee the actual generation quantity of a bunch number, the present invention has guaranteed the actual generation quantity of bunch head;
2. the present invention has guaranteed the reasonable distribution of bunch head in network, has promptly avoided the leader cluster node might be very concentrated, and the overlay area is seriously overlapping, also the situation that a part of zone does not have leader cluster node may occur, has covered network more uniformly;
3. in the reselecting of bunch head, considered the energy size of residue node, avoided the situation that dump energy is too small, energy exhausts very soon of bunch head selected, the even load balance degree of network has improved the overall performance of network;
4. in the multi-hop route, energy consumption that might one bunch bunch much bigger than in other same layer, the present invention is from the integral body consideration of sensor network, equilibrium the energy consumption in each bunch;
5.LEACH the sub-clustering mechanism of agreement makes in each bunch the restructuring procedure can the waste certain energy, the present invention is in case after bunch formation, bunch just immobilizes, and avoided this type of energy consumption;
Description of drawings
Fig. 1 be the present invention towards the wireless sensor network structure.
Fig. 2 is by the multi-hop transmission path, and sensing data is sent to aggregation node.
Embodiment
The present invention follows the sub-clustering thought of LEACH algorithm, in conjunction with the multi-hop mode, proposes a kind of novel hierarchy type sub-clustering routing algorithm, and the shortcoming of LEACH is improved.The mode of sub-clustering can reduce network delay, is the mode of optimized energy service efficiency, and the effect that the mode of multi-hop can be given full play to data fusion reduces data volume.The present invention is several levels with the node division in the network, again in conjunction with cluster-dividing method, adopts bunch intra-cluster great wheel system of changing planes simultaneously, improves the life span of network.Its embodiment is:
1) in network environment, at random, a plurality of sensor nodes with identical primary power E, same communication ability and sensing ability of uniform broadcasting, sensor node is known the geographical position of oneself.Each sensor node has own unique ID, the dump energy that each node can both perception oneself, and the sensor node sum of spreading is known, and the node in the network adds up to M (disregarding aggregation node), and the area of overlay area is S;
2) aggregation node is deployed in the top of network, and each general sensor nodes can directly be communicated by letter with aggregation node, and the power of aggregation node and data-handling capacity will far be better than general sensor nodes;
3) ordinary node with wireless sensor network is divided into some levels, adopts the multi-hop mode to transmit data between level, so the level of dividing is too much unsuitable, otherwise can cause bigger delay.The present invention is divided into n level with wireless sensor network.Consider that sensor network adopts the mode of multi-hop to transmit data, heavy more the closer to the task that the level of aggregation node is undertaken, from the equilibrium consumption angle of network energy, the at all levels middle interstitial content of sensor network should reduce to the n layer successively from the 1st layer.The level of close aggregation node is the 1st layer.The layer away from aggregation node be last one deck, and establishing its interstitial content is a, the linear increase of interstitial content, and the interstitial content promptly from last one deck to ground floor is followed successively by a, 2a, 3a ..., na.A+2a+3a+ then ... + na=M,
If
Be not integer, then also remaining node is classified as ground floor after each layer division, and therefore the interstitial content of each layer is determined;
4) bunch head is selected and bunch foundation.Owing to adopt the multi-hop mode to transmit data, big more the closer to bunch forwarding of the being born load of aggregation node, so interstitial content increases by the distance from aggregation node and reduces successively at all levels bunch.Ground floor will be undertaken the forwarding of data task that each layer of back transmits, so the interstitial content in each of ground floor bunch should be some more, so that share the forwarding task.Excessive for the load that prevents certain cluster, set at all levels in bunch quantity equate that each bunch served as certain bunch forwarding task in the one deck of back.If the node in last one deck bunch is k, require k to be divided exactly by a.Then from bunch the angle of number balanced proportion, the number of node is followed successively by k each bunch from last one deck to ground floor, 2k, 3k ..., nk.Build bunch if the number of the cluster knot point of setting during t is certain layer, each layer begin tissue, but, bunch member must be with oneself with the node in one deck.The principle of building bunch is, the node of close edges of regions is as bunch head.Make the last bunch radius of determining of R representative.The density of node is in the network
Then owing to all be to select the most submarginal node conduct bunch head that does not add any bunch at every turn, so this has at least the zone of half not have free node in bunch radius R coverage of this node, so for the number of node in guaranteeing bunch, establishing r is bunch radius of current leader cluster node, has
So the number for node in guaranteeing bunch makes R=2r, bunch radius
The nearest free node of leader cluster node chosen distance oneself as oneself bunch member node, up to bunch number of members that arrives regulation, or in bunch radius, do not had free node.Like this, during all nodes have all added bunch in each layer.At this moment it is very few to have other bunch number of members, regulation, certain layer bunch number of members less than
Bunch, it is split, put under around other bunch in, the principle of division is that bunch member node is sought from own nearest bunch of head.But the number of members that have bunch this moment is too much, regulation if in one bunch the number of member node more than
Then it is split as several bunches number of members and is t and greater than
Less than
Bunch.So far all nodes have all been divided and have been finished;
5) treat bunch delimitation in each layer after, add up the number of clusters order in each layer, each layer bunch is numbered this layer then, the principle of numbering be by leader cluster node from the distance of network edge successively from 1 open numbering.Set up the routing table of oneself afterwards.The h of j+1 layer bunch, select h bunch of the j layer to jump as next since in each layer bunch number difference few, so substantially can be corresponding one by one, indivedual correspondences do not go up, and can make it select next jumping of a bunch conduct oneself in own nearest anterior layer, add in the routing table of oneself;
6) in the multi-hop route, energy consumption that might one bunch bunch much bigger than in other same layer, at this moment consider from the integral body of sensor network, energy consumption in should balanced each bunch, promptly when energy in bunch less than 50% node number of primary energy greater than bunch in the node number 50% the time, then calculate
E1 is a dump energy total in this bunch, the primary power that E2 is bunch, c be in one bunch node energy less than the ratio of primary power 50%.Contrast the Y of each bunch, select Y big bunch, make a jumping upgrade routing table again.If can not find, then continue in this bunch forwarding.
Claims (1)
1. the hierarchy type cluster routing method of a wireless sensor network is characterized in that steps of the method are:
1) in network environment, at random, a plurality of sensor nodes with identical primary power E, same communication ability and sensing ability of uniform broadcasting, sensor node is known the geographical position of oneself; Each sensor node has own unique ID, the dump energy that each node can both perception oneself, and the sensor node sum of spreading is known, and the node of disregarding aggregation node in the network adds up to M;
2) aggregation node is deployed in the top of network, and each general sensor nodes can directly be communicated by letter with aggregation node, and the power of aggregation node and data-handling capacity will far be better than general sensor nodes;
3) ordinary node with wireless sensor network is divided into some levels, adopts the multi-hop mode to transmit data between level, so the level of dividing is too much unsuitable, otherwise can cause bigger delay; Wireless sensor network is divided into n level, consider that sensor network adopts the mode of multi-hop to transmit data, heavy more the closer to the task that the level of aggregation node is undertaken, consume angle from the equilibrium of network energy, the at all levels middle interstitial content of sensor network should reduce to the n layer successively from the 1st layer, the level of close aggregation node is the 1st layer, and the layer away from aggregation node is last one deck, and establishing its interstitial content is a, interstitial content is linear to be increased, interstitial content promptly from last one deck to ground floor is followed successively by a, 2a, 3a, na, then a+2a+3a+ ... + na=M
If
Be not integer, then also remaining node is classified as ground floor after each layer division, and therefore the interstitial content of each layer is determined;
4) bunch head is selected and bunch foundation: big more the closer to bunch forwarding of the being born load of aggregation node owing to adopt the multi-hop mode to transmit data, interstitial content increases by the distance from aggregation node and reduces successively at all levels bunch; Ground floor will be undertaken the forwarding of data task that each layer of back transmits, so the interstitial content in each of ground floor bunch should be some more, so that share the forwarding task; Excessive for the load that prevents certain cluster, set at all levels in bunch quantity equate that each bunch served as certain bunch forwarding task in the one deck of back, the node of establishing in last one deck bunch is k, requires k to be divided exactly by a; Then from bunch the angle of number balanced proportion, the number of node is followed successively by k each bunch from last one deck to ground floor, 2k, 3k ..., nk; Build bunch if the number of the cluster knot point of setting during t is certain layer, each layer begin tissue, bunch member must be with oneself with the node in one deck, the principle of building bunch is, the node conduct bunch head of close edges of regions; Make the last bunch radius of determining of R representative, the density of node is in the network
Then owing to all be to select the most submarginal node conduct bunch head that does not add any bunch at every turn, so in bunch radius R coverage of this node, have at least the zone of half not have free node, so for the number of node in guaranteeing bunch, establishing r is bunch radius of current leader cluster node, has
So the number for node in guaranteeing bunch makes R=2r, bunch radius
The nearest free node of leader cluster node chosen distance oneself as oneself bunch member node, up to bunch number of members that arrives regulation, or in bunch radius, do not had free node, like this, during all nodes have all added bunch in each layer, regulation, certain layer bunch number of members less than
Bunch, it is split, put under around other bunch in, the principle of division is that bunch member node is sought from own nearest bunch of head, but the number of members that has this moment bunch is too much, regulation if in one bunch the number of member node more than
Then it is split as several bunches number of members and is t and greater than
Less than
Bunch; So far all nodes have all been divided and have been finished;
5) treat bunch delimitation in each layer after, add up the number of clusters order in each layer, each layer bunch is numbered this layer then, the principle of numbering be by leader cluster node from the distance of network edge successively from 1 open numbering, set up the routing table of controlling oneself afterwards, the h of j+1 layer bunch, h bunch that selects the j layer as next jumping, since in each layer bunch number difference few, so substantially can be corresponding one by one, indivedual correspondences do not go up, and make it select next jumping of a bunch conduct oneself in own nearest anterior layer, add in the routing table of oneself;
6) in the multi-hop route, energy consumption that might one bunch bunch much bigger than in other same layer, at this moment consider from the integral body of sensor network, energy consumption in should balanced each bunch, promptly when energy in bunch less than 50% node number of primary energy greater than bunch in the node number 50% the time, then calculate
E1 is a dump energy total in this bunch, the primary power that E2 is bunch, c be in one bunch node energy less than the ratio of primary power 50%; Contrast the Y of each bunch, select Y big bunch, make a jumping upgrade routing table again, if can not find, then continue in this bunch forwarding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101849325A CN101715243B (en) | 2009-10-21 | 2009-10-21 | Wireless sensor network hierarchical cluster-based routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101849325A CN101715243B (en) | 2009-10-21 | 2009-10-21 | Wireless sensor network hierarchical cluster-based routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101715243A CN101715243A (en) | 2010-05-26 |
| CN101715243B true CN101715243B (en) | 2011-12-14 |
Family
ID=42418397
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101849325A Expired - Fee Related CN101715243B (en) | 2009-10-21 | 2009-10-21 | Wireless sensor network hierarchical cluster-based routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101715243B (en) |
Families Citing this family (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873606B (en) * | 2010-06-09 | 2014-06-04 | 中国人民解放军海军航空工程学院 | Network clustering method of wireless sensor based on fixed cluster heads |
| CN101896002B (en) * | 2010-06-26 | 2013-05-22 | 上海交通大学 | Rapid data aggregation-oriented wireless sensor and actor network clustering method |
| CN101945495B (en) * | 2010-08-13 | 2013-03-27 | 深圳市杰曼科技有限公司 | Difference frequency subnetwork communication system and method |
| CN102045746A (en) * | 2011-01-24 | 2011-05-04 | 中国人民大学 | Event detection method based on layered grid in wireless sensor network |
| CN102413509A (en) * | 2011-11-09 | 2012-04-11 | 中国科学院上海微系统与信息技术研究所 | Construction method of time-delay-constrained energy consumption balance data acquisition tree in WSN (Wireless Sensor Network) |
| TWI528760B (en) * | 2011-12-22 | 2016-04-01 | 萬國商業機器公司 | Method for routing data in a wireless sensor network |
| CN102448138B (en) * | 2011-12-31 | 2014-04-09 | 重庆邮电大学 | Method for clustering hierarchical routing protocols of wireless sensor network |
| CN102612125B (en) * | 2012-03-20 | 2014-04-30 | 北京航空航天大学 | High-energy-efficiency mixed relay transmission method based on time delay limited service |
| CN102685688B (en) * | 2012-06-12 | 2014-06-11 | 西华大学 | Wireless sensor network clustering method based on first-price-sealed bid auction |
| CN103124421B (en) * | 2012-12-12 | 2016-06-08 | 南京邮电大学 | The cluster-dividing method of mobile node in a kind of wireless sensor network |
| CN103179628B (en) * | 2013-02-06 | 2016-03-16 | 中国科学院上海微系统与信息技术研究所 | Based on the method for the clustering routing of wireless sensing net node middleware |
| CN103281741B (en) * | 2013-05-16 | 2016-01-20 | 东南大学 | A kind of wireless sensor network clustering routing divided based on hexagonal area |
| CN103298054A (en) * | 2013-06-04 | 2013-09-11 | 四川大学 | Wireless sensor network cluster routing protocol based on node depth |
| CN104284386B (en) * | 2014-02-22 | 2018-05-25 | 湖南科技大学 | Wireless sensor network cluster head selection method based on betweenness |
| CN103906166B (en) * | 2014-04-04 | 2017-04-26 | 西北工业大学 | Wireless sensor network route method based on artificial potential field |
| WO2016100240A1 (en) * | 2014-12-14 | 2016-06-23 | Zte Corporation | Techniques for operating a distributed communication network |
| CN105376824B (en) * | 2015-10-14 | 2018-11-23 | 南京信息工程大学 | A kind of mobile sensor network low-power consumption method for routing for crop field monitoring |
| CN105517093B (en) * | 2015-11-30 | 2019-04-23 | 浙江工业大学 | The balanced energy-saving routing method of network is based in a kind of wireless sensor network |
| CN105722174B (en) * | 2016-02-01 | 2023-05-26 | 国网新疆电力公司电力科学研究院 | Node link scheduling method in heterogeneous fusion electricity information acquisition network |
| CN106211257B (en) * | 2016-07-08 | 2019-11-12 | 广州大学 | A kind of energy acquisition routing algorithm for wireless sensor based on geographical location |
| CN108024224A (en) * | 2017-12-11 | 2018-05-11 | 朱明君 | A kind of automatic aeration intelligent monitor system |
| CN109238703A (en) * | 2018-09-26 | 2019-01-18 | 东莞绿邦智能科技有限公司 | Rotary equipment bearings abnormal vibration intelligent checking system |
| CN111065063A (en) * | 2019-11-18 | 2020-04-24 | 杭州电子科技大学 | LT Codes-based efficient collection method for reliable storage of related data |
| CN111148160B (en) * | 2019-12-14 | 2023-01-31 | 贵州电网有限责任公司 | Sensor network multi-target routing method suitable for electric power monitoring environment |
| CN111510985B (en) * | 2020-03-19 | 2022-09-20 | 东北电力大学 | Wireless sensor network directional diffusion protocol data query method based on cluster bridge |
| CN112468329B (en) * | 2020-11-13 | 2023-01-06 | 苏州浪潮智能科技有限公司 | Method, device, equipment and readable medium for batch grouping management of servers |
| CN113490250B (en) * | 2021-07-09 | 2022-05-06 | 中国人民解放军国防科技大学 | Routing protocol of multi-hop wireless sensor network for raw data acquisition |
| CN115334552B (en) * | 2022-10-17 | 2022-12-20 | 南京智轩诚网络科技有限公司 | Distributed data rapid transmission method and transmission platform |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013987A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | High-efficiency controlling method of wireless sensor network topology |
-
2009
- 2009-10-21 CN CN2009101849325A patent/CN101715243B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013987A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | High-efficiency controlling method of wireless sensor network topology |
Non-Patent Citations (1)
| Title |
|---|
| 李岩等.基于LEACH协议的簇头多跳(LEACH-M)算法.《计算机工程与设计》.2007,第28卷(第17期),第4158-4160页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101715243A (en) | 2010-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101715243B (en) | Wireless sensor network hierarchical cluster-based routing method | |
| Sabor et al. | A comprehensive survey on hierarchical-based routing protocols for mobile wireless sensor networks: Review, taxonomy, and future directions | |
| CN102448138B (en) | Method for clustering hierarchical routing protocols of wireless sensor network | |
| CN101729331B (en) | Clustering method and device, routing method and device of cluster head and base station | |
| Sabet et al. | An energy efficient multi-level route-aware clustering algorithm for wireless sensor networks: A self-organized approach | |
| CN100446496C (en) | Method for establishing radio sensor network rout ebased on route neighbour list | |
| CN101360051B (en) | Energy efficient wireless sensor network routing method | |
| Din et al. | RETRACTED ARTICLE: Energy efficient topology management scheme based on clustering technique for software defined wireless sensor network | |
| CN101094131B (en) | Method for selecting hierarchy type route of wireless sensor network based on game theory | |
| Khedr et al. | Successors of PEGASIS protocol: A comprehensive survey | |
| CN101562862B (en) | Routing method for balancing energy of wireless sensor network | |
| CN102158927A (en) | Efficient inhomogeneous clustering routing method of wireless sensor network | |
| Kalaivanan | Quality of service (QoS) and priority aware models for energy efficient and demand routing procedure in mobile ad hoc networks | |
| Mehto et al. | A review on rendezvous based data acquisition methods in wireless sensor networks with mobile sink | |
| CN102802246A (en) | Energy saving method and dormancy decision making system of wireless sensor network | |
| CN102802230A (en) | Energy-efficient wireless sensor network routing algorithm | |
| CN102438291A (en) | Data aggregation method for increasing capacity of wireless sensor network | |
| CN102724730A (en) | Data-fusion-based multipath routing method and device for wireless sensor network | |
| CN101640944A (en) | Clustering and multi-hop communication method of wireless sensor | |
| CN105376824A (en) | Mobile sensor network low-power route method used for filed monitoring | |
| Raghavendra et al. | Energy efficient intra cluster gateway optimal placement in wireless sensor network | |
| CN102595546B (en) | Wireless sensor actuator network data collecting and clustering method based on event driving | |
| Denko | The use of mobile agents for clustering in mobile ad hoc networks | |
| Liu et al. | A virtual uneven grid-based routing protocol for mobile sink-based WSNs in a smart home system | |
| CN102572995B (en) | Solution for hot area problem based on geographical adaptive fidelity (GAF) improved clustering mechanism in wireless sensor network |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20100526 Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: 2016320000217 Denomination of invention: Wireless sensor network hierarchical cluster-based routing method Granted publication date: 20111214 License type: Common License Record date: 20161118 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS Contract record no.: 2016320000217 Date of cancellation: 20180116 |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111214 Termination date: 20211021 |