144
click to vote
INFOCOM
2009
IEEE
16 years 8 days ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...