|
||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||
ABSTRACT
We propose a localized sensor localization scheme making full use of controlled mobility of a location-aware actor and the connectivity of the sensor network. It contains two new algorithms: a unscented particle filter (UPF) based localization algorithm and an actor mobility scheduling algorithm. The former is an application of UPF. It enables sensor self-localization using received signal strength indicator and actor position. The latter models actor mobility scheduling as traveling salesman problem and aims at fully localized network and minimized time delay. Navigated by sensors, the actor depth-first traverses a local minimum spanning tree of a connected 3-dominating set of the network. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Collaborative Colleagues:
|
||||||||||||||||||||||||||||||||||||||