Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Greedy geographic routing has been considered as an attractive approach due to its simplicity and scalability. However, greedy routing is insufficient in terms of routing convergence because of the local maximum problem. In this letter, we propose a novel greedy routing scheme based on a potential field method that dynamically eliminates the local maximum condition. © 2007 IEEE.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine