A distributed algorithm for managing multi-target identities in wireless ad-hoc sensor networks

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

Abstract

This paper presents a scalable distributed algorithm for computing and maintaining multi-target identity information. The algorithm builds on a novel representational framework, Identity-Mass Flow, to overcome the problem of exponential computational complexity in managing multi-target identity explicitly. The algorithm uses local information to efficiently update the global multi-target identity information represented as a doubly stochastic matrix, and can be efficiently mapped to nodes in a wireless ad hoc sensor network. The paper describes a distributed implementation of the algorithm in sensor networks. Simulation results have validated the Identity-Mass Flow framework and demonstrated the feasibility of the algorithm. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Shin, J., Guibas, L. J., & Zhao, F. (2003). A distributed algorithm for managing multi-target identities in wireless ad-hoc sensor networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2634, 223–238. https://doi.org/10.1007/3-540-36978-3_15

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