Advances in Data and Web Management
DOI: 10.1007/978-3-540-72524-4_19
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Dynamic Cluster-Based Protocol for Target Tracking in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 41 publications
(21 citation statements)
references
References 6 publications
0
21
0
Order By: Relevance
“…Phase I: Leader selection (1) Leader node dc ← (2) for each sensor node detecting the target do (3) if it does not receive any election message then (4) broadcasts its election message and waits for a predefined timeout period for election messages from neighbor nodes (5) if it does not receive any message during the period then (6) elects itself as the cluster head dc (7) else (8) elects the node with the highest received signal as the cluster head dc Phase II: Dynamic cluster construction (1) dynamic cluster set dc ← (2) dc broadcasts a recruit message (3) while node V receiving the recruit message do (4) V .leader ← dc (5) V replies a confirm message (6) while dc receives a confirm message from V do (7) dc ← dc ∪ {V } Phase III: Boundary node formation (1) boundary nodes set dc ← (2) for each node V ∈ dc do (3) while ∃V ∈ (V ) such that ( , ) ≤ and…”
Section: International Journal Of Distributed Sensor Networkmentioning
confidence: 99%
See 2 more Smart Citations
“…Phase I: Leader selection (1) Leader node dc ← (2) for each sensor node detecting the target do (3) if it does not receive any election message then (4) broadcasts its election message and waits for a predefined timeout period for election messages from neighbor nodes (5) if it does not receive any message during the period then (6) elects itself as the cluster head dc (7) else (8) elects the node with the highest received signal as the cluster head dc Phase II: Dynamic cluster construction (1) dynamic cluster set dc ← (2) dc broadcasts a recruit message (3) while node V receiving the recruit message do (4) V .leader ← dc (5) V replies a confirm message (6) while dc receives a confirm message from V do (7) dc ← dc ∪ {V } Phase III: Boundary node formation (1) boundary nodes set dc ← (2) for each node V ∈ dc do (3) while ∃V ∈ (V ) such that ( , ) ≤ and…”
Section: International Journal Of Distributed Sensor Networkmentioning
confidence: 99%
“…For example, it facilitates spatial reuse of resources to increase the system capacity [2]; it also benefits local collaboration and routing [3,4]. Recently, the cluster structure is gradually adopted for solving the target tracking problem [5][6][7][8][9][10][11][12][13]. Normally, nodes surrounding the target collaborate with each other to estimate the location of the target.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…So that the node can be a member of different clusters at different time and it minimizes the localization error [1]. Unless static clustering, dynamically it forms the cluster with sensors.…”
Section: Dynamic Cluster Based Target Trackingmentioning
confidence: 99%
“…Target tracking applications can be cluster based [1]- [8] spanning tree based [9], and prediction based [10], [11]. In spanning tree based algorithms, nodes which detect the target select a root and construct a spanning tree.…”
Section: Introductionmentioning
confidence: 99%