CN101765095B - Tracking method for wireless sensor network moving target based on mixed cluster - Google Patents

Tracking method for wireless sensor network moving target based on mixed cluster Download PDF

Info

Publication number
CN101765095B
CN101765095B CN200910155053XA CN200910155053A CN101765095B CN 101765095 B CN101765095 B CN 101765095B CN 200910155053X A CN200910155053X A CN 200910155053XA CN 200910155053 A CN200910155053 A CN 200910155053A CN 101765095 B CN101765095 B CN 101765095B
Authority
CN
China
Prior art keywords
node
bunch
cluster
dynamic cluster
static
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
Application number
CN200910155053XA
Other languages
Chinese (zh)
Other versions
CN101765095A (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.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
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 Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN200910155053XA priority Critical patent/CN101765095B/en
Publication of CN101765095A publication Critical patent/CN101765095A/en
Application granted granted Critical
Publication of CN101765095B publication Critical patent/CN101765095B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a tracking method for a wireless sensor network moving target based on a mixed cluster. A sensor network is divided into non-overlapping static cluster sets, and the boundary nodes and boundary area of each static cluster are judged according to the relative positions of nodes; when a target enters the network and is not detected by any boundary node, the static cluster takes charge of tracking the moving target; when the target moves to the boundary area and is detected by the boundary nodes, a new dynamic cluster is triggered in real time to manage the exact position and dynamic tracking of the target; and with the target moving, new real-time dynamic clusters are continuously triggered and cooperate with the static clusters to realize dynamic real-time monitoring of the moving target. Different from a traditional moving target tracking method, the invention provides the detecting method based on the boundary nodes, forms the mixed cluster structure by combining the strong real-time dynamic clusters triggered as required into the static cluster network, effectively solves the problem of target tracking boundary in the static cluster network, and has the advantages of low target losing rate, low energy consumption and strong expandability.

Description

A kind of tracking method for wireless sensor network moving target based on mixed cluster
Technical field
The present invention relates to a kind of tracking method for wireless sensor network moving target based on mixed cluster, belong to the wireless sensor network field.
Background technology
Wireless sensor network forms by being deployed in sensor nodes a large amount of in the monitored area, form a multihop self-organizing network by communication between node, perceptive object information in the perception that can cooperate, the acquisition and processing network's coverage area, and send to groups of users interested.Movable object tracking is that the typical case of wireless sensor network one of uses, and has widely Military Application and civilian applications prospect, such as battlefield surroundings monitoring, logistics security management, patient health monitoring and disaster emergency relief etc.Movable object tracking problem based on wireless sensor network faces a plurality of challenges: how to utilize sensor node limited in one's ability to satisfy the hi-Fix demand; How the rational management sensor network nodes is to reduce track rejection rate and prolong network lifetime.Therefore, need the method for tracking moving target of a kind of Energy Efficient of design to satisfy user and system requirements.
Present already present typical case comprises DCTC based on the method for tracking moving target of wireless sensor network, Dynamic Clustering, four kinds of ADCT and DPT.DCTC method (Dynamic convoytree-based collaboration) is (referring to W.S.Zhang and G.H.Cao.DCTC:DynamicConvoy Tree-Based Collaboration for Target Tracking in Sensor Networks.IEEETransactions on Wireless Communications, 3 (5), 1689-1701,2004.) adopt the structure collector node based on tree to detect information, the target proximity node forms one and escorts tree, node detected information with the estimating and forecasting target location during root node was responsible for collecting and is set, along with the movement of target, escort tree based on the old node of the continuous cutting of information of forecasting and add new node to save the network energy consumption.Dynamic Clustering method is (referring to W.P. bunch of leader en and J.C.Hou and L.Sha.Dynamic Clustering for AcousticTarget Tracking in Wireless Sensor Networks.IEEE Transactions on MobileComputing, 3 (3), 258-271,2004.) depend on powerful node (bunch leader), when the information strength value that detects as bunch leader surpasses critical value, bunch leader transfers active state to, and near the node the wake up target forms a Dynamic Cluster to realize information synergism between node; ADCT method (Adaptive DynamicCluster-based Tracking) is (referring to W.C.Yang and Z.Fu and J.H.Kim and M.S.Park.An Adaptive Dynamic Cluster-Based Protocol for Target Tracking in WirelessSensor Networks.LNCS, 156-167,2007.) not by means of powerful heterogeneous node, any node all might become a bunch leader; The method comprises two execution phases: bunch leader's election stage and bunch formation stages, the nearest node of distance objective is chosen as a bunch leader usually, bunch leader wakes on every side that a hop neighbor node forms a Dynamic Cluster up, and node is reported information and led to respective cluster, bunch leader's estimating and forecasting target location; Along with Suitable For Moving-goal Problems, Dynamic Cluster constantly forms and disappears.Different from top three kinds of classical ways, DPT method (Distributed Predictive Tracking) is (referring to H.Yang and B.Sikdar.A Protocol forTracking Mobile Targets using Sensor Networks.Proc.of IEEE IWSNPA, 71-81,2003.) then proposed based on static bunch target following pattern to improve extensibility and the energy efficient of method for tracking moving target, bunch leader collects member node and detects information, the estimating and forecasting target location, and the leader node at prior notice predicted position place bunch, new bunch leader woke three suitable nodes up and detects target before target arrives.
Based on the DCTC method of tree structure farthest collector node detect information, realize effective cooperation between node, prune dynamically dynamic tree and effectively save node work energy consumption along with Suitable For Moving-goal Problems simultaneously; Yet, dynamically escort tree and generate and safeguard complexity, need a large amount of node energies that consume.Dynamic Clustering and ADCT belong to pure Dynamic Cluster method.Dynamic Clustering depends on the backbone network that powerful node forms, select appropriate node to form Dynamic Cluster, and information in time sent to the base station by backbone network, energy consumption is low, real-time, yet the method realizes by means of powerful heterogeneous node, in case the track rejection phenomenon namely occurs heterogeneous node failure; In contrast, the robustness of ADCT method is high, but the generation of Dynamic Cluster and maintenance simultaneously also can lot of energies.Relatively, high based on the DPT method extensibility of static clustering architecture, need not to generate and safeguard dynamic tree, energy consumption is low, yet in static bunch fixing member's structure be unfavorable for bunch and bunch between the live collaboration of node, positioning accuracy is low, and at bunch boundary the track rejection phenomenon occurs easily.This shows that existing method for tracking moving target can only satisfy the demand of user and system in one aspect, do not consider the dynamic equilibrium relation between energy efficient, node cooperation and the real-time Transmission three; In addition, above-mentioned classical way all depends on prediction algorithm and wakes in advance respective nodes up and detect target, and therefore, the performance of prediction algorithm will greatly affect location and tracking effect, even causes the generation of track rejection phenomenon.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art, a kind of tracking method for wireless sensor network moving target based on mixed cluster is provided.
Tracking method for wireless sensor network moving target based on mixed cluster comprises following steps:
1) after sensor network disposition is finished, each node is by ID and the geographical location information of broadcasting self, network is divided into bunch set of not overlapping static state, and each static bunch comprises a bunch of leader and a plurality of member node, can reach by a jumping or multi-hop between bunch leader and member node;
2) each static bunch interior nodes attribute is divided into two classes, boundary node and non-boundary node, and each node determines whether boundary node and identification borderline region according to static bunch spatial division and neighbor node spatial positional information;
3) without in the monitoring mission requirements situation, node is in resting state to save energy consumption, receive bunch leader's WAKEUP data-signal bag when node after, node is converted to rapidly operating state and fulfils the target detection responsibility, when node was reported detection information, adopting based on the method that detects information strength was that each Node configuration timer delayed delivery time is to avoid data transmission collision;
4) target is shifted to boundary node and when being detected by boundary node, Dynamic Cluster is triggered immediately, Dynamic Cluster triggers forming process and comprises two execution phases: bunch leader of Dynamic Cluster chooses with Dynamic Cluster and forms, and after Dynamic Cluster forms, identifies immediately Dynamic Cluster inner boundary node;
5) different according to the network monitoring execution pattern, proposes three kinds bunches between the real-time transfer plan of tracing task: transfer Dynamic Cluster for static bunch, Dynamic Cluster is transferred static bunch and Dynamic Cluster transfer Dynamic Cluster.
Described each node determines whether that according to static bunch spatial division and neighbor node spatial positional information the boundary node step is: node be boundary node and if only if exists at least a neighbor node that belongs to any other bunches in its perception detects distance, have following logical expression:
Figure G200910155053XD00031
In the formula: B I.stateThe boundary condition of expression node, B I.state=1 representation node is boundary node, B I.state=0 representation node is not boundary node; l i, l jDifference representation node i, the geographical location information of j; r sRepresent the unified detection distance of all nodes; N (v i) the neighbor node collection of representation node i; CH (v i), CH (v j) difference representation node i, bunch leader of j.
Describedly according to static bunch spatial division and neighbor node spatial positional information identification borderline region step be: borderline region refers at least by two different static bunch zones that interior nodes covered;
Described employing based on the method that detects information strength for each Node configuration timer delayed delivery time take avoid the data transmission collision step as: the set timer rule is as follows:
BT i = W size β r th r i + σ i
Wherein: BT iThe timer value that the representative sensor node i will arrange; W SizeRepresentative retreats window size; r iThe detection signal strength value of representative sensor node i; r ThThe representative sensor node is judged the detection signal strength critical value whether target occurs; σ iRepresent the random time spacing value; When timer stopped, node sent real-time detection information to bunch leader, and the nodal distance target is nearer, and its detection signal strength value is larger, and it waits for that transmitting time is shorter.
Bunch leader's selecting step of described Dynamic Cluster is: choose in the boundary node that current time detects target and have the node of maximum signal as bunch leader of Dynamic Cluster, be expressed as follows:
L dc ( t + 1 ) = v i = arg max v i ∈ B j ( t ) | | r i | |
Wherein: L Dc(t+1): bunch leader of the Dynamic Cluster that (t+1) constantly will trigger; v iRepresentation node i; B j(t): current t detects the boundary node collection of target constantly.
Described Dynamic Cluster forms step: the neighbor node that Dynamic Cluster bunch leader wakes up in the jumping scope forms new Dynamic Cluster.
Described identification Dynamic Cluster inner boundary node step is: Dynamic Cluster member node be the Dynamic Cluster boundary node and if only if exists at least a neighbor node that does not belong to Dynamic Cluster to detect within the distance at it, be expressed as follows:
Figure G200910155053XD00042
Wherein: B I.vstateThe boundary condition of expression node, B I.vstate=1 representative is that node is the Dynamic Cluster boundary node, B I.vstate=0 representation node is not the Dynamic Cluster boundary node; l i, l jDifference representation node i, the geographical location information of j; N (v i) the neighbor node collection of representation node i; DC represents respectively Dynamic Cluster.
Described static state bunch is transferred a Dynamic Cluster step: can not transfer at once tracing task to Dynamic Cluster for static bunch, but after Dynamic Cluster waits for that goal verification enters borderline region, transfer tracing task to static bunch of request.
Described Dynamic Cluster is transferred static bunch step: when Dynamic Cluster confirms that target is not detected by any static state bunch boundary node, initiatively transfer tracing task to static bunch.
Described Dynamic Cluster is transferred the Dynamic Cluster step: after new Dynamic Cluster was triggered formation, current Dynamic Cluster was initiatively transferred tracing task at once to new Dynamic Cluster.
Along with the movement of target, Dynamic Cluster constantly is triggered to cooperate static bunch tracked mobile target.
The present invention is compared with existing technology, and the beneficial effect that has is:
The Dynamic Cluster thought that 1) will trigger as required incorporates in the static bunch network configuration, is specially adapted to effective tracking of moving target in the massive wireless sensor;
2) greatly improve the real-time of extensibility, manageability and the transfer of data of network based on static bunch the network architecture;
3) concept of proposition Dynamic Cluster has solved the border issue that can't cooperate in boundary bunch intermediate node;
4) concept that proposes bunch inner boundary node and borderline region need not to avoid predicated error to the adverse effect of tracking effect by means of prediction algorithm and network global knowledge to judge whether border between close bunch of target, has improved the stability of target following effect.
5) compare with conventional art, method for tracking moving target of the present invention effectively balance energy consumption and tracking accuracy, specifically, under identical constraint, this method has the energy consumption (as shown in Figure 3) of compromise; This method has maximum target detection coverage rate (as shown in Figure 4); This method has minimum track rejection rate (as shown in Figure 5); Wherein DCTC is for dynamically escorting the tree method for tracking target, and ADCT is self adaptation Dynamic Cluster method for tracking target, and DPT is the Distributed Predictive method for tracking target, and HCTT is the wireless sensor network target tracking method based on mixed cluster that the present invention proposes.
Description of drawings
Fig. 1 is that Dynamic Cluster of the present invention triggers, static bunch of transfer tracing task to Dynamic Cluster and Dynamic Cluster transferred tracing task to static bunch schematic diagram;
Fig. 2 is that Dynamic Cluster of the present invention triggers and Dynamic Cluster is transferred tracing task to the Dynamic Cluster schematic diagram;
Fig. 3 is that the energy consumption of different target tracking under different predicated errors compares;
Fig. 4 is that the monitoring coverage rate of different target tracking under different predicated errors compares;
Fig. 5 is that the track rejection rate of different target tracking under different predicated errors compares;
Fig. 6 is a kind of tracking method for wireless sensor network moving target schematic diagram based on mixed cluster.
Embodiment
Tracking method for wireless sensor network moving target based on mixed cluster comprises following steps:
1) after sensor network disposition is finished, each node is by ID and the geographical location information of broadcasting self, network is divided into bunch set of not overlapping static state, and each static bunch comprises a bunch of leader and a plurality of member node, can reach by a jumping or multi-hop between bunch leader and member node;
2) each static bunch interior nodes attribute is divided into two classes, boundary node and non-boundary node, and each node determines whether boundary node and identification borderline region according to static bunch spatial division and neighbor node spatial positional information;
3) without in the monitoring mission requirements situation, node is in resting state to save energy consumption, receive bunch leader's WAKEUP data-signal bag when node after, node is converted to rapidly operating state and fulfils the target detection responsibility, when node was reported detection information, adopting based on the method that detects information strength was that each Node configuration timer delayed delivery time is to avoid data transmission collision;
4) target is shifted to boundary node and when being detected by boundary node, Dynamic Cluster is triggered immediately, Dynamic Cluster triggers forming process and comprises two execution phases: bunch leader of Dynamic Cluster chooses with Dynamic Cluster and forms, and after Dynamic Cluster forms, identifies immediately Dynamic Cluster inner boundary node;
5) different according to the network monitoring execution pattern, proposes three kinds bunches between the real-time transfer plan of tracing task: transfer Dynamic Cluster for static bunch, Dynamic Cluster is transferred static bunch and Dynamic Cluster transfer Dynamic Cluster.
Described each node determines whether that according to static bunch spatial division and neighbor node spatial positional information the boundary node step is: node be boundary node and if only if exists at least a neighbor node that belongs to any other bunches in its perception detects distance, have following logical expression:
Figure G200910155053XD00051
In the formula: B I.stateThe boundary condition of expression node, B I.state=1 representation node is boundary node, B I.state=0 representation node is not boundary node; l i, l jDifference representation node i, the geographical location information of j; r sRepresent the unified detection distance of all nodes; N (v i) the neighbor node collection of representation node i; CH (v i), CH (v j) difference representation node i, bunch leader of j.
Describedly according to static bunch spatial division and neighbor node spatial positional information identification borderline region step be: borderline region refers at least by two different static bunch zones that interior nodes covered;
Described employing based on the method that detects information strength for each Node configuration timer delayed delivery time take avoid the data transmission collision step as: the set timer rule is as follows:
BT i = W size β r th r i + σ i
Wherein: BT iThe timer value that the representative sensor node i will arrange; W SizeRepresentative retreats window size; r iThe detection signal strength value of representative sensor node i; r ThThe representative sensor node is judged the detection signal strength critical value whether target occurs; σ iRepresent the random time spacing value; When timer stopped, node sent real-time detection information to bunch leader, and the nodal distance target is nearer, and its detection signal strength value is larger, and it waits for that transmitting time is shorter.
Bunch leader's selecting step of described Dynamic Cluster is: choose in the boundary node that current time detects target and have the node of maximum signal as bunch leader of Dynamic Cluster, be expressed as follows:
L dc ( t + 1 ) = v i = arg max v i ∈ B j ( t ) | | r i | |
Wherein: L Dc(t+1): bunch leader of the Dynamic Cluster that (t+1) constantly will trigger; v iRepresentation node i; B j(t): current t detects the boundary node collection of target constantly.
Described Dynamic Cluster forms step: the neighbor node that Dynamic Cluster bunch leader wakes up in the jumping scope forms new Dynamic Cluster.
Described identification Dynamic Cluster inner boundary node step is: Dynamic Cluster member node be the Dynamic Cluster boundary node and if only if exists at least a neighbor node that does not belong to Dynamic Cluster to detect within the distance at it, be expressed as follows:
Wherein: B I.vstateThe boundary condition of expression node, B I.vstate=1 representative is that node is the Dynamic Cluster boundary node, B I.vstate=0 representation node is not the Dynamic Cluster boundary node; l i, l jDifference representation node i, the geographical location information of j; N (v i) the neighbor node collection of representation node i; DC represents respectively Dynamic Cluster.
Described static state bunch is transferred a Dynamic Cluster step: can not transfer at once tracing task to Dynamic Cluster for static bunch, but after Dynamic Cluster waits for that goal verification enters borderline region, transfer tracing task to static bunch of request.
Described Dynamic Cluster is transferred static bunch step: when Dynamic Cluster confirms that target is not detected by any static state bunch boundary node, initiatively transfer tracing task to static bunch.
Described Dynamic Cluster is transferred the Dynamic Cluster step: after new Dynamic Cluster was triggered formation, current Dynamic Cluster was initiatively transferred tracing task at once to new Dynamic Cluster.
Embodiment:
Now 1,2 and 6 explanation specific embodiments of the invention are by reference to the accompanying drawings:
1) sensor network being divided into not overlapping static state bunch set step is:
When sensor network disposition behind the monitored area, ID and geographical location information by each node broadcasts self, the sensor network that is deployed in area-of-interest is divided into a plurality of not overlapping static state bunch set, each static bunch comprises a bunch of leader and a plurality of member node, can reach by a jumping or multi-hop between bunch leader and member node.
Generally, bunch leader's energy consumption is energy consumption between balance node greater than the energy consumption of member node, strengthens system robustness, and node must be served as a bunch head by turns, and therefore, network is every to be spent one period cycle and need to carry out again sub-clustering.
2) determine whether that according to static bunch spatial division and neighbor node spatial positional information boundary node and identification borderline region step are:
Static bunch boundary node is defined as: node be boundary node and if only if exists at least one to belong to arbitrarily that the neighbor node of other bunches detects within the distance at it, have following expression:
Figure G200910155053XD00071
In the formula: B I.stateThe boundary condition of expression node, B I.state=1 representation node is boundary node, B I.state=0 representation node is not boundary node; l i, l jDifference representation node i, the geographical location information of j; r sRepresent the unified detection distance of all nodes; N (v i) the neighbor node collection of representation node i; CH (v i), CH (v j) difference representation node i, bunch leader of j.
Each node defines according to boundary node in the network, judges whether self is boundary node, if boundary node arranges state B I.state=1, otherwise, state B is set I.state=0.
Borderline region refers at least by two different static bunch zones that interior nodes covered
1) concrete steps of node detection and information report process are:
A. after target entered network, the working node of target proximity can detect target and report detection signal strength r iTo bunch leader, a bunch leader judge draw target oneself bunch in, and in waking up bunch all nodes to detect target.
B. synchronization may have a plurality of nodes to detect simultaneously target, and information need to be reported to a bunch leader.For avoiding data collision, each node that detects target arranges a timer according to detection signal strength self, until timer is when stopping, node sends detection information to a bunch leader.
The set timer rule is as follows:
BT i = W size β r th r i + σ i
Wherein: BT iThe timer value that the representative sensor node i will arrange; W SizeRepresentative retreats window size; r iThe signal strength values that the representative sensor node i detects; r ThThe representative sensor node is judged the signal strength signal intensity critical value whether target occurs; σ iRepresent the random time spacing value, send conflict to evade identical any two node datas of input intensity.
Based on the setting of this timer rule, the node that detection signal strength is larger (it is larger to be generally the information quality entropy) the report time is more not only avoided data collision, simultaneously so that obtaining information is more valuable.
A. after a bunch leader receives node detection data, adopt the location algorithm estimating target position (x such as barycenter location, maximal possibility estimation Est, y Est).
2) step of Dynamic Cluster trigger process and boundary node identification is:
A. along with Suitable For Moving-goal Problems, the node that detects target is constantly reported detection information to bunch leader.When a bunch leader received that boundary node detects information, bunch leader's judgement drew target near also entering borderline region, needs to trigger the Dynamic Cluster process.Bunch leader at first selects current time to detect in the boundary node of target to have the node of maximum signal as bunch leader of Dynamic Cluster, and sends the DCLEADER data packets to this node.
Dynamic Cluster bunch leader's selection rule is expressed as follows:
L dc ( t + 1 ) = v i = arg max v i ∈ B j ( t ) | | r i | |
Wherein: L Dc(t+1): bunch leader of the Dynamic Cluster that (t+1) constantly will trigger; v iRepresentation node i; B j(t): current t detects the boundary node collection of target constantly.
B. after this node receives DCLEADER information, oneself state is set is bunch leader, and broadcasting RECRUIT packets of information.Each receives the node answer CONFIRM packets of information of RECRUIT packets of information to bunch leader, and sets up a new node state table, preserves Dynamic Cluster information.After bunch leader receives the CONFIRM packets of information of node, store the state information of member node, Dynamic Cluster forms.
C. after Dynamic Cluster formed, each Dynamic Cluster member node judged whether self is the Dynamic Cluster boundary node.The Dynamic Cluster boundary node is defined as: Dynamic Cluster member node be the Dynamic Cluster boundary node and if only if exists at least a neighbor node that does not belong to Dynamic Cluster to detect within the distance at it, have following logical expression:
Figure G200910155053XD00083
Wherein: B I.vstateThe boundary condition of expression node, B I.vstate=1 representative is that node is the Dynamic Cluster boundary node, B I.vstate=0 representation node is not the Dynamic Cluster boundary node; l i, l jDifference representation node i, the geographical location information of j; N (v i) the neighbor node collection of representation node i; DC represents Dynamic Cluster.
D. the Dynamic Cluster member node defines according to boundary node, judges that whether self is boundary node, if be boundary node, arranges state B I.vstate=1, otherwise, state B is set I.vstate=0.
3) tracing task is transferred step and is bunch:
Three kinds of transfer situations of tracing task between introducing bunch in conjunction with Fig. 1 and Fig. 2.
A. static bunch of transfer tracing task is as follows to the concrete steps of Dynamic Cluster:
A. as shown in Figure 1, work at present bunch is static bunch A, and when target was moved to a some b by an a, boundary node detected target, the Dynamic Cluster D1 formation that is triggered.At this moment, do not transfer at once tracing task to Dynamic Cluster, but wait for when goal verification enters borderline region and just transferring for static bunch.When bunch leader of D1 received that node is reported information, goal verification entered borderline region.
B. bunch leader (D1) transfers to bunch leader (A) transmission REQUEST bag request task of static bunch, after receiving the REQUEST bag, bunch leader (A) sends the AGREE packets of information and agrees that the leader transfers, and sends historical target estimated value to a bunch leader (D1);
C. after receiving the AGREE bag, a bunch leader (D1) at first broadcasts the WAKEUP bag and wakes this bunch member node up, then replys SUCCESS and wraps to a bunch leader (A);
D. after receiving the SUCCESS bag, bunch leader (A) broadcasting DISMISS bag, any member node that does not belong to simultaneously the static state bunch A of Dynamic Cluster D1 receives that entering resting state after DISMISS wraps saves energy consumption.
B. Dynamic Cluster transfer tracing task is as follows to static bunch concrete steps:
A. as shown in Figure 1, work at present bunch is Dynamic Cluster D1, when target is moved to a some d by a c, if report detection information without any a static state bunch boundary node, triggers Dynamic Cluster and transfers tracing task to static bunch.
B. bunch leader (D1) sends the HANDOFF information notification packet to a bunch leader (D) of static bunch, and sends historical target estimated value to a bunch leader (D);
C. after receiving the HANDOFF packets of information, a bunch leader (D) at first broadcasts the WAKEUP bag and wakes this bunch member node up, then replys SUCCESS and wraps to a bunch leader (D1);
D. after receiving the SUCCESS bag, bunch leader (D1) broadcasting DISMISS bag, the knot removal Dynamic Cluster information list of any DISMISS of receiving bag withdraws from Dynamic Cluster.
C. Dynamic Cluster is transferred tracing task to Dynamic Cluster:
A. as shown in Figure 2, when prevariety is Dynamic Cluster D2, when target by a b when a c enters static bunch of D, D2 can not transfer tracing task to static bunch, when the Dynamic Cluster boundary node detects target, the Dynamic Cluster D3 formation that is triggered.Bunch leader (D2) sends a HANDOFF information notification packet to a bunch leader (D3), and sends historical target estimated value to a bunch leader (D3);
B. after receiving the HANDOFF packets of information, a bunch leader (D3) at first broadcasts the WAKEUP bag and wakes this bunch member node up, then replys SUCCESS and wraps to a bunch leader (D2);
After receiving the SUCCESS bag, bunch leader (D2) broadcasting DISMISS bag, the knot removal Dynamic Cluster information list of any DISMISS of receiving bag withdraws from Dynamic Cluster D2.
Above-mentioned specific embodiment is used for explaining the present invention, rather than limits the invention, and in the protection range of spirit of the present invention and claim, to not inventing any modification and the change of making, all falls into protection scope of the present invention.

Claims (9)

1. tracking method for wireless sensor network moving target based on mixed cluster is characterized in that comprising following steps:
1) after sensor network disposition is finished, each node is by ID and the geographical location information of broadcasting self, network is divided into bunch set of not overlapping static state, and each static bunch comprises a bunch of leader and a plurality of member node, can reach by a jumping or multi-hop between bunch leader and member node;
2) each static bunch interior nodes attribute is divided into two classes, boundary node and non-boundary node, and each node determines whether boundary node and identification borderline region according to static bunch spatial division and neighbor node spatial positional information;
3) without in the monitoring mission requirements situation, node is in resting state to save energy consumption, receive bunch leader's WAKEUP data-signal bag when node after, node is converted to rapidly operating state and fulfils the target detection responsibility, when node was reported detection information, adopting based on the method that detects information strength was that each Node configuration timer delayed delivery time is to avoid data transmission collision;
4) target is shifted to boundary node and when being detected by boundary node, Dynamic Cluster is triggered immediately, Dynamic Cluster triggers forming process and comprises two execution phases: bunch leader of Dynamic Cluster chooses with Dynamic Cluster and forms, and after Dynamic Cluster forms, identifies immediately Dynamic Cluster inner boundary node;
5) different according to the network monitoring execution pattern, proposes three kinds bunches between the real-time transfer plan of tracing task: transfer Dynamic Cluster for static bunch, Dynamic Cluster is transferred static bunch and Dynamic Cluster transfer Dynamic Cluster.
2. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1, it is characterized in that: described each node determines whether that according to static bunch spatial division and neighbor node spatial positional information the boundary node step is: node be boundary node and if only if exists at least a neighbor node that belongs to any other bunches in its perception detects distance, have following logical expression:
Figure FSB00000885166800011
In the formula: B I.stateThe boundary condition of expression node, B I.state=1 representation node is boundary node, B I.state=0 representation node is not boundary node; l i, l jDifference representation node i, the geographical location information of j; r sRepresent the unified detection distance of all nodes; N (v i) the neighbor node collection of representation node i; CH (v i), CH (v j) difference representation node i, bunch leader of j.
3. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1 is characterized in that: describedly according to static bunch spatial division and neighbor node spatial positional information identification borderline region step be: borderline region refers at least by two different static bunch zones that interior nodes covered.
4. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1, it is characterized in that: bunch leader's selecting step of described Dynamic Cluster is: choose in the boundary node that current time detects target and have the node of maximum signal as bunch leader of Dynamic Cluster, be expressed as follows:
L dc ( t + 1 ) = v i = arg max v i ∈ B j ( t ) | | r i | |
Wherein: L Dc(t+1): bunch leader of the Dynamic Cluster that (t+1) constantly will trigger; r iThe detection signal strength value of representative sensor node i, v iRepresentation node i; B j(t): current t detects the boundary node collection of target constantly.
5. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1 is characterized in that: described Dynamic Cluster forms step and is: the neighbor node that Dynamic Cluster bunch leader wakes up in the jumping scope forms new Dynamic Cluster.
6. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1, it is characterized in that: described identification Dynamic Cluster inner boundary node step is: Dynamic Cluster member node be the Dynamic Cluster boundary node and if only if exists at least a neighbor node that does not belong to Dynamic Cluster to detect within the distance at it, be expressed as follows:
Figure FSB00000885166800022
Wherein: B I.vstateThe boundary condition of expression node, B I.vstate=1 representative is that node is the Dynamic Cluster boundary node, B I.vstate=0 representation node is not the Dynamic Cluster boundary node; l i, l jDifference representation node i, the geographical location information of j; N (v i) the neighbor node collection of representation node i, r sRepresentation node detects distance; DC represents Dynamic Cluster.
7. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1, it is characterized in that: a described static state bunch transfer Dynamic Cluster step is: can not transfer at once tracing task to Dynamic Cluster for static bunch, but after Dynamic Cluster waits for that goal verification enters borderline region, transfer tracing task to static bunch of request.
8. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1, it is characterized in that: described Dynamic Cluster is transferred static bunch step and is: when Dynamic Cluster confirms that target is not detected by any static state bunch boundary node, initiatively transfer tracing task to static bunch.
9. a kind of tracking method for wireless sensor network moving target based on mixed cluster as claimed in claim 1, it is characterized in that: described Dynamic Cluster is transferred the Dynamic Cluster step and is: after new Dynamic Cluster was triggered formation, current Dynamic Cluster was initiatively transferred tracing task at once to new Dynamic Cluster.
CN200910155053XA 2009-12-14 2009-12-14 Tracking method for wireless sensor network moving target based on mixed cluster Expired - Fee Related CN101765095B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200910155053XA CN101765095B (en) 2009-12-14 2009-12-14 Tracking method for wireless sensor network moving target based on mixed cluster

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200910155053XA CN101765095B (en) 2009-12-14 2009-12-14 Tracking method for wireless sensor network moving target based on mixed cluster

Publications (2)

Publication Number Publication Date
CN101765095A CN101765095A (en) 2010-06-30
CN101765095B true CN101765095B (en) 2013-03-13

Family

ID=42496053

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200910155053XA Expired - Fee Related CN101765095B (en) 2009-12-14 2009-12-14 Tracking method for wireless sensor network moving target based on mixed cluster

Country Status (1)

Country Link
CN (1) CN101765095B (en)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102143495B (en) * 2011-03-16 2013-12-18 中山爱科数字科技股份有限公司 Method for detecting node attack in wireless sensor network
CN102256269B (en) * 2011-08-30 2014-02-26 苏州大学 Detection-information-fusion-based wireless sensor network deterministic deployment method
CN102647727B (en) * 2012-04-16 2014-11-05 西安交通大学 Selection method of mixed cooperation cluster
US9668141B2 (en) * 2012-07-12 2017-05-30 Huawei Technologies Co., Ltd. Systems and methods for clustering optimization to help resolve boundary problems in communication systems
CN104063740B (en) * 2013-03-21 2017-11-17 日电（中国）有限公司 Office's group of entities identifying system, method and device
CN103747531A (en) * 2013-10-08 2014-04-23 北京科技大学 Cooperative clustering transmission method
CN104219704B (en) * 2014-09-24 2017-09-29 河海大学常州校区 Monitoring poisonous gas and method for tracing based on double layer grid model in wireless sensor network
CN104253867B (en) * 2014-09-24 2017-08-15 河海大学常州校区 Monitoring poisonous gas and method for tracing based on respiratory mechanism in wireless sensor network
CN106034342B (en) * 2015-03-12 2019-08-27 北京信威通信技术股份有限公司 The abnormal processing method of cluster routing is taken off in a kind of wireless self-networking
CN105072571B (en) * 2015-07-01 2018-10-23 河海大学常州校区 A kind of localization method based on pulse communication in wireless nano sensor network
CN106792969B (en) * 2017-01-23 2019-09-06 浙江工商大学 A kind of energy efficient hybrid wireless sensor network routing method
CN107360215A (en) * 2017-06-21 2017-11-17 深圳市盛路物联通讯技术有限公司 Data method for controlling reporting and system based on geographical position in a kind of Internet of Things
US10498555B2 (en) 2018-03-13 2019-12-03 Ambit Microsystems (Shanghai) Ltd. System for combining wireless sensor networks and method thereof
CN108650634B (en) * 2018-05-18 2020-07-28 南京邮电大学 Wireless sensor network target tracking method based on track prediction
CN110290461A (en) * 2019-07-05 2019-09-27 上海赛图计算机科技股份有限公司 A kind of method and system improving indoor position accuracy
CN111970716B (en) * 2020-08-14 2023-06-20 河海大学常州校区 Fluid boundary extraction method based on classified hyperplane search in underwater acoustic sensor network

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459979A (en) * 2008-12-25 2009-06-17 浙江大学 Systematic networking method based on wireless sensor network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459979A (en) * 2008-12-25 2009-06-17 浙江大学 Systematic networking method based on wireless sensor network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Zhibo Wang et al.Tracking and Predicting Moving Targets in Hierarchical Sensor Networks.《Networking, Sensing and Control, 2008. ICNSC 2008. IEEE International Conference on》.2008,全文. *
俞靓,王志波等.面向移动目标追踪的无线传感器网络QoS指标体系设计.《计算机学报》.2009,第32卷(第3期),全文. *

Also Published As

Publication number Publication date
CN101765095A (en) 2010-06-30

Similar Documents

Publication Publication Date Title
CN101765095B (en) Tracking method for wireless sensor network moving target based on mixed cluster
Wang et al. A survey of energy-efficient scheduling mechanisms in sensor networks
CN105474673B (en) Signaling is directly controlled in wireless communication system
Anastasi et al. How to prolong the lifetime of wireless sensor networks
Liu et al. Distributed clustering algorithms for data-gathering in wireless mobile sensor networks
Jiang et al. Lifetime elongation for wireless sensor network using queue-based approaches
Tripathi et al. Energy efficient LEACH-C protocol for wireless sensor network
CN101442459B (en) Networking scheme with high expansibility for wireless sensor network
CN108924786B (en) Wireless sensor network data acquisition method facing environmental emergency
CN103139863A (en) Method of target tracking and energy consumption optimization of dynamic cluster mechanism of wireless sensor network
CN107222900B (en) Wireless sensor network node cooperation method based on dynamic chain
CN107682905A (en) A kind of stellar chain type wireless sensor network is without layer communication method
CN103249110A (en) Dynamic-tree-based wireless sensor network target tracking method
CN104270805A (en) Dynamic-target-tracking-oriented sleeping scheduling method for nodes of energy capturing sensor network
Kiyani et al. DCSE: A dynamic clustering for saving energy in wireless sensor network
Liu et al. An improved energy efficient unequal clustering algorithm of wireless sensor network
CN102186229B (en) Independent basic service set (IBSS) system and power management method thereof
CN112911519B (en) Routing method for WSN linear coverage dormancy scheduling based on target distance
Gupta et al. Exploiting multi-channel clustering for power efficiency in sensor networks
Xu et al. Maximizing throughput for low duty-cycled sensor networks
US8073014B2 (en) Method and apparatus for synchronizing nodes
CN104703257A (en) Wireless sensor network distributed clustering and sleep scheduling method specific to target detection
CN106507440B (en) Sensor network system, networking and information interaction method
Chao et al. Energy Efficient Protocol for Corona-Based Wireless Sensor Network
Xing et al. Herd-based target tracking protocol 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
C53 Correction of patent for invention or patent application
CB03 Change of inventor or designer information

Inventor after: Wang Zhi

Inventor after: Wang Zhibo

Inventor after: Sun Xice

Inventor before: Wang Zhibo

Inventor before: Sun Xice

COR Change of bibliographic data

Free format text: CORRECT: INVENTOR; FROM: WANG ZHIBO SUN XICE TO: WANG ZHI WANG ZHIBO SUN XICE

C53 Correction of patent for invention or patent application
CB03 Change of inventor or designer information

Inventor after: Wang Zhi

Inventor after: Wang Zhibo

Inventor after: Sun Xice

Inventor after: Li An

Inventor after: Chen Honglong

Inventor before: Wang Zhi

Inventor before: Wang Zhibo

Inventor before: Sun Xice

COR Change of bibliographic data

Free format text: CORRECT: INVENTOR; FROM: WANG ZHI WANG ZHIBO SUN XICE TO: WANG ZHI WANG ZHIBO SUN XICE LI AN CHEN HONGLONG

C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130313

Termination date: 20151214

EXPY Termination of patent right or utility model