| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Mobile-Beacon Assisted Sensor Localization with Dynamic Beacon Mobility Scheduling
Abstract : In mobile-beacon assisted sensor localization, beacon mobility scheduling aims to determine the best beacon trajectory so that each sensor receives sufficient beacon signals with minimum delay. We propose a novel DeteRministic bEAcon Mobility Scheduling (DREAMS) algorithm, without requiring any prior knowledge of the sensory field. In this algorithm, beacon trajectory is defined as the track of depth-first traversal (DFT) of the network graph, thus deterministic. The mobile beacon performs DFT under the instruction of nearby sensors on the fly. It moves from sensor to sensor in an intelligent heuristic manner according to RSS (Received Signal Strength)-based distance measurements. We prove that DREAMS guarantees full localization (every sensor is localized) when the measurements are noise-free. Then we suggest to apply node elimination and topology control (Local Minimum Spanning Tree) to shorten beacon tour and reduce delay. Through simulation we show that DREAMS guarantees full localization even with noisy distance measurements. We evaluate its performance on localization delay and communication overhead in comparison with a previously proposed static path based scheduling method.
Cited literature [20 references]
https://hal.inria.fr/inria-00609350
Contributor : Nathalie Mitton <>
Submitted on : Thursday, October 20, 2011 - 5:49:59 PM
Last modification on : Monday, June 28, 2021 - 3:00:04 PM
Long-term archiving on: : Monday, December 5, 2016 - 12:06:28 AM
Contributor : Nathalie Mitton <>
Submitted on : Thursday, October 20, 2011 - 5:49:59 PM
Last modification on : Monday, June 28, 2021 - 3:00:04 PM
Long-term archiving on: : Monday, December 5, 2016 - 12:06:28 AM
File
pathplanning-MASS.pdf
Files produced by the author(s)