IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications 2007
DOI: 10.1109/infcom.2007.283
|View full text |Cite
|
Sign up to set email alerts
|

MCTA: Target Tracking Algorithm Based on Minimal Contour in Wireless Sensor Networks

Abstract: Abstract-This paper proposes a minimal contour tracking algorithm (MCT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(31 citation statements)
references
References 10 publications
0
31
0
Order By: Relevance
“…Initially, all the nodes are provided with the energy of 60 joules. The energy consumption, network lifetime and the tracking accuracy is measured and compared against PPSS [13] and MCTA [14].…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Initially, all the nodes are provided with the energy of 60 joules. The energy consumption, network lifetime and the tracking accuracy is measured and compared against PPSS [13] and MCTA [14].…”
Section: Resultsmentioning
confidence: 99%
“…An energy efficient target tracking algorithm is presented in [14], which tends to minimize the count of working nodes. The working nodes are selected on the basis of kinematics principle.…”
Section: Review Of Literaturementioning
confidence: 99%
“…A real-time target tracking system with WSNs is designed in [3,4], which adopts an energy management scheme to make sensor nodes rotate in active and sleep state to conserve energy of the network. Moreover, some scheduling and wake-up topics are analyzed.…”
Section: Related Workmentioning
confidence: 99%
“…It has been applied in various areas such as disaster predication, emergency response, battlefield surveillance, home and office control, etc. Many target tracking protocols have been proposed to support long-term surveillance by using large scale WSNs [1][2][3][4][5].…”
Section: Introductionmentioning
confidence: 99%
“…This can lead to fast energy exhaustion of nodes, and hence shortening the lifetime of the network. Many researchers try to overcome the point coverage problem by designing a suitable scheduling strategy for making nodes on and off in such a way that in each time slice, only nodes which can sense the target points in that period are on [13,14,15,16,17,18,19,20]. In this method, many nodes are scattered randomly throughout the filed, and the criterion of minimum number of required nodes addressed by the scheduling mechanism which tries to minimize the number of nodes being in on state according to their ability to sense the target points.…”
Section: Introductionmentioning
confidence: 99%