CN101572657A - Distributed determining method and route proposal of wireless sense network energy inadequacy level - Google Patents
Distributed determining method and route proposal of wireless sense network energy inadequacy level Download PDFInfo
- Publication number
- CN101572657A CN101572657A CNA2008101054889A CN200810105488A CN101572657A CN 101572657 A CN101572657 A CN 101572657A CN A2008101054889 A CNA2008101054889 A CN A2008101054889A CN 200810105488 A CN200810105488 A CN 200810105488A CN 101572657 A CN101572657 A CN 101572657A
- Authority
- CN
- China
- Prior art keywords
- node
- energy
- oneself
- network
- interest
- 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
-
- Y02B60/50—
Abstract
The invention belongs to the technical field of wireless sensor network energy-saving route, and in particular relates to a mode for mutually exchanging energy information data packets through a local range node in a wireless sensor network, so that the node acquires the sequence of rest energy of the node in surrounding k hop nodes, and reduces the probability of selecting a low energy node as a routing node, and the energy is used evenly and the life cycle of the network is prolonged.
Description
Technical field
The invention belongs to wireless transducer network energy saving route field.Be specifically related to a kind of method of in wireless sensor network, passing through mutual switching node energy information in the subrange, and this method is applied to go in the routing procedure, avoid using the grouping of low-yield node for data forwarding as far as possible, the life cycle of using network node energy to prolong network by equilibrium.
Background technology
Wireless sensor network is made up of sensor node and information gathering (sink) node, sensor node is responsible for the collection and the transmission of data, the sink node is responsible for gathering the data that sensor node is sent in the network, also be the Control Node of whole network simultaneously, other sensor node in the network is managed.
Because node is difficult to reclaim after deployment in the wireless sensor network.Therefore, being difficult to node after deployment changes battery or it is charged once more.Therefore, node power exhausts, and just means node death, can't come into operation again.When dead node reached certain ratio in the network, network may be divided into disconnected zone.If there is not the sink node in the zone.This Local Area Network data of gathering just can't send out so, are equal to this all node death of zone.Therefore, the Routing Protocol that needs a kind of balancing energy of research to consume is avoided frequently using some node and is caused it dead fast.
Directed diffusion (Directed Diffusion) agreement is a typical routing protocol in the wireless sense network network, its route discovery procedure is, the broadcasting earlier of sink node has the interest grouping of less Grad, and data source nodes receives that interest grouping back sends data along its reverse path.Sink can send the bigger interest grouping of gradient to the path that receives data at first, and promptly data will send along postponing minimum path.
Summary of the invention
The objective of the invention is to design a kind of energy-saving routing method towards wireless sensor network.It runs on network layer, and can combine with existing Routing Protocol and play a role.
Technical scheme of the present invention is: in wireless sensor network; the dump energy information that node exchanges in subrange; the dump energy of node basis oneself the nearby height order of Area Node dump energy decides the probability that oneself is chosen as path node, thereby reaches the purpose of the dynamic self-protection of low-yield node.
Method of the present invention is simple and be easy to realize.
Description of drawings
Fig. 1: node is to the dump energy signal of the k hop neighbor broadcasting oneself of oneself, k=3 among the figure;
In Fig. 2: the t1 moment, low-yield node receives that setting the request grouping of foundation illustrates, low-yield node a is a dark color;
In Fig. 3: the t1+t moment, the neighbours of node a have received request grouping signal from other paths, and dark node a is a leaf nodes.
Embodiment
The present invention is further illustrated below in conjunction with accompanying drawing and example.
Agreement is divided into two stages, and the phase I is finished the local energy information exchange, and second stage is finished path discovery according to the energy order information that the phase I obtained.The information secondary path that second stage utilizes the phase I to obtain is found.Two stages can concurrent working, and second stage does not need one stage of grade in an imperial examination to finish just can to begin to carry out.
Agreement is divided into two stages, and the phase I is finished the local energy information exchange, as shown in Figure 1.Each node is with the dump energy information block of period T to own adjacent area diffusion oneself.Each node should be preserved a sequence number seq.Each dump energy information block is carried following information: source node i d value, seq value, this residue energy of node numerical value, ttl value.The Seq initial value is 0, and every diffusion is such grouping once, and the seq value adds 1.Ttl value is represented the scope (jumping figure) that this grouping can be spread.Like this, can avoid intermediate node to repeat to transmit by seq value and the unique energy information grouping of sign of id value.And seq can identify the freshness of energy information grouping, and node can not handled outmoded grouping.All energy information meeting in groups are continued to transmit by the local storage of neighbours back, and the value in the TTL territory of will dividing into groups before each the forwarding subtracts 1.If ttl value is 0, then stop forwarding.Suppose that the TTL initial value is k.So, each node can be received the energy information grouping that own k hop neighbor is sent in the network.Be that node can know that k jumps scope neighbours' dump energy information.In view of the above, use certain sort algorithm node can calculate the ordering of the dump energy of oneself.Node receives that whenever an energy information all can recomputate the energy order.
In addition, the interval T that node sends the energy information grouping can dynamically be determined by the speed of node according to own energy changing, if node energy changes to such an extent that just strengthen T slowly, just shortens T soon if energy changing gets.Another alternative mode is when this node energy changing surpasses a threshold value, just triggers the broadcasting of primary energy information block.So far, the phase I describes and finishes.The execution of phase I process continues to go in time.
Second stage is finished path discovery according to the energy order information that the phase I obtained.
Be example with the DD agreement below, describe the dump energy information of how using.
Suppose that node energy is divided into L rank, L 〉=2.The energy grade of node x correspondence is Lx.Such as, when L=4, can be provided with maximum preceding 50% node of dump energy, dump energy at 50%～75% node, dump energy at 75%～87.5% node, 87.5%～100% node is corresponding level L1, L2, L3, L4 respectively; Another point-score be maximum preceding 25% node of dump energy, dump energy 25%～50% node,, dump energy is at 50%～75% node, 75%～100% node is corresponding level L1, L2, L3, L4 respectively.
In diffusion interest grouping process, after intermediate node is received an interest, at first judge affiliated each rank of a rank all corresponding time of delay of the value of dump energy of oneself.For example: when L=4, L1, L2, L3, four ranks of L4 are corresponding T1 respectively, T2, T3, four time values of T4, and T1＜T2＜T3＜T4.Node postpones corresponding a period of time Tx according to the energy rank of oneself, and then transmits interest, as Fig. 2, shown in Figure 3.The Tx value should be greater than 0, less than the upper limit time of diffusion interest.Because sink only strengthens receiving at first the path of packet, can guarantee that like this it is just long more to contain many more time in path delay of more low-yield node, chosen the probability of transmission data just low more by the sink node.Therefore, in the network use, along with the reduction of path energy, the continuous transform path of sink node meeting, the higher path of energy is used in the path that dump energy is lower instead.So just protected the low-energy node can premature dead, made the consumption of network energy equilibrium.
Claims (3)
1, hungry distributed definite method of rank of wireless sensing net node energy and routing plan, it is characterized in that: in wireless sensor network, the energy information that node exchanges in subrange, the dump energy information of node basis oneself the nearby order of Area Node decides the probability that oneself is chosen as path node.
2, hungry distributed definite method of rank of wireless sense network energy according to claim 1 and routing plan, it is characterized in that: positive energy exchange information is limited in subrange.Method is: the energy information of each node broadcasts oneself, and limit a broadcasting jumping figure n.Each node can only be received the energy information of the node of the scope of n jumping on every side like this.Wherein the value of n should be much smaller than network radius.And n value size should be specified in advance.
3, hungry distributed definite method of rank of wireless sense network energy according to claim 1 and routing plan is characterized in that: the dump energy level of node basis oneself the nearby order of node decides oneself whether should be chosen as path node.Utilizing broadcasting interest to divide into groups to carry out in the agreement of request of data, energy level is divided into third gear, 1/3 the node that energy is the highest is directly transmitted the interest grouping, 1/3 node is transmitted interest with less delay in the middle of the energy row, energy comes last node and transmits the interest grouping with a bigger delay, can add a bigger time-delay and transmit interest.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008101054889A CN101572657A (en) | 2008-04-29 | 2008-04-29 | Distributed determining method and route proposal of wireless sense network energy inadequacy level |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008101054889A CN101572657A (en) | 2008-04-29 | 2008-04-29 | Distributed determining method and route proposal of wireless sense network energy inadequacy level |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101572657A true CN101572657A (en) | 2009-11-04 |
Family
ID=41231896
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008101054889A Pending CN101572657A (en) | 2008-04-29 | 2008-04-29 | Distributed determining method and route proposal of wireless sense network energy inadequacy level |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101572657A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102088751A (en) * | 2011-03-08 | 2011-06-08 | 无锡泛联物联网科技股份有限公司 | Gradient-based wireless sensor network (WSN) topology maintenance method and packet forwarding method |
| CN102118821A (en) * | 2011-02-24 | 2011-07-06 | 浙江工业大学 | Wireless sensor network distributed routing method on basis of Lagrange-Newton method |
| CN102868974A (en) * | 2012-09-15 | 2013-01-09 | 青海师范大学 | Method for adaptively routing underwater sensor network on basis of difference |
| CN103067871A (en) * | 2012-12-23 | 2013-04-24 | 江苏中科泛联物联网科技股份有限公司 | Wireless sensor network high-efficiency broadcasting method based on counting |
| CN103686924A (en) * | 2014-01-02 | 2014-03-26 | 北京航空航天大学 | Oriented diffusion routing protocol based on returned time delay in wireless sensor network |
| CN108512894A (en) * | 2018-02-05 | 2018-09-07 | 集能芯成科技（北京）有限公司 | A kind of distributed load equalizing method and system towards self energizing Sensor Network |
-
2008
- 2008-04-29 CN CNA2008101054889A patent/CN101572657A/en active Pending
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102118821A (en) * | 2011-02-24 | 2011-07-06 | 浙江工业大学 | Wireless sensor network distributed routing method on basis of Lagrange-Newton method |
| CN102118821B (en) * | 2011-02-24 | 2013-04-24 | 浙江工业大学 | Wireless sensor network distributed routing method on basis of Lagrange-Newton method |
| CN102088751A (en) * | 2011-03-08 | 2011-06-08 | 无锡泛联物联网科技股份有限公司 | Gradient-based wireless sensor network (WSN) topology maintenance method and packet forwarding method |
| CN102088751B (en) * | 2011-03-08 | 2013-07-10 | 无锡泛联物联网科技股份有限公司 | Gradient-based wireless sensor network (WSN) topology maintenance method and packet forwarding method |
| CN102868974A (en) * | 2012-09-15 | 2013-01-09 | 青海师范大学 | Method for adaptively routing underwater sensor network on basis of difference |
| CN102868974B (en) * | 2012-09-15 | 2015-08-05 | 青海师范大学 | A kind of underwater sensor network based on difference adapts to the method for route |
| CN103067871A (en) * | 2012-12-23 | 2013-04-24 | 江苏中科泛联物联网科技股份有限公司 | Wireless sensor network high-efficiency broadcasting method based on counting |
| CN103686924A (en) * | 2014-01-02 | 2014-03-26 | 北京航空航天大学 | Oriented diffusion routing protocol based on returned time delay in wireless sensor network |
| CN108512894A (en) * | 2018-02-05 | 2018-09-07 | 集能芯成科技（北京）有限公司 | A kind of distributed load equalizing method and system towards self energizing Sensor Network |
| CN108512894B (en) * | 2018-02-05 | 2021-08-24 | 集能芯成科技（北京）有限公司 | Distributed load balancing method and system for self-powered sensor network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101267404B (en) | An assister-based clustering method in Ad Hoc network | |
| CN101572657A (en) | Distributed determining method and route proposal of wireless sense network energy inadequacy level | |
| CN101808289B (en) | Method for acquiring data of wireless sensor network based on mobile sink node | |
| Yang et al. | SHORT: shortest hop routing tree for wireless sensor networks | |
| CN101119372B (en) | Cooperation energy-saving routing chart constructing method for mobile wireless sensor network | |
| CN105072661A (en) | Clustering multi-hop routing protocol of wireless sensor network | |
| CN103974367B (en) | Fault tolerant and multi-path optimization method based on HEED algorithms in wireless sensor network | |
| CN101945460B (en) | Energy-saving AODV routing method used in Ad Hoc network environment | |
| CN104734372A (en) | Energy adaptive charging method combined with geographical location routing in WRSNs | |
| TW200408232A (en) | Intelligent communication node object beacon framework(ICBF) with temporal transition network protocol (TTNP) in a mobile AD hoc network | |
| CN107295569A (en) | A kind of Routing Protocol of the energy efficient based on many mobile sink nodes | |
| CN106304243A (en) | A kind of wireless sensor network topology control method based on gesture game | |
| CN103347288B (en) | A kind of wireless sensor network does not wait width hierarchical routing protocol method | |
| Roseline et al. | Local clustering and threshold sensitive routing algorithm for wireless sensor networks | |
| Kumar et al. | Energy efficient clustering and cluster head rotation scheme for wireless sensor networks | |
| CN101827422B (en) | Simple network data collecting method of mobile wireless sensor | |
| CN105376824B (en) | A kind of mobile sensor network low-power consumption method for routing for crop field monitoring | |
| CN103249110A (en) | Dynamic-tree-based wireless sensor network target tracking method | |
| Xiao et al. | An HEED-based study of cell-clustered algorithm in wireless sensor network for energy efficiency | |
| Liu et al. | An improved energy efficient unequal clustering algorithm of wireless sensor network | |
| Xuegong | A control algorithm based on double cluster-head for heterogeneous wireless sensor network | |
| CN101572662A (en) | Energy-saving packet forwarding method based on position information in wireless sensor network | |
| CN101282299B (en) | Method for measuring displacement speed of motion body in multi-hop network | |
| Tabassum et al. | GSEN: An efficient energy consumption routing scheme for wireless sensor network | |
| Vhatkar et al. | Performance evaluation and QoS analysis of PDCH and MBC routing protocols in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20091104 |