Download now Free registration required
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 the authors' knowledge, the literature still lacks the design and evaluation of such an approach. In this paper, they introduce and analyze an agenda-based location service that reduces the overhead due to location updates. They evaluate the performance of their 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.
- Format: PDF
- Size: 171.8 KB