Sensor Scheduling Algorithm Target Tracking-Oriented

HTML  Download Download as PDF (Size: 119KB)  PP. 295-299  
DOI: 10.4236/wsn.2011.38030    5,462 Downloads   10,231 Views  Citations

Affiliation(s)

.

ABSTRACT

Target tracking is a challenging problem for wireless sensor networks because sensor nodes carry limited power recourses. Thus, scheduling of sensor nodes must focus on power conservation. It is possible to extend the lifetime of a network by dynamic clustering and duty cycling. Sensor Scheduling Algorithm Target Tracking-oriented is proposed in this paper. When the target occurs in the sensing filed, cluster and duty cycling algorithm is executed to scheduling sensor node to perform taking task. With the target moving, only one cluster is active, the other is in sleep state, which is efficient for conserving sensor nodes’ limited power. Using dynamic cluster and duty cycling technology can allocate efficiently sensor nodes’ limited energy and perform tasks coordinately.

Share and Cite:

D. Yan and J. Wang, "Sensor Scheduling Algorithm Target Tracking-Oriented," Wireless Sensor Network, Vol. 3 No. 8, 2011, pp. 295-299. doi: 10.4236/wsn.2011.38030.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.