CN103228022A - Probability type wireless sensor network routing method based on energy harvesting - Google Patents
Probability type wireless sensor network routing method based on energy harvesting Download PDFInfo
- Publication number
- CN103228022A CN103228022A CN2013100205295A CN201310020529A CN103228022A CN 103228022 A CN103228022 A CN 103228022A CN 2013100205295 A CN2013100205295 A CN 2013100205295A CN 201310020529 A CN201310020529 A CN 201310020529A CN 103228022 A CN103228022 A CN 103228022A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- energy
- head
- leader cluster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a probability type wireless sensor network routing method based on energy harvesting. The method comprises network initialization, round cluster process, node maintenance and exception handling. In the round cluster stage, an algorithm takes energy efficiency into consideration while introducing energy harvesting factors, so that a node with high energy harvesting speed and residual energy is likely to be elected as a cluster head; and a novel probability type routing algorithm is adopted to perform data transmission among clusters in the routing process of the cluster head. Different from the traditional clustering routing which reduces energy consumption to the greatest extent, the method aims to increase the utilization ratio of the harvested energy the greatest extent and introduce novel probability type routing in the cluster head data transmission process, so that the energy harvested by the node can be effectively utilized, the energy consumption of the cluster head node is balanced, the phenomenon that the cluster head node near the converging node is converted into a sleeping state untimely due to high energy consumption is avoided, the work time of the node in the network is prolonged, and the whole performance of the system is improved.
Description
?
Technical field
The present invention relates to the node route implementing scheme of the wireless sensor network under a kind of prerequisite that can carry out energy acquisition at node, belong to wireless communication technology field.
?
Background technology
Along with development of technology such as microelectronics, computer and radio communications, the production of miniature, low-cost, highly reliable, multifunctional integrated sensor node becomes possibility on technology and benefit, and wireless sensor network (WSN) arises at the historic moment at this moment.Wireless sensor network is made up of the microsensor node that is distributed in a large amount of cheapnesss in certain zone, is the network system of a multi-hop ad hoc forming of the mode by radio communication.The appearance of wireless sensor network will be in logic information world merge into one with objectively physical world, expanded the ability that people obtain information greatly, changed the interactive mode of man and nature circle.At aspects such as military affairs prospecting, environment measuring, agricultural production, medical treatment supervision wide application prospect is arranged all.
In general, (wireless sensor network, protocol stack WSN) can be divided into five layers to wireless sensor network, is followed successively by from top to bottom: application layer, transport layer, network layer, data link layer and physical layer.Network layer mainly is responsible for foundation, selection and the maintenance of route.The Routing Protocol of wireless sensor network need be sought suitable path and successfully data passes be gone out between source node and destination node, promptly find an optimal path under the prerequisite that improves energy efficiency.The quality of routing Design directly has influence on each factor such as energy consumption, time delay of success rate, the node of data transmission in network.As one of core technology of wireless sensor network, the performance of Routing Protocol has determined the overall performance of network to a great extent.
Wireless sensor network occurs till now from it, and the research of its network route layer is a focus always, and a lot of classical wireless sensor network Routing Protocols also are suggested successively.From the topological structure aspect of wireless sensor network, the WSN Routing Protocol can be divided into plane Routing Protocol and level type Routing Protocol substantially.The status of each node all is identical, equality in the plane Routing Protocol, its function is identical on route, the amount of information of safeguarding is the same, the characteristics of plane Routing Protocol are that algorithm simply and relatively is easier to realize, yet plane route autgmentability is poor, can't be applied in the large-scale wireless sensor network.Level type Routing Protocol is network cluster dividing, and each bunch is made up of member in some bunches and a bunch of head, and the line data of going forward side by side of the node data in bunch head receives bunch merges, and by single-hop or multi-hop mode data is sent to aggregation node then.In certain scope, and the route between bunch head is simple relatively, be easy to eliminate the data redundancy of node, and autgmentability is better with communication restriction for level type route, therefore is applicable to the wireless sensor network that scope is bigger.
Traditional wireless sensor network all is battery-powered, because the particularity and the larger characteristics of wireless sensor network of its applied environment, the most node energy all is not easily changeable, therefore energy constraint is a major issue of wireless sensor network always, and this just makes that the design of traditional WSN route all is that to prolong network lifetime be primary goal to reduce energy consumption.Yet the development of hardware technology in recent years makes node to utilize obtains energy, for example solar energy, vibration, temperature difference etc. in the external environment.The energy acquisition technology appear at the problem of having alleviated the wireless sensor network node energy constraint to a certain extent, yet because the characteristic of energy acquisition, the method for routing of traditional wireless sensor network is (the Energy Harvesting Wireless Sensor Network at energy acquisition type wireless senser networking well, be EH-WSN) in be suitable for, therefore need the new route selection algorithm of design.
Consider the advantage of level type Routing Protocol, the routing algorithm of design sub-clustering type in energy acquisition type wireless sensor network.Can be in conjunction with classical level type Routing Protocol research method in the past, allow dump energy and the bigger node of energy acquisition rate value become leader cluster node in the even sub-clustering of network making.The introducing of energy acquisition factor simultaneously makes that being in ordinary node in a plurality of a small bundle of straw, etc. for silkworms to spin cocoons on coverages will consider not only that when selecting oneself to belong in which bunch energy-conservation factor also will consider to make full use of the energy that collects, and bunch between also need the energy consumption that a kind of algorithm can balanced whole network cluster head in the transport process of data, make that the leader cluster node near aggregation node can not cause energy consumption too fast because of transmitting multidata.Therefore, the routing algorithm agreement of a kind of EH-WSN of being applicable to of design is very crucial.
?
Summary of the invention
Technical problem:The purpose of this invention is to provide a kind of probabilistic type wireless sensor network routing method based on energy acquisition, this method is a purpose with the energy consumption of node in the energy that utilizes node and collect and the balanced whole network as far as possible, based on level type wireless sensor network route thought, provide the comprehensive routing policy of a kind of EH-WSN of being applicable to.
Technical scheme:The present invention is a purpose with the energy that utilizes node and collect and the energy consumption of balanced whole network node as far as possible, consider of the influence of energy acquisition factor in the time of the comprehensive choosing of route in the past bunch to sub-clustering, and a bunch data transfer phase propose a kind of novel probabilistic type bunch between routing policy, each leader cluster node is selected its routing procedure according to the energy state of self and adjacent leader cluster node and to the distance of sink node (being aggregation node) with different probability.
Under the prerequisite of the energy acquisition factor of considering node, comprehensive classical route research method in the past, make in the network sub-clustering comparatively evenly and guaranteed the degree of communication of leader cluster node in the regulation power bracket; When node is in a plurality of bunches the coverage, communication cost cost be set to leader cluster node energy value, leader cluster node degree and bunch in the comprehensive weights of average minimal communications power consumption, when saving bunch interior nodes energy, make an energy acquisition speed and the high bunch head of residual energy value share more bunch of interior nodes; Bunch head is carrying out TDMA(Time Division Multiple Access to bunch interior nodes, time division multiple access) size according to the energy weight of node sorts successively during time slot allocation, make the node prioritised transmission data that energy weight is bigger, further utilized the feature of energy acquisition speed type wireless sensor network; EH-EBPR(Energy harvesting in the routing procedure between bunch, Energy balance and probability Routing) adopts the probabilistic type method for routing, the effectively balanced energy consumption of bunch head in the network has prolonged the time that node is in operating state.The wireless sensor network cluster routing method of energy acquisition comprises following process:
A. netinit stage: the sink node sends broadcast in whole network, and all nodes calculate it to the approximate distance of sink node and be placed in the buffer memory according to the signal strength signal intensity RSSI that receives;
B. take turns bunch process: node is according to self dump energy and each every T of energy acquisition speed that takes turns
RoundTime is carried out a next round bunch process, and each node is according to self dump energy and energy acquisition rate value competition bunch head, each take turns comprise the cluster stage and bunch between the route stage;
B1. cluster stage: node carries out sub-clustering and election contest bunch head according to self rest energy and energy acquisition speed, and detailed process is made up of three parts:
B11. initialization network cluster head ratio C
Pr: each node is according to self rest energy and the initially elected bunch probability CH of energy acquisition rate calculations
Pr, transmitting power P in given bunch
IntraIn the coverage, each node obtains the cost value of self and sends it to neighbors according to self and neighbors situation;
B12. iterative process: S
CH(candidate's bunch head set) is the CH of the node of sky with the current iteration step number
PrIf probable value election contest bunch head is S
CHDo not choose the minimum node of cost value as its temporary transient bunch of head for empty then node; Finish posterior nodal point all with self CH in each step iteration
PrOn duty with 2, work as CH
PrThe iterative process of=1 o'clock node finishes; The node that becomes bunch head can be broadcasted corresponding status message to neighbor node, as node CH
PrNode was in temporary transient bunch of head status in＜1 o'clock, worked as CH
Pr=1 o'clock node is a final bunch of head status; Be in the leader cluster node of transition condition if can become ordinary node by the change state during leader cluster node of finding to have littler communication cost;
B13. by the stage: node is chosen and is in the minimum node of cost value in the final bunch of head status as final bunch of head, and then declaring as if the broadcast of not receiving the node that is in final bunch of head status oneself becomes final bunch of head and broadcast.Bunch first node is then according to the energy synthesis weights of bunch interior nodes, promptly (
) be each bunch interior nodes distribution T DMA transfer of data time slot;
B2. bunch the route stage between: bunch interior nodes is revived in given time slot data is sent to a bunch head, in other times, be in sleep state, bunch head receives the laggard line data polymerization of information of all bunches interior nodes to eliminate redundancy, and data are sent to the sink node by single-hop or multi-hop mode, route comprises following three kinds of situations between bunch:
B21. if leader cluster node arrives the sink nodal distance smaller or equal to constant value S, bunch head directly is sent to data the sink node;
B22. if leader cluster node arrives the sink nodal distance greater than S, node calculates self route coefficients R
CoAnd produce random number R andom(0 between one 0 to 1,1), if Random(0,1) greater than the route coefficients R
Co, then the also direct single-hop of the data of leader cluster node is to the sink node;
B23. if leader cluster node to sink distance greater than S and Random(0,1) smaller or equal to the route coefficients R
Co, route cost C between a bunch first-selection is got in the adjacent leader cluster node bunch
CostNext jumping of conduct that value is minimum; Whether next-hop node at first judges its distance that arrives the sink node greater than S, carries out route judgement by above-mentioned mode equally;
C. node maintenance and abnormality processing: if the energy of leader cluster node exhausts at data transfer phase, then bunch first will
Broadcast Cluster-disband bunch of dismission message and go forward side by side into the sleep state to bunch this bunch of interior nodes dismission, and no longer respond the route request information of his leader cluster node, bunch interior nodes will be waited for the arrival of choosing bunch process next time; If depleted of energy is a bunch interior nodes, node transmission Energy-exhaust depleted of energy message is gone forward side by side to leader cluster node and is carried out energy supplement into the sleep state, is in the dump energy of dormant node in case surpass the certain level of maximum energy storage value
, then node is converted into operating state.
The present invention is EH-EBPR(Energy harvesting, Energy balance and probability Routing) method for routing, the routing plan that provides to be applicable to the wireless sensor network of energy acquisition type is provided.This route is a purpose with the energy that utilizes node as far as possible and collect, and comes equilibrium to be elected as the energy consumption of the node of bunch head with bunch parting of probabilistic type by mode simultaneously, make some node in the network not can because of energy consumption excessive and too fast be in sleep state.
Routing policy in traditional wireless sensor network is a purpose to save energy consumption all generally, HEED(A Hybrid for example, Energy-Efficient Distributed clustering approach) in the agreement when ordinary node is in the coverage of two bunches of heads node can send to bunch required AMRP(bunch of interior nodes minimum average B configuration of an average energy power consumption power consumption according to bunch interior nodes data) value choose bunch in bunch the joining of average communication cost minimum, what choose that AMRP mainly considers as the communication cost value is exactly the communication energy consumption of saving bunch interior nodes.In energy acquisition type wireless sensor network, node can be by obtaining energy in the external environment condition, the energy that node collects when the energy-storage battery energy of node reaches maximum will directly slattern, the energy that should utilize node to collect as much as possible this moment when consideration is energy-conservation.
Consider that bunch interior nodes is just fixedly sending to leader cluster node with data in the time slot, the energy value that node collects in each is taken turns is probably greater than the energy consumption of bunch interior nodes, therefore, EH-EBPR when ordinary node is in a plurality of bunches coverage, take all factors into consideration leader cluster node energy value and bunch in the node number, make the big leader cluster node of dump energy and energy acquisition rate value can share the transfer of data of more bunch interior nodes relatively.After sub-clustering was finished, bunch head carried out the distribution of time slot according to the dump energy and the energy acquisition speed of bunch interior nodes, the bigger node of the comprehensive weights of dump energy and energy acquisition speed early carry out transfer of data.Can increase the capacity usage ratio that node collects like this, the reduction of appropriateness simultaneously is in the sleep rate of the node of low-energy state.
The EH-EBPR route bunch between adopt the method for routing of probabilistic type during route.The transfer of data of bunch head generally is divided into single-hop or multi-hop in the clustering route protocol in the past: leader cluster node directly sends to aggregation node with data by the mode of single-hop in the single-hop route, can cause the waste of energy this moment, and distance bunch head node far away also can be in sleep state soon because energy consumption is excessive; A bunch node that the selected distance aggregation node is nearer is jumped as next in the multi-hop route, the energy consumption of leader cluster node increases from outside to inside successively in the whole network, the node nearer apart from aggregation node often needs all data of transmission network middle distance sink node bunch head far away, causes its too fast sleep state that has been in.In the probabilistic type route that proposes among the present invention, leader cluster node carries out transfer of data with certain probability with single-hop or multi-hop mode according to self and the distance of aggregation node, the energy value of node self in meeting, chooses also to take all factors into consideration the energy of neighbors when next is jumped and apart from situation.It is less that far away and self rest energy and the less node of energy acquisition rate value are chosen the probability of multi-hop transmission apart from aggregation node, and along with the increase of the energy value of node, to the reducing of aggregation node distance, bunch head selects the probability of single-hop routing mode also increasing.By the routing policy of probabilistic type, the energy consumption desired value of leader cluster node obtains equilibrium, has effectively increased the operating time of node, has promoted the overall performance of network.
Beneficial effect:The invention provides a kind of probabilistic type wireless sensor network routing method based on energy acquisition, this method is a purpose with the energy that utilizes node and collect and the energy consumption of equalizing network as far as possible, in choosing bunch head and clustering process, take all factors into consideration the influence that energy acquisition brought of node, make node can utilize the energy that collects as far as possible.And the probabilistic type routing algorithm that in a bunch data transfer phase, proposes can the efficient balance network energy consumption, increase the time that node in the network is in operating state, promoted the performance of network greatly.The present invention is simple and practical, and autgmentability is strong, can be applicable to the energy acquisition type wireless sensor network of various scales.
Description of drawings
Fig. 1 is based on the wireless sensor network sub-clustering routing algorithm flow through a network figure of collection of energy,
Fig. 2 is based on the EH-EBPR routing algorithm clustering process of HEED sub-clustering,
Among Fig. 3 EH-EBPR leader cluster node bunch between routing procedure,
The specific implementation of Fig. 4 EH-EBPR routing algorithm.
?
Embodiment
One: network model
(1) energy supply of node part is made up of energy-storage battery and energy acquisition unit in the energy acquisition type wireless sensor network, and the maximum energy value that battery can be stored is E
Max
(2) all nodal functions except that the sink node are identical in the network, and each node all has unique ID sign, and node can according to transmitting-receiving person apart from its transmitting power of free adjustment.
(3) link is symmetrical in the network, and node can be according to the approximate distance of calculating both under the given situation of transmitted power according to the signal strength signal intensity RSSI that receives.
(4) position of node is relatively stable in the network, and its distance to the sink node does not change substantially.
(5) energy level when node is lower than maximum energy storage value E
MaxWill be in sleep state at 1% o'clock, continue makeup energy.When the energy value that is in dormant node surpasses
Shi Jiedian is converted to operating state.
Two: netinit
In the netinit stage, the sink node is broadcasted msg-dis range estimation message in whole network, and node calculates its approximate distance to the sink aggregation node according to the signal strength signal intensity RSSI that receives.
Three: wheel bunch process
Wheel bunch process is that node is taken turns the process of electing bunch head as and transmitting data in the network.Every T
RoundTime is carried out a polling bunch process.Each take turns comprise the cluster stage and bunch between the route stage, every required time of taking turns is T
Round, T
Round=T
Ce+ T
Cr, wherein preceding T
CeTime is choosing bunch stage, back T
CrTime be transfer of data and bunch between the route stage.The average energy acquisition rate of different nodes in same the wheel has nothing in common with each other, and the average energy acquisition rate of node in the difference wheel also has nothing in common with each other.
1. cluster stage:
1) each node is according to the residual energy value E of self
ResidualInitial probability CH with its elected bunch head of energy acquisition rate calculations
Pr, be shown below:
C wherein
PrBe the ratio of the initial cluster in the network, P
rBe the average energy acquisition rate of node in working as front-wheel, P
MinBe CH
PrMinimum value, introduce P
MinMake whole cluster process in limited iteration step number, to finish.Node is with specific bunch internal power P then
IntraSend the Neighbor-search neighbor discovery messages, and calculate the cost value of self, send it to neighbor node according to the Neighbor-confirm acknowledge message that neighbor node is responded.
2) node enters iterative process after calculating its initial cluster probability.If CH
Pr＜1, node is from its S
CHChoose in (candidate bunch head set) cost value minimum bunch as its temporary transient bunch of head, as if S
CHFor sky then node with current self CH
PrProbability election contest leader cluster node, finish all nodes of back with self CH in each iterative process
PrOn duty with 2 and continue said process.Until CH
Pr=1, iterative process finishes.
3) each node determines end-state according to its message of receiving, leader cluster node basis bunch interior nodes (
) value is for each bunch interior nodes distribution T DMA transfer of data time slot.The node that dump energy and energy acquisition gait synthesis value are bigger preferentially sends to data a bunch head.
2. the route stage bunch:
The route stage is that data that leader cluster node the receives bunch interior nodes line data of going forward side by side merges between bunch, and the mode by single-hop or multi-hop sends to aggregation node with data then.Leader cluster node after finishing data aggregate, Route Selection between carrying out bunch according to following several situations, definition leader cluster node i is D to the distance of sink node
I-sink
A. if D
I-sink＜=S, bunch head directly sends to data the sink node by the single-hop mode
B. work as D
I-sinkDuring S, node produces a random number between 0 to 1, if random(0,1) R
CoThen bunch head directly is sent to the sink node with data equally.Wherein, route coefficients R
CoBe defined as follows formula, weights
Can be according to different application environment free adjustment.
C. work as D
I-sinkS and random(0,1)＜=R
CoThe time, a bunch first node is sent to next-hop node by the multi-hop mode with data.Bunch head is performance number P between given bunch
InterChoose its next-hop node of conduct of communication cost value minimum in the adjacent leader cluster node in the coverage, communication cost value C
CostComputing formula is as follows
Weights wherein
Also can be according to different application environment free adjustment.Next is jumped leader cluster node and by above-mentioned mode the data that the receive mode by single-hop or multi-hop is sent to the sink node equally.
Four: node maintenance and abnormality processing
Node the depleted of energy state may occur during transfer of data, if the node of depleted of energy is a bunch first node, bunch head will be broadcasted Cluster-disband bunch and be dismissed message and go forward side by side into the sleep state to bunch this bunch of interior nodes dismission, and no longer respond the route request information of his leader cluster node, bunch interior nodes is waited for the arrival of choosing bunch process next time; If depleted of energy for bunch interior nodes then node send Energy-exhaust depleted of energy message and go forward side by side into sleep to leader cluster node.In a single day dormant node detects its residual energy value and reaches
The time will be converted to operating state.
Claims (1)
1. probabilistic type wireless sensor network routing method based on energy acquisition, it is characterized in that: under the prerequisite of the energy acquisition factor of considering node, comprehensive classical route research method in the past, make in the network sub-clustering comparatively evenly and guaranteed the degree of communication of leader cluster node in the regulation power bracket; When node is in a plurality of bunches the coverage, communication cost cost be set to leader cluster node energy value, leader cluster node degree and bunch in the comprehensive weights of average minimal communications power consumption AMRP, when saving bunch interior nodes energy, make bunch head of energy acquisition speed and residual energy value share more bunch of interior nodes; Bunch head divides timing to distribute successively according to the size of the energy weight of node bunch interior nodes being carried out the time division multiple access tdma slot, make the node prioritised transmission data that energy weight is bigger, further utilized the feature of energy acquisition speed type wireless sensor network; Between bunch in the routing procedure EH-EBPR adopt the probabilistic type method for routing, the effectively balanced energy consumption of bunch head in the network has prolonged the time that node is in operating state, the wireless sensor network cluster routing method of energy acquisition comprises following process:
A. netinit stage: the sink node is that aggregation node sends broadcast in whole network, and all nodes calculate it to the approximate distance of sink node and be placed in the buffer memory according to the signal strength signal intensity RSSI that receives;
B. take turns bunch process: node is according to self dump energy and each every T of energy acquisition speed that takes turns
RoundTime is carried out a next round bunch process, and node is according to self dump energy and energy acquisition rate value competition bunch head, each take turns comprise the cluster stage and bunch between the route stage;
B1. cluster stage: node carries out sub-clustering and election contest bunch head according to self rest energy and energy acquisition speed, and detailed process is made up of three parts:
B11. initialization network cluster head ratio C
Pr: each node is according to self rest energy and the initially elected bunch probability CH of energy acquisition rate calculations
Pr, transmitting power P in given bunch
IntraIn the coverage, each node calculates the communication cost cost value of self and sends it to neighbors according to self and neighbors situation;
B12. iterative process: candidate's bunch head set is the CH of empty node with the current iteration step number
PrIf probable value election contest bunch head is candidate's bunch S set
CHDo not choose the minimum node of cost value as its temporary transient bunch of head for empty then node; Finish posterior nodal point all with self CH in each step iteration
PrOn duty with 2, work as CH
PrThe iterative process of=1 o'clock node finishes; The node that becomes bunch head can be broadcasted corresponding status message to neighbor node, as node CH
PrNode was in temporary transient bunch of head status in＜1 o'clock, worked as CH
Pr=1 o'clock node is a final bunch of head status; Be in the leader cluster node of transition condition if can become ordinary node by the change state during leader cluster node of finding to have littler communication cost;
B13. by the stage: node choose be in cost value minimum in the final bunch of head status node as final bunch of head, if then declaring, the broadcast of not receiving the node of final bunch of head status oneself becomes final bunch of head and broadcast, bunch first node is according to the energy synthesis weights of bunch interior nodes, promptly (
) be each bunch interior nodes distribute data transmission time slot;
B2. bunch the route stage between: reviving in bunch time slot that the interior nodes feeding is fixed is sent to a bunch head with data, in other times, be in sleep state, bunch head receives the laggard line data polymerization of information of all bunches interior nodes to eliminate redundancy, and data are sent to the sink node by single-hop or multi-hop mode, route comprises following three kinds of situations between bunch:
B21. if leader cluster node arrives the sink nodal distance smaller or equal to constant value S, bunch head directly is sent to data the sink node;
B22. arrive the sink nodal distance greater than S as if leader cluster node, the random number R andom(0 between node produces 0 to 1,1), if Random(0,1) greater than the route coefficients R
Co, then the also direct single-hop of the data of leader cluster node is to the sink node;
B23. if the sink of leader cluster node distance greater than S and Random(0,1) smaller or equal to the route coefficients R
Co, route cost C between a bunch first-selection is got in the adjacent leader cluster node bunch
CostNext jumping of conduct that value is minimum; Next-hop node judges that it arrives the distance of sink node, carries out route judgement by above-mentioned mode equally;
Node maintenance and abnormality processing: if the energy of leader cluster node exhausts at data transfer phase, then a bunch head will
Broadcast Cluster-disband bunch of dismission message and go forward side by side into the sleep state to bunch this bunch of interior nodes dismission, and no longer respond the route request information of his leader cluster node, bunch interior nodes will be waited for the arrival of choosing bunch process next time; If depleted of energy is a bunch interior nodes, node transmission Energy-exhaust depleted of energy message is gone forward side by side to leader cluster node and is carried out energy supplement into the sleep state, in case the dump energy of sleep state node surpasses the certain level of maximum energy storage value
, then will be converted into operating state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100205295A CN103228022A (en) | 2013-01-21 | 2013-01-21 | Probability type wireless sensor network routing method based on energy harvesting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100205295A CN103228022A (en) | 2013-01-21 | 2013-01-21 | Probability type wireless sensor network routing method based on energy harvesting |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103228022A true CN103228022A (en) | 2013-07-31 |
Family
ID=48838234
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013100205295A Pending CN103228022A (en) | 2013-01-21 | 2013-01-21 | Probability type wireless sensor network routing method based on energy harvesting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103228022A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104980990A (en) * | 2014-04-08 | 2015-10-14 | 中国科学院声学研究所 | Potential field path searching method for new energy wireless sensor network |
| CN105722174A (en) * | 2016-02-01 | 2016-06-29 | 国网新疆电力公司电力科学研究院 | Node link scheduling method of heterogeneous integrated power consumption information collection network |
| CN106507496A (en) * | 2016-11-01 | 2017-03-15 | 北京邮电大学 | Based on MAC protocol implementation method and device that energy state adjusts competition probability |
| CN106550422A (en) * | 2016-11-08 | 2017-03-29 | 华中科技大学 | A kind of wireless sensor network clustering routing based on harmonic search algorithm |
| CN106658662A (en) * | 2016-12-30 | 2017-05-10 | 国网能源研究院 | Wireless power supply communication method and system |
| CN106793042A (en) * | 2017-01-10 | 2017-05-31 | 广东石油化工学院 | Sleep scheduling method under wireless energy communication network |
| CN106792911A (en) * | 2017-01-11 | 2017-05-31 | 湘潭大学 | A kind of mixed node cluster-dividing method of load balancing |
| CN107257572A (en) * | 2017-07-31 | 2017-10-17 | 广东工业大学 | A kind of cluster routing method of wireless sense network |
| US9838943B2 (en) | 2015-11-24 | 2017-12-05 | King Fahd University Of Petroleum And Minerals | Method of routing for wireless ad hoc and sensor networks |
| CN107623901A (en) * | 2017-09-21 | 2018-01-23 | 河海大学常州校区 | Combine Data Collection and energy supply method in a kind of WRSNs |
| CN107786957A (en) * | 2017-09-28 | 2018-03-09 | 韦彩霞 | A kind of farmland ecological environment monitoring system for precision agriculture |
| CN108260074A (en) * | 2017-07-20 | 2018-07-06 | 浙江工业大学 | Combined optimization method is configured in energy source locations deployment and transmission power in a kind of RF energy capture wireless sense network |
| CN109885616A (en) * | 2019-01-24 | 2019-06-14 | 苏州迈荣祥信息科技有限公司 | A kind of information security obtains and important information recognition methods and device |
| CN110324351A (en) * | 2019-07-10 | 2019-10-11 | 厦门嵘拓物联科技有限公司 | The system and method for information interconnection in a kind of network collaborative design |
| CN112333654A (en) * | 2020-10-28 | 2021-02-05 | 华北电力大学 | Energy local equalization topology control algorithm for improving robustness of wireless sensor network |
| CN116321343A (en) * | 2023-02-27 | 2023-06-23 | 无锡学院 | Self-adaptive threshold energy management method for oil-gas Internet of things |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102271379A (en) * | 2011-05-09 | 2011-12-07 | 陈志奎 | Energy-saving routing method of nodes of internet of things based on context-aware technology |
| CN102281608A (en) * | 2011-07-04 | 2011-12-14 | 南京邮电大学 | Wireless sensor network clustering routing method based on fuzzy control |
| CN102711213A (en) * | 2012-05-14 | 2012-10-03 | 南京邮电大学 | Wireless sensor network routing method based on residual energy |
-
2013
- 2013-01-21 CN CN2013100205295A patent/CN103228022A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102271379A (en) * | 2011-05-09 | 2011-12-07 | 陈志奎 | Energy-saving routing method of nodes of internet of things based on context-aware technology |
| CN102281608A (en) * | 2011-07-04 | 2011-12-14 | 南京邮电大学 | Wireless sensor network clustering routing method based on fuzzy control |
| CN102711213A (en) * | 2012-05-14 | 2012-10-03 | 南京邮电大学 | Wireless sensor network routing method based on residual energy |
Non-Patent Citations (2)
| Title |
|---|
| DENG SHUGUANG，ET AL,: "A Novel On-demand Qos Protocol Based on Near Static Clustering for Wireless Sensor Network", 《WIRELESS SENSOR NETWORK》 * |
| HYUNTAEK KWON,ET AL,: "Low-latency routing for energy-harvesting sensor networks", 《UIC 2007, LNCS》 * |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104980990A (en) * | 2014-04-08 | 2015-10-14 | 中国科学院声学研究所 | Potential field path searching method for new energy wireless sensor network |
| US9838943B2 (en) | 2015-11-24 | 2017-12-05 | King Fahd University Of Petroleum And Minerals | Method of routing for wireless ad hoc and sensor networks |
| CN105722174A (en) * | 2016-02-01 | 2016-06-29 | 国网新疆电力公司电力科学研究院 | Node link scheduling method of heterogeneous integrated power consumption information collection network |
| CN106507496A (en) * | 2016-11-01 | 2017-03-15 | 北京邮电大学 | Based on MAC protocol implementation method and device that energy state adjusts competition probability |
| CN106507496B (en) * | 2016-11-01 | 2019-08-09 | 北京邮电大学 | The MAC protocol implementation method and device of competition probability are adjusted based on energy state |
| CN106550422A (en) * | 2016-11-08 | 2017-03-29 | 华中科技大学 | A kind of wireless sensor network clustering routing based on harmonic search algorithm |
| CN106550422B (en) * | 2016-11-08 | 2017-08-25 | 华中科技大学 | A kind of wireless sensor network clustering routing based on harmonic search algorithm |
| CN106658662A (en) * | 2016-12-30 | 2017-05-10 | 国网能源研究院 | Wireless power supply communication method and system |
| CN106658662B (en) * | 2016-12-30 | 2020-06-26 | 国网能源研究院有限公司 | Wireless power supply communication method and system |
| CN106793042A (en) * | 2017-01-10 | 2017-05-31 | 广东石油化工学院 | Sleep scheduling method under wireless energy communication network |
| CN106792911A (en) * | 2017-01-11 | 2017-05-31 | 湘潭大学 | A kind of mixed node cluster-dividing method of load balancing |
| CN108260074A (en) * | 2017-07-20 | 2018-07-06 | 浙江工业大学 | Combined optimization method is configured in energy source locations deployment and transmission power in a kind of RF energy capture wireless sense network |
| CN108260074B (en) * | 2017-07-20 | 2020-06-02 | 浙江工业大学 | Energy source position and transmission power optimization method for wireless energy supply sensor network |
| CN107257572A (en) * | 2017-07-31 | 2017-10-17 | 广东工业大学 | A kind of cluster routing method of wireless sense network |
| CN107623901A (en) * | 2017-09-21 | 2018-01-23 | 河海大学常州校区 | Combine Data Collection and energy supply method in a kind of WRSNs |
| CN107623901B (en) * | 2017-09-21 | 2020-02-04 | 河海大学常州校区 | Combined data collection and energy supply method in WRSNs |
| CN107786957A (en) * | 2017-09-28 | 2018-03-09 | 韦彩霞 | A kind of farmland ecological environment monitoring system for precision agriculture |
| CN107786957B (en) * | 2017-09-28 | 2019-08-23 | 韶关市大众世纪信息科技有限公司 | A kind of farmland ecological environment monitoring system for precision agriculture |
| CN109885616A (en) * | 2019-01-24 | 2019-06-14 | 苏州迈荣祥信息科技有限公司 | A kind of information security obtains and important information recognition methods and device |
| CN109885616B (en) * | 2019-01-24 | 2020-12-04 | 北京网高科技股份有限公司 | Information security acquisition and important information identification method and device |
| CN110324351A (en) * | 2019-07-10 | 2019-10-11 | 厦门嵘拓物联科技有限公司 | The system and method for information interconnection in a kind of network collaborative design |
| CN110324351B (en) * | 2019-07-10 | 2021-06-15 | 厦门嵘拓物联科技有限公司 | System and method for information interconnection in network collaborative manufacturing |
| CN112333654A (en) * | 2020-10-28 | 2021-02-05 | 华北电力大学 | Energy local equalization topology control algorithm for improving robustness of wireless sensor network |
| CN116321343A (en) * | 2023-02-27 | 2023-06-23 | 无锡学院 | Self-adaptive threshold energy management method for oil-gas Internet of things |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103228022A (en) | Probability type wireless sensor network routing method based on energy harvesting | |
| Sabet et al. | An energy efficient multi-level route-aware clustering algorithm for wireless sensor networks: A self-organized approach | |
| Tyagi et al. | A systematic review on clustering and routing techniques based upon LEACH protocol for wireless sensor networks | |
| CN101188535B (en) | Method for determining clustering energy balance route of wireless sensor network based on binary tree | |
| Singh | WSN LEACH based protocols: A structural analysis | |
| CN104301965B (en) | A kind of wireless sensor network Uneven Cluster node scheduling method | |
| CN103298054A (en) | Wireless sensor network cluster routing protocol based on node depth | |
| CN101959244B (en) | Method for controlling hierarchical type route suitable for wireless sensor network | |
| Prabhu et al. | Capacity based clustering model for dense wireless sensor networks | |
| CN102026331A (en) | Distributed multi-jump energy-saving communication method in wireless sensor network | |
| CN104093188A (en) | Novel cluster head election method for wireless sensor networks | |
| CN104080144B (en) | A kind of Energy Efficient Uneven Cluster data forwarding method based on gradient | |
| CN103209455A (en) | Wireless sensor network routing method based on node position information | |
| CN103781143A (en) | Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency | |
| CN103987102A (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| Mollanejad et al. | EHRP: Novel energy-aware hierarchical routing protocol in wireless sensor network | |
| Malathi et al. | A novel routing protocol with lifetime maximizing clustering algorithm for WSN | |
| Ibrahim et al. | Comparative Study of Energy Saving Routing Protocols for Wireless Sensor Networks | |
| CN113923802B (en) | Energy-efficient hierarchical topology control method in software-defined wireless sensor network | |
| Chelbi et al. | An Unequal Cluster-based Routing Protocol Based on Data Controlling for Wireless Sensor Network. | |
| Raju et al. | An Insight on Clustering Protocols in Wireless Sensor Networks | |
| Devasena et al. | A study of power and energy efficient clustering protocols in wireless sensor networks | |
| CN110972230B (en) | Method for LEACH two-stage clustering routing protocol based on cuckoo algorithm | |
| Yang et al. | A novel energy-efficient data gathering algorithm for wireless sensor networks | |
| Tamura et al. | Closer destination selection scheme for mobile sink and charger enabled WRSNs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130731 |