Author:
Huc Florian,Jarry Aubin,Leone Pierre,Rolim José
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference31 articles.
1. Improved routing strategies with succinct tables;Awerbuch;Journal of Algorithms,1990
2. AlgoSensim simulator. http://tcs.unige.ch/code/algosensim/overview.
3. I. Abraham, D. Malkhi, Compact routing on euclidian metrics, in: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC’04, pp. 141–149, 2004.
4. Y. Bartal, On approximating arbitrary metrices by tree metrics, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC’98, MSWiM, pp. 161–168, 1998.
5. A survey and comparison on localisation algorithms for wireless ad hoc networks;Biaz;International Journal of Mobile Communications,2005
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Every Schnyder drawing is a greedy embedding;Theoretical Computer Science;2020-02
2. Greedy Routing on Virtual Raw Anchor Coordinate (VRAC) System;2016 International Conference on Distributed Computing in Sensor Systems (DCOSS);2016-05
3. Geographic routing on Virtual Raw Anchor Coordinate systems;Theoretical Computer Science;2016-03