Decentralized movement pattern detection amongst mobile geosensor nodes

26Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Movement patterns, like flocking and converging, leading and following, are examples of high-level process knowledge derived from low-level trajectory data. Conventional techniques for the detection of movement patterns rely on centralized "omniscient" computing systems that have global access to the trajectories of mobile entities. However, in decentralized spatial information processing systems, exemplified by wireless sensor networks, individual processing units may only have access to local information about other individuals in their immediate spatial vicinity. Where the individuals in such decentralized systems are mobile, there is a need to be able to detect movement patterns using collaboration between individuals, each of which possess only partial knowledge of the global system state. This paper presents an algorithm for decentralized detection of the movement pattern flock, with applications to mobile wireless sensor networks. The algorithm's reliability is evaluated through testing on simulated trajectories emerging from unconstrained random movement and correlated random walk. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Laube, P., Duckham, M., & Wolle, T. (2008). Decentralized movement pattern detection amongst mobile geosensor nodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5266 LNCS, pp. 199–216). Springer Verlag. https://doi.org/10.1007/978-3-540-87473-7_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free