An alternative Routing algorithm for hex-Cell network (original) (raw)
Related papers
New Routing Algorithm for Hex-Cell Network
International Journal of Future Generation Communication and Networking, 2015
Hex-Cell network is one of modern interconnection networks in which the nodes are connected with each other in hexagonal topology. This topology gives its network an attractive characteristic represented by expandability due toits recursive structure. In this paper a new routing algorithm for Hex-Cell network is developed depending on new addressing mode.According to this mode, each node in the Hex-Cell is identified by its level and the node number in that level.Consequently, there is no need to readdress the nodes when extra level or levels are added to the topology.Several experiments were conducted to evaluate the proposed algorithm and compare it with other routing algorithms. The results showed the superiority of the new routing algorithm over the other routing algorithms for Hex-Cell in terms of execution time.
Section Based Hex-Cell Routing ALGORITHM (SBHCR)
International journal of Computer Networks & Communications, 2015
A Hex-Cell network topology can be constructed using units of hexagon cells. It has been introduced in the literature as interconnection network suitable for large parallel computers, which can connect large number of nodes with three links per node. Although this topology exhibits attractive characteristics such as embeddability, symmetry, regularity, strong resilience, and simple routing, the previously suggested routing algorithms suffer from the high number of logical operations and the need for readdressing of nodes every time a new level is add to the network. This negatively impacts the performance of the network as it increases the execution time of these algorithms. In this paper we propose an improved optimal point to point routing algorithm for Hex-Cell network. The algorithm is based on dividing the Hex-Cell topology into six divisions, hence the name Section Based Hex-Cell Routing (SBHCR). The SBHCR algorithm is simple and preserves the advantage of the addressing scheme proposed for the Hex-Cell network. It does not depend on the depth of the network topology which leads to overcome the issue of readdressing of nodes every time a new level is added. Evaluation against two previously suggested routing algorithms has shown the superiority of SBHCR in term of less logical operations.
Hex-Cell: modeling, topological properties and routing algorithm
2008
This paper introduces a new class of interconnection networks referred to as Hex-Cell. Amongst the attractive features of the proposed topology is the embedding capability of topological structures such as linear array, ring, tree and mesh. Hex-cell employs an efficient routing algorithm which requires less knowledge of the network interconnections and brings about less communication cost. These features make it a suitable candidate for general purpose applications. Hex-Cell is expandable in an incremental fashion with minimal cost due to its recursive structure. The comparison of Hex-Cell with other networks of interests in terms of degree, diameter, and network-cost establishes merits when compared with others.
A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks
International Journal of Information Systems and Social Change, 2017
The Hyper Hexa-Cell topology; HHC for short; is a new interconnection network topology that has many attractive topological properties compared to other traditional topologies. There have been a number of studies in the literature on the HHC to explore the promising topological properties of this topology. Furthermore, other studies extend this topology by combining it with OTIS technology to produce a new version called OHHC. We have found that there is a lake of presenting any point to point routing algorithm for the HHC, although there were some efforts on building routing algorithms for the OHHC. To cover this shortage, this paper introduces a new unicast routing algorithm for the HHC. The new routing algorithm for the HHC uses store-and-forward technique which allows a message to be transmitted through a path from the source node to the destination node. In addition to presenting the routing algorithm, we present an example to explore the algorithm steps and also an enhancement...
HEX Clustering Protocol for Routing in Wireless Sensor Network
To overcome energy hole problem unequal clustering structures have been proposed for the aim of network stability. Energy hole avoidance remains as a challenging problem. Hexagons are an ideal shape for uniform random deployment of nodes in Wireless Sensor Networks (WSN), because clusters areas are seamlessly divided by the hexagons. In addition, regular hexagons have largest coverage area and covers networks area without overlapping. In this paper, we design simple but effective scheme HEX for dividing network area into hexagonal cluster/ cell where sensors are distributed uniformly throughout the cell and introduced concept of physical clustering. Our results show that proposed technique yields the network stability period, lifetime and throughput by saving overall power consumption of a cluster. Furthermore, confidence interval and packets dropped across the link is also calculated using uniform random model.
Int'l J. of Communications, Network and System Sciences, 2011
Scalability is an important issue in the design of interconnection networks for massively parallel systems. In this paper a scalable class of interconnection network of Hex-Cell for massively parallel systems is introduced. It is called Multilayer Hex-Cell (MLH). A node addressing scheme and routing algorithm are also presented and discussed. An interesting feature of the proposed MLH is that it maintains a constant network degree regardless of the increase in the network size degree which facilitates modularity in building blocks of scalable systems. The new addressing node scheme makes the proposed routing algorithm simple and efficient in terms of that it needs a minimum number of calculations to reach the destination node. Moreover, the diameter of the proposed MLH is less than Hex-Cell network.
WICI: an efficient hybrid routing scheme for scalable and hierarchical networks
IEEE Transactions on Computers, 1996
Many recent supercomputers employ either a cluster-based design or a highly scalable network. Clustering is built-in in a hierarchical system, while highly scalable networks like mesh or torus could be easily partitioned into modules to form several clusters. This paper first specifies a self-routing connection method in a recently introduced class of hierarchical topology called de Bruijn-Cube (dBCube) network, and presents a deadlock-free routing scheme using virtual channels. A new switching method called Wormhole lntraclusfer Cuf-through lntercluster (WE!, routing is also introduced to improve the network performance fairly close to the virtual cut-through and to maintain the buffer cost as compared to prevalent routing schemes of wormhole. Usefulness of WICI routing has been demonstrated for the hierarchical network of dBCube and large networks like mesh and torus, and simulation results for WlCl routing are compared with wormhole and virtual cut-through routings.
Higher dimensional hexagonal networks
Journal of Parallel and Distributed Computing, 2003
We define the higher dimensional hexagonal graphs as the generalization of a triangular plane tessellation, and consider it as a multiprocessor interconnection network. Nodes in a k-dimensional (k-D) hexagonal network are placed at the vertices of a k-D triangular tessellation, so that each node has up to 2k þ 2 neighbors. In this paper, we propose a simple addressing scheme for the nodes, which leads to a straightforward formula for computing the distance between nodes and a very simple and elegant routing algorithm. The number of shortest paths between any two nodes and their description are also provided in this paper. We then derive closed formulas for the surface area (volume) of these networks, which are defined as the number of nodes located at a given distance (up to a given distance, respectively) from the origin node. The number of nodes and the network diameter under a more symmetrical border conditions are also derived. We show that a k-D hexagonal network of size t has the same degree, the same or lower diameter, and fewer nodes than a ðk þ 1Þ-D mesh of size t. Simple embeddings between two networks are also described. That is, we show how to reduce the dimension of a mesh by removing some nodes, and converting it into a hexagonal network, while preserving the simplicity of basic data communication schemes such as routing and broadcasting.
CLUSTER BASED ROUTING MECHANISM FOR OPTIMIZED DATA DISTRIBUTION IN MOBILE COMPUTING
Data distribution in mobile computing network is an increasingly attractive mechanism for communication with remote, non-fixed or mobile devices. Wireless technology enhancement makes possible to collect and distribute data virtually anywhere regardless location of the user in efficient and reliable manner. However, the frequency of transmission and amount of data sent in each exchange can have significant time, cost, and reliability and performance impact on Mobile computing network. In mobile computing network users can keep the information handy and also dynamic access to the application by using mobile devices i.e. Smart phones, palmtop, laptop and tablets. An application distributes data on various processing units in mobile computing network to process by using a routing mechanism. An optimize data distribution is required among the mobile computing network devices in order to enhance the performance. To achieve optimal data distribution an efficient a routing technique proposes here through this research paper. The performance of a mobile computing network is depends on employed routing technique by the network and it also plays a significant role to improve the performance in Mobile computing network. In mobile computing network multiple data route exists for data transmission and data distributes on processing units through the most feasible route in order to achieve minimum transmission cost, time and maximum reliability. This research paper demonstrates a routing technique with the help of clusters to distribute data packets among the devices within the mobile computing network.