Addressing, distances and routing in triangular systems with applications in cellular and sensor networks

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 2977-2984

  Chepoi, Victor ^a   Dragan, Feodor ^b   Vaxès, Yann ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLULAR RADIO SYSTEMS; INTERCONNECTION NETWORKS; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS;

ISOMETRIC EMBEDDING; SENSOR NETWORKS; SUBGRAPHS; TRIANGULAR SYSTEMS;

COMPUTER NETWORKS;

EID: 12444295468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. I.F. Akyildiz, J.S.M. Ho, and Y.B. Lin, Movement-based location update and selective paging for PCS networks, IEEE/ACM Trans. Networking, vol. 4, no. 4, pp. 629-638, Aug. 1996.
2. A. Bar-Noy, I. Kessler, and M. Sidi, Mobile users: to update or not to update, Wireless Networks, vol. 1, no. 2, pp. 175-185, 1994.
3. V. Chepoi, On distances in benzenoid systems, J. Chemical Information and Computer Sciences vol. 36, pp. 1169-1172, 1996.
4. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz, Distance labeling in graphs, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), January 7-9, 2001, Washington, DC, USA, ACM-SIAM, pp. 210-219, 2001.
5. A.J. Goldman, Optimal center location in simple networks, Transportation Science, vol. 5, pp. 212-221, 1971.
6. D. Harel, R. Tarjan, Fast algorithms for finding nearest common ancestor, SIAM J. Comput., vol. 13, pp. 338-355, 1984.
7. J. Li, H. Kameda, and K. Li, Optimal dynamic location update for PCS networks, IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 319-327, 2000.
8. Z. Naor, H. Levy, and U. Zwick, Cell identification codes for tracking mobile users, Proc. INFOCOM 1999, pp. 28-35, 1999, also available in Wireless Networks, vol. 8, no. 1, pp. 73-84, 2002.
9. Z. Naor, H. Levy, and U. Zwick, Cell identification codes for tracking mobile users, Proc. INFOCOM 1999, pp. 28-35, 1999, also available in Wireless Networks, vol. 8, no. 1, pp. 73-84, 2002.
10. F.G. Nocetti, I. Stojmenovic, and J. Zhang, Addressing and routing in hexagonal network with application for tracking mobile users and connection rerouting in cellular networks, IEEE Trans. on Parallel and Distributed Systems, vol. 13, no. 9, pp. 963-971, 2002.
11. D. Peleg, Proximity-preserving labeling schemes and their applications, in Proceedings of the 25th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '99), Ascona, Switzerland, June 17-19, 1999, Lecture Notes in Computer Science 1665, Springer, pp. 3041, 1999.
12. D. Peleg, Proximity-preserving labeling schemes and their applications, in Proceedings of the 25th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '99), Ascona, Switzerland, June 17-19, 1999, Lecture Notes in Computer Science 1665, Springer, pp. 3041, 1999.
13. D. Peleg, Informative labeling schemes for graphs, in Proceedings of the 25th International Symposium "Mathematical Foundations of Computer Science" (MFCS 2000), Bratislava, Slovakia, August 28 - September 1, 2000, Lecture Notes in Computer Science 1893, Springer, pp. 579-588, 2000.
14. D. Peleg, Informative labeling schemes for graphs, in Proceedings of the 25th International Symposium "Mathematical Foundations of Computer Science" (MFCS 2000), Bratislava, Slovakia, August 28 - September 1, 2000, Lecture Notes in Computer Science 1893, Springer, pp. 579-588, 2000.
15. D. Peleg, Distributed Computing - A Locality-Sensitive Approach, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2000.
16. M. Thorup, U. Zwick, Compact routing schemes, in Proc. 13th Ann. ACM Symp. on Par. Alg. and Arch. (SPAA 2001), ACM, pp. 1-10, 2001.