On geographic routing without location information

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2004, Pages 4764-4769

  Jadbabaie, Ali ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; GLOBAL POSITIONING SYSTEM; GRAPH THEORY; MATRIX ALGEBRA; TELECOMMUNICATION NETWORKS; TOPOLOGY;

DISTRIBUTED COORDINATION ALGORITHMS; GEOGRAPHIC ROUTING; LOCATION INFORMATION; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 14544297962     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1429543     Document Type: Conference Paper

References (17)

1. R. B. Bapat. Resistance distance in graphs. Mathematics Student, 68:87-98, 1999.
2. A. Berman and R. J. Plemmons. Nonnegative matrices in the mathematical sciences. Number 9 in Classics in Applied Mathematics. SIAM, Philadelphia, second edition, 1994.
3. P. Yu. Chebotarev and E. V. Shamis. On proximity measures for eraph matrices. Automation and Remote Control, 59:1443-1459, 1998.
4. D. S. J. De Couto and R. Morris. Location proxies and intermediate node forwarding for practical geographic forwarding. Technical Report MIT LCS-TR-824, MIT Laboratory for Computer Science, 2001.
5. M. Fiedler. Some characteristics of symetric inverse M-matrices. Linear Algebra and its Applications, 275-276:179-187, 1998.
6. C. Godsil and G. Royle. Algebraic Graph Theory. Springer Graduate Texts in Mathematics # 207, New York, 2001.
7. R. Horn and C. Johnson. Matrix Analysis. Cambdidge University Press, 1985, reprinted 1996.
8. A. Jadbabaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6):988-1001, June 2003.
9. David B. Johnson. Scalable and robust internetwork routing for mobile hosts. In Proceedings of the 14th International Conference on Distributed Computing Systems, pages 2-11, June 1994.
10. David B. Johnson and David A. Maltz. Mobile computing, chapter The dynamic source routing protocol in ad hoc wireless networks, pages 153-181. Kluwer, 1996.
11. D. J. Klein and H. Y. Zhu. Distances and volumina for graphs. Journal of Mathematical Chemistry, 23:179-195, 1998.
12. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: of tehory and practice. In Principles of Distributed Computing, 2003.
13. N. Linial, L. Lovasz, and A Wigderson. Rubber bands, convex embeddings and graph connectivity. Combinatorica, 8:91-102, 1988.
14. R. Merris. Doubly stochastic graph matrices, ii. Linear and Multilinear Algebra, 45:275-285, 1998.
15. S. J. Kirkland M. Neumann and B. L. Shader. Distances in weighted trees and group inverse of Laplacian matrix. SIAM Journal of Matrix Analysis and Applications, 18:827-841, 1997.
16. Charles Perkins and pravin Bhagwat. Highly dynamic destination-sequenced distance vector routing for mobile computers. In Proceedings of ACM SIGCOMM 94, pages 234-244, 1994.
17. A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. In Proceedings of MobiCom '03, 2003.