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

Wireless Networks

Volumn 12, Issue 6, 2006, Pages 671-679

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

^a AIX MARSEILLE UNIVERSITY   (France)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Cell distance; Cell identification code; Cellular networks; Location management; Routing; Triangular systems

Indexed keywords

CELL DISTANCE; CELL IDENTIFICATION CODE; CELLULAR NETWORKS; LOCATION MANAGEMENT; ROUTING; TRIANGULAR SYSTEMS;

CIRCUIT THEORY; ELECTRONIC CIRCUIT TRACKING; EMBEDDED SYSTEMS; INFORMATION THEORY; PROBLEM SOLVING; RADIO STATIONS;

CELLULAR NEURAL NETWORKS;

EID: 33749590017     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-006-6527-0     Document Type: Article

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 4(4) (1996) 629-638.
2. A. Bar-Noy, I. Kessler and M. Sidi, Mobile users: To update or not to update, Wireless Networks 1(2) (1994) 175-185.
3. V. Chepoi, On distances in benzenoid systems, J. Chemical Information and Computer Sciences 36 (1996) 1169-1172.
4. V. Chepoi, F.F. Dragan and Y. Vaxès, Distance and routing labeling schemes for non-positively curved plane graphs, to appear in J. of Algorithms.
5. V. Chepoi, F.F. Dragan and Y. Vaxès, Distance-based location update and routing in irregular cellular networks, in Proceedings of the IstACIS International Workshop on Self-Assembling Wireless Networks (SAWN 2005), (May 23-25, 2005), (Towson University, Maryland, USA, IEEE, 2005) pp. 380-387.
6. 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, 2001) pp. 210-219.
7. A.J. Goldman, Optimal center location in simple networks, Transportation Science 5 (1971) 212-221.
8. D. Harel, R. Tarjan, Fast algorithms for rinding nearest common ancestor, SIAM J. Comput. 13 (1984) 338-355.
9. J. Li, H. Kameda and K. Li, Optimal dynamic location update for PCS networks, IEEE/ACM Trans. Networking 8(3) (2000) 319-327.
10. Z. Naor, H. Levy and U. Zwick, Cell identification codes for tracking mobile users, Proc. INFOCOM 1999, pp. 28-35, 1999.
11. also available in Wireless Networks 8(1) (2002) 73-84.
12. 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 13(9) (2002) 963-971.
13. 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, 1999) pp. 30-41.
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, 2000) pp. 579-588.
15. D. Peleg, Distributed Computing - A Locality-Sensitive Approach, (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2000).
16. M. Thorup and U. Zwick, Compact routing schemes, in Proc. 13th Ann. ACM Symp. on Par. Alg. and Arch. (SPAA 2001), ACM, (2001) pp. 1-10.