Moving targets tracking and observing in a distributed mobile sensor network

Authors:
Hung M. La;Weihua Sheng
Affiliations:
School of Electrical and Computer Engineering, Oklahoma State University, Stillwater, OK;School of Electrical and Computer Engineering, Oklahoma State University, Stillwater, OK
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 3
Cited 1

Flocks, herds and schools: A distributed behavioral model

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A new approach to the minimum cut problem

Journal of the ACM (JACM)
Coordination without communication: the case of the flocking problem

Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)

Description and composition of bio-inspired design patterns: a complete overview

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tracking and observing multiple dynamic targets is an important task in mobile sensor networks. This paper presents a novel approach to the problem of sensor splitting/merging for a mobile sensor network to track and observe multiple targets in a dynamic fashion. In this approach, a seed growing graph partition (SGGP) algorithm is proposed to solve the splitting/merging problem. Furthermore, during the process of tracking, collision avoidance and velocity matching among mobile sensors are guaranteed. To demonstrate the benefit of the SGGP algorithm in term of the total energy and time consumption when sensors split, we compare the SGGP with a random selection (RS) algorithm. Numerical experimental tests validate our theoretical results.