CN101247284B - Service life prediction technique facing regular band shaped wireless sensor network - Google Patents
Service life prediction technique facing regular band shaped wireless sensor network Download PDFInfo
- Publication number
- CN101247284B CN101247284B CN2008100611917A CN200810061191A CN101247284B CN 101247284 B CN101247284 B CN 101247284B CN 2008100611917 A CN2008100611917 A CN 2008100611917A CN 200810061191 A CN200810061191 A CN 200810061191A CN 101247284 B CN101247284 B CN 101247284B
- Authority
- CN
- China
- Prior art keywords
- node
- cut set
- network
- life
- banded
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
The invention provides a method for predicating the life time of a distributing-type ribbon pattern wireless sensor network, which can satisfy the requirement for predicating the remaining life time of the ribbon pattern wireless sensor network. The invention assumes that the location of a node is given, requiring the node being disposed in rule. The invention is characterized in that: every node independently confirms a network cut set based and containing the node according to the local network knowledge, then confirms the average consumption of the node in the cut set in a period of time and calculates the life time of the cut set combining the remaining total energy of the cut set node; confirming the life time value of the cut set with the shortest life time in the network by transmitting a signaling to a convergence node through a node with the furthest distance to the convergence node. The life time of the network is obtained when the convergence node receives the signaling. The method for predicating life time of the invention adopts distributing-type method, which is simple and easy to be realized, applicable for ribbon pattern network.
Description
Technical field
The present invention relates to a kind of life-span prediction method towards banded wireless sensor network, this method is mainly used to the life prediction problem of the banded wireless sensor network of solution rule type.
Background technology
Banded wireless sensor network has wide application prospect enclosing the imitative invasion in boundary, intelligent transportation system, river/aspects such as bridge monitoring, is just becoming a branch of wireless sensor network fast development recently and is just beginning to obtain a lot of practical applications.Characteristics such as that the topmost characteristics of banded wireless sensor network are that network design is is banded, the node in the network has finite energy, quantity is big.The life prediction of banded wireless sensor network is a major issue disposing and safeguard this class network.Still find no at present the report that closes banded wireless sensor network life Forecasting Methodology aspect.Banded wireless sensor network may present " one " font, ring-like, multiple topological structure such as ring-like.In general, under the banded wireless sensor network structure, the length of " band " is longer, narrower in width.The strip sensor network is made up of sensor node and aggregation node (Sink).
There are two kinds of situations in the banded network of blockiness: a kind of is each Sink of two ends of sensing zone, and another kind is that an end is Sink, and an other end is a sensor node.Under the previous case, the node on the sensing zone will select contiguous Sink to carry out the data report, and it is fixed that the mode of selection is come by Routing Protocol.The then all Sink of sensor node on the other end of latter event carry out data and report.
The banded network life of blockiness is meant: for the banded network of one section blockiness, from current time, to split into the disjunct two periods duration owing to energy loss, be called the life-span of the banded topological structure of this section.
It is known that the present invention establishes node location, and knowing of node location can be by GPS, perhaps based on the method for estimating distance of range finding etc.How to carry out node locating not at the row of the present invention's discussion.
Summary of the invention
The objective of the invention is to propose a kind of life-span prediction method that is applied to the banded wireless sensor network disposed under the multi-form rule, provided specific algorithm.
Technical scheme of the present invention may further comprise the steps:
Step 1: each sensor node in the network is determined the cut set based on oneself; Calculate this cut set at the energy consumption mean value of T in the time;
Step 2: the independent residual life that calculates own place cut set of each node (as x) in the network;
Step 3: the residual life of determining banded network.
The present invention propose life-span prediction method, be easy to realize, can effectively predict the life-span of banded wireless sensor network, thereby simplify banded wireless sensor network management.
Description of drawings
Fig. 1: the banded wireless sensor network schematic diagram of line style rule.
Fig. 2: the banded wireless sensor network schematic diagram of line style rule of a plurality of sensor nodes in every position.
Fig. 3: regular banded wireless sensor network (wherein the width of sensing zone is significantly smaller than node transmission radius) schematic diagram with certain width.
Embodiment
Below in conjunction with drawings and Examples, the present invention is further illustrated.
Each node among the present invention in the hypothetical network is battery-powered, and possesses the ability that detects own current residual electric weight, has the maximum transmitted radius, the power control ability is not limit.Sensing net image data by sensor node along banded structure to Sink transmit, banded network has narrower width (that is: banded network-wide is significantly smaller than node transmission radius, as 5 meters of banded net width, 30 meters of node maximum transmitted radiuses).Networking topologic network structure there is not specific (special) requirements.
The present invention in conjunction with above-mentioned node capacity requirement, predicts the life-span of banded sensing net according to above-mentioned network design rule.
Banded wet end management side formula as shown in Figure 1, 2, 3.Among above-mentioned three figure, node rule is deployed on the sensing zone equably, and wherein Fig. 1, Fig. 2 are a line.Fig. 3 is " arrowband " wireless sensor network, and wherein width L is far smaller than sensor node transmission radius.Each position is laid node, each position of Fig. 2 and is laid a plurality of nodes among Fig. 1.Be among Fig. 2 on the same position node we be called with the cluster knot point.Be in the node of same column among Fig. 3, we are called the same column node.Describe for shortcut calculation, we claim under Fig. 1 structure that the number of every row node is 1.We to Sink not the node row (or node cluster) of homonymy be numbered separately, node row (or node cluster) numbering far away apart from Sink is high more, adds 1 at every turn, nearest column number is 1.Suppose that Sink is node row (or node cluster), it is numbered 0.If one have a plurality of Sink on the sensing zone, the row of certain sensor node number are by deciding apart from its near Sink so.Distance can be decided by jumping figure, energy isometry, specifically depends on corresponding routing algorithm.The present invention allows certain node location error, as long as the scope of site error is less than the distance between the adjacent segments point range (or node cluster).
Among the present invention the banded net life-span of regular pattern composite determine mainly be according to each cut set residue transport capacity of banded network and in the unit interval total energy consumption determine that the life-span of a ribbon net is by the shortest cut set decision of its life-span.
The definite method of using among the present invention based on the localized network cut set of node is: each node is according to topological knowledge, banded network topology characteristic in its double bounce scope in the network, calculating comprises own to interior banded net cut set, in the computational process according to positional information, apart from the far and near information of Sink, determine a node set, thereby make banded net residue node no longer be communicated with.
Now (note is x with any one sensor node in the x row (x is any permissible value, also can be x bunch, for simplicity, classifies example as with node)
i) be the example explanation.On the basis that comprises its same column node, from the close-by examples to those far off, each row, comprise the node row more farther successively than x row nodal distance Sink, set up up to one of following condition: (1) a certain row k, the node of node in the k row and x-1 row is non-conterminous, and perhaps (2) no longer include the bigger row of numbering.All nodes that are listed as k-1 row from x are called x so
iCut set.The cut set computational methods of all nodes are identical in the network.By these cut set computational methods as can be seen, the cut set that calculates of different nodes that list is identical.Given this, in our supposition bunch an election regulation is arranged, can select a specified node and be responsible for cut set and calculate, the node of simple election regulation such as current remaining maximum, number minimum node, position node placed in the middle etc.Every pair of node of a cut set inside all is a direct neighbor.
The life-span prediction method of the banded wireless sensor network of rule oriented of the present invention requires each node to add up interior energy consumption of T time in the past, and concrete steps are as follows:
Step 1: each sensor node (as x) in the network is determined cut set based on oneself according to the cut set computational methods of introducing above, add up node in this cut set in the past the energy consumption summation in the T time (note is ERG
T x) and the current remaining summation (note is Total_ERG_Left
T x).T is a bigger system parameters.In one month anticipation network life-span when conducting oneself in society deployment such as network, T can be 1 hour so.Like this, by adding up the energy consumption summation of one period long period, can reduce predicated error.Calculate this cut set at the energy consumption mean value of T in the time, note is done:
Avg_ERG_Last wherein
T xBe energy consumption mean value in the last T time.α is one 0 to 1 a decimal.α is big more, and energy consumption mean value proportion is big more in the current T time, otherwise history average proportion is big more.The optimization of the value of α need be measured by experiment.It is worthy of note that an exception is the netinit stage, calculate Avg_ERG for the first time
T xThe time,
That is: the average energy consumption in the current T time interval equals current sample value.
Step 2: node x calculates the residual life of the cut set at own place:
Step 3: apart from the Sink node cluster farthest or the residual life of the specified node of the node row cut set that begins to calculate its place.It sends to this value the specified node of the next column nearer apart from Sink (or bunch) node by signaling grouping then.After receiving this signaling, this specified node at first calculates the residual life of own place cut set, if the life value that local calculated value carries less than signaling grouping substitutes the life value that signaling is carried with local calculated value so, continue afterwards to send this signaling to the specified node of next column (or bunch) node.The node of receiving this signaling repeats said process.After Sink receives this signaling grouping, be uploaded to the manager.The entrained life value of this signaling is exactly the residual life of the banded network of this section.
Obviously, in the aforementioned calculation process, the banded net life-span of the blockiness of asking by the shortest cut set decision of life-span on this sensing zone.Above-mentioned banded net cut set based on local knowledge determines that method and life-span prediction method carry out comparatively simply, and each cut set life prediction value can be along with the operation of network, because of the variation of offered load presents certain fluctuation.Thereby whole section network life predicted value also can present certain fluctuation.But, owing to all adopt the energy consumption mean value in the past period to calculate in every cut set life-span computational process, thereby guaranteed the reliability of predicted value.
Claims (1)
1. the life-span prediction method of the banded wireless sensor network of a rule oriented is characterized in that may further comprise the steps:
Step 1: each sensor node in the network is determined the cut set based on oneself; Calculate this cut set at the energy consumption mean value of T in the time;
The definite concrete grammar based on own cut set of each sensor node is in the described network: sensor node is according to topological knowledge, banded network topology characteristic in its double bounce scope, calculating comprises own to interior banded net cut set, in the computational process according to positional information, apart from the far and near information of Sink, determine a node set, thereby make that after node death in this set banded net residue node no longer is communicated with;
Described calculating cut set at the concrete grammar of T energy consumption mean value in the time is: statistics is the total energy consumption of this cut set all nodes of T in the time in the past
Average energy consumption in the T time that last time calculates
Calculate this cut set again at the energy consumption mean value of T in the time
X represents to carry out the node of this computing, and α is one 0 to 1 a decimal, and T is a system parameters, and expression a period of time at interval;
Step 2: each node x independently calculates the residual life of own place cut set in the network; Concrete grammar is: each sensor node is according to the average energy consumption of cut set in cut set of determining and T time, in conjunction with all node total surplus energy in the cut set
Calculate the cut set residual life
Step 3: the residual life of determining banded network, concrete grammar is: by initiating a network life deterministic process from distance Sink node farthest, this is crossed range request and sends a signaling grouping apart from Sink node farthest to Sink, comprise the life-span that promoter itself calculates the own determined cut set of gained in the signaling, issue next-hop node then; For the node of receiving this signaling,, then, continue then to transmit this signaling grouping to Sink with the life value in this littler value replacement signaling if oneself determine that the life-span of cut set is shorter; This process will continue to carry out receiving this signaling up to Sink; At this moment, the life value that carries of this signaling is exactly the life value of the banded net of this section.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100611917A CN101247284B (en) | 2008-03-20 | 2008-03-20 | Service life prediction technique facing regular band shaped wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100611917A CN101247284B (en) | 2008-03-20 | 2008-03-20 | Service life prediction technique facing regular band shaped wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101247284A CN101247284A (en) | 2008-08-20 |
| CN101247284B true CN101247284B (en) | 2010-12-29 |
Family
ID=39947510
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100611917A Expired - Fee Related CN101247284B (en) | 2008-03-20 | 2008-03-20 | Service life prediction technique facing regular band shaped wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101247284B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102149117B (en) * | 2010-02-09 | 2013-07-31 | 中国科学院上海微系统与信息技术研究所 | Service life predicating method of wireless ribbon sensing network based on cut point set |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1439867A (en) * | 2002-02-21 | 2003-09-03 | 欧姆龙株式会社 | Predictive method for surplus life, temperature testing structure and electronic device |
| CN1708958A (en) * | 2002-12-20 | 2005-12-14 | 国际商业机器公司 | Maximum lifetime routing in wireless ad-hoc network |
| CN101013987A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | High-efficiency controlling method of wireless sensor network topology |
-
2008
- 2008-03-20 CN CN2008100611917A patent/CN101247284B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1439867A (en) * | 2002-02-21 | 2003-09-03 | 欧姆龙株式会社 | Predictive method for surplus life, temperature testing structure and electronic device |
| CN1708958A (en) * | 2002-12-20 | 2005-12-14 | 国际商业机器公司 | Maximum lifetime routing in wireless ad-hoc network |
| CN101013987A (en) * | 2007-02-05 | 2007-08-08 | 南京邮电大学 | High-efficiency controlling method of wireless sensor network topology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101247284A (en) | 2008-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102292990B1 (en) | Method and apparatus of sharing information related to status | |
| CN107911242A (en) | A kind of cognitive radio based on industry wireless network and edge calculations method | |
| GB2502775A (en) | Selecting routes between nodes in a network based on node processing gain and lifetime | |
| CN102625319B (en) | Method and device for realizing wireless cognitive sensor network | |
| CN104410582A (en) | Traffic balancing method for electric power communication network based on traffic prediction | |
| JP2007267381A (en) | Method and apparatus for controlling data transmission | |
| Keskın et al. | Lifetime maximization in wireless sensor networks using a mobile sink with nonzero traveling time | |
| Turgut et al. | Heuristic approaches for transmission scheduling in sensor networks with multiple mobile sinks | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| US20170310395A1 (en) | System and method for communication network service connectivity | |
| Gupta et al. | Energy aware data collection in wireless sensor network using chain based PEGASIS | |
| CN109219942A (en) | Massage pattern control | |
| CN102969720A (en) | Load dynamic control and analysis method capable of being applied in smart power grids | |
| Tavakoli et al. | A fuzzy based energy efficient clustering routing protocol in underwater sensor networks | |
| CN101247284B (en) | Service life prediction technique facing regular band shaped wireless sensor network | |
| CN117793847A (en) | Method, device and equipment for recovering fast route of multi-hop network | |
| Hosseini et al. | MB-FLEACH: a new algorithm for super cluster head selection for wireless sensor networks | |
| CN107911834B (en) | Method for constructing optimal DAG (demand oriented architecture) in lifetime in data-centered wireless sensor network | |
| US20080256270A1 (en) | Quality of service based preemptive routing | |
| US10244511B1 (en) | Systems and methods for selecting a node management device in a wireless network | |
| CN107529128B (en) | Routing method and system of intelligent power distribution network wireless sensor network | |
| Mejdoubi et al. | A distributed predictive road traffic management system in urban VANETs | |
| Ahir et al. | Energy efficient clustering algorithm for data aggregation in wireless sensor network | |
| Wang et al. | The optimum sensor redeployment scheme using the most frangible clusters set | |
| Lu et al. | Backup path with energy prediction based on energy-aware spanning tree in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CAS JIAXING WIRELESS SENSOR NETWORK ENGINEERING CE Free format text: FORMER OWNER: CAS JIAXING CENTER MICROSYSTEMS INTITUTE BRANCH CENTER Effective date: 20100205 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20100205 Address after: 2, building 1, No. 778 Asia Pacific Road, Nanhu District, Zhejiang, Jiaxing Province, China: 314000 Applicant after: Jiaxing Wireless Sensor Network Engineering Center, Chinese Academy of Sciences Address before: A, building four, block JRC, Asia Pacific Road, Nanhu District, Zhejiang City, Jiaxing Province, China: 314000 Applicant before: Microsystem Inst. Branch Center, Jiaxing Center, CAS |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| 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: 20101229 Termination date: 20180320 |