Section: New Results
Wireless Sensor Networks with Mobile Nodes
Participants : Xu Li, Nathalie Mitton, Isabelle Simplot-Ryl, David Simplot-Ryl.
We consider in this work sensor networks with mobile nodes. In [21] , 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 localiza- tion algorithm and an actor mobility scheduling algorithm. In [13] , we address the focused coverage problem, where sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has higher priority to be covered than a distant one. We improve the Greedy-Rotation-Greedy (GRG) that assumes an obstacle-free environment by adding a novel obstacle “penetration” technique and that gives the important obstacle avoidance capability. The new version of GRG is referred to as GRG/OP.
In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has higher priority to be covered than a distant one. A localized sensor self-deployment algorithm, named Greedy-Rotation-Greedy (GRG) [32] , has recently been proposed for constructing optimal focused coverage. The previous work assumed obstacle-free environment and focused on theoretical aspects. In [13] , we remove this strong assumption and extend GRG to practical settings. We equip with a novel obstacle “penetration” technique and give it the important obstacle avoidance capability. The new version of GRG is referred to as GRG/OP. Through simulation, we evaluate its performance in comparison with plain GRG.
In [21] , 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: an 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 for 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.
