Design and Evaluation of an Agenda-Based Location Service

An interesting approach for the location service problem in wireless mesh networks is the one that relies on location agendas to model node displacements on an absolute time basis. To the best of our knowledge, the literature still lacks the design and evaluation of such an approach. In this paper, we introduce and analyze an agenda-based location service that reduces the overhead due to location updates. We evaluate the performance of our scheme with real mobility traces and observe that mobile nodes spend in average 80% of their time at a maximum distance of one hop from the expected locator. Furthermore, 81% of the location update messages are constrained within this radius. This drastically reduces the propagation areas when compared for instance with DHT-based approaches.