Résumé
In wireless sensor networks, almost all geographic routing algorithms assume that sensors are accurately located. In this paper, we propose an Energy Efficient Geographic Routing algorithm (EEG-Routing). In our method, before the deployment of sensors in their environment, sensor positions are known with position error bounds which are potentially larges. According to this knowledge, it is possible to compute, before the deployment the probability that two sensors communicate. EEG-Routing introduces a new metric which defines, regarding to communication probabilities, energy consumptions and realized progress, communication costs between neighbors. EEG-Routing simultaneously optimizes two criteria: the energy consumption and the delivery rate, in networks where sensors are inaccurately located. Performances are validated by simulations which compare EEG-Routing with an energy-optimal algorithm.