Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
HARTS: A Distributed Real-Time Architecture
Computer - Special issue on real-time systems
Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer
IEEE Transactions on Computers
Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
Mobile users: to update or not to update?
Wireless Networks
A path optimization signalling protocol for inter-switch handoff in wireless ATM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on wireless mobile ATM technologies
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Optimal dynamic mobility management for PCS networks
IEEE/ACM Transactions on Networking (TON)
Virtual tree-based multicast routing with a distributed numbering algorithm for WM-ATM handover
Mobile Networks and Applications
IEEE Transactions on Parallel and Distributed Systems
Cell identification codes for tracking mobile users
Wireless Networks
Location management in cellular networks
Handbook of wireless networks and mobile computing
Virtual Cellular Networks for Non-Uniformly Distributed Base Stations
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
High-Performance Computing on a Honeycomb Architecture
Proceedings of the Second International ACPC Conference on Parallel Computation
A Cell ID Assignment Scheme and Its Applications
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Connection Routing Schemes for Wireless ATM
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Location management methods for third generation mobile systems
IEEE Communications Magazine
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
Higher dimensional hexagonal networks
Journal of Parallel and Distributed Computing
Location management based on distance and direction for PCS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Group Construction Method with Applications to Deriving Pruned Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
Discrete Applied Mathematics
Journal of Computer and System Sciences
On minimum metric dimension of honeycomb networks
Journal of Discrete Algorithms
Locating mobile nodes using heuristics with fuzzy logic handoff
International Journal of Artificial Intelligence and Soft Computing
The incidence coloring numbers of meshes
Computers & Mathematics with Applications
Optimal routing algorithm and diameter in hexagonal torus networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks
Modelling and cost analysis of location management scheme for PCS networks
International Journal of Information and Communication Technology
An efficient metric-based (EM-B) location management scheme for wireless cellular networks
Journal of Network and Computer Applications
Resistance distances and the Kirchhoff index in Cayley graphs
Discrete Applied Mathematics
Further properties of cayley digraphs and their applications to interconnection networks
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
An Index-Based Location Management Scheme for PCS Network
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
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.