Share Email Print
cover

Proceedings Paper

Dynamic resource allocation for target tracking in sensor and robot networks
Author(s): Xiaoning Shan; Jindong Tan
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Sensor network is generally composed of a set of sensors with limited computation capability and power supply. Thus, a well-defined allocation scheme is essential for maintaining the whole sensor network. This paper investigates the dynamic resource allocation problem in a sensor and robot networks for mobile target tracking tasks. Most of sensors will be in sleep mode except for the ones that can contribute for tracking. The sensor network resource allocation is achieved by a hierarchical structure--clustering. Upon detecting an interested event, a set of sensors form a cluster. Only cluster members will be activated during the tracking task. The cluster headship and membership will be updated based on the target's movement properties. In this paper, the clustering algorithm considers sensing area with communication holes and a routing tree is set up within the cluster. For a cluster with communication and/or sensing holes, mobile sensors will be deployed to enhance the sensing and communication capability in the clustering area. Simulations have been used to verify the proposed algorithm.

Paper Details

Date Published: 20 May 2005
PDF: 10 pages
Proc. SPIE 5778, Sensors, and Command, Control, Communications, and Intelligence (C3I) Technologies for Homeland Security and Homeland Defense IV, (20 May 2005); doi: 10.1117/12.603617
Show Author Affiliations
Xiaoning Shan, Michigan Technological Univ. (United States)
Jindong Tan, Michigan Technological Univ. (United States)


Published in SPIE Proceedings Vol. 5778:
Sensors, and Command, Control, Communications, and Intelligence (C3I) Technologies for Homeland Security and Homeland Defense IV
Edward M. Carapezza, Editor(s)

© SPIE. Terms of Use
Back to Top