This Article 
 Bibliographic References 
 Add to: 
Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks
September 2002 (vol. 13 no. 9)
pp. 963-971

Abstract—Nodes in a hexagonal network are placed at the vertices of a regular triangular tessellation, so that each node has up to six neighbors. The network is proposed as an alternative interconnection network to mesh connected computer (with nodes serving as processors) and is used also to model cellular networks where nodes are base stations. In this paper, we propose a suitable addressing scheme for nodes (with two variants), derive a formula for distance between nodes, and present a very simple and elegant routing algorithm. This addressing scheme and corresponding routing algorithm for hexagonal interconnection are considerably simpler than previously proposed solutions. We then apply the addressing scheme for solving two problems in cellular networks. With the new scheme, the distance between the new and old cell to which a mobile phone user is connected can be easily determined and coded with three integers, one of them being zero. Further, in order to minimize the wireless cost of tracking mobile users, we propose hexagonal cell identification codes containing three, four, or six bits, respectively, to implement a distance based tracking strategy. These schemes do not have errors in determining cell distance in existing hexagonal based cellular networks, which is not the case with recently proposed 3 bit cell identification codes based on an artificial square mesh placed over a hexagonal network (moreover, the existing mesh schemes fail to address the diagonal moves that may cause additional unrecoverable errors). Our schemes provide efficient implementation of distance and movement based tracking schemes in cellular networks, by providing information generally not available to the user, and means to manipulate it for accurate cell distance determination. Another application is for connection rerouting in cellular networks during a path extension process. In a path extension scheme, the path for ongoing calls is extended from the old base station to a new one using the link between neighboring base stations. If the path is extended several times due to mobility, our scheme provides an elegant way to reroute the connection from the latest base station to the base station of original connection and, therefore, minimize the length of extended path.

[1] A. Acharya, S. Biswas, L. French, J. Li, and D. Raychaudhuri, “Handoff and Location Management in Mobile ATM Networks,” Mobile Multimedia Comm., Goodman and Raychaudhuri, eds, pp. 75-82, 1997.
[2] P. Agrawal, E. Hyden, P. Kryzanowski, P. Mishra, M. Srivastava, and J.A. Trotter, “SWAN: A Mobile Multimedia Wireless Network,” IEEE Personal Comm. Magazine, Apr. 1996.
[3] 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, pp. 629-638, Aug. 1996.
[4] A. Bar-Nor, I. Kessler, and M. Sidi, “Mobile Users: To Update or Not to Update,” ACM-Baltzer Wireless Networks, vol. 1, no. 2, pp. 187-196, 1994.
[5] P. Bose and P. Morin, “Online Routing in Triangulations,” Proc. 10th Int'l Symp. Algorithms and Computation ISAAC'99, pp. 113-122, 1999.
[6] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 48-55, Aug. 1999.
[7] M.-S. Chen, K.G. Shin, and D.D. Kandlur, "Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors," IEEE Trans. Computers, vol. 39, no. 1, pp. 10-19, Jan. 1990.
[8] J. Carle and J.F. Myuopo, “Topological Properties and Optimal Routing Algorithms for Three Dimensional Hexagonal Networks,” Proc. High Performance Computing in the Asia-Pacific Region HPC-Asia, pp. 116-121, 2000.
[9] J.W. Dolter, P. Ramanathan, and K.G. Shin, "Performance Analysis of Message Passing in HARTS: A Hexagonal Mesh Multiprocessor," IEEE Trans. Computers, vol. 40, no. 6, pp. 669-680, June 1991.
[10] K.Y. Eng, M.J. Carol, M. Veeraraghavan, E. Ayanoglu, C.B. Goodworth, P. Pancha, and R.A. Valenzuela, “BAHAMA: A Broadband Ad-Hoc Wireless ATM Local-Area Network,” Proc. Int'l Computer Camp Conf., 1995.
[11] G.G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” ISI Research Report ISU/RR-87-180, Mar. 1987.
[12] G. Fan and J. Zhang, “Virtual Cellular Networks for Non-Uniformly Distributed Base Stations,” Proc. Int'l Conf. Parallel Processing, pp. 339-345, Sept. 2001.
[13] E. Kranakis, H. Singh, and J. Urrutia, “Compass Routing in Geometric Graphs,” Proc. 11th Canadian Conf. Computational Geometry (CCCG-99), pp. 51-54, 1999.
[14] J. Li, H. Kameda, and K. Li, “Optimal Dynamic Mobility Management for PCS Networks,” IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 319-327, June 2000.
[15] L.N. Laster and J. Sandor, “Computer Graphics on Hexagonal Grid,” Computer Graphics, vol. 8, pp. 401-409, 1984.
[16] V. Mocci and Y.F. Hu, “Virtual Tree-Based Multicast Routing with a Distributed Numbering Algorithm for WM-ATM Handover,” Mobile Networks and Applications 5, pp. 111-118, 2000.
[17] 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.
[18] C. Rose, “Minimizing the Average Cost of Paging and Registration: A Time-Based Method,” Wireless Networks, vol. 2, pp. 109-116, 1996.
[19] B. Robic and J. Silc, "High-Performance Computing on a Honeycomb Architecture," Proc. Second Int'l ACPC Parallel Computation Conf., pp. 22-28.Austria: Springer-Verlag, 1993.
[20] K.G. Shin, "HARTS: A Distributed Real-Time Architecture," Computer, vol. 24, no. 5, pp. 25-34, May 1991.
[21] I. Stojmenovic, “Honeycomb Networks: Topological Properties and Communication Algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 10, pp. 1036-1042, Oct. 1997.
[22] I. Stojmenovic, “Direct Interconnection Networks,” Parallel and Distributed Computing Handbook, A.Y. Zomaya, ed., pp. 537-567, 1996.
[23] I. Stojmenovic and X. Lin, “Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 1023-1032, Oct. 2001.
[24] S. Tabbane, “Location Management Methods for Third-Generation Mobile System,” IEEE Comm. Magazine, Aug. 1997.
[25] R. Tosic, D. Masulovic, I. Stojmenovic, J. Brunvoll, B.N. Cyvin, and S.J. Cyvin, “Enumeration of Polyhex Hydrocarbons up to h=17,” J. Chemical Information and Computer Sciences, vol. 35, pp. 181-187, 1995.
[26] U. Varshney, “Connection Routing Schemes for Wireless ATM to Support Mobile Computing,” Proc. IEEE Hawaii Int'l Conf. System Sciences (HICSS-32), 1999.
[27] W.S.V. Wong and V.C.M. Leung, “A Path Optimization Signaling Protocol for Inter-Switch Handoff in Wireless ATM Networks,” Computer Networks, vol. 31, pp. 975-984, 1999.
[28] V.W.-S. Wong and V.C.M. Leung, “Location Management for Next-Generation Personal Communications Networks,” IEEE Network Magazine, pp. 18-24, Sept./Oct. 2000.
[29] J. Zhang, Handbook of Wireless Networks and Mobile Computing. I. Stojmenovic, ed., pp. 27-49, Wiley, 2002.
[30] J. Zhang, “A Cell ID Assignment Scheme and Its Applications,” Proc. Workshop Wireless Networks and Mobile Computing, IEEE Int'l Conf. Parallel Processing, pp. 507-512, Aug. 2000.

Index Terms:
Cellular networks, hexagonal networks, routing, location management.
Fabian Garcia Nocetti, Ivan Stojmenovic, Jingyuan Zhang, "Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 963-971, Sept. 2002, doi:10.1109/TPDS.2002.1036069
Usage of this product signifies your acceptance of the Terms of Use.