In this paper we numerically analyze the impact of interferences on the probability of success of a localization algorithm. This problem is particularly relevant in the context of sensor networks. Actually, our numerical results are relevant even when we do not consider interferences. Moreover, our numerical computations show that the main harmful interferences are the ones occurring between sensors which get localized at the same time and send simultaneously their own location. This is demonstrated by varying the time span of the random waiting time before the emissions. We then observe that the longer the waiting time the closer the curves are to the ones obtained without interferences. Hence, this proves to be an efficient way of reducing the impact of interferences. Moreover, our numerical experiments demonstrate that among the sectors of disk with same area, the one with the smaller radius of emission and larger angle of emission is the more appropriate to the localization algorithm.
['Matthieu Bouget', 'Pierre Leone', 'José D. P. Rolim']
Numerical estimation of the impact of interferences on the localization problem in sensor networks