Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks
Tóm tắt
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 a mesh connected computer (with nodes serving as processors) and is used also to model cellular networks where nodes are the 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. Another application is for connection rerouting in cellular networks during a path extension process.
Từ khóa
#Routing #Intelligent networks #Land mobile radio cellular systems #Base stations #Multiprocessor interconnection networks #Broadcasting #Computer networks #Mobile handsets #Costs #TrackingTài liệu tham khảo
10.1109/71.629486
stojmenovic, 1996, Direct Interconnection Networks, Parallel and Distributed Computing Handbook, 537
10.1109/2.76284
10.1021/ci00024a002
varshney, 1999, Connection Routing Schemes for Wireless ATM to Support Mobile Computing, Proc IEEE Hawaii Int'l Conf System Sciences (HICSS-32)
10.1109/71.963415
10.1109/35.606034
10.1002/0471224561.ch2
10.1016/S1389-1286(98)00007-3
10.1109/65.871336
10.1109/98.490750
10.1007/978-1-4899-0151-4_10
10.1007/BF01202540
10.1109/90.532871
10.1145/313239.313282
bose, 1999, Online Routing in Triangulations, Proc 10th Int'l Symp Algorithms and Computation ISAAC'99, 113
zhang, 2000, A Cell ID Assignment Scheme and Its Applications, Proc Workshop Wireless Networks and Mobile Computing IEEE Int'l Conf Parallel Processing, 507
10.1109/ICC.1995.524294
finn, 1987, Routing and Addressing Problems in Large Metropolitan-Scale Internetworks, 10.21236/ADA180187
10.1109/ICPP.2001.952079
10.1109/12.90246
kranakis, 1999, Compass Routing in Geometric Graphs, Proc 11th Canadian Conf Computational Geometry (CCCG-99), 51
10.1109/90.851978
10.1109/12.46277
10.1109/HPC.2000.846530
10.1016/0097-8493(84)90038-4
10.1023/A:1019192008674
10.1109/INFCOM.1999.749249
10.1007/BF01225634
10.1007/3-540-57314-3_1