Group Behavior Impact on an Opportunistic Localization Scheme

Accepté pour publication.International audienceIn this paper we tackled the localization problem from an opportunistic perspective, according to which a node can infer its own spatial position by exchanging data with passing by nodes, called peers. We consider an opportunistic localization algorithm based on the linear matrix inequality (LMI) method coupled with a weighted barycenter algorithm. This scheme has been previously analyzed in scenarios with random deployment of peers, proving its effectiveness. In this paper, we extend the analysis by considering more realistic mobility models for peer nodes. More specifically, we consider two mobility models, namely the Group Random Waypoint Mobility Model and the Group Random Pedestrian Mobility Model, which is an improvement of the first one. Hence, we analyze by simulation the opportunistic localization algorithm for both the models, in order to gain insights on the impact of nodes mobility pattern onto the localization performance. The simulation results show that the mobility model has non-negligible effect on the final localization error, though the performance of the opportunistic localization scheme remains acceptable in all the considered scenarios