CN103281696A - Distributed wireless sensor network topology reconstruction method - Google Patents

Distributed wireless sensor network topology reconstruction method Download PDF

Info

Publication number
CN103281696A
CN103281696A CN2013101722528A CN201310172252A CN103281696A CN 103281696 A CN103281696 A CN 103281696A CN 2013101722528 A CN2013101722528 A CN 2013101722528A CN 201310172252 A CN201310172252 A CN 201310172252A CN 103281696 A CN103281696 A CN 103281696A
Authority
CN
China
Prior art keywords
node
support
pairing
failure
nodes
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.)
Granted
Application number
CN2013101722528A
Other languages
Chinese (zh)
Other versions
CN103281696B (en
Inventor
傅质馨
袁越
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hohai University HHU
Original Assignee
Hohai University HHU
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hohai University HHU filed Critical Hohai University HHU
Priority to CN201310172252.8A priority Critical patent/CN103281696B/en
Publication of CN103281696A publication Critical patent/CN103281696A/en
Application granted granted Critical
Publication of CN103281696B publication Critical patent/CN103281696B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a distributed wireless sensor network topology reconstruction method, which comprises an initial pairing stage and a pairing regulation stage. In the initial pairing stage, each support node is paired with failing fixed nodes in a network according to acquired local information, and the pairing is started from any support node in a way that the support node selects a failing node which is closest to the support node for initial pairing. In the pairing regulation stage, each support node communicates with support nodes within the communication range of the support node by using pairing information for pairing regulation, and if a total displacement distance between two support nodes can be shortened by exchanging initially-paired failing nodes of the two support nodes, the two support nodes exchange the initially paired failing nodes with each other. A displacement distance between every two support nodes can be shortened by pairing exchange between the two support nodes, so that the total displacement distance of all the support nodes is also shortened, and an optimal allocation result on a set premise can be obtained after all the support nodes finish the process. The method is verified and analyzed by a simulation experiment.

Description

A kind of distributed wireless sensor network topology reconstructing method
Technical field
The present invention relates to a kind of distributed wireless sensor network topology reconstructing method, can realize that the optimization of supporting node in the wireless sensor network distributes, the failure node in the network is replaced and repaired, guarantee the monitoring performance of network.
Background technology
Wireless sensor network is compared with legacy network has the advantages that networking mode is flexible, monitoring information is comprehensive, intelligent degree is high, is a kind of brand-new information gathering and treatment technology, has expanded the human ability of obtaining information widely.Based on the plurality of advantages of wireless sensor network, it is in industrial and agricultural production, national defense and military, traffic logistics, health care, space exploration, and a plurality of fields such as building management, forecast of natural calamity have broad application prospects and huge using value.Although effectively the node deployment strategy can be optimized the network monitor performance when the network initial deployment, yet because simple in structure, the finite energy of individual node, former thereby the inefficacy because of environmental interference, depleted of energy etc. often, this changes topology of networks, and the network monitor performance is subjected to appreciable impact.
Summary of the invention
Goal of the invention: lost efficacy at part of nodes in the wireless sensor network, the problem that the network monitor performance descends, if when node failure occurring, the invention provides a kind of distributed wireless sensor network topology reconstructing method, utilize redundant support node motion to the failure node position failure node to be repaired or substituted, thereby improve or recover the monitoring performance of network.Stationary nodes was monitored to the perception information of environment and to their state around each supported the node reception, detected the node whether inefficacy is arranged.When failure node outnumbers can keep the failure node number that minimum network coverage performance requirement allows the time, support node and will match with failure node and repair or substitute.For conserve energy, each supports node will limit the communication distance of self, can only with its communication context in node carry out the information transmission, simultaneously with its communication context in support node switching failure node information and be optimized pairing.Though because only based on the nodal information of part, this algorithm may not obtain the optimal result that node distributes, do not need to depend on the single center of converging and come the collection network global information, for the practical application of network provides convenience.
Technical scheme: a kind of distributed wireless sensor network topology reconstructing method, described wireless sensor network comprises a plurality of wireless sensor nodes, is called for short node.Whether the node basis has locomotivity is divided into stationary nodes and supports node.All the time be in active state after stationary nodes is deployed in the network, in network operation process, can lose efficacy because of depleted of energy and external interference.Support node and when the network initial deployment, be in resting state with conserve energy, under the situation that the stationary nodes inefficacy occurs, can transfer active state to, be used for repairing the stationary nodes that lost efficacy.
One, network characteristics explanation
(1) arbitrary node i can both be carried out omnirange perception, its coverage
Figure BDA00003172420000021
Being one is the center of circle with the node, is the circle of radius with the perceived distance r of node, namely
Figure BDA00003172420000027
(2) arbitrary node i can both be carried out omnirange communication, its communication context Being one is the center of circle with the node, is the circle of radius with the communication distance R of node, namely
Figure BDA00003172420000028
(3) the perceived distance r of all nodes is identical respectively with communication distance R;
(4) all nodes satisfy the condition of R 〉=2r;
(5) all nodes have position consciousness;
(6) all nodes are all in same two dimensional surface.
Two, node optimization distribution method
Each supports node can obtain information around self, and all support nodes all failure node information of collection of working in concert.When network coverage performance is lower than application demand, supports node and will initiatively match with failure node and it is repaired.For conserve energy, each supports node will limit the communication distance of self, can only with its communication context in node carry out the information transmission, can reach the information of supporting the node switching failure node and be optimized pairing with its communication simultaneously.Though because only based on the nodal information of part, this algorithm may not obtain the optimal result that node distributes, and does not need to depend on the single center of converging, for the practical application of network provides convenience.
For ease of explanation, the communication that defines a certain support node u can reach the support node set
Figure BDA00003172420000025
As follows: N c u = { v ∈ M | D ( u , v ) ≤ R , v ≠ u } - - - ( 1 )
Wherein, (u, v) the Euclidean distance between node u and the support node v is supported in expression to D.R represents to support the communication distance of node.Apparently, the communication connected relation of support node and R's is big or small closely related.Generally, R is more big, and each communication of supporting node can reach that to support node more many, and the obtainable network information of institute is more many, obtains more excellent node allocation result more easily.Certainly, the size of R also is subjected to supporting the restriction of node energy.
Based on above-mentioned explanation, stationary nodes was monitored to the perception information of environment and to their state around each supported the node reception, detected the node whether inefficacy is arranged.When failure node outnumbers can keep the failure node number that minimum network coverage performance requirement allows the time, each supports node will carry out the node pairing according to following distributed suboptimum nodes-distributing method, and concrete steps are:
1) initially matches the stage.In this course, each supports local message that node passes through to obtain and the inefficacy stationary nodes in the network is matched one by one.Support node from any one, the nearest failure node of this supports node chosen distance oneself initially matches, and the nearest perception of chosen distance oneself of trying one's best can reach failure node and initially matches.Then, the next node nearest node of chosen distance in the unpaired failure node of residue of supporting initially matches.According to this principle, all are supported node and initially match with failure node one by one.At last, each supports node has the failure node of an initial pairing corresponding with one one.
2) the pairing adjusting stage.In this course, each is supported node and supports node and exchange unpaired message and match adjustment by reaching with its communication.If support nodes and find for two, if total distance that they exchanges initial pairing failure node each other will make them move shortens, then they will exchange each other initial pairing node.Particularly, be example to support node u, this process can be described below: establishing and supporting the pairing node of node u in the starting stage is failure node j u, it is j that a certain communication of support node u can reach the initial pairing failure node of supporting node v vWith Node u and failure node j are supported in expression uBetween Euclidean distance,
Figure BDA00003172420000032
For supporting node v and failure node j vBetween Euclidean distance,
Figure BDA00003172420000033
Node u and failure node j are supported in expression vBetween Euclidean distance,
Figure BDA00003172420000034
For supporting node v and failure node j uBetween Euclidean distance.If formula (2) is set up, then support node u and v and will exchange separately initial pairing node, otherwise u will keep having now the pairing state.
w u , j u + w v , j v > w u , j v + w v , j u - - - ( 2 )
Support node u and will can reach the support node set to its communication one by one
Figure BDA00003172420000036
In all nodes repeat above-mentioned pairing adjustment process, till displacement no longer reduces.After all support nodes are finished said process, with the optimum allocation result who obtains under the set prerequisite.
Obviously, the exchange of matching between per two support nodes all can make both displacement reduce, therefore all support the also minimizing of the total distance of movement of node, are with supporting the decreasing function that pairing adjustment communication number of times increases between the node Zong this means mobile distance.Because mobile total distance is inevitable greater than 0, namely the lower bound of mobile total distance function is 0, and therefore, mobile total distance will converge to minimum value after supporting pairing communication number of times limited between the node.Yet, need to prove, because this method is local message Network Based only, simultaneously, the initial pairing of supporting node and failure node has very big randomness, and is subjected to the restriction of assumed condition, therefore in theory, can make that all total distance reduces although communication is adjusted in each pairing, can not guarantee that gained node pairing result is the optimal result during institute might match, namely the total distance value of movement of the node allocation result of final acquisition differs and is decided to be minimum.
The present invention adopts technique scheme, have following beneficial effect: the residue node resource that can take full advantage of in the network is readjusted network topology structure, namely improve the monitoring performance of network by network topology reconstruct, not only can farthest prolong network life, can also significantly improve adaptivity and the fault-tolerance of network, this practical application for wireless sensor network is very significant.
Description of drawings
Fig. 1 is the initial situation figure when node failure occurring in the network;
Fig. 2 is the initial situation figure that the node of the embodiment of the invention distributes;
When being R=4r in the embodiment of the invention (20m), Fig. 3 supports the connected graph of node;
Fig. 4 is the node distribution condition figure that 20 failure nodes of the embodiment of the invention are repaired;
Fig. 5 is the network diagram of random topology structure;
Fig. 6 has the situation map of node failure for the network of random topology structure;
Fig. 7 is the initial situation figure that the node of the embodiment of the invention distributes;
Fig. 8 is the node distribution condition figure that 20 failure nodes of the embodiment of the invention are repaired.
Embodiment
Below in conjunction with specific embodiment, further illustrate the present invention, should understand these embodiment only is used for explanation the present invention and is not used in and limits the scope of the invention, after having read the present invention, those skilled in the art all fall within the application's claims institute restricted portion to the modification of the various equivalent form of values of the present invention.
Distributed wireless sensor network topology reconstructing method utilizes redundant support node motion to the failure node position failure node to be repaired or substituted, thereby improves or recover the monitoring performance of network.
One, network characteristics explanation
(1) arbitrary node i can both be carried out omnirange perception, its coverage Being one is the center of circle with the node, is the circle of radius with the perceived distance r of node, namely
Figure BDA00003172420000042
(2) arbitrary node i can both be carried out omnirange communication, its communication context Being one is the center of circle with the node, is the circle of radius with the communication distance R of node, namely
Figure BDA00003172420000044
(3) the perceived distance r of all nodes is identical respectively with communication distance R;
(4) all nodes satisfy the condition of R 〉=2r;
(5) all nodes have position consciousness;
(6) all nodes are all in same two dimensional surface.
Two, node optimization distribution method
Each supports node can obtain information around self, and all support nodes all failure node information of collection of working in concert.When network coverage performance is lower than application demand, supports node and will initiatively match with failure node and it is repaired.For conserve energy, each supports node will limit the communication distance of self, can only with its communication context in node carry out the information transmission, can reach the information of supporting the node switching failure node and be optimized pairing with its communication simultaneously.Though because only based on the nodal information of part, this algorithm may not obtain the optimal result that node distributes, and does not need to depend on the single center of converging, for the practical application of network provides convenience.
For ease of explanation, the communication that defines a certain support node u can reach the support node set
Figure BDA00003172420000051
As follows:
N c u = { v ∈ M | D ( u , v ) ≤ R , v ≠ u } - - - ( 1 )
Wherein, (u, v) the Euclidean distance between node u and the support node v is supported in expression to D.R represents to support the communication distance of node.Apparently, the communication connected relation of support node and R's is big or small closely related.Generally, R is more big, and each communication of supporting node can reach that to support node more many, and the obtainable network information of institute is more many, obtains more excellent node allocation result more easily.Certainly, the size of R also is subjected to supporting the restriction of node energy.
Based on above-mentioned explanation, stationary nodes was monitored to the perception information of environment and to their state around each supported the node reception, detected the node whether inefficacy is arranged.When failure node outnumbers can keep the failure node number that minimum network coverage performance requirement allows the time, each supports node will carry out the node pairing according to following distributed suboptimum nodes-distributing method, and concrete steps are:
1) initially matches the stage.In this course, each supports local message that node passes through to obtain and the inefficacy stationary nodes in the network is matched one by one.Support node from any one, the nearest failure node of this supports node chosen distance oneself initially matches, and the nearest perception of chosen distance oneself of trying one's best can reach failure node and initially matches.Then, the next node nearest node of chosen distance in the unpaired failure node of residue of supporting initially matches.According to this principle, all are supported node and initially match with failure node one by one.At last, each supports node has the failure node of an initial pairing corresponding with one one.
2) the pairing adjusting stage.In this course, each is supported node and supports node and exchange unpaired message and match adjustment by reaching with its communication.If support nodes and find for two, if total distance that they exchanges initial pairing failure node each other will make them move shortens, then they will exchange each other initial pairing node.Particularly, be example to support node u, this process can be described below: establishing and supporting the pairing node of node u in the starting stage is failure node j u, it is j that a certain communication of support node u can reach the initial pairing failure node of supporting node v vWith
Figure BDA00003172420000061
Node u and failure node j are supported in expression uBetween Euclidean distance,
Figure BDA00003172420000062
For supporting node v and failure node j vBetween Euclidean distance,
Figure BDA00003172420000063
Node u and failure node j are supported in expression vBetween Euclidean distance,
Figure BDA00003172420000064
For supporting node v and failure node j uBetween Euclidean distance.If formula (2) is set up, then support node u and v and will exchange separately initial pairing node, otherwise u will keep having now the pairing state.
w u , j u + w v , j v > w u , j v + w v , j u - - - ( 2 )
Support node u and will can reach the support node set to its communication one by one
Figure BDA00003172420000066
In all nodes repeat above-mentioned pairing adjustment process, till displacement no longer reduces.After all support nodes are finished said process, with the optimum allocation result who obtains under the set prerequisite.
Obviously, the exchange of matching between per two support nodes all can make both displacement reduce, therefore all support the also minimizing of the total distance of movement of node, are with supporting the decreasing function that pairing adjustment communication number of times increases between the node Zong this means mobile distance.Because mobile total distance is inevitable greater than 0, namely the lower bound of mobile total distance function is 0, and therefore, mobile total distance will converge to minimum value after supporting pairing communication number of times limited between the node.Yet, need to prove, because this method is local message Network Based only, simultaneously, the initial pairing of supporting node and failure node has very big randomness, and is subjected to the restriction of assumed condition, therefore in theory, can make that all total distance reduces although communication is adjusted in each pairing, can not guarantee that gained node pairing result is the optimal result during institute might match, namely the total distance value of movement of the node allocation result of final acquisition differs and is decided to be minimum.
Three, simulation analysis
3.1 rule topology structural network
The present invention is based on the MATLAB7.0 platform the above-mentioned algorithm of carrying is carried out simulating, verifying, the perceived distance of sensor node is r=5m, all nodes with
Figure BDA00003172420000067
The interval be deployed in regularly in the area to be monitored, the area to be monitored area is
Figure BDA00003172420000068
Suppose in a certain reconstruct cycle have 20 stationary nodes to lose efficacy in the network, as shown in Figure 1, " * " expression failure node among the figure.
In emulation, the allocation strategy of the support node when consideration is repaired all 20 inefficacy stationary nodes.At first, according to the step of distributed node allocation strategy, support node and initially match by random sequence.As shown in Figure 2, the support node that at first initially matches is 14, and the nearest perception of its chosen distance oneself can reach failure node 10 as initial pairing node.In the emulation, the support sequence node that next initially matches is: 17,4,20,9,18,3.Their initial pairing failure node sequence is: 15,36,22,25,28,41.As seen from Figure 2, more than the support node has all been selected apart from the nearest separately initial pairing of failure node conduct node, and wherein major part has been selected can reach failure node apart from nearest separately perception.Then, supporting node 11 initially matches, it considers that at first the own nearest perception of distance can reach failure node 10, but because failure node 10 has carried out initial pairing with support node 14, therefore support node 11 and have to select the own nearest failure node 9 of distance except failure node 10.Equally, next support node 2,13, also running into the situation identical with supporting node 11 in 19,15,6 the initial pairing process.The initial pairing result of all support nodes as shown in Figure 2.
As previously mentioned, the connection situation between the support node and R's is big or small closely related.Intuitively, R is more big, and each communication of supporting node can reach that to support node more many, and the information that can obtain is more many each other, and the chance adjusted of matching is also more many, obtains more excellent node allocation result therefore more easily.But the R that supports node should be reaching as far as possible little under the situation of more excellent node allocation result, to save node energy.Therefore, here the relation of supporting node connection situation and node allocation result and R is studied.Based on the hypothesis of R 〉=2r, getting R respectively is 2r, 3r, 4r, 5r, 6r, under initially pairing situation of node as shown in Figure 2, supports node connection situation and node allocation result when R is got different value and compares, and the result is as shown in table 1.In the table, support node communication number of times when pairing is adjusted and represent when R gets currency, when the total distance of the movement of all support nodes reached minimum value in the pairing adjusting stage, all supported the total degree of communication between the node.As seen from table, along with R increases, the communication of each support node can reach support node number and increase, so all support the also increase gradually of communication total degrees of nodes, but amplitude of variation is very little behind R=4r.Correspondingly, the back is adjusted in pairing, and all move and no longer change after the maximum of supporting single support node motion distance in the node significantly reduces when R=4r, and all are supported the total distance of node motion and significantly reduce before R=4r, but change slowly behind R=4r.This is because when R just begins to increase, along with can reaching the support node, the communication of supporting node increases, the chance that exchanges of matching each support node and other nodes also increases, so adjusting displacement maximum and the total distance of all support node motion of the single support node in back, communication increased frequency, pairing reduce.But, when R increases to a certain degree, because network topology structure and node initially match the result and determine, can reach the increase of support node number even therefore support the communication of node, initial pairing through certain number of times when pairing is adjusted exchanges, give-and-take conditions are not satisfied in node pairing current in the network, and the result that matches accordingly can not change again.To sum up, the monitoring performance of network and support two angles of node energy consumption and consider that the result during R=4r is best after the reconstruct.In the emulation below, suppose that each communication distance of supporting node is R=4r, the connected relation of all support nodes as shown in Figure 3 at this moment.
Table 1 is supported the relation that node is communicated with situation and node allocation result and R
In the pairing adjusting stage, based on the communication topological relation of above-mentioned initial pairing result and support node, each support node can reach the support node with the communication of oneself and exchange initial unpaired message, and initial pairing result is adjusted.Figure 4 shows that utilize the distributed node distribution method the allocation result of getable optimum.When adopting distributed method, mobile total distance very rapid convergence in inferior figure of merit 149.1501m.Though distributed algorithm is difficult to obtain the result of global optimum, but because not needing to rely on the single center of converging, it does not come to be optimized pairing to supporting node and failure node, finish the node pairing but take full advantage of the support node by transmission and the exchange of local message, thereby make network under distributed information transmission situation, have higher adaptive ability.
3.2 random topology structural network
Fig. 5 is the network of random topology structure, and the perceived distance of sensor node is r=5m, and all nodes are deployed in the area to be monitored randomly, and the area to be monitored area is (50 * 50) m 2, node is supported in " zero " expression among the figure.Suppose in a certain reconstruct cycle have 20 stationary nodes to lose efficacy in the network, as shown in Figure 6, " * " expression failure node among the figure.
Here, the support node that at first initially matches is 3, the initial pairing of the failure node 39 conducts node that its chosen distance oneself is nearest.Obviously, in the initial pairing stage, most of node of supporting can match with their nearest failure nodes.Yet, support nodes with other respectively and finished initial pairing earlier owing to support the nearest failure node of node 1,2,8,9,14,17, therefore, they obviously match node greater than other with the distance between the failure node of final initial pairing.
Still establish R=4r, all support nodes after initial pairing is finished and their communication can reach exchange pairing information between the support node.Fig. 8 by distributed method in the following obtainable optimum pairing result of the initial pairing situation of Fig. 7.As can be seen from Figure, shorten greatly when the distance between most of failure node of supporting node and finally matching is with initial pairing afterwards through matching to exchange.Because distributed method does not need to rely on the single center of converging and obtains network global information, therefore strengthen self organization ability and the intelligent degree of network of network.

Claims (2)

1. distributed wireless sensor network topology reconstructing method is characterized in that:
Whether a plurality of wireless sensor nodes certificates in the wireless sensor network are had locomotivity is divided into stationary nodes and supports node; Stationary nodes is in active state after being deployed all the time, is used for obtaining the information of area to be monitored, can lose efficacy because of depleted of energy and external interference in network operation process; Support node and when the network initial deployment, be in resting state, under the situation that the stationary nodes inefficacy occurs, can transfer active state to, be used for repairing the stationary nodes that lost efficacy;
Stationary nodes was monitored to the perception information of environment and to their state around each supported the node reception, detected the node whether stationary nodes has inefficacy; When failure node outnumbers can keep the failure node number that minimum network coverage performance requirement allows the time, support node and will match one by one with failure node and repair or substitute; Each supports node will limit the communication distance of self, can only with its communication context in node carry out the information transmission, simultaneously with its communication context in support node switching failure node information and be optimized pairing, chosen distance is supported the failure node that the nearest perception of node can reach and not be paired and is initially matched; Match adjustment again, in this course, each is supported node and supports node and exchange unpaired message and match adjustment by reaching with its communication, if two are supported total distance shortening that node switching initial pairing failure node each other will make them move, then support node switching initial pairing node each other for described two.
2. distributed wireless sensor network topology reconstructing method as claimed in claim 1, it is characterized in that: in being optimized the pairing process, the communication that defines a certain support node u can reach the support node set
Figure FDA00003172419900012
As follows:
N c u = { v ∈ M | D ( u , v ) ≤ R , v ≠ u } - - - ( 1 )
Wherein, and D (u, v) the Euclidean distance between node u and the support node v is supported in expression; R represents to support the communication distance of node;
1) initially match the stage: in this course, the local message that each support node passes through to obtain and the inefficacy stationary nodes in the network are matched one by one; Support node from any one, the nearest failure node of this support node chosen distance oneself initially matches; Then, the next node nearest node of chosen distance in the unpaired failure node of residue of supporting initially matches; Supporting node up to all initially matches with failure node one by one; At last, each supports node has the failure node of an initial pairing corresponding with one one.
2) the pairing adjusting stage: in this course, establishing and supporting the pairing node of node u in the starting stage is failure node j u, it is j that a certain communication of support node u can reach the initial pairing failure node of supporting node v vWith
Figure FDA00003172419900022
Node u and failure node j are supported in expression uBetween Euclidean distance,
Figure FDA00003172419900023
For supporting node v and failure node j vBetween Euclidean distance,
Figure FDA00003172419900024
Node u and failure node j are supported in expression vBetween Euclidean distance, For supporting node v and failure node j uBetween Euclidean distance; If formula (2) is set up, then support node u and v and will exchange separately initial pairing node, otherwise u will keep having now the pairing state;
w u , j u + w v , j v > w u , j v + w v , j u - - - ( 2 )
Support node u and will can reach the support node set to its communication one by one In all nodes repeat above-mentioned pairing adjustment process, till displacement no longer reduces.
CN201310172252.8A 2013-05-10 2013-05-10 A kind of distributed wireless sensor network topology reconstructing method Expired - Fee Related CN103281696B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310172252.8A CN103281696B (en) 2013-05-10 2013-05-10 A kind of distributed wireless sensor network topology reconstructing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310172252.8A CN103281696B (en) 2013-05-10 2013-05-10 A kind of distributed wireless sensor network topology reconstructing method

Publications (2)

Publication Number Publication Date
CN103281696A true CN103281696A (en) 2013-09-04
CN103281696B CN103281696B (en) 2016-01-06

Family

ID=49064108

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310172252.8A Expired - Fee Related CN103281696B (en) 2013-05-10 2013-05-10 A kind of distributed wireless sensor network topology reconstructing method

Country Status (1)

Country Link
CN (1) CN103281696B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103888074A (en) * 2014-03-21 2014-06-25 河海大学 Self-healing method of distributed photovoltaic array state monitoring network
CN104034939A (en) * 2014-06-06 2014-09-10 河海大学 Voltage signal sampling and reconstructing method for photovoltaic power generation system
CN104661328A (en) * 2015-03-12 2015-05-27 中国矿业大学 Method for remodeling wireless remaining sensor network in complex environment
CN110187385A (en) * 2019-06-27 2019-08-30 北京中油瑞飞信息技术有限责任公司 Seismic data acquisition method, seismic data processing technique and device
CN113873460A (en) * 2021-08-30 2021-12-31 中铁二十局集团有限公司 Sewage monitoring system, method and device and computer readable storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101925100A (en) * 2010-09-03 2010-12-22 东华大学 Fault-tolerant routing recovery method of heterogeneous wireless sensor network
CN102111789A (en) * 2010-12-24 2011-06-29 北京邮电大学 Method for repairing fault of wireless sensor network
CN102595412A (en) * 2012-01-10 2012-07-18 南京邮电大学 Wireless sensor network clustering topology control method based on mobile nodes

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101925100A (en) * 2010-09-03 2010-12-22 东华大学 Fault-tolerant routing recovery method of heterogeneous wireless sensor network
CN102111789A (en) * 2010-12-24 2011-06-29 北京邮电大学 Method for repairing fault of wireless sensor network
CN102595412A (en) * 2012-01-10 2012-07-18 南京邮电大学 Wireless sensor network clustering topology control method based on mobile nodes

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
丁海霞: "无线传感器网络节能路由算法研究", 《微型机与应用》, 16 May 2011 (2011-05-16) *
张振江: "关于无线传感器网络节能的几个关键问题研究", 《中国优秀硕士论文全文数据库》, 19 March 2010 (2010-03-19) *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103888074A (en) * 2014-03-21 2014-06-25 河海大学 Self-healing method of distributed photovoltaic array state monitoring network
CN103888074B (en) * 2014-03-21 2016-04-27 河海大学 A kind of distributed photovoltaic array status monitoring network self-healing method
CN104034939A (en) * 2014-06-06 2014-09-10 河海大学 Voltage signal sampling and reconstructing method for photovoltaic power generation system
CN104661328A (en) * 2015-03-12 2015-05-27 中国矿业大学 Method for remodeling wireless remaining sensor network in complex environment
CN104661328B (en) * 2015-03-12 2018-02-02 中国矿业大学 The remodeling procedure of wireless remaining sensor network under a kind of complex environment
CN110187385A (en) * 2019-06-27 2019-08-30 北京中油瑞飞信息技术有限责任公司 Seismic data acquisition method, seismic data processing technique and device
CN113873460A (en) * 2021-08-30 2021-12-31 中铁二十局集团有限公司 Sewage monitoring system, method and device and computer readable storage medium

Also Published As

Publication number Publication date
CN103281696B (en) 2016-01-06

Similar Documents

Publication Publication Date Title
CN103281696A (en) Distributed wireless sensor network topology reconstruction method
CN101594657A (en) In the radio sensing network based on the election of cluster head method of soft-threshold
Hassan Oudani et al. Energy efficient in wireless sensor networks using cluster-based approach routing
CN104411000A (en) Method for selecting cluster head of hierarchical routing protocol in wireless sensor network
Tang et al. A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink
CN103281704A (en) Method for deploying wireless sensor network in deterministic space based on three-dimensional sensing
CN101835233B (en) Wireless sensor network oriented random route selecting method
Ahmed et al. Cluster head selection using decision trees for wireless sensor networks
CN107743302A (en) Rate-allocation and route combined optimization algorithm in wireless sensor network based on compressed sensing
Kandukuri et al. A single-hop clustering and energy efficient protocol for wireless sensor networks
CN103281697B (en) A kind of wireless sensor network topology reconstructing method of center type
Qi et al. Topology evolution of wireless sensor networks based on adaptive free-scale networks
Oudani et al. Minimize energy consumption in wireless sensor network using hierarchical protocols
CN101808383A (en) Method for selecting matrix wireless sensor network-oriented random routing
Santo Gitakarma et al. Designing Wireless Sensor Network Routing on Agriculture Area Using The LEACH Protocol
CN102158888B (en) Data forwarding method based on random walk backup and node cooperation
Khalil et al. Coverage and connectivity protocol for wireless sensor networks
Yue et al. A novel cluster-based data fusion algorithm for wireless sensor networks
Liaw et al. The steady clustering scheme for heterogeneous wireless sensor networks
CN104270797B (en) Network clustering method of wireless sensor based on side betweenness
Bhavana et al. Spatial correlation based clustering algorithm for random and uniform topology in WSNs
Kaur et al. Improvement In LEACH protocol by electing master cluster heads to enhance the network lifetime in WSN
Murdan Optimisation of the Wireless Sensor Network with the Multi-hop LEACH protocol for the Smart Grid
Neela et al. A comprehensive cross-layer framework for optimization of correlated data gathering in wireless sensor networks
Bano et al. Lightweight multi-agent framework for a cluster-based 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
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: 20160106

Termination date: 20180510